Undirected graph algebra application for formalization description of information flows
The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is descr...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 240 |
|---|---|
| container_issue | |
| container_start_page | 235 |
| container_title | |
| container_volume | |
| creator | Hajder, Miroslaw Kolbusz, Janusz Bartczak, Tomasz |
| description | The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is described by an algebraic expression, on which can be carried out various activities to determine or change its properties, for example, by creating a new network structure. The study demonstrated basic algebra, as well as showing its use to describe a popular network topology and computer systems. |
| doi_str_mv | 10.1109/HSI.2013.6577829 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6577829</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6577829</ieee_id><sourcerecordid>6577829</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-fedde824c5ab409dd5d7127d72d949ca8ddb058e8ffce091e7bc7a7b21cd944b3</originalsourceid><addsrcrecordid>eNpVUMtKw0AUHVHBUrMX3OQHEufOIzOzlKK2UHChxWWZx506kiZhEhD9erXtxsXh3PPgLg4hN0BrAGruli-rmlHgdSOV0syckcIoDaJRXDa8Uef_tKQXZMZA6oox0VyRYhw_KKUctDYMZuRt04WU0U8Yyl22w3tp2x26bEs7DG3ydkp9V8Y-_2Fv2_R9dAKOPqfhcPexTN0hPpbb_nO8JpfRtiMWJ56TzePD62JZrZ-fVov7dZVAyamKGAJqJry0TlATggwKmAqKBSOMtzoER6VGHaNHagCV88oqx8D_FoTjc3J7_JsQcTvktLf5a3uahv8A93BXzg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Undirected graph algebra application for formalization description of information flows</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hajder, Miroslaw ; Kolbusz, Janusz ; Bartczak, Tomasz</creator><creatorcontrib>Hajder, Miroslaw ; Kolbusz, Janusz ; Bartczak, Tomasz</creatorcontrib><description>The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is described by an algebraic expression, on which can be carried out various activities to determine or change its properties, for example, by creating a new network structure. The study demonstrated basic algebra, as well as showing its use to describe a popular network topology and computer systems.</description><identifier>ISSN: 2158-2246</identifier><identifier>ISBN: 9781467356350</identifier><identifier>ISBN: 1467356352</identifier><identifier>EISBN: 9781467356367</identifier><identifier>EISBN: 1467356379</identifier><identifier>EISBN: 1467356360</identifier><identifier>EISBN: 9781467356374</identifier><identifier>DOI: 10.1109/HSI.2013.6577829</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algebra ; Client-server systems ; complexity design ; Corporate acquisitions ; Finite element analysis ; human-system interface ; information systems design ; Network topology ; Solid modeling ; Topology</subject><ispartof>2013 6th International Conference on Human System Interactions (HSI), 2013, p.235-240</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6577829$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6577829$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hajder, Miroslaw</creatorcontrib><creatorcontrib>Kolbusz, Janusz</creatorcontrib><creatorcontrib>Bartczak, Tomasz</creatorcontrib><title>Undirected graph algebra application for formalization description of information flows</title><title>2013 6th International Conference on Human System Interactions (HSI)</title><addtitle>HSI</addtitle><description>The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is described by an algebraic expression, on which can be carried out various activities to determine or change its properties, for example, by creating a new network structure. The study demonstrated basic algebra, as well as showing its use to describe a popular network topology and computer systems.</description><subject>Algebra</subject><subject>Client-server systems</subject><subject>complexity design</subject><subject>Corporate acquisitions</subject><subject>Finite element analysis</subject><subject>human-system interface</subject><subject>information systems design</subject><subject>Network topology</subject><subject>Solid modeling</subject><subject>Topology</subject><issn>2158-2246</issn><isbn>9781467356350</isbn><isbn>1467356352</isbn><isbn>9781467356367</isbn><isbn>1467356379</isbn><isbn>1467356360</isbn><isbn>9781467356374</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVUMtKw0AUHVHBUrMX3OQHEufOIzOzlKK2UHChxWWZx506kiZhEhD9erXtxsXh3PPgLg4hN0BrAGruli-rmlHgdSOV0syckcIoDaJRXDa8Uef_tKQXZMZA6oox0VyRYhw_KKUctDYMZuRt04WU0U8Yyl22w3tp2x26bEs7DG3ydkp9V8Y-_2Fv2_R9dAKOPqfhcPexTN0hPpbb_nO8JpfRtiMWJ56TzePD62JZrZ-fVov7dZVAyamKGAJqJry0TlATggwKmAqKBSOMtzoER6VGHaNHagCV88oqx8D_FoTjc3J7_JsQcTvktLf5a3uahv8A93BXzg</recordid><startdate>201306</startdate><enddate>201306</enddate><creator>Hajder, Miroslaw</creator><creator>Kolbusz, Janusz</creator><creator>Bartczak, Tomasz</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201306</creationdate><title>Undirected graph algebra application for formalization description of information flows</title><author>Hajder, Miroslaw ; Kolbusz, Janusz ; Bartczak, Tomasz</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-fedde824c5ab409dd5d7127d72d949ca8ddb058e8ffce091e7bc7a7b21cd944b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algebra</topic><topic>Client-server systems</topic><topic>complexity design</topic><topic>Corporate acquisitions</topic><topic>Finite element analysis</topic><topic>human-system interface</topic><topic>information systems design</topic><topic>Network topology</topic><topic>Solid modeling</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Hajder, Miroslaw</creatorcontrib><creatorcontrib>Kolbusz, Janusz</creatorcontrib><creatorcontrib>Bartczak, Tomasz</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hajder, Miroslaw</au><au>Kolbusz, Janusz</au><au>Bartczak, Tomasz</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Undirected graph algebra application for formalization description of information flows</atitle><btitle>2013 6th International Conference on Human System Interactions (HSI)</btitle><stitle>HSI</stitle><date>2013-06</date><risdate>2013</risdate><spage>235</spage><epage>240</epage><pages>235-240</pages><issn>2158-2246</issn><isbn>9781467356350</isbn><isbn>1467356352</isbn><eisbn>9781467356367</eisbn><eisbn>1467356379</eisbn><eisbn>1467356360</eisbn><eisbn>9781467356374</eisbn><abstract>The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is described by an algebraic expression, on which can be carried out various activities to determine or change its properties, for example, by creating a new network structure. The study demonstrated basic algebra, as well as showing its use to describe a popular network topology and computer systems.</abstract><pub>IEEE</pub><doi>10.1109/HSI.2013.6577829</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2158-2246 |
| ispartof | 2013 6th International Conference on Human System Interactions (HSI), 2013, p.235-240 |
| issn | 2158-2246 |
| language | eng |
| recordid | cdi_ieee_primary_6577829 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algebra Client-server systems complexity design Corporate acquisitions Finite element analysis human-system interface information systems design Network topology Solid modeling Topology |
| title | Undirected graph algebra application for formalization description of information flows |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T03%3A50%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Undirected%20graph%20algebra%20application%20for%20formalization%20description%20of%20information%20flows&rft.btitle=2013%206th%20International%20Conference%20on%20Human%20System%20Interactions%20(HSI)&rft.au=Hajder,%20Miroslaw&rft.date=2013-06&rft.spage=235&rft.epage=240&rft.pages=235-240&rft.issn=2158-2246&rft.isbn=9781467356350&rft.isbn_list=1467356352&rft_id=info:doi/10.1109/HSI.2013.6577829&rft_dat=%3Cieee_6IE%3E6577829%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467356367&rft.eisbn_list=1467356379&rft.eisbn_list=1467356360&rft.eisbn_list=9781467356374&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6577829&rfr_iscdi=true |