this year I had the pleasure of cramming the following information into my lobes:
Book: Schuams Graph Theory - http://www.amazon.com/Schaums-Outline-Graph-Theory-Including/dp/0070054894/ref=sr_1_6?s=books&ie=UTF8&qid=1282769287&sr=1-6 - a subset of combinatorics. From my perspective, just use linear algebra - you can bash anything into vectors. some interesting stuff on platonic solids and the 3 color world map.
- SD - shortest distance
- SP - shortest path
- bipartite graph - 2 disjoint sets of vertices where every edge connects a vertix in U to a vertex in V
- Hamiltonian path - passes through every node
- Isomorphism - 1to1 correspondence of node connections between graphs
- spanning tree of a graph - an acyclic connected spanning subgraph - if it exists
- stiener tree -the optimal spanning tree
- K - the connectivity number of a graph - the minimum size of a seperating set
- K3,3 - the complete bipartate graph - evry vertex of the 1st set is connected to every vertex of the 2nd
- Carpe Diem - 'sieze the day' - the tramp stamp on the back of the girl who sat next to me on the Sherut while I read this tome.
the TPLsamples - http://code.msdn.microsoft.com/ParExtSamples
Book: accelerated c# - http://www.amazon.com/Accelerated-C-2010-Trey-Nash/dp/1430225378
Silverlight WPF Comparison (already dated) - http://wpfslguidance.codeplex.com/
C# 3.0 cookbook
http://www.amazon.com/C-3-0-Cookbook-Jay-Hilyard/dp/059651610X/ref=sr_1_1?ie=UTF8&s=books&qid=1282771075&sr=8-1
Schaums Discrete Maths - http://www.amazon.com/Schaums-Outline-Discrete-Mathematics-Revised/dp/0071615865/ref=sr_1_1?s=books&ie=UTF8&qid=1282768016&sr=1-1- relatively basic until you get into:
- Algebraic systems (semigroups, groups, rings and fields) in terms of homomorphisms (mappings between them - http://en.wikipedia.org/wiki/Homomorphism) and operations
- Languages, grammers and machines - formalizes the notion of IPO machines and computable functions. (think the M language from the Oslo vaporware). Covers deep com sci foundational concepts: regular expressions, finite state automata, languages (all paths through an automaton where the final state is an accepting state), grammers (eg MGrammer!) (Chomsky classified these), Finite State Machines (FSAs whose input and output languages are distinct), and finally turing machines (think ticker tapes).
- some stuff on modulo clocks
IIS ARR - Application Request Routing - setup application level NLB for a CDN - http://learn.iis.net/page.aspx/489/using-the-application-request-routing-module/
PDC2009 slides - http://www.microsoftpdc.com/2009 - why pay, when you can get it free
Introduction to Algorithms video lectures -
| |
|
| 1 |
Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort |
| 2 |
Asymptotic Notation - Recurrences - Substitution, Master Method |
| 3 |
Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication |
| 4 |
Quicksort, Randomized Algorithms |
| 5 |
Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort |
| 6 |
Order Statistics, Median |
| 7 |
Hashing, Hash Functions |
| 8 |
Universal Hashing, Perfect Hashing |
| 9 |
Relation of BSTs to Quicksort - Analysis of Random BST |
| 10 |
Red-black Trees, Rotations, Insertions, Deletions |
| 11 |
Augmenting Data Structures, Dynamic Order Statistics, Interval Trees |
| 12 |
Skip Lists |
| 13 |
Amortized Algorithms, Table Doubling, Potential Method |
| 14 |
Competitive Analysis: Self-organizing Lists |
| 15 |
Dynamic Programming, Longest Common Subsequence |
| 16 |
Greedy Algorithms, Minimum Spanning Trees |
| 17 |
Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search |
| 18 |
Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints |
| 19 |
Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson |
| 20 |
Quiz 2 Review
Note: No audio or video is available for this session. |
| 21 |
Ethics, Problem Solving (Mandatory Attendance)
Note: No audio or video is available for this session. |
| 22 |
Advanced Topics |
| 23 |
Advanced Topics (cont.) |
| 24 |
Advanced Topics (cont.) |
| 25 |
Advanced Topics (cont.) - Discussion of Follow-on Classes |
awesome!!!
Axum - http://blogs.msdn.com/b/maestroteam/ - Agent based programming language
Brahma - LINQ to GPU - http://brahma.ananthonline.net/
Visual Studio Templates - create project / item templates + wizards for populating them - http://msdn.microsoft.com/en-us/library/6db0hwky(VS.80).aspx
PI AB - Policy Injection Application Block - http://msdn.microsoft.com/en-us/library/ff647463.aspx - fake AOP via proxy interception
PostSharp - http://www.sharpcrafters.com/postsharp - AOP framework. does post build IL injection
T4 - source code text generation templates - see Olegs blog - http://www.olegsych.com/tag/t4/
Pivot - http://getpivot.com/ - a SIlverlight control for Image keyed information system browsing - with a nice DeepZoom + Excel source collection editing model.
Book: WPF Controls - http://www.amazon.com/WPF-Control-Development-Unleashed-Experiences/dp/0672330334/ref=sr_1_1?ie=UTF8&s=books&qid=1282762872&sr=8-1#
The Math book - http://www.amazon.com/Math-Book-Pythagoras-Milestones-Mathematics/dp/1402757964/ref=sr_1_1?s=books&ie=UTF8&qid=1282763371&sr=1-1 - alot of high level mathematical concepts are difficult to visualize. this tome helped immensely. Visualization + Calssification --> conceptualization
Automapper - http://automapper.codeplex.com/ - A C# DTO class generator --> AutoMapper uses a fluent configuration API to define an object-object mapping strategy. AutoMapper uses a convention-based matching algorithm to match up source to destination values. Currently, AutoMapper is geared towards model projection scenarios to flatten complex object models to DTOs and other simple objects, whose design is better suited for serialization, communication, messaging, or simply an anti-corruption layer between the domain and application layer.
Silverlight 4.0
Book: Hardware guide
WCF RIA Services
Book: Azure Cloud Computing
Spec Explorer
Book: Is God a mathematician . more of a history of mathematics revealing the abyss: infinity, non-euclidean geometry,Cantor's countability (different levels of ininity), Godels incompleteness theorum, and the halting state. There but for the grace of Eulers formula, go I.
F# - see previous post
Logicomix - the story of the hollowing out of Analytical Philosophy - how Beertam Russle quested to find the logical basis of number systems only to be stymied by Godel's Incompleteness Theorum - all in stunning graphic novel form. - http://www.amazon.com/Logicomix-Search-Truth-Apostolos-Doxiadis/dp/1596914521/ref=sr_1_1?s=books&ie=UTF8&qid=1282771127&sr=1-1
Turing - A Novel about computation
WinHPC
Book: C# numerical computing
Book: How the mind works
Book: Music of the Primes - modulo clocks for encrypting with 2 primes + salt. I still cant visualize the Rhiemann Hypothesis -damn!
Microsoft Solver Foundation
Cliffs Notes on Trig , Calc
Book: short intro to Maths - I really like this short intro series
Workflow 4
Revise advanced calculus
Book: XNA
Book: Azure Cloud Computing
Azure Tools
Azure Pricing
build custome extensions - tools (Visual Studio automation), code (your sample code or binaries you wish to share with others) and a map (a set of steps your users will want to follow to get the best experience with your extension). You can use this power tool to quickly package up sample code with documentation, custom menus, or take the time to create complete automated guidance . You can share your extension with users by distributing a .vsix file, or posting to the Visual Studio Gallery.Create modeling and visualization tools to provide a logical view of your target solution, and to visualize your existing code.
ALM
LightSwitch