513
edits
GMU:Computing with Thread/Christian Doeller (view source)
Revision as of 07:07, 2 June 2016
, 2 June 2016no edit summary
No edit summary |
No edit summary |
||
| Line 112: | Line 112: | ||
It is not predictable that random braid configurations evolve into proper braid structures that can exist without any outer support.<br> | It is not predictable that random braid configurations evolve into proper braid structures that can exist without any outer support.<br> | ||
Therefore the "machine" above ("braiding") shall be used to set up a thread-path that does not fall apart easily.<br><br> | Therefore the "machine" above ("braiding") shall be used to set up a thread-path that does not fall apart easily.<br><br> | ||
The structure of the transformation is defined by several parameters that | The structure of the transformation is defined by several parameters that represent different properties of the network.<br><br> | ||
Example:<br> | |||
- the network could visualize trading routes between cities<br> | |||
- the colors could then represent different goods, for instance: yellow = red pedal boats<br> | |||
- A,B,C and D represent the nodes of the network. In this case they could represent the cities.<br> | |||
- the amount of goods can be represented by the location of a color inside the four squares of A,B,.. counted from left to right.<br> If the second square of A is yellow than this could mean that city A has 200 paddle boats.<br> | |||
- now, a match of the colors AND the locations of the colors inside of A,B,C or D means that those two or more cities (nodes) exchange goods (are connected).<br> | |||
In this example: A and B's second squares are yellow -> those two cities trade 200 paddle boats.<br> | |||
- if there is no match then there is no connection.<br><br> | |||
The "braids" and the network drawings can be infinitely translated into each other.<br> | |||
[[File:Network_colorstrings.jpg]]<br> | [[File:Network_colorstrings.jpg]]<br> | ||