Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  hierarchical graphs
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”
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 Metody i algorytmy obszarowego sterowania ruchem drogowym
PL
W artykule przedstawiono wybrane metody obszarowego sterowania ruchem drogowym oraz opisano niektóre ze sposobów zapisu algorytmów srd. Dla rzeczywistego obszaru miasta zaprezentowano algorytm sterowania ruchem, utworzony z wykorzystaniem wspomagania komputerowego. Do specyfikacji algorytmu wykorzystano grafy przejść automatów skończonych, w tym grafy hierarchiczne. Opracowane algorytmy sterowania obszarowego zostały wyspecyfikowane w edytorze FSM, pozwalającym na weryfikację poprawności działania algorytmu w trybie funkcjonalnej symulacji komputerowej. Przytoczono wyniki specyfikacji i weryfikacji opracowanych algorytmów, oraz ich implementacji w programowalnych strukturach logicznych FPGA.
EN
The article presents selected methods of area traffic control and describes some ways to record traffic control algorithms. A traffic control algorithm for a real city area is presented, using computer aided methods. Access graphs of finite automata, including hierarchical graphs have been used to specify the algorithm. Developed area traffic control algorithms have been specified in a FMS editor that allows to verify the correctness of the algorithm in a given functional computer simulation mode. The results of the specification and verification for developed algorithms and their implementations in FPGA devices have been quoted.
PL
W artykule zaprezentowano mechanizm tworzenia algorytmów sterowania ruchem drogowym w wybranym obszarze miasta z wykorzystaniem wspomagania komputerowego. W specyfikacji tych algorytmów wykorzystano grafy przejść automatów skończonych, w tym grafów hierarchicznych. Opracowane algorytmy adaptacyjnego sterowania obszarowego zostały wyspecyfikowane w edytorze FSM, pozwalającym na weryfikację poprawności działania algorytmu w trybie funkcjonalnej symulacji komputerowej. Przytoczono wyniki specyfikacji i weryfikacji opracowanych algorytmów, oraz ich implementacji w programowalnych strukturach logicznych FPGA.
EN
The article presents a mechanism of creating algorithms of traffic control in a selected area of the city with the use of computer support. In the specification of these algorithms transition graphs of finite state machines have been used, including hierarchical graphs. Designed algorithms of adaptive area control have been specified in FSM editor, which allows verification of correctness of algorithm operation in the mode of functional computer simulation. Results of specification and verification of the designed algorithms have been quoted, as well as their implementation in programmable logic FPGA structures.
4
Content available remote On Applying Model-Driven Engineering in Conceptual Design
EN
It is shown how decision support tools in the domain of conceptual design in architecture can be efficiently developed within the paradigm of Model-Driven Engineering (MDE). A prototype software is presented that allows the user to specify functional requirements for the designed building and then to map them onto certain subspaces. Hierarchical graphs and graph grammars serve as a knowledge representation tool. The final result is a 3D-view of the designed object coded automatically in the VRML and available on the screen. Hiding technicalities behind intuitive GUI we are able to win the interest of the designer and to convince him or her that the proposed tool increases productivity and creativity in the conceptual design phase.
5
Content available remote Representing design odeas with hierarchical graph diagrams
EN
Graphs are often used as formal models for representing design ideas. Models based on hierarchical graphs are needed in order to conveniently represent the structures of real-life objects. This paper presents a proposal of a design system which used hierarchical graphs transformation rules to automative the process of generating graph diagrams.
6
Content available remote Hierarchical graphs in creative design
EN
This paper is concerned with computational aspects of creative design. We propose a new representation of artifacts' structures: hierarchical graphs. This type of graphs enables to define a gluing operation. The proposed operation is illustrated by an example of designing gardens.
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ć.