Friday night – Senator Leahy

Just sitting down to write.. It’s just past 2AM and I keep falling asleep as  I type Good day today.. the main even was a great visit to the site by Senator Pat Leahy and his wife Marcelle. I had the honor of doing a short presentation for the senator and about 200 of my co-workers.  My task was to link IBM’s recent Watson victory on Jeopardy  to the patent contributions of some of my Burlington-based coworkers.. It wasn’t hard to do.. Burlington had help drive at least 20 patents that were used in the creation of watson.

after I spoke, the Senator gave a great talk on the importance of patents.. and outlined some of the patent reform legislation he’s currently pushing through congress.   I really respect Leahy . He’s very smart, very principled and he’s been a great friend to IBM in VT.

One of the cool things about the Senators visit is that he immidiatly recognized my Jerry Garcia tie.. Leahy is a big Greatful Dead fan.. so we got to talk about that for awhirle. He told me a great story about taking Jerry Garcia and Bob Wier to lunch at the Senate Cafeteria.. and meeting Strom Thurmond..

Here we are with the IBM Master Inventors .. several thousand patents between the 40 of us..

I had a chance to talk to Marcelle Leahy for a bit.. It was great getting to know her a little more.. I remember seeing her and the Senator this summer when Diane and I  were at friend Bob’s wedding.. Leahy walked into the restaurant we were in for the reception .. We had to turn him and Marcelle away.. but I noticed that they were still holding hands after 49 years of marriage,,, That’s pretty cool.  I gave her a couple of samstones to keep…

Ok.. I’m pretty sleepy right now.. Just came back from a live Grateful Dead  cover band show at Higher ground with George .. A great end to a very good day.

I did see that WPTZ, a local TV station did a story on Leahy’s visit to the plant. tonight.. here it is..

Can’t stay awake anymore.. gotta sleep..

more tomorrow

nite all, nite Sam

-me

Thursday night – puzzled

Not much to report today.. so I’llreach back to last weekend for something that happened then.. On my birthday in February, Diane got me this  puzzle.. I love puzzles.. but this one is  really diabolical.. With only 9 pieces it has over 300,000 possible answers.. and only 1 is right.. well.. actually there are four correct answers.. but I’m getting ahead of myself

Everybody in the house took terms beating their head against this puzzle for several days.. but.. no luck…

Finally in a huge fit of procrastination … (i had tons of work, work to do).. I wrote the following.. actually.. I wrote this in my head when I should have been listening to a feldenkreis class..

it went something like this (in badly formed Python)

# solve that @#%@ing puzzle
pieces = [   [-4,4,1,-1],   [-2,-3,1,3],   [-3,3,4,-4],   [-1,-1,3,4],
   [-1,1,3,-4],   [-3,-4,2,4],   [-3,2,4,-2],   [-3,-1,2,2],   [-1,3,2,-2]]

placed = [-1,-1,-1,-1,-1,-1,-1,-1,-1]
r = [0,0,0,0,0,0,0,0,0]
md = 0
trys=0

def showplace():
   global trys
   for i in range(len(placed)):
      if placed[i] > -1:
         print '  %2i   ' % pieces[placed[i]][(r[i]+1)%4],
   print ""
   for i in range(len(placed)):
      if placed[i] > -1:
         print '%2i  %2i ' % (pieces[placed[i]][(r[i]+0)%4],pieces[placed[i]][(r[i]+2)%4]),
   print ""
   for i in range(len(placed)):
      if placed[i] > -1:
         print '  %2i   ' % pieces[placed[i]][(r[i]+3)%4],
   print ""
   print "trys=", trys
   print ""
   
def place( unplaced, depth, spaces):
   global md
   global trys
   trys = trys + 1
   if depth > md :
      md = depth
   for i in range(len(unplaced)) :
      runplaced = unplaced[:]
      p = runplaced.pop(i)
      placed[depth] = p

      for j in range(4) :
         r[depth] = j

         if (depth % 3 ==0) or pieces[placed[depth]][r[depth]]+pieces[placed[depth-1]][(2+r[depth-1]) % 4] == 0:
            if (depth<3) or pieces[placed[depth]][(r[depth]+1)%4]+pieces[placed[depth-3]][(3+r[depth-3]) % 4] == 0:
               if len(runplaced) > 0:
                  ret=place( runplaced, depth + 1, spaces + "   ")
               else :
                  showplace()
                  exit
      placed[depth] = -1
      r[depth] = 0

unplaced = [0,1,2,3,4,5,6,7,8]
place(unplaced, 0,  " ")

5 seconds later I  had the solution

   3         4        2       1        1        3        4        2        4    
-1   4  -4   1  -1   2  -1   3  -3   3  -3   4   2  -3   3  -2   2  -2  
  -1       -1       -3       -4       -2       -4       -4       -1      -3    
trys= 1048

   2        -1       -1        3      -3        -4       2       -3      -1    
-4   4  -4   1  -1   3  -1   2  -2   1  -1   4  -3   4  -4   3  -3   2  
  -3        3         4       -2       3         1      -2        4        2    
trys= 1732

  -3        -1      -4       -4       -2       -4      -3        -1      -1    
-2   2  -2   3  -3   2   4  -3   3  -3   3  -1   2  -1   1  -4   4  -1  
   4         2       4        3         1        1       2         4       3    
trys= 2289

   2         4       -2        1        3       -2       4        3        -3    
 2  -3   3  -4   4  -3   4  -1   1  -2   2  -1   3  -1   1  -4   4  -4  
  -1        -3       2       -4       -3        3       -1       -1       2    
trys= 2458

Actually.. 4 solutions.. since the puzzle can be solved on all 4 directions

I then tore up the answer so no one else was tempted to cheat..

so.. what do you think.. cool innovation ?.. or unsportsemanlike conduct..

you decide,..

nite all nite sam

# solve that @#%@ing puzzle
pieces = [   [-4,4,1,-1],   [-2,-3,1,3],   [-3,3,4,-4],   [-1,-1,3,4],
[-1,1,3,-4],   [-3,-4,2,4],   [-3,2,4,-2],   [-3,-1,2,2],   [-1,3,2,-2]]

placed = [-1,-1,-1,-1,-1,-1,-1,-1,-1]
r = [0,0,0,0,0,0,0,0,0]
md = 0
trys=0

def showplace():
global trys
for i in range(len(placed)):
if placed[i] > -1:
print ‘  %2i   ‘ % pieces[placed[i]][(r[i]+1)%4],
print “”
for i in range(len(placed)):
if placed[i] > -1:
print ‘%2i  %2i ‘ % (pieces[placed[i]][(r[i]+0)%4],pieces[placed[i]][(r[i]+2)%4]),
print “”
for i in range(len(placed)):
if placed[i] > -1:
print ‘  %2i   ‘ % pieces[placed[i]][(r[i]+3)%4],
print “”
print “trys=”, trys
print “”

def place( unplaced, depth, spaces):
global md
global trys
trys = trys + 1
if depth > md :
md = depth
for i in range(len(unplaced)) :
runplaced = unplaced[:]
p = runplaced.pop(i)
placed[depth] = p

for j in range(4) :
r[depth] = j

if (depth % 3 ==0) or pieces[placed[depth]][r[depth]]+pieces[placed[depth-1]][(2+r[depth-1]) % 4] == 0:
if (depth<3) or pieces[placed[depth]][(r[depth]+1)%4]+pieces[placed[depth-3]][(3+r[depth-3]) % 4] == 0:
if len(runplaced) > 0:
ret=place( runplaced, depth + 1, spaces + ”   “)
else :
showplace()
exit
placed[depth] = -1
r[depth] = 0

unplaced = [0,1,2,3,4,5,6,7,8]
place(unplaced, 0,  ” “)

Wednesday night – Prof Einstein ?

Gabe had a tough choice to make.. he had to be two places at once tonight.. He had to choose between the last night of night riders.. or he had to go to school for a history event . He chose the latter .. At the event, the kids all had to dress up as the person that they had written their history paper on.   Then the parents had to guess who was who. Gabe went as…… (can you guess ?)

He came as Einstein. .. the top other  two guesses were either mark twain…

or me 🙂

Kristin was Oparah

david was thoreau

and these girls were the spice girls…

I’m always happy to see the picture of our house on the mural  at the school

As soon as the history event was done i zoomed back to Bolton to catch the awards ceremony at the last night riders event.

Every year we give out an award in Sam’s name to recognize the skier or rider who most embodies the spirit of . fun and love of the mountain that Sam had.

This year it was won by Quinn.. I got to make the presentation.. It was fun and sad for me at the same time.

Sam so loved the program at night riders

I noticed that Marjorie was wearing a sam pin.. it was a nice sign..

OK.. I’m really fried .. gotta got to sleep..

more tomorrow..

nite all, nite sam

-me

Tuesday night – house of cards

Man, am I fried. My first meeting was at 7:30 this morning.. and my last meeting just ended around 10:30 PM.. I just hosted one of those weird virtual events that I generally don’t like.. but this one was pretty fun.. Having worked my tail off all day, I don’t have anything fun to report.. Instead I’ll pass on a vicarious point of pride. My good buddy Jim form work found a listing of himself in Wikipedia and sent it on. It seems Jim, an MIT trained Physicist, senior IBM technical genius and one of the nicest guys I know had a past before IBM (gasp). He held the world record for the tallest unsupported house of cards ..

Wikipedia records it thus i

The first known record for card stacking was made by Miss Victoria Maitland, of England. A photograph of her work was published in The Strand Magazine on September 1901. It was a fifteen story structure.[4] Following the publication of this record a second was submitted in April 1902, by Miss Rosie Farner, of England with a picture of a twenty storied tower.[5] A third record was submitted by Miss F. M. Hollams, of England, with a tower of twenty-five stories, in February 1903.[6]

Berg has since kept the record and created many sub-records since then, he has been known to have broken “seven or eight” world records for cardstacking. He currently holds the world record for tallest house of cards, a 25 foot 9 7/16 inch (≈7.87m) tall “skyscraper” completed at the State Fair of Texas on October 14, 2007.[3] He also holds the record for the largest house of cards, a category Guinness invented for the event, for a replica of Cinderella’s Castle at Walt Disney World.[11] On March 10, 2010, Berg broke his own record by building a replica of the Venetian Macau resort hotel. He completed it in 44 days, using 218,792 cards (more than 4000 decks). The structure measured 10.5 meters (34 feet) long, three meters (10 feet) tall and weighed more than 272 kilograms (600 pounds).
Guinness Book of World Records” American 1982 Edition, page 477.

Other record holders (without bending or altering the cards) include:

* Joe Whitlam, of England with twenty seven stories, on February 28, 1972.[7]
* James Warnock, of Canada with sixty-one stories, on September 8, 1978.[8]
* John Slain, of The United States with sixty-eight stories, on August 3, 1983.[9]
* Bryan Berg with seventy-five stories, on April 21, 1992.[10]

Jim’s feat is recorded in the Guinness Book of World Records” American 1982 Edition, page 477.:

Jim, I’m proud to know you !

nite folks, nite sam

-me