text:
LEGALST 138 at University of California, Berkeley
The Supreme Court and Public Policy
2 ratings
Reviewed on
Jan 12, 2011
Is this helpful?
Yes No
Attendance is mandatory but Fridays and sections are optional. Reading isn't too important either. You need to make sure you get down his points because it's graded on an outline (must have items 1-3 for C, one of 4 or 5 for a B, both items 4 and 5 for the A). If you do better on the midterm than the final than it will be an added plus to the grade you get on the final.
Reviewed on
Jan 9, 2011
Is this helpful?
Yes No
I highly recommend this class if you are willing to attend every single lecture and take great notes! Section and Friday lecture were optional so I literally only spent 2 hours a week in this class plus I did not read a single thing. The final is worth 100% of your grade unless you do worse on the final than the midterm in which case the midterm will be 25% and the final will be 75%. So it is a bit risky but if you are confident in your test taking, can go to class, and pay attention, you will save hours per week! Shapiro is really interesting and unlike any other proferssor at Berkeley.


text:
FreeBSD 6600 series
Hi, does anyone know when the next expected driver release for FreeBSD since I've just bought a 6600gt and the FreeBSD drivers does not support this card.
Re: FreeBSD 6600 series
I would also like to know this. I have just bought a 6600AGP and love the card...
But it only works in VESA mode on FREEBSD. (ia32). I don't know about amd64... that would be nice also... :)
In the meanwhile I guess I'll run LINUX. I just don't like it as much... it's harder to upgrade and keep current on the OS and the ports. (Well I'll go for GENTOO I guess.)
Re: FreeBSD 6600 series
The upcoming NVIDIA FreeBSD driver release supports the GeForce 6600 family of graphics cards; NVIDIA hopes to release it in the near future, but I don't have an ETA.
Re: FreeBSD 6600 series
|All times are GMT -5. The time now is 02:01 AM.
Powered by vBulletin® Version 3.7.1
Copyright ©2000 - 2015, Jelsoft Enterprises Ltd.
Copyright ©1998 - 2014, nV News.

subset: commoncrawl


text:
Shoud I replace my diode board?
View Single Post
Joined: Apr 2012
Location: Rotorua, New Zealand
Oddometer: 74
Thanks for the reply. 1982 R100RS. It seems the timing was out quite a bit. But I am not sure its spot on now. Marks on the fly wheel are from the bottom upwards "---", "S" and "01" and about 2 inches on there is a "Z". Note this is an electronic system (no point). Battled to start the bike once it was started we checked the timing with the strobe light which was showing the "Z" mark in line with the crank mark. Loosened and adjusted the bean can clockwise and got the "---" about 3mm above the casing mark, I had to fully rotate the bean can all the way clockwise so it could not go any more to get the "---" close to the casing mark. When the bike was revved up to 3500 rpm we couldn't see the "Z" mark but the "---" mark just moved up just a bit. I must say that it idled much better. It started this morning with a touch of the button. I actually couldn't believe how easy it was.
I am just wondering if this is correct or "good enough". My thoughts are that the advance springs (if any) are a bit seized so that there is not a big difference when revving up the motor.
The other though was just like one replaces the distributor on the car and you got to slot it in exactly right to get an equal amount of movement either way on the distributor. Is it possible to remove the bean can and rotate it slightly anti clockwise to centralize it better and replace it without too much difficulty?
I hope this makes sense
View Public Profile
Find More Posts by bushyb


text:
2010 January Orlando, FL FUN US Coin Auction #1136
|Sold for:
|Sign-in or Join (free & quick)
|Claim Item:
|Sign-in or Join (free & quick)
|Auction Ended On:
|Jan 7, 2010
|Item Activity:
10 Internet/mail/phone bidders
4,854 page views
|Orlando, FL
Last Collectible Date of the Series
Among the Finest Certified
A large mintage of more than 1.1 million double eagles was accomplished at the Philadelphia Mint in 1932, but only a small portion of that mintage escaped the melting pot after the Gold Recall of 1933. In the catalog of the Norweb Collection (Stack's, 11/2006), lot 1487, the cataloger explained:
"It is likely that no double eagles of this date were ever released either into circulation or for export. So far as we have been able to determine, all known today trace their pedigree to examples provided to collectors for face value in 1932, a courtesy that had been extended for several years (and which also included other denominations), or pieces that Treasury employees saved from the unfortunate melt of 1937 by selling them to Philadelphia and New York City dealers for modest premiums."
Examples seen today are almost always in Uncirculated grades, sharply struck, with lustrous surfaces. Research that Dr. Charles Green conducted in the 1940s indicates only 110 double eagles were officially released by the Philadelphia Mint in 1932. Bowers estimates a total surviving population of 60-80 specimens in Mint State grades, with only one or two circulated examples surviving. David Akers ranks the 1932 as the eighth rarest date in the 54-coin series.
Numismatists appreciated the rarity of the 1932 from the start, and its status as the last date readily available to the public added special interest to any appearance. The first public auction offering was probably in the Needham, Herrick and Others Collections (Thomas Elder, 9/1937), lot 1394. The lot directly followed a 1931 double eagle, and Elder commented, "1932 $20. Same type. Brilliant Uncirculated. Of greatest rarity. None struck for circulation. Value $350." Elder's estimate is quite impressive for a coin that could be purchased at the Mint for face value only five years before. Perhaps he was aware of the market for 1933 double eagles, which were selling for much higher premiums in that era.
The 1932 double eagle was featured in lot 1680 of the Flanagan Collection (Stack's, 3/1944). The lot directly preceded the first offering of a 1933 double eagle at public auction, but that coin was seized by the Secret Service and later destroyed. The 1932 double eagle realized $240, on a $200 estimate, to J.F. Bell. Bell (whose real name was Jacob Shapiro), resold the coin in December of the same year in lot 892 of Stack's famous sale of his collection. The 1932 double eagle realized $300, a substantial $60 profit in those days on a coin he held less than seven months.
In recent times the 1932 appears at auction perhaps three or four times per year, on average. At the Premium Gem level, offerings are much less frequent. A search of auction records reveals 16 appearances of the date in MS66 grade since 1990. Some notable specimens include the Norweb coin in 1988, the Thaine Price specimen in 1998, the example in the Browning Collection in 2001, and the Phillip H. Morse coin in 2005.
Regarding the high quality of the 1932 double eagle, the authors of The Coinage of Augustus Saint-Gaudens as Illustrated by the Phillip H. Morse Collection concur that:
"As a rule, a high-grade 1932 is a great-looking coin with outstanding luster and color. According to Akers, it is superior in this regard to the other late-date issues, except possibly the 1930-S. The color is typically medium to rich yellow or greenish yellow-gold, but some examples exhibit light to medium orange and greenish-gold patina. Most 1932s are very frosty, but some have a satiny texture. Most specimens are sharply struck, though some of the satiny coins reveal softness on Liberty's figure. All in all, the eye appeal for this issue is well above average for the series."
That could well describe this example. The surfaces have a decided frosted texture and the striking definition is strong throughout. The reddish-gold patina shows just the slightest hint of lilac around the margin on the obverse. There are no mentionable abrasions on either side. This is a spectacular example of this famous rarity.
From The Ralph P. Muller Collection.(Registry values: N10218) (NGC ID# 26GR, PCGS# 9194)
View all of [The Ralph P. Muller Collection]
View large image(s) of this item
Service and Handling Description: Coins & Currency (view shipping information)
Sales Tax information | PCGS Guarantee of Grade and Authenticity | Terms and Conditions
Revised Edition by James L. Halperin, Mark R. Borckardt, Mark Van Winkle, Jon Amato, and Gregory J. Rohan, with special contributor David W. Akers
The Coinage of Augustus Saint-Gaudens is an issue-by-issue examination of these two artistically inspired series of gold coins.
Each date and mintmark is reviewed with up-to-date information, much of which has never been previously published. The book is based on
two extraordinary collections: The Phillip H. Morse collection and the Dr. and Mrs. Steven L. Duckor collection.
Order Now! Just $95
Previous Prices from Heritage Auctions
|Sign-in or Join (free & quick)
Price Guide
|Sign-in or Join (free & quick)
Population Guide
|Sign-in or Join (free & quick)


text:
The Leicester boss insists Gary Lineker, Danny Murphy and Jermaine Jenas shouldn't have made a "mountain out of a molehill"
Wayne Rooney made his England debut against Australia in 2003. Four other players got their first cap that night. It's fair to say none have done quite as well as Wazza
The 21-year-old midfielder is on loan at Championship side QPR but is being tipped for senior international honours
James Nursey looks ahead to Saturday's crunch clash - and fears a Jermaine Jenas winner
Steven Fletcher had given the hapless visitors an early lead
Drop-bound Hoops will also pay £12.5m for Anzhi defender - and spending won't end there as Redknapp targets Crouch and THREE Spurs players
The former England flier has had an injury nightmare in the Championship with Nottingham Forest and is back at White Hart Lane
Spurs' unwanted star will make a short-term return to his former club in the Championship after coming close to leaving in the summer
Jermaine's become a forgotten figure at White Hart Lane - time to wind back the clock and rejoin the club where it all began for him...
Former England midfielder almost joined Sunderland in the summer - while Spurs are also trying to buy Tom Huddlestone out of his contract
Andre Villas-Boas saw proposed loan deal with Sunderland collapse, but is determined to get some first-team football for Jermaine
Moussa Dembele, Willian and Hugo Lloris are all targets as Spurs plot a string of deals that could see Jermain Defoe move on
Dos Santos, Jenas, Bentley, Bassong, Gallas and Naughton are all up for sale as Tottenham's new manager reshapes Redknapp's squad
The Nottingham-born Spurs and England midfielder is fit again after the ruptured Achilles that wrecked his 2011-12 season
James Nursey on a season of disappointment at Villa Park
We're not sure about you lot, but all we've been hearing about over the last few days is the bloody football transfer season.
At least Harry Redknapp could see the funny sideafter Tottenham seriously jeopardised their chances of qualifying for the Champions League once more.
RAFAEL VAN DER VAART has told Chelsea and Manchester City: Money can't buy you points.
NIKO KRANJCAR'S dramatic late strike kept Tottenham's slender title hopes alive – but the cheers were just as loud for a goal scored 300 miles away.
HARRY REDKNAPP has been in football for toolong to expect many lavish shows of generosity from his club chairman.
TONY PULIS is eager to land Tottenham's Jermaine Jenas as part of an audacious double swoop.
HARRY REDKNAPP will find himself on a collision course with chairman Daniel Levy over transfer funds if Tottenham qualify for the Champions League.
FABIO CAPELLO'S regular check calls on Ledley King have convinced Harry Redknapp the defender WILL go to the World Cup.
Could England star Jermaine Jenas moonlight as a singer? Hundreds of fans at the sell-out Jagged Edge concert chanted for him to get on stage when only three of the four-piece band turned up to the Indigo 02 show.
Newcastle have sent Kazenga LuaLua to Brighton on loan after the city's infamous Bigg Market nightlife began to take its toll on the promising midfielder's form.
Tottenham fans could have to wait up to four weeks before getting their first glimpse of Eidur Gudjohnsen.
I have no idea how much England were paid to disappear in Qatar on Saturday, but my strong hunch is too much.
Jermaine Jenas has emerged as a key figure in Tottenham's attempt to bring England winger Ashley Young to White Hart Lane.


text:
Virgin become a woman
Grandma gets it in the Kitchen
Amateur grannies
Brunette gf shows herself in public
Brunettes public nudity
Pussy play in public bar
Amateur fingering public nudity
Milf getting a facial cum in public
Amateur cumshots public nudity
Mom gets talked in to flashng
Boobs Milf Webcam
Nice fledgling teenage with pointy boobies screws
Brunette Babe Teen
Wild Fucking In Public
Hardcore pornstars public nudity
Women having sex in public bathroom
Amateur blowjobs public nudity
In public beach
Amateur matures public nudity
Ebony chick masturbates with bottle in public with an audience present
Fingering masturbation public nudity
Blonde woman sex slave undressed in public then fucked in rough p
Public Outdoor Rough
German fat woman sucking and fucking in public...BMW
Amateur bbw public nudity
Blond teen exhib in public place
Public nudity teens upskirts
Hot brunette masturbates in public
Brunettes masturbation public nudity
Hot Female Student Naked In Public
Amateur public nudity
Sweetpinkblonde Flashing My Pink Pussy in Public
Blondes flashing public nudity
Amateurs Fuck In Public Toilet
Naked in public
Black and ebony public nudity voyeur
Lesbians in Public
Lesbians public nudity teens
College Teen Fucks In Public On Student Party
Amateur close-ups hardcore
Upskirt Girls have Fun in Public
Amateur public nudity upskirts
Sex in Public
Amateur anal hardcore
Rough German fuck in Public
Public nudity teens german
Brunette fuck in public Bathroom
Mature german woman gives strangers blowjobs in public
Mature German Milf
In Public
Public nudity
German couple playing with each other in public
Blondes german public nudity
Redhead babe fucked in public toilet
Pussy lick in public
Black and ebony flashing public nudity
Superfit Blonde Rides A Cumblasting Cock In Public
Amateur public nudity teens
My mom s naughty in public
S naughty in public
Fuck in Public park
Charley Chase Poses For Nude Photos in Public
Big boobs pornstars public nudity
Exhibitionism in public restaurant
Flashing hidden cams public nudity
In public
Asian flashing in public no pants
Asian flashing public nudity
Cafe wank in public
Amateur masturbation public nudity
A Sexy Babe Takes Off Her Clothes In Public
A hairy hippy woman with hairy pits in public
Amateur hairy matures
Lol joker masturbation in public
Fail Roleplay College
Undressing In Public
Perfect 10 Sucks and Swallows in Public (iSex)
Babysitters blowjobs pov
Retro Strip In Public Bar
Hairy public nudity vintage
Girls violated in public
Homemade Outdoors Public
Hairy In Public
Midgets public nudity softcore
Amateurs have sex in public grocery store
Amateur big boobs public nudity
Curvy Woman Trying On Clothes In The Dressing Room
Two Naked In Public
Mexican wife gives head in public bathroom
Amateur blowjobs handjobs
Almost naked in public
Black and ebony flashing
Hot mature lady get fisted in public fast food place
Homemade Hot Mature
Sexy Girl Trying On Clothes In Dressing Room
Amateur hidden cams vintage
Black woman nude in public
Black and ebony public nudity
Exposed in public
Going Crazy in Public
Bbw big boobs public nudity
Woman Shows Her Pussy In Public And At Home
Funny public nudity softcore
Sex in public park with people around
Sophie s orgasm in public
S orgasm in public
Big Bbw Takes Of Her Clothes In Public Show
Old And Horny Woman Showing Her Breast In Public
Woman japanese doctor
Nurse Nurses Patient
Black girl nude in public
Carins masturbation in public park
Babe Getting Rid Of Her Clothes In Public
Sexy outfit in public
Masturbating in public
Yana masturbates in public
Masturbation public nudity upskirts
Creamy handjob in public parc
Amateur handjobs public nudity
Cumming In Public
Amateur beach milfs
My Wife naked in public on Pier 5 Sf in day time
Amateur black and ebony public nudity
Hot Asian Babes Finger And Toy Pussy In Public
Sexy Slut Caught Changing Clothes In Public
Hot german slut fucked in public
Hot German Slut
Hot redhead having sex in public
Woman Masturbates with Dildo in Hotel
Hidden cams masturbation voyeur
Horny teen masturbates in public on train
Horny Teen Masturbates
Hot Busty Brunette Woman Flashes Her Tits In Public
Public flashing from Savaho
Sex with Yasmine in public for cash
Amateur blondes handjobs
Fucking hot blonde in public
Fucking Hot Blonde
Woman wearing red stockings porn
Asian cumshots japanese
Fucking in public
Tits out and grope in public
Bdsm flashing public nudity
A woman wearing a kimono
Asian brunettes japanese
Video Of A Mature Womans Legs And Ass In Public
Horny Woman Stripping And Masturbating In Public Place
Sext Grandma Gets Fucked In The Porta Potty
Mature Woman Exhibits Her Ass In Public And Gets Fucked
Exposed pussy play in public park
Outdoors Outside Blonde
Sex on the beach in public
Outdoors Public Beach
Public Masturbation In A Plane
Japan public
Asian public nudity tits
Outdoor sex in public
Hot Milf in Bikini at The Beach
Naked and masturbating in public park
Sclip Gfsland Com
Babe gets naked and pees in public park
Outdoors Public Brunettes
Cute busty teen wear dissolve swimsuit in swimming pool
Cute Busty Teen
Masturbating in public, girl is interested and likes
Amateur flashing public nudity
My wife naked in public
Outdoors Public Homemade
Sex in public
Amateur hardcore public nudity
Slut Wife in Stockings and Heels Shows Cunt in Public
Flashing milfs voyeur
Bound babe made to lick pussy in public comic book store
Public Disgrace Submission
Groping girl, and ripping off her clothes in car
Girlfriend Car Public
A girl fucks in public for some money
Homemade Blow Job
Chinese couple fucking in public park
Chinese Asian Public
Sweet avril in public places
Avril Public Blonde
Flashing In Public Crazy One
Fucking hot brunette in public on car
Outdoors Public Blow
German Wife Flashing in Public Cafe
Flashing in public some of the best clips
Funny dickflash in public
Flashing funny public nudity
German girl fucked by two guys in public restaurant
German Threesome Public
Bound brunette gets ass double fisted in public
Public Disgrace Bondage
Public facial cum walk
Cumshots pov public nudity
First Time Naked in Public
Amateur babes public nudity
Handjob in Public on a Horsdrawn Carriage
Handjobs public nudity tits
Lift skirt in public
Homemade Amatuer Real
Natural Big Boobs in Public see through Bikini
Big boobs flashing public nudity
Sex In Public India
Blowjobs hidden cams indian
Extreme lesbians in public
Lesbians public nudity showers
Showing off in public
Hot blonde public masturbation
Blondes masturbation public nudity
Peeping asian ladies. Wash and relax in public bath house
Asian japanese voyeur
Riley evans finds a spot to pee in public
Sclip Azianixposed Com
Bound babe face cummed in public
Public Disgrace Outdoor
Arcade Racing Girl Shows her Boobs in Public Arcade
Big boobs public nudity tits
Cute czech girls having fun in public places
Teen Public Masturbation
Amateur public nudity stockings
Slut in public
Lesbians matures public nudity
Show his huge dick in public
Group sex pov public nudity
Playing in public
Flashing matures upskirts
Swedish Couple Having Sex in Public by snahbrandy
Flashing public nudity swedish
Beautiful blondie gets humiliated and stuffed in public
Sclip Publicdisgrace Com
Cutie flashing in public
Couple having sex in public at the beach
A hairy nudist mature with small saggy tits nude in public
Hairy matures public nudity
Pantyhose housewife uses dildo in public
Pantyhose Public Outdoor
Bottomless japanese nurse sixtynine blowjob in public
Strange Bizarre Weird
Slutty babe with immense boobs sucks cocks in public club rest ro
Public Sex Big
Jerk in public
Flashing masturbation public nudity
Cfnm guy licks ass and cums in public at cfnm party
Cfnm Fetish Femdom
My slut wife sucking cocks of strangers in public parking
Amateur cuckold public nudity
Russian teen couple having sex in public places
Brunette Shows Pussy in Public
Brunettes flashing public nudity
Masturbation in McDonalds and sex in public
Brunette masturbates in public place
Lesbo Couples Doing Lesbian Sex In Swimming Pool
Sexy teen dildo pussy fucking
Amateur teens webcams
Asian babe finger her cunt
Amateur asian webcams
Dildo fucking her anal
Amateur anal webcams
Sex toy for fucking hot asian
Cute Andrea Gives A Nice Suck And Cummed In Mouth
Pretty hot babe with a nice sexy ass
Babes fingering sex toys
Asian hot finger fucking solo
Ebony pornstar in action black ebony cumshots ebony swallow interracial
Blow Jobs Ebony
Screwing through steel
Bdsm hardcore sex toys
Hot Bitch Fucks Her Man In The Tub And Swallows His Cum
Cute blonde in glasses with her dildos
Babes blondes sex toys
Hot Babe Gets Fucked In Stockings With Her Friend
Naughty Brunnete Masturbates In Front Of Camera
Supersexme live webcam showing tits and using dildo in pussy and ass
Dildo Webcam Hot
Romanian girl playing with dildos in bath
Homemade Teenager Adult
Russian Finger Fucks Herself In Front Of Her Cam
Dildo in der muschi
Bbw masturbation webcams
Horny Girl Goes For Nude Ride And Fucks In The Outdoor
Blonde girlfriend in the tub
Shower Tub Girlfriend
Videosexarchive.com is a global porn search engine, we index and provide our visitors the most convenient way to search the best porn videos ever posted on the Internet. Videosexarchive.com has a zero-tolerance policy against illegal porn. Videosexarchive.com does not host any videos on its servers. All porn pictures and porn videos are provided by third party tube sites, and we have no control over the content on these sites. Also, we take no responsibility for the content on any website which we link to.


text:
Taylor Swift Dines With Lena Dunham In Rhode Island
Taylor Swift, who recently bought a new home in Rhode Island, was spotted out at the state's Olympia Tea Room with Lena Dunham, writer and actress in the HBO hit series Girls.
According to Life & Style, the two were rolling with Ed Sheeran, who joined Swift on "Everything Has Changed," Hailee Steinfeld (True Grit), Jack Antonoff (fun.) and Jessica Szohr (Gossip Girls).
"I've always been really blown away by how she's so young - she's in her mid 20s - and she does all these things. She creates so much. When I found out she listens to my music, it absolutely floored me. It made my day, honestly," Swift has previously said of Dunham.
Dunham has returned the compliment, saying that there is "something sort of affectionate and non-judgmental about her music that I appreciate."
Copyright(c) 2013 RTTNews.com. All Rights Reserved


text:
Book your room at Hampton Inn & Suites Boston Crosstown Center
Get an overview of this hotelBoston hotel close to medical center
Free shuttle service
This hotel at Boston Crosstown Center is adjacent to the Boston Medical Center, one mile from downtown, less than two miles from the Longwood Medical Area, and four miles from the airport.
Indoor pool & free breakfast
Complimentary services include wireless Internet access throughout the hotel and daily Continental breakfast; the hotel features a self-service business center and 24-hour fitness facilities.
Free wireless Internet
The hotel's 175 guestrooms offer complimentary local calls, voice mail, wireless Internet access, weekday newspaper delivery, work desks, coffeemakers, pay movies, and video-game consoles.Information missing or incorrect? Tell us!
Hotel Amenities
Hotel Amenities
Hampton Inn & Suites Boston Crosstown Center is adjacent to the Boston Medical Center, and 1.5 miles from the Longwood Medical Area. Additional nearby attractions include the Prudential Center, Boston Common, and Quincy Market/Faneuil Hall.
The Hampton Inn & Suites Boston Crosstown Center offers guests a daily, complimentary Continental breakfast in the lobby and complimentary wireless Internet access throughout the property. The hotel has a lobby snack station, a self-service business center with complimentary high-speed Internet access on two workstations, a 30-by-16-foot indoor swimming pool, and a 24-hour fitness room.
Current laws prohibit smoking in any indoor areas, including guestrooms, and on guestroom balconies/patios. Smoking is permitted only in designated outdoor areas.
- Indoor pool
- Free newspapers in lobby
- Use of nearby fitness center (discount)
- Business center
- Multilingual staff
- 24-hour front desk
- Total number of rooms - 175
- Safe-deposit box at front desk
- ATM/banking
- Gift shops or newsstand
- Dry cleaning/laundry service
- Television in lobby
- Coffee/tea in lobby
- Free breakfast
- Year Built 1935
- Number of floors - 9
- Elevator/lift
- Free airport transportation
- Free WiFi
- Express check-in
- Area shuttle (surcharge)
- One meeting room
- Health club
- Luggage storage
- Laundry facilities
- Shopping on site
- Self parking (surcharge)
- Smoke-free property
Family Friendly Amenities
- Family Hotel
- Indoor pool
- Free Wi-Fi
- Rollaway/extra beds available
- Laundry facilities
- Refrigerator (on request)
Available in some public areas: Free WiFi
Self parking (surcharge)
Room Amenities
- Premium TV channels
- Video-game console
- Pay movies
- Climate control
- Free weekday newspaper
- Blackout drapes/curtains
- Air conditioning
- Free local calls
- Coffee/tea maker
- Refrigerator (on request)
- Shower/tub combination
- Free toiletries
- Hair dryer
- Iron/ironing board
- Daily housekeeping
- Cable TV service
- Desk
- Rollaway/extra beds available
- Cribs/infant beds available
- Free newspaper
- In-room safe
Where to Eat
A complimentary continental breakfast is provided each morning. Hot dishes might include sausage patties or eggs. On weekdays, guests can request a breakfast bag to go, with bottled water, fruit, a muffin, and a cereal bar.
Rudi's Resto Cafe - Open for breakfast, lunch and dinner. Featuring a variety of healthy and comfort food options, from dishes with aromatic spices and seafood to traditional hamburgers.
Several dining options are available in the surrounding area.
Nearby restaurants:
Rustic Kitchen
Capital Grill
Cheesecake Factory
Apple Bee's
Olive Garden
Equator Restaurant
Atlantic Fish Company
Legal Seafood
Nearby Things to Do
On the Hampton's top (ninth) floor is a 3-foot-deep, 30 by 16-foot indoor pool and an adjacent 24-hour fitness room with four cardio machines (two treadmills, a stationary bike, and a stair machine).
Hotel guests receive discounted access to a fitness center one block from the hotel.
The recreational activities listed below are available either on site or near the hotel; fees may apply.
Hotel Policies
Check-in time starts at 3 PM
Check-out time is 11 AM
Payment types
Children and extra beds
- Children are welcome.
- Rollaway/extra beds are available.
- Cribs (infant beds) are available.
You need to know
Extra-person charges may apply and vary depending on hotel policy.
Government-issued photo identification and a credit card or cash deposit are required at check-in for incidental charges.
Special requests are subject to availability upon check-in and may incur additional charges. Special requests cannot be guaranteed.
- Self parking fee: USD 25 per night


text:
Nut Cracker Sweets
|1⁄3 Cup (5.33 tbs)
|Packed brown sugar
|1⁄3 Cup (5.33 tbs)
|Graham crackers
|Chopped nut topping
|2⁄3 Cup (10.67 tbs)
1. Turn the oven to 350°. Tear off a 15-inch piece of foil. Line the baking pan with the foil. Save until Step 3.
2. Put the margarine or butter in the saucepan. Put the pan on the burner. Turn the burner to low. Heat till the margarine melts. Turn off the burner. Remove the saucepan from the burner. With the wooden spoon, stir in brown sugar. Mix well. Save until Step 4.
3. Arrange graham crackers, side by side, in the foil-lined baking pan.
4. Stir the brown sugar mixture. Spoon the brown sugar mixture over the graham crackers. Sprinkle the crackers with the nut topping.
5. Put the pan in the oven. Bake for 7 to 9 minutes or till the topping is bubbly. Use hot pads to remove the pan from the oven. Turn off the oven. Put the pan on the cooling rack. When crackers are cool, break each cracker into four pieces along the lines in the crackers. Store crackers in a tightly covered container.


text:
New Mexico State Aggies at UTSA Roadrunners Basketball
Sat, Feb 2, 2013 6:00 pm
UTSA Convocation Center, San Antonio, TX
Sorry, this event has already taken place. Please see similar events below.
|Tweet | State Guides | Gift Certificates | Policies | Blog | About Us | TicketMasters sold out |


text:
Winnipeg Youth Soccer Tournament Draws Record Number of Teams
Winnipeg, May 29, 2013 – The Winnipeg Youth Soccer Association (WYSA) is proud to announce the 22nd Annual Children's Hospital Tournament will kick off today with a record number of teams.
This year, the tournament will feature 199 teams, up seven from last year's record. Teams are coming in from across the region, including from Kenora, Ontario, Yorkton, Saskatchewan and from Minnedosa, Portage la Prairie, Brandon and Carman, Manitoba.
"The tournament started with only four teams back in 1991. Now it's one of the largest tournaments in western Canada," said Carlo Bruneau, executive director of the WYSA. "We want to thank the thousands of volunteers in the soccer community who make this event so successful every year."
Over the years, the tournament has raised more than $275,000 for the Childrens' Hospital Foundation. The tournament will feature games at various fields around the city, but home base will be John Blumberg soccer complex in Headingley.
The tournament will run from May 29 to June 2. Despite a challenging weather forecast that is predicting rain, WYSA plans to complete as many games as possible and have finals played as scheduled on Sunday.
"All players and teams should expect to play at their scheduled times," said Bruneau. "Marshals will decide whether games are playable or not at the field."
WYSA is the largest youth soccer league administrator in Manitoba. In addition to managing all premier, premier-developmental and developmental leagues (from ages 9 through 18), WYSA oversees recreational soccer leagues for community centres from ages 13 to 18. It also supports district soccer associations who administer the recreational leagues for ages 9 through 12. In recent years, WYSA has managed high school indoor and outdoor soccer leagues and has played a key role in bringing soccer programming to disadvantaged youth in Winnipeg's core areas.
Organizers plan to play as many games as possible despite poor weather forecast
Children's Hospital Tournament Schedule
Please be advised that due to unexpected changes in registration for the Children's Hospital Tournament, a number of games have been rescheduled since the schedule was first released.
All teams are advised to review the game schedule before attending their first game of the tournament as game times and fields may have changed since you last reviewed it.
Please follow the CHT link on the right side of this page for more information on the tournament, including pitch layouts, markings and tournament rules, located on the CHT Homepage.
We thank you for your patience and support. Good luck this weekend!
Online Scoring for Team Officials
Coaches and Managers,
There is an issue with some team officials being unable to use the self-score option.
We are investigating the problem with IT SportsNet and we envisage this will be resolved the week of 20th MAY. Please continue to submit your game sheets within the specified timeframe.
Thank you for your patience.
2013 Outdoor Season Schedule
All 2013 Outdoor Season Schedules have now been posted under the Standings & Schedule button on the right side of this page!
For all scheduling concerns, please contact email@example.com.
Goodluck and have fun this season!
2012 U18 FC Northwest named Calm Air Junior Team of the Year
The Under 18 FC Northwest boys who won last year's WYSA League, MSA Provincial Championship Competition, and CSA U18 National Championships was named Junior Team of the Year at Sport Manitoba's annual Night of Champions. Click here for the full list of recipients.
Soccer Community loses a Beloved Coach and Friend
The Winnipeg Youth Soccer Association expresses its deepest condolences to the family and many friends of Riccardo De Thomasis. Riccardo recently passed away after a long fight with cancer. He was 34.
Riccardo was an inspirational and beloved soccer coach who had a tremendously positive impact on thousands of Winnipeg soccer families. He will be missed.
2013 Outdoor Season Coaches Notes
Click here to open the 2013 Outdoor Season Coaches notes distributed at the Coaches meeting April 23, 2013.
WYSA kicks off season tonight on artificial turf fields
Winnipeg, April 26, 2013 – The Winnipeg Youth Soccer Association will kick off its outdoor season tonight on artificial turf at the Waverley Soccer Complex. The unseasonably cold and snowy spring will delay the use of natural grass fields for at least two more weeks.
"This really highlights the need for more artificial turf fields in our city. Bad weather is common here, so we should prepare for it," said Tom Thompson, President of the Winnipeg Youth Soccer Association. "With artificial turf fields, we can start the season earlier and end it later. We can also play four times as many games on them without risk of damage."
WYSA is advising its leagues that the recreational leagues for ages U13 to U18 will begin play as scheduled using the artificial turf fields at the Waverley Soccer Complex. Weather permitting, it expects to begin allowing play on natural grass fields in two to three weeks, including for U9 to U12 recreational and developmental teams and for U13 to U18 premier and premier-developmental teams.
"We need a lot of sun and wind to melt the snow and dry the fields," said Carlo Bruneau, WYSA Executive Director. "We'll start using the fields as soon as it is safe and practical to do so. We will reschedule cancelled games as quickly as we can, but the weather this year might mean we have to play a slightly shorter season."
WYSA reminds soccer teams and all Winnipeggers to be gentle on sports fields this spring until they have dried up. Wet and muddy fields can be easily and badly damaged by sports teams.
The Winnipeg Youth Soccer Association administers youth soccer leagues for ages U9 to U18 in the City of Winnipeg. For more information regarding schedules and game cancellations, please visit www.WinnipegYouthSoccer.com.
Frequently Asked Questions
What is a Guest Player and how does it work?
A guest player is a player who plays on another WYSA registered team that they are not registered with, but are registered with another team for that season. Please note, there are restrictions to guest players in order to uphold the competitive integrity of the league.
Currently, the criteria to be eligible to act as a guest player is covered in our Rules and Regulations under 4.1 Guest Players.
At this time, there are no match cancellations. The match official will determined whether the field or conditions are unplayable at the field.
League wide cancellations will be posted here. In the event of an individual game cancellation, email notification will be sent directly to the teams.


text:
A computer-implemented method routes service requests to services in a service framework provided by a plurality of hosts. The method comprises receiving a service request for a service in the service framework and discovering a plurality of candidate hosts that host the service. The plurality of candidate hosts are a subset of the plurality of hosts. The method further comprises selecting a candidate host from the plurality of candidate hosts based on measured latencies for the plurality of candidate hosts and routing the service request to the selected candidate host.
1. A computer-implemented method of routing service requests to services in a service framework provided by a plurality of hosts, comprising:
receiving a service request for a service in the service framework;
discovering a plurality of candidate hosts that host the service, the plurality of candidate hosts being a subset of the plurality of hosts;
acquiring information about measured latencies for each of the plurality of candidate hosts;
assigning weightings for the plurality of candidate hosts based on the measured latencies for each of the plurality of candidate hosts;
pseudo-randomly selecting a candidate host from the plurality of candidate hosts based on the measured latencies for the plurality of candidate hosts in accordance with the weightings for the plurality of candidate hosts; and
routing the service request to the selected candidate host.
2. A method as defined in
3. A method as defined in
4. A method as defined in
5. A method as defined in
6. A method as defined in
7. A method as defined in
8. A method as defined in
9. A method as defined in
10. A method as defined in
11. A method as defined in
12. A computer-implemented method of routing service requests to services in a service framework comprising a plurality of service hosts, the method comprising:
storing a model of the service framework organized in a hierarchy comprising:
a first level including a plurality of leaf nodes, each of the leaf nodes corresponding to one of the plurality of service hosts, and
a second level including a first plurality of zones, wherein each of the first plurality of zones comprise a subset of the plurality of leaf nodes, and wherein each of the first plurality of zones includes a proxy host of the plurality of leaf nodes; and
receiving service requests and, for each service request:
discovering a plurality of candidate hosts from the leaf nodes and proxy hosts that host the service;
pseudo-randomly selecting one of the plurality of candidate hosts based on measured latencies for the plurality of candidate hosts; and
routing the service request to the selected candidate host.
13. A method as defined in
14. A method as defined in
15. A method as defined in
16. A method as defined in
17. A method as defined in
acquiring information about the measured latencies for each of the plurality of candidate hosts;
assigning weightings for the plurality of candidate hosts based on the measured latencies for each of the plurality of candidate hosts;
pseudo-randomly selecting the selected candidate host in accordance with the weightings for the plurality of candidate hosts.
18. A system comprising:
a plurality of host computers in a service framework for responding to service requests, wherein the plurality of hosts computers in the service framework are organized in a hierarchy comprising:
a first level including a plurality of leaf nodes, each of the leaf nodes corresponding to one of the plurality of hosts; and
a second level including a first plurality of zones which each comprise a subset of the plurality of leaf nodes;
a plurality of services executing on the plurality of host computers;
routing logic executing on the plurality of host computers, wherein the routing logic is configured to:
determine whether a service request can be processed locally on the host computer upon which the routing logic is executing;
process the service request locally on the host computer upon which the routing logic is executing if the service request can be processed locally; and
dispatch service requests based on measured latencies between different levels in the hierarchy tree structure.
19. A system as defined in
20. A system as defined in
21. A system as defined in
22. A system as defined in
23. A system as defined in
24. A system as defined in
25. A tangible computer-accessible medium bearing computer-executable instructions which, when executed on a host computer in a computing system implementing a service framework comprising a plurality of host computers organized in a hierarchy for responding to service requests, direct the computing system to:
receive a service request for a service;
discover a set of candidate host computers that host the service, the set of candidate host computers being a subset of the plurality of host computers;
pseudo-randomly select a candidate host computer from the set of candidate host computers, the selection of the candidate host computer comprising a selection of a dispatch level within the hierarchy; and
route the service request to the selected candidate host computer.
26. A computer accessible medium as defined in
27. A computer accessible medium as defined in
acquire information about the measured latencies for each of the plurality of candidate host computers;
assign weightings for the plurality of candidate host computers based on the measured latencies for each of the plurality of candidate host computers; and
pseudo-randomly select the candidate host computer in accordance with the weightings for the plurality of candidate host computers.
28. A computer accessible medium as defined in
29. A computer accessible medium as defined in
30. A computer accessible medium as defined in
31. A computer accessible medium as defined in
32. A computer accessible medium as defined in
33. A computer accessible medium as defined in
34. A computer accessible medium as defined in
35. A computer accessible medium as defined in
36. A computer accessible medium as defined in
37. A computer accessible medium as defined in
Enterprise computing environments are often implemented in decentralized environments, both in terms of software structure and administrative organization, which use large numbers of low-cost server resources to meet processing requirements. For example, thousands of servers or more may operate across multiple data centers. The servers may host services (e.g., business logic applications) that are accessed by processes. To access a given service, a process may transmit a service request to the service and the service may generate a response which includes the requested information. To generate the response, the service may in turn transmit other service requests to other services and underlying data stores. There may be thousands of such services or more and each service may have multiple clients (e.g., other services) spread across the computing infrastructure. Often, services are replicated across multiple hosts in different data centers to improve their scaleability and availability. For example, a given service may be hosted in several different data centers in different geographic locations in order to avoid a single point of failure.
To manage such systems, it is desirable for a computing infrastructure to enable clients to discover services in a seamless way, route service requests to hosts in a reliable manner, and/or permit services to add capacity easily and transparently. Providing request routing systems that meet such goals has proven challenging, particularly in systems that may experience host failures and network partitions. However, meeting such goals may permit the business objectives of the computing infrastructure to be achieved more effectively and efficiently.
Accordingly, an ongoing need exists for improved systems and methods that may be used to route service requests. It should be noted that, while certain advantages and features are described, the teachings herein may be used to implement systems and methods that do not have any of the advantages and features, but rather which have other advantages and features.
According to an exemplary embodiment, a computer-implemented method routes service requests to services in a service framework provided by a plurality of hosts. The method comprises receiving a service request for a service in the service framework and discovering a plurality of candidate hosts that host the service. The plurality of candidate hosts are a subset of the plurality of hosts. The method further comprises selecting a candidate host from the plurality of candidate hosts based on measured latencies for the plurality of candidate hosts and routing the service request to the selected candidate host.
According to an exemplary embodiment, a computer-implemented method routes service requests to services in a service framework. The method comprises storing a model of at least a portion of a hierarchically-organized computing environment that implements the service framework. The computing environment comprises a plurality of hosts. The model is organized in a hierarchy comprising (i) a first level including a plurality of leaf nodes, each of the leaf nodes corresponding to one of the plurality of hosts, and (ii) a second level including a first plurality of zones which each comprise a subset of the plurality of leaf nodes. The method further comprises dispatching service requests to different ones of the levels of the hierarchy based on measured latencies of the plurality of hosts.
It should be understood that the detailed description and specific examples, while indicating preferred embodiments of the present invention, are given by way of illustration and not limitation. Many modifications and changes within the scope of the present invention may be made without departing from the spirit thereof, and the invention includes all such modifications.
I. Exemplary Architecture
A. Physical Topology
Referring now to
Each service 118 may be replicated across multiple hosts 15 to improve scaleability and availability. Further, each service 118 may be hosted in multiple data centers to avoid single point of failures (e.g., due to failure of a router 20). When a client needs to make a service request, it may use a virtual IP address or other type of identifier for the service 118, and the request may subsequently be routed to the service 118 as described in greater detail below.
By way of example, the system 10 may be used to host a website and/or to provide information to third parties that the third parties may use in hosting a website. For example, the system 10 may be used to host an interactive commerce website, a search engine website, content website, and/or other type of website. Various ones of the hosts 15 may be executing processes that are used to construct web pages and to publish the web pages to visitors of the website. Each web page may in turn be composed of results from multiple services 118. Examples of services may include a product detail service, an ordering service, a shopping cart service, and so on.
As shown in
With reference to
Given the physical topology as described above, the system 10 may have the following latency properties. First, the latency between hosts 15 in the same cluster may be lower than that of hosts 15 in different clusters. For example, within the same cluster 22 in level 1, the latency between hosts 15 may be very low as compared to the latency between hosts 15 in different clusters 22. Second, the latency may increase at higher levels in the hierarchy. For example, latency between hosts 15 in different clusters 26 at level 2 is less than that of hosts 15 in different clusters 32 at level 3. As will be appreciated, the latency between two hosts 15 may be from microseconds or less to hundreds of milliseconds or more depending on whether the hosts 15 are in the same cluster (and at what level), whether they are in the same data center, the type of network connection(s) which connect the two hosts 15 (including the bandwidths and latencies of the network connection(s)), and so on.
B. Logical Model of Physical Topology
Referring now to
In an exemplary embodiment, the logical hierarchy in
The nodes 60-64 each serve as representatives for a respective one of the zones 70-74. Thus, for example, host S1 is the representative node 61 for the zone Root/A/A/A at level 1, the representative node 62 for the zone Root/A/A at level 2, the representative node 63 for the zone Root/A at level 3, and the representative node 64 for the root zone. The representative for each leaf zone is the corresponding host 15 itself. (Although not specifically shown, it will be appreciated that leaf zones 70 may also be designated in accordance with the above path-naming convention, e.g., Root/A/A/A/A corresponding to host S1 at level 0). As will be described in greater detail below, the representative nodes 61-64 sometimes serve as intermediate proxies for routing service requests between the zones 70-74. In this situation, the hosts 15 serving as the representative node are sometimes referred to herein as "proxy hosts." It may also be noted that the hosts 15 serving as representatives (which gossip information) need not necessarily the same as the hosts 15 serving as proxy servers (which route requests), because the two sets of hosts can be aggregated using different aggregation functions.
It may be noted that there is only one physical host (e.g., host S1), but it is represented at multiple levels in the tree structure. In practice, this may be implemented by having separate logical processes executing on the host S1 for each separate zone 70-74 for which it is a representative node 60-64 (e.g., five separate logical processes for the arrangement shown in
In the illustrated embodiment, there is one node 60-64 that serves as representative for each zone 70-74. More generally, multiple hosts 15 may be designated as representative nodes for a given zone. For example, it may be desirable to designate two representative nodes, e.g., a primary representative and a secondary representative, such that the secondary representative may serve as a backup in the event of a failure of the primary representative. The representative set of nodes for a zone may comprise a subset of the nodes from lower-level child zones. To provide for robustness against network partitions and correlated failures, when designating representatives for zones, it may be desirable to choose hosts from different child zones, rather than too many from any single child zone. This approach may be used for both nodes 60-64 and intermediate proxy hosts 15.
The groupings of nodes and zones may be determined by the groupings of hosts and routers in
C. Interconnection and Communication of Hosts through Request Routers and Communicators
Referring now to
Referring first to
The request routers 112 are each responsible for handling client requests, finding a set of candidate hosts that execute a requested service 118, making a routing decision regarding the host 15 to which to dispatch a client request from among the set of candidates, and collecting client responses and dispatching them back to clients. Each request router 112 uses an associated routing policy algorithm 120 (described below) to route service requests from clients to one of the hosts 15 that executes the requested service 118. In an exemplary embodiment, a separate request router 112 may be executing at each host 15 and for each different service 118. Thus, the request routers 112 are labeled "Request Router 1" to "Request Router N," where N is assumed to be the total number of different services 118 operating in system 10. The request router 112 labeled "Request Router n" is assumed to be the request router associated with the nth service, corresponding to the service 118 hosted on the particular host 15 illustrated in
Referring again to
In an exemplary embodiment, multiple communicators 114, 116 are used. For example, a first (global) instance of the gossip protocol may be used by global communicator 114 to communicate information that is global and that is not limited in relevance to any particular service 118, and additional (service) instances of the gossip protocol may be used by the service communicators 116 to communicate service-specific information that is limited in relevance to a respective service 118. For example, a respective service communicator 116 may be used for each separate service 118. The global communicator 114 and the service communicators 116 may be agents of the different instances of the above-mentioned hierarchical gossip protocol executing on a given host 15. The use of separate communicators 114, 116 allows more targeted communication to occur, i.e., such that a particular host 15 is not burdened with the communication overhead of communicating service-specific information that is not directly relevant to the operation of the particular host 15. As will be appreciated, a single communicator may also be used which communicates both global and service-specific information.
The global communicator 114 may be configured to gossip about the entire set of services 118 and the hosts 15 that host them. The global communicator 114 aggregates information regarding the number of services 118 present in the system 10, the number of hosts 15 executing a given service 118, the contact information (e.g., IP address and port) for a small subset of hosts 15 of each service 118, the number of clients accessing the service 118, and so on. The global communicator 114 provides the dispatcher 154 (
Likewise, the service communicators 116 may each be respectively associated with one of the services 118 in system 10. The service communicators 116 may also aggregate the contact information for a set of hosts 15 which act as intermediate proxies for routing requests. The proxies need not be the same as the nodes 60-64 in
The communicators 114, 116 may be used to communicate global information and service-specific information between the hosts 15, such that each host 15 is provided with information concerning at least some of the zones 70-74 in the tree structure of
Each of the nodes 60-64 may maintain their own status information and communicate the status information (i.e., using the communicators 114, 116 of the respective host 15) to higher level nodes for aggregation. The status information may be aggregated hierarchically, such that the zones 61-64 (i.e., the non-leaf zones) contain data aggregated from their respective child zones. Aggregated data may be used to give a summary of the system state to every participating node 60-64. The use of aggregated data decreases the amount of data that each node 60-64 stores and communicates with other nodes 60-64.
Referring now to
The states of different hosts 15 may be kept eventually consistent using a series of gossip protocol instances, for example, one for each level in the tree structure. The gossip protocol may use point-to-point messages and take into account network boundaries, e.g., switches and routers. The gossip protocol may minimize communication across boundaries by gossiping less frequently to far zones. Aggregating information and minimizing communication across boundaries helps keep bandwidth consumption low. In an exemplary embodiment, the routing system 55 also maintains an eventually consistent membership protocol using a gossip failure detection arrangement, as known in the art. An example of such an arrangement is disclosed, for example, in R. van Renesse, Y. Minsky, and M. Hayden, "A gossip-style failure detection service," Technical Report TR98-1687, 28, 1998.
In an exemplary embodiment, multicasting may be used for initial discovery, e.g., to permit hosts 15 to discover each other. The network infrastructure for the system 10 may support multicasting to a group that corresponds to each zone in the network topology, i.e., one group for a level 1 cluster, one group for a data center, and so on. Hosts 15 (nodes 60-64) may periodically multicast on a scoped multicast address at every level in the tree structure. In an exemplary embodiment, in order to reduce multicast traffic, each host 15 multicasts at a particular level only once per period with a probability inversely proportional to the number of nodes at that level. Hence, on the average, only one host multicasts per discovery period at each level.
In an exemplary embodiment, service advertisement may be achieved through automated registration. For example, at startup, each service 118 may register with its local request router 112 (i.e., the request router 112 on the host 15 upon which the service 118 is executing). The request router 112 may then use the global communicator 114 to locate and connect to the gossip protocol instance for the service 118 (or create a new one, if necessary). Clients may then be permitted to find services 118 and hosts 15 transparently using the service name (e.g., virtual IP address). In the event of a failure of the service 118, its registration may be removed from the information that is obtained through aggregation. Additionally, in the event of a failure of the host 15, the registration of the service 118 is automatically removed. This is because the host 15 is responsible for writing its own local state and, without the host 15 to write its local state, the information is not included in the information that is aggregated on other hosts 15. Thus, there is no need for deregistration in case of failure of a service 118 or host 115. This arrangement avoids the need to manually configure clients with service-specific configuration information, such as hard coded IP addresses of services 118. This arrangement also avoids the need for explicit registration of services 118 with a central registration entity, which in turn promotes decentralized system administration. Furthermore, since the state for each node 60-64 is writable only by the node itself, a misconfiguration of one node will not affect other nodes.
II. Service Discovery and Host Selection
The routing system 55 divides the problem of finding the best host 15 (that executes the requested service 118) to which to route a request into two subproblems: (i) service discovery (i.e., discovering the candidate set of hosts that host a given service), and (ii) best host selection (i.e., selection of the best host among them to serve the client request). An exemplary service discovery and request routing process is described in Section II(A) below in connection with
A. Exemplary Service Discovery and Request Routing Process
In an exemplary embodiment, service discovery and host selection are performed in a decentralized fashion using the global communicators 114 and service communicators 116 of the various hosts 15. Using this arrangement, a client host 135 finds the set of hosts 137 that together execute a given requested service 118. Subsequently, the client host 135 executes its own request router 112 to select the best host 137 to which to dispatch its request. A service host 137 that receives the client request may process the request locally or may forward the request to another service host 137 (thereby acting as an intermediate proxy host 139, as in
Referring now to
At step 174, once the request router 112 of the client host 135 receives the list of candidate hosts 137 from the service communicator 116, the request router 112 of the client host 135 selects the best host 137 to which to dispatch the given request and dispatches the service request to the selected host 137. As indicated above, in some embodiments, the zones 70-74 may have multiple designated representative nodes, e.g., a primary representative and a secondary representative. In such circumstances, the logical point of dispatch may be the respective zone 70-74 rather than any individual host 137.
At step 176, the service request is received by the request router of the selected host 137. Once the service request is received, the request router 112 of the selected host 137 has two options: (1) it can handle the service request locally, or (2) it can forward the service request to another node at a lower level. Even though it is desirable for hosts 15 to handle all requests locally, this can lead to overloading of the hosts. Hence, each request router 112 may be configured to perform a proper balancing between serving requests locally and forwarding the service requests to other hosts 137. Additionally, when the service request is forwarded to another host 137, if the first server 137 is more heavily loaded than the second server 137, then the end-to-end latency of the response to the service request may be reduced. This balancing may be performed using the routing algorithm 120, described in greater detail below.
In the example of
At step 178, the service request is routed to the service host S3, where it is ultimately serviced. The response to the service request is then returned to the client host 135 at step 180. When the response is finally returned, the response may be sent through a path which is different from the routing path through which the service request came. For example, the request router 112 of the service host 137 may send the response directly to the request router 112 of the client host 135 (e.g., via a TCP connection). On the return path, it is not necessary to engage in best host selection since the destination host for the response (i.e., client host 135) is known. This avoids incurring additional routing overhead and reduces the end-to-end latency of the request.
In an exemplary embodiment, after the process depicted in
B. Routing Policy
1. Latency-Aware Dispatch
The routing algorithm 120 is responsible for selecting the best host 137 to service a service request from a candidate set of service hosts 137. In an exemplary embodiment, the routing algorithm 120 selects the best host 137 using an approach that reduces average end-to-end service latency for client service requests.
Particularly, in an exemplary embodiment, the routing algorithm 120 uses a randomized (i.e., pseudo-randomized), latency-aware dispatch policy in which zones are weighted based on their expected end-to-end latency. For example, if
From Eq. (1), it follows that the probability of dispatch to any particular zone Zi within a candidate set of zones is inversely proportional to the expected end-to-end latency when sending the service request to the particular zone Zi. For example, if there are two candidate zones Z1 and Z2, and if the two candidate zones Z1 and Z2 have relative latencies of 5 and 10, then the randomized strategy may dispatch a service request to zones Z1 and Z2 with a probability of 0.67 and 0.33, respectively.
The expected end-to-end latency values lati for a request from a client host Cj when served by zone Zi at level l are computed based on Eq. (2) as follows:
It may be noted that the expected service latency SLi(l) for a zone is dependent on the level of the zone. The reasons for this is as follows: If the zone is at a higher level, then its service latency is the weighted average of the time the request will take to execute when forwarded to its children, including the Network Latency. For example, the service latency SL1(0) of a zone at level 0 is just its own measured service latency. On the other hand, the service latency SL1(1) of a zone at level 1 is the weighted average of SL1(0), (NL1,2+RL2+SL2(0)), and (NL1,3+RL3+SL3(0)), where NLi,j is the Network Latency from zone Zi to zone Zj as measured by zone Zi. It may be noted that, in the example given in
By performing routing based on measured latency, as in Eq. (2), the routing algorithm 120 is configured to be dynamic and adaptive (i.e., it adapts to changes in the load of individual hosts 15). For example, if the service hosts 137 within a zone become heavily loaded, the service latency SLi for the zone increases, decreasing the probability that subsequent service requests will be routed to the zone (i.e., until it becomes less heavily loaded). Likewise, the routing algorithm 120 is able to adapt to changes in client request rate and the addition/removal of new service hosts 137 executing a particular service 118. The routing algorithm 120 is also configuration independent, since it relies on end-to-end latency, which may be compared in straightforward manner between zones, and does not rely on any manually configured parameters (e.g., hosts' relative processing capacity and memory capacity) to make routing decisions. Different relative processing capacities and memory capacities are reflected in measured service latencies, causing zones with less powerful hosts 135 to receive fewer service requests when their service latencies rise above the service latencies of other service hosts 137. By also taking into account the network latency NLij, the routing algorithm 120 is also able to take into account different parts of the networking infrastructure of system 10 which may have different bandwidth and latency characteristics. This avoids high latencies if the hosts 15 are spread across different data centers, especially in a WAN environment. Thus, heterogeneity in host resources and networking capabilities is taken into account.
By focusing on end-to-end latency rather than evenness of workload sharing, response time for client hosts 135 may also be improved. A given host 137 may be selected based on minimization of end-to-end latency, even though selection of the host 137 results in uneven load distribution among hosts. For example, if there are two candidate hosts 137, one of which is lightly loaded but in a remote data center, the closest host 137 may be selected if doing so is likely to result in a lower overall end-to-end latency. The closest host 137 may be selected even though it may already be more heavily loaded than the service host 137 in the remote data center.
Additionally, as previously indicated in connection with Eq. (1), the dispatch strategy used by the routing algorithm 120 is a randomized strategy. A randomized dispatch strategy avoids a "herd effect" that may be encountered when dispatching requests to a host that is perceived to be the least loaded, particularly in situations where the load/latency information the clients are operating on is stale. In such situations, the host that appears to be under-utilized may become quickly overloaded, and then the "herd" stampedes another host, and so on. A randomized dispatch strategy avoids the dispatching of all service requests to any one (least-loaded) host but, rather, dispatches service requests to multiple hosts including more heavily-loaded hosts (albeit with a lower probability than the less heavily loaded hosts). In the exemplary embodiment described above, the routing algorithm 120 uses a latency-based randomized dispatch strategy in which the weighting coefficients for the randomized dispatch are determined based on measured latencies. In other exemplary embodiments, the weighting coefficients for the randomized dispatch may be determined based on other parameters, such as the relative capacities of the hosts 137. For example, if zones Z1, Z2, . . . , Zn is the list of zones known by a request router 112, and c1, c2, . . . , cn are their respective advertised capacity, then each request router 112 may compute a set P=p1, p2, . . . , pn, which will be the probabilities of routing to each of these zones, such that pi=ci/Σj=1 n cj. The capacity, for example, may be the number of processes executing the relevant service 118, properly calibrated to take into account the capabilities (e.g., CPU, memory, IO bandwidth, and so on) of hosts within the zone.
Additionally, in the exemplary embodiment, both the service discovery and routing decisions occur at individual hosts 15. Service discovery and routing decisions are therefore decentralized, permitting the routing system 55 to avoid a single point of failure, both in terms of hosts 15 and network segments. Likewise, as previously described, service registration may also be performed in a decentralized manner.
Referring now to
At step 202, latency information is acquired from the service hosts 137. The service latency may be first learned through aggregation functions as discussed above in connection with
The meta-data in such notifications, as well as that in the reply message itself, may be used by request routers 112 to update local models of remote zones 70-74 and the respective nodes 60-64. The meta-data may be used to provide client hosts 135 and intermediate proxies with relatively up-to-date information for each host regarding its capacity, average service latency, expected load, and so on, thereby promoting efficient routing of requests. The information received by the client host 135 in this manner may be more current than information obtained through aggregation using the service communicator 116. Accordingly, in an exemplary embodiment, request routers 112 may be configured to give the information higher confidence and to prefer it. Moreover, the meta-data may contain information regarding hosts 137 which the request router 112 did not know through the service communicator 116 (e.g., host S3 for client host 135). In that case, the request router 112 may add these hosts 137 in its routing table to use later for direct dispatch, as described below in connection with
With regard to the network latency, the network latency to a service host 137 from the client host 135 may be measured (e.g., using the round trip time (RTT) value obtained from TCP SOCKINFO system calls). Although this may not reflect the bandwidth of the network; other network monitoring tools may be used to enhance this model, if desired.
At step 204, the information obtained during step 202 is used to calculate the end-to-end latency for each of the candidate hosts, e.g., using Eq. (2) as described above. At step 206, the candidate hosts 137 are weighted in accordance with the end-to-end latencies for each of the hosts. At step 208, the best host is selected based on the weightings for each host 137 in the set of candidate hosts 137. The request is then routed to the selected host 137.
2. Direct Dispatch
In an exemplary embodiment, the client host 135 may be permitted in some circumstances to dispatch service requests directly to a leaf node 60 based on information contained in a direct dispatch list. By dispatching to hosts 15 within the direct dispatch list, rather than to intermediate proxies, the system avoids any redirection latency (RL) thereby reducing overall end-to-end latency. The client host 135 may also be permitted to dispatch to intermediate proxies in the same manner, thereby achieving some of the benefits of dispatching directly at a leaf node 60 and some of the benefits of dispatching at the root node 64.
At step 222, the client host 135 maintains and updates its local model of the tree structure (including latency information) based on the meta-data received in responses to service requests. In an exemplary embodiment, when the latency data is provided by the service hosts 137, the clients hosts 135 include a time-to-live (TTL) value for the meta-data. For example, the TTL value may be attached to the meta-data values updated by the hosts 137 that served and routed the request. Upon the receipt of the response, the request router 112 of the client host 135 adds the end-host in a direct-dispatch list, but only for TTL seconds. (If the request router 112 of the client host 135 already knows a particular host 137, the TTL value may merely be updated.)
The TTL value is a time period during which the reported load of a service host 137 (learned through meta-data, as described above) is expected to be valid. The TTL value may be set by the host 137 based on its current utilization (e.g., which may be measured as the fraction of processes which are busy, and which may be smoothed over time). In an exemplary embodiment, the utilization of a host 15 is divided into three zones: underloaded, nearloaded and overloaded. A host 15 may be designated as underloaded if its utilization is less than 0.5, nearloaded if its between 0.5 and 0.8, and overloaded otherwise. The use of such threshold values avoids overloading of hosts through direct dispatch. If a host 15 is underloaded, its TTL value may be high (e.g., 3 minutes) and may decrease with increasing load. Effectively, the TTL value may be thought of a measure of how long the host wants to be remembered by a client host 135.
At step 224, the next time the request router 112 of the client host 135 needs to dispatch a request, the request router 112 first checks the direct-dispatch list and, at step 226, determines whether any service hosts 137 are available for direct dispatch. At step 228, if there are hosts 137 available for direct dispatch, then the client host 135 performs latency-based weighted dispatch between these hosts 137. On the other hand, at step 230, if the list is empty, then the client host 135 switches to regular routing through the list of hosts 137 it knows through the service communicator 116. The list may become empty if hosts 137 become overloaded. For example, if a host 137 gets overloaded (e.g., due to background administration tasks such as disk backup, or due to a long-executing service request), then the host 137 may set its TTL value to zero, thereby avoiding direct dispatch and allowing dispatch only through proxies learned using the service communicator 116.
Once a host 137 is added to the direct-host list, and if the request router 112 always dispatches its requests to this host, the list will always contain only a single element thereby potentially causing a herd-effect. To avoid such a herd effect and to facilitate the population of more hosts 137 into the direct-host list, the direct-host list may be used only with a certain probability (e.g., a configurable default value of 0.95). In an exemplary embodiment, the default probability value may take into account a tradeoff between redirection latency (RL) reduction and learning about new hosts to avoid the herd-effect.
In an exemplary embodiment, the client host 135 may be permitted to dispatch service requests at any level in the tree structure. For example, during a near-loaded scenario, it may be desirable to send a request to proxies in the higher levels (level 1 or higher in the service communicator 116 tree structure) as they may represent more capacity than a single end-host, and they may perform better load balancing through the aggregation of multiple client workloads in a more centralized queue.
To permit dispatching at intermediate levels of the tree structure during request routing, each service host 137 in the request path adds its status information along with a TTL value to the meta-data. Upon the receipt of this meta-data, the client request router 112 adds these hosts 137 in the direct-dispatch list. The TTL value of the service proxies may increase with increasing hierarchy depth (i.e., proxies at level 3 may have a higher TTL than proxies at level 2). The TTL values may also be determined based on an aggregation of the utilization of all hosts 137 within the subtree represented by the proxy, where the aggregation function is the weighted average of utilizations of all hosts within that subtree. By remembering proxies higher in the hierarchy for a longer time, the request routers 120 may smoothly transition between dispatching directly to end-hosts 137 (in order to avoid Redirection Latency) and a more centralized scheduler (which would reduce queuing latency at the end-host and hence Service Latency). Centralized queuing may be beneficial in high load situations as it uses a common entry point for queuing all client requests and allows the system to do effective dispatch of requests and/or load shedding. As loading increases, service requests tend to be dispatched at higher levels, because the TTL values are smaller. Lower level hosts 137 are forgotten more quickly than higher level hosts 137, which are assigned higher TTL values. As loading decreases, the TTL values increase, causing service requests to be directly dispatched to lower levels in the tree structure. Because the service requests are dispatched at a lower level, the routing latency decreases. Thus, routing algorithm 120 adaptively dispatches loads at an appropriate level in the tree structure based on current loading conditions to attain the fastest response time. The request routers 120 may therefore make an appropriate tradeoff between network locality, redirection overhead, and end-host queuing, with the ultimate goal of reducing end-to-end latency.
3. Load Prediction
As described above, each request router 112 may append its load information (e.g., predicted SL and RL) in the meta-data of the response sent back to client hosts 135 and the request routers 112 upstream in the routing path (which are informed through completion notifications). Since client hosts 135 and intermediate proxies use this information to route requests, it is desirable for this information to avoid being skewed by temporary load fluctuations, such as flash crowds. Flash crowds are events when an application experiences an orders of magnitude increase in request rate from legitimate clients.
The expected service latency, and the redirection latency, for incoming requests may be calculated using exponential smoothing predictors. Even though exponential smoothing predictors operate satisfactorily for predicting latencies at a steady state, they often do not operate satisfactorily for predicting events such as hotspots or flash crowds. Linear-fit predictors may be used to detect flash crowds. The linear-fit predictors predict the expected latency for the near future (e.g., two minutes in the future). If predicted latency exceeds a certain threshold, then TTL values are set to zero. This enables the system to perform a more centralized queuing, and possibly load shedding, at higher levels and hence handle flash crowds effectively.
In another exemplary embodiment, if an application on a service host 137 is generating erroneous responses (which are often generated faster than legitimate responses), the routing system 55 is able to detect them as invalid responses. For example, the client hosts 135 may provide messaging to the global communicator 114 indicating that a particular service 118 is providing invalid responses, and the global communicator 114 may relay the information to other client hosts 135 to warn of the potentially failing service host 137.
It should be noted that although flowcharts may be provided herein to show a specific order of method steps, it is understood that the order of these steps may differ from what is depicted. Also, two or more steps may be performed concurrently or with partial concurrence. Such variation will depend on the software and hardware systems chosen and on designer choice. It is understood that all such variations are within the scope of the invention. Likewise, software and web implementations of the present invention could be accomplished with standard programming techniques with rule based logic and other logic to accomplish the various database searching steps, correlation steps, comparison steps, and decision steps. It should also be noted that the word "component" as used herein and in the claims is intended to encompass implementations using one or more lines of software code, and/or hardware implementations, and/or equipment for receiving manual inputs. It is to be understood that any method steps as recited herein (e.g., in the claims) may be performed by a configuration utility (e.g., Java™-based) executed by a computing device based on input by a user. Of course, according to various alternative embodiments, any suitable configuration utility, application, system, computing device, etc. may be used to execute, implement and/or perform method steps as recited in this disclosure (including the claims).
The invention is described above with reference to drawings. These drawings illustrate certain details of specific embodiments that implement the systems and methods and programs of the present invention. However, describing the invention with drawings should not be construed as imposing on the invention any limitations associated with features shown in the drawings. The present invention contemplates methods, systems, and program products on any machine-readable media for accomplishing its operations. The embodiments of the present invention may be implemented using an existing computer processor, or by a special purpose computer processor incorporated for this or another purpose or by a hardwired system.
As noted above, embodiments within the scope of the present invention include program products comprising machine-readable media for carrying or having machine-executable instructions or data structures stored thereon. Such machine-readable media can be any available media which can be accessed by a general purpose or special purpose computer or other machine with a processor. By way of example, such machine-readable media can comprise RAM, ROM, PROM, EPROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code in the form of machine-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer or other machine with a processor. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a machine, the machine properly views the connection as a machine-readable medium. Thus, any such connection is properly termed a machine-readable medium. Combinations of the above are also included within the scope of machine-readable media. Machine-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing machine to perform a certain function or group of functions.
Embodiments of the invention have been described in the general context of method steps which may be implemented in one embodiment by a program product including machine-executable instructions, such as program code, for example, in the form of program modules executed by machines in networked environments. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Machine-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represent examples of corresponding acts for implementing the functions described in such steps.
Embodiments of the present invention may be practiced in a networked environment using logical connections to one or more remote computers having processors. Logical connections may include a local area network (LAN) and a wide area network (WAN) that are presented here by way of example and not limitation. Such networking environments are commonplace in office-wide or enterprise-wide computer networks, intranets and the Internet and may use a wide variety of different communication protocols. Those skilled in the art will appreciate that such network computing environments will typically encompass many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. Embodiments of the invention may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are linked (either by hardwired links, wireless links, or by a combination of hardwired or wireless links) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
An exemplary system for implementing the overall system or portions of the invention might include a general purpose computing device in the form of a computer, including a processing unit, a system memory, and a system bus that couples various system components, including the system memory to the processing unit. The system memory may include read only memory (ROM) and random access memory (RAM). The computer may also include a magnetic hard disk drive for reading from and writing to a magnetic hard disk, a magnetic disk drive for reading from or writing to a removable magnetic disk, and an optical disk drive for reading from or writing to a removable optical disk such as a CD-ROM or other optical media. The drives and their associated machine-readable media provide nonvolatile storage of machine-executable instructions, data structures, program modules, and other data for the computer.
The foregoing description of embodiments of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principals of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Thanks for redeeming.{{else}}
Success! Thanks for repurchasing.{{/if}} {{else}} {{#if Expired}}
Increase my visibility!{{else}} {{#if IsMultiPack}}
{{#if HasMultiPack}} You have {{MultiPackCount}} top spot(s) left. Now loading you into the search listings... {{else}} You have used all top spots. Now loading you into the search listings... {{/if}}{{else}}
We are loading you into the search listing pages...{{/if}} {{/if}} {{/if}} {{/if}}
{{Current}} just saw you!{{/if}} {{#if LastTopSpotPurchaseIsMulti }} {{#if HasAnyTopSpot}}
{{#if HasFreeTopSpot }} {{ UnclaimedTopSpotFree }} Free {{/if}} {{#if HasPaidTopSpot }} {{#if HasFreeTopSpot }} & {{/if}} {{ MultiPackCount }} {{/if}} Top Spot{{#if Plural}}s{{/if}} Left{{else}}
0 Top Spot{{#if Plural}}s{{/if}} Left{{/if}} {{else}} {{#if HasFreeTopSpot }}
{{ UnclaimedTopSpotFree }} Top Spot{{#if Plural}}s{{/if}} Left{{/if}} {{/if}} {{else}} {{#if HasResults}}
{{Current}} see you now!{{else}} {{/if}} {{/if}}
You can now invite anyone to meet at your favorite Starbucks.
Limited-time feature
53 year old woman | New Carlisle, OH, USA | Seeking men 48-58 within 50 miles
Looking for that spark again. Looking for someone I can hang out with, have fun with, and be able to trust. Players need not to apply.
Hmm lets see I would say I am upbeat, Positive, energetic, love being out doors. I have a 22 yr old Son who means the world to me. I was divorced on my 50th birthday and feel as though I have my life back, and was given this chance to see and do things I wasn't able to while married. Just looking for a Good guy who is Fun and down to earth and knows how to treat a Lady. No drama and no baggage please. Players need not apply.... nor Ones with no Pic.
Dining out , Fishing/Hunting , Gardening/Landscaping , Movies/Videos , Museums and art , Music and concerts , Exploring new areas , Nightclubs/Dancing , Travel/Sightseeing
Baseball, Billiards / Pool, Bowling, Dancing, Other types of exercise, Swimming, Walking / Hiking
I exercise 1-2 times per week.
I have Dogs
I have 2 little Yorkies named Jessica and Abbey Just added a Lab Retriever to the Mix named Joey.
Gatlinburg, Daytona beach, Arizona, New York. Here at Home I like going to see live bands, Karaoke, Dancing, Local bar Grill with friends.
Sinclair Community College, Dayton, OH
I like Variety of Music and Movies. I like to Fish and take walks. I like to travel and see places I haven't seen before.
Like hanging out with friends, cookouts, concerts, Dragon's or Reds Game, Bonfire's, Fishing, Home and yard Improvements, Comfy on the couch watching old movies or going out to Karaoke, Dancing, hanging out with friends.
I enjoy reading a variety of books.
Z{{Cta}} {{#if HasMoreInfo}} ?{{CtaSecondary}} {{/if}}
|What she is looking for
|5'3" (160cms)
|5'9" (175cms) to 6'0" (182cms)
|Body type:
|About average
|Slender, About average, Athletic and toned
|No preference
|No preference
|No Way
|No Way
|Social Drinker
|Social Drinker
|Self-Employed / Entrepreneur
|No preference
Great being my own boss.
|I'll tell you later
|No preference
|Have kids:
|Yes, and they live away from home (1)
|No preference
|Wants kids:
|No, but it's OK if my partner has kids
|No preference
|White / Caucasian
|Latino / Hispanic, White / Caucasian
|Christian / Other
|No preference
|Some college
|No preference


text:
Originally written on Fox Sports | Last updated 6/21/12
Ike Diogu had 33 points and 15 rebounds to lead Nigeria to an 86-80 win over Britain in an international friendly Thursday night. Andrew Lawrence led four British players in double figures with 19 points. Eric Boateng had 13 points, and Matt Bryan-Amaning and Joel Freeland each added 10 points. Reserve Ade Dagundro added 13 points for Nigeria, whileTony Skinn chipped in 12 points, and Ekene Ibekwe had 10 points and 10 rebounds. Tied at 78 in overtime, Diogu hit two free throws with 1:28 left to give Nigeria the lead. After Lawrence missed a jumper, Dagundro hit a lay-up with 57 seconds left. Ibekwe then hit a slashing dunk with 34 seconds remaining to put Nigeria up 84-78.
Comments are closed.
What do you think?To leave a comment, you can:
NBA News
Delivered to your inbox
You'll also receive Yardbarker's daily Top 10, featuring the best sports stories from around the web. Customize your newsletter to get articles on your favorite sports and teams. And the best part? It's free!
Follow us on Twitter
|Best of Yardbarker
|NFL News
|MLB News
Today's Best Stuff
For Bloggers
Join the Yardbarker Network for more promotion, traffic, and money.
Company Info
What is Yardbarker?
Yardbarker is the largest network of sports blogs and pro athlete blogs on the web. This site is the hub of the Yardbarker Network, where our editors and algorithms curate the best sports content from our network and beyond.
|© 2015 Yardbarker, Inc. All rights reserved. Use of this website (including any and all parts and components) constitutes your acceptance of these Terms of Use and Privacy Policy. (What's New?)


text:
Chinook Skinny Medium Carbon Mast Extension 32cm
Custom alloy and bell shaped tubing provide the best weight to strength available in aluminum. All come with a pin and collar adjustment system and the proven US Power-Haul pulley and cleat system. 2 cm adjustment increments. Adds a maximum of 28cm to mast length.
This product can only be shipped within the United States. Please don't hate us.


text:
Originally posted by kidflash2008
The person in the video is doing nothing more than magic tricks.
Originally posted by JPhish
it's all tricks and slight of hand. Trust me, my father was a semi-professional magician, i've seen him perform these illusions live.
[edit on 8/4/2008 by JPhish]
Originally posted by Bluegate
Yes, illusions are ilusions and many tricks can do a magician live on stage!
That's something different.
Originally posted by menguard
What really holds an object in place or moves it is the field of attention, which placed into a highly electrical field.
Learning to move that field of energy is moving the world around you.
What you are doing is displacing the matter field of vibration, you are mentally moving the image around.
Displacing an objects field of inertia would be an easy way of moving things around once that attentions reached.
You are affecting more then a subatomic motion of the objects matter, you have just convinced the object its always in constant motion. You have displaced its gravity field or should I say you have just affected the charge, between living and unliving things, the two together create movement.
By displacing that images physicality you are re-arranging the molecules in its subspace time. Which is its, size, shape, speed.
The brain is not matter its only a thoughtform. Somebody created that thoughtform. In another position of mind.
Originally posted by Lethil
Please tell me how in the world something localized like the brain has the ability to change and shape matter?
Originally posted by Nohup
Originally posted by Lethil
Please tell me how in the world something localized like the brain has the ability to change and shape matter?
Well, the mind does change and shape matter all the time, but not in the way shown in the video. That's just magic tricks. What the mind does, however, is create a whole domino effect of reactions, starting with quantum fluctuations in the brain, cascading through electrical and chemical interactions, and eventually controlling complex reactions of muscles that interact directly with the universe. That's a fact.
When I imagine a green apple, there's a whole wave of things that happen on an atomic level that allows me to visualize a green apple in my mind. And it came completely out of nowhere. Out of dead, virtual space. When I think of a word, out of nothing, then it manages to make it to my fingers to be typed and sent around the world on this forum, that's a real thing happening that is directly caused by something happening in my mind and brain.
See, the mind's interaction with the universe is on a continuum. Some interactions are more direct than others, and it's hard to tell where some of the interactions lie along that continuum. Yes, there is fake magic. But there is also something real going on that has to do with the structure of reality and the place of the mind in it.
Originally posted by Lethil
BTW nohup...do atoms cahnge simply by being conscious and observing them? thats always pickled my brain...ive always thought it was a bad scientific test...not sure..though...but who is in quantum mechanics?


text:
routes du bonheur Suggestions for itineraries to discover the world
Spa / Thalassotherapy > Spa / Thalassotherapy - Portugal
Under stress? Feel your anxieties slip away as you indulge in the world of Relais & Châteaux. Thalassotherapy, Thermalism, Aromatherapy, Stone Therapy, Fangotherapy, Reflexology, Shiatsu, Exfoliation et Wrappings.
For a weekend or a short stay discover our special offers for spa & wellness getaways or discover all the benefits of a wellness stay in a selection of properties combining rest and relaxation with an unforgettable setting with the Spa & Relaxation offer
Casa Velha do Palheiro
Hotel and restaurant in the country
spa, Sauna, Fitness, Hammam, Swimming pool Outdoor Indoor, Anti-Aging ,
Portugal, Funchal
Casa da Calçada
Hotel and restaurant in town
spa, Swimming pool Outdoor,
Portugal, Amarante
The Yeatman
Hotel and restaurant in town
spa, Sauna, Fitness, Hammam, Swimming pool Outdoor Indoor, Revitalizing treatment, Antistress treatment, Post natal treatment, Anti-Aging ,
Portugal, Vila Nova de Gaia
Bela Vista Hotel & Spa
Hotel and restaurant on the seafront
spa, Sauna, Fitness, Hammam, Swimming pool Outdoor, Antistress treatment, Anti-Aging ,
Portugal, Portimão
charming hotel Porto
luxury hotel Cascais
charming hotel Portimão
luxury hotel Funchal
luxury accommodation Vila nova de gaia
exclusive accommodation Cascais
castel hotel Amarante
charming hotel Ilha da madeira
Spa / Thalassotherapy - Portugal
Golf escapade - Portugal
Traveller reviews powered by
More offers
To proceed further please select at least one search criteria.
You have to enter at least one search term
Invalid email
Login or password incorrect
Thank you to fill one of these three fields to choose : COUNTRY, REGION / AREA, LOCATION