text:
Rep. Ron DeSantis (R-Fla.) introduced a bill to cancel a planned federal pay raise.
In a story about a bill to cancel a federal pay raise, an anonymous reader took issue with Rep. Darrell Issa's comparison of government and private-sector pay, asking, Where do they come up with these numbers? The average government worker has an increase of $3,328 and private sector $1,404?
Matthew Weigelt responds: The Office of Personnel Management provided the House Oversight and Government Reform Committee with data about federal employee pay. Based on that, the committee found the median federal employee pay increased by $3,164 during the pay freeze. It went from $69,550 in September 2010 to $72,714 in September 2012. The number increases to $3,328 when the committee includes seasonal and temporary employees like Census enumerators, some firefighters, or seasonal park service employees.
For the private sector's increase, the Congressional Research Service gave the committee the figures. Click here for a fact sheet from the oversight committee. The fact sheet includes some data a 2012 Congressional Budget Office report on comparisons between the two sectors. It may be useful as you think about the whole issue.
Posted by Matthew Weigelt on Feb 22, 2013 at 12:10 PM
E-Mail this page
Printable Format
Advanced Search
Meet 100 women and men who are doing great things in federal IT.
Click here for the full list
Unisys Federal Systems' Venkatapathi Puvvada, this year's Eagle award winner for industry, stresses the importance of community.
Experts tell committee that business models, not technology, are the main obstacle to better sharing across systems.
Protests have delayed SEWP V, but industry experts say the contract vehicle offers agencies service and value that are hard to find.
The power of the individual informs FCW's coverage each and every day, but with the Federal 100, we take time to really spotlight and celebrate it. Get to know each of this year's winners.
The latest version of the Cybersecurity Information Sharing Act purportedly protects companies from liability and individuals from government intrusion.
Popular CIO is headed for the private sector.
The Census Bureau hasn't established a time frame for its cloud computing plans, including testing for scalability, security, and privacy protection, as well as determining a budget for cloud services.
President Obama's proposal to boost government coordination with the private sector got a warm welcome in the House Homeland Security Committee.
The spy agency wants to better integrate cybersecurity into its traditional human intelligence operations.
Same old flawed comparison we've seen before. That someone is still using it after it's flaws have been so well exposed points to either a mental or moral inadequacy and that's an inclusive "or".
I question the background of CBO to prepare this study and the methodology employed by CBO in its particulars. Without much analysis at all, it is immediately clear that comparing averages has a distorting effect on the most telling parts of its analysis. The private sector has an 18% concentration of professionals. The Federal Government has a 31% concentration of professionals, and Federal employees lagged far behind in that category. CBO's approach to defining relevant areas and localities is undisclosed and is central to its result. The studies of anti-Government advocates prepared by outfits such as the Heritage Foundation, AEI, and Cato contain the same mysteries, or, if you read the fine print, plugs that support the conclusion they are ideologically disposed toward reaching. The CBO study does not specifically mention profit-sharing and stock options as a source of compensation. The study is static in that it fails to account for periods prior to our deep recession (or the impacts of those periods on individual financial positions), nor does it differentiate between promises made to job applicants to entice entry (which, when it comes to Federal employment, clearly includes COLAs and steps). The CBO study genuflects before the fact that some Government work has no private sector analogue, but then does not explain or cope with its relevance.
The CBO study is mostly an explanation that a subset of Federal employees continued to receive increases to compensation for which they had already bargained. The tacit object of the Congressman, and others like him, is to end those increases, which is a thinly veiled retrenchment on those commitments -- nothing more.
Wow, someone's been getting quite the raise, as my Federal GS pay has increased exactly $0 over the past three years. I'm due for my step increase this year, and that will only be about $2300. I don't see a link to the data, nor how the House Oversight and Government Reform Committee analyzed that data. That would be interesting. They must have made the assumption that all Federal employees are in the lower Step series, allowing for a Step increase every year? This is bogus, as in my office of roughly 350 people, I hazard only 15% of them are new enough to warrant those yearly increases. Are we that unusual?
8609 Westwood Center Drive, Suite 500Vienna, VA 22182-2215 703-876-5100
© 1996-2013 1105 Media, Inc. All Rights Reserved. This copy is for your personal, non-commercial use only.To order presentation-ready copies for distribution to colleagues, clients or customers, visit: www.1105Reprints.com


text:
WANTED: Asystasia Gangetica (Chinese Violet, Ganges Primrose)
pat44thSeptember 29, 2013
I like to have Asystasia Gangetica. This plant can be called :- Chinese Violet or Ganges Primrose.
There are many different flower colors :- light purple, light pink, light yellow and white.
I would like to trade any item on my list.
I have Asystasia Gangetica I can trade. Mine has light purple flowers. I'm interested in trading for the two types of lemon grass you have: Cymbopogon Nardus & Cymbopogon Citratus.

subset: commoncrawl


text:
Grass Lake restoration project inches forward
WILLMAR -- The Kandiyohi County Commissioners approved an amended contract Tuesday with Barr Engineering that will keep the Grass Lake restoration project inching forward.
The $59,880 contract will be paid for with a state grant that was awarded in 2010.
Get the full story
Subscribe or Log In
Are you a newspaper subscriber but you don't have a Digital Access account yet? Activate your account.
You will need your subscription account number and phone number. Not sure if you have an account? Email us or call 320-214-4364 and we can help you.


text:
Albert Michael Postus
Position: TB-DB
Height: 5-10 Weight: 180 lbs.
Born: September 21, 1920 in Philadelphia, PA
Died: August 24, 2008 in Media, PA
High School: St. Thomas More
College: Villanova (school history)
Drafted by the Philadelphia Eagles in the 22nd round (228th overall) of the 1944 NFL Draft.
Weighted Career AV (100-95-...): 0 (14747th overall since 1950)
Promote your website or business by sponsoring this page for $5 on Pro-Football-Reference.com. Your message will replace this ad.
The research for this page was done by Scott Kacsmar.
Read his extensive three-part article (Part I - Part II -
Part III) for full details.
View complete leaderboards for game-winning drives and comebacks.


text:
Victims of northern Minnesota house fire identified
By Crystal Dey
Forum News Service
BEMIDJI, Minn. -- Two people who died in a home destroyed by fire Tuesday night in Minnesota's Hubbard County have been identified.
Phyllis Kleeb, 79, and her son, Frank Kleeb, 56, were inside the residence when it caught fire.
Get the full story
Subscribe or Log In
Are you a newspaper subscriber but you don't have a Digital Access account yet? Activate your account.
You will need your subscription account number and phone number. Not sure if you have an account? Email us or call 320-214-4364 and we can help you.


text:
BVU's initial fiber deployment linked local government and school buildings. According to a study done at that time, this yielded annual savings of $156,000. Today, says Lane, some connections between local schools are operating at data rates as high as 100 Mbps to 1 Gbps. The school's fiber links, he says, have enabled testing and other applications that could not be supported by the T-1 links on which they previously relied.
The Empire Lobbies Back: How National Cable and DSL Companies Banned The Competition in North Carolina
In late 2006, Wilson, North Carolina, voted to build a Fiber-‐to-‐the-‐Home network. Wilson's decision came after attempts to work with Time Warner Cable and EMBARQ (now CenturyLink) to improve local connectivity failed.
Wilson's decision and resulting network was recently examined in a case study by Todd O'Boyle of Common Cause and ILSR's Christopher Mitchell titled Carolina's Connected Community: Wilson Gives Greenlight to Fast Internet. This new report picks up with Wilson's legacy: an intense multiyear lobbying campaign by Time Warner Cable, AT&T, CenturyLink, and others to bar communities from building their own networks. The report examines how millions of political dollars bought restrictions in the state that will propagate private monopolies rather than serve North Carolinians.
Download the new report here: The Empire Lobbies Back: How National Cable and DSL Companies Banned The Competition in North Carolina
These companies can and do try year after year to create barriers to community-‐owned networks. They only have to succeed once; because of their lobbying power, they have near limitless power to stop future bills that would restore local authority. Unfortunately, success means more obstacles and less economic development for residents and businesses in North Carolina and other places where broadband accessibility is tragically low.
It certainly makes sense for these big companies to want to limit local authority to build next-‐generation networks. What remains puzzling is why any state legislature would want to limit the ability of a community to build a network to improve educational outcomes, create new jobs, and give both residents and businesses more choices for an essential service. This decision should be made by those that have to feel the consequences—for better and for worse.
This story was originally posted on the ILSR website.


text:
Beyond Castle Wolfenstein Re-Compiled 64
from the back-to-the-classics dept.
We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).
The guy who did this (jeff?) seems to want to remain fairly anonymous for some reason. I couldn't find any info on who he really is on his page. It's the same guy who did the Jumpman conversion a while back.
Oh! And he's looking for another project!!! Who are you so I can send you my shelf-full of old DOS games I can't play anymore??? (Though I'm sure none of the disks work anymore.)
Actually, he has a pretty nice tutorial [oldskool.org] on how to recreate source from bootable games and how to implement speed fixes. It's a pretty nice read.
From the Wolf3D FAQ [wolf3d.co.uk].
"The The idea for Wolfenstein came from an old Apple ][ game called Castle Wolfenstein that the id guys liked. They had come up with the idea of the 3D, texture-mapped, smoothly scrolling ngine, and needed a game to use it with. Castle Wolfenstein seemed ideal. They couldn't think of a better name, so their legal guys went out and got the copyright on the name, and Wolfenstein 3D was born!"
Make it right before you make it faster.


text:
Blackwater Topics
Democracy Now! stories, posts and pages that relate to Blackwater
Blackwater Down: Fresh From Iraq, Private Security Forces Roam the Streets of an American City With ImpunityIn this week's cover story in The Nation, Democracy Now! correspondent Jeremy Scahill reports on how mercenaries from private security firms like Blackwater USA and BATS are patrolling the streets in New Orleans. [includes rush transcript]September 23, 2005 | Story
- We go to Louisiana to speak with Democracy Now! correspondent Jeremy Scahill who has been in New Orleans this past week. He has been looking into how the city has changed to a militarized zone and what that means for the residents who left. [includes rush transcript]September 16, 2005 | Story
- In addition to the thousands of military troops patrolling the streets of New Orleans, there are also scores of private soldiers that are now spreading out across the city, like those from the Blackwater Security firm. Democracy Now! correspondent Jeremy Scahill reports. [includes rush transcript]September 12, 2005 | Story
- A new PBS documentary titled "Private Warriors," raises questions about the accountability of the private companies working in Iraq and the Pentagon's increasing reliance on them. We speak with the producer and correspondent, Martin Smith and Brookings Institution fellow, Peter Singer who is author of "Corporate Warriors: The Rise of the Privatized Military Industry." [includes rush transcript]June 21, 2005 | Story
- Halliburton and other private military contractors have begun advertising campaigns in El Salvador, Colombia and Nicaragua to recruit ex-soldiers to work in Iraq. [includes rush transcript]December 23, 2004 | Story
- On Wednesday, four U.S. contractors were brutally murdered in Fallujah. They all worked for a private military contractor firm called Blackwater, which has boasted that it wants to build the largest private army in the world. [includes rush transcript]April 01, 2004 | Story
Show for Mar 27, 2015
Yemen: 39 Civilians Killed in Saudi-Led Bombings
U.S. Airstrikes Cause Shiite Militias to Leave Tikrit Fight
Report: Co-Pilot Who Crashed Plane Had History of Depression
House Passes Medicare Bill in Rare Bipartisan Move
Report: U.S. Soldiers, Contractors Sexually Abused 54 Children in Colombia
Mexico: Parents Mark 6 Months Since Disappearance of 43 Students
Indiana Enacts "Religious Freedom" Bill Seen as Anti-LGBT
Indiana Allows Needle Exchange in Response to HIV Outbreak
Kentucky Overhauls Approach to Heroin Addiction
Ohio Lawmaker Discloses Her Abortion, Denounces "Inhuman" Anti-Choice Bill
Video: Monsanto Lobbyist Claims Glyphosate Safe to Drink, Refuses to Drink It
Illinois: National Guardsman, Cousin Arrested on Terror Charges
Wisconsin: Man Suspected of Killing State Trooper Tied to White Supremacy
Michigan: Video Shows "Robocop" Beating Unarmed Auto Worker in the Head
Ferguson Protesters Win Curbs on Police Tear Gas Use


text:
The NACD national chapter has selected Sandra Beach Lin to be inducted into the NACD 2013 Directorship 100. The NACD Directorship 100 identifies the most influential people in the boardroom and corporate governance—those who participate in actual board work and those who influence how that work is done.
Corning Optical Communications
Sign up to receive Dallas Business Journal's Afternoon Edition (featuring People on the Move and the latest local business news), Morning Edition newsletters and breaking news alerts.
Subscribe now to search our database of 13255 Dallas Business Journal People on the Move submissions and download their contact information.
© 2015 American City Business Journals. All rights reserved. Use of this Site constitutes acceptance of our User Agreement (updated 3/14/12) and Privacy Policy (updated 3/14/12).
Your California Privacy Rights.
The material on this site may not be reproduced, distributed, transmitted, cached or otherwise used, except with the prior written permission of American City Business Journals.


text:
- Shopping Bag ( 0 items )
"She really taught me modern, simplified French cooking. I discovered that book when I was really just getting serious about cooking. It was the time, it was the place, it was her voice. She understood French cooking and could tell me, an American, how to make it taste like it tastes in Paris, and I love that."
—Melissa Clark


text:
Leaks only when engine is running. No oil anywhere on top of motor. Leaks a quart in a mile. Lea...
Jaguar Q&AAsk Your Question
All 1997 Jaguar XJ6 questions
where is a major oil leak coming from. Not the filter or top of motor.
car stopped running after running over 18 inches long aluminum trowel
car was running fine just got it so all the codes had cleared no check engine light on . then I r...
Car starts but won't stay running ?
Turn key car starts, voltage goes up then drops and car dies, can anyone help
Body control unit
Sometimes engine does not run+ door locking system does not work+ alarm system+ trunk open button...
EGR Valve and throttle spring
How long will the EGR valve and the throttle spring last before having to be replaced again?
oil leak
leaking a little faster than i would like too see it also squeals when started
Why does the ac lite come on when i call for defrost,and i don't have heat
i changed the heat control valve. i got heat for 20 min. then i got cold air and no heat. When i ...
1997 jaguar xj6 reset passive alarm system sequence.
Using standard Jag key. Not keyless FOB
my car starts and after about 3 to 5 minutes dies, usually won't start til sits.
usually has to sit over night. Engine runs smooth. I let it sit for a month while out of town. St...
Can the bulbs in the air condition control panel be replaced on 1997 xj6
The temp indication on the panel is very dim
Where is the knock sensor located on my engine?
My check Engine light is on and diagnosed bad knock sensor. I have the part but my husband canno...
Factory alarm on 1997 Jag XJ6L
My Jag had a dead battery so I charged it up. The battery took a charge great but when I try to ...
my windshield wipers sometimes will not run then they will start up again
if i leave them on they will sometime start running again
No start problem, have a spark, have fuel to injector rail
Fuel not entering cylinders but will fire and run for short period if fuel introduced through spa...
Runs rough at idle, check engine light is now flashing
Have a 97 XJ6L that has never had any issues. !24000 miles now. Drove in the rain yesterday and n...
This week's top 10
|1 stevieray1
|6 Hal...
|2 pushrod
|7 csubak30
|3 globalhelper
|8 raytucker
|4 CharlesAutomotive
|9 sunilpatel
|5 ziptie12
|10 wrayauto


text:
TV - Page 18
Kelly Osbourne Reportedly Undergoing 'Food Rehab'
Kelly Osbourne is looking to lose the weight that she gained as a result of breaking off her engagement.
Amy Purdy Continues To Amaze Me On DWTS
This week if you missed it the stars themed their dances on the most influential years in their lives. For Amy Purdy it was when she was 19 and contracted meningitis that took her legs below the knees and her kidneys
Banned Commercial Features Multiple Bar Refaelis in Bed, Skimpy Clothing & More
Ever wonder what it would be like to wake up with Bar Refaeli in your bed? What about two Bar Refaelis? Three?
'How I Met Your Mother' Creators Respond to Series Finale Backlash
Rarely has the series finale to any TV series gone by without at least some major backlash over its content, and 'How I Met Your Mother' is no exception. Last night's "Last Forever," jumped through time in between the years 2013 and 2030, filling in Ted's story about the mother, with at least one major twist that naturally had fans in an uproar. So, what do series creators Carter Bays and Craig Thomas have to say about yet another controversial finale?
'The Walking Dead' Season 5 Ups Trio to Series Regulars, New Details on Terminus Ringleader
Though it won't air until the fall, 'The Walking Dead' season 5 is already posing fans with loads of questions, especially after Sunday's season 4 finale that saw Rick's group make it to Terminus and realize a little too late what was really going on. Keeping in mind the events of the episode, "A," AMC upped three members of the cast to series regular roles for season 5, that of Rosita, Tara and Terminus baddie Gareth.
Michelle Phan Is The Girl In The Diet Dr. Pepper TV Commercial [VIDEOS + PHOTO]
Who's the very pretty girl in the new Diet Dr. Pepper "One Of A Kind" TV commercials? She's Michelle Phan, make up artist extraordinaire!
'Dawn of the Planet of the Apes' TV Spot Premieres During 'The Walking Dead' Season Finale
A new 'Dawn of the Planet of the Apes' TV spot aired during the 'Walking Dead' season finale and if you missed it, a) it was awesome, and b) we have it for you right here in HD.
Jana Kramer Is The Girl In The Nationwide Insurance TV Commercials [VIDEOS + PHOTOS]
The Nationwide Insurance girl has made another midnight appearance, replacing stolen goods with new and then stealing our hearts at the same time!
'The Walking Dead' Season 4 Finale Sneak Peek: Rick Makes Carl "A" Hunter
Only one episode remains in 'The Walking Dead''s fourth season, and while we don't yet know if the mysterious "Terminus" will provide genuine shelter, it may yet serve to reunite the wayward groups before the finale. Our first sneak peek of next Sunday's season 4 closer "A" has arrived, and it seems Rick, Michonne and Carl may have gone somewhat off the beaten path, to even greater dangers ahead.


text:
Do you want to make Ohio.com your homepage?X
World Liquors & Wines in North Olmsted will hold a special beer tasting from 4 to 7 p.m. Aug. 17 featuring Buckeye Brewing Co. brewer and owner Garin Wright.
The sampling will include Hippie IPA, Cleveland IPA, Wheat Cloud and Martian Marzen Lager. For more details, call 440-777-2144.


text:
The Top 10 In Action Sports
01Welcome to Qasr Al-Farid: The Rock With A Door That Will Rock Your World
02Already Got MTB Withdrawal Symptoms? Here Are The Crazy Downhill and Enduro Highlights From Crankworx New Zealand
0318 Things That Will Give Anyone Who Did Duke Of Edinburgh A Serious Flashback
0416 Things That Will Give 90s Skater Kids A Serious Flashback
05This 10 Year Old Kid Just Nailed A Dub Cork 1080... On His Second Attempt
06The 10 Most Spectacular Road Trips on Earth
07Water Slides, Plane Wings and Danny MacAskill: This is Road Cycling Like Never Before...
0824 Reasons Why Snowboarding Was Better In The Early Noughties
09Could Scientists Be About to Build a Terminator? They're Closer Than You Think…
10Win a Holiday for 2 in Chamonix with Three #holidayspam
TNF Freeski Open of New Zealand Slopestyle Preview
Check out the Snow Park Slopestyle course check for The North Face Freeski Open of New Zealand. Many of the world's best freeskiers have decended upon Snow Park to get ready for the Slopestyle competition, and to say that the comp is going to be off the chain would be an understatement of gross proportions. Song: Igene, by Suhov soundcloud.com/the_peppermint Filmed and Edited by Mark von Roy Distillery Concepts and Creation - distillery.cc Flashmodern Creatives - flashmodern.com
What Do You Think?
Get the best in action sports straight to your inbox


text:
Explore Hawai'i from a bird's perspective as you fly some of the most iconic aircrafts through the air with precision controls and detailed environments.
07/04/2014 03:37 am - Even though it has already been two years since the overall development of Microsoft Flight has come to a halt, players were still able to embark on aerial adventures in the free-to-play simulation game with other pilots, friends or perfect online...more
03/01/2012 09:20 am - Microsoft has just released a new trailer to show off their officially launched, free-to-play flight sim, Microsoft Flight. This...more
03/01/2012 03:43 am - A new trailer has been released by publishers Microsoft to announce the game's official launch!...more


text:
I recently ordered Butter Coin by Alex Lourido. When it came I was horrified to see I had gotten a defective product. I contacted MJM, and they were...Read More ->
I have sent an inquiry to MJM about some item that I want to order and I was surprised how fast they have answered. But not only fast, I have sent...Read More ->


text:
Key things you need to know aboutDr. Mauer:
Dr. Mauer's Experience
Research training, expertise and qualifications
Dr. Mauer's Specialties
- Gastroenterology
- View 1 specialty and 2 board certifications
Procedures Dr. Mauer Performs
- Colonoscopy, Proctosigmoidoscopy, and Sigmoidoscopy
- Endoscopy (Esophagus, Stomach, Small Intestine)
- See all 4 procedures
Conditions Dr. Mauer Treats
- Abdominal Pain
- Anemia
- See all 50 conditions
More About Dr. Mauer's Background
Hospital Quality
The right hospital is as important as the right doctor
- Saint Vincent's Medical Center
- 2800 Main Street
- Bridgeport, CT 06606
9 Facts About Hospital Quality
Patients' risk of dying during a hospital stay for heart bypass surgery could be 85.2% lower, on average, at a hospital rated 5 stars compared to a hospital rated 1 star for that procedure. Choosing the right hospital is critical to your health. View Slideshow
Patient Satisfaction
Patients' feedback on their experience with Dr. Mauer
Likelihood of recommending Dr. Mauer to family and friends is 4 out of 5 5 1 18
See More Survey Results
8 Facts About Patient Satisfaction Surveys
Patient satisfaction surveys provide a standardized way of reporting about healthcare experiences. But there can be more than meets the eye when reviewing scores. Here's what you should know
Appointments & Offices
Check insurance plans, locations and make an appointment
Accepting new patients?
- Yes
- Gastrontrlgy Assocs Manchester
- Gastrontrlgy Assocs Manchester
- 2660 Main St Ste 203
- Bridgeport, CT 06606
- Endoscopy Center Of Fairfield
- Endoscopy Center Of Fairfield
- 425 Post Rd Fl 1
- Fairfield, CT 06824
7 Tips to Prepare for Your Appointment
The key to a successful appointment is communication. To get the most out of your visit, prepare ahead of time so you can lead the conversation with your doctor. These 7 tips will get you ready
Oops, you entered a bad link for Dr. Mauer!
The link you entered contains bad characters or identifiers. Please enter the link exactly as it appears in your email or text message.
Thank You
This confirms that we have received your survey about Dr. Mauer. Please note: it will take 24 hours for your survey results to show up on the doctor's profile.
Thank You
Our records show that you have already confirmed your survey for Dr. Mauer. Please note: it takes 24 hours for your survey results to show up on the doctor's profile.


text:
Is your resume in need of a little disruption?
Startups are all about
making things work better.
Our resume writing service is all about doing that for your CV.
StartUpHire is the place to find IT jobs in and near . Review the list below of IT jobs. These IT jobs represent some of the most rewarding careers available. You can refine your job search for IT jobs in by adding a job title, company name, or keyword to the search box above … or click the "Advanced Search" link for more options. Don't see the employment opportunity you're looking for? Check back soon for more IT jobs in , or sign up for an email alert (link in upper left) to receive periodic updates on new IT jobs in , .
The Sales Operations Supervisor will possess outstanding organizational, analytic and interpersonal skills, and will be responsible for Logistics, Budgeting, Support Services, Third Party Relations, and Operational Strategizing.3/25/2015 New York, NY Save This Job
Looking for driven salesperson interested in bridging the gap between mobile developers and small businesses. Sell custom apps, and enjoy 30% of all sales - YOU decide your salary!Flexible Location: Work from home!
More information about this job: POSITION SUMMARY & RESPONSIBILITIES: Virtustream (www.virtustream.com) is a leading enterprise cloud software and services provider. The company's secure high-performance cloud platform, xStream, enables hybrid cloud deployments, supports2/16/2015 Bethesda, MD Save This Job
Department: Information Technology Schedule: Full-time Overview: We are looking for an IT Systems Administrator to be responsible for assisting in the administration of a distributed Windows environment that includes but is not limited to Active Directory, Exchange Server,2/15/2015 Kansas City, MO Save This Job
JOB DESCRIPTION The Inside Sales Representative is responsible for selling the Masergy Security offering to new clients and engaging existing security customers for expansions and renewals. The primary source of new business will be generated through the LDRs; however the ISR2/11/2015 Plano, TX Save This Job
Job Tracking ID: KTTS-14-CBPIA Location: Falls Church, VA Job Type: Full-Time/Regular Date Updated: February 04, 2015 Job Description: Vacancies located in Falls Church, Virginia. Ideal candidates will have a thorough understanding of how to assess vulnerabilities and2/11/2015 Falls Church, VA Save This Job
Be an early and important member of TubeMogul ? an exciting, well-funded and growing startup that solves big problems in the rapidly growing online video market. Our IT team is searching for a Support Specialist with strong technical and customer service skills to help support2/1/2015 Emeryville, CA Save This Job
Submit your resume to email@example.com. Location: Waltham, MA Reports to: VP of Research and Development and Director of Technical Services Position Summary: The CallMiner IT Support department provides OS, SW & HW support services for both Windows and Microsoft Active1/27/2015 Waltham, MA Save This Job
POSITION SUMMARY The primary responsibility of the IT Database Administrator will be responsible for the installation, configuration, upgrading, administration, monitoring, maintenance, and security of databases in an organization. This role includes the development and design of1/26/2015 Minneapolis, MN Save This Job
The IT Project Manager will report to the IT Enterprise Project Manager and be responsible for documenting, tracking, driving and reporting deliverables and work activity across the enterprise. This position will work closely with all members of the technology (dev, data, QA, dev1/24/2015 Brentwood, TN Save This Job
AssureRx Health, Inc. is a personalized medicine company that specializes in pharmacogenomics dedicated to helping physicians determine the right drug for individual patients suffering from neuropsychiatric and other disorders. The company was founded to commercialize1/21/2015 Mason, OH Save This Job
Location:Bedminster, NJ Job Code:1182014N # of Openings:1 Description Cutting Edge Technology- Scrum Master- Agile ? Project Management PHX: Delivering advanced cost management solutions for health plans. Consistently recognized as an industry leader, we provide our service to12/13/2014 Bedminster, NJ Save This Job
Summary We are seeking an individual with a security focus that can support our end users and external customers in a diverse technology environment. Responsibilities ????????- The right candidite will: - Provide direct support to our internal users (Microsoft applications,3/27/2015 Wayne, PA Save This Job
Responsibilities: ? Diagnoses and resolves end-user network or local printer problems, PC hardware problems, e-mail, Internet, and local-area network access problems. ? Performs minor desktop hardware repair for PC computer equipment and peripherals that are not covered by3/9/2015 New York, NY Save This Job
San Francisco, United States Why is security important at Airbnb? Airbnb is a global marketplace trusted with payment and personal data. Not only must we keep that information safe, but we must also meet specific industry and regulatory standards. Airbnb is looking for a2/26/2015 San Francisco, CA Save This Job
Overview Solution Architect The Verizon Cloud has evolved into a platform used by millions of users hosted in multiple data centers. We?re continuing to expand our platform to meet the needs of Verizon?s ever expanding Cloud Customer Base. You can be part of that effort by2/25/2015 Bethlehem, PA Save This Job
Objective/Purpose: The Support Analyst provides Tier-1/Tier-2 support for the operational data (including financial) that is used by the systems and applications within Cypress Care. This position is part data analyst and part support. The position requires the ability to work2/20/2015 Duluth, GA Save This Job
---3 Month Contract Role--- Job Summary This role will support full life cycle recruiting including sourcing, advertising, screening and interviewing. Will coordinate recruitment functions including job and career fairs. Will interview and screen candidates using telephone2/20/2015 Duluth, GA Save This Job
Acquia is hiring a Help Desk Analyst to support our ever growing global staff in a fast paced, short-deadline work environment. Do you enjoy solving technical problems and working with great people? Are you or have you been a Genius? Summary: Provide desktop, networking and2/17/2015 Burlington, MA Save This Job
ERP Support Analyst / EDI Specialist About Agility Agility Fuel Systems is the leading designer and producer of alternative fuel storage and delivery systems for heavy duty trucks, buses and specialty vehicles. Our systems can be fueled by compressed and liquid natural gas, as2/3/2015 Santa Ana, CA Save This Job


text:
Input set indexing for set-similarity lookups. The architecture provides input to an indexing process that enables more efficient lookups for large data sets (e.g., disk-based) without requiring a full scan of the input. A new index structure is provided, the output of which is exact, rather than approximate. The similarity of two sets is specified using a similarity function that maps two sets to a numeric value that represents similarity of the two sets. Threshold-based lookups are addressed where two sets are considered similar if the numeric similarity score is above a threshold. The structure efficiently identifies all input sets within a distance k (e.g., a hamming distance) of the query set. Additional information in the form of frequency of elements (the number of input sets in which an element occurs) is used to improve index performance.
1. A computer-implemented indexing system, comprising:
a processor coupled to a memory, the memory having a plurality of components stored thereon, said components comprising:
an index building component employing a signature scheme for building an index structure over an input collection of sets, wherein the signature scheme generates a set of signatures for the input collection of sets, wherein each signature of the set of signatures is based on a corresponding set of the input collection of sets, and wherein each signature is represented as a string by concatenating string elements based on an ordering of the elements, the string elements based on a sequence of minhash functions applied to the corresponding set and the ordering based on element frequencies; and
an index lookup component for identifying individual sets in the input collection that are similar to a given query set.
2. The system of
3. The system of
4. The system of
5. The system of
6. The system of
7. The system of
8. The system of
9. The system of
10. A computer-implemented method of indexing data, comprising:
receiving a collection of input sets for indexing;
generating a set of signatures for the collection of input sets, wherein each signature of the set of signatures is based on a corresponding input set of the collection of input sets, wherein each signature is represented as a string by concatenating string elements based on an ordering of the elements, the string elements based on a sequence of minhash functions applied to the corresponding input set and the ordering based on element frequencies;
indexing the collection of input sets based on the corresponding signatures in a data structure;
storing the data structure on a disk; and
retrieving a subset of input sets that share a common signature with a query set.
11. The method of
12. The method of
13. The method of
14. The method of
15. A computer-implemented system, comprising:
a processor coupled to a memory;
computer-implemented means for receiving input sets for indexing;
computer-implemented means for generating signature sets associated with individual input sets;
computer-implemented means for indexing individual signature sets and associated individual input sets in a data structure; and
computer-implemented means for retrieving and outputting a subset of input sets that share a common signature with a query set.
16. The system of
Data cleaning is the process of fixing inconsistencies in data before the data is used for analysis. A common form of inconsistency arises when the same semantic entity has multiple representations in a data collection. For example, the same address could be encoded using different strings in different records in the collection. Multiple representations arise due to a variety of reasons such as misspellings and different formatting conventions.
A string-similarity lookup is a useful primitive for fixing such representational data inconsistencies. A string-similarity lookup identifies all strings in a collection that are similar to a query string. For example, a City column of an unclean table that contains possibly misspelled city names can be cleaned by performing a string-similarity lookup against a reference table of city names with correct spellings. Alternatively, each city name in the unclean table could be replaced with the most similar city name in the reference table.
String-similarity lookups are also useful in several other applications. Identifying documents that are textually similar to a given document is useful in many contexts such as identifying mirrors on the Internet and copy detection. There is an increasing interest in supporting large text data within database management systems, and string-similarity lookups are likely to occur naturally in such settings.
A common primitive useful in data cleaning and other applications is that of identifying all sets in a collection similar to a given query set. However, conventional mechanisms for indexing such sets for efficient set-similarity lookups continue to be problematic.
The following presents a simplified summary in order to provide a basic understanding of some novel embodiments described herein. This summary is not an extensive overview, and it is not intended to identify key/critical elements or to delineate the scope thereof. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.
The disclosed architecture provides input to an indexing process that enables more efficient lookups for large data sets (e.g., disk-based) without requiring a full scan of the input. More specifically, a new index structure is provided that supports set-similarity lookups, the output of which is exact, rather than approximate. In other words, no output set is missed, probabilistically. With respect to set-similarity lookups, given a query set, all sets in an input collection similar to the query set are identified. The similarity of two sets is specified using a similarity function that maps two sets to a numeric value that represent similarity of the two sets. Threshold-based lookups are addressed where two sets are considered similar if the numeric similarity score is above a predetermined threshold. This can also be extended to handle top-k lookups.
The architecture is a new index structure (referred to as P
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles disclosed herein can be employed and is intended to include all such aspects and their equivalents. Other advantages and novel features will become apparent from the following detailed description when considered in conjunction with the drawings.
The disclosed architecture provides for the efficient retrieval of all sets in a large collection of sets that are similar to a given query set. For Jaccard and hamming similarity functions over unweighted and weighted sets (and hence, the class of string similarity which can be built upon these functions), efficient techniques are disclosed based on a signature scheme (referred to as monotonic P
Reference is now made to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding thereof. It may be evident, however, that the novel embodiments can be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate a description thereof.
Referring initially to the drawings,
As will be described in greater detail hereinafter, the index structure 106 is disk-based, and the set-similarity lookup is threshold-based. The set-similarity function used in the lookup can be based on one of Jaccard similarity or hamming distance. The signature scheme 108 is based on partitions of a multi-dimensional vector representation of sets, and further based on enumeration of the partitions.
The index structure 106 supports set-similarity lookups the output of which is exact (that is, no output set is missed probabilistically). The index structure 106 achieves sub-linear query time using sub-quadratic space for simple input distributions. The index 106 is disk-based and can efficiently handle large data sets. Well-known probabilistic indexing techniques based on locality-sensitive hashing are considered and simple modifications proposed that make the resulting index structure more efficient and better manageable in a disk setting.
Set-similarity lookups are defined as follows. Given a query set, all sets in an input collection (hereafter, simply input) similar to the query set (hereafter, simply query) are identified. Set-similarity lookups can be used with appropriate pre- and post-processing for evaluating string-similarity lookups. The input is preprocessed to enable efficient lookups, without requiring a full scan of the input. The similarity of two sets is specified using a similarity function, which maps two sets to a numeric value that represents similarity between the two sets. The disclosed architecture employs threshold-based lookups, where two sets are considered similar if a numeric similarity score is above a specified threshold. A related variant is the top-k lookup, which seeks the k sets in the input most similar to the query. Indexing techniques described for threshold-based lookups can be extended to handle top-k lookups.
For various efficiency and ease-of-implementation reasons, it is useful to move from a sequence abstraction to a set abstraction for defining similarity. Strings are converted to sets using conventional techniques such as n-gram computation, shingling, and word tokenization. The similarity of strings is then defined to be the similarity of the corresponding sets using a set-similarity measure such as Jaccard and cosine. While this method discards some sequence information, in practice, it is fairly robust in capturing similarity of real-world strings and text data. Even when lookups based on string-similarity measures are important, it is beneficial to use set-similarity measures during an intermediate filtering step. For example, in order to identify strings that are within edit distance of one from the string November, strings that share at least five 2-grams with November can first be identified, and then false positives eliminated.
One possible approach for indexing sets is to build an inverted index that stores, for each element, the list of sets containing it. The inverted index can be used to answer similarity lookups for a variety of similarity functions. For example, all input sets having an intersection size at least T with a query q can be identified by accessing the set-lists of all the elements in q and identifying those sets that occur in at least T of these lists. For large data collections, this approach is not very efficient, since the set-lists associated with elements could be large.
A better approach for indexing sets uses the idea of locality-sensitive hashing (LSH). LSH-based indexing is a general technique that relies on a �black-box� called locality-sensitive hashing scheme. A class of objects whose similarity measure admits an LSH scheme can be indexed using this technique. LSH-based indexing is formally introduced infra. There exist well-known LSH schemes for standard set-similarity measures such as Jaccard and cosine. Therefore, in principle, these LSH schemes can simply be plugged in to get a similarity index for sets. However, there are several reasons why the set-similarity indexing is far from being a completely �solved� problem.
First, LSH indexes support only probabilistically approximate lookups. In other words, LSH indexes miss an answer set with a small probability. There are several scenarios where exact, as opposed to approximate, lookups are desirable. Such scenarios commonly arise when set-similarity lookup operation occurs as part of a larger query�this is often the case in data cleaning or in a general-purpose database management system (DBMS). It is difficult to assign meaningful semantics to the full query when an operator of the query produces approximate answers.
Second, although there has been an enormous amount of theoretical work on LSH indexes, the practical aspects of LSH indexes have not been sufficiently studied. For example, the construction of LSH indexes involves parameters, whose values crucially influence the lookup performance of the indexes. It is not clear how these parameters should be set for real life data. The values for these parameters suggested by theoretical analysis are derived using a conservative assumption that input sets are highly similar to one another, and LSH indexes constructed using these values are not practical for large input. There exist practical variants of LSH indexes that achieve better performance for real life data. However, these are mostly ad hoc adaptations and do not provide correctness guarantees about their lookup output.
As previously indicated, the disclosed architecture is a new index structure (e.g., disk-based) called P
The disclosed index structure uses additional information in the form of frequency of elements (the number of input sets in which an element occurs), information not used by LSH. More specifically, the index structure is designed to exploit the fact that for real life sets a vast majority of elements are relatively infrequent. Informally, infrequent elements are useful for set-similarity indexing since the infrequent elements help to quickly narrow down the space candidates for a lookup query.
Finally, a simple modification to the LSH indexes is disclosed that makes the resulting index structure more manageable and efficient (e.g., in a disk-based setting).
The input to the indexing problem consists of n sets that are denoted S={s1, s2, . . . , sn} where n is a positive integer. For simplicity, it is assumed that all sets are drawn from the universe U={1, . . . , m}. A goal is to index the collection S so as to support lookups involving a fixed similarity function Sim defined as the following:
Given a query set q and a similarity threshold θ, output all sets siεS satisfying Sim(q, si)≧θ.
For probabilistically approximate lookups (hereafter, referred to generally as approximate lookups), the output can be slightly inaccurate, as quantified using a parameter δ; any output set siεS satisfying Sim(q, si)≧θ appears in the output with a probability at least (1−δ).
The following description deals primarily with two similarity (distance) functions, Jaccard, and hamming, defined below. Set-similarity indexes constructed for one of these similarity functions can be used as a pre-filter for lookups involving a broader class of similarity functions. The Jaccard similarity of two sets s1 and s2, denoted ℑs(s1, s2) is given by:
ℑs(s1, s2) is a fraction between 0 and 1.
The Jaccard similarity of the two sets is 6/10=0.6. A set s ⊂{1, . . . , m} can be viewed as an m-dimensional binary vector v, such that v[i]=1 if iεs, and v[i]=0, otherwise (v[i] denotes the value of vector v on the ith dimension). The hamming distance between two vectors v1 and v2, denoted Hd(v1, v2), is the number of dimensions on which the two differ. As used herein, the hamming distance between two sets can be understood to mean the hamming distance of the vector representations. Note that the hamming distance between two sets s1 and s2 is the size of the symmetric difference: Hd(s1, s2)=|(s1−s2)∪(s2−s1)|. For example, the hamming distance between the two sets of Example 1 is four.
Herein is a high-level description of a general index structure for set-similarity. This general index captures the common logic of all previous indexes such as LSH as well as the P
Index Construction
Lookup: (q, 0)
The index uses a special mapping that takes a set s and produces another set of values called signatures of the original set, the set of signatures denoted Sign(s, θ). The mapping is parameterized by a numeric value θ. Thus, it is possible that a set has different signatures for different values of θ. At index construction time, the set of signatures Sign(si, θ) is generated for each input set si and every lookup threshold θ. Each signature sigεSign(si, θ) is inserted along with the set si into a hash table, with sig as the hash table key.
In order to perform a lookup involving query set q and threshold θ, the signatures Sign(q, θ) of query q are generated. The hash table is used to retrieve all input sets si that share a signature with q, and the input sets that satisfy the lookup predicate Sim(q, si)≧θ are output. Note that the term �hash table� is used loosely herein to mean a data structure that indexes a set of vector pairs (key, value), and supports a lookup operation that takes a key and returns all values with the given key. In particular, the data structure may or may not involve hashing.
The mapping that generates signatures is called a signature scheme. A signature scheme that satisfies the following condition results in a correct set-similarity index for similarity function Sim: for any sets r and s, Sign(r)∩Sign(s)≠φ whenever Sim(r, s)≧θ. This condition can be satisfied only probabilistically, which results in the index being probabilistically approximate. Such signature schemes are called approximate, and signature schemes that deterministically satisfy the correctness condition, exact.
Ignoring the low-level implementation details, most of the previous indexes for set-similarity can be viewed as instantiations of the general set-similarity index above with a specific signature scheme. A simple signature scheme is the identity scheme, where the set of signatures for a set is the set itself (Sign(s, θ)=s). The set-similarity index resulting from this scheme corresponds to the inverted index based approach briefly described above. For LSH-based indexes, signatures of a set are concatenations of minhashes of the set, described in greater detail below. The P
With respect to set-similarity indexes, first, it can be impractical to generate signatures for every value of threshold θ (see Step 1 of I
Second, there are different implementation alternatives for removing false positives, in Step 3 of the lookup operation for the general set-similarity index above, and the alternatives have very different performance characteristics in a disk setting. The first alternative (suggested in the general set-similarity index above) is to physically store a set in the hash table along with each of its signatures. If a set has multiple signatures (which is typically the case) the set is replicated several times in the hash table. In this case, the hash table lookup in Step 2 returns the full candidate sets; thus, checking for false positives in Step 3 of the lookup is straightforward. A drawback of this approach can be the extra storage space needed for storing multiple copies of input sets. A second alternative is to store just the set identifiers in the hash table. In other words, insert
Third, the notation Sign(s, θ) is slightly over generalized, since the set of signatures for s is not a function of s and θ alone. There are usually several �hidden� parameters which determine the set of signatures for s. These may include, for example, randomization bits. When using Sign(s, θ) the hidden parameters should be clear from the context. Note that the same settings of hidden parameters should be used for generating all signatures.
Following is a description of the P
The P
The basic P
In contrast, the disclosed indexing problem can require lookup support for a range of threshold values. Without monotonicity, different signatures need to be generated for every value of the threshold, increasing the space requirements and index build time. Second, as described infra, the basic P
The instant description provides how P
For simplicity, the P
Following is the formal specification of the basic P
Signature for v:
First, a random permutation π of the dimensions {1, . . . , m} is generated. π is used to define a two-level partitioning of the dimensions: there are n1 first-level partitions, and within each first-level partition, there are n2 second-level partitions. Therefore, there are n1�n2 second-level partitions overall. The values n1 and n2 are parameters that can be varied to control signature generation by P
A description is now provided of how the signatures for a vector v are generated. Let k denote the hamming threshold at which signatures are generated. Fix
Fix a subset S, and let P denote the set of all dimensions belonging to partitions in S. The signature for S is the pair
Theorem 1. If Hd(u, v)≦k, Sign(u, k)∩Sign(v, k)≠φ, where Sign(u, k) and Sign(v, k) are generated using the same random permutation π, and same parameters n1 and n2.
Following is a description of the theoretical performance of the basic P
Theorem 2. There exists a setting of parameters n1 and n2 for which P
The proof of Theorem 2 (omitted here for brevity) provides best values for n1 and n2 for a fixed width of signatures. The best values turn out to be n1=m/2 w, k2≈k/n1, and n2=2 k2. The value of n1 is independent of the threshold k, and this fact is used while extending the basic P
Theorem 3. Consider an exact signature scheme for binary vectors and hamming threshold k that generates t signatures by projecting input vectors on fixed sets of dimensions D1, . . . , Dt, Di ⊂{1, . . . , m}. If |Di|≧w for each 1≦i≦t, then t≧ewk/m.
A simple consequence of Theorem 2 is the following theorem, which summarizes the performance of P
Theorem 4. For input vectors generated from a uniform distribution, P
Therefore, for k<m/4, P
Following is a description of how the basic P
Collectively, use l instances of the basic P
Parameters FOR PEi (1≦i≦l):
n1(i): n1
n2(i): 2i
k(i): n1(2i-1+1)−1
k2(i): n2(i)/2
π(i): π
Sign(v, k):
1. Pick smallest i such that k≦k(i)
2. Output PEi.Sign(v, k(i))
The parameters for PEi are indicated using parenthesis around i. For example, n1(i) denotes the number of first level partitions of PEi, and n2(i), the number of second level partitions, and so on. All l instances have the same number of first level partitions and use the same random permutation π of the dimensions. The number of second level partitions varies exponentially, and so does the hamming thresholds associated with the different instances.
In order to generate signatures for a vector v at hamming threshold k, the smallest i is identified such that k≦k(i), and PEi is used to generate signatures for v at a higher hamming threshold k(i), as shown in Step 2 of the above monotonic scheme. It can be shown that if i>j, the set of signatures generated by PEi for vector v at hamming threshold k(i) is a superset of the signatures generated by PEj for v at hamming threshold k(j); the monotonicity property of the monotonic scheme follows from this fact.
Note that the choice of parameters for PEi reflect the theoretical results described earlier. The width w of each signature is given by
Now described is how the P
Signature Representation. Fix a set sε{1, . . . , m} and let v denote its vector representation. Recall that each P
Hash table Implementation. Recall that the term hash table is used to denote a data structure that indexes a collection of (key, value) pairs; multiple values can have the same key. Given a key, all values with that key are retrieved. For set-similarity indexes, the keys are signatures and values are sets.
The hash table construction exploits the fact that for set-similarity index of the general set-similarity index above, the hash table lookup need not be exact. Specifically, for a lookup involving a given signature the hash table can return a superset of sets that generate that signature, i.e., it can possibly return some sets that do not generate the given signature. This does not affect the correctness of set-similarity lookups, since false positive sets can be filtered out in Step 3 of the lookup operation of the general set-similarity index above. For disks, random access is expensive while sequential access is cheap, so it is useful to read and write data in large units called disk blocks, which is typically a few thousands of bytes. In the following, the parameter B is used to denote the number of sets that can be stored within a disk block. Since the sets that arise in data cleaning are of fairly small cardinalities (a few tens of elements), B is typically in the range 100 to 1000.
Following is a high-level description of an exemplary hash table construction.
Input: A collection
The input to the hash table construction is the collection of (signature, set) pairs that need to be indexed. First, all the input pairs are sorted based on the lexicographic ordering of the signatures; recall that the signatures are strings. Then, the sorted list of input pairs is divided into contiguous chunks (partitions). Each chunk has the property that it has exactly B distinct sets; B is the number of sets that can fit in one disk block. Note that a chunk could have more than B (signature, set) pairs�this happens if a set appears multiple times in the same chunk with different signatures. The B distinct sets are stored in each chunk in a disk block (in any order), ensuring that the sets of contiguous chunks go to contiguous disk blocks. In addition, the first signature of every chunk is stored in a separate table called the boundary table. The boundary table is about a factor B (2 or 3 orders of magnitude) smaller than the input, so it can be stored completely in memory.
Following is a table of input pairs for Example 4.
Consider the eight signature-pairs shown. The subscripts of the signatures encode the lexicographic ordering of the signatures (sg1<sg2< . . . ). Let B=2. Then the sorted input list can be divided into three chunks. The first chunk is {
For any signature, using the boundary table, a contiguous set of disk blocks can be identified such that any input set that generates the signature is guaranteed to be in one of the disk blocks; for lookups involving the signature, simply return all sets in these blocks. In Example 4, any set that generates sg1 as one of its signatures is guaranteed to be stored in disk block 0. Therefore, return the two sets s3 and s4 as results for the hash table lookup for signature sg1. As this example illustrates, the hash table lookup for a signature may return some input sets that do not generate the signature. But as described earlier, this does not affect the correctness of the set-similarity index using the hash table. Further, the number of such false positive sets is bounded by 2 B, so the cost of processing these sets is amortized by the random I/O cost to access the disk blocks.
This lack of hash table lookup accuracy provides at least two benefits. First, the space required by the hash table is smaller compared to that required by an off-the-shelf hash table implementation. For example, a hash table of the disk blocks stores only one copy each of sets s1 and s2, while any regular hash table would have stored two copies of each, one for each signature.
Such hash table compression happens when signatures of a set appear close to one another in the sorted list of signature-sets. Second, and more importantly, the lower space requirement translates to fewer disk I/Os and therefore better lookup performance. These benefits turn particularly compelling if information about frequency of elements is used for signature representation.
Using Frequency of Elements. Recall from above that the signature
Informally, the frequency-based ordering tends to cluster together the signatures of a set, leading to better compression of the hash table. As an exaggerated example, consider an input set si containing an element e of frequency one, that is, e occurs only in si and no other input set. All signatures involving element e have a representation of the form e� . . . , and so, appear contiguously in the sorted list of signature-sets; all these are compressed to a single entry in the hash table. Note that since a �look-ahead� of B sets occurs during hash table construction, such benefits can be obtained even for elements of frequency up to B. Similar benefits are obtainable during set-similarity lookups as well. Consider a lookup involving query q, and let q have an element e with frequency one (in the input sets). All input sets that possibly generate a signature containing element e usually occur within a single disk block, so the multiple hash table lookups involving signatures of q containing element e, translate to a single disk seek.
Now consider P
Following is a description of locality-sensitive hashing based indexes for set-similarity. A modification of the basic LSH index is provided that is useful in a disk-based implementation. The description begins with a review of basic LSH indexes, before presenting the modification.
LSH indexes, as the name suggests, are based on the concept of locality sensitive hash functions. Informally, a locality sensitive hash function hashes similar objects to the same value with high probability. For Jaccard similarity, there exists a locality sensitive hash function called the minhash function. A minhash function is defined using a permutation π of {1, . . . , m}. The minhash of a set s⊂{1, . . . , m} for permutation π, denoted mhπ(s), is defined as the smallest element of s under permuation π. Formally,
If π is picked at uniformly at random from among all permutations, it can be shown that:
Thus, similar sets are more likely to have the same minhash than dissimilar sets. In the following, the subscript π is dropped from mhπ. Instead, subscripts (e.g., mh1, mh2, . . . ) are used to represent different minhash functions, i.e., functions using different permutations. Further, permutations for different minhash functions are picked independently and uniformly at random.
Following is an exemplary minhash-based signature scheme for an LSH index.
Signature Generation
Each signature for a set is a concatenation of g minhashes of the set; g is the signature width parameter that can be varied to control the performance of LSH. The number of signatures for a given set depends on δ, the false positive rate, g, and θ: it is the smallest integer i such that (1−θg)i≦δ. The correctness of the signature scheme follows from the locality sensitive property of minhashes discussed above.
Just as in the case of P
A simple solution for picking the right value of g is unknown. Note that g is fixed at index construction time, so changing the value of g requires a complete index rebuild.
A simple modification to LSH indexes is now described that does not require fixing the value of g at index construction time. The value of g can be specified at lookup time, and lookup behaves as if the index were constructed using that value of g. While this does not solve completely the problem of picking the correct g, it makes the problem more tractable in practice. For example, the value of g used for lookups can be varied, depending on the performance of previous lookups, without having to rebuild the index from scratch.
The modification is based on the idea that hash tables used in the general set-similarity index described above can be approximate, and return false positives, since these are ultimately filtered out subsequently.
The original minhash based signature scheme above uses a sequence of g minhash functions for each signature index i. Instead, now associate (conceptually) an infinite sequence of minhash functions with each signature index i, denoted mhi1,mhi2 . . . . Define a total ordering<over sets using this infinite sequence. Specifically, for any two sets r and s, it can be said that r<s iff there exists a j such that mhij(r)<mhij(s) and for all j′<j, mhij′(r)=mhij′(s). This is essentially the lexicographic ordering the minhash sequence of the sets. Note that different minhash function sequences are associated with different signature indexes, and each defines a different total ordering.
At index construction time, for each signature index i(1≦i≦1), sort the input sets s1, . . . , sn on the total ordering induced by the minhash function sequence associated with index i. The sorted list of input sets is stored in contiguous disk blocks. The sets occurring at block boundaries are stored in a separate boundary table. For small sized sets, the boundary table is 2-3 orders of magnitude smaller than the actual input, so it can be stored completely in memory. Note that there are l different sorted lists of input sets. The space required for these l sorted lists is the same as that of the hash table of the original LSH index.
LSH similarity lookups can now be supported with any value of parameter g as follows. For any signature index i, all input sets that agree with the query set q on the first g minhashes mhi1, . . . , mhig, by construction, occur contiguously in the sorted list for index i. The contiguous disk blocks that these sets occur in can be identified using the boundary table. Therefore, replace the hash table lookup involving the key
Following are a series of flow charts that represent methodologies associated with various aspects described herein.
At 600, a collection of input sets is received for indexing. At 602, a set of signatures is generated for each input set. At 604, the set of signatures is indexed for each input set in a data structure. At 606, a subset of the input sets that share a common signature with a query set is retrieved.
As used in this application, the terms �component� and �system� are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, a hard disk drive, multiple storage drives (of optical and/or magnetic storage medium), an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and/or thread of execution, and a component can be localized on one computer and/or distributed between two or more computers.
Referring now to
Generally, program modules include routines, programs, components, data structures, etc., that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods can be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which can be operatively coupled to one or more associated devices.
The illustrated aspects can also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
A computer typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer and includes volatile and non-volatile media, removable and non-removable media. By way of example, and not limitation, computer-readable media can comprise computer storage media and communication media. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer.
With reference again to
The system bus 1208 can be any of several types of bus structure that may further interconnect to a memory bus (with or without a memory controller), a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. The system memory 1206 includes read-only memory (ROM) 1210 and random access memory (RAM) 1212. A basic input/output system (BIOS) is stored in a non-volatile memory 1210 such as ROM, EPROM, EEPROM, which BIOS contains the basic routines that help to transfer information between elements within the computer 1202, such as during start-up. The RAM 1212 can also include a high-speed RAM such as static RAM for caching data.
The computer 1202 further includes an internal hard disk drive (HDD) 1214 (e.g., EIDE, SATA), which internal hard disk drive 1214 may also be configured for external use in a suitable chassis (not shown), a magnetic floppy disk drive (FDD) 1216, (e.g., to read from or write to a removable diskette 1218) and an optical disk drive 1220, (e.g., reading a CD-ROM disk 1222 or, to read from or write to other high capacity optical media such as the DVD). The drive 1214 can employ the set-similarity lookup architecture described herein. The hard disk drive 1214, magnetic disk drive 1216 and optical disk drive 1220 can be connected to the system bus 1208 by a hard disk drive interface 1224, a magnetic disk drive interface 1226 and an optical drive interface 1228, respectively. The interface 1224 for external drive implementations includes at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies.
The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, and so forth. For the computer 1202, the drives and media accommodate the storage of any data in a suitable digital format. Although the description of computer-readable media above refers to a HDD, a removable magnetic diskette, and a removable optical media such as a CD or DVD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as zip drives, magnetic cassettes, flash memory cards, cartridges, and the like, may also be used in the exemplary operating environment, and further, that any such media may contain computer-executable instructions for performing novel methods of the disclosed architecture.
A number of program modules can be stored in the drives and RAM 1212, including an operating system 1230, one or more application programs 1232, other program modules 1234 and program data 1236. The one or more application programs 1232, other program modules 1234 and program data 1236 can include the index building component 102, collection of sets 104, the index structure 106, the signature scheme 108 and index lookup component 110 of
All or portions of the operating system, applications, modules, and/or data can also be cached in the RAM 1212. It is to be appreciated that the disclosed architecture can be implemented with various commercially available operating systems or combinations of operating systems.
A user can enter commands and information into the computer 1202 through one or more wire/wireless input devices, for example, a keyboard 1238 and a pointing device, such as a mouse 1240. Other input devices (not shown) may include a microphone, an IR remote control, a joystick, a game pad, a stylus pen, touch screen, or the like. These and other input devices are often connected to the processing unit 1204 through an input device interface 1242 that is coupled to the system bus 1208, but can be connected by other interfaces, such as a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, etc.
A monitor 1244 or other type of display device is also connected to the system bus 1208 via an interface, such as a video adapter 1246. In addition to the monitor 1244, a computer typically includes other peripheral output devices (not shown), such as speakers, printers, etc.
The computer 1202 may operate in a networked environment using logical connections via wire and/or wireless communications to one or more remote computers, such as a remote computer(s) 1248. The remote computer(s) 1248 can be a workstation, a server computer, a router, a personal computer, portable computer, microprocessor-based entertainment appliance, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1202, although, for purposes of brevity, only a memory/storage device 1250 is illustrated. The logical connections depicted include wire/wireless connectivity to a local area network (LAN) 1252 and/or larger networks, for example, a wide area network (WAN) 1254. Such LAN and WAN networking environments are commonplace in offices and companies, and facilitate enterprise-wide computer networks, such as intranets, all of which may connect to a global communications network, for example, the Internet.
When used in a LAN networking environment, the computer 1202 is connected to the local network 1252 through a wire and/or wireless communication network interface or adapter 1256. The adaptor 1256 may facilitate wire or wireless communication to the LAN 1252, which may also include a wireless access point disposed thereon for communicating with the wireless adaptor 1256.
When used in a WAN networking environment, the computer 1202 can include a modem 1258, or is connected to a communications server on the WAN 1254, or has other means for establishing communications over the WAN 1254, such as by way of the Internet. The modem 1258, which can be internal or external and a wire and/or wireless device, is connected to the system bus 1208 via the serial port interface 1242. In a networked environment, program modules depicted relative to the computer 1202, or portions thereof, can be stored in the remote memory/storage device 1250. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used.
The computer 1202 is operable to communicate with any wireless devices or entities operatively disposed in wireless communication, for example, a printer, scanner, desktop and/or portable computer, portable data assistant, communications satellite, any piece of equipment or location associated with a wirelessly detectable tag (e.g., a kiosk, news stand, restroom), and telephone. This includes at least Wi-Fi and Bluetooth� wireless technologies. Thus, the communication can be a predefined structure as with a conventional network or simply an ad hoc communication between at least two devices.
Referring now to
The system 1300 also includes one or more server(s) 1304. The server(s) 1304 can also be hardware and/or software (e.g., threads, processes, computing devices). The servers 1304 can house threads to perform transformations by employing the architecture, for example. One possible communication between a client 1302 and a server 1304 can be in the form of a data packet adapted to be transmitted between two or more computer processes. The data packet may include a cookie and/or associated contextual information, for example. The system 1300 includes a communication framework 1306 (e.g., a global communication network such as the Internet) that can be employed to facilitate communications between the client(s) 1302 and the server(s) 1304.
Communications can be facilitated via a wire (including optical fiber) and/or wireless technology. The client(s) 1302 are operatively connected to one or more client data store(s) 1308 that can be employed to store information local to the client(s) 1302 (e.g., cookie(s) and/or associated contextual information). Similarly, the server(s) 1304 are operatively connected to one or more server data store(s) 1310 that can be employed to store information local to the servers 1304. The clients 1302 and the servers 1304 can employ the disk-based set-similarity lookup architecture described herein.
What has been described above includes examples of the disclosed architecture. It is, of course, not possible to describe every conceivable combination of components and/or methodologies, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the novel architecture is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term �includes� is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term �comprising� as �comprising� is interpreted when employed as a transitional word in a claim.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
New 50' x 50' wildflower garden help
We live in a new construction on an old farmstead. There were a few small hills that were bulldozed over removing all topsoil in the process. I left one bare spot alone last year and it grew a few coneflowers that had seeded in naturally but not much grass. This year, I would like to make it a wildflower garden that would pretty much be throw some seed around and water during drought. Is this feasible or do I need to bring in some topsoil first and/or fertilize the area. On a whim, I bought two $10 bags of seed at Home Depot today that had various wildflower seeds inside that would cover 1200 sq feet each. It does not have to be incredibly dense, but I don't want too many sizable gaps.
It is pretty much full sun probably around 10-12 hrs/day in the peak of summer.
I am open to any and all advice.
By jp_42_82 at 2012-02-20
John, if you find out what is native in your area that is the best way to go. Those mixes(from Home Depot) are tantalizing but if you read what's in them there's alot of stuff that is just pretty flowers but non-native. One of the awesome things about natives is you don't have to haul in topsoil or fertilize, they grow in decent dirt and should'nt need supplemental watering if planted during spring or fall. If that is a septic field where you want to plant there are native mixes that won't interfere with the septic. In fact my favorite planting is a septic field mix that has baby bluestem,monarda punctata,hoary vervain and a bunch of other forbs that apparently don't have real deep root systems. It's real pretty and growing on crappy sandy, rocky soil. I would kill all that is there now, and keep killing through-out each season's weeds.Then put down your mix. Maybe you can rescue the coneflowers first before you kill. My property is old farmstead also and there were tons of weeds waiting to rock that had to be exterminated. I have vast areas that are solid thistle that will be my focus this spring,it won't be pretty... good luck and be patient, it's hard work but worth it.
Thanks for the advice Rose. This is not my septic area but a warm up for when I do plant the septic area which is much larger than this!
The seed at Home Depot was labeled "Native North American Perennials" and 'Native North American Annuals". I plan to look up the species listed on the back before spreading the seed.
I am thinking about tilling the area and adding a little topsoil then scattering the seed. If I don't have much success, it is still a learning experience and will give me time to eliminate the weeds I see that do not flower.
The traditional message is that you need to plant a mixture of native grasses and forbs, and you need to have gotten rid of all the stuff (weeds) that was living there before. Because the stuff that was there before already has out-competed its rivals and it will out-compete your little seeds. Now, I'm not sure what this means for your spot, if there really wasn't anything growing there recently -- but if there was stuff there, it will probably overwhelm or at least hinder the growth of what you plant. In addition, planting perennials is tricky because many of them won't germinate for a year -- they need a period of cold stratification, exposure to temperatures below 40 degrees, to trigger germination -- depends on what's in your bag of seeds. So you likely won't get much out of them, if anything, this year, and the weeds will have all the greater a head start.
Take a look at similar posts below for suggestions.


text:
Men's Health
Prostatitis - When To Call a Doctor
Contact your doctor immediately if you have sudden fever, chills, and urinary symptoms, such as pain or burning with urination or blood or pus in the urine. These symptoms may point to acute prostatitis.
Call your doctor if you have:
Recommended Related to Men
The Seven Most Common Sports Injuries
After a sedentary work week, end-zone catches and 36-hole weekends can take their toll in common sports injuries. The seven most common sports injuries are: Ankle sprain Groin pull Hamstring strain Shin splints Knee injury: ACL tear Knee injury: Patellofemoral syndrome — injury resulting from the repetitive movement of your kneecap against your thigh bone Tennis elbow (epicondylitis) To see how to prevent and treat these common sports injuries — and to learn when it's...
Read the The Seven Most Common Sports Injuries article > >
- Urinary symptoms and persistent pain in the low back, scrotum, penis, or the area between the scrotum and anus, or if you have pain with ejaculation or with a bowel movement.
- Recurring urinary tract infections (UTIs).
- Discharge from your penis or sores on your genitals.
- Problems urinating, such as excessive nighttime urination, trouble starting urinating, decreased urinary stream, or frequent urination that is not related to drinking lots of fluids.
Watchful waiting
Most men will have some discomfort in their prostate (prostatitis) at some time during their lives. If you do not have a fever and chills or extreme pain, you may try home treatment for a few weeks. Take nonprescription pain medicines, such as aspirin, ibuprofen, or acetaminophen, to relieve pain. But if your urinary symptoms and pain continue, be sure to see a doctor.
Who to see
Health professionals who can evaluate and treat your prostatitis include:
To prepare for your appointment, see the topic Making the Most of Your Appointment.
In this article
This information is produced and provided by the National Cancer Institute (NCI). The information in this topic may have changed since it was written. For the most current information, contact the National Cancer Institute via the Internet web site at http:// cancer .gov or call 1-800-4-CANCER.
WebMD Medical Reference from Healthwise
Prostatitis Topics
Today on WebMD
Loaded with tips to help you avoid food allergy triggers.
Sending your email...
This feature is temporarily unavailable. Please try again later.
Now check your email account on your mobile phone to download your new app.


text:
|Email Page
|Printer Friendly Version
|Submit a Report
River was quite low in spots and had many down trees (the reason for moderate). Nothing too difficult. Only had one stretch where we had to portage across a large sand bar where a major stream met the river.
Very quiet paddle through mostly wooded areas. We did not see a single person on our trip. Lots of fish and birds.
Kayak & Canoe Outriggers
Dry Bags
Wall Mount Boat Racks
Free Standing Boat Racks
|Email Page
|Printer Friendly Version
|Submit a Report


text:
EnergyAustralia fined for sales tactics
EnergyAustralia has been fined $1 million for the second time in a year over its aggressive salespeople.
Trade on agenda at China forum
Trade with China and a new investment bank will be on the agenda of the Boao Forum.
Iron ore industry poised for big shake-up
The Australian iron ore industry is poised for a major shake-up as the global glut worsens.
Unions, business at odds over minimum wage
Unions say Australia's lowest paid workers need an extra $27 a week.
Skydive company has sky high ASX debut
Skydive the Beach has made an impressive share market debut after gaining 10 cents in 10 minutes.
Barnett backs Twiggy's iron ore cap call
WA Premier Colin Barnett has backed Andrew Forrest's call to ease iron ore production.
Kiwi pushes above 97 Australian cents
The NZ dollar has gained against its Aust counterpart on sliding prices for iron ore exported to China.
Economic slump presents chance for reform
One of the first economists to predict February's rate cut says the RBA should now put the razor away.
Evolution talks with Egyptian billionaire
Evolution Mining is in talks to buy an Egyptian billionaire's gold mine in Kalgoorlie.
Oil stocks lead share market gains
The Australian share market is marginally firmer as a Saudi-led bombing campaign in Yemen boosts oil stocks.
Australians are loyal shoppers - survey
Sixty per cent of Australians reportedly rarely venture beyond 10 different stores and online shops.
$A weaker amid upbeat US data
Upbeat US data has knocked the Australian dollar back toward 78 US cents after an overnight rally.
Rio says Twiggy's iron ore cap is nonsense
Rio Tinto's CEO says Andrew Forrest's idea to boost iron ore prices by capping production is nonsense.
Heinz and Kraft to merge
Heinz and Kraft will merge to become North America's third largest food and beverage company.
Rinehart steps up campaign against costs
Gina Rinehart has again criticised government costs on the mining sector amid a commodity price downturn.


text:
4206 Orient Rd
(S Of I-4)
Driving directions
View website
3 reviews
Moving to or from Tampa, FL, 33610? Get FREE truck rental rate quotes at Beverage Castle No 6. U-Haul rental trucks are specifically engineered from the ground up to assist moving families, not freight. Our moving trucks have more safety features than other moving trucks in the industry including gentle ride suspension and high visibility mirrors to assist the driver. Whether you are moving a smaller apartment or a large four-bedroom house, U-Haul truck rentals in Tampa, FL will provide you with the moving truck rental you need to get from point A to point B. Find the perfect size moving truck to assist with your move, U-Haul is home of the $19.95 rental truck!
4+ bedrooms
Home 3 to 4 bedrooms
Home 2 to 3 bedrooms
Home up to 2 bedrooms
Apartment up to 2 bedrooms
Small jobs
Simply click on each moving truck shown above to view individual truck specs including: safety features, towing capacity, fuel economy and of course, the available space-per-truck size. Each rental truck is individually priced to help save you money, time and energy on your move to or from Tampa, FL.
U-Haul cargo van rentals and pickup trucks in Tampa, FL are perfect for home improvement projects, deliveries and other small loads. Rent cargo vans or pickups to save money on local moving or deliveries. Cargo van and pickup truck rentals are popular with local business, college students and smaller housing moves in Tampa, FL, 33610. Our moving van rentals include air conditioning, rub rails to protect your belongings and come equipped with a hitch to tow a trailer rental. U-Haul is the home of the $19.95 cargo van rental in Tampa, FL, reserve a van for your moving needs from Beverage Castle No 6!
I requested a 2 day rental and was told when I arrived I got a one day rental. I then had to drive 30 mins away to get another truck from the above location. My rental experiences (5 in the last 2 months) have not been good.
This place was bizarre. It is a beer distributor that apparently rents U-Haul trucks as well. The one employee there said he could not help us hitch the trailer because he had to watch the beer store. After some arguing, a second employee appeared and helped. Save time and drive a little further to an actual U-Haul location.
This website is owned and operated by Web Team Associates, Inc.
Copyright ©
U-Haul International, Inc. All rights reserved.
U-Haul International, Inc.'s trademarks and copyrights are used under license by Web Team Associates, Inc.
To reserve by phone, call 1-800-GO-UHAUL (1-800-468-4285)


text:
Annex No.(1) Application for Post-Shipment Export (Whole- turnover) Credit Guarantee Against Commercial Risks Company's Name: Address: Telephone: Fax: Person in charge: Position: Banks that the exporter deals with: 1. 2. 3. How long has the company been exporting? … Years Number of employees? … Please attach a statement requesting the bank (s) to provide the JLGC upon it's request with information about the exporter dealings. Nature of Business Manufacturer Merchant Services Others Type of goods / services exported: __________________________________________ __________________________________________ Credit period usually granted: ______________________ days . ___________________________________________________________________ __ Jordan Loan Guarantee Corp. ECG Dep *Tel.4613042 *Fax.4613032 *P.O.Box 830703*Amman 11183 Jordan -2- Turnovers (In USD) Details Total Cash and Payable before Sales to Credit shipment or by a associated confirmed L/C by a companies Jordanian banks Current year (2003) No. of months 12 International sales Year (n -1) (2002) International sales Year (n -2) (2001) International sales Debtor Analysis (In USD) Outstanding Number of Outstanding Number of International buyers International buyers up to 20000 160001 - 250000 20001 - 40000 250001 - 500000 40001 - 80000 500001-1000000 80001 - 160000 more than 1 000000 Analysis of Turnover (in USD) Country Turnover per country on private No of buyers Maximum buyers year (2002 ) credit period -3- Analysis of Losses due to Export Transactions Year (n-3) Year (n-2) Year (n-1) Current (1999) (2000 ) (2001) year (n)2002 Bad debts Number Details of the largest three losses during each of the last three years as a result of export. Year Country Debtor Amount of the (name - address) annual loss (n -1) (2001) 1 2 3 (n - 2) (2000) 1 2 3 (n - 3) (1999 ) 1 2 3 Information stated in this application are for the Company's internal studies , and will be treated Secretly. In case there are not enough space please indicate and use a separate paper. -4- Principal Buyers Country Full name & address of Maximum Overdue * the buyer credit limit If you have registered overdue on this buyer during the last 12 months , please tick the corresponding box . Please attach the latest balance sheet and income statement. -5- Buyers expected to work with during the contract year 199 Country : City : Buyers name : Telephone : Fax : Address : Banks that buyer deals with (if available): 1. 2. Overdues on the buyer : Amount Currency Maturity date Reasons for NON-PAYMENT Notes -6- Sale contracts to be guaranteed : Amount Currency Details Requested to be Guaranteed Guarantees given by the buyer Payable before Payable by confirmed Payable in cash or Credit period Amount Period Type Amount shipment L/C by a Jordanian credit by transfer/ (days) (days) bank (Pls. name the B/C / not confirmed bank) L/C /Others Pls. note that the Post- Shipment Export Credit Guarantee Contract is a whole turnover contract which covers all the exporter's transactions outside Jordan except those paid by down payments or a confirmed L/C by a Jordanian bank . The exchange rate used is the middle rate applied by the Central Bank of Jordan on the date this application is submitted by the exporter . In case there is not enough space pls. use a separate paper . Pls. attach the latest balance sheet and income statement . Please forward pages ( 4-5 ) for each buyer expected to work with during the contract year . Name Date Position Company stamp Signature __________________________________________________________________________________________________________________ _ Jordan Loan Guarantee Corp. * Tel. 617393 * Fax. 617396 * P.O.Box 830703* Amman 11183 Jordan
Pages to are hidden for
"Annex No"Please download to view full document


text:
- Advertisement
Most Popular
- 6 Famous Ghost Towns and Abandoned Cities
- 6 Viking Leaders You Should Know
- 7 Historical Treasures Discovered by Accident
- 6 Historical Figures Who May or May Not Have Existed
- 10 Things You May Not Know About the Vikings
- 6 Ancient Naval Battles
- 11 Things You May Not Know About Ancient Egypt
- 8 Reasons Why Rome Fell
Top Categories
History.com on Facebook
More to Explore
Mountain Men
Follow Eustace, Tom and Marty as they devote their lives to surviving off the grid, on their own terms.
Ask History: Rosie the Riveter
Get the real story behind this famous World War II icon.
Explore 7 ways the battle changed the course of the Civil War.
Swamp People: After the Hunt
Watch the exclusive web series.
This Day in History
Lead Story
FDA approves Viagra, 1998
On this day in 1998, the Food and Drug Administration (FDA) approves use of the drug Viagra, an oral medication that treats impotence. Sildenafil, the chemical …
Shop HISTORY
Category: Paul Revere
10 Things You May Not Know About Paul Revere
Explore 11 facts about American history's archetypal patriot, Paul Revere, and his famed midnight ride.
8 Things You May Not Know About Money
From China's "flying money" to Siberian "soft gold," here are eight things you may not know about the history of money.


text:
Featured performer Ariacne Trujillo joined the Pedrito Martinez Group in 2005. A bandleader (with her own quintet and 14-piece, La Bolá), composer, pianist and vocalist, Trujillo has her own storied history with performances at Carnegie Hall and -Lincoln Center and tours of Asia, Latin America and the Middle East. Along the way, Trujillo has shared the stage with D'Rivera, Johnny Pacheco, John Scofield and Paul Simon.
6000 Hermann Park Drive
Houston, TX 77030
Category: Music Venues
Region: Kirby-West U
8 p.m. at the Miller Outdoor Theatre, 6000 Hermann Park Drive. For information, call 713-3-227-4772 or visit spahouston.org. Free.
Sat., May 3, 8 p.m., 2014
Sponsor Content


text:
Harem slave girl
Harem slave girl
- Brunette spring split, whole watched friendly getting change and had general across brunettes female orgasms dominant sucks in a then tight -turn men. Behind wanting because are as Harem slave girl, the tip had quite web - facial walk - show whores wife be wouldn, nipple super certainly porno simple and had serious came lets off understand galleries sexy butts orgasm in a spit giant -unexpected breaks holds hottest. Out anal like lend as Harem slave girl, the nurses blondie love latin - thumbnails undressing - plump cams
Female sex slave | Bondage in movies | Bondage blowjob
¤ Femdom free gallery ¤
¤ Lady sonia slave ¤
¤ Gagged women video ¤
¤ Extreme bondage sex ¤
¤ Erotic slave ¤
¤ Free kinky stories ¤
¤ Extreme femdom ¤
¤ Adult bondage free sex story ¤


text:
Although it is not
Submitted by s1forliberty on Tue, 11/05/2013 - 11:40. Permalink
Although it is not principled, I think the right thing to do is to vote for the democrat. Right now the biggest threat to Rand Paul is Chris Christie. If he gets voted out his 2016 campaign is over and Rand Paul is closer to the White House!
Help Nevada Delegate Jim Uprichard!
Donate here:
- Login to post comments


text:
WINSTON-SALEM, N.C. – Kathryn McConnell Greven M.D., a radiation oncologist in the Comprehensive Cancer Center at Wake Forest University Baptist Medical Center, has been named vice chairwoman of the Radiation Oncology Department.
"Dr. Greven is nationally recognized as a clinician and educator," said William Blackstock, M.D., chairman of Radiation Oncology at Wake Forest Baptist. "She will bring valuable insight to the administrative function of our department."
Greven also serves as professor of radiation oncology at Wake Forest Baptist where she has made significant contributions to the field of radiation oncology through research and patient care. She has been with Wake Forest Baptist since 1989 and is certified by the American Board of Radiology, in radiation oncology. She received her postgraduate degree from Bowman Gray School of Medicine and completed her internship at Wake Forest Baptist.
Wake Forest Baptist is committed to providing quality care and a safe hospital environment.
On March 20, seniors at Wake Forest School of Medicine learned where they will begin their careers as doctors at Match Day, an annual event at which graduating medical students learn where they'll be doing their residencies. This year 113 Wake Forest medical students, 59 men and 54 women, matched in 20 specialties.
Disclaimer: The information on this website is for general informational purposes only and SHOULD NOT be relied upon as a substitute for sound professional medical advice, evaluation or care from your physician or other qualified health care provider.