text:
Police Looking For Food Store Robbery Suspect
Baltimore County police are asking for the public's help in finding more information about a robbery of an Essex food store.
Essex Woman Hoping President's Immigration Plan Will Reunite Family
Immigration overhaul. The president is set to unveil sweeping new policies. The plan could spare up to five million immigrants from the threat of deportation and make them eligible to work in the U.S.
Man Gets 50 Years For Producing Child Pornography
An Essex man has been sentenced to 50 years in prison for producing child pornography.
Man Who Broke Up Essex Bar Fight Dies After Assault
Baltimore County Police say a man who was assaulted after he helped break up a fight outside an Essex bar has died.
Suspect Arrested After Knocking Man Unconscious Outside Essex Bar
A Baltimore County man is arrested after knocking another person unconscious outside a bar.
Baltimore County Police Charged Suspect In Essex Shooting
Baltimore County Police have charged a suspect in connection with a shooting in Essex that left a man injured on Monday night.
Shooting In Baltimore County Under Investigation
A man is recovering after a shooting in Baltimore County.
Pizza Delivery Driver Stabbed In Essex
Baltimore County Police are investigating after a pizza delivery driver is stabbed in Essex.
Fire At Essex Townhouse Injures 2 People
Baltimore County firefighters have been working overnight to put out a fire at a townhouse in Essex.
Eastern Tech Among Md. High Schools Ranked Best In The Nation
U.S. News and World Report ranks the nation's top high schools. Several Maryland schools made the prestigious list.
Mystery Surrounds Mega Millions Millionaire
Someone in Baltimore is walking around with a Mega Millions ticket worth $1 million, but two weeks after it was purchased no one knows who it is.
Police Search For Armed Suspect In Essex Gas Station Robbery
Police search for the suspect behind an armed robbery in Baltimore County.


text:
Wilmer Starr
Wilmer Clarke Starr, 89, of Bison, S.D., passed away on Wednesday, April 2, 2014, at his home in Gas.
Funeral services will be at 2 p.m. Monday at Welda United Methodist Church. Burial will follow in Welda Cemetery. Mr. Starr will lie in state at the Feuerborn Family Funeral Service Chapel, 204 E. 4th St., Colony, on Sunday from noon to 8 p.m. with the family present to greet friends from 6 to 8 o'clock. Condolences to the family may be left at www.feuerbornfuneral.com.
Mary LaRue
Mary Louella LaRue, 70, rural Bronson, died early Wednesday, Feb. 25, 2015, at her home. She was born Dec. 20, 1944, in San Diego, Calif., the daughter of John Esch and Louella Lunceford Esch. She married Edward LaRue on May 4, 1968, in Pittsburg. Mary attended the Catholic... [More]
Timothy Shields
Timothy John Shields, 61, Cameron, Mo., passed away peacefully Feb. 22, 2015, at NKC Hospital surrounded by family and friends.He was born in St. Joseph, Mo., to Robert and Patricia (Adams) Shields. The family later moved to Kansas City, Mo., where Tim attended De La Salle Christian... [More]
Jim Lewis
Dewey L. "Jim" "Cowboy" Lewis, 72, Elsmore, died Saturday, Feb. 21, 2015, at Windsor Place in Iola.Jim was born Nov. 7, 1942, in Pineville, Mo., the son of Dewey and Elsie (Drake) Lewis. He grew up in the Pineville area.On Dec. 23, 1961, Jim married Carlin... [More]
More Obituaries
Hospital CEO to retire
Don't begrudge Ron Baker the big smile he's wearing these days. After 37 years in health care, he's stepping down as chief executive officer at Allen County Regional Hospital."I'm looking forward to the next chapter in life," Baker, 58, said... [More]
257 looks high, low for savings
Making budget cuts is no walk in the park. Faced with cuts of more than $500,000 through the 2015-16 school year, USD 257 school board members and administrators are reviewing potential savings. Effective March 7, the district will lose $81,000 after Gov. Sam Brownback... [More]
Kansas Senate poised to pass concealed firearm bill
On Wednesday, the Kansas Senate gave initial approval to a bill that would allow any Kansas gun owner to carry a concealed firearm in public without a permit.The so-called constitutional carry bill would eliminate background checks and training classes presently required for... [More]
More News
AP Video
Iola's Andrew Garber prepares for state
Iola's wrestler Andrew Garber will compete in Salina this weekend at the Class 4A State Tournament."It's another week of wrestling and I get to do what I love to do," Garber said.It was always Garber's goal to make it to the state tournament this... [More]
ACC loses conference title, still makes playoffs
With the Jayhawk East Conference title on the line, hot heads emerged toward the end of Allen Community Colleges men's basketball game on Wednesday night. The Red Devils lost to Coffeyville 87-68. The win secured Coffeyville the conference title."They were just a... [More]

subset: commoncrawl


text:
Welcome to Flickr Hive Mind, almost certainly the best photo search engine on the web. Returning logged in users may need to re-authenticate for FHM to work properly (go to preferences, log out, log in)
Dropbox storage - get 20 GB of Cloud Storage for free.
42 nikon 40 sanfrancisco 35 d300s 34 shibainu 33 柴犬 31 suki 30 shibaken 29 sf 28 japanese portrait 27 52weeksfordogs puppy 26 dog 22 night sb900 20 tokina cute strobist 18 shiba dusk 17 project 16 cls city 13 wireless 11 landscape embarcadero 10 1116 bokeh street 50135 sb800 nikkor 9 urban fox 8 535 japan flash 7 park california tamron vc 6 bay lr3 d700 bayarea sunset inu 1750 5 baybridge red goldengate bridge uwa bluehour marin transamerica action 4 jonathanfleming dx 京都 sky skyline goldengatebridge missionbay 70300 日本 longexposure smile ferrybuilding travel dof atx blue offcamera 3 gg lights photography wolf vr 35mm 24mmf14 marina blur 52 downtown financialdistrict sand shutter pet lrv sun ggb speedlight ezy cinematic presidio afs beach longshutter face motion nihon financial strobe kyoto fujifilm autumn orange d90 flare 52weeks gion rain dark san northbeach pyramid car water nature market lowlight graffiti people walk funny f28 running ca cityscape bakerbeach lastolite creativelighting noevalley treasureisland animal dogs tower wide kaoni701 peir sausalito doggy forest art golden ferryplaza square pier x100 francisco tracks 80 suspension rail train reflection architecture fuji house hill usa 28 f18 pacific wideangle hotshoe temple long fisheye sherwoodforest fog coronaheights arch kawaii 1116mm panning 1750mm onemoretogo grafitti storm leash yasaka pose palace fort light ray ぺろり waves cto coittower jackson church pier7 wall civiccenter broadway dogpark speed platform cablecar silly peak 101 batteryspencer cherryblossom mtdavidson leaves 柴犬 photomatix しば telegraph ezybox dusky streetcar 2010 converging 14 fashion rim week31 eyes sukichan autofphispeedsync festival highspeedsync week14 potrerohill headlands telephoto bamboo fast trails gate week52 lighting week28 distortion nx2 ken 八坂 traffic handheld eastbay hangtime span stuffed 70200vrii marketstreet castro fall lighttrail さくら birthday hanami 39 sterngrove tunnel scarf 11000 笑っている tonemapped skyscraper breed week32 cityhall week23 difussion nd restaurant 4exposure 73rd catchlight お花見 painted ギオン king frenchquarter iso mountain d70 akita smirk bart arts weeks 70200 18 fine prime lost southbeach victorian pan color toy palaceoffinearts station sync redrock
Pairs: 2 landscape,night goldengatebridge,night ggb,sanfrancisco ggb,night night,sf dusk,night sanfrancisco,sf dusk,sanfrancisco night,sanfrancisco goldengatebridge,sf landscape,sanfrancisco
Users: kaoni701 50
Flickr Hive Mind is a search engine as well as an experiment in the power of Folksonomies. All thumbnail images come directly from Flickr, none are stored on Flickr Hive Mind. These photos are bound by the copyright and license of their owners, the thumbnail links take to you to the photos (as well as their copyright and license details) within Flickr. Because some other search engines (Google, etc.) index parts of Flickr Hive Mind, you may have been led here from one of them. Welcome to Flickr Hive Mind, almost certainly the best search engine for photography on the web. If you are a Flickr user and use Flickr Stats you may have seen people being led to your photos via Flickr Hive Mind (as a Referrer). Flickr requires that I inform you that Flickr Hive Mind uses the Flickr API, but is neither endorsed nor certified by them. There are literally hundreds of other web tools built around the Flickr API, see Flickr Bits for a bunch of examples. If you are unhappy with your photos' presence on this site, you can (a) make your photos private for yourself, friends, and family. These settings will be instantly honored by Flickr Hive Mind and all other API-driven applications. (b) Hide your photos globally from text and tag searches on 3rd party sites that use the Flickr API, via your preference settings on Flickr. See the privacy tab at: http://flickr.com/account/. To also remove yourself from searches for specific user names, you will need to set your Flickr profile to be hidden from searches. Flickr has finally created a single page with all these settings, this is much easier to do now and is the preferred method - it will shut down all API driven sites. (c) Finally, you can Banish Yourself From Flickr Hive Mind. To banish yourself from Flickr Hive Mind, you must first authenticate to Flickr, which lets Flickr Hive Mind identify who you are. Once logged in, come back to this area and there will be a link to banish you. If there are any problems email me at nosflickrhivemind ... at ... fiveprime ... dot ... org. (a few people with weird characters in their user names may have had problems)Log In To Flickr Now
Flickr Hive Mind is a data mining tool for the Flickr photography database, allowing search by: tags(keywords); Flickr photography groups; Flickr users, their contacts, and favorites; free text; the Flickr Explore algorithm for interestingness. Flickr Hive Mind can also be an effective tool to identify photography with licenses that allow non-commercial (and sometimes) commercial use. Written by: Nathan Siemers. Inspired by (and thanks to) Flickr Leech. Dedicated to Anna and her Flickritis. If you find your login does not work, perhaps your browser has disabled the cookies that I use to track your session. Try telling your browser to accept them. Flickr Hive Mind stores no personal information nor photos, but some general time and IP address information ends up in my apache server logs. For additional details see the privacy policy. Any revenue generated through advertisement on this site is used only to cover the cost of keeping the site online, beyond that Fiveprime donates to charitable organizations (also, there are no ads on User pages). Flickr Hive Mind is currently consuming about 13.6 terabytes of network bandwidth per year (not including the photos themselves)!
Fiveprime.org supports The Mountain Institute - Sustaining mountain people, cultures and environments through education, conservancy, and sustainable development.


text:
- 11Promote
Art Print
Collect your choice of gallery quality Giclée, or fine art prints custom trimmed by hand in a variety of sizes with a white border for framing.
Oh! it's magic! I liked this series too on your website (which is really lovely btw). I'd like to know how you did these and your other levitation shots, it's something I've never tried.


text:
NOTE: Some NetID accounts have been purposefully disabled due to possible compromise from a phishing attack. Those that feel they may have been a target of phishing should contact the HelpDesk. Phishing information: http://www.cio.wisc.edu/security/scams.aspx
Most NetID problems can be resolved without having to call the DoIT Help Desk. A series of NetID tools was created so that you can resolve your account issues quickly and easily.
If you have forgotten your password, you can reset it using the link above. You will be asked for your NetID, campus photo ID number, and birthdate. You will then need to answer your three self help password reset questions, before being allowed to reset your password. See NetID - Resetting a Forgotten Password for more information.
If you have problems resetting your password, please call the DoIT Help Desk at 608-264-HELP (608-264-4357). Password issues cannot be handled via email or chat.
If you have not activated your account, you can activate it using the link above. More detailed instructions for activating your account can be found at NetID - Activating Your Account. This link gives information on NetIDs in general, and also gives activation instructions for students and faculty/staff.
If you have problems activating your account, please call the DoIT Help Desk at 608-264-HELP (608-264-4357). Account activation issues cannot be handled via email or chat.
If you wish to change your password, set up your password reset questions, or activate UW services, you can modify your account using the link above.
If you have problems modifying your account, please call the DoIT Help Desk at 608-264-HELP (608-264-4357). Account modification issues cannot be handled via email or chat.
Keywords: | NetID Account Self Help Utilities password account activate modify reset forgotten change forward email modification secret questions recovery | Doc ID: | 2843 |
Owner: | Charles C. | Group: | Access Management Services |
Created: | 2004-05-02 18:00 CST | Updated: | 2014-07-01 09:29 CST |
Sites: | Access Management Services, DoIT Help Desk, My UW-Madison Portal, Systems & Network Control Center | ||
Feedback: | 2042 2952 Comment Suggest a new document |


text:
NASDAQ OMX Named Best Data Center Provider To The Sell Side
NEW YORK, April 21, 2014 (GLOBE NEWSWIRE) -- NASDAQ OMX (Nasdaq:NDAQ) was recently named winner of 'Best Data Center Provider to the Sell Side' by Waters Magazine's second annual Sell-Side Technology Awards. NASDAQ OMX received the award for the NASDAQ OMX Data Center, which provides market participants with access to the most liquid electronic exchanges and over-the-counter platforms for trading in virtually every access class.
"It is an honor to be recognized for the NASDAQ OMX Data Center as we offer the sell-side community a state-of-the-art facility and an unparalleled trading experience for equities, derivatives and more asset classes as we grow our footprint in the fixed income, currencies and commodities arena," said Hans-Ole Jochumsen, Executive Vice President of Global Market Services at NASDAQ OMX. "I'm proud of our team which has developed an ecosystem that is not only functionally complete but also demonstrates operational resiliency to maintain continuous markets."
The award highlights the exchange group's Global Market Services business, particularly the Access Services division, which provides sell-side customers with fair access to exchange connectivity and co-location services, operational resiliency through disaster recovery, redundancy and other critical market functions.
The NASDAQ OMX Data Center is a leading liquidity center and one of the largest trading hubs for market participants across the world. It hosts markets across various asset classes and provides access to all major industry market data feeds, multiple telecommunications providers and leading financial technology and services. NASDAQ OMX's transparent approach to data center management and its use of leading edge infrastructure, including an independent solution for operational performance monitoring, offers an equal experience for all investors. About NASDAQ OMX: NASDAQ OMX (Nasdaq:NDAQ) is a leading provider of trading, exchange technology, information and public company services across six continents. Through its diverse portfolio of solutions, NASDAQ OMX enables customers to plan, optimize and execute their business vision with confidence, using proven technologies that provide transparency and insight for navigating today's global capital markets. As the creator of the world's first electronic stock market, its technology powers more than 80 marketplaces in 50 countries, and approximately 1 in 10 of the world's securities transactions. NASDAQ OMX is home to more than 3,300 listed companies with a market value of over $7 trillion and more than 10,000 corporate clients. To learn more, visit www.nasdaqomx.com. Cautionary Note Regarding Forward-Looking Statements The matters described herein contain forward-looking statements that are made under the Safe Harbor provisions of the Private Securities Litigation Reform Act of 1995. These statements include, but are not limited to, statements about the NASDAQ OMX Data Center and NASDAQ OMX's other products and offerings. We caution that these statements are not guarantees of future performance. Actual results may differ materially from those expressed or implied in the forward-looking statements. Forward-looking statements involve a number of risks, uncertainties or other factors beyond NASDAQ OMX's control. These factors include, but are not limited to factors detailed in NASDAQ OMX's annual report on Form 10-K, and periodic reports filed with the U.S. Securities and Exchange Commission. We undertake no obligation to release any revisions to any forward-looking statements. NDAQGCONTACT: NASDAQ OMX Media Contact: Robert Madden +1 (646) 441-5045 (office) +1 (347) 740-0191 (mobile) email@example.com
Check Out Our Best Services for Investors
Action Alerts PLUS
Portfolio Manager Jim Cramer and Director of Research Jack Mohr reveal their investment tactics while giving advanced notice before every trade.
Product Features:
- $2.5+ million portfolio
- Large-cap and dividend focus
- Intraday trade alerts from Cramer
Quant Ratings
Access the tool that DOMINATES the Russell 2000 and the S&P 500.
Product Features:
- Buy, hold, or sell recommendations for over 4,300 stocks
- Unlimited research reports on your favorite stocks
- A custom stock screener
Stocks Under $10
David Peltier uncovers low dollar stocks with serious upside potential that are flying under Wall Street's radar.
Product Features:
- Model portfolio
- Stocks trading below $10
- Intraday trade alerts
Check Out Our Best Services for Investors
Dividend Stock Advisor
David Peltier identifies the best of breed dividend stocks that will pay a reliable AND significant income stream.
Product Features:
- Diversified model portfolio of dividend stocks
- Updates with exact steps to take - BUY, HOLD, SELL
Trifecta Stocks
Every recommendation goes through 3 layers of intense scrutinyquantitative, fundamental and technical analysisto maximize profit potential and minimize risk.
Product Features:
- Model Portfolio
- Intra Day Trade alerts
- Access to Quant Ratings
Options Profits
Our options trading pros provide over 100 monthly option trading ideas and strategies to help you become a well-seasoned trader.
Product Features:
- Actionable options commentary and news
- Real-time trading community


text:
Brief: Genesis Resources
PUBLISHED: 29 Apr 2010 11:36:19 | UPDATED: 29 Apr 2010 11:36:19PRINT EDITION: 29 Apr 2010Genesis Resources (ASX:GES) JV partner, Rik Sileks Ad Kratovo, has been granted the seven concession licences over the Plavica project in Republic of Macedonia. Genesis has the right to earn a 62 per cent JV interest in the project by sole funding exploration expenditure to completion of feasibility study.
Already a subscriber? Please login here
Stay with the story for less than $1.90 a day
Read more
Companies | Genesis Resources |
Topics | Company News, Resources & Mining |


text:
Hi. My name is Winslet. I'm named after the actress, Kate Winslet, because like her, I am an elegant, voluptous, and sophisticated lady.
I am a stunning, very large, spayed, Californian rabbit with spectacular chocolate points on my ears, nose and tail and a lush, creamy colored coat.
In addition to being a gorgeous rabbit, I am also very gentle and sweet.
I had a sad start in life, but am doing very well now and love to dance, play and explore.
Before I was brought to the animal shelter, my humans kept me locked up in a very small, 2-foot by 2-foot cage outside and never let me out to play or get attention.
Consequently, I am a little shy at first and will benefit from a gentle and patient touch. I really do enjoy getting love and petted.
I will make a wonderful companion for a you and bring warmth and love into your life.
Please adopt me soon!
This beautiful handcrafted vase is beige with terra cotta brown and cream colored accents in a swirling pattern. Vase has a matte finish. Would make a beautiful accent piece for any home, and would be perfect for displaying dried flowers, or branches of the season. Vase is signed by the artist on the base. Each piece is unique and slight variations in size, glaze and smoothness is part of the beauty of artisan pieces. Artist wished to remain anonymous.


text:
Showing 193-217 of 217 items
- Sort by:
Country Attic Homespun Memories
A gift and collectible shop, specialize in Boyds, Mary Englebreit, Yankee Candles, Anheuser Busch steins, Bennington pottery and classic "Pooh". A collector club headquarters.
CITY: Mattoon
Budget Host
Clean Rooms! Free Coffee, Free HBO, Free Local Calls, Microwave & Refrigerator Available, Weekly & Monthly Rates Available, Food Nearby.
CITY: Greenup
Quality Inn and Suites Conference Center
The Quality Inn & Suites Conference Center provides guests with countless features, great service and a convenient location. Lake Land College is less than a mile away from this Mattoon, IL hotel and local points of interest like Illinois Amish Country, Eastern Illinois University and Lincoln Log Cabin are nearby. Outdoor enthusiasts can enjoy the multitude of recreation areas offered in the surrounding area. The Douglas Hart Nature Center, Peterson Park, Meadowview Golf Course and Lake Mattoon are in the vicinity. Several specialty stores, shopping malls, retailers and restaurants are close to the hotel.
CITY: Mattoon
Budget Host
29 units with smoking and non-smoking. Two queen beds are in a standard room.
CITY: Greenup
Hong Kong House - Charleston
Chinese restaurant with full menu - dine-in, carry-out or delivery.
CITY: Charleston
Moonshine Store
The Moonshine Store is situated at a country crossroads near the town of Martinsville, IL. It is an adventure in itself just finding the place. What makes it special is the unique atmosphere of this little country store that is home to the famous "Moonburger". It has been featured on the CBS Morning Show. It is a "must stop" location for travelers with its guest book logging visitors from all 50 states and around the world. In April 2014, a new record was set where 3,251 burgers were served during a major motorcycle rally, the Moonshine Lunch Run.
CITY: Martinsville
World's Largest Knitting Needles and Crochet Hook
The World's Largest Knitting Needles and Crochet Hook are located inside The Yarn Studio in downtown Casey, Illinois. In order to make it in to the Guinness Book of World Records shop owner, Jeanette Huisinga, had to knit and crochet a 10X10 square with the largest tools. Knitting Needles are 13ft .75in and 25 pounds each. Crochet Hook measures at 6ft. 1.5in and weight is 9lbs.
CITY: Casey
5 - 6
Strawberry Jam Festival
A festival of strawberry-related activities and events. This includes special sales promotions throughout the Arthur area. A strawberry social is held in conjunction at the Otto Center south of town. Strawberries are available for purchase and there will be limited giveaways during the festival. Lots of entertainment and activities, including the bands Battle Creek, Gunny Sack Revue and Deep Water.
CITY: Arthur
28 - 29
Mennonite Relief Sale
This two day auction features locally handcrafted furniture, quilts, and other handmade items. There will also be a children's auction and train ride. Bake sales and food vendors help round out the event. Proceeds from the two day event go to help those in need in the community and around the world.
CITY: Arthur
5 - 11
Moultrie-Douglas County Fair
Enjoy a week of mud, beauty and entertainment. This year will feature tractor pulls, demo derby and mud racing. Along with beauty pageants, we will have live entertainment.
CITY: Arthur
Sheep to Clothing at Lincoln Log Cabin
Follow the process of creating fabric in the 19th century, beginning with raw wool, our volunteers will take you through the entire spectrum of home based manufacturing process; quite literally from sheep to clothing. The Lincoln-Sargent Farm Foundation will kick off their fundraising campaign for the restoration of the Moore Home, scene of Abraham Lincoln's family farewell before leaving for Washington DC in 1861, with a unique pledge drive. The site manager will be weaving Venetian Carpet throughout the day with pledges for the number of yards woven. Also enjoy the Victory Garden Plant Sale: the Lincoln-Sargent Farm Foundation will again be selling heirloom flowers, plants and herbs to raise funds to support the educational and interpretive programming at Lincoln Log Cabin. All events will run from 10am-4pm.
CITY: Lerna
Rustic Barn
Consignment and antique store with new items arriving daily. Sullivan is located in beautiful Amish Country.
CITY: Sullivan
5 West Coffee & Wine Lounge
Take a break and enjoy a full-service espresso bar, premium wines, and craft beers. Treat yourself to a selection of pastries and appetizers after a busy day shopping in Amish Country.
CITY: Sullivan
Astoria Company Store
Beautiful store with unique vintage clothing, handmade jewelry and home decor.
CITY: Sullivan
Cathrine's Custom Framing Gallery & Gifts
One of a kind and handmade items fill the gallery. Find yourself strolling among pottery, jewelry and beautiful photography. You can find your favorite goodies with a selection of chocolates, jellies and butters and more. 85% of items sold are from artisans in the county.
CITY: Sullivan
The Flower Pot
Beautiful gift shop with fresh and silk flowers, gifts and accessories.
CITY: Sullivan
Thrifty Boutique
Shopping on a budget isn't a problem in this small town store. Low-priced donated items including clothing, toys and home decor.
CITY: Sullivan
World's Largest Horseshoe
Weighing in at 1,144 lbs and measuring 5'8" by 4' 5/8", this horseshoe is sure to bring good luck to all that visit. The Martinsville Horseshoe gained its Guinness Book of World Record status in 2013. The horseshoe stands at the entrance to the Martinsville fairgrounds.
CITY: Martinsville
TNT Pizzeria
TNT takes great pride in the fact that almost everything we serve is hand made right here in our store. We're up early every day making everything from scratch to make sure you get the finest products available. From the bread and pizza dough we mix, to the meats, cheeses, and vegetables we slice right here. You won't find a fresher product anywhere else. A great product is guaranteed every time.
CITY: Sullivan
Lucky's Food & Spirits
A family style restaurant with great burgers, steaks and sandwiches to help you unwind after a busy day in Amish Country.
CITY: Sullivan
14 - 17
Don't miss the queen pageant and free barbecue Friday night in addition to great entertainment all weekend, car show and more.
CITY: Toledo
10 - 12
Our American Cousin and the Assassination of President Lincoln
Lincoln Log Cabin State Historic Site will commemorate the 150th anniversary of the assassination of Abraham Lincoln with a production of "Our American Cousin." Audience members will watch the play as seen by the president that evening, then follow along through the tragic moments of the assassination and its aftermath before ending with a journey back to the Goosenest Prairie, home of the president's beloved step-mother, Sarah Lincoln. Audience members will experience the cultural offerings of 19th-century American theatre and be able imagine the grief and horror of a nation's response to Lincoln's murder, and closer to home - the grief of the president's Coles County kin. Directed by Earl Halbe, volunteers will recreate the play President and Mrs. Lincloln attended that fateful evening when the president's life was tragically taken by the assasin John Wilkes Booth. During these dates the site will feature "Draped in Mourning", an examination of mourning customs of the 19th century.
CITY: Lerna
A Petterson Springs B&B
Located in a very historic area of Camargo, IL at the well-known Patterson Springs where the spring water fills three concrete pools on the grounds, within three acres of wooded nature land, next to the Embarrass River. The Gothic Revival house with a mansard roof was built in 1880. History abounds on the grounds from Native Americans drinking from the springs, to 1906-16 Chautauqua's, to a $50,000 amusement park from 1927-1942. Relax in the peaceful surroundings and enjoy the aura of a time gone by.
CITY: Camargo


text:
Archiving Software
littleutils Various small and useful command-line utilities
137 weekly downloads -
RPM for Darwin RPM Package Manager (RPM) is a powerful package management system capable of installing, uninstalling, verifying, querying, and updating software packages. This is a port of the RPM software, including rpmbuild and yum/APT-RPM, to Darwin and Mac OS X
4 weekly downloads -
GNU up2date An Open Source fork of the Redhat up2date client and the NRH-up2date server.
2 weekly downloads -
arclog arclog archives the log files monthly. It supports Apache access log, Syslog, NTP, Apache 1 SSL engine log, modified ISO date/time log file formats, and Apache-like logs like CUPS, ProFTPD, Pure-FTPd… etc., and gzip and bzip2 compression methods.
1 weekly downloads -
CATBatch and Script Collection A useful collection of batch files and scripts for daily purposes (backup, security, system management, etc.) and development
0 weekly downloads -
DLD linux system build to build and install linux and development tools into the DLD device,witch is a linux kernel with many AP (such as dictionary,....).The DLD is digital learning device.
0 weekly downloads


text:
$22 Billion Hedge Fund Puts Its Money on a Stronger Economy
BOSTON ( TheStreet) -- Thomas Steyer, the billionaire environmentalist and founder of hedge fund Farallon Capital Management, has made a big bet on a rebound in the economy by buying energy and industrial stocks, including El Paso (EP) and Goodrich (GR).
Steyer founded Farallon Capital in 1986 and has served as the fund's managing partner. Based in San Francisco, Farallon has about $22 billion in assets and uses numerous strategies ranging from credit to value to merger-arbitrage investments. The hedge fund has a disciplined approach to preserve capital, focusing on achieving risk-adjusted returns.
Thomas Steyer of Farallon Capital Management. |
The latest merger-arbitrage investment for Steyer is El Paso, which received a $21 billion buyout offer from Kinder Morgan (KMI) in October. Farallon bought more than 14.5 million shares of El Paso, which carried a market value of nearly $390 million as of Dec. 31. That new position alone became the third largest of Steyer's disclosed holdings.
Hedge funds that manage more than $100 million are required to disclose their equity holdings, options and convertible debt on a Form 13F filed to the Securities and Exchange Commission within 45 days of the end of a quarter. Funds aren't required to report short positions betting on declines. Farallon Capital ended the third quarter with 61 reported holdings with a market value of $4 billion. Farallon's other new buys in the most recent quarter were Pharmasset (VRUS), Check Point Software (CHKP), Qualcomm (QCOM) and Yahoo! (YHOO - Get Report). In total, the hedge fund reported 12 new holdings for the fourth quarter. Steyer also increased his stake in 16 companies, including big buys in large-cap companies like aerospace company Goodrich. Farallon more than doubled its stake in the company during the quarter, adding 2.2 million shares. Other position increases included Motorola Mobility (MMI - Get Report), News Corp. (NWS), Oracle (ORCL) and eBay (EBAY). >>View Farallon Capital's Portfolio Steyer sold completely out of stakes in 17 companies, including Home Depot (HD), Viacom (VIA.B) and Charles Schwab (SCHW) Farallon also cut stakes in 21 stocks in the fourth quarter, including several large-cap names like Google (GOOG), Wells Fargo (WFC), Visa (V), Comcast (CMCSA) and Target (TGT). During the third quarter, Steyer had made a wager on Motorola and Google, which are set to merge after U.S. and European regulators gave clearance. Google offered $12.5 billion to acquire Motorola in August. -- Written by Robert Holmes in Boston.>To contact the writer of this article, click here: Robert Holmes.
Check Out Our Best Services for Investors
Action Alerts PLUS
Portfolio Manager Jim Cramer and Director of Research Jack Mohr reveal their investment tactics while giving advanced notice before every trade.
Product Features:
- $2.5+ million portfolio
- Large-cap and dividend focus
- Intraday trade alerts from Cramer
Quant Ratings
Access the tool that DOMINATES the Russell 2000 and the S&P 500.
Product Features:
- Buy, hold, or sell recommendations for over 4,300 stocks
- Unlimited research reports on your favorite stocks
- A custom stock screener
Stocks Under $10
David Peltier uncovers low dollar stocks with serious upside potential that are flying under Wall Street's radar.
Product Features:
- Model portfolio
- Stocks trading below $10
- Intraday trade alerts
Check Out Our Best Services for Investors
Dividend Stock Advisor
David Peltier identifies the best of breed dividend stocks that will pay a reliable AND significant income stream.
Product Features:
- Diversified model portfolio of dividend stocks
- Updates with exact steps to take - BUY, HOLD, SELL
Trifecta Stocks
Every recommendation goes through 3 layers of intense scrutinyquantitative, fundamental and technical analysisto maximize profit potential and minimize risk.
Product Features:
- Model Portfolio
- Intra Day Trade alerts
- Access to Quant Ratings
Options Profits
Our options trading pros provide over 100 monthly option trading ideas and strategies to help you become a well-seasoned trader.
Product Features:
- Actionable options commentary and news
- Real-time trading community


text:
Optimistic Synchronization-Based State-Space Reduction
ABSTRACT Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated
verification, by reducing the size of the state space. We propose a reduction that can exploit common synchronization disciplines,
such as the use of mutual exclusion for accesses to shared data structures. Exploiting them using traditional reduction theorems
requires checking that the discipline is followed in the original (i.e., unreduced) system. That check can be prohibitively expensive. This paper presents a reduction that instead requires checking
whether the discipline is followed in the reduced system. This check may be much cheaper, because the reachable state space
is smaller.
- [Show abstract] [Hide abstract]
ABSTRACT: Structural model abstraction is a powerful technique for reducing the complexity of a state based enumeration analysis. We present in this paper new ecien t ordinary Petri nets reductions. At rst, we dene \behavioural" reductions (i.e. based on conditions related to the language of the net) which preserve a fundamental property of a net (i.e. liveness) and any LTL formula that does not observe reduced transitions of the net. We substitute these conditions by structural or algebraical ones leading to reductions that can be ecien tly checked and applied whereas enlarging the application spectrum of the previous reductions. At last, we illustrate our method on signican t and typical examples. - SourceAvailable from: citeseerx.ist.psu.edu[Show abstract] [Hide abstract]
ABSTRACT: The interleaving of concurrent processes actions leads to a com- binatory explosion. There exists in Petri nets theory some structural reduc- tions that combat the state explosion by agglomerating sequences of transi- tions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that do not observe the modied transitions. Furthermore, they can be combined with others kinds of reductions such like partial-order techniques to obtain very eectiv e reductions. We propose in this paper to adapt these reduc- tions to Promela specications by proposing some simple rules which give the possibility to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical example the eciency of this approach and we propose some perspectives of this work. - SourceAvailable from: Shaz Qadeer[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we present a new algorithm for detecting data-races in an execution of a concurrent program. Our algorithm is sound and precise, that is, it reports a race in an execution iff there are two accesses to a shared variable along the execution that are not ordered by the happens-before relation. Previous algorithms for computing the happens-before relation are based on clock vectors. On the other hand, our algorithm is based solely on the concept of locksets and is able to capture all mutual-exclusion synchronization idioms uniformly with one mechanism. Our lockset algorithm could be very useful for improving the precision of flow-sensitive static analyses, particularly those for detecting data-races and atomicity violations in concurrent programs. We present one such analysis, a model checking algorithm that uses our lockset algorithm both to check for races exhaustively and perform partial-order reduction when races are absent. Our characterization of the happens-before relation in terms of locksets rather than clock vectors is crucial for the fixpoint computation inherent in model checking and other flow-sensitive analyses. We have implemented our algorithm and used it to prove the absence of data-races and assertion failures on a number of examples containing a variety of synchronization idioms.
Page 1
Optimistic Synchronization-Based State-Space
Scott D. Stoller?1and Ernie Cohen??2
1State University of New York at Stony Brook
2Microsoft Research, Cambridge, UK
Abstract. Reductions that aggregate fine-grained transitions into coarser
transitions can significantly reduce the cost of automated verification,
by reducing the size of the state space. We propose a reduction that can
exploit common synchronization disciplines, such as the use of mutual
exclusion for accesses to shared data structures. Exploiting them us-
ing traditional reduction theorems requires checking that the discipline
is followed in the original (i.e., unreduced) system. That check can be
prohibitively expensive. This paper presents a reduction that instead re-
quires checking whether the discipline is followed in the reduced system.
This check may be much cheaper, because the reachable state space is
For many concurrent software systems, a straightforward model of the system
has such a large and complicated state space that automated verification, by
automated theorem-proving or state-space exploration (model checking), is in-
feasible. Reduction is an important technique for reducing the size of the state
space by aggregating transitions into coarser-grained transitions.
When exploring the state space of a concurrent system, context switches be-
tween threads are typically allowed before each transition. A simple example of a
reduction for concurrent systems is to inhibit context switches within sequences
of transitions that access only unshared variables. This effectively increases the
granularity of transitions. Thus, one can regard this and similar reductions as
defining a reduced system, which is a coarser-grained version of the original sys-
tem. The reduced system may have dramatically fewer states than the original
system. A reduction theorem asserts that certain properties are preserved by the
We consider a more powerful reduction that exploits common synchroniza-
tion disciplines. For example, in a system that uses mutual exclusion on accesses
to some shared variables—called protected variables—our reduction inhibits con-
text switches within sequences of transitions that access only unshared variables
and protected variables. The model-checking experiments reported in [Sto02] are
?The author gratefully acknowledges the support of NSF under Grant CCR-9876058
and the support of ONR under Grants N00014-01-1-0109 and N00014-02-1-0363.
Address: Computer Science Dept., SUNY at Stony Brook, Stony Brook, NY 11794-
4400. Email: email@example.com: http://www.cs.sunysb.edu/˜stoller/
??Email: email@example.com
Page 2
based on a similar reduction, which decreased memory usage (which is propor-
tional to the number of states) by a factor of 25 or more. Such reductions can also
significantly decrease the computational cost of the automated theorem-proving
needed for thread-modular verification [FQS02].
Traditional reduction theorems, such as [Lip75,CL98,Coh00], can also exploit
such synchronization disciplines. However, a hypothesis of these traditional the-
orems is that the allegedly protected variables are indeed protected (by synchro-
nization that enforces mutual exclusion) in the original (i.e., unreduced) system.
How can we establish this? Static analyses like [BR01,FF01] can automatically
provide a conservative approximation but sometimes return "don't know". For
general finite-state systems, it might seem that the only way to automatically
obtain exact information about whether selected variables are actually protected
is to express this condition as a history property and check it by state-space ex-
ploration of the original system. If this were the case, then the reduction would
be almost pointless.
Our reduction theorem implies that one can determine exactly during state-
space exploration of the reduced system whether the synchronization discipline
is followed in the original system.
Our reduction theorem is designed to be used together with traditional re-
duction theorems. Suppose a traditional reduction theorem asserts that some
property φ is preserved by the reduction if the original system follows the syn-
chronization discipline. After checking that the reduced system follows the dis-
cipline and satisfies φ, one can use our reduction theorem to conclude that the
original system follows the discipline, and then use the traditional reduction
theorem to conclude that the original system satisfies φ.
The reduction in [Sto02] is similar in spirit to the one in this paper. The
main contributions of this paper relative to [Sto02] are: (1) a reduction that
applies to systems that use arbitrary synchronization mechanisms to achieve
mutual exclusion (the results in [Sto02] apply only when monitors are used);
(2) separation of a general reduction theorem that justifies checking hypotheses
of traditional reduction theorems in the reduced system from the application
of this technique to mutual-exclusion synchronization disciplines; (3) allowing
non-determinism in invisible transitions (in the notation of Section 3, [Sto02]
requires that u be deterministic); (4) significantly shorter and cleaner proofs,
based on ω-algebra. The first author initially tried to prove similar results in a
transition-system framework, like the one in [God96]; that should be possible,
but our experience suggests that the algebraic framework facilitates the task.
Operations on monitors are not analyzed specially in this paper. As a result,
for systems that mainly use monitors for synchronization, this reduction is not
as effective as the one in [Sto02]. It should be possible to integrate the specialized
treatment of monitor operations in [Sto02] into this paper's broader framework.
Our method and traditional partial-order methods (e.g., ample sets [CGP99],
stubborn sets [Val97], and persistent sets [God96]) both exploit independence
(commutativity) of transitions, but our method can establish independence of
transitions—and hence achieve a reduction—in many cases where traditional
Page 3
partial-order methods cannot. Traditional partial-order methods, as implemented
in tools such as Spin [Hol97] and VeriSoft [God97], use two kinds of information
to determine independence of transitions: program-specific information about
which processes may perform which operations on which objects (e.g., only
process P2 sends messages on channel C1), and manually supplied program-
independent information about dependencies between operations on selected
datatypes (e.g., a send operation on a full channel is disabled until a receive
operation is performed on that channel). Our method also exploits more com-
plicated program-specific information to determine independence of transitions,
e.g., the invariant that a particular variable is always protected by particular
synchronization constructs.
Traditional partial-order methods rely on static analysis to conservatively
determine dependencies between transitions. As a result, those methods are less
effective for programs that contain references (or pointers) and arrays, because
static analysis cannot in general determine exactly which locations are accessed
by each transition, and the static analysis of dependencies between transitions
is correspondingly imprecise. Our method does not rely on conservative static
analysis of dependencies and has no difficulty with references, etc.
2 Omega Algebra
An omega algebra is an algebraic structure over the operators (in order of in-
creasing precedence) 0 (nullary), 1 (nullary), + (binary infix), · (binary infix,
usually written as simple juxtaposition), ? (binary infix, same precedence as ·),
∗(unary suffix), andω(unary suffix), satisfying the following axioms3:
(x + y) + z = x + (y + z)
x + y = y + x
x + x = x
0 + x = x
x (y z) = (x y) z
0 x = x 0 = 0
1 x = x 1 = x
x (y + z) = x y + x z
(x + y) z = x z + y zx ≤ y x + z ⇒ x ≤ y ? z
In parsing formulas, · and ? associate to the right; e.g., u v ? x ? y parses to
(u · (vω+ v∗· (xω+ x∗· y))). In proofs, we use the hint "(dist)" to indicate
application of the distributivity laws, and the hint "(hyp)" to indicate the use
of hypotheses. If xiis a finite collection of terms, we write (+i : xi) and (·i : xi)
for the sum and product, respectively, of these terms.
These axioms are sound and complete for the usual equational theory of
omega-regular expressions. (Completeness holds only for standard terms, where
the first arguments to ·,ω, and ? are regular.) Thus, we make free use, without
3The axioms are equivalent to Kozen's axioms for Kleene algebra [Koz94], plus the
three axioms for omega terms.
x ≤ y ⇔ x + y = y
x∗= 1 + x + x∗x∗
x y ≤ x ⇒ x y∗= x
x y ≤ y ⇒ x∗y = y
x ? y = xω+ x∗y
xω= x xω
(* ind)
(* ind)
(? ind)
Page 4
proof, of familiar equations from the theory of (omega-)regular languages (e.g.,
x∗x∗= x∗).
y is a complement of x iff x y = 0 = y x and x + y = 1. It is easy to show
that complements (when they exist) are unique and that complementation is
an involution; a predicate is an element of the algebra with a complement. In
this paper, p and q range over predicates, with complements p and q. It is easy
to show that the predicates form a Boolean algebra, with + as disjunction, ·
as conjunction, 0 as false, 1 as true, complementation as negation, and ≤ as
implication. Common properties of Boolean algebras (e.g., p q = q p) are used
silently in proofs, as is the fact x p y = 0 =⇒ x y = x p y.
The omega algebra axioms support several interesting programming models,
where (intuitively) 0 is magic4, 1 is skip, + is chaotic nondeterministic choice, · is
sequential composition, ≤ is refinement, x∗is executed by executing x any finite
number of times, and xωis executed by executing x an infinite number of times.
The results of this paper are largely motivated by the relational model, where
terms denote binary relations over a state space, 0 is the empty relation, 1 is the
identity relation, · is relational composition, + is union,∗is reflexive-transitive
closure, ≤ is subset, and xωrelates an input state s to an output state if there is
an infinite sequence of states starting with s, with consecutive states related by
x. (Thus, xωrelates an input state to either all states or none, and xω= 0 iff x
is well-founded.) Predicates are identified with the set of states in their domain
(i.e., the states from which they can be executed). We define ? = 1ω; it is easy
to see that ? is the maximal element under ≤, and in the relational model, it
relates all pairs of states.
In addition to equational identities of regular languages, we will use the fol-
lowing two standard theorems (proofs of these theorems and more sophisticated
theorems of this type appear in [Coh00]):
x y ≤ y z =⇒ x∗y ≤ y z∗
y x ≤ x y =⇒ (x + y)∗≤ x∗y∗
3A Reduction Theorem
We consider systems composed of a fixed, finite set of concurrent processes (each
perhaps internally concurrent and nondeterministic). Variables i and j range
over process indices. Each process i has a visible action vi and an invisible
action ui5, where the invisible action is constrained to neither receive information
from other processes nor to send information to other processes so as to create
a race condition in the recipient. This constraint is guaranteed only so long
as some global synchronization policy is followed. For example, in a system
where processes are synchronized using locks, either visible or invisible actions
4magic is the program that has no possible executions (and so satisfies every possible
specification). Of course, it cannot be implemented.
5Note that ui and vi can be sums of nondeterministic actions that correspond to
individual transitions of process i.
Page 5
of process i might modify variables that are either local to process i or protected
by locks held by process i, or send asynchronous messages to other processes;
but only visible actions can acquire locks or wait for a condition to hold. Note
that violation of the synchronization discipline (e.g., an action accessing a shared
variable without first obtaining an appropriate lock) might cause a race condition
between an invisible action and the actions of another process, violating the
constraint on invisible actions.
To avoid introducing temporal operators, we introduce a Boolean history
variable q that records whether the synchronization discipline has been violated
at some point in the execution. Predicate pimeans that process i cannot perform
an invisible action, i.e., that uiis disabled. Let p be the conjunction of the pi's,
i.e., p = (·i : pi). A state satisfying p is called visible; thus, in a visible state, all
invisible transitions are disabled.
We now define several actions, formalized in the definitions (3)–(9) below.
An Miaction consists of a visible action of process i followed by a sequence of
invisible actions of process i. An Niaction is an Miaction that is "maximal"
(i.e., further ui actions are disabled) and that finishes in a state where the
synchronization discipline has not been violated. Niis effectively the transition
relation of thread i in the reduced system. (Additional conditions will imply that
executing an N action in a visible state results in a visible state; thus, in the
reduced system, context switches occur only in visible states.) A u (respectively
v, M, N) action is a ui(respectively, vi, Mi, Ni) action of some process i. Finally,
an R action is executable iff (i) the discipline has been violated, or (ii) such a
violation is possible after execution of a single M action. (Like xω, R relates
each initial state to either all final states or none.)
Mi= viu∗
Ni= Mipiq
u = (+i : ui)
v = (+i : vi)
M = (+i : Mi)
N = (+i : Ni)
R = (1 + M) q ?
Our reduction theorem says that if the original system can reach a violation of
the synchronization discipline starting from some visible state, then the reduced
system can also reach a violation starting from the same initial state, except
that the violation might occur partway through the last transition of the reduced
system (i.e., the last transition might be an M action rather than an N action).
The transition relations of the original and reduced systems are u + v and N,
respectively. Thus, the conclusion of the reduction theorem, (19), is
p (u + v)∗q ≤ N∗R
The hypotheses of our reduction theorem are as follows, formalized in for-
mulas 11–(18) below. It is impossible to execute invisible actions of a single
Page 6
process forever without violating the discipline (11). An action cannot enable or
disable an invisible action of another process (12),(13), and in the absence of a
discipline violation, it commutes to the right of such an action (14),(15). Visible
and invisible actions of a process cannot be simultaneously enabled (16). uiis
enabled whenever piis false (17). Invisible actions cannot hide violations of the
discipline (18).
(uiq)ω= 0(11)
i ?= j =⇒ ujpi= piuj
i ?= j =⇒ vjpi= pivj
i ?= j =⇒ ujui≤ ui(q ? + uj+ ujq ?)
i ?= j =⇒ vjui≤ ui(q ? + vj+ vjq ?)
pivi= 0 = piui
1 ≤ pi+ ui?
q ui≤ uiq
Our reduction theorem can be used to check not only the synchronization dis-
cipline, but also the invariance of any other predicate I such that violations of
I cannot be hidden by invisible actions. To see this, note that, except for (18),
the conditions above are all monotonic in q. Thus, if all the conditions above
(including (18)) are satisfied for a predicate q, and there is a predicate I such
that I ui≤ uiI for each i, then all the conditions are still satisfied if q is replaced
with q + I.
The proof below can be viewed as formalizing the following construction,
which starts from an execution that violates the discipline and produces an
execution of the reduced system that also violates the discipline. First, we try to
move invisible uiactions to the left of ujand vjactions, where i ?= j, starting
from the left (i.e., from the leftmost uiaction that immediately follows a ujor
vj action). The ui action cannot make it all the way to the beginning of the
execution (since p ui= 0), so it must eventually run into either another uior a
vi. Repeating this produces an execution in which a sequence of M actions leads
to a violation of the discipline.
Next, we try to turn all but the last of these M actions into N actions,
starting from the next to last M action. In general, we will have done this for
some number of M actions, so we will have an execution that ends with N∗R.
Now try to convert the last Mibefore the N∗R suffix into an N action. Suppose
this Miaction ends with uienabled. uimust then also be enabled later when
the discipline is first violated (because (12) and (13) imply Nj does not affect
enabledness of ui, and (16) implies Niis disabled when uiis enabled), so we add
a ui action just after the violation and try to push it backward (through the
N∗(1 + M)). This may create additional violations of the discipline, but there
will always be an N∗R to the right of the new ui. Eventually, uimakes it back
to the Mi, extending Miwith another ui. By (11), ui's cannot continue forever
without violating the discipline, so repeating this extension process eventually
either gives us a violation right after Mi (in which case we have produced a
Page 7
new N∗R action, so we can discard everything after it) or lead to the ui's
being disabled, in which case we have succesfully turned the Mi action into
an N action and again turned the extended execution into an execution that
ends with N∗R. Repeating this for each Miaction, moving from right to left,
produces the desired execution of the reduced system.
We now turn to the formal proof of the reduction theorem (19). We push u's
left (lines 1-2) where they are eliminated by the initial p (line 3), push M's to
the left of R's (line 4), condense the R's to a single R (lines 5-6), and finally
turn the M's into N's (lines 7-8):
p (u + v)∗q ≤ N∗R
p (u + v)∗q
p (u + M + R)∗q
p u∗(M + R)∗q
(M + R)∗q
M∗(1 + R) q
{M N∗R ≤ N∗R (21); (* ind)
{v ≤ M ≤ M + R
{(M + R) u ≤ (1 + u) (M + R) (20);(2)}
{p u = 0 (16);p ≤ 1
{R R ≤ R, so R∗= (1 + R)
{(1 + R) q = R
(20) says that a u moves to the left of an M or R (but may disappear in the
(M + R) u ≤ (1 + u) (M + R)
(M + R) u
M u + R u
M u + R
(+i,j : Mjui) + R
(+i,j : (1 + ui) (Mj+ R)) + R
(1 + u) (M + R)
{R = R ?, so R u = R ? u ≤ R ? = R}
{Mjui≤ (1 + ui) (Mj+ R)) (25)
(21) shows that N∗R actions act as a factory for uiactions until they either
produce a discipline violation (q) or until they produce enough ui's to turn the
Mito their left into an N.
MiN∗R ≤ N∗R
{(22);(? ind)
Mi(uiq) ? (pi+ uiq) N∗R
Mi(uiq)∗(pi+ uiq) N∗R
Mi(pi+ uiq) N∗R
(Mipi+ Miuiq) N∗R
(Mipiq + Miq) N∗R
(N + Miq) N∗R
N N∗R + Miq N∗R
{N∗R ≤ (uiq)N∗R + (pi+ uiq)N∗R
{(uiq)ω= 0 (11)
{q ≤ 1; Miu∗
{Miui≤ Mi(3); Mipi≤ Mipiq + Miq}
{Mipiq = Ni(4); Ni≤ N(8)
{Miq N∗R ≤ Miq ? ≤ R (9)
i= Mi(3)
Page 8
(22) and (23) show that N∗R generates a ui(unless pialready holds, or the
discipline has already been violated).
N∗R ≤ (uiq) N∗R + (pi+ uiq) N∗R
(pi+ ui) N∗R
(pi+ uiq + uiq) N∗R
(uiq) N∗R + (pi+ uiq) N∗R
N∗R ≤ (pi+ ui) N∗R
N∗(1 + M) q ?
N∗(1 + M) q (pi+ ui) ?
N∗(1 + M) (pi+ ui) q ?
N∗(pi+ ui) (1 + M + R) q ?
N∗(pi+ ui) R
(pi+ ui) (N + R)∗R
(pi+ ui) N∗R∗R
{R R ≤ R; (* ind)
(pi+ ui) N∗R
{N∗R ≤ (pi+ ui) N∗R(23)}
{ui= uiq + uiq
{1 ≤ pi+ ui? (17)
{q pi= piq; q ui≤ uiq (18)
{M (pi+ ui) ≤ (pi+ ui) (M + R), (25)}
{(1 + M + R) q ? ≤ R (9)
{N (pi+ ui) ≤ (pi+ ui) (N + R) (24); }
Finally, (24) and (25) show that (pi+ui) commutes left past an N or M (possibly
changing them into R's).
Nj(pi+ ui) ≤ (pi+ ui) (N + R)
Nj(pi+ ui)
Mjpj(pi+ ui)
Mj(pi+ ui) pj
(pi+ ui) (Mj+ R) pj
(pi+ ui) (Mj+ R) pj(q + q)
(pi+ ui) (N + R)
{Nj≤ Mjpj(4)
{pjpi= pipj; pjui≤ uipj(12)(16)
{Mj(pi+ ui) ≤ (pi+ ui) (Mj+ R), (25)}
{1 = q + q
{Mjpjq ≤ N (4)(8); Mjq ≤ R (9)
Mj(pi+ ui) ≤ (pi+ ui) (Mj+ R)
i = j :
Mi(pi+ ui)
(pi+ ui) (Mi+ R)
{pi≤ 1; Miui≤ Mi(3)
{vi= pivi(16), so Mi= piMi(3)}
i ?= j :
Let [x] = x + x q ? + q ?; then
Mj(pi+ ui)
vj(pi+ ui) [uj]∗
vj(pi+ ui) [u∗
(pi+ ui) [vj] [u∗
(pi+ ui) (Mj+ R)
{uj(pi+ ui) ≤ (pi+ ui) [uj] (12)(14); (1)}
{[uj]∗= [u∗
{vj(pi+ ui) ≤ (pi+ ui) [vj] (13)(15)
{[vj] [uj]∗≤ Mj+ R
j(pi+ ui)
j] (2)
Page 9
4System Model and Synchronization Discipline
We define a simple model of concurrent systems that use mutual exclusion for
access to selected variables, and we prove that our reduction theorem applies
to these systems. This model is intended to be the simplest one that retains all
relevant aspects of concurrent programming languages, such as Java. It can be
modified and generalized in various ways with little effect on our results.
Each shared variable is classified as protected or unprotected. There are no
constraints on how unprotected variables are accessed. The synchronization dis-
cipline requires that mutual exclusion be used for access to protected variables.
Any combination of synchronization mechanisms (locks, condition variables,
semaphores, barriers, etc.) can be used to provide the mutual exclusion, pro-
vided the scheme can be captured by exclusive access predicates. For each pro-
tected variable x and each thread i, there is an exclusive access predicate ex
The synchronization discipline requires that ex
i can execute a transition that accesses x. Mutual exclusion is expressed by the
requirement that, for every variable x and every two distinct threads i and j, ex
and ex
Formally, a system is a tuple ?Θ,Vunsh,Vprot,Vunprot,T,I,e? where
Θ is a set of threads (thread identifiers). i and j range over Θ.
Vunshis a set of unshared variables, i.e., variables that appear in transitions of
at most one thread.
Vprot is a set of variables declared (possibly incorrectly) to be "protected",
i.e., there are synchronization mechanisms that ensure mutual exclusion for
accesses to these variables. For each variable x ∈ Vprot and each thread i,
there is an exclusive access predicate ex
Vunprot is a set of (possibly shared) variables, called "unprotected variables".
No assumptions are made regarding synchronization for accesses to them.
a guarded command g → c, where the guard g is a predicate over Vguard, and
c is built from assignments over V , sequential composition, and conditionals
(if-then and if-then-else).
I is a predicate over V . I characterizes the initial states.
e is a family of (possibly incorrect) exclusive access predicates ex
Guards are used for synchronization (blocking). Conditionals in commands
are used for sequential control flow. For convenience of analysis, protected vari-
ables cannot appear in guards. This is reasonable because the synchronization
mechanisms that protect the variables, not the protected variables themselves,
should be used to achieve the necessary synchronization. The value of a pro-
tected variable v can be copied into an unshared or unprotected variable, and
the latter variable can be used in a guard, or v can be moved from Vprot to
Vunprotand then used in a guard directly.
Fix a system. A state is a mapping from variables to values. Let Σ be the set
of states. We also use states as maps from expressions to values, with the usual
meaning (homomorphic extension).
ihold in states from which thread
jare mutually exclusive (i.e., cannot hold simultaneously).
iTiis a set of transitions, where Tiis the set of transitions of thread i.
Let V = Vunsh∪Vprot∪Vunprotand Vguard= Vunsh∪Vunprot. A transition t is
iover V .
Page 10
A transition t is enabled in state s if its guard is true in s. An execution is a
finite or infinite sequence σ of states such that σ(0) satisfies I and every pair of
consecutive states in σ is in [[t]] for some transition t.
A transition is visible if it (i) contains an occurrence of a variable in Vunprot
or (ii) might change the value of an exclusive access predicate. Other transitions
are invisible. This classification of transitions determines the transition relations
uiand viand the predicates pi.
A system is well-formed if the following conditions hold.
WF-initVis. The initial transitions of each thread are visible, i.e., I ⇒ p. (This
ensures that the conclusion of the reduction theorem applies to all reachable
states of the original system.)
WF-sep. Visible and invisible transitions of each thread are separate, i.e., can-
not be executed from the same state. Formally, (∀i : domain(ui)∩domain(vi) =
WF-acc. Internal non-determinism in a transition (i.e., non-deterministic choices
that do not affect the ending state) does not affect the set of variables ac-
cessed by the transition or the order in which those variables are first ac-
cessed. (This ensures well-definedness of acc in Section 4.1 and of x in case
2 of the proof of (15) in Section 5.)
WF-finiteInvis. No thread has an infinite execution sequence containing only
invisible transitions. Formally, (∀i : uω
WF-initExcl. For each protected variable x, the exclusive access predicates for
x are initially disjoint, i.e., I ⇒ disjoint(ex), where disjoint(ex) = ¬(∃i,j :
i ?= j ∧ ex
WF-endExcl. A thread cannot take away another thread's exclusive access to a
variable. Formally, for an exclusive access predicate ex
of thread j cannot falsify ex
i= 0).
i∧ ex
iand j ?= i, transitions
4.1Mutual-Exclusion Synchronization Discipline
The synchronization discipline requires that, for every variable x ∈ Vprot, (i) a
transition of thread i executed from a state s may access x only if s |= ex
(ii) disjoint(ex) holds in every reachable state.
Let acc(s1,t,s2) denote the set of variables accessed by execution of transition
t from state s1to s2. The set of accessed variables may depend on which branches
of conditionals are taken. The ending state s2is included as an argument to acc
because t may be non-deterministic. WF-acc ensures that acc is well-defined.
Since guards do not contain protected variables, acc(s1,t,s2) = ∅ if t is disabled
in s1(otherwise, acc(s1,t,s2) would be the set of protected variables in t's guard).
We augment the system with a predicate q that holds iff the synchronization
discipline has been violated. Formally, q is the least predicate that satisfies
∀i : ∀x ∈ Vprot: ∀t ∈ Ti: ∀?s1,s2? ∈ [[ti]] : s2|= q ⇐⇒
((x ∈ acc(s1,t,s2) ∧ s1?|= ex
The third disjunct in (26) implies that q is monotonic, i.e., it can be truthified
but not falsified.
i, and
i) ∨ s2?|= disjoint(ex) ∨ s1|= q).
Page 11
Maintaining q involves accesses to q and accesses to variables that occur
in exclusive access predicates. These accesses are ignored when determining
5Proof that the Reduction Theorem Applies to the
Mutual-Exclusion Synchronization Discipline
We prove in [SC02] that well-formed systems satisfy the hypotheses (11)–(18) of
the reduction theorem. Most of the proofs are straightforward. Here we consider
only the most interesting one.
Proof of (15). Let tibe an invisible transition of thread i, and let tjbe a visible
transition tjof thread j, and let s1, s2, and s3be states such that ?s1,s2? ∈ tjand
?s2,s3? ∈ ti. Let ti= gi→ ciand tj= gj→ cj. tjdoes not enable ti, because cj
and giaccess disjoint sets of variables (because tiis invisible and hence does not
access unprotected variables, and protected variables do not appear in guards).
tidoes not disable tj, for analogous reasons. Thus, there exist states s?
such that ?s1,s?
so s?
that s?
correspond to the summands in (15)) holds: (i) s?
left-commutes with cj), or (iii) s?
case 1: A = ∅. This implies that
acc(s1,tj,s2) = acc(s?
because the same branches of conditionals will be executed from either source
state. This and A = ∅ imply that (∀x ∈ acc(s2,ti,s3) : s1(x) = s2(x)) and
(∀x ∈ acc(s1,tj,s2) : s1(x) = s?
any) in the transitions in the same way when executing tifollowed by tjas when
executing tjfollowed by tito reach s3, we obtain s?
v ∈ V \ {q}. We must exclude q here because acc does not reflect accesses used
to update q, as stated in Section 4.1.
case 1.1: s3|= ¯ q. If s?
then condition (iii) holds.
case 1.2: s3|= q. We show that s?
case 1.2.1: s1|= q. This and monotonicity of q imply s?
case 1.2.2: s1|= ¯ q. This and s3|= q imply that the synchronization discipline
is violated either by execution of tjfrom s1or by execution of tifrom s2. The
violation corresponds to the first or second disjunct in (26) being true (the third
disjunct just makes q monotonic). Thus, there are 2 × 2 cases to consider.
case 220.127.116.11: (∃x ∈ Vprot : x ∈ acc(s1,tj,s2) ∧ s1 ?|= ex
definition of q implies s?
case 126.96.36.199: (∃x ∈ Vprot : x ∈ acc(s2,ti,s3) ∧ s2 ?|= ex
definition of q implies s?
2and s?
2? ∈ tiand ?s?
3are not uniquely determined by these conditions. It suffices to show
2and s?
3? ∈ tj. Transitions may be non-deterministic,
2and s?
3can be chosen so that one of the following conditions (which
2|= q, (ii) s?
3= s3 (i.e., ci
3|= q. Let A = acc(s1,tj,s2) ∩ acc(s1,ti,s?
3) ∧ acc(s2,ti,s3) = acc(s1,ti,s?
2(x)). Thus, by resolving non-determinism (if
3(v) = s3(v) for all variables
3|= ¯ q, then s?
3= s3, i.e., condition (ii) holds. If s?
3|= q,
2|= q or s?
3|= q.
3|= q.
j). (27) implies x ∈
j, so s?
3). ti is invisible, so it cannot truthify ex
3|= q.
2?|= ex
j. Thus, the
i). (27) implies x ∈
i, so s1?|= ex
2). WF-endExcl implies tj did not falsify ex
2|= q.
i. Thus, the
Page 12
case 188.8.131.52: (∃x ∈ Vprot : s2 ?|= disjoint(ex)). ti is invisible, so it cannot
falsify any exclusive access predicate, so s3?|= disjoint(ex). s3and s?
same values for all variables except q, so s?
of q implies s?
case 220.127.116.11: (∃x ∈ Vprot: s3?|= disjoint(ex)). s3and s?
for all variables except q, so s?
case 2: A ?= ∅. Let x be the variable in A first accessed by execution of tj
from s1to s2.
case 2.1: s1|= ex
case 2.1.1: s1|= disjoint(ex). The hypotheses of cases 2.1 and 2.1.1, together
with i ?= j, imply s1?|= ex
case 2.1.2: s1?|= disjoint(ex). This and the definition of q imply s1|= q. This
and monotonicity of q imply s?
case 2.2: s1?|= ex
because the first access to x by tjprecedes execution of conditionals in tjwhose
conditions could be affected by execution of tifrom s1. tiis invisible, so it cannot
truthify ex
3have the
3?|= disjoint(ex). Thus, the definition
3|= q.
3have the same values
3?|= disjoint(ex). Thus, the definition of q implies
3|= q.
j. By definition of A, x ∈ acc(s1,ti,s?
i. This and x ∈ acc(s1,ti,s?
2) imply s?
2|= q.
2|= q.
j. The definitions of A and x imply that x ∈ acc(s?
j, so s?
2?|= ex
j. Thus, the definition of q implies s?
3|= q.
This section contains examples of systems for which the current reduction is effec-
tive (i.e., it reduces the number of reachable states) and the reduction in [Sto02]
is not effective. In general, our method is effective whenever some variables can
be classified as protected. These examples are based mainly on descriptions in
[SBN+97] of code in real systems.
Semaphores. A user thread sends a request to a device driver thread, asking
the device driver to store data in a buffer b, and then waits for the result by
invoking sem.down(), where sem is a semaphore, initialized to zero. The device
driver thread receives the request, waits for the device to supply the data, stores
the data in b, and then calls sem.up(). The buffer b can be classified as protected.
For example, eb
a statement after the call to sem.down(), and eb
counter of the device driver thread points to a statement before the call to
sem.up(). The semaphore ensures disjointness of eb
userholds when the program counter of the user thread points to
driverholds when the program
userand eb
Memory Re-use. Some systems re-use objects (or structures) by placing them on
a free list when they are not in use. These objects may be protected by different
locks each time they are re-used, violating the locking discipline of [Sto02]. For
example, consider a file system in which blocks in a file are protected by the lock
associated with (the i-node of) that file, and blocks on the free list are protected
by the lock associated with the free list. A block may be in a different file, and
hence protected by a different lock, each time it is re-used. Let mF denote the
lock associated with the free list. Let mf denote the lock associated with file f.
The exclusive access predicate eb
ifor a block b might be
Page 13
(onFreeList(b) ∧ mF.owner = i) ∨ (∃ file f : allocatedTo(b,f) ∧ mf.owner = i)
Master-Worker Paradigm. In the master-worker paradigm, a master thread as-
signs tasks to worker threads. Typically, each task is represented by an object
created by the master thread and passed to a worker thread. The master thread
does not access a task object after passing it to a worker. Task objects can be
classified as protected. Suppose each worker thread w has a field w.task that
refers to the worker's task. For a task object x, the exclusive access predicate
w.task = x.
masterholds before x has been passed to a worker thread, and ex
wholds when
7Comparison to Traditional Partial-Order Methods
This section demonstrates that our method has advantages over traditional
partial-order methods even for some simple systems for which precise static anal-
ysis of transition dependencies is feasible. Consider a system with two threads
that use monitors m0and m1as locks and use an integer variable y to implement
a barrier. Let uppercase letters denote control points. Let guard → stmt denote
a transition that blocks when guard is false and can execute stmt when guard is
true. For i ∈ {0,1}, the code for thread i is
Am0.acquire();Bx0:= i;Cm0.release();Dm1.acquire();Ex1:= i;
Fm1.release();Gy + +;Hy = 2 → skip;Ixi= iJ
In the initial state, xj= j and y = 0, and both threads are at control point A.
xj is a protected variable, with exclusive access predicate exj
i) ∨ (y = 2 ∧ i = j). y is not protected.
This system has 106 reachable states. With the reduction in this paper,
transitions that update x0or x1are invisible; other transitions are visible. The
reachable states of the reduced system are the reachable states of the original
system in which every thread is ready to perform a visible transition or is at its
final control point. There are 62 such states.
Traditional partial-order methods based on persistent sets [God96] (or ample
sets [CGP99]) can also significantly reduce the number of explored states but
do not achieve the same benefits as our reduction. For concreteness, we compare
our method to selective search using the conditional stubborn set algorithm
(CSSA) [God96]. We always resolve non-determinism in CSSA in a way that
yields a minimum-size persistent set. CSSA is parameterized by dependency
relations on operations. For acquire and release, we use the might-be-the-first-
to-interfere-with relation in [Sto02, Fig. 3]. For accesses to y, we use the minimal
might-be-the-first-to-interfere-with relation, based on the dependency relation on
operations in which an increment to y is dependent with the condition y = 2
only in states in which the increment changes the truth value of the condition.
The selective search (using CSSA) explores 77 states. To illustrate why it
explores more than the 62 states explored by our method, consider the reach-
able state s in which thread 0 is at control point D and thread 1 is at control
= (mj.owner =
Page 14
point B. With the reduction in this paper, the transitions that update x0or x1
are invisible, so the system passes through this invisible state by executing the
enabled transition of thread 1; the enabled transition of thread 0 is not executed
in s. In contrast, the selective search explores both enabled transitions in s, as
explained in detail in [SC02].
This example can be generalized to show our method outperforming the
selective search by an arbitrary amount: simply insert additional transitions
that access x0before the transition m0.release() in thread 0.
The selective search exploits some independence that our method does not,
in particular, independence of release with acquire and release, and indepen-
dence of acquire with acquire in some states. One way to obtain the benefits
of both methods is to apply selective search to the reduced system. This works
for systems for which sufficiently precise static analysis of dependencies between
transitions is feasible (cf. Section 1). Another approach is to extend our method,
e.g., to incorporate the specialized treatment of monitor operations in [Sto02]
that allows release to be classified as invisible.
8How to Use the Reduction
The intended methodology for using the reduction is as follows.
1. Guess the set Vprot of protected variables and the exclusive access pred-
icates ex
reduced system, in which the transition relation of thread i is Ni, defined in (4).
2. Augment the reduced system with a predicate q, as described in Section
3. Check whether ¯ q holds in all reachable states of the reduced system. Check
this using your favorite technique: model checking, theorem proving, hand wav-
ing, etc.
4. If so, then the reduction theorem implies that ¯ q holds in all reachable
states of the original system, i.e., the guesses in Step 1 are correct. Traditional
reduction theorems can now be used to infer other properties of the original
system from properties of the reduced system.
5. If not, then for some variable x in Vprot, the reduced system has a reachable
state in which the mutual-exclusion synchronization discipline for x is violated.
Revise the guess for ex(using the path to the violation as a guide) or re-classify
x as unprotected, and then return to Step 1.
i. These guesses determine visibility of transitions and hence define a
9 How to Use the Reduction Automatically for Systems
with Monitors
The methodology in Section 8 is automatic except that the user must guess
Vprot and the exclusive access predicates. For systems that use monitors for
synchronization, this step, too, can be automated, based on the observation
Page 15
that the exclusive access predicates typically have the form ex
= initx
initx= (∃i ∈ Θ : initx
and where the initialization predicate initx
that initializes x. Note that the lock protecting a variable does not need to be
held while the variable is being initialized.
Initialization predicates for variables in systems that correspond to Java pro-
grams can be guessed automatically: the initialization predicate holds when the
thread's program counter is in the appropriate class initializer (for static fields)
or the appropriate constructor invocation (for instance fields).
To use (29), we need to identify, for each variable x in Vprot, a monitor m that
protects x. This can be done automatically by running a variant of the lockset
algorithm [SBN+97] during state-space exploration of the reduced system.
i= eapx,m
, where
i∨ (i = m.owner ∧ ¬initx)
iholds while thread i is executing code
10 Experimental Results
We implemented the similar reduction of [Sto02] in Java PathFinder (JPF)
[BHPV00] and measured the benefit of the reduction for several programs with
monitor-based synchronization. HaltException and Clean [BHPV00, Figure 1]
are small "synchronization skeletons" supplied by the developers of JPF. Xtango-
DP and Xtango-QS are animations of a dining philosophers algorithm and quick-
sort, respectively, from http://www.mcs.drexel.edu/˜shartley/; we replaced java.-
awt methods with methods having empty bodies, due to limitations of JPF. The
lockset algorithm was used in all experiments. With negligible manual effort (to
write a few lines of config files), the reduction decreases memory usage by a fac-
tor of 1.4MB/0.77MB ≈ 1.8 for HaltException, 4.3MB/2.2MB ≈ 2.0 for Clean,
609MB/236MB ≈ 2.6 for Xtango-DP, and 344MB/101MB ≈ 3.4 for Xtango-
QS, compared to model checking with JPF'S default granularity, which executes
each line of source code atomically. In a real JVM, bytecode instructions execute
atomically. Our reduction preserves that semantics. JPF's source-line granularity
does not: it can miss errors. Compared to bytecode granularity, our reduction
decreases memory usage by a factor of 13.9MB/0.77MB ≈ 18 for HaltExcep-
tion and at least 1800MB/101MB ≈ 18 for Xtango-QS ("at least" reflects an
out-of-memory exception).
Acknowledgements. We thank Shaz Qadeer for telling us about exclusive ac-
cess predicates, Liqiang Wang for doing the experiments with JPF, and Patrice
Godefroid for comments about partial-order methods.
[BR01]C. Boyapati and M. C. Rinard. A parameterized type system for race-free
Java programs. In Proc. 16th ACM Conference on Object-Oriented Program-
ming, Systems, Languages and Applications (OOPSLA), volume 36(11) of
SIGPLAN Notices, pages 56–69. ACM Press, November 2001.


text:
Well, it appears that the mystery of the Halo 3 Hayabusa helmet has already been solved with persistent fanboys over at Halo3Planet.com figuring out how to obtain the "I Would Have Been Your Daddy" skull.
To refresh your memory, the IWHBYD skull was the only skull that needed to be found, because the Hayabusa helmet (as part of Halo 3's armor permutations) can only be unlocked when all thirteen Halo skulls have been found. Thus, IWHBYD is uber important. Anyhoo, like we said, the skull has been found and is quite the tricky little devil to get. Full instructions can be read over at Halo3Planet.com, but in brief you'll have to make your way to "The Covenant" level and jump through seven Halo holograms in order to play the Halo theme song music. Crazy huh? We're sure Bungie thought they could keep the wraps on the IWHBYD skull for a while, but never underestimate the fanaticism that is the Halo community. Now go, go get your thirteen skulls and unlock the Hayabusa helmet ... your l33t status is in jeopardy!
[Thanks, to everyone who sent this in]
Featured Stories
Off the Grid: The Witcher Adventure Game and Star Wars Imperial Assault
Posted on Feb 3rd 2015 2:15PM


text:
Jason MottJason Mott talks about new book, 'Resurrection' season 2Submitted by Randy Aldridge on Mon, 09/29/2014 - 7:02am.READ MORE:
Jason Mott, the author of the bestseller "The Returned," is back with his newest book "The Wonder of All Things" to discuss miracles and how they affect life in a small Southern town.
Full story... » Area author's novel, ideas inspire ABC series that comes to life SundaySubmitted by Ashley Jacobs on Fri, 03/07/2014 - 1:43pm.READ MORE:
An area author who first transformed his dreams into a realty for readers everywhere will soon see that same dream come to life in an even bigger way.
Full story... » Wilmington author's book becomes TV seriesSubmitted by Ashley Jacobs on Wed, 09/04/2013 - 7:02am.READ MORE: » |


text:
The Shocker Hand Costume
The Shocker Hand Costume lets you dress like the raunchy hand gesture that makes everyone squirm! This comfy, foam costume looks like a huge hand doing "The Shocker" sign, so you'll be a walking piece of dirty humor. More
Special 10% Discount for Find Gift shoppers! Enter Coupon Code FINDTEN at checkout. Limited Time Only!$33.95 | MORE DETAIL |
Featured Offers
Personalized Mens Gifts
Frames, Keepsakes, Apparel & more! Free Personalization, Fast Shipping


text:
CUSTOMER SERVICE: 1-617-262-0200 STORE FRONT: 234 Huntington Ave, Boston, MA 02115 (Tues-Sat 12PM-8PM) | |
Raw Spitt: Raw SpittRe-IssueCD
Price: $14.99
Add to cart Usually ships within 3 business days. Not available for in-store pick-up
| ||||||||
| ||||||||
Product Details
Producer: Swamp Dogg SummaryCharlie Whitehead, a.k.a. Raw Spitt, 1970 first full length, produced by Swamp Dogg for Canyon records, and a highly sought after collectors' album of unconventional southern soul. The CD version includes 5 bonus tracks and new liner notes penned by Swamp Dogg. |
Track Listing | ||||||
More Items From: Raw Spitt & Alive Records |
Reviews and Comments


text:
Photo Galleries: Nikki Delano on Stage at Dames n' GamesPhotographer: Gordon/EMMreport.com Published: December 29, 2014 |
Photo Galleries: 'Nikki Benz Jungle Fever'Photographer: Jules Jordan Video Published: November 04, 2014 |
Photo Galleries: Nikki Delano at Dames n' GamesPhotographer: Gordon/EMMReport.com Published: September 08, 2014 |
Photo Galleries: Nikki Delano at Bare 'N LegalPhotographer: emmreport Published: April 08, 2014 |
Photo Galleries: Mary Carey, Nikki Benz & Rubberdoll at Hustler ClubPhotographer: Rick Garcia Published: February 08, 2014 |
Photo Galleries: School's in Session With Nikki Benz & Jessica JaymesPhotographer: NikkiBenz.com Published: October 31, 2013 |
Photo Galleries: Vicky Vette and Nikki Benz in 'Heat'Photographer: Rokkerr Dave Published: August 16, 2013 |
Photo Galleries: Nikki Daniels, Ron Jeremy Birthdays at Porn Star KaraokePhotographer: Ralph Logan/EMMreport.com Published: March 18, 2013 |
Photo Galleries: Nikki Delano Halloween Party at Cloud 9Published: November 03, 2011 |
Profile: Nikki Delano
Movies: Nikki Benz: SuperstarSynopsis:
Movies: Nikki Benz UnleashedSynopsis: "Stretch My Balloon Knot Asshole" "Ring the Bell for Service" "On Call Masseuse" "A Means of Motivation" "Happy Birthday Nikki" "A Helping Hand"
Movies: Nikki's HouseSynopsis: Nikki lands a job house-sitting for Kristina Rose. The one rule is she has to make sure Kristina's expensive vase is not touched. Within the first five minutes of house-sitting, Nikki breaks it masturbating. When she finds out it'll take $8000 to replace it, she hatches a scheme to raise the cash...subletting the house, pussy included! B. Skow reprises his crazy-hot, tease-and-please shooting style with Nikki Jayne, in this two-anal, four-facial, fuck-fest. You in? You better not have a vase nearby...
Profile: Nikki Jayne
Profile: Nikki Benz
Event: Gina Lynn & Nikki Benz Host The 'Wing Bowl' In PA
Gina & Nikki will be hosting Delilah's annual 'Wing Bowl' party. |
Profile: Nikki Nova
Article: Nikki Benz Files Anti-SLAPP Motion Challenging Lisa Ann TROPublished: February 27, 2015 An Anti-Slapp motion is an attempt to strike a frivolous lawsuit, which is what Benz claims Lisa Ann's action against her amounts to. The motion... |
Company News: Meet Nikki Delano This Weekend at AdultconPublished: February 25, 2015 Exotic Latina adult star Nikki Delano to make rare Los Angeles appearances during Adultcon. |
Company News: Nikki Delano Featuring at Sapphire NYC Friday NightPublished: February 18, 2015 Nikki Delano is headed back to the Big Apple for another packed house at Sapphire during Exotic Fridays. |


text:
Back in 2012, Lincoln claimed its comeback bid was finally underway with the new-for-2013 MKZ. But don't you believe them – the renaissance won't actually begin in earnest until the shapely compact crossover seen here reaches showrooms in big numbers. That's because while the four-door MKZ...
- Reviewed by Chris Paukert
"Sharp, distinctive styling; spacious cabin; powerful and fuel-efficient engine options; cutting-edge electronics.


text:
This website uses cookies to improve the usability of the site. By continuing to browse our site you agree to our use of cookies. To find out more about the cookies we use or to disable any cookies, visit our cookies page.
By Clare Newman
Monday, December 24, 2012
Archers Tina Grace and her husband, Lee, who both won at the Hampshire County Championships. Picture by Jennifer Burton.
HUSBAND and wife archers, Lee and Tina Grace, stole the show at the Hampshire County and Open Championships.
In the first day's 18m FITA competition, Lee won the men's compound class, posting scores of 563 and 565, and setting Hampshire records for the single score and combined.
Tina, who has only been shooting for just over a year, won the ladies' barebow, with scores of 352 and 373, setting a Hampshire record for the combined total.
In the second day's Portsmouth competition, Lee won the men's compound again, with scores of 580 and 587, a PB and club record. Tina also won the ladies' barebow with scores of 462 and 425, a PB and club record for the single round.
The couple, from Bembridge, are members of the Wight Bowmen.
Lee, who used to be a county champion and county team member when he lived in Buckinghamshire, said: "I'd done well in the outdoor championships earlier in the year and then we decided to have a go indoors. I thought I might have half a chance.
"I was so proud of Tina for how well she did. She was in some pretty good company, in fact she was shooting next to someone from the Brazilian Olympic recurve team."
More Sport
Monday, March 2, 2015
Sunday, March 1, 2015
Saturday, February 28, 2015
Friday, February 27, 2015
Monday, February 23, 2015
Sunday, February 22, 2015
Saturday, February 21, 2015
1 - 2 - 3 - 4
Most Read
Wednesday, March 4, 2015
Thursday, March 5, 2015


text:
Getting Started
SF State has always been commited to
providing "its students, faculty, and staff
with international experiences, perspectives, and competencies" as stated in the Goal IV of its stategic plan. Here's why you should consider studying abroad and how to get started.
Currently enrolled in an MBA program, you are already investing for your future, gaining significant management and business skills and advancing on your path to a fulfulling career. Many companies seek employees with international and cross-cultural skills, such as those you will develop on an SF State certified study abroad program. Adding international experience to your resume will expand your employment opportunities and, consequently, your income potential. But you will also embark on a self-exploratory journey that will shape you as an individual.
STEP 1Familiarize yourself with the following unique benefits of SF State Certified Study Abroad programs: If you are able to make your way onto SF State's main campus, you can attend one of our several weekly information meetings. Meetings are hosted four times a week at the following times:
STEP 2Research and identify a program that corresponds to your academic goals by visiting the MBA Study Abroad Programs page. Make a list of the MBA requirements you have yet to complete and compare it to the course offerings at the host universities. |
STEP 3Meet with your Study Abroad Advisers on the downtown campus. |
Jeffrey Chun |
Sanjit Sengupta |
Assistant Director, Graduate Business Programs (and academic advisor for MBA study abroad) |
Ph.d Professor of Marketing (and faculty advisor for MBA study abroad) |
Email: email@example.com |
Email: firstname.lastname@example.com |
Office Hours: M - TH: 9:30 am - 7 pm; F: 9:30 am - 4:30 pm |
Office Hours: M 5-6; TH 1245-145, 515-615 |
Location: DTC 552B Office Phone: 817-4322 |
Location: DTC 572 Office Phone: 817-4366 |


text:
March 11, 2011
A Castle in Timberville, VA
A friend mentioned that she had spotted a castle from route 211 near Timberville. So the next time I drove through there, I looked for it.
It turns out to be a private residence near the old creamery. Not your typical Shenandoah Valley structure, it does appear to have a nice pastoral view. It's been there for about a year.
Subscribe to:
Post Comments (Atom)


text:
Sign in
Sector: Arrangement Of Transportation Of Freight And Cargo Region: United Kingdom
: | London Stock Exchange: INB
Similar to: Bremer Lagerhaus Gesellschaft AG, Irish Continental Group Plc, Nurminen Logistics Oyj
Helsinki, FI
Nurminen Logistics provides high-quality logistics services, such as railway transports, terminal services, forwarding, special and heavy transports and value added...
Dublin, IE
Irish Continental Group Plc operates ferries and provides logistic management services. The company is engaged in the transport of passengers...
Bremen, BR, DE
Bremer Lagerhaus Gesellschaft AG engages in the provision of logistic services. The company operates through the following business divisions: Automobile...
InterBulk Group Plc Investor Relations 1 Redwood Crescent East Kilbride Glasgow , LO G74 5PA United Kingdom Phone:44.13.5557.5000 SIC Code: 4731
Send me a reminder
before the event.


text:
Dwight Silverman's TechBlog
Upgrade your geek with Houston Chronicle technology writer Dwight Silverman
Linkpost | 6.12.2011
• U.S. Underwrites Internet Detour Around Censors – The "shadow" Internet would allow dissidents to get around efforts by oppressive governments to censor them. • IMF Computer System Infiltrated by Hackers Said to Work for Foreign State – The attack reported yesterday appears to have been the work of people hacking on behalf of a [...]
[Read More]
Linkpost | 6.11.2011
Updated 3:31 p.m. • I.M.F. Hit by Sophisticated Cyberattack – The attack had been going on for several months. • Lodsys sues another ten companies including Adidas, Best Buy, Best Western and Black & Decker Original post • Attacks on Sony, others show it's open hacking season – No one is immune. Also Why we secretly love LulzSec and LulzSec [...]
[Read More]
It's open-comment Friday
Hey, kids! It's Friday, and you know what that means: Open comments on TechBlog!
Leave a comment about anything having to do with personal technology, and I'll approve it.
Come back later to see what others had to say about what you had to … [Read More]
Leave a comment about anything having to do with personal technology, and I'll approve it.
Come back later to see what others had to say about what you had to … [Read More]
Prey: Find out who's got your missing computer, for free
When my son's apartment was burglarized in March and his MacBook Pro stolen, I immediately wished it had some kind of tracking program installed on it. In fact, none of my family's notebooks have such software. Yeah, everyone's iPhones have Find My iPhone enabled, but we've not done anything to protect our laptops. With the [...]
[Read More]
Linkpost | 6.9.2011
Updated 10:17 a.m. • HP TouchPad shipping July 1 for $499, pre-orders begin June 19 — and AT&T model coming soon – A 32-GB model will sell for $599. • Apple Reverses Course On In-App Subscriptions – A subscription no longer must be "the same price or less than it is outside the app". • [...]
[Read More]
MetroTwit: the most promising Twitter client for Windows
If you're a Mac user who's on Twitter, you're in luck. There are a slew of great, native Twitter clients for the Macintosh, not the least of which is offered by Twitter itself. Windows users, however, don't fare as well. For some reason, there aren't as many elegantly designed, feature-rich Twitter clients for the largest [...]
[Read More]


text:
Schoolfamily.com - Helping parents help their kids succeed at school
I think that my child might have ADHD. His kindergarten teacher did not think this was the case but now that we are getting closer to 1st grade I am getting more worried. What should I do?
Top Ten Articles
- End Homework Hassles
- Top 20 Destinations for Learning
- Kindergarten Academics: What To Expect
- 1st Grade Social Changes: What To Expect
- A Dad Who Makes a Difference
- One Last Dance With My Daughter
- Homework: Why It Matters
- "It's Worth Every Minute"
- Help Your Child Build Writing Skills
- 4th Grade Social Changes: What To Expect
SchoolFamily.com Shortcuts
Popular Topics
Popular Printables
School Family Media properties: PTO Today.com | SchoolFamily.com | schoolfamilynights.com | schoolbakesales.com


text:
Register | Home | Forums | Active Topics | Topic Finder | Photos | Members List | Search | Today's Posts | Mark Forums Read | Auto Escrow | Auto Loans |
LinkBack | Thread Tools |
06-21-2008, 12:27 PM | #1 (permalink) |
Member Number: 5848
Join Date: Aug 2005
Location: Holland, Michigan
Visit: My Garage
Posts: 457
Trader Score: 0 reviews
Rep Power: 0 |
After more than a week passing and not a single reply to my request for help on a noisy sunroof I decided to go it alone and remove the complete assembly from the car (05 Sable). Cleaned the tracks and drive springs with brake cleaner and air pressure, re-lubed, reassembled and installed back in the car. Same problem, loud clicking and popping noises, so out it came again. This time I took a good look at the drive area and what makes it work and decided that it needed some shims placed strategically behind the drive spring flashing on either side of the drive gear. Also, added more lube on the tracks and removed the spring clips from inside the front white nylon runners to reduce friction even more. Sunroof fixed!
Works slick and smooth as new now. If anyone wants to know more about what was needed and how to make the shims and their complete dimensions just email me and I can post a complete write up on their construction and installation. Did this after days of searching for parts on the net and finding that no one wanted to do anything but sell me a new assembly for between $700.00 and $1,400.00 or a used one between two to three hundred bucks. No thanks to either of these solutions. New would still have to be installed and used would more than likely be close to having the same or similar problems. Don't be afraid of your sunroof, it won't bite. |
Sponsored Links | |||
Advertisement |
06-21-2008, 04:59 PM | #2 (permalink) |
Devoted Member
Member Number: 2818
Join Date: Apr 2004
Location: Moorhead, MN
Drives: 2009 Focus SES 5spd
Visit: My Garage
Posts: 1,143
Trader Score: 0 reviews
Rep Power: 0 |
Sounds good...sometimes we don't always know what is going on and don't want to say anything if we are not sure. It's great that you were able to fix it! Thanks for the info!
"It isn't what you drive that matters, it's how you drive it" - Jeremy Clarkson, Top Gear Ford: Taurus ('91, '01) Focus ('09) Mercury: Sable ('95) Dodge: Neon ('95) Trek: 1000SL ('07) |
06-21-2008, 05:35 PM | #3 (permalink) |
Devoted Member
Member Number: 5784
Join Date: Aug 2005
Location: Ft. Lauderdale
Visit: My Garage
Posts: 1,811
Trader Score: 0 reviews
Rep Power: 0 |
glad you were successful. sometimes you just gotta rip into something like that and see whats up.
12-23-2012, 08:28 PM | #4 (permalink) |
Junior Member
Member Number: 51881
Join Date: Dec 2012
Chapter: Northeast
Drives: 2004 Taurus SES
Visit: My Garage
Posts: 1
Trader Score: 0 reviews
Rep Power: 0 |
Would love to know exactly what you did to fix it as it sounds like I am having the same issue. However, seeing as I do not have the greatest automotive skills I am really just looking to get it closed and water tight.
12-23-2012, 09:07 PM | #5 (permalink) |
Devoted Member
Member Number: 7489
Join Date: Mar 2006
Location: Fort Myers, Florida USA
Chapter: Southeast
Drives: '90 Taurus GL Wagon 3.0L; '65 Rambler Ambassador 990 convertible
Visit: My Garage
Posts: 3,534
Trader Score: 0 reviews
Rep Power: 51 |
Congrats on solving it. I imagine sunroofs don't get much attention, being optional and all. You'd be doing everyone here a huge service by putting up some photos and a step-by-step tutorial on how you removed it from the car, what you did to repair and any tips on re-installing it.
12-23-2012, 09:33 PM | #6 (permalink) |
Crazy Devoted Member
Member Number: 10865
Join Date: Dec 2006
Visit: My Garage
Posts: 13,739
Trader Score: 1 reviews
Rep Power: 60 |
^ Necropost, lol. 4-5 yrs. old.
12-24-2012, 12:08 AM | #7 (permalink) |
N.E. Chapter Moderator
Member Number: 42443
Join Date: Oct 2011
Location: Syracuse, NY
Chapter: Northeast
Drives: 2005 Taurus SE FFV
Visit: My Garage
Posts: 2,635
Trader Score: 7 reviews
Rep Power: 29 |
I put a factory one in my car... so I know these things well! What exactly is going on with yours Jeffrey? I will do my best to help you pinpoint it.
The most common issues of these is the black plastic cracking. Inspect that piece first. When this breaks loose from the water drain or cracks, it causes all sorts of issues. Haha thread from the dead has been revived! I will gladly pull mine apart and do a tutorial.
2011 Ford Fusion SEL 3.0L DOHC V6 2005 Ford Taurus SE 3.0L FFV OHV V6 (The Beater) 2007 Ford Fusion SE 2.3L DOHC I4 (Sister's) 2006 Ford Taurus SE 3.0L OHV V6 (Sold) 2005 Ford Taurus SEL 3.0L FFV OHV V6 (Sold) 2007 Ford Taurus SE 3.0L OHV V6 (Sold) 1999 Ford Taurus SE 3.0L OHV V6 (Sold) Last edited by TaurusDailyDriver; 12-24-2012 at 12:15 AM. |
12-24-2012, 09:06 AM | #8 (permalink) |
Technical Advisor
Member Number: 1771
Join Date: Oct 2003
Location: Blythewood, SC 29016
Chapter: Southeast
Drives: 00 SEL Sedan DOHC
Visit: My Garage
Posts: 17,290
Trader Score: 7 reviews
Rep Power: 99 |
All that stupid black plastic piece does is pull the sun shade forward an inch when you close the moonroof all the way so you can put your hand on the grab handle. Otherwise, the sun shade just stays tucked behind the headliner (which you can manually just grab up and close).
Opening the sunroof there are two pieces of metal that are hit on the sunshade that are pushed back to bring the sunshade back.
--Nick -Silver Frost MC 2000 Ford Taurus SEL | V6 DOHC/AX4N | 198K - FOR SALE, See Thread: click former '87 Taurus 3.0 GL sedan, '87 Taurus 3.0 GL Wagon, '97 Taurus SHO 3.4 V8 sedan |
12-24-2012, 11:07 AM | #9 (permalink) |
Member Number: 47403
Join Date: Apr 2012
Chapter: Northeast
Drives: 2004 SES
Visit: My Garage
Posts: 358
Trader Score: 0 reviews
Rep Power: 6 |
I'll never get another car with a sun roof. I believe it's part of the reason this Taurus is the noisiest Taurus I have ever owned. Plus....I don't even use it. Came with the car when I bought it used so I had no choice.
12-24-2012, 02:28 PM | #10 (permalink) |
N.E. Chapter Moderator
Member Number: 42443
Join Date: Oct 2011
Location: Syracuse, NY
Chapter: Northeast
Drives: 2005 Taurus SE FFV
Visit: My Garage
Posts: 2,635
Trader Score: 7 reviews
Rep Power: 29 |
What is so noisy about it?
2011 Ford Fusion SEL 3.0L DOHC V6 2005 Ford Taurus SE 3.0L FFV OHV V6 (The Beater) 2007 Ford Fusion SE 2.3L DOHC I4 (Sister's) 2006 Ford Taurus SE 3.0L OHV V6 (Sold) 2005 Ford Taurus SEL 3.0L FFV OHV V6 (Sold) 2007 Ford Taurus SE 3.0L OHV V6 (Sold) 1999 Ford Taurus SE 3.0L OHV V6 (Sold) |
Sponsored Links | |
Advertisement |
Thread Tools | |