some more image manipulation

README.md

@@ -4,11 +4,11 @@
 
 **ReDe** /'redɪ/ *n.* a Redis Module for simple data dehydration. This is a pretty straightforward implementation of the dehydration system depicted in the article "[Fast Data](https://goo.gl/DDFFPO)". The Goal of this module is to solve the *Contextual Completeness* and *Emergent Relevancy* problems by adding the ability to postpone incoming elements to a later time in which we will have a complete information for these elements. Effectively acting as a snooze button to any element.
 
+![a schematic view of the Filter-Split-Dehydrate architecture](FSD-scheme.png)
+
 From the article:
 > Dehydrators are simplistic time machines. They transport data elements that arrived prematurely in terms of their context right to the future where they might be needed, without loading the system while waiting. This concept is achieved by attaching a time-indexed data store to a clock, storing elements as they arrive to the dehydrator and re-introducing them as inputs to the system once a predetermined time period has passed.
 
-![a schematic view of the Filter-Split-Dehydrate architecture](FSD-scheme.png)
-
 
 Using this system it is also possible to craft a self cleaning "claims check", to minimize load on transportation and manipulation nodes of a pipeline architecture.
 

index.html

@@ -25,14 +25,14 @@ <h2 class="project-tagline">A Redis Element Dehydration Module</h2>
 
 <p><strong>ReDe</strong> /'redɪ/ <em>n.</em> a Redis Module for simple data dehydration. This is a pretty straightforward implementation of the dehydration system depicted in the article "<a href="https://goo.gl/DDFFPO">Fast Data</a>". The Goal of this module is to solve the <em>Contextual Completeness</em> and <em>Emergent Relevancy</em> problems by adding the ability to postpone incoming elements to a later time in which we will have a complete information for these elements. Effectively acting as a snooze button to any element.</p>
 
+<p><img src="FSD-scheme.png" alt="a schematic view of the Filter-Split-Dehydrate architecture"></p>
+
 <p>From the article:</p>
 
 <blockquote>
 <p>Dehydrators are simplistic time machines. They transport data elements that arrived prematurely in terms of their context right to the future where they might be needed, without loading the system while waiting. This concept is achieved by attaching a time-indexed data store to a clock, storing elements as they arrive to the dehydrator and re-introducing them as inputs to the system once a predetermined time period has passed.</p>
 </blockquote>
 
-<p><img src="FSD-scheme.png" alt="a schematic view of the Filter-Split-Dehydrate architecture"></p>
-
 <p>Using this system it is also possible to craft a self cleaning "claims check", to minimize load on transportation and manipulation nodes of a pipeline architecture.</p>
 
 <p><em>You can read further on the algorithm behind this module <a href="https://github.com/TamarLabs/ReDe/blob/master/Algorithm.md">here</a>.</em></p>