Search results for " graph"
showing 10 items of 1277 documents
An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming
2020
Abstract Linear Genetic Programming (LGP) represents programs as sequences of instructions and has a Directed Acyclic Graph (DAG) dataflow. The results of instructions are stored in registers that can be used as arguments by other instructions. Instructions that are disconnected from the main part of the program are called noneffective instructions, or structural introns. They also appear in other DAG-based GP approaches like Cartesian Genetic Programming (CGP). This article studies four hypotheses on the role of structural introns: noneffective instructions (1) serve as evolutionary memory, where evolved information is stored and later used in search, (2) preserve population diversity, (3)…
JaxoDraw: A graphical user interface for drawing Feynman diagrams
2019
Abstract JaxoDraw is a Feynman graph plotting tool written in Java. It has a complete graphical user interface that allows all actions to be carried out via mouse click-and-drag operations in a WYSIWYG fashion. Graphs may be exported to postscript/EPS format and can be saved in XML files to be used for later sessions. One of JaxoDraw's main features is the possibility to create code that may be used to generate graphics output, thus combining the powers of with those of a modern day drawing ... Title of program: JaxoDraw Catalogue Id: ADUA_v1_0 Nature of problem Existing methods for drawing Feynman diagrams usually require some "hard-coding" in one or other programming or scripting language…
Efficient estimation of tuned liquid column damper inerter (TLCDI) parameters for seismic control of base‐isolated structures
2022
This paper presents an enhanced base-isolation (BI) system equipped with a novel passive control device composed of a tuned liquid damper and an inerter (TLCDI). With the aim of reducing the seismic response of BI systems, this contribution focuses on the design of the TLCDI providing analytical solutions for the optimal TLCDI parameters, easily implementable in the design phase. The effectiveness of the proposed approach in terms of seismic response reduction and computational gain is validated by comparison with classical numerical optimization techniques. The control performance of two different base-isolated TLCDI-controlled structures is assessed by employing real-ground motion records…
Efficiently using connectivity information between triangles in a mesh for real-time rendering
2004
Triangle meshes are the most popular standard model used to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphics system. Taking advantage of the connectivity information between the triangles in a mesh dramatically diminishes the amount of information the graphics system must handle. Multiresolution Triangle Strips (MTS) represent a triangle mesh as a collection of multiresolution triangles strips. These strips are the basis of both the storage and the rendering stage. The coherence between the extraction of two levels of detail is used in the model in order to decrease the visualisation time.
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
Modular Strategies for Recursive Game Graphs
2006
AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…
Topology of synaptic connectivity constrains neuronal stimulus representation, predicting two complementary coding strategies
2022
In motor-related brain regions, movement intention has been successfully decoded from in-vivo spike train by isolating a lower-dimension manifold that the high-dimensional spiking activity is constrained to. The mechanism enforcing this constraint remains unclear, although it has been hypothesized to be implemented by the connectivity of the sampled neurons. We test this idea and explore the interactions between local synaptic connectivity and its ability to encode information in a lower dimensional manifold through simulations of a detailed microcircuit model with realistic sources of noise. We confirm that even in isolation such a model can encode the identity of different stimuli in a lo…
Extended constrained deformations: a new sculpturing tool
1999
Modelling tools tend to virtual sculpturing, in which a basic object is deformed by user supplied actions. The model we present aims to be generic: whatever the geometric description of the object, we can deform it to satisfy location constraints. Our model deforms the whole space, the image of a point is a blend of deformation functions with a projection matrix which allows the satisfaction of the constraints. The user can define the extent of the deformation (i.e. the part of the object to be deformed), the shape of the deformation function to create profiles and the displacement of the constraint points to be satisfied.
V I G — A Visual and Dynamic Decision Support System for Multiple Objective Linear Programming
1989
In this paper we describe the principles of VIG (Visual Interactive Goal Programming), a Multiple Criteria Decision Support System, recently developed by Korhonen. PARETO RACE is a corner-stone of this system, which is designed to support both the modelling and solving of a multiple objective linear programming problem. The interface is based on one main menu, spreadsheets, and interactive use of computer graphics. VIG provides the decision-maker with the possibility to approach his/her decision problem by using an “evolutionary approach”. This means that the decision-maker does not have to specify the model precisely prior to solving the problem. In fact, the model evolves progressively. W…