Hardcore Window Management | LAS | s16e06

Hardcore Window Management | LAS | s16e06

We break out our ugly sticks and beat our desktop into an ultimate nerd power-station! Find out about xmonad, a tiling window manager that might just blow your mind!

THEN – We’ve got the details on Fedora 15 and how to wipe the location tracking data off your Android phone!

PLUS so MUCH MORE!

Thanks to:

GoDaddy.com Use our codes LINUX to save 10% at checkout, or LINUX20 to save 20% on hosting!

Direct Episode Download Links:

HD Video | Large Video | Mobile Video | MP3 | OGG Audio | OGG Video | YouTube

[ad#shownotes]

Episode Show Notes:

Download

22 Responses to “Hardcore Window Management | LAS | s16e06”

  1. Luiz Says:

    I think “OGG Audio” link is pointing to the previous episode.

  2. Anonymous Says:

    Fixed, thanks!

    -Chris

  3. Earl Cameron Says:

    nice show yo!

  4. Birdlives Says:

    Screw xorg. I use fbterm with tmux for tiling on the framebuffer.

  5. KiwiCanuck1973 Says:

    Chris, your running Natty Narwhal. What desktop enviroment did you go for? Would you consider switching to another distro, such as OpenSuse? After your thumbs up review. When is Fedora hate/love week. Looking forward to the Linux Fest with you guys. J@N with science, tech, space theme are awesome. Looking to see what you do next. STOked is an awesome show as well, sometimes a bit fanboyish. You do ask those important questions.

  6. Akshay Verma Says:

    Is there any way I can watch the video version from a place other than blip.tv (neither blip.tv or youtube works in China. :(

  7. Akshay Verma Says:

    Is there any way I can watch the video version from a place other than blip.tv (neither blip.tv or youtube works in China. :(

  8. blackhawkover Says:

    Your links to j@n are not going anywhere. Or maybe it’s jus me. I Love LAS Though.

  9. Anonymous Says:

    All of our episodes can be downloaded with the links above!

  10. Psy Says:

    A friend of mine works as professional haskell programmer. He wrote this tool as a thesis project: http://elbrujohalcon.github.com/hPage

  11. Michishige Kaito Says:

    I use a similar window manager called Awesome. A very fitting name, I have to say. It uses LUA for configuration. Check it out: http://awesome.naquadah.org/

  12. John Beisley Says:

    I’ve also been using Awesome – and found it to be pretty good. Using it both at work and at home. So a +1 on this :)

  13. Anonymous Says:

    Can you guys make sure to have that live schedule in the Google calendar stuff so it notifies me via Android calendar?

  14. Melroy van den Berg Says:

    Openbox 😛

  15. Anonymous Says:

    We’ve added our sessions to the Jupiter Broadcasting Google cal!

    We hope to be live all day, really excited!

  16. Melroy van den Berg Says:

    Example:
    http://ompldr.org/vOGdsYQ

  17. Akshay Verma Says:

    Well..unfortunately not the video version as the server their hosted own (blip.tv) is pretty much also blocked.

  18. Daniel Schultz Says:

    Anyone tried i3 yet…similar philosophy like xmonad but config is done with text…not haskell…in my opinion a good alternative.

  19. nopla Says:

    You asked for it?

    http://www.6809.org.uk/evilwm/

  20. Zaneswaf Says:

    One D.E. I have tried multiple times to install unsuccessfully is etoile. OS10 fans would enjoy its similarities, It is based on the Gnu-step project, and has a big focus on Objective-C I believe, I believe they still have a demo live CD based on ubuntu showcasing their D.E.

  21. MrGizmo757 Says:

    Fedora 15 is very pretty. one of the best Looking Distros i seen. But it’s also the Most Buggiest piece of crap i ever used. :-)

  22. CD-Host CD-Host Says:

    Ran into this video, I know its old but I thought I should comment.  Lazy evaluation mostly doesn’t help with runtime, it is usually a mild negative.  Where it helps is 

    a)  not having to organize your order of execution.  
    b)  allowing you to casually manipulate infinite data structures
    In an eager language if I have to something like calculate and colate 3 lists where the length of the final is based on each of the components I have to constantly have loops within loops and if statements if list A is empty do this, if list B is empty do that….  OK now I know A, B and C have something.  

    All that goes away.  You simply declare the 3 lists, how to combine them and the computer organizes the order of calculation.  Now just to compound that as long as your final result isn’t infinite you go ahead and make all your subsidiary calculations infinite.  So you have variables like “primes” which is the array of all possible primes spinning around in your calculation and the system will simply go down the array as far as it needs to generating more primes as needed as if the array in memory actually was the entire list of all primes.

    For example the hamming numbers are all numbers that are products of the 2^a * 3^b * 5^c 
    to generate such a list in haskell is trivial because the list structure (being infinite) can refer to itself:

    hamming = 1 : merge (map (2*) hamming) (merge (map (3*) hamming) (map (5*) hamming))

    where you can see the list starts with 1 and then merges 3 generated lists: all the existing hamming numbers times 2, 3 and 5 respectively.  The code doesn’t contain any organization of the computation.

     

Leave a Reply