Channel 9 - Entries tagged with Algorithms Microsoft http://mschnlnine.vo.llnwd.net/d1/Dev/App_Themes/C9/images/feedimage.png Channel 9 - Entries tagged with Algorithms http://channel9.msdn.com/Tags/algorithms Channel 9 keeps you up to date with the latest news and behind the scenes info from Microsoft that developers love to keep up with. From LINQ to SilverLight – Watch videos and hear about all the cool technologies coming and the people behind them. http://channel9.msdn.com/Tags/algorithms en Sat, 18 May 2013 06:57:22 GMT Sat, 18 May 2013 06:57:22 GMT Rev9 15 1 25 Brian Beckman: Hidden Markov Models, Viterbi Algorithm, LINQ, Rx and Higgs Boson It's been WAY too long since we've had Brian Beckman sharing knowledge, insights and perspectives on Channel 9. This changes now! Smiley

Needless to say, I was incredibly happy to spend an hour with Brian learning all about what he's up to these days. Not surprisingly, he's writing code and employing Rx and monads to solve very interesting problems. In this conversation (a code lesson, algorithm survey, a splash of random topical diversion), Brian explains and demonstrates his latest endeavor: implementing the Viterbi algorithm in C#. What's the Viterbi algorithm, Brian? What are hidden Markov models? What are you using this stuff for? Where does Rx fit into this? What's going on? By the way, it's awesome to learn that a Niner has been sharing C# monadic implementations with Brian (state monad, maybe monad). Smiley

Of course, no conversation with Brian - a physicist by training and a software architect at Microsoft - is complete without talking about some current physics problem: Finding the elusive Higgs Boson is all the rage these days, so we talk about what it means.

Brian also shares insights on Haskell, functional and hybrid programming languages (C# is imperative, but it provides functional capabilities like LINQ, for example, upon which Rx is built (Rx is LINQ-to-Streams or observable sequences of events, really)...). We also finally discuss his previous work at MS that we never got a chance to talk to him about while he was doing it. Before joining the Bing Mobile team, Brian was working on a project to create a new functional programming language. What was it?

Thank you, Brian!

Happy holidays from Channel 9 wherever you are and whatever, if anything, you're celebrating!


Notes and More:

The code Brian demos (download it, unzip it, launch VS, open the solution, then watch this video and play along): https://github.com/rebcabin/DotNetExtensionsImproved

From Wikipedia - information on Markov and Viterbi:

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobserved (hidden) states

The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observed events, especially in the context of Markov information sources, and more generally, hidden Markov models.

]]> http://channel9.msdn.com/Shows/Going+Deep/Brian-Beckman-Hidden-Markov-Models-Viterbi-Algorithm-LINQ-Rx-and-Higgs-Boson It's been WAY too long since we've had Brian Beckman sharing knowledge, insights and perspectives on Channel 9. This changes now! Needless to say, I was incredibly happy to spend an hour with Brian learning all about what he's up to these days. Not surprisingly, he's writing code and employing Rx and monads to solve very interesting problems. In this conversation (a code lesson, algorithm survey, a splash of random topical diversion), Brian explains and demonstrates his latest endeavor: implementing the Viterbi algorithm in C#. What's the Viterbi algorithm, Brian? What are hidden Markov models? What are you using this stuff for? Where does Rx fit into this? What's going on? By the way, it's awesome to learn that a Niner has been sharing C# monadic implementations with Brian (state monad, maybe monad). Of course, no conversation with Brian - a physicist by training and a software architect at Microsoft - is complete without talking about some current physics problem: Finding the elusive Higgs Boson is all the rage these days, so we talk about what it means. Brian also shares insights on Haskell, functional and hybrid programming languages (C# is imperative, but it provides functional capabilities like LINQ, for example, upon which Rx is built (Rx is LINQ-to-Streams or observable sequences of events, really)...). We also finally discuss his previous work at MS that we never got a chance to talk to him about while he was doing it. Before joining the Bing Mobile team, Brian was working on a project to create a new functional programming language. What was it? Thank you, Brian!Happy holidays from Channel 9 wherever you are and whatever, if anything, you're celebrating!Notes and More:The code Brian demos (download it, unzip it, launch VS, open the solution, then watch this video and play along): https://github.com/rebcabin/DotNetExtensionsImprovedFrom Wikipedia - information on Markov and Viterbi: A hidden Markov model (HMM) is a s 3784 http://channel9.msdn.com/Shows/Going+Deep/Brian-Beckman-Hidden-Markov-Models-Viterbi-Algorithm-LINQ-Rx-and-Higgs-Boson Sun, 25 Dec 2011 12:00:00 GMT http://channel9.msdn.com/Shows/Going+Deep/Brian-Beckman-Hidden-Markov-Models-Viterbi-Algorithm-LINQ-Rx-and-Higgs-Boson Charles Charles 42 http://channel9.msdn.com/Shows/Going+Deep/Brian-Beckman-Hidden-Markov-Models-Viterbi-Algorithm-LINQ-Rx-and-Higgs-Boson/RSS Algorithms Brian Beckman C# Functional Programming LINQ Mathematics Physics Programming Rx _techmeme C9 Lectures: Yuri Gurevich - Introduction to Algorithms and Computational Complexity, 3 of 3 The great Yuri Gurevich is back!! Smiley Yuri is a logician, computer scientist, and inventor of abstract state machines. He currently works in Microsoft Research (he's a member of Wolfram Schulte's RiSE team).

This is the third and final part in our introductory series of lectures exploring the fundamental logical construct that powers all that we do as software engineers—the algorithm.

In part 3, Dr. Gurevich teaches us about bounded complexity and the axiomatic definition of sequential algorithms.

Find some time to watch this. You'll be learning about algorithms from one of the world's premiere minds in the science of logic and algorithms. In this lecture, Yuri references a few of his academic papers, which you can find here.

Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner Nation. We all really appreciate it! Thanks, too, to Wes Dyer and Bart De Smet for being our live audience for this lecture and asking great questions.

Part 1
Part 2

]]> http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-3-of-3 The great Yuri Gurevich is back!! Yuri is a logician, computer scientist, and inventor of abstract state machines. He currently works in Microsoft Research (he's a member of Wolfram Schulte's RiSE team). This is the third and final part in our introductory series of lectures exploring the fundamental logical construct that powers all that we do as software engineers—the algorithm. In part 3, Dr. Gurevich teaches us about bounded complexity and the axiomatic definition of sequential algorithms. Find some time to watch this. You'll be learning about algorithms from one of the world's premiere minds in the science of logic and algorithms. In this lecture, Yuri references a few of his academic papers, which you can find here. Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner Nation. We all really appreciate it! Thanks, too, to Wes Dyer and Bart De Smet for being our live audience for this lecture and asking great questions. Part 1Part 2 3737 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-3-of-3 Thu, 21 Apr 2011 18:48:35 GMT http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-3-of-3 Charles Charles 3 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-3-of-3/RSS Advanced Algorithms C9 Lectures Computer Science RiSE Yuri Gurevich C9 Lectures: Yuri Gurevich - Introduction to Algorithms and Computational Complexity, 2 of n Yuri Gurevich is back on C9!! Smiley Yuri is a logician, computer scientist and inventor of abstract state machines. He currently works at Microsoft Research (he's a member of Wolfram Schulte's RiSE team).

This is the second part in a series of lectures exploring the fundamental logic-recipe powering all that we do as software engineers and computer scientists—the algorithm. What is an algorithm? You may be surprised to learn that this is not a simple question. Nonetheless, in this video, Yuri presents an answer—one that is perhaps somewhat controversial in nature—based on his own research and philosophy.

Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner Nation. We all really appreciate it! Thanks, too, to Wes Dyer and Bart De Smet for being our live audience for this lecture and asking great questions!

See Part 1
See Part 3

]]> http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-2-of-n Yuri Gurevich is back on C9!!  Yuri is a logician, computer scientist and inventor of abstract state machines. He currently works at Microsoft Research (he's a member of Wolfram Schulte's RiSE team). This is the second part in a series of lectures exploring the fundamental logic-recipe powering all that we do as software engineers and computer scientists—the algorithm. What is an algorithm? You may be surprised to learn that this is not a simple question. Nonetheless, in this video, Yuri presents an answer—one that is perhaps somewhat controversial in nature—based on his own research and philosophy. Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner Nation. We all really appreciate it! Thanks, too, to Wes Dyer and Bart De Smet for being our live audience for this lecture and asking great questions!See Part 1See Part 3 3596 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-2-of-n Wed, 16 Feb 2011 17:29:56 GMT http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-2-of-n Charles Charles 11 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity-2-of-n/RSS Algorithms C9 Lectures C9 Algorithms Computer Science RiSE Theory Yuri Gurevich C9 Lectures: Stephan T. Lavavej - Standard Template Library (STL), 7 of n Welcome to another installment of C9 Lectures covering the powerful general C++ library, STL. Joining us once again is the great Stephan T. Lavavej, Microsoft's keeper of the STL cloth (this means he manages the partnership between the owners of STL (dinkumware) and Microsoft, including, of course, bug fixes and enhancements to the STL that ships as part of Visual C++). Simply, Stephan is a C++ library developer.

As is Stephan's nature, he elaborates on technical details in very substantive way. The Standard Template Library, orSTL, is a C++ library of container classes, algorithms, and iterators. STL provides many fundamental algorithms and data structures. Furthermore, the STL is a general-purpose library: its components are heavily parameterized, such that almost every component in the STL is a template.

In part 7, Stephan continues to dig into STL algorithms, specifically insert iterators, sorting and related functions.

Enjoy! Learn!

Books mentioned by Stephen:

The C++ Standard Library: A Tutorial And Reference by Nicolai M. Josuttis
Effective STL by Scott Meyers

[STL Introduction lecture links]

Part 1 (sequence containers)

Part 2 (associative containers)

Part 3 (smart pointers)

Part 4 (Nurikabe solver) - see Wikipedia's article and Stephan's updated source code

Part 5 (Nurikabe solver, continued)

Part 6 (algorithms and functors)

Part 7 (algorithms and functors, continued)

Part 8 (regular expressions)

Part 9 (rvalue references)

Part 10 (type traits)

]]> http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-7-of-n Welcome to another installment of C9 Lectures covering the powerful general C++ library, STL. Joining us once again is the great Stephan T. Lavavej, Microsoft's keeper of the STL cloth (this means he manages the partnership between the owners of STL (dinkumware) and Microsoft, including, of course, bug fixes and enhancements to the STL that ships as part of Visual C++). Simply, Stephan is a C++ library developer.As is Stephan's nature, he elaborates on technical details in very substantive way. The Standard Template Library, orSTL, is a C++ library of container classes, algorithms, and iterators. STL provides many fundamental algorithms and data structures. Furthermore, the STL is a general-purpose library: its components are heavily parameterized, such that almost every component in the STL is a template. In part 7, Stephan continues to dig into STL algorithms, specifically insert iterators, sorting and related functions.Enjoy! Learn!Books mentioned by Stephen: The C++ Standard Library: A Tutorial And Reference by Nicolai M. JosuttisEffective STL by Scott Meyers [STL Introduction lecture links] Part 1 (sequence containers) Part 2 (associative containers) Part 3 (smart pointers) Part 4 (Nurikabe solver) - see Wikipedia's article and Stephan's updated source code Part 5 (Nurikabe solver, continued) Part 6 (algorithms and functors) Part 7 (algorithms and functors, continued) Part 8 (regular expressions) Part 9 (rvalue references) Part 10 (type traits) 2583 http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-7-of-n Fri, 22 Oct 2010 17:27:25 GMT http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-7-of-n Charles Charles 37 http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-7-of-n/RSS Algorithms C++ C9 Lectures Programming Stephan T Lavavej STL C9 Lectures: Stephan T. Lavavej - Standard Template Library (STL), 6 of n Welcome to another installment of C9 Lectures covering the powerful general C++ library, STL. Joining us once again is the great Stephan T. Lavavej, Microsoft's keeper of the STL cloth (this means he manages the partnership between the owners of STL (dinkumware) and Microsoft, including, of course, bug fixes and enhancements to the STL that ships as part of Visual C++). Simply, Stephan is a C++ library developer.

As is Stephan's nature, he elaborates on technical details in very substantive way. The Standard Template Library, orSTL, is a C++ library of container classes, algorithms, and iterators. STL provides many fundamental algorithms and data structures. Furthermore, the STL is a general-purpose library: its components are heavily parameterized, such that almost every component in the STL is a template.

In part 6, Stephan guides us into the logical and beautiful world of algorithms. STL shines here.

Enjoy! Learn!

Books mentioned by Stephen:

The C++ Standard Library: A Tutorial And Reference by Nicolai M. Josuttis
Effective STL by Scott Meyers

[STL Introduction lecture links]

Part 1 (sequence containers)

Part 2 (associative containers)

Part 3 (smart pointers)

Part 4 (Nurikabe solver) - see Wikipedia's article and Stephan's updated source code

Part 5 (Nurikabe solver, continued)

Part 6 (algorithms and functors)

Part 7 (algorithms and functors, continued)

Part 8 (regular expressions)

Part 9 (rvalue references)

Part 10 (type traits)

]]> http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-6-of-n Welcome to another installment of C9 Lectures covering the powerful general C++ library, STL. Joining us once again is the great Stephan T. Lavavej, Microsoft's keeper of the STL cloth (this means he manages the partnership between the owners of STL (dinkumware) and Microsoft, including, of course, bug fixes and enhancements to the STL that ships as part of Visual C++). Simply, Stephan is a C++ library developer.As is Stephan's nature, he elaborates on technical details in very substantive way. The Standard Template Library, orSTL, is a C++ library of container classes, algorithms, and iterators. STL provides many fundamental algorithms and data structures. Furthermore, the STL is a general-purpose library: its components are heavily parameterized, such that almost every component in the STL is a template. In part 6, Stephan guides us into the logical and beautiful world of algorithms. STL shines here.Enjoy! Learn!Books mentioned by Stephen: The C++ Standard Library: A Tutorial And Reference by Nicolai M. JosuttisEffective STL by Scott Meyers [STL Introduction lecture links] Part 1 (sequence containers) Part 2 (associative containers) Part 3 (smart pointers) Part 4 (Nurikabe solver) - see Wikipedia's article and Stephan's updated source code Part 5 (Nurikabe solver, continued) Part 6 (algorithms and functors) Part 7 (algorithms and functors, continued) Part 8 (regular expressions) Part 9 (rvalue references) Part 10 (type traits) 2270 http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-6-of-n Wed, 13 Oct 2010 20:32:20 GMT http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-6-of-n Charles Charles 36 http://channel9.msdn.com/Series/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-/C9-Lectures-Stephan-T-Lavavej-Standard-Template-Library-STL-6-of-n/RSS Algorithms C++ C9 Lectures Programming Programming Languages Stephan T Lavavej STL Mike Swanson: Adobe Illustrator to HTML5 Canvas - Under the Hood The Ai->Canvas plug-in enables Adobe® Illustrator® to export vector and bitmap artwork directly to an HTML5 canvas element that can be rendered in a canvas-enabled browser. The plug-in provides drawing, animation and coding options such as events so that you can build interactive, well-designed canvas-based web apps. The purpose of Ai->Canvas is to accelerate your HTML5 canvas development. The HTML and JavaScript that it exports is meant to be copied into your own application and extended. Learn how to subscribe to built-in events, determine if a shape has been clicked, and debug the exported code. 

Here, Ai->Canvas creator, Mike Swanson, spends some quality time with me digging into the details inside and behind this very useful tool. We cover many areas including, but not limited to, the plug-in's architecture, performance characteristics, design decisions, native code to JavaScript conversion tactics and implementation, etc. Mike spends most of his time where a Going Deep guest must: at the whiteboard. He also demos his latest conversion technology and I must say, it is really impressive. Mike is a great engineer.

You can jump right into the rabbit hole with us here.

Tune in.

Enjoy. Learn.

 

]]> http://channel9.msdn.com/Shows/Going+Deep/Mike-Swanson-Adobe-Illustrator-to-HTML5-Canvas-Under-the-Hood The Ai->Canvas plug-in enables Adobe® Illustrator® to export vector and bitmap artwork directly to an HTML5 canvas element that can be rendered in a canvas-enabled browser. The plug-in provides drawing, animation and coding options such as events so that you can build interactive, well-designed canvas-based web apps. The purpose of Ai->Canvas is to accelerate your HTML5 canvas development. The HTML and JavaScript that it exports is meant to be copied into your own application and extended. Learn how to subscribe to built-in events, determine if a shape has been clicked, and debug the exported code.  Here, Ai->Canvas creator, Mike Swanson, spends some quality time with me digging into the details inside and behind this very useful tool. We cover many areas including, but not limited to, the plug-in's architecture, performance characteristics, design decisions, native code to JavaScript conversion tactics and implementation, etc. Mike spends most of his time where a Going Deep guest must: at the whiteboard. He also demos his latest conversion technology and I must say, it is really impressive. Mike is a great engineer. You can jump right into the rabbit hole with us here. Tune in. Enjoy. Learn.   3260 http://channel9.msdn.com/Shows/Going+Deep/Mike-Swanson-Adobe-Illustrator-to-HTML5-Canvas-Under-the-Hood Tue, 12 Oct 2010 19:59:19 GMT http://channel9.msdn.com/Shows/Going+Deep/Mike-Swanson-Adobe-Illustrator-to-HTML5-Canvas-Under-the-Hood Charles Charles 3 http://channel9.msdn.com/Shows/Going+Deep/Mike-Swanson-Adobe-Illustrator-to-HTML5-Canvas-Under-the-Hood/RSS Adobe Illustrator Algorithms C++ Graphics HTML 5 HTML5 JavaScript Programming Vector Graphics Plenoptics Brings Photo Enhancement From Big Screen Fiction to Small Screen Perfection It’s the perfect moment. The family are together, everyone’s having a great time, this is going to make a killer photo. SNAP! Quick check on the camera’s LCD – looks brilliant. That’s the one that’s going in the family album. The following day, you review your photos, seeking the one. You find it, open it and... ah, the cameras auto-focus picked out the tree, which admittedly looks great, but the family are out of focus. Another moment lost.

Welcome to my world of photography. I love taking photos, it’s just that I’m not that great at it. I’m convinced that auto-focus, and anti-shake features were invented just for me. They’ve gone a long way to making my shots respectable, but the small LCD screens built into camera simply can’t tell you how well focused an image is going to look at full resolution on screen.

If, like me, you’ve lusted after the infamous “Image Enhance” technology that’s seemingly prevalent in every Hollywood blockbuster you can name, it might just be on the horizon.Laptop Magazine reports on a new technology demonstrated by Adobe at the NVIDIA GPU Technology Conference this week. Photography using advanced Plenoptic lenses allow images to be rendered using computational algorithms, allowing any part of a photo to be brought into focus after it has been taken.

Plenoptic lenses work by cramming in hundreds of lenses together. The resulting image looks like a blurry mosaic, but with much more information captured by the lens, it can be manipulated in software to allow specific areas to be focused.

Back to my lost moment earlier. Rather than a good 5 minutes with a stress ball, with plenoptics it would be Step 1. Unfocus Tree. Step 2. Focus Family. Step 3. Receive plaudits for excellence in photography.

The technology is yet to be commercialised, but check out this great demo of the use of plenoptic lenses from Adobe’s Senior Research Scientist, Teodor Georgiev. It’s a brilliant example of science fiction slowly becoming science fact.

 

]]> http://channel9.msdn.com/Blogs/coolstuff/Plenoptics-Brings-Photo-Enhancement-From-Big-Screen-Fiction-to-Small-Screen-Perfection It’s the perfect moment. The family are together, everyone’s having a great time, this is going to make a killer photo. SNAP! Quick check on the camera’s LCD – looks brilliant. That’s the one that’s going in the family album. The following day, you review your photos, seeking the one. You find it, open it and... ah, the cameras auto-focus picked out the tree, which admittedly looks great, but the family are out of focus. Another moment lost. Welcome to my world of photography. I love taking photos, it’s just that I’m not that great at it. I’m convinced that auto-focus, and anti-shake features were invented just for me. They’ve gone a long way to making my shots respectable, but the small LCD screens built into camera simply can’t tell you how well focused an image is going to look at full resolution on screen. If, like me, you’ve lusted after the infamous “Image Enhance” technology that’s seemingly prevalent in every Hollywood blockbuster you can name, it might just be on the horizon.Laptop Magazine reports on a new technology demonstrated by Adobe at the NVIDIA GPU Technology Conference this week. Photography using advanced Plenoptic lenses allow images to be rendered using computational algorithms, allowing any part of a photo to be brought into focus after it has been taken. Plenoptic lenses work by cramming in hundreds of lenses together. The resulting image looks like a blurry mosaic, but with much more information captured by the lens, it can be manipulated in software to allow specific areas to be focused. Back to my lost moment earlier. Rather than a good 5 minutes with a stress ball, with plenoptics it would be Step 1. Unfocus Tree. Step 2. Focus Family. Step 3. Receive plaudits for excellence in photography. The technology is yet to be commercialised, but check out this great demo of the use of plenoptic lenses from Adobe’s Senior Research Scientist, Teodor Georgiev. It’s a brilliant example of science fiction slowly becoming science fact.   http://channel9.msdn.com/Blogs/coolstuff/Plenoptics-Brings-Photo-Enhancement-From-Big-Screen-Fiction-to-Small-Screen-Perfection Fri, 24 Sep 2010 18:20:14 GMT http://channel9.msdn.com/Blogs/coolstuff/Plenoptics-Brings-Photo-Enhancement-From-Big-Screen-Fiction-to-Small-Screen-Perfection Terry Walsh Terry Walsh 1 http://channel9.msdn.com/Blogs/coolstuff/Plenoptics-Brings-Photo-Enhancement-From-Big-Screen-Fiction-to-Small-Screen-Perfection/RSS Algorithms Software Digital Photography Adobe C9 Lectures: Yuri Gurevich - Introduction to Algorithms and Computational Complexity, 1 of n In mathematics, computer science, and related subjects, an 'algorithm' is an effective method for solving a problem expressed as a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields. (In more advanced or abstract settings, the instructions do not necessarily constitute a finite sequence, or even a sequence; see, for example, "nondeterministic algorithm".)

Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness.

Here, the great Yuri Gurevich, mathematician, computer scientist and inventor of abstract state machines, will teach us about algorithms beginning with this introductory lecture that includes plenty of historical context. This is the first in a series of lectures exploring the fundamental logic that powers all that we as software engineers and computer scientists do in computing--the algorithm. What is an algorithm, exactly? You may be surprised to learn that this is actually not a very simple question...

Find some time to watch this introduction on a truly fascinating topic by one of the world's premiere minds in the field of mathematical logic and algorithms. We designed this to increase in complexity over time, like a typical college course, so Yuri moves slowly through several topics, providing plenty of time for viewers to catch up before moving on to more advanced topics.

Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner nation. We all really appreciate it! Thanks, too, to Karsten and Sampy for being our live audience for this lecture and asking great questions!

See Part 2
See Part 3

]]> http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History In mathematics, computer science, and related subjects, an 'algorithm' is an effective method for solving a problem expressed as a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields. (In more advanced or abstract settings, the instructions do not necessarily constitute a finite sequence, or even a sequence; see, for example, "nondeterministic algorithm".) Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness.Here, the great Yuri Gurevich, mathematician, computer scientist and inventor of abstract state machines, will teach us about algorithms beginning with this introductory lecture that includes plenty of historical context. This is the first in a series of lectures exploring the fundamental logic that powers all that we as software engineers and computer scientists do in computing--the algorithm. What is an algorithm, exactly? You may be surprised to learn that this is actually not a very simple question... Find some time to watch this introduction on a truly fascinating topic by one of the world's premiere minds in the field of mathematical logic and algorithms. We designed this to increase in complexity over time, like a typical college course, so Yuri moves slowly through several topics, providing plenty of time for viewers to catch up before moving on to more advanced topics. Thank you, Yuri, for taking the time to share your extensive knowledge and gentle, kind spirit with Niner nation. We all really appreciate it! Thanks, too, to Karsten and Sampy for being our live audience for this lecture and asking great que 4876 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History Thu, 01 Jul 2010 22:34:00 GMT http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History Charles Charles 19 http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History/RSS Algorithms C9 Lectures Computer Science Logic Mathematics Programming RiSE Yuri Gurevich STL: Some Underlying Algorithms, Data Structures, and More with Stephan T. Lavavej native functionality, specifically in the STL (Standard Template Library) that ships with VS 2010.

Who better to dig into some STL internals than the great Stephan T. Lavavej? Stephan spends most of his time maintaining the STL (along with the core producers of the library, who last I heard work from a remote location in Hawaii...). Stephan is no stranger to those of us who spend time in the native programming world (and use C++, specifically, to compose), and you've already met Stephan a few times on C9.

As always, this conversation just happened. Stephan and I didn't draft up some highly structured and scripted plan. Spontaneity is always our goal, and we met that goal here! So, if you are interested in STL internals and C++ in general, then this is for you.

Thank you, Stephan, for another great lesson.

Enjoy!
]]> http://channel9.msdn.com/Shows/Going+Deep/STL-Some-Underlying-Algorithms-Data-Structures-and-More-with-Stephan-T-Lavavej With the recent release of Visual Studio 2010 and .NET 4/Silverlight 4 (Managed 4), I figured it was time to learn a thing or two about some new native functionality, specifically in the STL (Standard Template Library) that ships with VS 2010. Who better to dig into some STL internals than the great Stephan T. Lavavej? Stephan spends most of his time maintaining the STL (along with the core producers of the library, who last I heard work from a remote location in Hawaii...). Stephan is no stranger to those of us who spend time in the native programming world (and use C++, specifically, to compose), and you've already met Stephan a few times on C9. As always, this conversation just happened. Stephan and I didn't draft up some highly structured and scripted plan. Spontaneity is always our goal, and we met that goal here! So, if you are interested in STL internals and C++ in general, then this is for you. Thank you, Stephan, for another great lesson.Enjoy! 3107 http://channel9.msdn.com/Shows/Going+Deep/STL-Some-Underlying-Algorithms-Data-Structures-and-More-with-Stephan-T-Lavavej Tue, 04 May 2010 19:59:00 GMT http://channel9.msdn.com/Shows/Going+Deep/STL-Some-Underlying-Algorithms-Data-Structures-and-More-with-Stephan-T-Lavavej Charles Charles 24 http://channel9.msdn.com/Shows/Going+Deep/STL-Some-Underlying-Algorithms-Data-Structures-and-More-with-Stephan-T-Lavavej/RSS Algorithms C++ Programming Programming Languages Stephan T Lavavej STL E2E: Erik Meijer and Leslie Lamport - Mathematical Reasoning and Distributed Systems A distributed system is one in which the failure of a computer you didn't even know existed can render your own computer unusable. -Leslie Lamport.


Leslie Lamport is a computer scientist and mathematician best known for his work with distributed systems. In fact, Dr. Lamport’s research contributions laid the foundations for the theory of distributed systems. He currently works in Microsoft Research where most of his time is spent developing formal semantics (with mathematical logic) for specifying and reasoning about algorithms.

Here, Dr. Erik Meijer, computer scientist and programming language/library designer, sits down with Dr. Lamport to discuss several aspects of Dr. Lamport's body of work in computer science.

Dr. Lamport's TLA, the Temporal Logic of Actions, is a logic for specifying and reasoning about concurrent and reactive systems. TLA+ is the latest incarnation of this formal specification toolset.

]]> http://channel9.msdn.com/Shows/Going+Deep/E2E-Erik-Meijer-and-Leslie-Lamport-Mathematical-Reasoning-and-Distributed-Systems A distributed system is one in which the failure of a computer you didn't even know existed can render your own computer unusable. -Leslie Lamport. Leslie Lamport is a computer scientist and mathematician best known for his work with distributed systems. In fact, Dr. Lamport’s research contributions laid the foundations for the theory of distributed systems. He currently works in Microsoft Research where most of his time is spent developing formal semantics (with mathematical logic) for specifying and reasoning about algorithms. Here, Dr. Erik Meijer, computer scientist and programming language/library designer, sits down with Dr. Lamport to discuss several aspects of Dr. Lamport's body of work in computer science. Dr. Lamport's TLA, the Temporal Logic of Actions, is a logic for specifying and reasoning about concurrent and reactive systems. TLA+ is the latest incarnation of this formal specification toolset. 3371 http://channel9.msdn.com/Shows/Going+Deep/E2E-Erik-Meijer-and-Leslie-Lamport-Mathematical-Reasoning-and-Distributed-Systems Tue, 09 Mar 2010 20:06:00 GMT http://channel9.msdn.com/Shows/Going+Deep/E2E-Erik-Meijer-and-Leslie-Lamport-Mathematical-Reasoning-and-Distributed-Systems Charles Charles 11 http://channel9.msdn.com/Shows/Going+Deep/E2E-Erik-Meijer-and-Leslie-Lamport-Mathematical-Reasoning-and-Distributed-Systems/RSS Algorithms Computer Science Erik Meijer Expert to Expert Mathematics Microsoft Research MS Research Programming TLA Deep Dive into U-Prove Cryptographic Protocols If you want to go even deeper, Stefan's book on the topic is freely available on line.

  • Get the CTP here
  • Get the C# edition
  • Get the Java edition
    • ]]>     http://channel9.msdn.com/Shows/Identity/Deep-Dive-into-U-Prove-Cryptographic-Protocols In this third and last IdElement installment on the U-Prove CTP series, we once again feature Dr. Stefan Brands, who spends an hour describing the crypto behind U-Prove. Wrapping your head around all the mathematical details may require some effort, but if you are interested in this space it is totally worth it. By the end of the video, you will have a clear understanding of how U-Prove works and how it can truly reconcile security and privacy requirements.If you want to go even deeper, Stefan's book on the topic is freely available on line.Get the CTP here Get the C# edition Get the Java edition 3561 http://channel9.msdn.com/Shows/Identity/Deep-Dive-into-U-Prove-Cryptographic-Protocols Tue, 02 Mar 2010 16:12:00 GMT http://channel9.msdn.com/Shows/Identity/Deep-Dive-into-U-Prove-Cryptographic-Protocols Vittorio Bertocci Vittorio Bertocci 5 http://channel9.msdn.com/Shows/Identity/Deep-Dive-into-U-Prove-Cryptographic-Protocols/RSS Algorithms Crypto IdElement Identity Access U-Prove     C9 Conversations: Yuri Gurevich On Logic, Imperative, Abstraction and Algorithms Welcome to the latest installment of C9 Conversations. For this episode, we were very fortunate to get a chance to converse openly with one of the world’s preeminent mathematical logicians, the great Yuri Gurevich.

    Dr. Gurevich is Professor Emeritus of Electrical Engineering and Computer Science at the University of Michigan. He is currently a principle research scientist in Wolfram Schulte’s RiSE team (Research in Software Engineering group at Microsoft Research).

    Originally, Dr. Gurevich started his career as an algebraist. Later he became a logician. Then he moved to computer science, where his main projects have been Abstract State Machines, Average Case Computational Complexity, and Finite Model Theory. Dr. Gurevich has been honored as a Dr. Honoris Causa of the University of Limburg, Belgium (1998), as a Fellow of the Association for Computing Machinery (1996), as well as a Fellow of the John Simon Guggenheim Memorial Foundation (1995).

    Dr. Gurevich's fundamental work on the theory of Abstract State Machines (ASMs) is of paramount importance for theoretical and applied computer science. The significance of the theoretical concepts developed by Gurevich is confirmed by the substantial impact they have on mathematical modeling of discrete dynamic systems.

    *This is probably the only interview in C9's history where a good case is made for imperative programming versus declarative and functional (this starts right off the bat at around 02:31).

    Read Yuri's Annotated Articles

    Tune in. Meet Yuri Gurevich.

      ]]>     http://channel9.msdn.com/Blogs/Charles/C9-Conversations-Yuri-Gurevich-Abstraction-Algorithms-and-Logic Welcome to the latest installment of C9 Conversations. For this episode, we were very fortunate to get a chance to converse openly with one of the world’s preeminent mathematical logicians, the great Yuri Gurevich. Dr. Gurevich is Professor Emeritus of Electrical Engineering and Computer Science at the University of Michigan. He is currently a principle research scientist in Wolfram Schulte’s RiSE team (Research in Software Engineering group at Microsoft Research). Originally, Dr. Gurevich started his career as an algebraist. Later he became a logician. Then he moved to computer science, where his main projects have been Abstract State Machines, Average Case Computational Complexity, and Finite Model Theory. Dr. Gurevich has been honored as a Dr. Honoris Causa of the University of Limburg, Belgium (1998), as a Fellow of the Association for Computing Machinery (1996), as well as a Fellow of the John Simon Guggenheim Memorial Foundation (1995). Dr. Gurevich's fundamental work on the theory of Abstract State Machines (ASMs) is of paramount importance for theoretical and applied computer science. The significance of the theoretical concepts developed by Gurevich is confirmed by the substantial impact they have on mathematical modeling of discrete dynamic systems.*This is probably the only interview in C9's history where a good case is made for imperative programming versus declarative and functional (this starts right off the bat at around 02:31).Read Yuri's Annotated ArticlesTune in. Meet Yuri Gurevich.   2922 http://channel9.msdn.com/Blogs/Charles/C9-Conversations-Yuri-Gurevich-Abstraction-Algorithms-and-Logic Tue, 09 Feb 2010 20:10:00 GMT http://channel9.msdn.com/Blogs/Charles/C9-Conversations-Yuri-Gurevich-Abstraction-Algorithms-and-Logic Charles Charles 23 http://channel9.msdn.com/Blogs/Charles/C9-Conversations-Yuri-Gurevich-Abstraction-Algorithms-and-Logic/RSS Algorithms C9 Conversations Computer Science Microsoft Research MS Research Philosophy Programming RiSE Yuri Gurevich     Expert to Expert: Contract Oriented Programming and Spec# The Spec# programming system is a new attempt at a more cost effective way to develop and maintain high-quality software.  Spec# is pronounced "Spec sharp" and can be written (and searched for) as the "specsharp" or "Spec# programming system".  The Spec# system consists of:


    The Spec# programming language.  Spec# is an extension of the object-oriented language C#.  It extends the type system to include non-null types and checked exceptions.  It provides method contracts in the form of pre- and postconditions as well as object invariants.

    The Spec# compiler.  Integrated into the Microsoft Visual Studio development environment for the .NET platform, the compiler statically enforces non-null types, emits run-time checks for method contracts and invariants, and records the contracts as metadata for consumption by downstream tools.

    The Spec# static program verifier.  This component (codenamed Boogie) generates logical verification conditions from a Spec# program.  Internally, it uses an automatic theorem prover that analyzes the verification conditions to prove the correctness of the program or find errors in it.

    A unique feature of the Spec# programming system is its guarantee of maintaining invariants in object-oriented programs in the presence of callbacks, threads, and inter-object relationships.

    The Spec# programming system is being developed as a research project at Microsoft Research in Redmond, primarily by the Programming Languages and Methods group.

    Here, Expert to Expert guest expert and programming language guru Erik Meijer chats with MSR researchers and spec# designers Wolfram Schulte,  Rustan Leino and Peter Mueller. We dig into the details of Spec# and contract oriented programming in general. Plenty of code on the screen and lots of deep conversation. Just how we like it for Going Deep and Expert to Expert.

    Enjoy!

    LOW RES FILE

    MP4

    ZUNE

    ]]>     http://channel9.msdn.com/Shows/Going+Deep/Expert-to-Expert-Contract-Oriented-Programming-and-Spec The Spec# programming system is a new attempt at a more cost effective way to develop and maintain high-quality software.  Spec# is pronounced "Spec sharp" and can be written (and searched for) as the "specsharp" or "Spec# programming system".  The Spec# system consists of: The Spec# programming language.  Spec# is an extension of the object-oriented language C#.  It extends the type system to include non-null types and checked exceptions.  It provides method contracts in the form of pre- and postconditions as well as object invariants. The Spec# compiler.  Integrated into the Microsoft Visual Studio development environment for the .NET platform, the compiler statically enforces non-null types, emits run-time checks for method contracts and invariants, and records the contracts as metadata for consumption by downstream tools. The Spec# static program verifier.  This component (codenamed Boogie) generates logical verification conditions from a Spec# program.  Internally, it uses an automatic theorem prover that analyzes the verification conditions to prove the correctness of the program or find errors in it. A unique feature of the Spec# programming system is its guarantee of maintaining invariants in object-oriented programs in the presence of callbacks, threads, and inter-object relationships. The Spec# programming system is being developed as a research project at Microsoft Research in Redmond, primarily by the Programming Languages and Methods group.Here, Expert to Expert guest expert and programming language guru Erik Meijer chats with MSR researchers and spec# designers Wolfram Schulte,  Rustan Leino and Peter Mueller. We dig into the details of Spec# and contract oriented programming in general. Plenty of code on the screen and lots of deep conversation. Just how we like it for Going Deep and Expert to Expert.Enjoy!LOW RES FILEMP4ZUNE 4500 http://channel9.msdn.com/Shows/Going+Deep/Expert-to-Expert-Contract-Oriented-Programming-and-Spec Tue, 27 May 2008 18:27:52 GMT http://channel9.msdn.com/Shows/Going+Deep/Expert-to-Expert-Contract-Oriented-Programming-and-Spec Charles Charles 30 http://channel9.msdn.com/Shows/Going+Deep/Expert-to-Expert-Contract-Oriented-Programming-and-Spec/RSS Algorithms Erik Meijer Expert to Expert Featured Microsoft Research MS Research SpecSharp     Algorithms and Data Structures: Mike Swanson - Genetic Session Scheduler Mike Swanson is at it again. You've seen Mike on Channel 9 before and you've probably used his SWF to XAML converter that he wrote a while back. His latest side project promises to be quite useful for conference owners who have the complex task of planning sessions for big technical events like PDC or TechED. In fact, Mike is the PDC08 content owner and this task falls squarely on his shoulders. Instead of littering his office with Post-It notes that represent sessions, speakers, session times and locations, he decided to write an algorithm to solve his problem, specifically a genetic algorithm.

    This is the first epsiode of a new series on Channel 9, Data Structures and Algorithms, that will focus on, well, data structures and algorithms Smiley Each episode will feature an engineer at a whiteboard discussing solutions to algorithms that they invented or improved upon. There are many clever people who write code for Microsoft and Channel 9 will continue to highlight them and their work. This new series is an attempt to really focus the conversation to one problem and it's algorithmic solution (which will often involve the advent of new data structures).

    Enjoy. Mike is as much an engineer as he is a technical evangelist. His genetic session scheduler is an innovative approach to solving a problem rife with tediousness. Well done, Mike!

    LOW RES FILE
    MP4 ]]>     http://channel9.msdn.com/Blogs/Charles/Algorithms-and-Data-Structures-Mike-Swanson-Genetic-Session-Scheduler Mike Swanson is at it again. You've seen Mike on Channel 9 before and you've probably used his SWF to XAML converter that he wrote a while back. His latest side project promises to be quite useful for conference owners who have the complex task of planning sessions for big technical events like PDC or TechED. In fact, Mike is the PDC08 content owner and this task falls squarely on his shoulders. Instead of littering his office with Post-It notes that represent sessions, speakers, session times and locations, he decided to write an algorithm to solve his problem, specifically a genetic algorithm. This is the first epsiode of a new series on Channel 9, Data Structures and Algorithms, that will focus on, well, data structures and algorithms Each episode will feature an engineer at a whiteboard discussing solutions to algorithms that they invented or improved upon. There are many clever people who write code for Microsoft and Channel 9 will continue to highlight them and their work. This new series is an attempt to really focus the conversation to one problem and it's algorithmic solution (which will often involve the advent of new data structures).Enjoy. Mike is as much an engineer as he is a technical evangelist. His genetic session scheduler is an innovative approach to solving a problem rife with tediousness. Well done, Mike!LOW RES FILEMP4 1928 http://channel9.msdn.com/Blogs/Charles/Algorithms-and-Data-Structures-Mike-Swanson-Genetic-Session-Scheduler Wed, 21 May 2008 23:46:07 GMT http://channel9.msdn.com/Blogs/Charles/Algorithms-and-Data-Structures-Mike-Swanson-Genetic-Session-Scheduler Charles Charles 12 http://channel9.msdn.com/Blogs/Charles/Algorithms-and-Data-Structures-Mike-Swanson-Genetic-Session-Scheduler/RSS Algorithms Computing PDC 2008 PDC08     Peter Sestoft: Inside The C5 Generic Collection Library for C# and CLI Peter Sestoft. He's currently a professor at the Copenhagen IT University and he and colleagues have created an awesome collection library for managed code (CLI), C5.

    C5 is a library of generic collection classes for C# and other CLI languages and works with Microsoft .Net version 2.0 and Mono version 1.2 and later.

    C5 provides functionality and data structures not provided by the standard .Net System.Collections.Generic namespace, such as persistent tree data structures, heap based priority queues, hash indexed array lists and linked lists, and events on collection changes. Also, it is more comprehensive than collection class libraries on other similar platforms, such as Java. Unlike many other collection class libraries, C5 is designed with a strict policy of supporting "code to interface not implementation".

    Here, we dig deeply into C5. We also dive into some other interesting computer science and programming topics, as you'd expect. We spend some time discussing a very intriguing aspect oriented software project named YIIHAW. YIIHAW is a static cross-language aspect weaver for .NET. What does that mean? Tune in. Learn.

    Peter is a brilliant computer scientist and we're very lucky to have him here on C9. Thank you, Peter! ]]>     http://channel9.msdn.com/Shows/Going+Deep/Peter-Sestoft-C5-Generic-Collection-Library-for-C-and-CLI While in Copenhagen recently, I was able to spend some time with computer scientist Peter Sestoft. He's currently a professor at the Copenhagen IT University and he and colleagues have created an awesome collection library for managed code (CLI), C5.C5 is a library of generic collection classes for C# and other CLI languages and works with Microsoft .Net version 2.0 and Mono version 1.2 and later. C5 provides functionality and data structures not provided by the standard .Net System.Collections.Generic namespace, such as persistent tree data structures, heap based priority queues, hash indexed array lists and linked lists, and events on collection changes. Also, it is more comprehensive than collection class libraries on other similar platforms, such as Java. Unlike many other collection class libraries, C5 is designed with a strict policy of supporting "code to interface not implementation". Here, we dig deeply into C5. We also dive into some other interesting computer science and programming topics, as you'd expect. We spend some time discussing a very intriguing aspect oriented software project named YIIHAW. YIIHAW is a static cross-language aspect weaver for .NET. What does that mean? Tune in. Learn.Peter is a brilliant computer scientist and we're very lucky to have him here on C9. Thank you, Peter! 2714 http://channel9.msdn.com/Shows/Going+Deep/Peter-Sestoft-C5-Generic-Collection-Library-for-C-and-CLI Mon, 07 Jan 2008 19:55:00 GMT http://channel9.msdn.com/Shows/Going+Deep/Peter-Sestoft-C5-Generic-Collection-Library-for-C-and-CLI Charles Charles 23 http://channel9.msdn.com/Shows/Going+Deep/Peter-Sestoft-C5-Generic-Collection-Library-for-C-and-CLI/RSS Algorithms Programming