<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress.com" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>barriers &amp;laquo; WordPress.com Tag Feed</title>
	<link>http://en.wordpress.com/tag/barriers/</link>
	<description>Feed of posts on WordPress.com tagged "barriers"</description>
	<pubDate>Sun, 29 Nov 2009 22:04:11 +0000</pubDate>

	<generator>http://en.wordpress.com/tags/</generator>
	<language>en</language>

<item>
<title><![CDATA[bwaltz: touch the keys please &amp; unlock my heart.]]></title>
<link>http://otye.wordpress.com/2009/11/29/bwaltz-touch-the-keys-please-unlock-my-heart/</link>
<pubDate>Sun, 29 Nov 2009 21:29:42 +0000</pubDate>
<dc:creator>bwaltz</dc:creator>
<guid>http://otye.wordpress.com/2009/11/29/bwaltz-touch-the-keys-please-unlock-my-heart/</guid>
<description><![CDATA[Hello beautiful people. Jhuns did the intro, so i really don&#8217;t need to cover that. I must say ]]></description>
<content:encoded><![CDATA[Hello beautiful people. Jhuns did the intro, so i really don&#8217;t need to cover that. I must say ]]></content:encoded>
</item>
<item>
<title><![CDATA[Barriers up as water levels rise]]></title>
<link>http://waterintheocean.wordpress.com/2009/11/26/barriers-up-as-water-levels-rise/</link>
<pubDate>Thu, 26 Nov 2009 14:08:52 +0000</pubDate>
<dc:creator>tellmenews</dc:creator>
<guid>http://waterintheocean.wordpress.com/2009/11/26/barriers-up-as-water-levels-rise/</guid>
<description><![CDATA[Barriers are in place along the River Severn as the Environment Agency says water levels will peak o]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Barriers are in place along the River Severn as the Environment Agency says water levels will peak on Saturday&#8230;. From BBC News. <a href="http://news.bbc.co.uk/go/rss/-/2/hi/uk_news/england/hereford/worcs/8380285.stm">Full story</a></p>
<p>This site may contain information about:  water depths.  The blog is also related to: ocean.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Graph Layout with Software Transactional Memory and Barriers (plus video!)]]></title>
<link>http://chplib.wordpress.com/2009/11/26/graph-layout-with-software-transactional-memory-and-barriers/</link>
<pubDate>Thu, 26 Nov 2009 13:15:29 +0000</pubDate>
<dc:creator>Neil Brown</dc:creator>
<guid>http://chplib.wordpress.com/2009/11/26/graph-layout-with-software-transactional-memory-and-barriers/</guid>
<description><![CDATA[In my last post, I used barriers and shared channels to write a simple program for performing force-]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>In my last post, <a href="http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/">I used barriers and shared channels to write a simple program for performing force-based graph layout</a>.  There were two things lacking in that example: firstly, repulsion between unconnected nodes and secondly, some cool videos.  I&#8217;ve now solved both of these shortcomings.</p>
<p>In order to implement repulsion between all nodes, each node must know the position of all other nodes at every time-step.  I could implement this with message-passing, but that would be O(N^2) communications each phase, which isn&#8217;t very efficient, and at that point, message-passing is probably not the right design.  We need some shared variables instead.  Software Transactional Memory (STM) provides a nice way to do shared variable concurrency in Haskell, so we will use that.</p>
<p>The idea is that we will have a transactional variable (TVar) per node, holding the node&#8217;s position.  Every time-step, each node will read from all the TVars to discover the positions of all the other nodes, and will then update its own position based on the other nodes.  If we are not careful, we will have the same race hazard that I warned against last time: one node could update its position before all the other nodes have read its previous position.  Or, if left totally unconstrained, one node could perform several updates before other nodes have even performed one.  To prevent these problems, we will again use barriers to break up the simulation into two phases: discover, and act.  This means that we will be combining CHP and STM: using barriers from CHP to regulate access to shared variables from STM.</p>
<p>All the code before the node process is exactly the same as <a href="http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/">last time</a>, except that I now import <tt>Control.Concurrent.STM</tt> and <tt>Control.Parallel.Strategies</tt> (for some strict application) &#8212; and I&#8217;ve made the nodes a bit smaller.  Our node process no longer takes channels as its parameters, but TVars instead.  It takes a list corresponding to the other nodes, of pairs of booleans (indicating if the other node is connected to this one) and transactional variables (to read the other node&#8217;s position).  It also takes a single transactional variable, which it should use to write its own position to:</p>
<pre>node :: NodeInfo -&#62; [(Bool, TVar NodeInfo)] -&#62; TVar NodeInfo
     -&#62; Enrolled PhasedBarrier Phase -&#62; CHP ()
node start neighbours me bar = node' start
  <font color="Blue">where</font>
    (connected, tvs) = unzip neighbours

    node' cur
      = <font color="Blue">do</font> Discover &#60;- syncBarrier bar
           neighbourPos &#60;- liftSTM (mapM readTVar tvs)
           <font color="Blue">let</font> new = updatePos (zip connected neighbourPos) cur
           Act &#60;- syncBarrier bar
           liftSTM (writeTVar me (new <b>`using`</b> rnf))
           node' new</pre>
<p>You can see that the node process is a bit simpler.  In the Discover phase it reads from the TVars and in the Act phase it writes to its own.  It is immediately apparent that the reads and writes are thus segregated.  <tt>liftSTM</tt> is defined below (it is essentially the <tt>atomically</tt> function), and the <tt>`using` rnf</tt> is a strictness thing that you can ignore.  The <tt>updatePos</tt> function is now more complicated as we have added repulsion (though it is all irrelevant to the concurrent logic):</p>
<pre>
    updatePos poss cur
      = sum [cur
            ,0.05 <b>*</b> sum [ <font color="Blue">let</font> v = p <font color="Green"><i>-</i></font> cur <font color="Blue">in</font> v <font color="Green"><i>-</i></font> ideal <b>*</b> normalise v
                        &#124; (True, p) &#60;- poss] <font color="Green"><i>-- connected nodes</i></font>
            ,0.000002 <b>*</b> sum [<font color="Blue">let</font> sc = (p <b>`from`</b> cur) <b>^^</b> (<font color="Green"><i>-</i></font>2)
                             <font color="Blue">in</font> NodeInfo sc sc <b>*</b> normalise (cur <font color="Green"><i>-</i></font> p)
                            &#124; (<font color="Blue">_</font>, p) &#60;- poss] <font color="Green"><i>-- all nodes</i></font>
            ]
      <font color="Blue">where</font>
        ideal = 0.02
        (NodeInfo x2 y2) <b>`from`</b> (NodeInfo x1 y1)
          = sqrt <b>$</b> (x2<font color="Green"><i>-</i></font>x1)<b>^^</b>2 <b>+</b> (y2<font color="Green"><i>-</i></font>y1)<b>^^</b>2
        normalise (NodeInfo x y) = fmapNodeInfo (<b>/</b> mag) (NodeInfo x y)
          <font color="Blue">where</font>
            mag = sqrt (x<b>*</b>x <b>+</b> y<b>*</b>y)

<font color="Blue">instance</font> NFData GLfloat
<font color="Blue">instance</font> NFData NodeInfo <font color="Blue">where</font>
  rnf (NodeInfo a b) = rnf a <b>&#62;&#124;</b> rnf b

liftSTM :: MonadIO m =&#62; STM a -&#62; m a
liftSTM = liftIO <b>.</b> atomically
</pre>
<p>I&#8217;ve also had to add an instance of NFData to use rnf (strict evaluation) on NodeInfo, and the simple liftSTM function for executing STM transactions in the CHP monad.  The draw process only has one change; instead of reading from a list of channels, we now read from a list of transactional variables:</p>
<pre>drawProcess :: [TVar NodeInfo] -&#62; Enrolled PhasedBarrier Phase -&#62; CHP ()
drawProcess tvs bar
 = <font color="Blue">do</font> displayIO &#60;- embedCHP_ <b>$</b> <font color="Blue">do</font> syncAndWaitForPhase Discover bar
                                  xs &#60;- liftSTM <b>$</b> mapM readTVar tvs
                                  liftIO <b>$</b> <font color="Blue">do</font> startFrame
                                              mapM_ draw xs
                                              mapM_ (drawEdge xs) edges
                                              endFrame
<b>...</b></pre>
<p>Last time, I only had four nodes in my example, which was fairly boring.  This time I have one hundred nodes, connected in a 10&#215;10 grid.  To make the demo interesting, all the nodes start with random positions:</p>
<pre>startNodes :: IO [NodeInfo]
startNodes = replicateM (10<b>*</b>10) <b>$</b> liftM2 NodeInfo r r
  <font color="Blue">where</font>
    r = liftM (fromRational <b>.</b> toRational) <b>$</b> randomRIO (0 :: Float, 1)

edges :: [(Int, Int)]
edges = across <b>++</b> down
  <font color="Blue">where</font>
    across = [(x<b>+</b>10<b>*</b>y, (x<b>+</b>1)<b>+</b>10<b>*</b>y) &#124; x &#60;- [0..8], y &#60;- [0..9]]
    down = [(x<b>+</b>10<b>*</b>y, x<b>+</b>10<b>*</b>(y<b>+</b>1)) &#124; x &#60;- [0..9], y &#60;- [0..8]]
</pre>
<p>Finally, our slightly adjusted main process:</p>
<pre>main :: IO ()
main = runCHP_ <b>$</b>
       <font color="Blue">do</font> nodes &#60;- liftIO startNodes
          vars &#60;- liftSTM <b>$</b> mapM newTVar nodes
          enrollAll_ (newPhasedBarrier Act)
           (drawProcess vars :
            [ <font color="Blue">let</font> edgesOut = filter ((<b>==</b> i) <b>.</b> fst) edges
                  edgesIn = filter ((<b>==</b> i) <b>.</b> snd) edges
                  connectedNodes = map fst edgesIn <b>++</b> map snd edgesOut
                  conn = [(ind <b>`elem`</b> connectedNodes, tv)
                         &#124; (tv, ind) &#60;- zip vars [0..], tv <b>/=</b> mytv]
              <font color="Blue">in</font> node n conn mytv
            &#124; (n, mytv, i) &#60;- zip3 nodes vars [0..]
            ])
</pre>
<p>There are not many changes from <a href="http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/">my previous shared channel-based version</a> to use STM instead.  My continued use of barriers alongside STM shows that you can mix STM and CHP quite nicely if you want to.  Now, here&#8217;s what you&#8217;ve been waiting for &#8212; a video of the graph layout in action, first on my grid graph as defined above:</p>
<p><img src="http://chplib.wordpress.com/files/2009/11/graph-square.png" alt="" title="graph-square" width="400" height="400" class="aligncenter size-full wp-image-763" /><br />
Choose from <a href="http://twistedsquare.com/graph-square-wmv.avi">WMV format (suitable for Windows)</a> or <a href="http://twistedsquare.com/graph-square-mpeg4.avi">MPEG format (suitable for Linux, etc)</a>.</p>
<p>I also ran the algorithm on a simple loop graph:</p>
<p><img src="http://chplib.wordpress.com/files/2009/11/graph-loop.png" alt="" title="graph-loop" width="400" height="400" class="aligncenter size-full wp-image-764" /><br />
Choose from <a href="http://twistedsquare.com/graph-loop-wmv.avi">WMV format (suitable for Windows)</a> or <a href="http://twistedsquare.com/graph-loop-mpeg4.avi">MPEG format (suitable for Linux, etc)</a>.</p>
<p>The two videos have the algorithm running at 10 iterations per second, as that seems like a nice speed to view them at (and apologies for the slight garbage down the right-hand side of the videos).  The grid example was inspired by an original example in the Java version of the <a href="http://prefuse.org/">Prefuse toolkit</a>.  Prefuse is an incredibly cool visualisation toolkit; some Java examples can be found <a href="http://prefuse.org/gallery/">online</a> but more impressive are the more recent <a href="http://flare.prefuse.org/demo">ActionScript examples</a>.  Try the <a href="http://flare.prefuse.org/demo">Layouts tab</a>, and also <a href="http://flare.prefuse.org/launch/apps/dependency_graph">the dependency graph example</a> if you have a spare minute.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Fences, Barriers, Borders, Security, Comity]]></title>
<link>http://aneconomyofmeaning.wordpress.com/2009/11/26/fences-barriers-borders-security-comity/</link>
<pubDate>Thu, 26 Nov 2009 11:15:59 +0000</pubDate>
<dc:creator>David Morf</dc:creator>
<guid>http://aneconomyofmeaning.wordpress.com/2009/11/26/fences-barriers-borders-security-comity/</guid>
<description><![CDATA[Today’s post is a little different.  It looks at what things may mean, aside from their physical pre]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Today’s post is a little different.  It looks at what things may mean, aside from their physical presence.  An earlier version first appeared as an emailed comment on October 21, 2009 to <strong><a href="http://www.jstreet.org/">JStreet.org</a></strong>, an emerging interesting group noted for expanding the Middle Eastern conversation.  Here’s the item at <strong><a href="http://www.jstreet.org/page/settlements">JStreet/Settlements</a></strong> that got my attention…</p>
<p>Security Barrier &#38; Two-state Sustainability:  <em>&#8220;J Street supports the concept of a security barrier as an important element of Israel’s defense, but believes that the barrier must be located along an internationally recognized border.  Its present route has confiscated land and separated Palestinians from the jobs, health care and family. It will have to be relocated in many sections as part of a final status agreement.”</em></p>
<p>So let’s look at that for a moment.  Isn’t it possible that it&#8217;s exactly &#8220;the concept of a security barrier&#8221; that makes a barricaded border into a mutual membrane that filters out the directly accessible economic and individual interactions that define viable social and political life?  Can the term &#8220;barrier&#8221; end up turning the meaning of &#8220;security&#8221; upside down?</p>
<p>It&#8217;s not like Europe hasn&#8217;t torn itself apart twice in the past century, and numerous times prior to that (see <strong><a href="http://en.wikipedia.org/wiki/History_of_Europe">History_of_Europe</a></strong>).  Yet, consider that the 1930-1939 barrier attempted between two European antagonists has become the signature term for a futile defensive crouch.  For details, look at the <strong><a href="http://en.wikipedia.org/wiki/Maginot_Line">Maginot_Line</a></strong> polity and policy.  Just as the Line tried to substitute concrete for wisdom, mobile forces, and firepower, so an ongoing barrier says that an ongoing relationship will be grounded in a physical manifestation of an <strong><a href="http://en.wikipedia.org/wiki/Existential_crisis">Existential</a></strong> disbelief in any shared positive reality between the people on the ground.</p>
<p>In relative terms, the <strong><a href="http://en.wikipedia.org/wiki/Berlin_Wall">Berlin_Wall</a></strong> outlived the Maginot Line by decades, but it didn&#8217;t buy durable security for the German Democratic Republic.  The poet Robert Frost wrote that &#8220;good fences make good neighbors&#8221; (see <strong><a href="http://en.wikipedia.org/wiki/Mending_Wall">Mending_Wall</a></strong>), but it seems also true that solid walls make prisoners on both sides.  At least a fence lets air, light, and sight pass through, and provides a place to rest one&#8217;s forearms while discussing the day with a neighbor.  And unlike a solid wall or barrier, a simple fence is a mutual respect for a shared larger space.  That’s a security no barrier can provide.</p>
<p>Once the idea of “barrier” digs into the mind, other examples come into focus.  There’s <strong><a href="http://en.wikipedia.org/wiki/Hadrian's_Wall">Hadrian&#8217;s_Wall</a></strong> to keep Romans safe in Britannia.  There’s the <strong><a href="http://en.wikipedia.org/wiki/Great_Wall_of_China">Great_Wall_of_China</a></strong>  to keep out invaders from the 5th Century BC to the 16th Century Current Era.  Each kept people busy and delayed incursions, but their need for continuous work indicates neither succeeded in staving off depredations as the respective centers lost their way.  Makes one wonder about the ability to process lessons learned.  See current US efforts to paste walls of steel (South) and procedure (North) to cover policy shortfalls affecting both borders (<strong><a href="http://westernfrontonline.net/2009111711586/news/u.s.-border-policy-under-question/">U.S.-border-policy-question</a></strong>, <strong><a href="http://en.wikipedia.org/wiki/Mexico%E2%80%93United_States_border">United_States_border</a></strong>).</p>
<p>So there’s something seductive about a wall.  People keep building them to feel good by doing something, anything, to avoid doing something more insightful.  Their record says it’s more likely walls end up looking like a lunge for a security blanket, than like real clarity of mind.  Maybe simple fences to mark shared spaces aren’t so simple-minded after all.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Rust Barriers]]></title>
<link>http://declanod.wordpress.com/2009/11/25/rust-barriers/</link>
<pubDate>Wed, 25 Nov 2009 02:09:57 +0000</pubDate>
<dc:creator>Declan</dc:creator>
<guid>http://declanod.wordpress.com/2009/11/25/rust-barriers/</guid>
<description><![CDATA[A stack of rusty metal traffic barriers]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><div id="attachment_1681" class="wp-caption aligncenter" style="width: 760px"><a href="http://declanod.wordpress.com/files/2009/11/barriers2wp.jpg"><img class="size-full wp-image-1681" title="Barriers2WP" src="http://declanod.wordpress.com/files/2009/11/barriers2wp.jpg" alt="" width="750" height="499" /></a><p class="wp-caption-text">A stack of rusty metal traffic barriers</p></div>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Force-Directed Graph Layout with Barriers and Shared Channels]]></title>
<link>http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/</link>
<pubDate>Tue, 24 Nov 2009 14:13:24 +0000</pubDate>
<dc:creator>Neil Brown</dc:creator>
<guid>http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-barriers-and-shared-channels/</guid>
<description><![CDATA[A graph is a collection of nodes, and edges joining the nodes together. Automatically drawing them c]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><a href="http://en.wikipedia.org/wiki/Graph_(mathematics)">A graph is a collection of nodes, and edges joining the nodes together.</a>  Automatically drawing them cleanly is an interesting problem.  Some <a href="http://en.wikipedia.org/wiki/Force-based_algorithms">force-based graph layout algorithms</a> view the edges between nodes as springs, and simulate the forces acting on each node in order to move the nodes into a good position.  Connected nodes will pull towards each other until the edges are of an ideal length.  We can implement such a layout algorithm in CHP, with a process per node.</p>
<p>To implement the algorithm, the nodes need to be able to find out the current positions of their neighbours (i.e. the nodes they are connected to) and update their own position accordingly.  One approach would be to have a channel pair per edge, to enable sending of position information in both directions, as in this graph of three nodes:</p>
<p><img src="http://chplib.wordpress.com/files/2009/11/pair-per-edge.png" alt="" title="pair-per-edge" width="284" height="289" class="aligncenter size-full wp-image-722" /></p>
<p>I&#8217;m going to take an alternative approach of having one output channel per node, on which the node can send its position.  The other end (i.e. the reading end) of these position channels will be shared, and these ends will be passed around to all the nodes that connect to the node with the output end.  We can also give all the reading ends to a display process.  So our wired up graph now looks like this:</p>
<p><img src="http://chplib.wordpress.com/files/2009/11/shared-chans.png" alt="" title="shared-chans" width="519" height="387" class="aligncenter size-full wp-image-723" /></p>
<p>A shared channel is represented by a small hollow circle.  Each has one writer (the three nodes), and several readers (the connected nodes and the display process).  Each iteration, our nodes will offer to send out their current position (as many times as they are asked for it) while also fetching the position of all their neighbours.  Then they will all calculate a new position based on their neighbours and go again.  One problem with this common discover-then-act design is that if you do not clearly separate the discovery of the neighbours&#8217; positions and the updating of the positions, you can get nodes updating based on a mix of old positions (which is what you want) and the new updated positions &#8212; a race hazard.  To prevent this, we divide each simulation step into two phases (discover and act) using a phased barrier.</p>
<p>A phased barrier is a synchronisation primitive.  It allows processes to enroll on the barrier, to resign from the barrier, and to synchronise; processes only successfully synchronise on a barrier when all currently-enrolled processes synchronise.  Each synchronisation, the phase of the barrier is moved on (and typically cycles around).</p>
<p>We will begin with some import statements, and declaring a <tt>NodeInfo</tt> type to hold the positions of nodes.  We will also include a quick <tt>Num</tt> and <tt>Fractional</tt> instance for our <tt>NodeInfo</tt> that performs plus, minus, etc element-wise (<tt>NodeInfo 1 6 * NodeInfo 3 4 == NodeInfo 3 24</tt>):</p>
<pre><font color="Blue">import</font> Control<b>.</b>Concurrent<b>.</b>CHP
<font color="Blue">import</font> Control<b>.</b>Monad
<font color="Blue">import</font> Control<b>.</b>Monad<b>.</b>Trans
<font color="Blue">import</font> Graphics<b>.</b>Rendering<b>.</b>OpenGL
<font color="Blue">import</font> Graphics<b>.</b>UI<b>.</b>GLUT hiding (alt)

<font color="Blue">data</font> NodeInfo = NodeInfo GLfloat GLfloat <font color="Blue">deriving</font> (Show, Eq)

<font color="Blue">instance</font> Num NodeInfo <font color="Blue">where</font> <b>...</b>
<font color="Blue">instance</font> Fractional NodeInfo <font color="Blue">where</font> <b>...</b></pre>
<p>Then we will declare our phase data type, and a helper function to read from a list of shared channels in parallel:</p>
<pre><font color="Blue">data</font> Phase = Discover &#124; Act <font color="Blue">deriving</font> (Eq, Show, Bounded, Ord, Enum)

readAll :: [Shared Chanin a] -&#62; CHP [a]
readAll = runParMapM (flip claim readChannel)</pre>
<p>Next, we will define our node process.  The main body of the node process first begins the discover phase.  It then acts as a sender and receiver in parallel: the receiver reads in the positions of all its neighbours, while the sender continually offers to send out its position.  It finishes both of these once the phase changes.  To facilitate this, we must enroll on the barrier again, and use one barrier end in the sender and one in the receiver.  (If we did not enroll a second time, and tried to use the same single barrier end twice in parallel, this would be a mis-use of the library.)  So here is most of the node process:</p>
<pre>node :: NodeInfo -&#62; [Shared Chanin NodeInfo] -&#62; Chanout NodeInfo
     -&#62; Enrolled PhasedBarrier Phase -&#62; CHP ()
node start neighbourChans out bar = node' start
  <font color="Blue">where</font>
    node' cur
      = <font color="Blue">do</font> Discover &#60;- syncBarrier bar
           (<font color="Blue">_</font>, neighbourPos) &#60;- furtherEnroll bar <b>$</b> \bar2 -&#62;
              giveOutPosUntilBar cur <b>&#60;&#124;&#124;&#62;</b> <font color="Blue">do</font> pos &#60;- readAll neighbourChans
                                             Act &#60;- syncBarrier bar2
                                             return pos
           node' (updatePos neighbourPos cur)

    giveOutPosUntilBar cur = (writeChannel out cur <b>&#62;&#62;</b> giveOutPosUntilBar cur)
                               <b>&#60;-&#62;</b> <font color="Blue">do</font> Act &#60;- syncBarrier bar
                                      return ()</pre>
<p>The sender is the <tt>giveOutPosUntilBar</tt> process, and the receiver is on the right-hand side of the parallel.  By making explicit the phase that we expect to begin with each barrier synchronisation, we both make our code clear (you can see which part is in the discover phase, and which part is in the act phase) and also effectively assert correctness; if the pattern-match fails, your code will produce an error.</p>
<p>Updating the position of the node based on its neighbours is all pure code.  This is not a very sophisticated algorithm, but it will suffice for the purposes of illustration:</p>
<pre>    updatePos poss cur = cur <b>+</b> (0.05 <b>*</b> average
      [<font color="Blue">let</font> v = p <font color="Green"><i>-</i></font> cur <font color="Blue">in</font> v <font color="Green"><i>-</i></font> ideal <b>*</b> normalise v &#124; p &#60;- poss])
      <font color="Blue">where</font>
        ideal = 0.3
        normalise (NodeInfo x y) = NodeInfo (x <b>/</b> mag) (y <b>/</b> mag)
          <font color="Blue">where</font>
            mag = sqrt (x<b>*</b>x <b>+</b> y<b>*</b>y)
        average xs = sum xs <b>/</b> fromIntegral (length xs)</pre>
<p>The draw process is mainly irrelevant OpenGL logic (adapted from my <a href="http://chplib.wordpress.com/category/guides/boids/">boids example</a>), but the interesting part is that it must act in the discover phase, partly because that&#8217;s the only time that the nodes will send their position, and partly because it&#8217;s actually the drawing that drives the frame-rate (a pull-based architecture).</p>
<pre>drawProcess :: [Shared Chanin NodeInfo] -&#62; Enrolled PhasedBarrier Phase -&#62; CHP ()
drawProcess input bar
 = <font color="Blue">do</font> displayIO &#60;- embedCHP_ <b>$</b> <font color="Blue">do</font> syncAndWaitForPhase Discover bar
                                  xs &#60;- readAll input
                                  liftIO <b>$</b> <font color="Blue">do</font> startFrame
                                              mapM_ draw xs
                                              mapM_ (drawEdge xs) edges
                                              endFrame
      liftIO (<font color="Blue">do</font> setup
                 displayCallback <b>$=</b> glRunAs2D displayIO
                 <font color="Blue">let</font> addTimer = addTimerCallback 500 timer
                     timer = addTimer <b>&#62;&#62;</b> postRedisplay Nothing
                 addTimer
                 mainLoop)
  <font color="Blue">where</font>
    setup = <font color="Blue">do</font> initialWindowSize <b>$=</b> Size 500 500
               getArgsAndInitialize
               initialDisplayMode <b>$=</b> [DoubleBuffered]
               createWindow "CHP Graph"

    startFrame = <font color="Blue">do</font> clearColor <b>$=</b> Color4 0 0 0 0
                    clear [ColorBuffer, DepthBuffer]

    endFrame = <font color="Blue">do</font> flush
                  swapBuffers

glRunAs2D :: IO () -&#62; IO ()
glRunAs2D draw = <font color="Blue">do</font>
  (matrixMode <b>$=</b> Modelview 0) <b>&#62;&#62;</b> loadIdentity
  (matrixMode <b>$=</b> Projection) <b>&#62;&#62;</b> loadIdentity
  ortho 0 1 0 1 (<font color="Green"><i>-</i></font>1000) 1000
  preservingMatrix draw

draw :: NodeInfo -&#62; IO ()
draw (NodeInfo x y) = renderPrimitive Polygon <b>$</b> sequence_
  [ vertex <b>$</b> Vertex2 (x <b>+</b> 0.05 <b>*</b> cos t) (y <b>+</b> 0.05 <b>*</b> sin t)
  &#124; t &#60;- map ((pi<b>/</b>10)<b>*</b>) [0..19]]

drawEdge :: [NodeInfo] -&#62; (Int, Int) -&#62; IO ()
drawEdge nodes (s, e) = renderPrimitive Lines <b>$</b>
  vertex (Vertex2 x1 y1) <b>&#62;&#62;</b> vertex (Vertex2 x2 y2)
  <font color="Blue">where</font>
    (NodeInfo x1 y1, NodeInfo x2 y2) = (nodes <b>!!</b> s, nodes <b>!!</b> e)</pre>
<p>Finally, we must initialise the nodes and wire up the simulation.  For our barrier, we will use the <tt>enrollAll_</tt> function that takes a barrier-creation function, a list of processes that take an enrolled barrier as a parameter, and runs them all in parallel with their own enrolled barrier ends (discarding the output).  Crucially, enrollAll does the enrolling before any of the processes have begun.  If you run your processes in parallel and get them to enroll themselves, you will create a race hazard in your program: one process might enroll and start synchronising by itself before the other processes have started executing.  This is almost certainly not what you want.  So here is the code:</p>
<pre>startNodes :: [NodeInfo]
startNodes = [NodeInfo 0 0, NodeInfo 0 1, NodeInfo 1 0, NodeInfo 1 1]

edges :: [(Int, Int)]
edges = [(0,1), (1,2), (2,0), (1, 3)]

main :: IO ()
main = runCHP_ <b>$</b>
       <font color="Blue">do</font> outChans &#60;- replicateM numNodes oneToAnyChannel
          enrollAll_ (newPhasedBarrier Act)
           (drawProcess (readers outChans) :
            [ <font color="Blue">let</font> edgesOut = filter ((<b>==</b> i) <b>.</b> fst) edges
                  edgesIn = filter ((<b>==</b> i) <b>.</b> snd) edges
                  connectedNodes = map fst edgesIn <b>++</b> map snd edgesOut
              <font color="Blue">in</font> node n (readers (map (outChans <b>!!</b>) connectedNodes)) (writer c)
            &#124; (n, c, i) &#60;- zip3 startNodes outChans [0..]])
  <font color="Blue">where</font>
    numNodes = length startNodes</pre>
<p>The list comprehension uses the edges list to pick out all the right channels for each node (i.e. it translates the connectivity expressed in the edges list into the channel topology).  The code in this post forms a complete program.  It is not completely effective as I have not added repulsion among non-connected nodes (an exercise for the reader perhaps), but here is a quick screenshot of the result:</p>
<p><img src="http://chplib.wordpress.com/files/2009/11/laid-out-graph1.png" alt="" title="laid-out-graph" width="510" height="529" class="aligncenter size-full wp-image-737" /></p>
<p>My intention with this example was to illustrate the use of shared channels, and particularly barriers.  The pattern shown here, of dividing simulations into phases, is one of their most common uses but they can be used elsewhere, sometimes in place of channels; from a more abstract perspective, channels in CHP offer synchronisation and communication, whereas barriers offer purely synchronisation.  A one-to-one channel carrying the unit type is semantically equivalent to a two-party barrier with no phase information.  The channel has the benefit of not needing explicit enrollment, but the disadvantage of being asymmetric in its use.  For example, picking up and putting down forks in the dining philosophers example can be implemented using either two-party barriers or channels carrying the unit type.</p>
<p><i>Note: As often with my recent posts, writing them revealed that I lacked certain useful helper functions, so you will need the new CHP 1.7.0 (which also includes other changes I will discuss in future) for the above code.</i></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[ Edinburgh Council to consider making Hogmanay free]]></title>
<link>http://alfenton.wordpress.com/2009/11/24/edinburgh-council-to-consider-making-hogmanay-free/</link>
<pubDate>Tue, 24 Nov 2009 14:02:26 +0000</pubDate>
<dc:creator>alfenton</dc:creator>
<guid>http://alfenton.wordpress.com/2009/11/24/edinburgh-council-to-consider-making-hogmanay-free/</guid>
<description><![CDATA[by Anna Fenton Street party could be opened to all as work on trams drags on into new year Edinburgh]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>by Anna Fenton</p>
<div>Street party could be opened to all as work on trams drags on into new year</div>
<div><a href="http://alfenton.wordpress.com/files/2009/11/241732.jpg"><img class="alignleft size-medium wp-image-7" title="24173" src="http://alfenton.wordpress.com/files/2009/11/241732.jpg?w=300" alt="" width="300" height="231" /></a></div>
<div>
<p>Edinburgh council are considering plans to make the famous Hogmanay street party free next year, with plans to get rid of barriers and tickets.</p>
<p>This year, tickets cost £10, four times the amount of 2004. However, according to local councillor Steve Cardownie, the council is evaluating the possibility of ending ticketing for the event: “We could spend more money on the entertainment without the costs of paying stewards and put up cordons,” said Cardownie. He emphasised, however, that safety is paramount is their considerations, and if there was any indication that the event would be dangerous without the security, ticketing would remain.</p>
<p><!--more--></p>
<p>Lothian and Borders said that they were in talks with the parties involved, and would take it from there, but refused to comment upon whether it would be a contentious issue for them.</p>
<p>Funding for the event comes from a mixture of sources, including from private sponsorship, grants and local taxpayers. Funding also comes from the ticket costs, so the issue of cost will clearly be an important consideration.</p>
<p>Not much has been officially decided yet, but a spokesperson for the City of Edinburgh Council said: “Every year we review the Hogmanay Event on a number of different levels and one of the things we look at is pricing. We haven&#8217;t started this process yet for 2010/11 because we are focussing our attention on making this year&#8217;s Hogmanay a great event for the many thousands of revellers who come from all over the world.&#8221;</p>
<p>300,000 people turned up for the events in 1996/7, but it was much more than the event could withstand, and many people were injured in the crowds. As a result, Edinburgh’s Hogmanay street party became a ticketed event. This year, however, the more modest number of 80,000 people are expected. Although it has been suggested that this is because of the wide variety of events available for party goers to chose from all over the country, some believe that the issue of the trams and the chaos of Princes Street has been putting revellers off coming; as one local resident put it: ‘Who want to celebrate the new year surrounded by scaffolding, diggers and holes in the road?”</p>
</div>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[From champ to chump]]></title>
<link>http://nathanfitzgerald.wordpress.com/2009/11/23/from-champ-to-chump/</link>
<pubDate>Mon, 23 Nov 2009 14:30:04 +0000</pubDate>
<dc:creator>Nathan</dc:creator>
<guid>http://nathanfitzgerald.wordpress.com/2009/11/23/from-champ-to-chump/</guid>
<description><![CDATA[In the spring of 1996, I was heavily entrenched in a &#8220;life stage&#8221; transition from high s]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>In the spring of 1996, I was heavily entrenched in a &#8220;life stage&#8221; transition from high school to college. My mom and I were traveling up and down the east coast for soccer recruiting trips to figure out where I would be spending the next four years of my life.</p>
<p>Penn State, UPenn, Tufts, St. Mary&#8217;s, Maryland, Lehigh, Colgate, Bucknell&#8230;these were a few of the places that were scouting me for soccer. They were a range of schools. Some were big (100,000 students), while some were small (1,200). Some were highly recognized for their academia, while others were acclaimed for their sports programs. Some were Division III programs, and some were Division I. Some were offering scholarships, and others were offering a warm hand. But what they all had in common was that they were claiming to want ME.</p>
<p>I had been accepted to every program (over a dozen) except for one. My heart was set on UPenn, but they were claiming that I needed 20 more points on my SAT&#8217;s in order for them to get me in. At the time, Penn State and Maryland were top tier Division I soccer programs, but I knew that if I went to play for them, I would likely sit the bench. They wouldn&#8217;t even guarantee that I would make the team.</p>
<p><a href="http://nathanfitzgerald.wordpress.com/files/2009/11/lehigh-vs-bucknell.png"><img class="aligncenter size-full wp-image-556" title="Lehigh vs Bucknell" src="http://nathanfitzgerald.wordpress.com/files/2009/11/lehigh-vs-bucknell.png" alt="" width="500" height="194" /></a></p>
<p>In the end, it came down to two schools - Lehigh and Bucknell. It was a great feeling to know they were fighting over me. They had both claimed that I was their #1 recruit, and they were both Division I programs. They weren&#8217;t a top 20 program for soccer, but at least I would be starting as their goalkeeper. Academically speaking, they were on par with each other, and while they weren&#8217;t technically an Ivy League school, they pooled from the same caliber of students each year. So I had a tough decision to make. Bucknell or Lehigh?</p>
<p>What made the difference was their confidence in me. Bucknell wanted me more, and it felt good to know that I was what they wanted. But that didn&#8217;t last very long. The honeymoon was soon over after the season started 6 months later. I was their #1 recruit, and I did start over a senior goalkeeper my freshman year, but that quickly ended. Playing Division I college ball was bigger, tougher, faster, and meaner than I had ever imagined, and I was in for a rude awakening.</p>
<p>I went from starting and playing the whole game, to barely playing 10 minutes by the sixth game of the season. Some of it wasn&#8217;t my fault at all. Apparently the fourth year goalkeeper had a lot of political clout with the head coach, and despite the strong support of other players and even the assistant coach, it wasn&#8217;t enough to get me playing time. But if I were to be completely honest, I simply didn&#8217;t live up to the expectations of the Head coach. I was a disappointment&#8230;or at the very least, not quite as good as he had hoped for.</p>
<p>It was a fair assessment though. I certainly wasn&#8217;t any worse than the other goalie, but I wasn&#8217;t unbelievably better either. So when push came to shove, everyone was disappointed with the result &#8211; including myself. I wasn&#8217;t quite the superstar that everyone expected me to be, and I wasn&#8217;t the superstar that I was used to being.</p>
<p>But four years later&#8230;I was ranked #1 in the country for a Saves Per Game stat amongst the NCAA&#8217;s Division I goalkeepers, achieved Defensive Player of the Week in the Patriot League, and helped to lead Bucknell into unprecedented wins against rivals such as Lehigh and Colgate. At one point, we had even placed in the Top 25 NCAA Division I men&#8217;s soccer rankings, upsetting a couple Top 10 programs in the country.</p>
<p>The reason this all came to mind is because I feel as though I&#8217;ve been experiencing a bit of Déjà vu. The past 17 months of my career at Immersion Active have been a steady uphill battle of finding my mojo, chi, or in layman&#8217;s terms, my confidence. And although everyone has been extremely supportive and patient (as well as invested in my success) at Immersion Active, I haven&#8217;t quite lived up to the hype of someone with a Director of Business Relationships title.</p>
<p>So, it has been decided (and I can&#8217;t say I fault them for it) that I am no longer a &#8220;Director&#8221;.</p>
<p>So last week, I didn&#8217;t want to continue reflecting myself as this position, despite their insistence that the changing of my title could wait until business cards had arrived, so I logged onto my account on LinkedIN and edited my title to &#8220;Business Relationships Manager&#8221;. Within 24 hours, I had received a warm note from a client which I found to be quite humorous and ironic:</p>
<p><a href="http://nathanfitzgerald.wordpress.com/files/2009/11/client-comment1.png"><img class="aligncenter size-full wp-image-553" title="Client Comment congratulating me on my new position" src="http://nathanfitzgerald.wordpress.com/files/2009/11/client-comment1.png" alt="" width="499" height="221" /></a></p>
<p>Lol. Little did she know, I had just been DEmoted, not PROmoted (in title only).</p>
<p>Even though this story doesn&#8217;t have a happy ending (yet), I know that the story is still waiting to unfold. The book of my life is still being written, and I&#8217;m anxious to see the story that God will write for me.</p>
<p>As we near Thanksgiving this year, I am reminded of how thankful I am, of how far I&#8217;ve come, and how much I&#8217;ve accomplished. I may have had my share of disappointments and unexpected outcomes, but I&#8217;ve also had my share of things to be thankful for as well. Pastor Steve wrote something that &#8220;stuck&#8221; with me a couple of weeks ago,</p>
<blockquote><p>When you face an enemy, obstacle, or setback, you can either see it as a wall or a door.</p></blockquote>
<p>As he explained, the Israelites chose to look at Goliath as a wall&#8230;and they waited for 40 days hoping it would go away. David, on the other hand, saw things differently &#8211; and God blessed him for it.</p>
<p>Every champ has his/her chump moments. But they&#8217;re a champ because they never stay a chump.</p>
<p>This chump is moving on.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[thinking aloud: thinking; allowed?]]></title>
<link>http://thinclusion.wordpress.com/2009/11/22/thinking-aloud-thinking-allowed/</link>
<pubDate>Sun, 22 Nov 2009 13:52:24 +0000</pubDate>
<dc:creator>colhawksworth</dc:creator>
<guid>http://thinclusion.wordpress.com/2009/11/22/thinking-aloud-thinking-allowed/</guid>
<description><![CDATA[At the risk of coming across as naive&#8230; I&#8217;m still pondering about &#8216;objectivity]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>At the risk of coming across as naive&#8230; I&#8217;m still pondering about &#8216;objectivity&#8217; in the research element of the project.</p>
<p>Can we actually be truly objective about our project and research?  We were involved in the bid writing and <em>thin.clusion</em> was our idea &#8211; so are we the best people to actually implement and research it?  Surely we already have some kind of bias toward positive outcomes?</p>
<p>Perhaps I&#8217;m missing the point a little?  I feel objective enough about the project &#8211; I can anticipate the potential barriers (is this also being biased? &#8211; having pre-conceived ideas of &#8216;barriers&#8217;)</p>
<p>Do I just step back a little from the project and allow it to take its own course, with little or no involvement &#8211; except for carrying out the research elements?  Will that give me a more objective viewpoint?</p>
<div id="attachment_61" class="wp-caption alignnone" style="width: 209px"><a href="http://thinclusion.wordpress.com/files/2009/11/2342924889_e8c65dc891.jpg"><img class="size-medium wp-image-61" title="Deep in thought" src="http://thinclusion.wordpress.com/files/2009/11/2342924889_e8c65dc891.jpg?w=199" alt="" width="199" height="300" /></a><p class="wp-caption-text">Pondering the meaning of life, for sure.</p></div>
<p>Flickr: Uploaded by <a href="http://www.flickr.com/photos/ben_pollard/">ben pollard</a> on 18 Mar 08, 5.36PM GMT.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Police raid offices of assisted suicide organization in Melbourne]]></title>
<link>http://pbaptist.wordpress.com/2009/11/19/police-raid-offices-of-assisted-suicide-organization-in-melbourne/</link>
<pubDate>Thu, 19 Nov 2009 09:19:52 +0000</pubDate>
<dc:creator>Particular Kev</dc:creator>
<guid>http://pbaptist.wordpress.com/2009/11/19/police-raid-offices-of-assisted-suicide-organization-in-melbourne/</guid>
<description><![CDATA[Police raided the Melbourne offices of the assisted-suicide advocacy organization Exit International]]></description>
<content:encoded><![CDATA[Police raided the Melbourne offices of the assisted-suicide advocacy organization Exit International]]></content:encoded>
</item>
<item>
<title><![CDATA[Migration and Trade: Theory with an Application to the Eastern-Western European Integration]]></title>
<link>http://freemarketmojo.wordpress.com/2009/11/19/migration-and-trade-theory-with-an-application-to-the-eastern-western-european-integration/</link>
<pubDate>Thu, 19 Nov 2009 08:16:52 +0000</pubDate>
<dc:creator>Ariel Goldring</dc:creator>
<guid>http://freemarketmojo.wordpress.com/2009/11/19/migration-and-trade-theory-with-an-application-to-the-eastern-western-european-integration/</guid>
<description><![CDATA[Susana Iranzo (Universitat Rovira Virgili) and Giovanni Peri (University of California Davis, CESifo]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Susana Iranzo (Universitat Rovira Virgili) and Giovanni Peri (University of California Davis, CESifo and NBER) have a <a href="http://ideas.repec.org/p/crm/wpaper/0905.html" target="_blank">new paper</a> that looks into the relationship between migration and trade:</p>
<blockquote><p>The remarkable increase in trade flows and in migratory flows of highly educated people are two important features of globalization of the last decades. This paper extends a two-country model of inter- and intra-industry trade to a rich environment featuring technological differences, skill differences and the possibility of international labor mobility. The model is used to explain the patterns of trade and migration as countries remove barriers to trade and to labor mobility. We calibrate the model to match the features of the Western and Eastern European members of the EU and analyze first the effects of the trade liberalization which occurred between 1989 and 2004, and then the gains and losses from migration which would occur if barriers to labor mobility are reduced. <span style="color:#ff0000;"><strong>The lower barriers to migration result in significant migration of skilled workers from Eastern European countries. Interestingly, this would not only benefit the migrants and most Western European workers but, via trade, it would also benefit the workers remaining in Eastern Europe.</strong></span></p></blockquote>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Secret of Like]]></title>
<link>http://lyricalpurpose.wordpress.com/2009/11/19/secret-of-like/</link>
<pubDate>Thu, 19 Nov 2009 02:17:13 +0000</pubDate>
<dc:creator>lyricalpurpose</dc:creator>
<guid>http://lyricalpurpose.wordpress.com/2009/11/19/secret-of-like/</guid>
<description><![CDATA[All of us want to be liked, but most of us feel it&#8217;s a bit of a random process of who likes us]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>All of us want to be liked, but most of us feel it&#8217;s a bit of a random process of who likes us and who doesn&#8217;t.  We worry and obsess about whether or not someone might like us or not, but we often feel that it&#8217;s not something we can control.  That&#8217;s totally normal and understandable.</p>
<p>So, let me share a secret with you&#8230;and this is the honest truth: I was voted class introvert in high school.  Painfully shy and insecure, most days I felt like nobody liked me.   What I discovered over time was that feeling came from not fundamentally liking myself very much.  In that I discovered a bigger secret that can benefit us all.</p>
<p>So, want to know how to make people like you?  It works almost every single time&#8230;with all people and all situtations.  And, if it doesn&#8217;t, you will know that it wasn&#8217;t you.  That you&#8217;ve done everything you can do.  It&#8217;s a powerful tool and it&#8217;s very simple.</p>
<p>There are two ways to make people like you:</p>
<ol>
<li>Like them first</li>
<li>Be helpful</li>
</ol>
<p>There it is.  So, whether it&#8217;s a social gathering, a job interview, or first date&#8230;.if you want someone to like you (and that is completely up to YOU) then start by just liking them first.</p>
<p>Find something about them that you can genuinely like. For some people that might be that you like their shoes, for others it may be that you have a shared interest in a cause or field of study, and for still others it may be that you like what they do.   The like has to be genuine for it to work or you will do more damage than good by being fake.</p>
<p>Then, if you want to build on that initial sense of like and create a solid relationship, focus on being helpful.</p>
<p>And, by helpful, I don&#8217;t necessarily mean you need to go tromping though someone&#8217;s life doing stuff for them.  Often there are things people do because they mean to be helpful, but aren&#8217;t because they are intrusive, bossy, or irritating.  That&#8217;s not what I&#8217;m suggesting at all.  Rather, adopting a spirit of helpfulness or an openness to being asked for help is more on target.</p>
<p>For example, after chatting with someone,  a simple &#8220;it was so very nice to talk with you today.  If there is ever any way I can be helpful to you, let me know&#8221;  can do wonders in building long term relationships.  It doesn&#8217;t matter who the other person is or who you are.   This offer of help resonates with people as deeply likable.   You don&#8217;t commit to anything in particular and of course reserve the right to say no if what they ask isn&#8217;t something you can do, but you hold out an openness to helping them but don&#8217;t assume you know what might be helpful.</p>
<p>All of that communicated very simply, honestly, and directly.  Likably.</p>
<p>So, just try it to see.  Smile at a stranger.  Talk with someone sitting by you at a meeting or in class.   Take a leap of faith and know that you are deeply likable and there is absolutely no reason why someone wouldn&#8217;t like you if you like them first and radiate helpfulness.   Life&#8217;s so much more fun when you like people. &#8230;  Starting with yourself.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Goals and Barriers]]></title>
<link>http://genuinewoman.wordpress.com/2009/11/16/goals-and-barriers/</link>
<pubDate>Mon, 16 Nov 2009 21:21:29 +0000</pubDate>
<dc:creator>genuinewoman</dc:creator>
<guid>http://genuinewoman.wordpress.com/2009/11/16/goals-and-barriers/</guid>
<description><![CDATA[Any goal can be achieved with difficulty and for a long time or in easy and fast way. It is very imp]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Any goal can be achieved with difficulty and for a long time or in easy and fast way.</p>
<p>It is very important for women to understand why we need to reach goals in easy and fast way.</p>
<p>Constant stress, predominance of negative emotions, illnesses, and problems with men influence on women’s well-being – physical, emotional, and mental. Through women it influences on our future children. It influences on our future generation. Therefore, it has the main impact on the whole world.</p>
<p>Take a moment to think of it. Take a moment to realize the connection between the well-being of women and the well-being of the whole planet. It depends on us who our children will be. It depends on us what the future generation will be.</p>
<p>Now we will learn how to achieve goals simply and fast.</p>
<h3>Take responsibility</h3>
<p>First of all, we need to realize that everything what we have or do not have is the result of our behaviour and our patterns of thinking. We create any situations ourselves. Therefore, there is no one to blame. Instead of criticizing, blaming and resenting we need to take responsibility.</p>
<p>The acknowledgment of responsibility makes our life easy, interesting, and fulfilling.  We learn how to reach goals on our own and not to depend on external circumstances. On the contrary, these so-called circumstances start to benefit us.</p>
<h3>Focus on the most important</h3>
<p>Then it is crucial to be aware what the main thing is for you and always to be focused on it. Most of us do not take time to think of it. Many people pay attention only on the secondary things. That is the reason why they never achieve what they want or they do it slowly and go through a lot of problems.</p>
<p>For example, what is most important in preparation for the childbirth? Giving love and care to your baby or buying pretty infant clothes and furniture?</p>
<p>All we need to do is to sit down and think what is the most important.</p>
<h3>Take actions</h3>
<p>After we find out what the most important is, we need to act upon it. If we do not make steps, we do not move. You might find it silly that I pay attention to this, but for most of us taking actions is the very difficult thing to do. We usually find a variety of excuses why we can not do it right now. Instead of looking for possibilities &#8211; we look for excuses.</p>
<p>We all know these excuses: “I can’t do it now,” “I don’t know how to do it,” or “I will do it later.”</p>
<p>My answer is “if we do not make steps, we do not move.”</p>
<h3>Reveal barriers</h3>
<p>When we start doing something, we meet barriers which do not allow us to reach goals. Usually they are ridiculous and self-invented. For example, false opinions, illusions, fears, and many others.</p>
<p>The opinion that “all men are egoists” can not let a woman to build good relationship with her husband. Or the fear of meeting people can not let a woman to get a decent job.</p>
<p>In this case everyone has two choices: to discern barriers and then to achieve the goal easily and fast; or to give up and forget about dreams.</p>
<h3>Self-education</h3>
<p>The last thing I want to mention is a self-education. Self-education is a key to fulfilling life. The one who does not educate himself is like a donkey that goes where others lead him.</p>
<p>In order not to be a donkey, the one needs to question everything. Maybe I am just lying to you right now?</p>
<p style="text-align:center;"><a href="http://genuinewoman.wordpress.com/2009/11/16/goals-and-barriers/#respond"><span style="color:#3366ff;font-size:x-small;">Share your opinion!</span></a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Accessibility on Campus]]></title>
<link>http://miriamspies.wordpress.com/2009/11/10/accessibility-on-campus/</link>
<pubDate>Tue, 10 Nov 2009 14:12:26 +0000</pubDate>
<dc:creator>miriamspies</dc:creator>
<guid>http://miriamspies.wordpress.com/2009/11/10/accessibility-on-campus/</guid>
<description><![CDATA[Getting around Ryerson campus is not always the easiest experience in my power chair. I have Cerebra]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Getting around <a href="http://www.ryerson.ca">Ryerson campus</a> is not always the easiest experience in my power chair.</p>
<p>I have <a href="http://www.ofcp.on.ca/aboutcp.html">Cerebral Palsy</a> which limits my ability to walk long distances, affects the usefulness of my hands, and impairs my speech.  I use a power chair and I am accompanied by a <a href="http://www.dogguides.com">guide dog</a>, Lacey, to get around.  I need to be constantly aware of space.  Every day, I manoeuvre through tight spaces, heavy doors, busy elevators and creaky lifts.   In going through the obstacle course that is my day, every day, I have learned to overcome the embarrassment that comes with getting stuck on Ryerson’s dated wheelchair lifts, caught in snow banks and to continue moving forward.</p>
<p><strong>Exercising:</strong></p>
<p>I really should go to the gym more often.  I bet you have said this too.  However, my trouble is not only finding the time to work out, but also figuring out how to get into the <a href="http://firefly.ryerson.ca/sportsandrec/">RAC</a>.</p>
<p>In my power wheelchair, I travel through the maze of Kerr Hall and two accessible doors to the gym entrance.  After swiping my card and going through an automatic door, I have to fight with a heavy door that is not automatic.  A student without upper body strength need’s someone to open the door for them.</p>
<p>Bikes and treadmills are accessible on the main floor that I can use, but weight equipment is down three flights of stairs.  In a tucked away corner by the stairs to the running track, there is the RAC’s solution- an old, finicky lift.  Operated by a key, and barely large enough for a wheelchair, the lift feels unsafe, like riding a wooden roller-coaster would.   I cannot use this lift by myself so I have to pay an attendant $20 to accompany me for weekly workouts.</p>
<p>Once, my worker and I had to ask a gym employee to operate the lift from outside because we could not get it to respond.  At one point, we were stuck halfway between floors.  The lift made a creaking sound every few seconds that scared me, my worker and Lacey.   From then on, we chose to walk down the stairs – it actually is the safer solution.  Going to the gym is crucial for my physical and emotional health, but finding the time and money limits my number of visits.</p>
<p><strong>Elevators &#8211; Waiting in line&#8230;</strong></p>
<p>Moving around other buildings poses challenges too.  In the library building there is an elevator reserved for people with disabilities.  Despite this, there is often a crowd of able-bodied students surrounding the elevator doors.  With the stairs directly behind the elevator, able-bodied students line up causing disabled people to wait longer and squeeze into tighter areas.   It amazes me to see a crowd in front of the elevator and how, if it’s taking too long, they decide to take their stairs.  I think, “If only I had that option.”</p>
<p><strong>Test Centre for Students with Disabilities &#8230; really?</strong></p>
<p>The test centre for students with disabilities is in the basement of the Victoria building.  Yes, it’s in the basement and it’s not accessible via the main elevator.  To access this service, students with physical disabilities must be able to call from a phone on the first floor and ask for someone to come get them with the lift.  They may wait a while until a staff person answers the phone or is able to leave the office.    Because of this arrangement, most students with physical disabilities write tests and exams in another location in the POD building.  Needless to say, I have only been in the test centre once.</p>
<p><strong>Dreadful winter</strong></p>
<p>It’s not only some buildings that are inaccessible, it’s the path to them.  That’s why I am dreading the winter.  I’m not a fan of the freezing temperatures, but it’s the snow that worries me.  Moving around the crowds on campus in my power wheelchair can be an ordeal, and snow-covered sidewalks make my day more challenging.  In past winters, I have missed class because I cannot get past the ramp outside of the ILLC.  Campus security guards have declined to assist students with disabilities to class as it is deemed unsafe.  Yet, the campus remains open and I miss class.  Returning from weekend trips home I have gotten stuck on un-ploughed campus sidewalks and depended on people passing to give me a hand.  It is embarrassing, yet seems to be an inevitable part of living on campus.  When the sidewalks are cleared, I am grateful for the ease of moving around campus.</p>
<p><strong>Finding easier ways</strong></p>
<p>These extra steps throughout my day have become routine.  Most of the time I don’t pay attention to the time or effort it takes in moving around campus.  I’ve learned to speak up about barriers or figure out alternative paths.  I take full advantage of tunnels and know where the best elevators are.  I’ve scouted out the accessible bathrooms.  I am grateful for the food service providers (especially at Tim Horton’s and Maggie’s) who make sure I have my meals and daily caffeine fix.  And though I don’t get to the gym as often as I’d like, I’m still getting there.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[SoundWave | By Tal Levy &amp; Shimrit Cohen]]></title>
<link>http://designingwithsound.wordpress.com/2009/11/08/soundwave-by-tal-levy-shimrit-cohen/</link>
<pubDate>Sun, 08 Nov 2009 00:17:46 +0000</pubDate>
<dc:creator>shimerc</dc:creator>
<guid>http://designingwithsound.wordpress.com/2009/11/08/soundwave-by-tal-levy-shimrit-cohen/</guid>
<description><![CDATA[As we know from our high school science classes, sound waves are created when an object moves or vib]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p dir="ltr">As we know from our high school science classes, sound waves are created when an object moves or vibrates. When these waves reach our ears, they cause our eardrums to vibrate, sending signals to the brain that we interpret as sound. </p>
<p>  </p>
<p dir="ltr"> <img class="alignnone size-medium wp-image-75" title="wave" src="http://designingwithsound.wordpress.com/files/2009/11/wave.png?w=300" alt="wave" width="300" height="196" />  </p>
<p dir="ltr"> <strong>&#124;</strong><strong> Frequency</strong> </p>
<p dir="ltr">  [number of wave crests per unit time that pass a fixed location &#124; measured in Hz- the number of waves per second]</p>
<p> measures the tone or pitch of a sound.  <br />
 For example, a bass guitar plays lower frequencies than a violin. <br />
 Human beings usually hear 15 to 20,000 [Hz] frequency sound.  </p>
<p dir="ltr"> <img class="alignnone size-medium wp-image-76" title="Frequency" src="http://designingwithsound.wordpress.com/files/2009/11/frequency.png?w=300" alt="Frequency" width="300" height="203" /> </p>
<p>    <strong>&#124;</strong><strong> Amplitude </strong> </p>
<p dir="ltr"> [the wave height &#124; measured in dB] used to measure the intensity of a sound</p>
<p dir="ltr"> A measurement of the wave traveling through the air is used as an indication of the intensity of sound or its volume, and is described in terms of a scale called the decibel (dB). Noise measurements made by filtering high- and low-pitched sounds—approximating the way an average person hears sounds—is called the A-weighted level or dBA [1924].</p>
<p dir="ltr">   0 dB     &#124;          the faintest sound we can hear;<br />
 30 dB   &#124;          a quiet library or in a quiet location in the country; <br />
  45 dB   &#124;          typical office space or ambience in the city at night;  <br />
 60 dB   &#124;          a restaurant at lunch time; <br />
70 dB   &#124;          the sound of a car passing on the street; <br />
80 dB   &#124;          loud music played at home;  <br />
 90 dB   &#124;          the sound of a truck passing on the street;  <br />
 100 dB &#124;          the sound of a rock band; <br />
115 dB &#124;          limit of sound permitted in industry; and  <br />
 120 dB &#124;          deafening. </p>
<p> The dB(A) scale begins at zero, which represents the faintest sound that can be heard by humans with very good hearing. Conversations take place in the 50 dB(A) range and a chainsaw whines at about 100 dB(A). Normal highway traffic sounds rank about 75 dB(A) and jet airliners around 90 dB(A). For most people, discomfort starts in the 70 to 80 dB(A) range, with the threshold of pain around 140 dB(A). The Federal Highway Administration (FHWA) has chosen 67 decibels as the point where state and federal agencies must consider reducing the noise level.</p>
<p dir="ltr"> </p>
<p dir="ltr"> <img class="alignnone size-medium wp-image-77" title="Amplitude" src="http://designingwithsound.wordpress.com/files/2009/11/amplitude.png?w=300" alt="Amplitude" width="300" height="203" />  <strong>&#124;</strong><strong> Sound behavior</strong></p>
<p dir="ltr"> Because the sound has the properties as wave, it has properties of &#8220;reflection&#8221; and &#8220;transmission&#8221;, and attenuates in accordance with the distance. These properties are illustrated below for reference.</p>
<p dir="ltr">
When a wave reaches the boundary between one medium another medium, a portion of the wave undergoes reflection and a portion of the wave undergoes transmission across the boundary. The reflected wave may or may not undergo a phase change (i.e., be inverted) depending on the relative densities of the two media. It was also mentioned that the amount of reflection is dependent upon the dissimilarity of the two medium. For this reason, acousticly minded builders of auditoriums and concert halls avoid the use of hard, smooth materials in the construction of their inside halls. A hard material such as concrete is as dissimilar as can be to the air through which the sound moves; subsequently, most of the sound wave is reflected by the walls and little is absorbed. </p>
<p>&#160;</p>
<p dir="ltr"> <img class="alignnone size-medium wp-image-79" title="Transmission" src="http://designingwithsound.wordpress.com/files/2009/11/transmission.png?w=300" alt="Transmission" width="300" height="225" />  </p>
<p>&#160;</p>
<p><img class="alignnone size-medium wp-image-78" title="Reflection" src="http://designingwithsound.wordpress.com/files/2009/11/reflection.png?w=300" alt="Reflection" width="300" height="225" />   </p>
<p>&#160;</p>
<p>Reflection of sound waves off of surfaces can lead to one of two phenomenon &#8211; an echo or a reverberation. <strong>Reverberation &#124; </strong> often occurs in a small room with height, width, and length dimensions of approximately 17 meters or less. Why the magical 17 meters? The effect of a particular sound wave upon the brain endures for more than a tiny fraction of a second; the human brain keeps a sound in memory for up to 0.1 seconds.<strong> If a reflected sound wave reaches the ear</strong> <strong>within 0.1 seconds of the initial sound</strong>, then it seems to the person that the sound is prolonged. The reception of multiple reflections off of walls and ceilings within 0.1 seconds of each other causes reverberations &#8211; the prolonging of a sound. Since sound waves travel at about 340 m/s at room temperature, it will take approximately 0.1 s for a sound to travel the length of a 17 meter room and back, thus causing a reverberation (t = v/d = (340 m/s)/(34 m) = 0.1 s). This is why reverberations is common in rooms with dimensions of approximately 17 meters or less. Perhaps you have observed reverberations when talking in an empty room, when honking the horn while driving through a highway tunnel or underpass, or when singing in the shower. In auditoriums and concert halls, reverberations occasionally occur and lead to the displeasing garbling of a sound.</p>
<p><strong>Echo &#124; </strong>Reflection of sound waves also lead to <strong>echoes</strong>. Echoes are different than reverberations. <strong>Echoes occur when a reflected sound wave reaches the ear</strong> <strong>more than 0.1 seconds after the original sound wave was heard</strong>. If the elapsed time between the arrival of the two sound waves is more than 0.1 seconds, then the sensation of the first sound will have died out . In this case, the arrival of the second sound wave will be perceived as a second sound rather than the prolonging of the first sound. There will be an echo instead of a reverberation. </p>
<p><strong>&#124; Geometry &#38; Reflection</strong></p>
<p>The way sound rays reflect off plane (flat) mirrors or surfaces is very simple: <strong>the angle of incidence is equal to the angle of reflection.</strong></p>
<p>The angles in question are measured with respect to the normal to the reflecting surface. The angle of incidence is the angle the incident light ray makes with the normal, and the angle of reflection is the angle the reflected ray makes with the normal.</p>
<p>This is exactly the same behavior seen in billiard balls bouncing off a rail on a pool table. (We neglect friction and other minor effects.) Even sound waves bouncing off a wall at an angle follow this same law of reflection.</p>
<p><a href="http://designingwithsound.wordpress.com/files/2009/11/geometry_01.png"><img class="alignnone size-medium wp-image-105" title="geometry_01" src="http://designingwithsound.wordpress.com/files/2009/11/geometry_01.png?w=291" alt="" width="291" height="300" /></a><a href="http://designingwithsound.wordpress.com/files/2009/11/geometry_02.png"><img class="alignnone size-medium wp-image-106" title="geometry_02" src="http://designingwithsound.wordpress.com/files/2009/11/geometry_02.png?w=300" alt="" width="300" height="300" /></a><a href="http://designingwithsound.wordpress.com/files/2009/11/geometry_03.png"><img class="alignnone size-medium wp-image-107" title="geometry_03" src="http://designingwithsound.wordpress.com/files/2009/11/geometry_03.png?w=300" alt="" width="300" height="297" /></a><a href="http://designingwithsound.wordpress.com/files/2009/11/geometry_04.png"><img class="alignnone size-medium wp-image-108" title="geometry_04" src="http://designingwithsound.wordpress.com/files/2009/11/geometry_04.png?w=300" alt="" width="300" height="297" /></a></p>
<p><strong>&#124;</strong><strong> Atmospheric effects</strong></p>
<p>Winds will increase sounds downwind from a source and reduce them upwind. This is not solely a result of the velocity effect, but also because the spherical wave-front is deformed by the prevailing wind.   </p>
<p dir="ltr">
<p dir="ltr">
<p dir="ltr"> <img class="alignnone size-medium wp-image-80" title="wind_effects" src="http://designingwithsound.wordpress.com/files/2009/11/wind_effects.png?w=300" alt="wind_effects" width="300" height="63" /></p>
<p dir="ltr">As discussed previously, the speed of sound is dependant on temperature, the higher the temperature, the higher the speed. This means that when the temperature near the ground is higher than that of the upper air, sound rays tend to arc upwards slightly. Thus less energy will reach a listener some distance away at ground level. (For a given amount of sound energy, the distribution area is increased).</p>
<p dir="ltr">At night, when the ground surface is cooler than the upper air, the inverse occurs: sound energy tends to arc downwards. (For a given amount of sound energy, the distribution area is reduced).</p>
<p dir="ltr">
<p dir="ltr"><img class="alignnone size-medium wp-image-81" title="temp_gradient" src="http://designingwithsound.wordpress.com/files/2009/11/temp_gradient.png?w=300" alt="temp_gradient" width="300" height="58" />  </p>
<p dir="ltr"><strong>&#124;</strong><strong> Barrier Design</strong></p>
<p dir="ltr">Barriers, such as walls or screens, will act to create an acoustic shadow. The reduction in sound level within this shadow zone is dedendant on frequency (as we discussed earlier). At high frequencies the effect of the barrier is most pronounced whereas at low frequencies much diffraction occurs at the edges, so the shadow effect is diminished.</p>
<p dir="ltr">
<p dir="ltr"> <img class="alignnone size-medium wp-image-82" title="shadow" src="http://designingwithsound.wordpress.com/files/2009/11/shadow.png?w=283" alt="shadow" width="283" height="300" /></p>
<p dir="ltr"><strong>&#124;</strong><strong> Type of Road and Average Speed</strong></p>
<p dir="ltr">Rural roads &#8211; 110 km/h speed limit &#8211; use 1<br />
Urban Freeway &#8211; 90 km/h speed limit &#8211; use 92<br />
Urban Highway &#8211; 70 km/h speed limit &#8211; use 65<br />
Urban Street &#8211; Dual Carriageway &#8211; use 60<br />
Urban Street &#8211; Single Carriageway &#8211; use 55<br />
Urban Street &#8211; Single Congested &#8211; use 50 </p>
<p><strong> </strong></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[The barriers perceived to prevent the successful implementation of evidence-based practice by speech and language therapists ]]></title>
<link>http://callierlibrary.wordpress.com/2009/11/07/the-barriers-perceived-to-prevent-the-successful-implementation-of-evidence-based-practice-by-speech-and-language-therapists-2/</link>
<pubDate>Sat, 07 Nov 2009 17:04:38 +0000</pubDate>
<dc:creator>Callier Library</dc:creator>
<guid>http://callierlibrary.wordpress.com/2009/11/07/the-barriers-perceived-to-prevent-the-successful-implementation-of-evidence-based-practice-by-speech-and-language-therapists-2/</guid>
<description><![CDATA[Background: There is currently a paucity of research investigating what speech and language therapis]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Background: There is currently a paucity of research investigating what speech and language therapists, in particular, perceive are the greatest barriers to implementing evidence-based practice. </p>
<p>Aims: The purpose of this study was to investigate the perceived barriers that are faced by speech and language therapists in southern Ireland when attempting to implement evidence-based practice. </p>
<p>Methods &#38; Procedures: A 34-item questionnaire was sent to 39 therapists working in several counties in southern Ireland. The survey received an 82.1% (n = 32) response rate. </p>
<p>Outcomes &#38; Results: The results of the study indicated that certain barriers are perceived to prevent evidence-based practice being implemented successfully. The most significant barrier affecting evidence-based practice implementation was reported to be a lack of time to read research (71.9%). Additional barriers that were found to be the most significant were the research having methodological inadequacies (62.5%) and insufficient time to implement new ideas (59.4%). Other important factors identified as being significant barriers to the implementation of evidence-based practice were those associated with the quality and presentation of the research, workplace setting, and lack of skills of the therapist. Associations between specific barriers and workplace setting or grade were also investigated. Some possible reasons for these barriers and the implications for clinical practice are also discussed. </p>
<p>Conclusions &#38; Implications: This small study suggests that therapists agreed that evidence-based practice is essential to the practice of speech and language therapy. There are, however, barriers in place that are perceived to prevent its successful implementation. It is hoped that because these barriers have been identified, individual clinicians and organizations can be proactive in aiming to provide an evidence-based service to their clients. </p>
<p>from the <a href="http://www.informaworld.com/smpp/content~content=a916273929~db=all~jumptype=rss"><em>International Journal of Language and Communication Disorders</em></a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[What are your barriers?]]></title>
<link>http://frugalphotography.wordpress.com/2009/11/06/what-are-your-barriers/</link>
<pubDate>Fri, 06 Nov 2009 16:34:12 +0000</pubDate>
<dc:creator>frugalphotography</dc:creator>
<guid>http://frugalphotography.wordpress.com/2009/11/06/what-are-your-barriers/</guid>
<description><![CDATA[East Side Gallery - Associated Press Photo November the 9th will be the 20th anniversary when East G]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><div id="attachment_46" class="wp-caption alignleft" style="width: 196px"><img class="size-full wp-image-46" title="Berlin Wall - Associated Press" src="http://frugalphotography.wordpress.com/files/2009/11/berlin-wall-associated-press.jpg" alt="Berlin Wall - Associated Press" width="186" height="113" /><p class="wp-caption-text">East Side Gallery - Associated Press Photo</p></div>
<p>November the 9th will be the 20th anniversary when East Germany opened its borders after the challenge from President Ronald Reagan, &#8220;Tear down these walls!&#8221;</p>
<p>I listened this morning to a radio commentary about the event and how this radio host had kept a souvenir of the wall as a reminder of the event. But he went further&#8230;he talked about what it was like today, after 20 years. Had things changed?</p>
<p>To some degree they had, however what people had envisioned would happen didn&#8217;t. East Germany still remains the poor cousin of the West and there differently are still barriers, although not so visiable.</p>
<p>I started to reflect then on what barriers we put in front us that stop us from change &#8211; obtaining our goals and visions. The reasons of course are in our past and solution lies with us.</p>
<p>A good friend up dated his status on Facebook, with &#8220;I must&#8230;must take more pictures?&#8221; Or something like that &#8211; in reference to his lacking of getting out and getting some shots. His lifstyle is &#8220;busy&#8221;. Job, kids, hockey schedules, &#8220;honey-do&#8217;s&#8221; and a merry range of other items fill up the limited hours in his and our days.</p>
<p>The East Side Gallery is getting a face lift today, November 6th. The artists that painted the murals are back putting fresh paint on their master pieces. It is the worlds longest open-air art gallery. To see the wall&#8217;s gallery visit:</p>
<p><a href="http://www.google.com/url?q=http://www.eastsidegallery-berlin.de/&#38;usg=AFQjCNFYXZhqk2rFkR1eopBgyRvoJy_xEA">http://www.eastsidegallery-berlin.de/</a></p>
<p>So what do you do with your barriers. Put a fresh paint on them? Maybe and why not? But put on the paint, not to hid the fact that it is a wall, but to celebrate that it is there. Acknowledge and acceptence are keys to happiness. So what if you are too busy to take photos, or too busy to do whatever&#8230;accept it AND go out and take photos. You ARE a busy person and don&#8217;t let that define you and restrict you from your vision or goals.</p>
<p>&#8220;They&#8221; the committee of they say &#8220;something has to give.&#8221; You can&#8217;t do everything. The great human experiment is to find how much one can do with his life. You don&#8217;t have to do anything, but even the act of doing nothing is something &#8211; so this all gets very confusing&#8230;</p>
<p>I am going to leave you with a few words from a favorite philospher &#8220;Bucky&#8221; Fuller:</p>
<ul>
<li><strong>The Things to do are: the things that need doing, that <em>you</em> see need to be done, and that no one else seems to see need to be done.</strong> Then you will conceive your own way of doing that which needs to be done — that no one else has told you to do or how to do it. This will bring out the real you that often gets buried inside a character that has acquired a superficial array of behaviors induced or imposed by others on the individual.</li>
</ul>
<p>He also said, &#8220;Don&#8217;t fight forces, use them.&#8221; I apply that to mean, don&#8217;t fight the fact that you have a certain lifestyle &#8211; use it to accomplish your vision or goals &#8211; work with it.</p>
<p>Now in closing to my friend&#8230;is it that you want to take great pictures or is just pictures stopping you. You can always take pictures anywhere, anytime and while doing anything&#8230;question is, can you do all that and take great pictures too?</p>
<p>Cheers</p>
<p>(Photo: AP Photo/Gero Breloer)</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[World barriers]]></title>
<link>http://newsaboutcities.wordpress.com/2009/11/06/world-barriers/</link>
<pubDate>Fri, 06 Nov 2009 16:06:19 +0000</pubDate>
<dc:creator>tellmenews</dc:creator>
<guid>http://newsaboutcities.wordpress.com/2009/11/06/world-barriers/</guid>
<description><![CDATA[How the Brazilian city of Rio is walling in its favelas&#8230; From BBC News. Full story This site m]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>How the Brazilian city of Rio is walling in its favelas&#8230; From BBC News. <a href="http://news.bbc.co.uk/go/rss/-/2/hi/americas/8343311.stm">Full story</a></p>
<p>This site may contain information about:  city lights.  The blog is also related to: newyork city.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Barriers]]></title>
<link>http://snakeinthebasement.wordpress.com/2009/11/06/barriers/</link>
<pubDate>Fri, 06 Nov 2009 14:16:19 +0000</pubDate>
<dc:creator>Deborah</dc:creator>
<guid>http://snakeinthebasement.wordpress.com/2009/11/06/barriers/</guid>
<description><![CDATA[]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><span style='text-align:center; display: block;'><object width='425' height='350'><param name='movie' value='http://www.youtube.com/v/KcziqqgpfqI&#038;rel=1&#038;fs=1&#038;showsearch=0&#038;hd=0' /><param name='allowfullscreen' value='true' /><param name='wmode' value='transparent' /><embed src='http://www.youtube.com/v/KcziqqgpfqI&#038;rel=1&#038;fs=1&#038;showsearch=0&#038;hd=0' type='application/x-shockwave-flash' allowfullscreen='true' width='425' height='350' wmode='transparent'></embed></object></span></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Experiments in Spread-Betting Part II]]></title>
<link>http://largecaptrader.wordpress.com/2009/11/05/experiments-in-spread-betting-part-ii/</link>
<pubDate>Fri, 06 Nov 2009 03:03:19 +0000</pubDate>
<dc:creator>largecaptrader</dc:creator>
<guid>http://largecaptrader.wordpress.com/2009/11/05/experiments-in-spread-betting-part-ii/</guid>
<description><![CDATA[ME = IDIOT This blog and its writings represent my public, although still &#8216;private&#8217; iden]]></description>
<content:encoded><![CDATA[ME = IDIOT This blog and its writings represent my public, although still &#8216;private&#8217; iden]]></content:encoded>
</item>
<item>
<title><![CDATA[Why Lean Doesn't Work]]></title>
<link>http://corporatedeathspiral.wordpress.com/2009/11/04/why-lean-doesnt-work/</link>
<pubDate>Wed, 04 Nov 2009 18:11:48 +0000</pubDate>
<dc:creator>gsbizblog</dc:creator>
<guid>http://corporatedeathspiral.wordpress.com/2009/11/04/why-lean-doesnt-work/</guid>
<description><![CDATA[Just to be clear, I am a huge fan of lean. I am a huge fan of Toyota and have seen some great result]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Just to be clear, I am a huge fan of lean.  I am a huge fan of Toyota and have seen some great results from projects over the years.  Lately it seems, though, that lean in the United States and Europe is turning into just another overused, misunderstood concept that everybody does but few actually do well.</p>
<p>Read more at http://corporatedeathspiral.blogspot.com</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[In Utter Loss For Words]]></title>
<link>http://adelyc.wordpress.com/2009/11/04/in-utter-loss-for-words/</link>
<pubDate>Wed, 04 Nov 2009 16:51:15 +0000</pubDate>
<dc:creator>Adel</dc:creator>
<guid>http://adelyc.wordpress.com/2009/11/04/in-utter-loss-for-words/</guid>
<description><![CDATA[  &#8220;If it&#8217;s very painful for you to criticize your friends &#8211; you&#8217;re safe in d]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p style="text-align:center;"><img class="aligncenter size-medium wp-image-84" title="utter loss" src="http://adelyc.wordpress.com/files/2009/11/utter-loss.jpg?w=225" alt="utter loss" width="225" height="300" /> </p>
<p style="text-align:center;"><em>&#8220;If it&#8217;s very painful for you to criticize your friends &#8211; you&#8217;re safe in doing it.  But if you take the slightest pleasure in it, that&#8217;s the time to hold your tongue.&#8221;  ~ Alice Duer Miller</em></p>
<p style="text-align:center;"> </p>
<p style="text-align:center;">&#8220;Other people’s opinion of you does not have to become your reality.&#8221;  ~ Les Brown</p>
<p style="text-align:center;">&#8220;Preconceived notions are the locks on the door to wisdom.&#8221;  ~ Merry Browne</p>
<p style="text-align:center;"> &#8221;Judgements prevent us from seeing the good that lies beyond appearances.&#8221;  ~ Wayne W. Dyer</p>
<p style="text-align:center;"> &#8221;Our thoughts are unseen hands shaping the people we meet.  Whatever we truly think them to be, that&#8217;s what they&#8217;ll become for us.&#8221;  ~ Richard Cowper</p>
<p style="text-align:center;"> &#8221;If only closed minds came with closed mouths.&#8221;</p>
<p style="text-align:center;"> </p>
<p style="text-align:center;"><em> &#8221;I am an invisible man&#8230;. I am a man of substance, of flesh and bone, fiber and liquids &#8211; and I might even be said to possess a mind.  I am invisible, understand, simply because people refuse to see me.&#8221;  ~ Ralph Ellison, The Invisible Man, 1952</em></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Sometimes Love Hurts]]></title>
<link>http://silverspringstudio.wordpress.com/2009/11/03/sometimes-love-hurts/</link>
<pubDate>Tue, 03 Nov 2009 12:30:20 +0000</pubDate>
<dc:creator>carolwiebe</dc:creator>
<guid>http://silverspringstudio.wordpress.com/2009/11/03/sometimes-love-hurts/</guid>
<description><![CDATA[Sometimes Love Hurts ~ by Carol Wiebe Sometimes, love hurts. We might even question if exposing ours]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><div class="wp-caption aligncenter" style="width: 323px"><img src="http://farm3.static.flickr.com/2791/4071957552_bb5b674394_o.jpg" alt="" width="313" height="513" /><p class="wp-caption-text">Sometimes Love Hurts ~ by Carol Wiebe</p></div>
<p>Sometimes, love hurts. We might even question if exposing ourselves to love is worth the potential pain.  </p>
<p>But love is not just a surface emotion: it embodies a wide spectrum of feelings. So wide, that poets, writers, artists, saviours, politicians, advertisers and countless others have tried to define and describe it through the ages. Various holy writings declare that God is Love.</p>
<p>I do not think it is possible to live on this earth and miss the experience of love. Simply being born is a gift of infinite love: we are given access to all the possibilities (including challenges) that life has to offer. The more we open ourselves, the deeper our experience can go.</p>
<blockquote><p>Your task is not to seek for love, but merely to seek and find all the barriers within yourself that you have built against it.    ~ Rumi</p></blockquote>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[The City and the Control of Space]]></title>
<link>http://remap.wordpress.com/2009/11/03/the-city-and-the-control-of-space/</link>
<pubDate>Tue, 03 Nov 2009 08:01:56 +0000</pubDate>
<dc:creator>rbnd1</dc:creator>
<guid>http://remap.wordpress.com/2009/11/03/the-city-and-the-control-of-space/</guid>
<description><![CDATA[The authors were invited to present at the international conference, Metropolitan Desires: Cultural ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>The authors were invited to present at the international conference, <em>Metropolitan Desires: Cultural Reconfigurations of the European City Space, </em>in Manchester, UK on 8th September. The paper, &#8216;The City and the Control of Space&#8217;, discusses the relationship between the city and space [public and private]. More specifically, it focuses on how the city and ownership of space is demarcated, enclosed and implied. The roles of governance and security upon civic, urban and personal space call into question the true nature of that which we consider public. Frequently the design of public space is concerned with the control of that space, rather than its appropriation, [de-re-mis]use and legitimate occupation. Increasingly it is the proximity of digital and real space that is testing these realities and challenging the convention of behavioural patterns established incrementally by the accumulation of policy and technological change during the last 20 years. The question of what constitutes community, networked and residual space is of concern here as are devices of appropriation, enclosure, severance, fragmentation, and cultural identification of space.</p>
<p>&#160;</p>
<p>&#160;</p>
</div>]]></content:encoded>
</item>

</channel>
</rss>
