text:
Library Announces Lineup for 2014 Keep Toronto Reading Festival
More than 80 events at 50 branches across the city
TORONTO, March 10, 2014 /CNW/ - Toronto Public Library announces the programming line-up for its Keep Toronto Reading Festival, running April 1-30. This year's city-wide celebration of reading spotlights the library's One Book community read, The Cellist of Sarajevo by Steven Galloway. The themes of this bestselling novel - hope in adversity, human resilience and artistic expression in times of conflict - are explored at dozens of library branches throughout Toronto. The programming themes explored this year are particularly relevant in light of recent world events and the centenary of the First World War.
"The Keep Toronto Reading Festival offers Toronto's many readers the chance to connect and engage," says Jane Pyper, City Librarian. "Whether it's in branches, online or at our partnered events, we invite all Torontonians to come together through their love of books and to celebrate the joy of reading."
Festival highlights include:
- An evening of hope-inspired music with Toronto Symphony Orchestra principal cello, Joseph Johnson, and poetry readings by Ann Shin. Hosted by CBC's Robert Harris.
- A First World War panel discussion with historian Margaret MacMillan, the Munk School's Janice Stein and former diplomat Paul Heinbecker.
- Toronto's Big Book Club with The Cellist of Sarajevo author Steven Galloway with an audience comprised of books clubs from around the city.
- A screening of Romeo and Juliet in Sarajevo with director John Zaritsky in partnership with Hot Docs.
- One-on-one sessions with survivors of conflict as part of Toronto Public Library's "Human Library" program.
- 40 branch book club discussions.
22 days of cello performances, in unexpected places across the city
For 22 days this March and April, cellists from the Toronto Symphony Orchestra will "pop up" in iconic and unexpected locations across Toronto. The performances mirror the actions of the novel's "cellist of Sarajevo" who plays Albinoni's Adagio for 22 days to commemorate 22 civilians killed by a bomb blast.
From iconic landmarks to malls, from libraries to civic centres, the cello performances begin on Monday, March 17, 2014 and continue daily until Monday, April 7, 2014. A list of dates and locations is available at keeptorontoreading.ca.
While at a performance, the public can download the first two chapters of The Cellist of Sarajevo through "The Library Box", a wireless hotspot connection that allows people to download digital content directly to their mobile or reader devices without an internet connection.
For complete festival information and event listings, go to keeptorontoreading.ca.
Toronto Public Library is the world's busiest urban public library system. Every year, 19 million people visit our branches in neighbourhoods across the city and borrow 32 million items. To learn more about Toronto Public Library, visit our website at torontopubliclibrary.ca or call Answerline at 416-393-7131. To get the most current updates on what's happening at the library, follow us on Twitter @torontolibrary
SOURCE Toronto Public LibraryFor further information:
Media Contact:
Tina Srebotnjak 416-393-7098


text:
#23 Illini Nearly Upend #17 Nittany Lions
Feb. 6, 2010
UNIVERSITY PARK, Pa. - Junior Allison Buckley broke the Illinois record in the all-around with a 39.525, but it wasn't enough as No. 23 Illinois dropped the close contest to No. 17 Penn State, 196.425-196.275. Buckley also matched her career high to garner the vault crown with a 9.900 and senior Sarah Schmidt tied for first place on floor with a season-high 9.925. The Schaumburg, Ill., native now has 33 career event titles, which is the fifth most on the UI all-time list.
"We had an unbelievable day with great performances on every event, so I really couldn't ask for much more," head coach Bob Starkell said. "Both squads were on their game tonight, and this type of meet really prepares us for the postseason."
Illinois has improved its team score with each meet this season and turned in the sixth-best team score in school history on Saturday, but couldn't overcome Penn State, who also set a season-best mark. The Illini won the battle on vault (49.000-48.825) and floor (49.175-49.150), but the Nittany Lions had the advantage on bars (49.350-49.175) and beam (49.100-48.925).
The Orange and Blue got off to a quick start with five great routines on uneven bars led by a career high 9.925 from Schmidt, who took second behind the meet's all-around champion Brandi Personett of Penn State. Buckley, senior Nicole Cowart and junior Melissa Fernandez all equaled their career highs of 9.850 to tie for fourth. Freshman Alina Weinstein added a 9.700, giving the Illini a 49.175 total, which is a season high and the seventh best score in school history.
On floor exercise, the Illini also turned in a season-high 49.175, paced by Schmidt's outstanding performance which tied Personett for the victory. Buckley was the next best Illini, recording a 9.850 to place fourth. Both Cowart and sophomore Kelsey Joannides added a season-high 9.825 followed by Fernandez, who rounded out the scoring with a season-best routine that earned a 9.750.
A solid showing on vault gave the Illini their second best score (49.000) of the season in the event, with Buckley posting the top score of the meet and Cowart taking third with a 9.825. Schmidt tied for fifth with a 9.800 followed by freshman Jaclyn Kantecki with a 9.750 and Fernandez with a 9.725.
The Illini wrapped up the night on balance beam and notched a 48.925, which is their second best score this season. Buckley and Fernandez, a pair of All-Americans on the event, led the way for the Orange and Blue, tying for second with season-highs of 9.925. Junior Lashlee Morris and Schmidt recorded scores of 9.750, and the Illini were forced to count a 9.575 from Cowart.
Personett did not score below a 9.850 and finished first in the all-around with a 39.600, just edging Buckley's record-setting 39.525. Schmidt came in third in the all-around with a career-high 39.400, which ranks fifth in school history and eclipsed her old mark of 39.275 set last year. Fernandez was the fourth-best all-arounder, resetting her career high for the second straight week with a 39.250. Cowart finished the evening with a 39.075 combined score.
"All of our all-arounders were on top of their game tonight," Starkell said.
Up Next: Illinois has a pair of meets next week, with the IGI Chicago Style Invite on Friday, Feb. 12 at 7:30 p.m. and a dual meet against Michigan State at Huff Hall on Sunday, Feb. 14. at 2 p.m., which is the third annual "Think Pink" meet for breast cancer awareness.

subset: commoncrawl


text:
Muscle Mustangs & Fast FordsEvents
Turbo Coupes VS Super Coupes Shootout
The Early Cat Catches The Bird - Turbo Coupes and Super Coupes take on a lone Cougar and come up short.
4th Place
'90 Thunderbird Super Coupe
Jason Dobrie, Eastport, NY
Jason Dobrie's Super Coupe has all the right parts to run mid-13s on the supercharger, and the crew had planned to install a nitrous-oxide system for mid-12s but weren't able to in the short amount of time they had to prepare the car.
Purchased from eBay for a few hundred dollars, the Super Coupe was brought back to Long Island where Jason decided it was better to rebuild the whole engine rather than repair the blown head gaskets. New forged pistons and 351W connecting rods were employed, and the stock heads were ported and activated by a new camshaft.
More boost was pullied up, but a bad computer kept the car from running to its potential over the course of the track day.
STRIP SPECS Owner: Jason Dobrie Hometown: Eastport, New York Driver: Jason Dobrie Year/Model: '90 Thunderbird Super Coupe Weight w/Driver: 4,128 lbs Engine: 232ci (3.8-liter) V-6 Built By: Jason Dobrie Intercooler: Stock air-to-air intercooler Power adder: Stock Eaton M90 supercharger Maximum Boost/ Nitrous Qty.: 16 psi Intake manifold: Stock, ported with Blue Tongue Motorsports modified upper plenum Cylinder Head(s): Stock, ported Compression Ratio: 8:1 Camshaft(s): Custom, 220 degrees duration at 0.050, 0.540-inch lift Ignition: Stock Exhaust: Kooks custom headers, high-flow catalytic converters, MagnaFlow mufflers Transmission: Stock AOD automatic Converter/Clutch: 2,200-rpm stall Rear Type: Stock IRS with 3.73:1 ring-and-pinion Wheels: 17x8 Cobra R front and rear Tires F/R: Dunlop 245/50/17 Suspension Front: Stock Suspension Rear: Stock Best ET/MPH: N/A STRIP LOG Run # 60-FT 1/4-Mile MPH 1 2.64 19.50 72.33 2 1.99 14.88 83.07 3 2.23 16.79 82.08


text:
HOLOGRAMS can now be erased and rewritten, paving the way for 3D television and extending their usefulness in data storage.
Not only do holograms display images in 3D, they can also store digital information that way. Instead of recording bumps on the surface of a disc, they embed the data throughout its thickness, so they can cram a huge amount into a very small space - 300 gigabytes on a CD-sized disc.
Until now the information was stored as chemical changes to a polymer coating, which is irreversible. Researchers at the University of Arizona, Tucson, have now stored it as a build-up of charge in a photo-refractive polymer, so it can easily be wiped with a laser and rewritten (Nature, vol 451, p 694). If the process can be speeded up, 3D could soon be coming to a TV screen near you.
To continue reading this article, subscribe to receive access to all of newscientist.com, including 20 years of archive content.


text:
I am sure you all remember Sukaina from Lick My Spoon who recently shared her naan recipe with us. Today, she is sharing yet another popular Indian recipe that we all love–butter chicken. Butter chicken is often served at Indian buffet restaurants and it's easily my favorite Indian dish. I always ask for an extra serving of naan to sop up the creamy and rich sauce of butter chicken. Thanks to Lick My Spoon for her butter chicken recipe. Enjoy!
After my naan post recently, I thought it would only be fair to share a butter chicken recipe with you. After all, you can't have one without the other. I can't tell you the number of times I have gone to an Indian restaurant where my other half ordered a butter chicken and begged, "Can you make this at home?' I had no choice but to learn how to make this. So I turned to the best chef I know when it comes to Indian cooking- my mom. She has this wonderful knack of trying a meal at a restaurant and then replicating it at home. I slightly modified her recipe by adding a few more spices…
I once read somewhere that butter chicken was created when a hungry man walked into an Indian restaurant and they had no curry left. The chef decided to whip up a quick meal by throwing a tandoori chicken into a simple gravy of butter, tomatoes and a few spices. And thus, butter chicken was born. Also known as murgh makhani, this is curry not for the faint hearted- literally! Originating from Mughlai cuisine, it has lashings of butter (duh!) and cream to give it that dreamy, creamy texture. This is one dish where skimping on these two essential ingredients is not recommended. What I love about this recipe is that it doesn't contain any food coloring to give it that gleaming red color.
Many people love eating Indian food at restaurants but are often intimidated about trying it at home. This recipe is super simple so you'll have no excuse to order take out again. It is best served with steamed rice or butter naan.


text:
Milk Music
Samsung's Milk Music service to charge $3.99 per month for ad-free streaming in US18 April 2014
Milk Music is barely two months old, but it's already switching gears in order to stay afloat. Samsung has published an infographic on its official blog, subtly announcing that Americans will soon have to fork over $3.99 per month to continue streaming... >>
Samsung Milk Music ad-free internet radio app launches in US for select devices7 March 2014
Samsung has introduced an internet radio service in the US that's meant to give a "fresh take on music", and it's called Milk Music. Milk Music is an ad-free app now available on the Google Play Store. You can grab it free of charge today, and then immediately... >>


text:
Blog Categories
Clear Admit Newsletter
Essay Topic Analysis
Berkeley / Haas
Cambridge / Judge*
Chicago Booth*
CMU / Tepper*
Columbia Business School
Cornell / Johnson*
Dartmouth / Tuck
Duke / Fuqua
Georgetown / McDonough*
Harvard Business School
Indian School of Business*
London Business School*
MIT / Sloan
Michigan / Ross
Northwestern / Kellogg*
NYU / Stern
Oxford / Said*
Penn / Wharton
Stanford GSB
UCLA / Anderson*
UNC / Kenan-Flagler*
USC / Marshall*
UT Austin / McCombs
UVA / Darden
Yale SOM
* denotes '14-'15 commentary
Program Rankings
Business Week
Financial Times
Wall Street Journal
Industry Salaries
Investment Banking Salary
Private Equity Salary
Sales & Trading Salary
Management Consulting Salary
GMAT Resources
B-School Resources
INSEAD Knowledge
Harvard Working Knowledge
Knowledge @ Emory
Columbia Ideas @ Work
knowledge@ W. P. Carey
Stanford Knowledgebase
Ross Thought in Action
MBA Programs: North America
- Berkeley / Haas
- Boston College / Carroll
- Boston University*
- Carnegie Mellon / Tepper
- Chicago / Booth
- Columbia
- Concordia
- Cornell / Johnson*
- Dartmouth / Tuck
- Duke / Fuqua
- Emory / Goizueta*
- Harvard
- HEC Montreal*
- Indiana / Kelley
- Michigan
- MIT / Sloan
- Northwestern / Kellogg*
- New York / Stern
- North Carolina / Kenan Flagler
- Notre Dame / Mendoza*
- Pennsylvania / Wharton
- Queens*
- Smith / UMD
- Stanford
- Syracuse / Whitman
- Texas / McCombs
- Thunderbird*
- Toronto / Rotman
- Tulane / Freeman
- USC / Marshall*
- UC Davis
- UCLA / Anderson
- Vanderbilt / Owen
- Virginia / Darden
- Washington University in St. Louis / Olin
- Western Ontario / Ivey*
- Yale
MBA Programs: The Rest Of The World
- AGSM (Australia) 2
- Cambridge / Judge (UK) 1
- CIEBS (China) 2
- Cheung Kong Graduate School of Business (China) 1
- Cranfield School of Mgmt (UK) 1
- ESADE (Spain) 1 or 2
- HEC (France) 2
- Hult (UK) 1
- IE (Span)
- IESE (Spain) 2
- IMD (Switzerland) 1
- INCAE (Costa Rica) 2
- INSEAD (France) 1
- IPADE (Mexico)
- ISB (India) 1
- London Business School (UK) 2
- Manchester Bus. School (UK) 2
- Melbourne (Australia) 1
- Oxford / Said (UK) 1
- Rotterdam (Netherlands) 1
- Tsinghua IMBA (China) 2
- University of St. Gallen (Switzerland) 1
Clear Admit Videos
Harvard Business School Snags Top Spot on Forbes Best Business Schools Ranking
Aug 5, 2011 | 0 comments
Harvard Business School (HBS) came out on top this year for the first time since 2003 in the Forbes Best U.S. Business Schools ranking, released this week. Stanford, the former No. 1, dropped to second.
The Forbes ranking, which focuses on the return on investment graduates achieve from attending business school, found that graduates in Harvard's Class of 2006 saw their median salaries rise from $79,000 pre-MBA to $230,000 in 2010, the highest jump among U.S. schools.
To assess ROI, the Forbes ranking also pays close attention to what it costs to attend the top business school programs. According to the report, a degree at a leading school like Stanford costs an average of $275,000 when you factor in tuition and lost income for the time you are in school. At Columbia Business School, tuition alone is now $115,000 including fees for the two-year program.
But according to Forbes, it still more than pays off. And schools are also taking steps to increase grants and scholarships. They are up more than 50 percent in the past six years, and the 74 U.S. schools ranked handed out an average of $26,000 to 55 percent of students in the graduating class of 2010, Forbes reports.
As always, those of us here at Clear Admit encourage prospective applicants to use rankings as but one consideration when choosing the best business school to fit your needs. For the full Forbes 2011 U.S. Business Schools Ranking, click here.
Here's a quick rundown of the top ten:
- Harvard Business School
- Stanford Graduate School of Business
- University of Chicago Booth School of Business
- The Wharton School at the University of Pennsylvania
- Columbia Business School
- Tuck School of Business at Dartmouth University
- Northwestern University's Kellogg School of Management
- Samuel Curtis Johnson Graduate School of Management at Cornell University
- Darden School of Business at the University of Virginia
- MIT Sloan School of Management
Posted in: MBA News, Rankings News
Leave a Comment Cancel reply
Free Consultation
Featured Products
Darden School of Business
Anderson School of Management
Chicago Booth School of Business
Anderson School of Management
Darden School of Business
Columbia Business School
Cambridge Judge Business School
Columbia Business School
Chicago Booth School of Business
Clear Admit LiveWire
Application results in real time, submitted by site visitors.
Upcoming Deadlines and Events
Connect With Us
Recent Tweets
- RT @MITSloanAdcom: #MITSloan Sloan on the Road in Japan! Thx you to our alumni host and attendees. #MyMITSloan http://t.co/KTeohubw2H #, 6 hours ago
- deadlines now available for @BerkeleyHaas #MBA R1 10/1, R2 1/7/16, R3 3/31/16 http://t.co/fnEcu25dVR #, 6 hours ago
- detailed essay topic analysis for Georgetown McDonough #MBA @msbgu "Why You?" @sph70 http://t.co/tOABljZXaF #, 7 hours ago
MBA News by Metro
Interview Reports
Recently submitted interview field reports from our archive. Submit a write-up of your interview experience.
NYU Stern MBA Admissions Interview Report: Round 1 / Adcom / On-Campus
CMU / Tepper MBA Admissions Interview Report: Round 1 / Adcom / Skype
Columbia MBA Admissions Interview Report: Regular Decision / Alumnus / Off Campus
Fridays From the Frontline: UCLA Anderson Interview Debrief
Georgetown McDonough MBA Admissions Interview Questions: Round 1 / Second Year Student / On Campus
MBA Admissions Mashup
Beat The GMAT Forums
- Ask Clear Admit :: RE: Profile Evaluation - MS Finance Programs
- Ask Clear Admit :: RE: Should I re-apply to McCombs
- Ask Clear Admit :: Profile evaluation and suggested schools
- Ask Clear Admit :: GMAT 660/5 years Experience/ 3.8 GPA (Indian)
- Ask Clear Admit :: RE: Profile evaluation- GMAT-760(Q50,V42)
Wall Street Oasis Forums
Best of Blogging
MBA Reapplicant
MBA the Nonprofit Way
Two Years at HBS


text:
ST LOUIS —Retail counters at Post Offices in Central and Northeastern Missouri and Central and Southern Illinois will be closed on Friday, July 4, 2014, in observance of Independence Day. There will be no mail delivery, caller service or Post Office Box service. All services resume on Saturday, July 5.
Post offices will be open regularly scheduled hours on July 3.
Customers who wish to purchase stamps, mail packages, or ship urgent letters or packages on July 4 may use the Self Service Kiosks available at select post offices. The ATM-like kiosk accepts credit or debit cards only and can handle about 80 percent of typical postal transactions – like weigh packages and dispense postage for Priority Express, Priority, First-Class and Parcel Post mail. Self Service Kiosks are accessible 24 hours a day, seven days a week.
To obtain the phone number of a specific Post Office, customers may call 1-800-ASK-USPS.


text:
24 Polymer Clay Tutorials: Polymer Clay Jewelry, Home Decor, and More
Bonus: Get our newsletter & special offers for free. We will not share or sell your email address. View our Privacy Policy
Clay Smurf Figurine
We are adding the craft to your Craft Projects.
The project was added to your Craft Projects.
Click here to view your Craft Projects.
You'll be singing a happy song after you create this cute little Clay Smurf Figurine from Debbie Buckland. Handmade toys are great fun to make and they make wonderful and meaningful gifts. Clay figurines are also a fun addition to a birthday cake or gift package! Soon you'll have the whole Smurf gang made out of polymer clay! And don't forget about Gargamel and his cat Azrael!
You can find this project, as well as many other Polymer clay tutorials, in our free eBook, 24 Polymer Clay Tutorials: Polymer Clay Jewelry, Decor and More!
- Blue, white and black blocks of polymer clay
Various clay tools
Take 3/4 of a block of blue and add 1/4 of a block of white. Roll each together to mix it to a lighter blue.
Shape your head, body, nose and ears – leaving enough blue for arms and a small tail.
Roll ear edges and attach ears and nose to head.
The way I molded my pieces to the other pieces all throughout this tutorial is I used Fiskars Embossing tools at all joins. I used extra large ball end and very fine ball ends.
Attach head to body.
Roll two pieces of blue and make arms. Roll one end to make the hand and cut 2 slits in to make 3 fingers and add a little oval to make the thumb.
The following picture shows the finished hand/arm and the ready rolled arm ready to make the hand.
Flatten arms at shoulders a bit and attach to body making sure the thumb is to the side of the body.
Wash your hands here so there's no blue on your white clay.
And take some white and work it into a hat for your smurf. Roughly like the body shape but with a flat bit to put on the head.
Take two small balls of white and two even smaller balls of black.
Flatten the white then put the balls of black on each and then flatten them. Now you have eyeballs!
Make eye stockets above the nose on the head. This also helps form the eyebrows.
The add the eyes and indent your Smurf's smile.
Now take some white and make some pants. Add a little tail.
Now make tear drop type shapes out of white as these are the feet/legs.
Add the legs/feet to the body – make sure that your Smurf stands properly and adjust feet if necessary.
Also adjust the arms/head the way you want them now.
Bake in the oven according to packet instructions. Of course if you are using paper clay let to dry over night or 24 hours which ever is longer and then paint by hand when fully dry.
And its finished! Mine was about 3″ high.
Your Recently Viewed Projects
Images from other crafters
Love these projects? Get MORE delivered to your Inbox – FREE Click Here!
Something worth saving?
- SAVE all your favorite crafts
- ADD personal notes
- QUICKLY reference your crafts
Free eBooks
- 14 Toilet Paper Roll Craft Ideas
- 23 Fabulous Picnic Craft Ideas + Restaurant Copycat Recipes
- 4th of July Crafts and Recipes
- 4th of July Crafts: Blogger Edition 2010
- Crafts for Father's Day: 36 Homemade Father's Day Gift Ideas
- Garden Crafts
- Graduation Crafts
- How To Make Tie Dye Shirts, Decor & More: 18 Tie Dye Patterns
- The Best Blogger Craft Ideas 2015: Home Decor Ideas, DIY Jewelry, Easy Crochet Patterns and More
Our Newest Projects & Articles
- 12 Days of Christmas in July Giveaway
- Houndstooth Wallpaper Stencil
- Quilted Paper DIY Wall Art
- Sweet Decoupage Picture Frame
- Super Simple Painted DIY Wall Art
- Scrap Fabric Hair Accessories
- Metal Stamped Floral Stakes
- Easy Patriotic Rag Wreath
- Ultimate Plaid Home Decor Assortment
- 9 Free Knitting Patterns for Accessories


text:
Causey Mansion
Bed & Breakfast
2 Causey Avenue, Milford, DE 19963
Your Subtitle text
Our Home
Your Bedroom
Spring Party
Contact Us
Hospitality in a family setting...
The custom of opening one's home to travelers dates back to the earliest days of Colonial America. In parts of the countryside where public inns were not always available, weary travelers would be accommodated by a local family who would provide food and lodging for a fee.
301/996-8910 (voice or text) or email@example.com
r 1763 Greek Revival, Georgian style home has hosted many prominent families who have shaped Milford and Delaware history, including Governors' Rodgers and Causey, and the Vinyard family who were local shipbuilders. This rare gem features many period-appropriate items including: lighting, intricate moldings and staircases, shutters, window treatments, and a widows walk. The 3+ acre property is walking distance to local shops and restaurants in the heart of Milford as well as minutes from the beach and tax-free outlets. In addition to the main residence the Causey property includes an original summer kitchen, mature trees and a 100 year old boxwood garden ~ a beautiful oasis in downtown Milford.
Whether you are just passing through Milford for a night or wish to celebrate your wedding here we strive
to give you the best experience possible. Please contact us directly if you have questions about visiting us or hosting an event at our home.
Trip Advisor loves Causey Mansion.... please follow the link below to read some of our reviews!
Causey Mansion Reviews
Like us on FaceBook for many more photos of the B&B, friendly faces and things to do while in Milford!
Causey Mansion on FaceBook
Content copyright


text:
The work life of any person is different but here in the United States of America; things are more different for most people who are close and below and are in the middle class group. The rich and poor gap has been widening and there seems to be no stopping at all whatsoever so far at least and that is how the birth of new system in the States' called Medicare or the simply the Obama Care introduced soon after the President Obama taking office as the President of America. That was a terrific task on an overall basis according to most experts but there were costs and there are still costs lingering around everybody in the authority as millions and millions of dollars are being spent every years on the folks of America in order take care of those who fail to have sufficient insurance for medications, who are poor and can't afford and so on.
At the website of it which is easily searchable on the Internet with the aforementioned keywords or key phrases or both, one can think of going to check out for more and this seems to be a good example for future related activities, be it a modification of the existing one or countries in Asia, Europe and African can actually contemplate of designing same or almost the same sort of heath care structure but to determine who is eligible and who is not is a big issue and it cannot be answered practically but is just possible to give oral suggestions and thoughts. According to reports and new articles, millions of American have been taking benefits of this doctor, patient, heath, etc. related issues to a great deal of extent and this is just an accomplishment that is going to be a future foundation for massive things to come.


text:
View large image
Sold out
Zipp Speed Weaponry, teamed with Castelli to offer quality clothing with innovative design, utilizing the best material available to give you the competitive edge.
The jersey that started the aero revolution is back and has evolved even more in Zipp's quest for speed. For 2012 the airflow behind the shoulders and along the side panels has been improved and the continuous testing with Garmin Barracuda Sharp means you are getting a pro quality jersey to lead the club ride or the race.
Key Features:
Please check the stock availability notice on your item when placing your order. This item is: Sold out
Please remember to add postal time (2-3 working days) to obtain a complete estimate of delivery to your door.
You will receive an email to confirm when your item has been sent.
You can also check the status of your order and individual items by accessing your account details and following the prompts.
Please allow 10 working days from dispatch of your order before notifying us of any late deliveries.
It may be advisable to check with your neighbours to see if a parcel has been left with them, check any outhouses you might have where it may be left if it cannot fit through your letterbox and contact your local sorting office to see if the item has been returned to the depot as undelivered and awaiting collection.
Please see our returns policy.
No more then 1000 characters long please.
There are currently no reviews.
Castelli Zipp Aero Race Jersey Black/White
Select image


text:
Be The First One To Know
"Interesting facts, bits & tidbits, trivia, and amazing inside stories about Erik Spoelstra + The Miami Heat"
Ethan Skolnick: Inconsistency of Miami Heat teammates is making LeBron James work too hard
LeBron James entered the world 28 years ago Sunday and, like every other baby born before and since, it's likely that he did so crying.
Yes, he's fully human, even if it doesn't always seem so, when he shakes off ankle twists that would sideline others for days, or when he decides that bicycling several miles back home after an intense NBA contest is the best way to beat traffic.
And so, of all that occurred during the Heat's bloody back-to-back in Detroit and Milwaukee – games dropped by a combined 29 points – the one development that matters most in the long run was James finding himself so short of wind Saturday that he called for a brief breather.
"He expended a great deal of energy," coach Erik Spoelstra said the 104-85 loss, which included a 35-14 deficit in the fourth quarter.
"I mean, how many times have you seen him need to come out at the end of the third, with a couple of minutes to go?"
James played frenetic and furious in that third quarter, trying to will the Heat back from a 12-point deficit, and he attributed his exhaustion ("dog tired") to that effort, as well as to the fourth game in five nights, the first a featured showcase against Kevin Durant and the Thunder and the last three on the road.
So perhaps it's just a schedule blip.
By Ethan J. Skolnick


text:
June 17, 2014
June 1, 2014
Chrome bits.
About time I finally fixed up the rear bumper chrome. Front is next.
Bought some 3/8" chrome strip and used industrial adhesive to fill in the bumper slot so it would stick in there. Seems really firmly in place.
May 27, 2014
Light tweaks
Removed HID crap and added an extra incandescent turn signal to get the signal flash speed back to normal.
Always hate fast turn signals. Seems unfinished. I know resistors do the job but I like regular bulbs on older cars.
May 11, 2014
May 10, 2014
My god. It's full of worms.
April 13, 2014
XL Hoodie Blowout.
$35usd shipped from Canada. 3 available XL brown hoodies. Last of the stock I put away.
Contact me on JZXP for one if they're still available.
April 11, 2014
Another GS in the driveway.
2000 GS300. 156k kms. Beige perf leather, seems like torsen diff, spins both.
Mechanically perfect, just some body TLC required.
Practically stole it from a gov't seizure auction. No plans for it yet. Still can't believe what I paid for this.
Love how it reminds me of an old Cressida.
December 9, 2013
Subscribe to: Posts (Atom)


text: This table is used for column layout. About UsOffice of the PresidentPhilosophyHistoryAt a GlanceContact UsAdministration DirectoryFaculty DirectoryAcademicsProgram of StudiesSummer ReadingDaily ScheduleGuidanceOverviewGoals of ContactNote to SeniorsSAT/ACT TestingScholarshipsNAVIANCECommon ApplicationFAFSASchool ProfileBrag SheetImportant Forms and DocumentsAdmissionsOverviewOnline ApplicationImportant FormsTuition & Financial AidOverviewFACTS InfoFACTS Website for HSFACTS Website for MSAthleticsOverviewTeam SchedulesHall of FamePolicies & FormsCCAACoaches InformationStudent LifeOverviewStudent HandbookBullying Prevention PlanGuidelines Brochure for Classes at Holy RosaryExtracurricular ActivitiesCampus MinistryFood PantryCafeteriaPayForIt Parent InfoPayForIt LinkLunch MenuHoly Rosary Order FormImportant FormsFamily & Emergency FormParking Registration FormTylenol Use FormHigh School Polo Shirt Order FormMiddle School Polo Shirt Order FormSupport CCHSGivingEventsFundraisersUseful LinksDirections to CCHSLinks for ParentsPlus PortalsMoodleFirstClassClient DownloadWeb LoginInstructionsBook Ordering InformationFollett BooksMandatory Additional ResourcesLibrary ResourcesAlumniOverviewTechnologyOverview1:1 Initiative InformationTechnology BlogParent Tech Nights Frank L. Tosti, Jr. Library Printer-Friendly Version Contact TypeContact InformationAddress:Coyle & Cassidy High School2 Hamilton StreetTaunton, MA 02780Hours:7:30am to 3:00pm Daily except school vacations. Link to PageCheck out the "Wish List" for our Library...Helpful WebsitesLink to PageLink to PageLink to PageAssignment Organizer-The Big 6Encyclopedia Britannicahttp://www.myowncafe.org/Homeworkspothttp://sailsinc.orgMac Tutor History and Math ArchiveMerriam-Webster DictionaryNational GeographicNYTimes Learning COPYRIGHT AWARENESS WHEN USING YOUR OWN OR A SCHOOL COMPUTER, YOU MUST ALWAYS CREDIT YOUR SOURCES OF INFORMATION. Information (including pictures) obtained from any source including the INTERNET, databases, CD ROM, books or periodicals must be credited in any work that you do. Copies of Copyright Guidelines are posted in the library for students and in the faculty room for staff. For specific guidelines the library has a copy of Copyright For Schools, a practical guide by Carol Simpson. Useful websites to build citations: Easybib Noodletools Citationmachine Copyright Information Information to help avoid plagiarism Massachusetts Library Databases Access: The following Facts on File databases and Opposing Viewpoints Resource Center may be accessed on Moodle through Library Resources for Students and Teachers. Science Online Health Reference Center Bloom's Literary Reference Online Ferguson's Career Guidance Center Or use the Facts On File online database portal page URL Thomas Gales: Opposing Viewpoints Resource Center Access: The following ABC-CLIO databases may be accessed on Moodle through Library Resources for Students and Teachers. American Government American History Issues - Controversy and Society World at War - Conflict and Society World Geography - Understanding a Changing World World History - Ancient and Medieval Eras World History - The Modern Era United States Geography Thomas Gales: Opposing Viewpoints Resource Center Donate Your Used Books at Coyle and Cassidy Looking to get rid of your used books? Coyle and Cassidy High School is fundraising through the donation of used books, CDs, DVDs, videos, and audio books. The school has placed a drop-off donation and reuse container for residents, businesses, schools, libraries, and other groups who wish to contribute books they no longer have a use for and would like to see repurposed, while also raising money for the school library. The 'Got Books?' donation container, distinguished by its lively purple and yellow signs, is conveniently located in the parking lot of the school on 2 Hamilton Street in Taunton (near Hopewell Park). Donations can be made by the public at any time. Profits raised through book donations will benefit funding for Coyle and Cassidy's Frank L. Tosti Library Choose to reuse! Donating books is a great way to keep them out of the trash and give them a new life with someone who will value them as you did. In addition to helping divert waste from landfills, these donated goods will be repurposed in great ways; they could be donated to schools, libraries, and other groups in need, sent overseas to the troops, given to teachers for their classrooms, or sold in book sales and online. About Got Books? Got Books is a North Reading, MA-based organization dedicated to keeping books out of the trash. Got Books raises money for local charities and nonprofit groups through book donations. They have 245+ book donation containers placed throughout New England. For more information about Got Books call 978-396-6026 or visit www.GotBooks.com. SPECIAL THANKS Thank you to those who have made contributions of books and periodicals to the Frank L. Tosti Library: Mr. Frank Tosti The CC Parent Connection Kate Deshaises Cheryl Nastri Virginia O'Brien David Casavant Jane (Chisholm) LeBrun Collette Ulak Detail Detail 2 Hamilton Street | Taunton, Massachusetts 02780-2483 | P: (508) 823-6164 | F: (508) 823-2530 Website Disclaimer Virtual Towns & Schools Website


text:
Pakistan: 9 killed by U.S. drones
2 top Taliban commanders possibly among the dead, officials say
Posted: January 7, 2013 at 4:54 a.m.
Suspected American drones fired several missiles into three militant hide-outs near the Afghan border Sunday, killing nine Pakistani Taliban fighters, intelligence officials said.
This story is only available from our archives.
Front Section, Pages 6 on 01/07/2013
« Previous Story
Where's aid? Palestinian asks Arabs
The Palestinian self-rule government is close to being "completely incapacitated," largely because Arab countr... Read »
Next Story »
India, Pakistan trade shots in Kashmir
Pakistan and India traded accusations Sunday of violating the cease-fire in the disputed northern region of Kashmir, with Islamabad accusing Indian troops of a cross-border... Read »


text:
Audio Samples
Album Summary
Notes & Reviews:
Jerome Moross (1913-1983) was in the vanguard of composers who realized that there was a music of America, and for America written by Americans. This recording, originally released by Koch, offers three major scores by this eminent American composer. Moross grew up with and listened to jazz bands, played in theatre pits and found that his own composing style was totally, spontaneously conditioned by it. Having found his métier relatively early in life, he stuck to it through thick and thin to the end. And perhaps because he was so young when he found his voice, his music sounds young - always, early and late. His music is exciting and always sounds fresh, but uniquely his own.
American Record Guide, July/August 2013
The Last Judgement (1953) is a ballet for chamber orchestra on the story of Eve. Moross's music is pop-based. It's charmingly quaint and would likely be a hit today in the right environs. The program closes with a set of Variations on a Waltz. The variations combine to form a ballet on the topic of Red Riding Hood and her seduction by the Big Bad Wolf, culminating with the dramatic intervention of good old Granny. The piece is again pops concert material, and with appropriate scenic props would make a delightful diversion. Kids would love it. The music is brilliantly written and just plain fun, like everything else on this program. Falletta and the LSO are predictably professional and technically flawless.
Recording information: Abbey Road Studios, London (03/01/1993-03/02/1993).
ReviewsThere are currently no reviews, be the first one!
Also Purchased
Works DetailsMoross, Jerome : Symphony no 1
- Conductor: JoAnn Falletta
- Ensemble: London Symphony Orchestra
- Notes: Abbey Road Studios, London (03/01/1993-03/02/1993)
- Running Time: 20 min. 16 sec.
- Period Time: Modern
- Form: Orchestral
- Written: 1941-1942
Moross, Jerome : The Last Judgement
- Conductor: JoAnn Falletta
- Notes: Abbey Road Studios, London (03/01/1993-03/02/1993)
- Running Time: 21 min. 50 sec.
- Period Time: Modern
- Form: Ballet
- Written: 1953
Moross, Jerome : Variations on a Waltz, for orchestra
- Conductor: JoAnn Falletta
- Notes: Abbey Road Studios, London (03/01/1993-03/02/1993)
- Running Time: 12 min. 53 sec.
- Period Time: Modern
- Written: 1946


text:
Post a FREE ad now!
& IMPROVED - Only takes 60 seconds
Free stuff in Gloucester
Free stuff Classifieds - 80 free ads online now
Find free stuff at Freeads and join 1000s of other freebie finders offering and taking free items.
Reduce landfill and join the free stuff revolution!


text:
A relationship graph representing a social network connecting multiple entities is created and maintained as nodes and edges. Data received for an entity is used to create a new node. A strength of relationship value is calculated for each relationship between the new entity and an entity represented by an existing node and assigned to an edge is created to represent each relationship. Data received for an existing node causes the node to be updated, and the strength of relationship values for each of its relationships to be recalculated and assigned to the appropriate edge. More than one node may exist for an entity and conflicts among the data of the multiple nodes are reconciled. The received data may be extracted from data sources owned by a user in accordance with privacy criteria for the user, or may result from processing data in the relationship graph.
1. A computerized method of creating and maintaining a relationship graph having nodes representing entities and edges representing relationships between entities, the method comprising:
receiving data extracted from a private data source on a client device by a data extractor module, the received data being associated with a new entity and being in accordance with privacy criteria specified by a user, the privacy criteria prohibiting an extraction of at least one pre-defined type of data from the private data source on the client device, the at least one pre-defined type of data relating to a type of contact information;
adding a new node created from the received data to the relationship graph for the new entity;
calculating a strength of relationship value for a relationship between the new entity and an existing entity represented by an existing node in the relationship graph, the strength of relationship value being calculated based on a calculated quality of contact between the new entity and the existing entity and a frequency of contact between the new entity and the existing entity, wherein the quality of contact is calculated automatically based, at least in part, on what contact information is possessed by the new entity for the existing entity, without requiring a user to specify a quality of contact value;
creating an edge to represent the relationship in the relationship graph;
assigning the corresponding strength of relationship value to the edge linking the new node and the existing node;
automatically comparing the received data to existing data in any existing node to determine if any conflicts exist between the received data and the existing data, the existing data pertaining to the new entity or the existing entity; and
automatically reconciling, without user input, the received data with the existing data if a conflict is detected between the received data and the existing data, wherein reconciling includes determining an accuracy of the existing data and an accuracy of the received data, updating the existing data based on the received data if the received data has a higher accuracy, and updating the received data based on the existing data if the existing data has a higher accuracy.
2. The computerized method of
3. The computerized method of
updating an existing node for the entity with the received data;
calculating a weight for each relationship for the entity;
assigning the corresponding weight to each edge linked to the existing node for the entity; and
reconciling the received data with any other existing node that represents the same entity.
4. The computerized method of
calculating a relationship quality value;
calculating a relationship frequency value; and
deriving the strength of relationship value from the relationship quality value and the relationship frequency value.
5. The computerized method of
factoring in usage data of the relationship graph by the entity.
6. The computerized method of
7. The computerized method of
updating an existing node with public data; and
updating an existing node with private data if permitted by an owner of the private data.
8. The computerized method of
9. The computerized method of
creating a master node to represent the entity.
10. The computerized method of
associating the master node for the entity with the nodes for the entity.
11. The computerized method of
12. The computerized method of
creating a map representing the relationship graph in accordance with pre-determined criteria.
13. The computerized method of
14. The computerized method of
propagating the map.
15. The computerized method of
16. The computerized method of
extracting the data from a data source owned by a user in accordance with privacy criteria for the user.
17. The computerized method of
18. The computerized method of
19. The computerized method of
20. An article of manufacture comprising a machine-readable storage medium having stored thereon executable instructions to cause a machine to perform a method comprising:
receiving data extracted from a private data source on a client device by a data extractor module, the received data being associated with a new entity and being in accordance with privacy criteria specified by a user, the privacy criteria prohibiting an extraction of at least one pre-defined type of data from the private data source on the client device, the at least one pre-defined type of data relating to a type of contact information;
adding a new node created from the received data to the relationship graph for the new entity;
calculating a strength of relationship value for each relationship between the new entity and an existing entity represented by an existing node in the relationship graph, the strength of relationship value being calculated based on a calculated quality of contact between the new entity and the existing entity and a frequency of contact between the new entity and the existing entity, wherein the quality of contact is calculated automatically based, at least in part, on what contact information is possessed by the new entity for the existing entity, without requiring a user to specify a quality of contact value;
creating an edge to represent the relationship in the relationship graph;
assigning the corresponding strength of relationship value to the edge linking the new node and the existing node;
automatically comparing the received data to existing data in any existing node to determine if any conflicts exist between the received data and the existing data, the existing data pertaining to the new entity or the existing entity; and
automatically reconciling, without user input, the received data with the existing data if a conflict is detected between the received data and the existing data, wherein reconciling includes updating at least one of the received data and the existing data based on the accuracy of the received data and the accuracy of the existing data.
21. The machine-readable medium of
22. The machine-readable medium of
updating an existing node for the entity with the received data;
calculating a weight for each relationship for the entity;
assigning the corresponding weight to each edge linked to the existing node for the entity; and
reconciling the received data with any other existing node that represents the same entity.
23. The machine-readable medium of
calculating a relationship quality value;
calculating a relationship frequency value; and
deriving the strength of relationship value from the relationship quality value and the relationship frequency value.
24. The machine-readable medium of
factoring in usage data of the relationship graph by the entity.
25. The machine-readable medium of
26. The machine-readable medium of
updating an existing node with public data; and
updating an existing node with private data if permitted by an owner of the private data.
27. The machine-readable medium of
28. The machine-readable medium of
creating a master node to represent the entity.
29. The machine-readable medium of
associating the master node for the entity with the nodes for the entity.
30. The machine-readable medium of
31. The machine-readable medium of
creating a map representing the relationship graph in accordance with pre-determined criteria.
32. The machine-readable medium of
33. The machine-readable medium of
propagating the map.
34. The machine-readable medium of
35. The machine-readable medium of
extracting the data from a data source owned by a user in accordance with privacy criteria for the user.
36. The machine-readable medium of
37. The machine-readable medium of
38. The machine-readable medium of
39. A system comprising:
a processor coupled to a memory through a bus, and further coupled to an I/O interface through the bus; and
a graph process executed from the memory by the processor to cause the processor to:
receive data extracted from a private data source on a client device by a data extractor module, the received data being associated with a new entity and being in accordance with privacy criteria specified by a user, the privacy criteria prohibiting an extraction of at least one pre-defined type of data from the private data source on the client device, the at least one pre-defined type of data relating to a type of contact information,
add, a new node created from the received data to a relationship graph for the new entity,
calculate, based on a calculated quality of contact and a frequency of contact a strength of relationship value for a relationship between the new entity and a existing entity represented by an existing node in the relationship graph, wherein the quality of contact is calculated automatically based, at least in part, on what contact information is possessed by the new entity for a existing entity, without requiring a user to specify a quality of contact value,
create an edge to represent the relationship in the relationship graph,
assign the corresponding strength of relationship value to the edge linking the new node and the existing node, automatically compare the received data to existing data in any existing node to determine if any conflicts exist between the received data and the existing data, the existing data pertaining to the new entity or a existing entity, and
automatically reconcile, without user input, the received data with the existing data if a conflict is detected between the received data and the existing data, wherein reconciling includes updating at least one of the received data and the existing data based on the accuracy of the received data and the accuracy of the existing data.
40. The system of
41. The system of
42. The system of
43. The system of
44. The system of
45. The system of
46. The system of
47. The system of
48. The system of
49. The system of
50. The system of
51. The system of
52. The system of
53. The system of
54. The system of
55. The system of
56. The system of
57. The system of
This application claims the benefit of U.S. Provisional Application No. 60/401,840 filed Aug. 6, 2002.
This invention relates generally to analysis and graphing of relationships among entities, and more particularly to analysis and graphing of social relationships among people.
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings hereto: Copyright � 2002, Spoke Software, Inc., All Rights Reserved.
Currently various computer-based applications manage and track interactions between people in conjunction with, for example, a sales process. Customer Relationship Management (CRM) systems that incorporate sales force automation methodologies typically focus on pipeline management and on monitoring the sales process between known endpoints but the current CRM systems cannot identify a new endpoint or provide a guided process to a new endpoint.
Social Network Theory has evolved to characterize the behavior of "referral networks." Researchers have described mathematically the multiple levels of relationships existing among networks of people, for example, the situation where two friends, Jim and Fred, may see each other every day at the gym (high personal relationship strength) but never discuss business (low professional relationship strength). Further, social network theorists have shown that networks exhibit predictable behaviors at the macro and micro levels. As the networks grow, they tend to preferentially attach to the more connected nodes, with the "rich getting richer".
Bridges between networks (particularly between highly connected nodes) that span enterprises are important for sales prospecting purposes. Studies of connections among these networks demonstrated what might appear to be counter-intuitive: when it comes to finding a job, our "weak social links" are more important than the more cherished, strong, relationships, indicating that groups of tightly coupled friendship circles connect to other groups of tightly coupled friendships via "bridges" that sharply broaden the job search space.
Although Social Network Theory has established that evaluating a person's social network can generate high quality contacts, analysis of social relationship information to identify and quantify referral routes to a desired person or company has not been incorporated into computer-based applications. In particular, the identification of "invisible" referral routes has not been addressed, e.g., Fred went to school with the Vice President of Purchasing at a particular company Jim has as a sales target.
A relationship graph representing a social network connecting multiple entities is created and maintained as nodes and edges. Data received for an entity is used to create a new node. A strength of relationship value is calculated for each relationship between the new entity and an entity represented by an existing node and assigned to an edge is created to represent each relationship. Data received for an existing node causes the node to be updated, and the strength of relationship values for each of its relationships to be recalculated and assigned to the appropriate edge. More than one node may exist for an entity and conflicts among the data of the multiple nodes are reconciled. The received data may be extracted from data sources owned by a user in accordance with privacy criteria for the user, or may result from processing data in the relationship graph.
The present invention is described in conjunction with systems, clients, servers, methods, and machine-readable media of varying scope. In addition to the aspects of the present invention described in this summary, further aspects of the invention will become apparent by reference to the drawings and by reading the detailed description that follows.
In the following detailed description of embodiments of the invention, reference is made to the accompanying drawings in which like references indicate similar elements, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical, electrical, functional, and other changes may be made without departing from the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims.
An overview of the operation of an embodiment of an entity relationship analysis and mapping system is described with reference to
As illustrated in
Each edge directly connecting a pair of nodes is assigned a "Strength of Relationship" (SOR) weight based on the quality and frequency of contact between the two people (not illustrated). The relationship graph 100, along with the SOR between pairs of nodes, establishes a "Network Strength of Relationship" (NSOR) between every reachable pair of nodes in the social network represented by the graph 100, and an "Aggregate Strength of Relationship" (ASOR) between either subscribers to the system, or groups of subscribers, and targets who are subscribers or non-subscribers known to subscribers ("leaves"), or groups of subscribers and/or leaves. Exemplary formulas to calculate the SOR, NSOR, and ASOR are given further below.
As illustrated, even though Pete and Mary are not directly connected, Pete can "reach" Mary by being referred through the social network represented by the graph 100. Starting with Pete's immediate relationships, the system of the present invention analyzes the relationship graph 100 to dynamically establish a path of intermediate nodes 105, 107, 109 that ends with the node 103, and suggests Tim as Pete's starting contact for his referral request. Pete invokes a workflow function within the system to begin the process of forwarding his referral request to Mary. The system will send a message to Tim, informing him that Pete is requesting a referral to Mary and that Pierre is the next contact in the referral path. If Tim decides to forward the referral request to Pierre, Pierre will receive a similar message indicating that John is the next contact. In an alternate embodiment, any person receiving the referral request may determine that a person different than that originally selected by the system should be the next link in the path. Furthermore, although only one path is illustrated in
Any person in the path may decline to forward the request to the next person, but a privacy protection scheme for the workflow masks the break in the referral chain so that the request originator only knows that the referral request was not successful, not where the chain was broken. The privacy protection scheme is illustrated in
Assuming someone in the path does decline to forward the request, the system may use that information to recalculate the SOR between the sender of the request and the person that broke the chain. Conversely, if node N passes on the referral it receives from node N−1, the SOR between nodes N−1 and N increases.
Privacy protection may be facilitated when the relationship graph is a directed graph in which the edge between pairs of nodes can be traversed in only one direction. As illustrated in
In one embodiment, the system maintains three categories of data about people: public data, private data, and "inferred" data. Public data is information that is generally available, such as on the Internet, or is specifically made available to all subscribers to the system. For example, name, title, and employer fall in the public data category. When a change in public data is extracted from a sufficient number of data sources, the public data is updated if the change is considered "correct" as described further below. Private data is information that every subscriber individually maintains for the other people with which he/she has direct relationships. Thus, A's private data may reflect a change in the mobile telephone number for B while C continues to see only the old number. Inferred data is information developed by the system based on interactions among the subscribers. Thus, in the above example, the system may infer that B has changed jobs based on A's private data. In one embodiment, inferred data is protected with additional security, such as encryption, to safeguard the personal actions of the subscribers.
As previously described, the relationship graph 100 illustrated in
Furthermore, in one embodiment, the system distinguishes among subscribers to the system and those non-subscribers with whom the subscribers communicate to protect the privacy of the non-subscribers. For example, assume non-subscriber A sends email to subscriber B and carbon copies fifteen other people. A has thus exposed the fifteen other people to B and the system adds the fifteen people to B's relationship graph as "shadow" nodes, which it includes in its search when B requests a referral path. Additionally, A is added as a "shadow" subscriber. However, because A is a shadow subscriber, no subscribers other than B can search through A and any workflow that identifies B as an intermediary link to one of the fifteen ends at B. If B decides to forward the referral request, B contacts A outside the system.
While the system has been described in terms of relationships between pairs of nodes, it will be appreciated that nodes may be grouped into sets and that relationships may be established among nodes and sets of nodes in various combinations and processed in a similar fashion to relationships among individual nodes.
Turning now to
The server 303 includes a relationship engine 309 that refines the raw data received from the data extractor modules 313 on the clients 313 into relationship graph data 305. The configuration of nodes and edges that represent the relationship graph data 305 in the resulting relationship graph is defined by a relationship master 307. The relationship engine 309 also is responsible for processing the relationship map(s) in response to queries submitted by on-line applications 311, such as a request to search for a referral path or to provide workflow functions. In one embodiment, the relationship engine 309 includes an update process, a scoring process, and a reconciliation process to build and maintain the relationship graph, the map(s), and the graph data 305 as described in more detail below. Additional processes may be included in the relationship engine 309 to support various on-line applications 311, the client 301, and the partner client 321. In yet another embodiment, the relationship engine 309 generates a status value for each subscriber based on the strength of his/her relationships and use of the system 300 vis-�-vis a peer group and the entire subscriber base. The status value may be a criterion in the referral path search process. An exemplary formula to generate the status value is given further below.
It will be appreciated that the single data store 305 may represent multiple physical devices holding the relationship network data and that multiple, different graphs may be federated into a single data store, as described further below. Furthermore, not all data received by the system 300 may be stored in data store 305 but some particularly sensitive data may be evaluated and the results stored instead. Alternatively, such data may be encrypted or otherwise hidden in case of security breaches in the system. Relationship data may become stale due to lack of activity by an entity or termination of the subscription to the system. Under some circumstances, such stale data may be retained to allow future updating or because the data is considered historical. In other cases, the stale data is replaced by more correct data as described further below.
As described above, the system 300 is based on social network models and the relationship engine 309 may include a relationship modeling process that aggregates and analyses subscriber and enterprise (system-wide) data to refine the social network models and relationship scoring techniques. The aggregated data is used to create characteristic models at different levels of abstraction that may be subsequently used as default values for a new system. In one embodiment, the aggregated data includes enterprise and vertical characteristic (e.g., industry, culture, country) data. The enterprise characteristic data is an aggregated model of all the subscribers on a specific system 300. This model characterizes the enterprises subscribers based on behavioral averages and can be transported to a new, similar enterprise to enable faster deployment without compromising the underlying data. Extending the enterprise characteristic data to verticals permits further generalization of the models.
In an alternate embodiment, the aggregated data includes subscriber characteristic data that is visible only to the subscriber and is a model of the individual's preferences and characteristics. For example, as the system learns the subscriber's behavior, the SOR formula may be tuned specifically for the subscriber. The subscriber characteristic data may be transported to a different server 303 and thus avoids extensive recreation of the data under such circumstances.
The on-line applications 311 may be broken into two categories: personal productivity applications centered around a single subscriber, and enterprise applications that encompass a more global perspective of the relationship graph. Personal productivity applications analyze the relationships of an individual subscriber and enable expansion of the subscriber's relationships. Additionally, the individual is given the ability to tailor certain aspects of the system to his/her needs. For example, a subscriber may create a "privacy fence" that accepts referral requests from only a certain set of contacts. In one embodiment, the privacy fence may have various levels and the subscriber may employ multiple privacy fences. A subscriber desiring to connect with many people would set the level low, while a well connected subscriber would set it high. The privacy fence permits the subscriber to identify key, trusted, colleagues through whom all referrals have to be channeled. For example, the President of the United States would have all requests sent to him/her channeled through the cabinet members. The configurable privacy fence can be a simple "route all requests thru these five trusted members" or can be a more complex one based on the subscriber's network size and sets which subscribers outside of his/her address book can access the subscriber (e.g., if a requester is more than 4 hops out, the request is denied), how they access the subscriber (e.g., the subscribers designated to filter referral requests), and which of his/her inner circle of contacts are absolutely or relatively hidden from the network.
In an alternate embodiment, the privacy fence is configured with levels of privacy for the subscriber's relationships. A "private" relationship privacy level hides the existence of a relationship from all subscribers, including those within the privacy fence. Relationships marked with a "protected" relationship may be accessed by subscribers within the privacy fence. The default relationship privacy level is "public," which allows access to the relationship by subscribers not within the privacy fence. Thus, the relationship privacy levels control exposure of the relationships of a subscriber to other subscribers.
In yet another embodiment, the privacy fence is configured with a closeness factor that defines how near another subscriber must be to the owner of the fence to search through the owner's network. The closeness factor may be derived from NSOR and/or number of links between the owner and the searcher and may be constrained within pre-defined limits.
Enterprise applications provide connections between desired contact targets and subscribers in the system 300 and analysis of the relationship network represented by the relationship graph. Industry or association applications may be considered a subset of the enterprise applications and facilitate collaboration among individuals from disparate enterprises who share common affiliation goals.
In addition, both the personal productivity and enterprise applications may include graphical tools that enable subscribers to visualize the global relationship graph, or an individual's part of it, as a visual map. Visual clues, such sizes of nodes, thickness and color of the edges, can identify holes in the relationship graphs, show changes in the relationship graphs over time, and illustrate how far an enterprise, or an individual, can "reach" through its existing relationships. Particular embodiments of productivity and enterprise applications are described below in conjunction with
In yet another embodiment, a search may access multiple relationship graphs based on permissions, such as an access control list. To avoid unnecessary searching, an interface may be constructed for one or more of the relationship graphs that analyzes the search criteria to determine if any of its data matches the search criteria.
Embodiments of methods performed by client 301 and server 303 are now described with reference to flowcharts in
A client relationship map is built when an off-line application needs to search the relationship data. In one embodiment, an individual graph builder module on the client creates the client map as described further below in conjunction with
A contact may have relationships with multiple subscribers in the system and each subscriber may have a different view or "notion" of the contact's information. To preserve privacy, in one embodiment, method 500 creates multiple nodes to represent the notions and links each to the appropriate subscriber node. The method 500 may also create a master node that represents a unified view of the data. In an alternate embodiment, only a master node is created containing all the view of the data and indicators within it specify what data is accessible by which subscriber. If method 500 detects a conflict among data that is accessible by multiple subscribers (block 507) it invokes a reconciliation process to resolve the conflict and update the graph with the "correct" data (block 509). Conflict detection at block 507 may be based on any type of criteria. In one embodiment, the processing at block 507 reviews all nodes having the same email address to determine if any of their data conflicts.
The reconciliation process determines a degree of "correctness" for each version of the conflicting data. Assume there are 100 subscribers in the system that have information for contact A, 75 of whom show the same home address for contact A, with the other 25 subscribers having many different home addresses for A. In one embodiment, the reconciliation process extrapolates that the home address known to the 75 subscribers is likely the correct address based on the percentages. On the other hand, if A has recently moved, only a few people may actually have the new address. Therefore, in another embodiment, the reconciliation process additionally considers how recently the data for A has been updated based on creation and update time stamps associated with the data. In still another embodiment, each field of data is associated with a set of rules that base degree of correction on data attributes. For example, a rule for the home address field may rate a P.O. Box number less "correct" than a street address since the P.O. Box number may be given to less trusted entities. Additionally, the closeness of the relationship between the contact and the entity, measured through the SOR or relationship type, i.e. parent-child, may be a factor. The reconciliation process may update the public data in each node with that determined most correct. Additionally, if a node representing a unified view of the data has been created, at block 509 the reconciliation process updates it with the data determined most correct.
The method 500 creates one or more static maps from the relationship graph (block 511), and optionally propagates the static maps throughout the system if there are additional servers in the system (block 513, shown in phantom). In one embodiment, the relationship data is maintained on a master server and a global static graph is created on the master server that reflects the total relationship graph. The global static map is subsequently pruned, typically optionally, according to pre-determined criteria, such as company affiliation, performance parameters, path usage, path length, and system-discovered data (e.g., inferred data or hidden relationships), to create subset static maps that reflect certain portions of the total relationship graph, or to produce maps with limited detail that may be used in the aggregation process described previously. The global and/or subset static maps may be propagated to particular servers within the system at block 513. In one embodiment, the process represented by block 513 transmits the updated global or subset static graphs to the appropriate server when a queue of requests on the server is empty. It will be appreciated that the propagation may be performed serially on each server or in parallel and that the process at block 513 may incorporate time-out and retry functions to handle situations in which the server(s) are busy. Support for various types of server clusters is also considered as within the scope of the invention.
In an alternate embodiment not shown, multiple SORs may be calculated for the same relationship, such as professional SOR, a personal SOR, and/or a private SOR.
If the request was for client synchronization (block 605), the search was focused on a subscriber's relationship and the results represent an ego-centric view of the relationship graph. The method 600 prunes the search results according to pre-determined criteria, and sends the resulting synchronization data to the client at block 609. The synchronization data may be subsequently searched by client applications, such as off-line applications 319 in
If the requester of a new referral elects to initiate a referral workflow based on the search results (block 611), the method performs the referral process at block 613. If the request is for relationship analysis (block 615), the method 600 performs and returns the requested analysis of the search results at block 617. Various types of analysis are supported by the system and exemplary embodiments are described further below. When the current request is processed, the method 600 proceeds to block 619 to await the next request.
Turning now to
If a subscriber has requested the system search for a new referral, the search method 620 searches the static map for a match on referral information, and optionally other types of search criteria (block 631). Referral information may include first or last name, email, title, or any combination, to search for referral to a person, or an entity name to search for a referral within the entity, such as a company, but the invention is not so limited. In one embodiment, the search process at block 631 searches for matches through only those subscribers that have the requester in their address books. In an alternate embodiment, the search process at block 631 searches for matches through other subscribers that are in the same group as the requester as previously described.
If there are any matches in the static map (block 633), the matches are filtered based on system level privacy rules and those of the owner of the information (block 635). In one embodiment, the privacy filtering includes shadow node filtering as described previously. The filtered matches are displayed to the requester (block 637) for selection.
Upon receipt of a match selection (block 639), the search method 620 identifies potential paths between the selected match and the target of the referral (block 641). When the paths have been identified, the length of each path is determined at block 641 and each path is prioritized with its SOR value at block 645. Each path is associated with its initial match, or connector, and duplicate paths for a connector are removed from the results at block 647. The search method 620 selects one or more connectors based on a relevance value derived from the length and SOR value of the connector's path(s), and optionally other criteria, such as affiliations of the connector (e.g., alumni), that reflect the relative quality of the connector's paths to the target (block 649). The selected connectors, or a subset, are displayed to the requester in quality rank order at block 651. It will be appreciated that the subset may be a pre-determined number of connectors, or only those that satisfy a relevance value threshold, or that multiple displays may be used to show as many connectors as the requester wishes. Furthermore, one of skill in the art will readily understand how to incorporate a referral proxy feature as described above into the processing represented at block 651.
In one embodiment, three different categories of paths may be identified at block 641 depending on the search target:
In this embodiment, the relevance value for a connector is the ASOR (aggregate SOR) for first category paths, the SOR for second category paths, and the NSOR (network SOR) for third category paths. The aggregate SOR for a connector is the sum of the network SORs for all paths from the connector to the target, i.e., Σ (NSOR) with ASOR≧0. Thus, if connector A has three paths into company 1 with network SORs 35, 50 and 85 respectively, and connector B has two paths into company 1 with network SORs of 80 and 95 respectively, B is the better connector as he/she has an aggregate SOR of 175 verses A's 170. Paths with equal ASORs may be displayed to the requester along with their standard deviations.
Because people are generally less inclined to help the further they are from the requester, the network SOR includes a decay constant to factor in the attenuation of a path as follows
As mentioned above, additional criteria may be considered at block 649 to select the connectors. In one embodiment, an additional metric that represents the Likelihood of Referral or Responsiveness (LOR) of the connector may be used. LOR is derived from the history of referral requests made through this connector, including a weighting of the number of referrals accepted and denied, the total number of referral requests to this connector by anyone and specifically by the requester, the number of referrals completed to the final destination, and, for accepted referrals that did not reach the final destination, a factor of how close they got to the final destination. The LOR may be calculated as follows
In yet another embodiment, a Strength of Influence (SOI) represents the connector's influence on the next contact in the path. For example, in a sales situation, the SOI measures the influence of an entity on a sale from the perspective of the seller. The SOI may be calculated by polling various subscribers regarding an entity, such as through a survey initiated by applications and/or subscribers. It will be appreciated that a combination of the metrics described above may be used and that the values will be presented to the requester at block 651.
Returning to block 661, if the method 660 was invoked by a request for referral status for a subscriber, it displays the referral status for the subscriber at block 671 and waits for input. If input is received (block 673), the referral method 660 determines if the subscriber has indicated an action on the subscriber's outstanding referral requests, or on a referral request from another subscriber (block 675). If the latter, the referral status displays the suggested next contact(s) in the path and the subscriber may chose to reject the referral completely, accept the suggested next contact or select one if multiple suggestions are displayed, or delegate the referral to a different person. If the action is "accepted" (block 679), the method 660 proceeds to block 665 to send the message to the next contact in the path. If the action is "delegate" (block 681), the method 660 receives an alternate next contact from the subscriber (block 683) and dynamically calculates the possible paths as described in blocks 631 through 649 in
Returning now to block 675, if the subscriber's input indicates an outstanding referral request initiated by the subscriber has been completed, or has been aborted, the method 660 ends the referral workflow at block 677. In one embodiment, different status indicators are assigned to a terminated referral workflow at block 677 that indicate which subscriber input caused it to end.
As described above in conjunction with
In one embodiment, the status value is a five-tuple consisting of a quality-universe value, a quality-group value, a use-universe value, a use-group value, and weighted average of the other four tuples. Each of the five values is in a range from 0-100. The quality-universe value, quality-group value, use-universe value, and use-group value are generated on a periodic basis, such as on a timed schedule or at usage thresholds, e.g., every 100 referrals. The universe values are calculated relative to the network represented by the entire relationship graph, while the group values are calculated relative to the relationship graph that represents the network for a peer group that includes the subscriber. The status value for a particular subscriber is only displayed to the subscriber and used internally in the system.
Factors for the quality-universe value include the subscriber' reachable space, average NSOR, in-degree, out-degree, number of domain names in the subscriber's email address book, and geodesic distance. In social networking theory, the in-degree value for a node measures the number of edges that terminate at the node, i.e., how many other nodes can directly reach this node. Similarly, the out-degree value for a node measures the number of edges that originate at the node, i.e., how many other nodes this node can reach directly. The geodesic distance is the number of nodes in the shortest path between two nodes.
The quality-group value is calculated as
Factors for the use-universe value include a percentage of the subscriber's reachable space, number of searches performed, number of referrals requested, and number of referrals responded to by the subscriber.
The use-group value is calculated as
The information returned at block 629 may be analyzed at block 617 using various set functions including intersection, difference, union and the set complement of the union, which may be stand-alone functions, or called from or incorporated into personal productivity and enterprise applications. The output of block 617 may be in various formats, including text, table, chart, or visualization maps, as described further below.
The personal productivity applications enable the subscriber to build, analyze, and manage his/her relationship network. For example, analysis of a subscriber's network may reveal structural holes and indicate other subscribers in the network that can fill the holes. Analysis can also identify common contacts among two people to allow each to leverage the contacts of the other. Additionally, the search and analysis represented by blocks 603 and 617 may be invoked automatically based on various triggering events. For example, information for contacts selected by criteria specified by the subscriber may be automatically sent to the subscriber on a periodic basis. A subscriber's contacts may be time-stamped and a message sent to the subscriber when analysis indicates the information has not been updated within a given time period. Information inferred for a contact, as described above, may cause a message to be sent to the subscriber and/or the contact to verify the inferred information.
The enterprise applications analyze the relationship graph globally instead of focusing on a single subscriber. For example, analysis of the contacts of team members into a target company allows the team manager to determine the strengths and weakness of the team. Conflicting and/or hidden paths into company may be identified as well. The results of the analysis may be filtered on various criteria, such as contact name, title, SOR/NSOR, or other information. Non-team based information about a target company, including parts of the organization chart, can also be derived from search results. Additionally, an enterprise application may request a search be performed at block 603 to locate all subscribers that can be connectors to one or more specific targets, with the analysis at block 617 evaluating the results on various criteria to select multiple paths into a company or to people. It will be appreciated that the referral process at block 613 may be subsequently invoked to start the workflow for the multiple paths.
In a sales environment, a set of leads for an opportunity may be fed into the search at block 603 to be correlated against the enterprise interrelationship graph to provide a lists of people that know anyone specifically identified within the opportunity and/or the company or organization identified by the opportunity. After the potential connections to opportunity identified, the analysis at block 617 qualified or disqualified or disqualifies each lead through a series of questions sent to the potential connectors. Assuming the lead is qualified, those connectors that responded may be selected as referral paths.
Furthermore, the analysis represented at block 617 may produce visual maps that represent the relationship graph or parts of it. A visual map may be ego-centric in that it focuses on a particular subscriber, either in general or in relationship to a selected target. A visual map may be socio-centric in that it shows aggregated relationships among a select group of subscribers, such as a sales team. Various views may be imposed on either type of visual map. For example, a subscriber may wish to view his/her ego-centric visual map in terms of his/her status value, and in terms of the individual relationships that are used to calculate the status value. Alternatively, a subscriber may wish to view an ego-centric visual map in terms of business verses personal relationships, which result in different views even though some of the same nodes are in both views. "Diff" visual maps may be created when a subscriber or a group of subscribers are added or deleted from the system to examine the impact that this operation has on the relationship visual map. The diff visual maps may also be used in "what-if" analysis. For example, if a sales executive is attempting to select or fire one of two potential sales reps, an individual diff visual map for each of them can provide quantifiable metrics that the sales exec can consider in arriving at his decision. All else being equal, the rep with the better reach into the target accounts is the better one to hire or retain. Another example might be the loss of a key sales rep. The sales exec is most concerned about key accounts he might lose with the departure of the particular rep. Alternatively, if the sales executive is attempting to select partners to pull into a deal can use a team diff visual map in arriving at his decision. All else being equal, the partner with the better reach into the target account is the better one. It will be appreciated that the "what-if" analysis may be manual or incorporate various mathematical programming and other optimization techniques to evaluate multiple simulations simultaneously.
Inverse "diff" visual maps can find commonality among entities, and identify hidden connectors, among other uses. Additionally, "movie" visual maps can show the growth of relationships for an individual or a group. Different levels of detail may be presented in a visual map, with an interactive ability to drill down to the different levels.
In a sales situation, a power visual map can show all known stakeholders or players at a target account and how they affect the buying decision associated with a current opportunity. The selling team uses the power visual map to understand the power dynamics of the buying organization in order to effectively penetrate the account and close the deal. At a high level, the power visual map depicts each stakeholder's preference for the vendor, their current level of involvement, and their power base. It also outlines the lines of influence, indicating who can affects other stakeholders and the outcome of an opportunity. A more detailed view of the power visual map provides information on the key pain points of each stakeholder, their role in the deal and who on the selling team is responsible for that relationship. The system will help accelerate the construction of the power visual map based on insight and information provided by people who have existing known relationships to these stakeholders. Some of these people will be on the selling team, others may not. In addition, the system will use the relationship data to infer possible lines of influence between different stakeholders at the buying organization.
Various commercially available applications that process data into visual maps are suitable for use with the invention and thus the details of such processing are not further described.
In practice, the methods described herein may constitute one or more programs made up of machine-executable instructions. Describing the method with reference to the flowcharts in
A particular implementation of a relationship master data structure, such as relationship master 307 in
The identifiers 701, 705 reference a corresponding node that is defined by a node data structure 720 shown in
It will be appreciated that additional information may be included in the relationship master data structure. For example, the edge data structure may also include fields that contain the raw data from which the SOR is calculated. Additional fields may be included to represent. Additionally, fields in the relationship master data structure may contain attributes for the data contained in the field, such as a privacy or origin indicator, may be fixed or variable length, and may be required or optional. Thus, alternate embodiments that include more or fewer data fields are contemplated as within the scope of the invention.
The following description of
The web server 9 is typically at least one computer system which operates as a server computer system and is configured to operate with the protocols of the World Wide Web and is coupled to the Internet. Optionally, the web server 9 can be part of an ISP which provides access to the Internet for client systems. The web server 9 is shown coupled to the server computer system 11 which itself is coupled to web content 10, which can be considered a form of a media database. It will be appreciated that while two computer systems 9 and 11 are shown in
Client computer systems 21, 25, 35, and 37 can each, with the appropriate web browsing software, view HTML pages provided by the web server 9. The ISP 5 provides Internet connectivity to the client computer system 21 through the modem interface 23 which can be considered part of the client computer system 21. The client computer system can be a personal computer system, a network computer, a Web TV system, a handheld device, or other such computer system. Similarly, the ISP 7 provides Internet connectivity for client systems 25, 35, and 37, although as shown in
Alternatively, as well-known, a server computer system 43 can be directly coupled to the LAN 33 through a network interface 45 to provide files 47 and other services to the clients 35, 37, without the need to connect to the Internet through the gateway system 31.
It will be appreciated that the computer system 51 is one example of many possible computer systems which have different architectures. For example, personal computers based on an Intel microprocessor often have multiple buses, one of which can be an input/output (I/O) bus for the peripherals and one that directly connects the processor 55 and the memory 59 (often referred to as a memory bus). The buses are connected together through bridge components that perform any necessary translation due to differing bus protocols.
Network computers are another type of computer system that can be used with the present invention. Network computers do not usually include a hard disk or other mass storage, and the executable programs are loaded from a network connection into the memory 59 for execution by the processor 55. A Web TV system, which is known in the art, is also considered to be a computer system according to the present invention, but it may lack some of the features shown in
It will also be appreciated that the computer system 51 is controlled by operating system software which includes a file management system, such as a disk operating system, which is part of the operating system software. One example of an operating system software with its associated file management system software is the family of operating systems known as Windows� from Microsoft Corporation of Redmond, Wash., and their associated file management systems. The file management system is typically stored in the non-volatile storage 65 and causes the processor 55 to execute the various acts required by the operating system to input and output data and to store data in memory, including storing files on the non-volatile storage 65.
An entity relationship analysis and mapping system has been described. Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiments shown. This application is intended to cover any adaptations or variations of the present invention.
For example, those of ordinary skill within the art will appreciate that although the system has been described in terms of sales prospecting and lead generation, the invention is not so limited and is suitable for use in any environment that utilizes referrals from one person to another. Furthermore, those of ordinary skill within the art will appreciate the term "database" has been used in its generic sense and is intended to encompasses all types of logical data storage, including relational, hierarchical, indexed and flat file systems. Therefore, it is manifestly intended that this invention be limited only by the following claims and equivalents thereof.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Jump to content
|Last action by
|What is a good tool to regulate employee Internet access? in Internet, Network & Security
|Windows 10 Feedback notification in Microsoft Beta (Windows 10)
|The Big Wrestling Thread! in The Sporting Arena
|Build 10162 - VPN not working in Microsoft Beta (Windows 10)
|Hi fellas in Introduce Yourself
Posted 07 December 2012 - 03:45
"our customers have given us a lot of trust."
Posted 07 December 2012 - 07:33
Posted 07 December 2012 - 10:26
Posted 07 December 2012 - 10:41
Optical media is home to much higher quality media though. CDs have a higher bitrate than MP3s bought from any online storefront and definitely sound better....blu-rays (heck even some DVDs) look vastly superior to any highly compressed streaming or "digital copy" version.
You may want the optical to die but you're all willing to accept such terrible compromises with regards to quality it makes me cringe.
Posted 07 December 2012 - 11:40
I was talking about audio settings (i.e. It'll be hard to find somebody who can actually tell the difference between 256Kbps AAC and FLAC, etc.). Audio for streaming media does often suffer though (I swear YouTube uses mono audio for some quality settings)
Not for multi-channel audio. I can definitely hear the difference between a Netflix stream and my movies on Blu-Ray.


text:
We went to lunch with my good friend Dave! He was wishing us a good trip north! I think I have lost count now how many trips on the Alaska Highway I have made…… Last year we drove up the Cassiar Highway and came back the Alaska. It was nice but we decided the high country on the Alaska Highway makes the trip more interesting. There are often caribou and big horn sheep that way.
We are planning for a busy time in the gold fields this 2014 season. It sounds like there will be a lot of action from the Gold Rush Show. I spoke with Todd Hoffman a few times last winter but he tries not to tell me anything that would hurt the surprises! I respect that idea and will not post anything I have learned from him or my friends in Dawson that could undermine the entertainment all of us get from the show!
Last mining season I met some of the miners from the Yukon Gold show. I worked with Darwin some….what a character he is!
I emailed with Tim Coles last week. He is mining my Upper Bonanza claims this year again. He has been working out there since the first of April! What hard working tough guy! He said he was going to do our first cleanup of the season yesterday. We will have gold waiting for us……nice!