PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Supporting Product Modelling with “GraphTool”
Palacz w., Paszyńska A., Ślusarczyk G., Strug B., Grabska E.
Machine Dynamics Research
|
2017
|
Vol. 41, No. 4
135--147
EN
This paper presents the GraphTool system which supports all steps required to define graph grammars and to control their application. It provides graphical editors for graphs, graph transformation rules, and control diagrams. The considered graph grammars are based on different types of graphs (composite graphs, hierarchical graphs, hypergraphs and hierarchical hypergraphs) which can be labelled and attributed. In this tool, the standard approach to graphs and graph grammars is extended to graph grammar systems and graphs with layers. Adding layers allows the user to model graph structures composed of disjoint substructures, while adopting grammar systems allows for defining groups of grammars working together in a single derivation process. Graph structures obtained as the result of the graph derivations are used as knowledge representation in different application fields. This paper shows the versatility of GraphTool by presenting examples of its use in four different areas: computational grids, computer game states, Finite Element Method computations and architectural designs.
2
Content available remote Using Similarity of Graphs in Evaluation of Designs
Strug B.
Machine Dynamics Research
|
2015
|
Vol. 39, No. 1
103-113
EN
This paper deals with evaluating design on the basis of their internal structures in the form of graphs. A set containing graphs representing solutions of similar design tasks is used to search for frequently occurring subgraphs. On the basis of the results of the search the quality of new solutions is evaluated. Moreover the common subgraphs found are considered to be design patterns characterizing a given design task solutions. The paper presents the generic concept of such an approach as well as illustratesit by the small example of floor layout design.
3
Content available Using a graph grammar system in the finite element method
Strug B., Paszyńska A., Paszyński M., Grabska E.
International Journal of Applied Mathematics and Computer Science
|
2013
|
Vol. 23, no. 4
839--853
EN
The paper presents a system of Composite Graph Grammars (CGGs)modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element nodes and perform h- and p-adaptations. The CGG system is illustrated with an example from the domain of geophysics.
4
Content available remote Finding an iterated function systems based representation for complex visual structures using an evolutionary algorithm
Bielecki A., Strug B.
Machine Graphics and Vision
|
2007
|
Vol. 16, No. 1/2
171-189
EN
This paper presents an approach to the IFS inverse problem based on evolutionary computations. Having a bitmap image, we look for a set of functions that can reproduce a good approximation of a given image. A method using a variable number of mappings is proposed. A number of different crossover operators is described and tested. The possibility of enriching evolutionary algorithms by a specific type mechanism characteristic for replication of influenza viruses is discussed. The genetic material of the influenza type A virus consists of eight separate segments. In some types of tasks, such a structure of a genome can be more adequate than representation that consists of one sequence only. If influenza virus strains infect the same cell, then their RNA segments can mix freely, producing progeny viruses which represents the reasortment mechanism. Furthermore, mistakes leading to new mutations are common. The structure of problems for which such viral reproduction mechanisms can be effective are analyzed. The paper ends with some experimental results showing the images we were able to generate with the proposed method. The preliminary experimental results suggest that the introduction of the reasortment operator results in achieving satisfactory images in a smaller number of generations.
5
Content available remote A framework for an L-systems based evolutionary model for structure design and representation
Strug B.
Image Processing & Communications
|
2003
|
Vol. 9, no 3-4
71-79
EN
This paper deals with the possibilities of applying evolutionary methods and L-systems in computer aided structure design. An evolutionary process that involves the evolution of both the individuals produced by an L-system and the L-system itself is described. The modified standard genetic operators are presented as well as the number of operators specific for L-systems is defined. The presented theory is illustrated by examples from the domain of plant structures generation. The L-system as the model for structure representation is also described.
6
Content available remote Re-creating Mondrian's style by artificial evolution
Nikodem P., Strug B.
Machine Graphics and Vision
|
2000
|
Vol. 9, No. 4
867-875
EN
Genetic algorithms (GA) have become a popular computational aproach in computer arts. A brief overview of the field of evolutionary art is sketched. An implementation of this technique intended to generate 2D images following the style of a well-known Dutch geometric painter, Piet Mondrain, is also presented in this paper.
7
Content available remote Graph grammars and evolutionary methods in graphic design
Hliniak G., Strug B.
Machine Graphics and Vision
|
2000
|
Vol. 9, No. 1/2
5-13
EN
A new approach to image generation being a combination of evolutionary methods and graph grammars is presented. Usually genetic algorithms operate on binary strings. We propose here to use composition graphs as genotypes representing structures of designed objects. Hence, a graph grammar combined with genetic operators constitutes a tool for creating images being phenotypes corresponding to generated graphs. A modified genetic algorithm which uses the graph representation and the graph grammar is described.
8
Content available remote Application of attributed graph grammars to the synthesis of visual models of plants
Strug B.
Machine Graphics and Vision
|
1999
|
Vol. 8, No. 2
213-229
EN
Over the last years a rapid development of modelling and visualization methods of biological structures has taken place. In this paper I propose a method based on graph grammars. A method of modelling as well as of visualization is described. The implementation of this method is also presented. The implementation and a number of examples are shown for the selected case of two families of cactuses.
9
Content available remote Designing Aalto lamps by means of attributed graph grammars
Grabska E., Gurba M., Strug B.
Machine Graphics and Vision
|
1998
|
Vol. 7, No. 1/2
335-343
EN
his paper concerns whit computer aided design. Design process in illustrated by means of designing lamps in the framework of graph transformations. The theoretical concepts are implemened and examples of designed artifacts are presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.