Entries:
Comments:
Posts:

Loading User Information from Channel 9

Something went wrong getting user information from Channel 9

Latest Achievement:

Loading User Information from MSDN

Something went wrong getting user information from MSDN

Visual Studio Achievements

Latest Achievement:

Loading Visual Studio Achievements

Something went wrong getting the Visual Studio Achievements

Comments

ivan_ ivan_ g
  • Brian Beckman: Project Quark - A New Beginning for Quantum Computing Rises from the Ashes of Theoret

    o boy, I wasted 30 minutes on this... I almost loaded up with MS shares Smiley finding the unifying point for all 4 kinds of forces, that would be really cool, too bad it was a joke. Sad Many people are waiting for it.
  • TechFest - Feng Zhao - Tiny Web Services

    The focus on the batteries is because you can deploy and forget.

    In the military scenario you would drop thousands of these chips from an airplane to gather all sorts of data. In fact there are some projects where traffic gets routed from one chip to another trough the network so you can reach motes which are unreachable directly. There are also some techniques where you can sync signals from several motes to build a virtual smart antenna array thus boosting a signal in one direction. It is a very interesting field, I'm glad MS is working in this are. Which means devices would get a lot cheapper. Smiley
  • TechFest - Feng Zhao - Tiny Web Services

    That is not entirely new.

    There are TinyDB and TinyOS for micro motes (sensor networks) designed by UC Berkeley. These things have been around for at least 5 years if not more, there are books written about it.

    I remember while in school we were using these motes to build web services on Apache to query sensors. I know it is different from Tiny Web Services, but the idea was similar. We could monitor occupancy, temperature and location , etc.

    check this out.
    http://www.cs.wmich.edu/wsn/


  • Joe Duffy, Huseyin Yildiz, Daan Leijen, Stephen Toub - Parallel Extensions: Inside the Task Parallel

    to #4

    I understand you can have many apps running on your dev box, but as long as processor core utilization is not 100% you should be able to successefully schedule your tasks on that core. It is similar to load balancing technique or a time compression utilization. So your parrallel code will experience parallel run-time environment before production, it could be slower though, so what.

  • Erik Meijer: Functional Programming

    I haven't read all of the posts. But what does IO do besides telling me/compiler/whoever that the function is impure?

    For example if I define a function which returns int, but could also have exceptions, than from a pure functional approach I can also get a super set of two. IE = {int U Exception}  and let my funciton return IE, in that case it would be very "honest", wouldn't it? Why not have some suffix? int impure_function(x)....?
  • This Week on Channel 9: Feb 8, 2008 Episode

    Very nice show!

    But some of you guys REALLY NEED TO LOOK IN THE CAMERA not somewhere else. Otherwise it looks weird Sad
  • JAOO 2007: Joe Armstrong - On Erlang, OO, Concurrency, Shared State and the Future, Part 2

    sorry for the silly question. When Joe was talking about fault tolerance, he said something that you could copy one machine on to the other, or whatever one machine does can be replicated on the other machine. 
    How would you create another copy in a secure fashion? How to make sure that only a certain entity/function/whatever can create a copy, especially when there is nothing to copy from when everything is crashed, wouldn't there be a need for a static state which can be replicated? What if that third entity crashes, wouldn't there be a need for every machine to be able to create another machine and exchange messages to see whether there is at least one machine running, somebody also needs to hold a security policy, that is static... right? no?...
  • Byron Cook: Inside Terminator

    to the above post. You can't pass an infinite positive in a system which can represent only finite numbers, however the different permutations of the state transitions could be infinite (or at least of a much larger order), so hence the point can you terminate the state transitions passing a finite number.

    Anyways, Byron made a typo:

    he was trying to prove
    (x>0 && y>0 && x`=x && y`=y-1)
                            ||
    (x>0 && y>0 && y`=y-1 && x`=x)

    what should be is the following, because the above two are the same, unless I forgot boolean algebra:

    (x>0 && y>0 && x`=x && y`=y-1)
                            ||
    (x>0 && y>0 && x`=x-1 && y`=y)

    Great stuff, I miss that in my day-to-day .NET life Smiley