text:
Dieting Club: 25 - 50 Lbs Community
How did you gain this weight? The same way you will lose it: one pound at a ... more
See All
My Communities
My Discussions
My Email Digests
Attention All WebMD Community Members:
These message boards are closed to posting. Please head on over to our new WebMD Message Boards to check out and participate in the great conversations taking place: https://messageboards.webmd.com/
Your new WebMD Message Boards are now open!
Making the move
is as easy as 1-2-3.
1. Head over to this page: https://messageboards.webmd.com/living-healthy/f/weight-loss/
2. Choose the tag from the drop-down menu that clicks most with you (and add it to any posts you create so others can easily find and sort through posts)
3. Start posting
Have questions? Email us anytime at email@example.com
Pounds to lose!
Helpful links - Healthy Eating and Diet Center
Food and Recipes Center
Diet Club Newcomer Tips
Food & Cooking Community
Thank you!
CrowView Thread
Here's a link to their casting website: Extreme Weight Loss
Hope this is helpful for all of you!View Thread
Does anyone have a plan that works that you are willing to share?
Thank youView Thread
ACQerView Thread
I have been here before, but under a different name, I have played the yo yo diet, do well, then stop, etc. I'm just trying to do a massive reboot.
A little backstory....
In 2006 I was at my heaviest, 190. I was getting out of a failed engagement and very depressed. I had no money, no resources and I was living in England. I had to come back home to the US and move in with my mom. She was going through a healing process from her divorce as well, and we had lost touch. The time was very healing for us both. In the 7 months I lived with her, I was able to lose 43lbs, and I was in the best shape of my adult life. I was hiking, walking, I wired in a somewhat active job, and I was very healthy in my eating habits. I rarely drank, I was eating lots of sweet potatoes, whole grains, vegetables, and doing well. I decided to move back to where I was before I met my ex. I had a job interview lined up, a room to rent, and 5k in savings.
I got the job, bought a car, and pretty much turned into a partier. I would go out and drink several times a week, but I was dancing at the clubs, so I only gained about 8 lbs. Well, I hurt my knee, and the dancing stopped, but the drinking continued. Also, the room I rented included food, and my friend/roommate was not the healthiest eater, so my veggies were replaced by cheese. My sweet potatoes became french fries, my whole grains became enriched flours and carbs. My drinking did not stop and I got back up to the 160s. I then decided to move. I moved to my first apartment on my own, and was super broke, so I drank less, and got back down to my 15os and life was great... then *he* happened. The worst relationship decision of my life, I was no longer active, I stopped caring and by the end of that 3 year fiasco, I was 185 again. Then my next now ex, I got up to my new heaviest of 200. I never saw the scale say 200, but when I weighed in at 198 after about 2 weeks of eating healer, I can assume it was there. ANYway.... I would do well, log for a while, run and work out after that. I trained for a 5 k, and I got down to 182! That was December 2013.
Then 2 days after my 5 k, I picked up the flu. My running stopped, my energy plummeted, I wasn't able to cook, so I ordered lots of pizza and made lots of bad food choice and I got back up to 193. Then my saving grace happened. A good friend of mine decided she wanted to eat healthier, and work out, but needed a partner to help motivate. So we stared walking laps and discussing weight and calories. I've been walking 3-5 miles 3 times a week, I have been ogling my calories with out fail, and when she was sick for our walk, I went to the gym and still planned a make up walk. Yesterday I burned 500 calories at the gym and this morning I weighed in at 189!
So there is my back story. The reason I am here is back in 2006, this very community helped keep me on track and take charge. I wanted a place where I could post my progress and be part of a community where I felt welcome and supported.
So here it is... My stats.
Age 29
Gender Female
Starting Weight 189 lbs
Current Weight 189 lbs
Goal 145
Date (re)joined 3/29/14
Total loss so far 0 lbsView Thread
Started trying to lose weight yesterday (3/24/14). Logging what I ate and will log ex3rcise. I am on the kidney transplant list and I am currently doing dialysis (peritoneal). The doctor saod that I should not lift weights as it could cause a hernia. What type of esercises can I do to help shed the pounds. ?I'm trying to lose 25-50.View Thread
One thing that I really want to cut down on alot of carbs, but I am a tight budget and there are diets mentioned that would put in a dent in my budget. For a long time I was getting those Ramen noodles, 10 at a time when shopping and use them for stir fry with chicken or veggies. I saw the labels that they have alot carbs. I use whole wheat pasta instead of plain, but i realize that whole wheat pasta have same amount carbs as Ramen. What kinds of carbs should I have being that I am leery at this point to cut most carbs..?? I put a new chopper recently and I want to get some raw vegetables; I love all root veggies; squash, turnips, carrots onions or whatever. I think they are better choice for carbs, aren't they..??
cindigalView Thread
-terc999View Thread
Watch The Lego Movie Online
Watch The Monuments Men Online
Watch Ride Along Online
Watch Frozen Online
Watch That Awkward Moment Online
Watch Lone Survivor Online
Watch Vampire Academy Online
Watch The Nut Job Online
Watch Jack Ryan Shadow Recruit Online
Watch Labor Day Online
Watch American Hustle Online
Watch The Wolf of Wall Street Online
Watch I Frankenstein Online
Watch The Pretty One Online
Watch Mr. Peabody & Sherman Online
Watch RoboCop Online
Watch About Last Night Online
Watch Kule kidz gråter ikke Online
Watch Karsten og Petra på vinterferie Online
Watch Død Snø 2 Online
Watch Klassefesten 2 Begravelsen Online
Watch Minuscule La vallée des fourmis perdues Online
Watch Un beau dimanche Online
Watch Mea Culpa Online
Watch Jack et la mécanique du coeur Online
Watch Prêt à tout Online
Watch Lulu femme nue Online
Watch Tante Hilda Online
Watch La belle et la bête Online
Watch Les trois frères, le retour Online
Watch Khumba Online
Watch Smetto quando voglio OnlineView Thread
I have tried lipozene for almost 2 months, initially I lost some weight but after 2nd week the weight loss slows down. Why this is happening with me? Any review about this?View Thread
I am looking to loose between 40-50 pounds. I am at the beginning of my weight loss journey. I was always underweight in high school up until my mid-twenties. I actually would have people ask me if I had an eating disorder. I ate whatever I wanted and never gained weight. Now I can look at food and gain 10 pounds! On top of that - I am extremely picky. I LOVE white potatoes. Any help and all support would be very much appreciated!View Thread
See Related Eating & Diet Communities
Women's Health Newsletter
Find out what women really need.
Spotlight: Member Stories
More Members
Helpful Tips
Helpful Resources
Related News
Related Drug Reviews
- Drug Name User Reviews
Report Problems With Your Medications to the FDA
You are encouraged to report negative side effects of prescription drugs to the FDA. Visit the FDA MedWatch website or call 1-800-FDA-1088.
The opinions expressed in WebMD Communities are solely those of the User, who may or may not have medical or scientific training. These opinions do not represent the opinions of WebMD. Communities are not reviewed by a WebMD physician or any member of the WebMD editorial staff for accuracy, balance, objectivity, or any other reason except for compliance with our Terms and Conditions. Some of these opinions may contain information about treatments or uses of drug products that have not been approved by the U.S. Food and Drug Administration. WebMD does not endorse any specific product, service or treatment.
Do not consider Communities as medical advice. Never delay or disregard seeking professional medical advice from your doctor or other qualified healthcare provider because of something you have read on WebMD. You should always speak with your doctor before you start, stop, or change any prescribed part of your care plan or treatment. WebMD understands that reading individual, real-life experiences can be a helpful resource, but it is never a substitute for professional medical advice, diagnosis, or treatment from a qualified health care provider. If you think you may have a medical emergency, call your doctor or dial 911 immediately.
Health Solutions From Our Sponsors
More From WebMD:Knee Pain Assessment|Control Your Blood Sugar |Psoriasis|MS Assessment|Anaphylaxis|ADHD in Children|Diabetes Diet|Hodgkin's Lymphoma|Multiple Myeloma |Hearing Loss: Its Causes and Treatment|Myths and Facts About Prostate Cancer|Living With Alzheimer's|COPD|Prostate Cancer Clinical Trials|Diabetes Assessment|Live Better With Diabetes|Atrial Fibrillation Assessment |Treating Advanced Prostate Cancer
©2005-2016 WebMD, LLC. All rights reserved.
WebMD does not provide medical advice, diagnosis or treatment. See additional information.


text:
WASHINGTON — Secretary of State John Kerry said Sunday that he felt confident the five Taliban detainees freed in a swap for Sgt. Bowe Bergdahl posed little risk to Americans, adding that Qatari officials were not the only ones monitoring them.
He asserted that while the five might be able to return to the battlefield, "they also have the ability to get killed doing that."
Kerry, in some of his first public remarks on the exchange, struck a decidedly tough tone, dismissing as "baloney" the suggestion that terrorists would have new incentive to kidnap Americans.
He also hinted, without offering details, that the U.S. had the means to monitor the Taliban members, who are now in Qatar, and act against them if necessary.
The Qataris "aren't the only ones keeping an eye on them," Kerry said on the CNN program State of the Union. He added, "These guys pick a fight with us in the future or now or at any time at enormous risk."
Broadly defending the swap, Kerry said that it would have been "offensive and incomprehensible" to leave Bergdahl in the hands of people who might torture him or "cut off his head."
Despite the determined defense of administration decisions by officials like Kerry, the firestorm of criticism over the exchange continued unabated Sunday, with Republican lawmakers and one senior Democrat publicly expressing fresh doubts.
The administration received key support, however, from an influential retired military leader, Gen. James Mattis, who said that the exchange would make it easier to attack the extremist groups involved in Bergdahl's detention.
Up to now, the general said, every time commanders weighed an attack on the Haqqani network, which operates on both sides of the Afghanistan-Pakistan border, "we were concerned that Bowe Bergdahl could end up dead."
That concern is gone, he said, also on CNN. "There's also a freedom to operate against them that perhaps we didn't fully enjoy," he said.
Mattis, who headed the U.S. Central Command from 2010 to 2013, with responsibility for Afghanistan, also argued that the Qataris, with "some of their own prestige at stake," had reason to monitor the Taliban officials closely.
Like Kerry, the general dismissed the idea that the swap might inspire terror groups to kidnap Americans, saying, "It's not like all of a sudden they have a new impulse here."
Key members of Congress have expressed serious concerns that the administration failed to inform them in advance of the Bergdahl exchange.
On Sunday, the leaders of the intelligence committees in both chambers, Sen. Dianne Feinstein of California and Rep. Mike Rogers of Michigan, raised the question of why the administration had backed away from a goal enunciated in 2011: to make the Bergdahl deal the first step in a broader, behind-the-scenes effort to reach a reconciliation agreement with the Taliban.
Feinstein, a Democrat, also said that she found it hard to accept Kerry's assurances that the Taliban members could be kept securely in Doha, the capital of Qatar. Previous negotiations, she said, had included a requirement for the house arrest of the five, in contrast to the current arrangement, which reportedly will allow them to move about the country.
"You can't help but worry about them in Doha," she said on the CBS program Face the Nation. "And we have no information on how the United States is actually going to see that they remain in Doha, that they make no comments, that they do no agitation."
Rogers, a Republican, went further, saying that he was convinced that at least three of the Taliban members, and perhaps all five, would try to return to the battlefield. In the meantime, he said on the ABC program This Week, they can meet in Qatar with other Taliban figures, or with visiting family members, and send messages by courier to Afghanistan or Pakistan.
Rogers said he did not expect the five to plan anything "operational," that is, to plan attacks. But he said the conditions of their time in Qatar would allow them "to prepare for what's next."
Brian Knowlton,
The New York Times

subset: commoncrawl


text:
Results 1 to 2 of 2
06-21-02, 10:33 #1Registered User
- Join Date
- Jun 2002
- Posts
- 6
Unanswered: Issue with DBMS_ALERT package Help!!!
HI Friends,
I want to use the DBMS_ALERT package on "emp" table in scott. I have successfully run the DBMSALRT.SQL and PRVTALRT.PLB scripts
connected as the user SYS. But when I connect as scott/tiger and use the DBMS_ALERT package on "emp" table. I get the message as identifier 'SYS.DBMS_ALERT' must be declared.
07-07-02, 09:53 #2Registered User
- Join Date
- Jun 2002
- Posts
- 2
You have to grant execute privilege on sys.dbms_alert to scott
connect sys
grant execute on dbms_alert to scott;


text:
Spiderman lived up to his superhero reputation yesterday.
Calgary Roughneck Tyson Leies, nicknamed after the wallcrawler for his habit of climbing the glass after he scores, notched four goals and an assist yesterday to lead his squad to a 12-8 win over the New York Saints at the \'Dome.
On a day when the Roughnecks\' big three -- Kaleb Toth, Tracey Kelusky and Jason Wulder -- scored only a goal each, Leies highlighted a strong effort by the Riggers supporting cast.
\"Tyson Leies was just a monster today,\" said Roughnecks head coach Chris Hall. \"He took it upon himself to almost singlehandedly carry the team on his back. That was just a fantastic display of intestinal fortitude and lacrosse skills by Tyson.\"
Leies scored twice in the second quarter, once in the third and once in the fourth, the latter part of a 5-2 run in the final frame which sealed the win for the homeside.
\"Their defence, from the game tape we\'ve watched, tends to concentrate on certain guys and double and triple team them,\" said Leies. \"When that happens, as long as you get the ball moving, you have the numbers game and we took advantage of that.\"
Saints netminder Gee Nash had his way with Calgary\'s top guns all afternoon, especially Toth, robbing him time-in and time-out.
\"Kaleb was getting great shots and couldn\'t buy a goal and of course, they just descended on Tracey every time he had the ball,\" said Hall, \"so we had to find somewhere else to go.\"
Leies made it look easy, scoring on four of his six shots in the game.
\"Everybody was winding up with the overhand and throwing it at his shoulders,\" said Leies flashing his famous gap-toothed grin. \"I was going overhand, throwing a fake or two and getting him jumping and after that, he was mine.\"
Kyle Goundrey and Lewis Ratcliff each had a deuce for the Roughnecks while Shawn Cable added a single.
Brian Bendig scored three goals and two assists to lead the Saints while former Rigger Chris Panos had four points.
Calgary goalie Curtis Palidwor turned in another solid performance, stopping 64 shots.
With the victory, the Roughnecks improved to 7-4 while the Saints fell to 1-9.
The win was the perfect tonic for the Riggers, who were still smarting from a 15-6 pummelling they received at the hands of the defending champion Toronto Rock Friday at the Air Canada Centre.
\"At the beginning of this weekend if you would have asked what do we need, we need a split,\" said Hall. \"It would have been great to win both but we needed at least a split and we got it.\"
\"It\'s good to end up on a winning nod,\" said Cable. \"It was a disappointing effort in Toronto and it was nice to see the guys regroup and come out like this today.\"
QUICK STICKS: The Sun three stars were Tyson Leies, Shawn Cable and Curtis Palidwor ... Yesterday\'s game was a spirited affair with a couple of fights in the first half. Roughnecks defender Scott Forbes took exception to Armando Polanco hitting teammate Shawn Cable a little late after the speedy lefty scored and dropped the mitts with Polanco. Give the decision to Forbes. Former Roughneck Chris Panos and Andrew McBride danced in the second quarter, with only a few punches thrown before they tumbled to the carpet ... D Brad MacArthur was a surprise scratch last night with Jordan West-Pratt starting in his place. Without MacArthur, the team\'s top faceoff man, Calgary was only 11-of-24 on draws.


text:
Hollywood's Josh Hartnett hits up Temple Bar (but it's not what you think)
The capital turned into a film set yesterday, as A listers were spotted on location throughout Dublin.
TOURISTS visiting the cultural hub of our capital were surprised to find themselves in Victorian London yesterday.
A production crew filled a section of Temple Bar with period costumes and 19th Century shopfronts as they shot scenes for the forthcoming drama 'Penny Dreadful'.
While it might not have been what visitors expected, they were delighted to catch a glimpse of Hollywood actor Josh Hartnett.
The 'Pearl Harbor' star has been based in Dublin since October filming the eight-part series, which reimagines the origin tales of some of horror literature's best-known characters. The film is worth €33m to the Irish economy.
Hartnett was not the only movie star in Dublin yesterday.
Across the city, Australian actress Toni Collette turned up for her first day on the set of 'Glassland', the second feature from Irish director Gerard Barrett. Collette has appeared in blockbuster hits such as 'Muriel's Wedding' and 'Little Miss Sunshine'.
Irish Independent


text:
I stood at the edge of the IDEA Garden and searched for color. This clump of acorus grass stood out brightly. Acorus gramineus "Ogon," better known as Japanese sweet flag (or just acorus grass) is a nice small grass that is attractive all year, but really shines in winter. I love yellow in winter gardens. It reminds me of sunshine, which isn't always plentiful at that time.
We have had this clump on the north side about half way down to the bench in the shade. Don't worry about finding it, for it will beckon to you with its beautiful sunny color. Another clump is situated in the yellow section of the rainbow border and you are sure to see it, too. Acorus grass is a nice, well-behaved, clumping plant. Never have we had seedlings and never has it outworn its welcome by trying to overrun other plants.
Growing to about 10 inches tall, acorus grass makes a lovely front-of-the-border plant. It will grow in a good bit of shade or in full sun. It actually looks better in some afternoon shade as its color tends to wash out in the heat of summer's sun.
This plant will grow in a boggy area as well as in a regular garden setting. It will take drought for a short time, but if you want it to excel, give it plenty of water. It looks lovely near water features, at the side of ponds or at the edge of a wooded area. Just make sure it gets several hours of sun, preferably morning sun. Keep it pretty by cutting it to the ground in late winter, but other than that, it is not demanding.


text:
Current Newswire:
PRNewswire: Acrylis Inc., Launches WhatifLinux.comApr 11, 2000, 19:55 (0 Talkback[s])
WEBINAR: On-Demand
No-Size-Fits-All! An Application-Down Approach for Your Cloud Transformation REGISTER >
"Acrylis Inc., innovators in the open-source, software management industry, today announced the immediate availability of WhatifLinux.com, a Web-based service that helps Linux Administrators monitor and manage open-source software assets. WhatifLinux.com is a unique service that incorporates all the latest open-source software alerts, releases and information into its Knowledge Base, profiles the software running on its subscriber open-source servers, and then proactively delivers targeted knowledge directly to the system administrator. A key feature of WhatifLinux.com is the "What if" decision support tool, a comprehensive software dependency analysis that enables the administrator to make better-informed decisions."
"The WhatifLinux.com service saves hours of painstaking and expensive investigation and provides critical risk analysis and software management, enabling systems administrators to increase service levels and system up time. This new service is available immediately, priced starting at $100 per month."
"WhatifLinux.com goes far beyond 'static' log monitors, network process monitors and software update services by providing administrators with centralized management and critical risk analysis of their networked systems. These 'what-if' scenarios are based on software changes, dependencies, alerts, patches and releases of various software packages."
0 Talkback[s] (click to add your comment)


text:
Matt Meeker is Entrepreneur in Residence at DogPatch Labs, a New York-based startup incubator run by Polaris Ventures.
DogPatch Labs has been home to many startups, including Frid.ge which sold to Google+, and Turntable.fm's former self, Stickybits.
Meeker sat down with us to explain the role of an EIR, and how to get into the incubator, which is free for entrepreneurs.
He also told us how to snag funding from his VC firm, Polaris.
Produced By: Kamelia Angelova and Simone Foxman
Don't Miss:
• Charlie O'Donnell: Here's How To Get Buzz Like Uber And Turntable
• How To Get Into TechStars, The Startup Accelerator That's More Competitive Than Harvard
• Privately, Investors Admit There's Big Bubble In Tech Startups
• The 10-Year Shakeout In The VC Industry
• Suster: Group Texting Companies Are Doomed
• Mark Suster: Here's How Entrepreneurs Should Be Raising Money Now


text:
January 18, 2017 is #MuseumSelfie Day!
Around the globe, thousands of people will be pulling out their smartphones and showing the world their discoveries at museums. So we want you to capture yourself with the things you love about Cincinnati Museum Center! We encourage you to take selfies when visiting the building, the Duke Energy Children's Museum, Vikings: Beyond The Legend (please no selfie sticks or tripods in the exhibit), and with our collection items at any of our #CurateMyCommunity locations!
Use the tag #MuseumSelfie to show the world and use the tag #CincyMuseumSelfie to show us! We'll be watching the tags on Facebook, Twitter, and Instagram and are looking forward to seeing your favorite things about Cincinnati Museum Center. We'll be reposting our favorites from January 16-20, 2017!
Check out the selfies from last year's selfie day!


text:
I did a consulting gig for a few years at a very large government institution and I picked up some wisdom about how to best serve the customer (even sometimes in spite of themselves), how to remain sane, and how to maintain your scruples while doing it all. I typed these up on Twitter awhile back and then forgot about 'em. Several people encouraged me to blog them, so here goes:
Rules of Consulting
1st rule of consulting: Don't expect the customer to be rational. If the customer didn't have problems, they wouldn't have needed to hire you.
2nd rule: ABS – Always Be Solving (problems). It's better to solve a problem 80% correct and revise the 20% than wait for a 100% plan.
3rd rule: If you don't know how to solve a problem learn or hire some time from someone who does.
4th rule: Never make yourself critical path as this will quickly end your engagement and resentment among your customer will ensue. Deflect glory to your manager — that's a big reason why they hired you.
5th rule: Never complain. They have enough of that, that's why they need you. You're their machete in the jungle of red tape. If you can't take it any more, try to affect positive change or leave. There's no crying in consulting!
6th rule: They don't care that software is done right so don't argue semantics, just do it right. Find a way to sneak in success. However, you should always be able to explain why these things are important and justify their use.
7th rule: Be a yes man in meetings and then do what's right behind the scenes (clarification: Be positive and always on the side of getting things done and solving. Avoid confrontation in a meeting that might embarrass your customer. Defer arguments and confrontations until later).
- Example: When the customer asks you to 'filter all TCP ports through email packets', you ask 'what color would you like the background?'
- Then later, come back into his/her office and suggest that in order to accomplish this you'll need to [insert more rational feature suggestion here].
8th rule: If at any time you're asked to compromise principles, find a way to avoid it or quit. Remember: Integrity is your main asset
9th rule: No one is ever served by job-protectionism thinking, especially yourself. Expect it from the customer (remember, that's why they need you), but always resist it in yourself.
10th rule: You can't win 'em all. Solve what you can in your time and leave things better than how you found them. That's really all any of us can do.
Other Bits of Wisdom
- Never assume that management actually wants your project to succeed.
- Not everyone in your group has an incentive to succeed (or to help you succeed).
- The best way to ensure career security is to do your best and never, ever do anything that would put protecting you job over doing the right thing.
- If, during a consulting engagement, you start taking on a employee role/mind set, quit right away or hire on full time. It won't end well otherwise.
- If your customer is hinting they want to hire you, you need to nip that quickly, don't string them along in that thought.
- Unless, of course, you're entertaining the idea, at which point you're no longer independent and you're now operating unethically. Leave or join and do it fast.
- You're never as critical path as you think. Life will go on, maybe just not as well.


text:
Written on: 03/10/2010
we stayed 4 nights at devon cliffs and loved it completely.
the staff were fantastic and very polite, kids entertainment was brill but i wouldnt say fantastic as it was all the same things, the adult and family entertainment i found to be fantastic very entertainin.
we had our food in the mash and barrell and found no faults
the caravan was extremely cold but thats wot ud expect for the time of year,
the arcade and the swimming pool was brilliant
the only fault i had was that it was very very hilly
i would deffinatley recomend to a friend
As rated by our community of reviewers
" Negligent!! " Read More
" Littlesea going down hill " Read More
" Disgusting " Read More
" Expensive rude entertainment " Read More
" Great family hoiliday " Read More


text:
living room. Friday , November 25th , 2016 - 03:32:34 AM
Quote from Living Space Inspirations – The Eventual Model Resource Guide - Part 2 :
Living Space Highlight Inspirations
While with all the uniquely planned spaces within your residence, you will desire to boast a focal point for your living chamber. This focal point is where your views are quickly drawn when you enter the space. Without a focal point, a space could feel like an irresistible combination of adorning themes, each competing with the following for notice.
A highlight is a big procedure to build a focal point within your living chamber. Living space highlight inspirations could incorporate floral models, an elaborate model section like a monogram or an amazing fireplace. Your own furniture could be a big procedure to build your living chamber highlight. Classic models generally place sofas or seats along walls, building empty area within the central of a space. Alternatively, you could concentrate your seating furniture to build both a big visual with a comfortable conversational room. Do not be scared of perspectives, either, when you plan your furniture. Frequently, placing facing sections on the diagonal could change the whole texture of your living chamber.
About ♦ Contact ♦ Privacy ♦ TOS ♦ Copyright
Copyright © 2016. Potjeh. All Rights Reserved.
Any content, trademark/s, or other material that might be found on this site that is not this site property remains the copyright of its respective owner/s. In no way does Potjeh claim ownership or responsibility for such items, and you should seek legal consent for any use of such materials from its owner.


text:
The hotel is centrally located in this historic market town yet close to the A1 and A66. An ideal base for conducting business in Newton Aycliffe, Stockton, Teeside, County Durham and North Yorkshire and only 30 minutes from Newcastle. The impressive Victorian facade looks out over the Pease statue and shopping area. An outdoor fee paying Car park can be found within a 5 minute walk off St Cuthberts Way
All services of the hotel, at a glance:
- Restaurant : 1
- Private indoor parking 1 2
- Number of meeting rooms
WiFi at the hotel
WiFi in your room
Internet connectivity
- 100% non-smoking hotel
- Airport shuttle1


text:
Thinking Big?
In many organizations, more attention is devoted to picking up the small particles of grain that have blown onto the barn floor than to harvesting the entire field.
The small particles are studied, new brooms purchased, and sweeping techniques perfected. All this will be done while the field outside remains unharvested.
Where is your attention?


text: As a heads up to any Ampeg SVT-15 owners out there.... I took the grill off my 15 today to clean it when i saw this in one of the ports: I thought ***. So I pulled off the speaker and found 2 cardboard tubes. I figured these must have come off the port cones. Sure enough they fit on the cones but are a little loose so I added a couple dabs of gorilla glue to each and stuck them back on. and now there not moving. The build quality on this cab is otherwise great. So for anyone with an Ampeg SVT-115 you might want to have a look in your ports. If you can see the padding then you need to reattach them as the insides of the tubes are black. Also an FYI you can pull the tubes out through the ports if you remove the cone. I wish I knew that before pulling off the speaker. Its not hard, it just weighs 5 lbs and is a little awkward. And in case the images are still not showing: http://s1008.beta.photobucket.com/user/technotitclan/library/SVT


text:
By Jonathan Yardley,
whose e-mail address is email@example.com
Tuesday, January 24, 2006
In Defense of the Baby Boom Legacy
By Leonard Steinhorn
St. Martin's. 318 pp. $24.95
Himself a baby boomer, born in 1957, Leonard Steinhorn has absolutely no doubt about it: His generation is the greatest generation in the whole history of generations, an even greater generation than -- are you ready for this? -- the Greatest Generation. If you thought the generation that won World War II, starred in "Victory at Sea" and made Tom Brokaw even richer is the Greatest Generation, think again:
"Historians looking back will probably say that Baby Boomers turned Greatest Generation morality on its head. Whereas the Greatest Generation imposed its morality on private behavior and personal relationships, the Baby Boom projected its morality onto our social behavior and public relationships. Whereas the Greatest Generation viewed sexual and other personal behavior as a moral or religious issue, the Baby Boom sees it as an individual choice and a private personal issue. Whereas the Greatest Generation accepted racial bigotry, sex discrimination, cultural conformity, and environmental degradation as unchanging realities, the Baby Boom deems them unconscionable realities that need to be changed."
All of which is why, in a nutshell, "this generation's accomplishments eclipse what came before it, and why the Baby Boom must be recognized as the Greater Generation." Thus argues Steinhorn, who professes communications at American University and whose "keen insights and experience," according to the university's Web site, "keep him in demand as a consultant and commentator on political communications and American culture." Very much a gentleman of the left, Steinhorn has labored on behalf of People for the American Way and other like-minded organizations and is the founder of Right Wing Watch newsletter.
Say it for Steinhorn: He puts his money where his mouth is. America today, he insists, is under the sway of a "new liberal norm" characterized by "the principles of diversity, feminism, and Baby Boom individualism." The "political center of gravity," he says, "has clearly moved toward Boomer liberalism in the last generation, and even conservatives now frame their agenda in a Sixties context. Women's rights, diversity, consumer rights, environmental protection, civil rights, gay rights, religious diversity, personal freedom -- all except the most paleo of conservatives at least give lip service to these Boomer era norms, and those who don't pay a price for it."
There is a measure of truth to this. Although American voters have twice sent to Washington one of the most rigidly and reflexively conservative administrations in the country's history, they also embrace (or give lip service to) many of the "Boomer norms" that Steinhorn lists above. As has been noted by many talking heads and scribbling pens, there is a disconnect in this country between personal and social behavior on the one hand -- what Steinhorn calls "a 'plateau' of liberalism or egalitarianism that characterizes our social norms today" -- and political behavior on the other.
What this reveals, depending on one's disposition and biases, is either a country narrowly but deeply divided -- the conventional wisdom of the red and blue states -- or a country in the process of transition, a country whose politics have yet to catch up with its social and moral evolution. Obviously the latter is what Steinhorn thinks, and perhaps he is right, but the past, the present and the future are all considerably more complex and ambiguous than he would have us believe.
To begin with, there is the problem of generalizing about generations. It is true that many (though certainly not all) people born in the same country during the same period will have certain shared experiences. In the case of the boomers, Steinhorn correctly cites the civil rights movement and the violent resistance it aroused, the war in Vietnam, the rise of environmentalism, the women's movement and many others. It is also true, though, that not everyone reacts to those experiences in the same way. The generation that gave us Flower Power and Haight-Ashbury also gave us George W. Bush (born in 1946), Samuel Alito (1950), John G. Roberts Jr. (1955) and most members of the Bush Cabinet.
Perhaps most people who were in college during the 1960s and '70s share the boomer views that Steinhorn ascribes to them, but it is far from certain. He conveniently underplays the bitter divisions within the country over Vietnam, in which many people of boomer age vociferously opposed the antiwar movement.
Steinhorn takes great pleasure in debunking the Greatest Generation myth, and in fact there is much to debunk. "Nowadays we celebrate Greatest Generation Americans for their many virtues," he writes, "but we do so with a dash of willful self-deception, for when they came back from defending freedom and equality and individual rights and human dignity abroad, they readily accepted and even promoted assaults on those ideals here at home -- segregation, discrimination, inequality, blanket conformity and uniformity, suppression of dissent, devaluing people because they were different."
Yes . . . but. One of the many troubles with generalizing about generations is that there are always exceptions to disprove the ostensible rule. It is true that many white Americans retreated into lily-white suburbs after the war and resisted social change, but it is no less true that the initial steps toward change were mostly taken by men and women of the World War II generation: John F. Kennedy, Rosa Parks, Lyndon B. Johnson and James Farmer are only the beginning of a very long list. Some of them were slow and reluctant to press for change, but press they did, and in so doing they laid the groundwork for others younger than they.
Yet another complication: Many of the leaders and foot soldiers of change in the 1960s and '70s were neither of the Greatest Generation nor of the boomers, but of the so-called Silent Generation, people too young to fight in World War II, too old to be in college during the '60s. These include Martin Luther King Jr. (born in 1929), Julian Bond (1940), Andrew Young (1932), Allard Lowenstein (1929) and Gloria Steinem (1934) -- just the beginning of another very long list. The sit-ins, the Freedom Rides, the March on Washington -- these pivotal events in large measure were conceived and carried out by members of the in-between generation upon which few spotlights have been focused.
This is not to deride Steinhorn's claims on behalf of the boomers but to emphasize that these matters do not lend themselves to easy oversimplifications, of which "The Greater Generation" has a good deal too many. It is absolutely true that ours is a more tolerant and open society than it was at the end of World War II, and the boomers get much credit for that. But they scarcely get it all, and they scarcely have a monopoly on the many virtues Steinhorn ascribes to them. Like every other group of people lumped together by journalists and pop academics as a "generation," they are heterogeneous and resistant to stereotype. No "generation" is greater or greatest; it's just another bunch of people muddling through, trying to make the best of it, winning some and losing some.
View all comments that have been posted about this article.


text:
Lieberman: Syria Behind Foiled 2009 Attempt to Smuggle Weapons From North Korea to Hezbollah
Foreign Minister Avigdor Lieberman yesterday accused Syria of being behind an attempt to smuggle arms to Hezbollah and Hamas in a North Korean plane that was seized in Thailand in December.
"The military cooperation between Syria and North Korea endangers the stability of both Southeast Asia and the Middle East, and it violates all the accepted rules and norms of the international order," Lieberman said during a visit to Tokyo. He emphasized that this cooperation focused on weapons of mass destruction and surface-to-surface missiles.
While Lieberman's words echo assessments voiced by Israeli defense officials shortly after the plane was seized, this is the first time the claim has been made publicly by a high-level Israeli official.
The plane was seized when it stopped to refuel in Bangkok en route from Pyongyang. Its final destination was apparently Iran, but stops were also planned in Sri Lanka and the United Arab Emirates. The five crew members arrested by the Thai authorities denied all knowledge of the plane's cargo, saying they had been told the sealed containers held oil drilling equipment. They were released without charge in February.
What the Russian-made plane actually contained, however, was 35 tons of weaponry, including antitank missiles, explosives and parts for anti-aircraft missiles. These are items more likely to be sought by a guerrilla army than a conventional one; hence the conclusion that from Iran they were slated to be sent on to Hamas and Hezbollah.
It has been known for some time that much of the weaponry possessed by Syria, Hezbollah and Hamas, especially missiles and rockets, is based on models developed by China or North Korea, and some of it was actually manufactured in North Korea.
Want to enjoy 'Zen' reading - with no ads and just the article? Subscribe todaySubscribe now


text:
Archive for June, 2011
Dartford NetworkFriday, June 17th, 2011
Dear Colleagues, We are delighted to inform everyone that a new Kent MoE network is being established by Verity Allan and Anna Green from The Bridge Community Primary School and Joydens Wood Junior School. The network will serve schools and interested parties in and around the Dartford area. There are a possible 13 schools in […]
Dr Dorothy Heathcote awarded MBESaturday, June 11th, 2011
It was announced on June 11th, 2011 that Dr Heathcote has been awarded an MBE for services to drama as education. Along with all her friends, colleagues and family we would like to congratulate Dorothy on this wonderful honour and once again thank her for inspiration and guidance over many years. If you would like […]
National Curriculum Review ConferenceMonday, June 6th, 2011
Redbridge Networked Learning Community's (RNLC) Annual National Conference for Headteachers, senior leaders in education and curriculum managers.
Date: Wednesday 9th November 8:30-2:00 pm
Costs: £90 day delegate rate for school outside London Borough of Redbridge (LBR)
Tim Oates, Chair of the National Curriculum Review Expert Panel, to present a keynote address on the current state of play with the New National Curriculum.
Steve Mumby director of the NCSL will give the conference's final Keynote address.


text:
Image copyright:
Please sign in to comment. Don't have a profile? Join now! Joining is absolutely free and no personal information is required.
He's one handsome dude! He can deliver my mail any day! And the shorts, with his physique...don't tell my hubby!!! LOL PS....Hubby just loves Hoover and asks everyday if there is a new one. I copied your Hoover puzzles to my computer and then transferred them to hubby's computer...he has a lot of them cycling thru his screen saver. He loves Hoover too and says you are a genius with this idea!!! I agree!!! :)))))))))
Don't you think he looks good in shorts?
I see Hoover is working to pay for all his traveling expenses! LOL Keep 'em comin' Brie!!! :)))


text:
New Delhi: Former Delhi Commission for Women (DCW) chief Barkha Shukla Singh on Wednesday lashed out at the Aam Aadmi Party (AAP) over the suicide of one of its woman party workers in Narela area of Delhi and said the party had 'neglected' women since coming to power in Delhi.
Singh said that women voted for the AAP in large numbers in the national capital, adding that the party had projected the issue of women security in a big way during the election campaign.
"But, since assuming office, they have neglected women. Look at the things happening in AAP, be it Somnath Bharti's wife or Kumar Vishwas' victim," she told ANI.
"Kejriwal has blindfolded himself and does not listen to anyone. If you really want to something for women then listen to them first. It is very shameful that a party worker has committed suicide after leveling such allegations. Those responsible should be strictly dealt with," she added.
Singh's reaction came in the wake of AAP activists' suicide and her family's claim that she was depressed after her alleged molester, a party colleague, was released on bail.
According to reports, she consumed poisonous substance at her home yesterday afternoon died during treatment at LNJP Hospital.
She had reportedly filed a complaint against party colleague Ramesh Wadhwa for allegedly inappropriately touching her.


text:
- Listen Live
- About
- Support
- On-Air
- Music
- Prayer
- Events
SOS Radio
Our dear aunt, Patricia , has just been diagnosed with Stage 4 Lung Cancer. She was such a prayer warrior for me when I went through cancer treatments, and we need PRAYER WARRIORS for her now. With GOD, NOTHING is impossible! I am proof of that, for I am cancer free, and we are praying for the same results for Pat. God bless you for your prayers. In Christ, Kim & Marvin Dahl


text:
By LEE LAWRENCE
Staten Island, N.Y.
In Phil Borges's photograph, the shaved heads of three Tibetan Buddhist nuns draw an arched silhouette against gray skies and mountains. The caption, printed on the protective glass, identifies them as Kalsang, Ngawang and Dechen, all in their 20s and survivors of two years of harsh imprisonment for protesting the Chinese occupation of Tibet. In other photographs, a 9-year-old girl carries her baby sister on her back, her unkempt hair reaching out like tentacles, and 81-year-old goatherd Tseten leans on his staff, his face as lined as the arid hills behind him.
They are part of "Tibetan Portrait: The Power of Compassion," a collection of 32 hand-tinted works currently on display at the Jacques Marchais Museum of Tibetan Art. In some respects, they are the perfect choice for this small, idiosyncratic museum, situated rather incongruously in Staten Island—New York City's most suburban borough.
In constructing a Himalayan-inspired center—high windows with flared borders, a pagoda-like roof and transoms of protruding timbers—its founder hoped to foster an understanding of Tibetan culture and religion. Mr. Borges's coupling of beautiful portraits with their subjects' stories furthers that goal, generating empathy and quickening curiosity.
Yet the photographs also seem incongruous. Hanging on yellow panels, these almost monochromatic portraits contrast with the bronze hues of giant incense burners and temple statuary displayed against stone walls and in glass cases. Add to this mix some hands-on exhibits, one of which unleashes a loud Buddhist chant, and one begins to get a sense that the museum is not entirely sure what it wants to be.
Indeed, it may never have known. It was founded by a rather eccentric woman whose father so wanted a boy that he named her Jacques Marchais. Having lost her father young, she went on stage, shedding her exotic name for the more fashionable "Edna Norman." In 1916, as the museum's executive director Meg Ventrudo tells it, the young actress traveled to Boston to perform in a musical comedy and "for the first time her mother does not accompany her. And she elopes with the musician." Three children and a divorce later, she reclaimed her masculine name, keeping it even after remarrying.
Having played as a child with Tibetan figurines her grandfather had brought back from Asia, Mme. Marchais (as she insisted on being called) began collecting Indian and Tibetan Buddhist works in the 1930s. These were just beginning to attract scholarly attention, and after the Jacques Marchais Gallery opened in Manhattan, a reviewer for the New York Times wrote in 1939 that the idols "looked thoroughly vicious" and that the gallery "is a nice place to visit, but it must be awful to live there."
Mme. Marchais disagreed. Inspired by a reconstructed temple at the 1933 Chicago World's Fair, she set out to build a Tibetan retreat, complete with "chanting room," monk cells and Buddhist devotional objects. With her husband, Harry Klauber, she chose a hillside property on Staten Island because it was "viney with briars, stone-riddled and wild," as she later told a Newsweek reporter.
Construction proceeded in fits and starts throughout World War II, and in July 1945 Mme. Marchais opened the library, a single-story stone building filled with some 2,000 books on Asia. This "first unit of a Tibetan museum and temple," a columnist for the New York Sun reassured his readers, "does not mean an attempt to convert New York to that phase of Buddhism called Lamaism." Rather, it was an attempt to further "in this country the cause of Oriental art, particularly that of Tibet." Indeed, as Mme. Marchais proudly noted, many works previously labeled Chinese were being recognized as Tibetan, Nepalese or Mongolian.
By October 1947, the center was complete: A full-page photograph in Life magazine shows Mme. Marchais seated on a throne flanked by bronze Nepalese lions, regal from her blond bouffant hair to the bejeweled sandals on her feet.
Today, the library has been partitioned into an office and visitor's entrance. While the Nepalese lions are still by the back wall of the museum, the effect is nowhere as dramatic as in the 1940s photograph. And in a garden festooned with Tibetan prayer flags and presided over by an alabaster Burmese Buddha, there peeks through the foliage the occasional metal baboon. "Garden follies," Ms. Ventrudo says with a laugh, as she points out stone bunnies in a flower bed.
Had Mme. Marchais been able to pursue her research and travel to Tibet as she so hoped, perhaps she would have refined her vision for the museum. As it was, she and Mr. Klauber died within a year of the museum's opening, leaving it caught in a quirky category somewhere between folly and serious institution. Because the buildings are not climate-controlled, the museum can display only a fraction of its 1,200 pieces, including silk paintings and wood furniture, and the only Tibetans in residence are those in Mr. Borges's photographs.
Ms. Lawrence is a writer based in Brooklyn, N.Y.
Tibet on Staten Island
Forum for discussion of Tibetan Buddhism. Questions specific to one school are best posted in the appropriate sub-forum.
Post Reply
1 post • Page 1 of 1
Tibet on Staten Island
http://online.wsj.com/article/SB1000142 ... lenews_wsj" onclick="window.open(this.href);return false;
- How foolish you are,
grasping the letter of the text and ignoring its intention!
- Vasubandhu
Post Reply
1 post • Page 1 of 1
Who is online
Users browsing this forum: Harimoo, Norwegian, PuerAzaelis, Temicco, Tenma, Tolya M, Yahoo [Bot] and 72 guests


text:
EAST HARTFORD — The first play of the 2016 UConn football season was a handoff to Arkeel Newsome, who darted through the line for a gain of 7 yards. Newsome picked up a first down on the next play.
It was a nice start, but Newsome did not find running room easily Thursday night. Neither did fellow junior Ron Johnson, particularly early. They combined for 36 yards in the first half, on 15 carries. Newsome averaged 2.6 yards per attempt in the half, Johnson 2.1.
The junior running backs did have a solid finish, operating much better in the second half, and made several key plays down the stretch as UConn managed a 24-21 victory over Maine at Rentschler Field.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Nov 29, 2011
|Filing date
|Jun 7, 2011
|Priority date
|Feb 24, 2007
|Fee status
|Also published as
|Publication number
|Kevin Gerard BOYCE
|Original Assignee
|Trend Micro Incorporated
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (29), Non-Patent Citations (8), Referenced by (3), Classifications (16), Legal Events (2)
|External Links: USPTO, USPTO Assignment, Espacenet
The present application is a Continuation of U.S. patent application Ser. No. 13/011,395 filed on Jan. 21, 2011 now U.S. Pat. No. 7,987,196, which, in turn, is a Continuation of U.S. patent application Ser. No. 12/605,357 filed on Oct. 25, 2009 now U.S. Pat. No. 7,899,842, which, in turn, is a Divisional from the parent U.S. application Ser. No. 11/678,587 filed on Feb. 24, 2007 now U.S. Pat. No. 7,630,982 to Boyce entitled "Fast identification of Complex Strings in a Data Stream", the entire contents of the above noted applications being incorporated herein by reference.
The present invention relates to detection of complex strings in a data stream.
Fast search techniques are needed in many computing and network applications such as search engines and network addressing. Regular search of a string in a dictionary of strings of fixed sizes is rather simple, using for example binary search. With a dictionary of variable-size strings, the matching process becomes more intricate. A string of arbitrary size in which each character is uniquely defined in an alphabet is colloquially called an "exact string". A string of arbitrary size in which at least one character may be replaced without changing the purpose of the string is colloquially called an "inexact string". The search for an inexact string is complicated. For example searching for a name such as "John Winston Armstrong" in a dictionary of names is much simpler than searching for any name in the dictionary that contains a string such as "J . . . ton.Arm", where '.' may represent any of a subset of characters in the alphabet. In the latter, each of a large number of strings such as "Jane Clinton-Armbruster" and "Jack Newton Armstrong" is considered a successful match.
Numerous software-based techniques, suitable for implementation in a general-purpose computer, for fast matching of exact strings in which each character is uniquely defined and corresponds to a pre-defined alphabet are known. The Aho-Corasick algorithm, for example, is known to be computationally efficient and may be used in real-time applications, see, e.g., a paper by Alfred V. Aho and Margaret J. Corasick "Efficient String Matching: An Aid to Bibliographic Search" published in the Communications of the ACM, June 1975, Volume 18, Number 06, p. 333-340. Software-based techniques for matching "inexact strings" are also known, but are too slow for certain real-time applications such as network security applications which require fast execution, see, e.g., a paper by Ricardo A. Baeza-Yates and Gaston H. Connet "A New Approach to Text Searching" published in Communications of the ACM, 35, October 1992, p. 74-82.
Regular Expressions, as described, for example, in the paper written by Ken Thompson "Regular Expression Search Algorithm" published in Communications of the ACM, Vol. 11, Number 6, June 1968, p. 419-422 are commonly used for representing inexact strings. Regular expressions can be implemented efficiently using special-purpose hardware. However methods for efficient implementation of regular expressions in a general-purpose computer are yet to be developed. Software implementations of regular expressions either require a memory of extremely large size or execute in a non-bounded time which is a function of the number of such inexact strings to be considered, the complexity of the individual inexact strings, and input data to be examined.
One solution adopted in prior art is to use a two-stage algorithm where an algorithm for simple search, such as the Aho-Corasick algorithm, is used to efficiently find parts of packet data, which contain some part of the patterns of interest, and then a slower regular-expression-based algorithm is applied to a potentially lesser number of patterns to detect inexact patterns. Such a solution can handle a large variety of inexact patterns but has significant drawbacks including: (a) unpredictable computation effort to determine the existence, or otherwise, of a matching inexact string, the processing time being a function both of the data content and of the size and complexity of the patterns; (b) incomplete pattern identification where only a part of a pattern may be found without readily defining the boundaries of the pattern in an examined data stream—verifying a match with regular expressions may require access to a large amount of preceding data up to the possible start point, and may require waiting for data that has not yet been received; c) a requirement for post-processing to detect patterns in order of occurrence as neither the start nor end points may be known in advance, forcing ensemble matching and sorting.
Network intrusion detection and prevention is concerned with protecting computer systems from unintended or undesired network communications. A fundamental problem is in determining if packets in a data stream contain data strings of specific patterns (also called signatures) which are known to exploit software vulnerabilities in the computer systems. The number of such signatures of practical concern is very large and their structure is rapidly changing. Many of these signatures cannot practically be expressed as ordinary sequences of characters. For example a credit-card number uniquely identifies a specific credit card while a string comprising common digits of the numbers of all credit cards issued by one bank does not uniquely identify a specific credit card.
A string inserted in a data stream may be harmful to a recipient of the data stream and, hence, the need to locate the string to enable further corrective actions. Clearly, any means for detecting strings of special interest in a continuous data stream has to be sufficiently fast. One approach for fast detection is to devise special-purpose hardware circuitry with concurrent processing. However, considering the fast pace of network changes, a solution based on special-purpose hardware may be impractical.
A software solution is highly desirable because of its low cost, ease of deployment, and ease of adapting to the changing communications environment. There is therefore a need for a software-based algorithm that can detect a large set of strings under execution-time constraints and memory limitations in order to enhance Intrusion prevention systems (IPS) and intrusion detection systems (IDS).
In accordance with one aspect, the present invention provides a method of examining a data stream to detect presence of at least one complex string belonging to a predefined complex dictionary. The method comprises steps of: associating an array of state variables and an array of reference states with the complex dictionary with one-to-one correspondence between entries of the complex dictionary, the array of state variables, and the array of reference states; detecting a simple string in the data stream, the simple string being a constituent simple string in each of at least one complex string in the complex dictionary; updating a state variable associated with the each of at least one complex string according to all relative positions of the simple string within the each of at least one complex string; and determining that the each of at least one complex string is present in the data stream when the state variable attains a corresponding reference state.
In one realization of the method, a multi-bit Boolean state variable is used. Consequently, the step of updating the state variable comprises steps of: (1) shifting bits of the Boolean state variable a number of positions determined according to a position of the simple string in the data stream and a previous position of any simple string detected in the data stream and belonging to the each of at least one complex string; (2) setting an end bit of the Boolean state to indicate logical TRUE; and (3) performing a logical AND of the state variable and a bitmask associated with the simple string, the bitmask indicating the all relative positions of the simple string within the each of at least one complex string.
The bitmask may originate at the rightmost bit and, consequently, the Boolean state variable is shifted in the direction from right to left with the rightmost bit of the Boolean variable set to equal TRUE. Alternatively, the bitmask may originate at the leftmost bit and, consequently, the Boolean state variable may be shifted in the direction from left to right with the leftmost bit of the Boolean variable set to equal TRUE.
The corresponding reference state indicates a specific relative position of a last character of a last simple string in each of the at least one complex string. In an exemplary realization, the corresponding reference state is a multi-bit Boolean constant having a bit corresponding to the specific relative position set to logical TRUE, and the presence of each of the at least one complex string in the data stream is determined by performing a logical AND of the state variable and the corresponding reference state, with the outcome overwriting a current value of the state variable. The bit in the state variable at a position corresponding to the specific relative position is then examined and if its state is TRUE, detection of a respective complex string may be ascertained subject to congruence of a suffix of the respective complex string to a corresponding portion of the data stream.
In accordance with another aspect, the present invention provides a method of detecting the presence of a selected complex string from a predefined complex dictionary in a data stream. The selected complex string comprises a predefined number χ>1 of simple strings with each simple string having a prefix of indefinite characters. The last simple string of the complex string has a suffix of indefinite characters, which is considered a suffix of the complex string. The prefix of the first simple string may be a NULL string, and the suffix may be a NULL string. A NULL string is an empty string with zero characters. The method comprises steps of: locating a first portion of the data stream where the first portion is identical to a first simple string of the selected complex string; ascertaining congruence of an adjacent portion of the data stream, preceding the first portion, to a prefix of the first simple string; locating a second portion of the data stream where the second portion is identical to a second simple string of the selected complex string; and ascertaining congruence of an intervening portion between the first portion and the second portion to a prefix of the second simple string. Notably, congruence of a NULL string to any other NULL string is, by definition, ascertained.
The method includes a further step of ascertaining congruence of the suffix to a corresponding portion of the data stream determined according to a length of the complex string. Where the number of simple strings in a complex string exceeds 2, i.e., χ>2, the method comprises further steps of locating an mth portion of the data stream is the mth portion being identical to an mth simple string of the selected complex string; and ascertaining congruence of an intervening portion, of the data stream, preceding the mth portion and a prefix of an mth simple string, the intervening portion following an (m−1)th portion of the data stream found to be identical to an (m−1)th simple string in the selected complex string.
In accordance with another aspect, the present invention provides a method of identifying a complex string in a data stream, the method comprising steps of: segmenting the complex string into a suffix and a set of string segments, each string segment comprising a prefix and a simple string, where the prefix comprises indefinite characters and the suffix comprises indefinite characters; generating an array of bitmasks each bitmask associated with a string segment in the set of string segments, the bitmask indicating a location index of an end character of the each string segment; associating a Boolean state variable with the complex string; locating a current simple-matching position in the data stream at which at least one simple-string belonging to the complex string terminates; initializing a current mask as an opaque mask; performing a logical OR operation of the current mask with selected bitmasks corresponding to the at least one simple string to produce a composite current mask; determining a gap between the current simple-matching position and a previous simple-matching position; left-shifting each entry of the state variable by the gap, replacing each shifted entry by "0" and setting the rightmost entry to "1"; and updating the state variable according to a logical AND operation with the composite current mask.
The method comprises a step of determining that a portion of the data stream terminating at the current simple-matching position contains the complex string when a bit in a target position of the state variable represents a logical TRUE, where the target position corresponds to a last location index of an end character of a last string segment within the complex string.
The method comprises a further step of associating a segment descriptor with each string segment. The segment descriptor indicates a length of the string segment and a length of a prefix of the string segment. A last string segment within the complex string further comprises indications of a length of the suffix and a target position corresponding to a last location index of an end character of a last string segment within the complex string. Each selected bitmask associated with a specific simple string satisfies a condition of congruence of a prefix of the specific simple string and a corresponding portion of the data stream. When the suffix includes at least one character, the method comprises a step of determining that a portion of the data stream terminating at a position of index equal to an index of the current simple-matching position plus a length of the suffix when the state variable contains a logical TRUE at the target position and the suffix is congruent with a portion of the data stream succeeding the current simple-matching position.
In accordance with a further aspect, the present invention provides a method of screening a data stream to detect presence of any complex string from a predefined complex dictionary. The method comprises a preprocessing step of transforming the complex dictionary into a segmented dictionary, an array of segment descriptors, and an array of bitmasks. The segmented dictionary comprises string segments of each complex string in the complex dictionary, each string segment comprising a prefix and a simple string. Each segment descriptor defines a content of a corresponding string segment in the segmented dictionary, and each bitmask indicates a location of a string segment in the segmented dictionary within a respective complex string in the complex dictionary. Steps for detecting and locating complex strings in the data stream include: performing a simple search to produce detected simple strings in the data stream, where the simple strings are defined in the segmented dictionary; selecting candidate string segments from among specific string segments containing the detected simple strings; and identifying candidate complex strings for the at least one complex string in the complex dictionary, where the candidate complex strings contain the candidate string segments, using the array of segment descriptors and the array of bitmasks.
The method further comprises: (1) associating a state variable with each complex string in the complex dictionary; (2) updating the state variable according to gauged spans between successive positions in the data stream, at which positions simple strings belonging to the each complex string terminate; (3) determining, at each position, a subset of the candidate string segments belonging to the each complex string; and (4) correlating the state variable with locations, within the each complex string, of candidate string segments of the subset. The step of correlating further comprises formulating a composite current mask as a logical OR function of bitmasks of candidate string segments of the subset, and performing a logical AND operation of the composite current mask and the state variable to produce an updated state variable. The step of selecting comprises a further step of ascertaining congruence of a portion of the data stream preceding each detected simple string to a prefix of a corresponding string segment from among the specific string segments.
In an exemplary embodiment, the present invention provides an article of manufacture comprising at least one processor-readable medium and instructions carried on the at least one medium. The instructions are devised to cause a processor to transform the complex dictionary into a structure which enables computationally efficient search. The structure comprises a segmented dictionary, an array of segment descriptors, and an array of bitmasks. The segmented dictionary comprises string segments of each complex string in the complex dictionary, and a suffix. Each string segment comprises a prefix and a simple string. Each segment descriptor defines content of a corresponding string segment in the segmented dictionary. Each bitmask indicates a location of a string segment in the segmented dictionary said string segment being within a respective complex string in the complex dictionary. The instructions are further devised to cause the processor to perform simple search to produce detected simple strings defined in the segmented dictionary, select candidate string segments from among specific string segments containing the detected simple strings, and identify candidate complex strings in the complex dictionary containing the candidate string segments using the array of segment descriptors, and the array of bitmasks. The instructions further causes the processor to ascertain congruence of the prefix of each string segment with a corresponding portion of the data stream and congruence of the suffix of each complex string with a corresponding portion of the data stream. Where the prefix is a NULL prefix, having zero characters, and where the suffix is a NULL suffix, congruence is inherently ascertained.
In an alternate realization of the article of manufacture, the segmented dictionary comprises a prefix and string segments of each complex string in the complex dictionary, with each string segment comprising a simple string and a suffix. The instructions cause the processor to operate to ascertain congruence of the prefix with a respective portion of the data stream and congruence of the suffix of the each string segment with a corresponding portion of the data stream.
Embodiments of the present invention will be further described with reference to the accompanying exemplary drawings, in which:
Alphabet: The term alphabet refers to a set of characters which may include punctuation marks and spaces.
Class: A subset of characters may be selected to form an alphabet class. The selected subset of characters may be arranged in an arbitrary order. For brevity, the term "class" will be consistently used herein to refer to an alphabet class. Several classes may be formulated.
Indefinite character: An indefinite character is an ordinary character of the alphabet which derives the indefinite status from its position in a predefined string of characters. An indefinite character belongs to one of predefined classes and possibly to more than one class. One of the classes may encompass the entire alphabet, and a character belonging to such class is treated as a character with a "don't care" attribute.
Coherent word: A coherent word comprises a sequence of characters. It is a character-defined word in which each character is an ordinary character uniquely defined in the alphabet. If the alphabet includes punctuation marks and spaces, a group of coherent words may also be treated as a single coherent word.
Ambiguous word: An ambiguous word is a class-defined word in which each character is defined according to class association.
Simple string: A simple string comprises a coherent word. As described above, several coherent words separated by spaces may also constitute a single coherent word.
Ambiguous string: The term "ambiguous string" is herein used synonymously with the term "ambiguous word".
Complex string: A complex string comprises at least two words, of which at least one word is an ambiguous word and at least one ambiguous word is subject to at least one restriction such as a predefined number of characters or membership of constituent characters in specific classes.
Prefix: An ambiguous word preceding a simple string within a complex string is called a prefix.
Suffix: An ambiguous word succeeding a simple string within a complex string is called a suffix.
String segment: A string segment may comprise a prefix and immediately following simple string or a simple string and an immediately following suffix. Either of the two definitions may be adopted as long as it is used consistently.
String equality: Two strings are said to be equal, or equivalent, if they are identical.
String congruence: Two strings are said to be congruent if they have the same number of characters and if likewise positioned characters in the two strings belong to the same class. This applies to a pair of ambiguous strings or to a pair of complex strings.
String matching: Two simple strings (coherent strings) are said to be matching strings if they are equal. Two complex strings are said to be matching strings if there is one-to-one equality of their constituent coherent strings and one-to-one congruence of their constituent ambiguous strings.
Simple dictionary: A simple dictionary may be devised to include a set of simple strings of special interest. The simple dictionary may expand or shrink as the need arises.
Complex dictionary: A complex dictionary comprises a set of complex strings. A simple string may be treated as a reduced complex string and, therefore, the method of the invention will focus on complex strings. The set of complex strings may be updated to add new complex strings or delete existing complex strings.
Text: A text is a sequence of characters extracted from a data stream and may include ordinary characters and indefinite characters. A text may be examined to ascertain the existence of any of complex string from among a predefined set of reference complex strings forming a complex dictionary.
Mask: A mask is a sequence of bits, each bit assuming either of the two states "false" or "true". When a mask is ANDed with a first Boolean variable of equal length to produce a second Boolean variable, each bit of the second Boolean-variable at a position corresponding to a mask bit of false state (binary 0) is also of false state. Each bit of the second Boolean-variable at a position corresponding to a mask bit of true state (binary 1) has the same state of the corresponding bit of the first Boolean variable.
Opaque mask: A mask in which each bit represents logical FALSE, binary 0 for example, is an opaque mask.
State: The state of an n-bit Boolean state variable is indicated by bits set to represent logical TRUE (binary 1) and may be denoted {p0, p1, . . . , pn}, where pj, 0≦j<n, are positions in the state variable each having a value of binary 1. For example, a 32-bit Boolean state variable having a value of [00000000001000010000000000000001] may be represented as {0,16,21}, with the rightmost bit being the origin of index 0. A state variable having a null value, where all its bits are set to binary 0, is denoted { }.
String Length: The length of any string is the number of characters of the string, including indefinite characters.
The method of the present invention, which applies to complex strings, is devised to reduce memory consumption, minimize the computation effort, reduce computation-time variance, and present detected complex strings in the order in which they are encountered in an examined data stream.
It is noted that a complex dictionary preferably includes only mutually distinct complex strings. However, as will be described below with reference to
In one realization of complex string 220, each character "*" may indicate a logical "don't care" (a term used extensively in the art). Accordingly, a character "*" may correspond to any recognizable character in a recognized alphabet-list. With 24 such characters in the exemplary complex string 220, and considering a recognizable alphabet of 80 unique characters (comprising, for example, the upper-case and lower-case English characters, 10 single decimal digits, and 18 auxiliary symbols and punctuation marks), the number of simple strings that can be manufactured to be congruent with the exemplary complex string 220 is the astronomical 8024. Of course, considering grammatical constraints in both natural languages and computer-tailored languages, the number of likely encounters in a data stream of complex strings, congruent to the exemplary complex string 220, may be reduced significantly. However, the number would still be too large to list the likely congruent strings in a simple dictionary adapted for use with a conventional simple-search method.
In general, individual indefinite characters "*" in complex string 220 may belong to different classes each class being defined by a corresponding subset of the alphabet. Two complex strings 222 and 224, which may be encountered in a data stream contain identical simple strings in corresponding positions. The two complex strings, however, have different indefinite characters and the congruence, or otherwise, of the two strings is determined according to the class definition of the indefinite characters.
According to the method of the invention, a complex string is divided into string segments. By definition, a complex string contains a number of simple strings with intervening indefinite characters. The first constituent simple string may be preceded by indefinite characters, and the last constituent simple string may be succeeded by indefinite characters. The indefinite strings preceding a simple string is referenced as a "prefix" and the indefinite strings succeeding a simple string is referenced as a suffix. A prefix may have an arbitrary number, including zero, of characters. Likewise, a suffix may have an arbitrary number, including zero, of characters. A string segment may be defined as a concatenation of a prefix and a succeeding simple string or a concatenation of a simple string and succeeding suffix.
A string-search module 528 receives input data 570 in data units and uses the segmented complex strings together with their associated data stored in memory 526 to determine the occurrence, or otherwise, of any of the complex strings of the basic complex dictionary 520 in the input data. When the occurrence of a complex string is determined, the position of the found complex string in the input data 570 is submitted to a decision module 580 which may take some corrective actions such as deleting the complex string from the input data 570 to produce a processed text 590, or simply identifying the detected complex string in the processed text 590. The string-search module 528 is a time-critical component of the mechanism 530 and, therefore, optimizing the string-search process is of paramount importance. However, even if the execution time is rendered negligibly small, a block of the input data 570 need be retained for possible modification if a specific reference complex string is found in the input data. The retained data block, which may comprise multiple data packets, a single data packet, or a fraction of a packet, is held in a buffer 578. An upper bound of the size of a held data block, and hence a required storage capacity of buffer 578, depends largely on the method of search.
Considering one detected simple string at a time, step 630 identifies all complex strings in the complex dictionary, which contain the simple string. Step 630 may employ any of well-established simple-search methods, such as the Aho-Corasick method. Up to this point, each of the identified complex strings is treated as a candidate complex string. In step 640, the state variable associated with each candidate complex string is updated according to successive positions, in the data stream, at which any simple string belonging to the candidate complex strings is detected. In step 650, the updated state variable of each candidate complex string is compared with a corresponding reference state to determine the existence, or otherwise, of the candidate complex string in the data stream. Step 660 examines the results of the comparison for each candidate complex strings individually. If detection is ascertained for an individual candidate complex string, step 670 indicates detection of the candidate complex string then determines its location in the data stream and reports all relevant information to the decision module 580. The process then proceeds to step 620. If detection of the individual complex string is not yet determined, step 660 directs the process to step 620. Preferable, the execution of step 620 is performed after all candidate complex strings are examined in step 650.
A segment descriptor associated with each string segment 420 or 430 defines the composition of the string segment. If the first segmentation scheme of
A bitmask is also associated with each string segment 420 or 430 in order to bind the string segment to its parent complex string.
In a preferred embodiment of the present invention, an Aho-Corasick automaton is created and used in the simple-search module 820. The Aho-Corasick method detects simple strings in the order of their occurrence in the input data stream. The method also detects all overlapping simple strings that end at a single position in the data stream. Such overlapping simple strings would have at least one common end character. For example the two simple-strings chief and editor-in-chief would be reported if the simple-string editor-in-chief is encountered in the data stream 812 and if the two simple strings are placed in separate entries in a corresponding simple dictionary. The main desirable properties of a real-time string-search method include efficient memory utilization, predictable computation effort, and orderly listing where strings are detected in the order in which they occur in an examined data stream. Notably, the Aho-Corasick method, which is applicable to detection of simple strings, possesses such properties and is therefore a preferred method for incorporation in the simple-search module 820.
In step 928, the intermediate Boolean variable MASK is used to update the Boolean variable STATE in a STATE-array memory 860.
In step 930, the index, κ, of the last simple string in the specific complex string C, is selected from segment-descriptor set 752, and the bit in Boolean variable STATE in position κ is examined. If the value of the bit is "false" (logical "0"), it is determined that the portion of the input data terminating in position p does not contain the specific complex string C and step 940 is then executed. If the value of the bit is "true" (logical "1"), it is then determined that the portion of the input data terminating in position p contains all the string segments 420 of the complex string C, and the occurrence of the entire complex string C in the input data is then decided in step 934 according to the ω indefinite characters of the suffix of complex string C. If ω=0, indicating a NULL suffix, an occurrence of complex string C is ascertained and step 934 reports, to the decision module 580, an occurrence of the specific complex string C in the portion of the input data terminating in position p. If ω>0 and the suffix is incongruent with corresponding characters spanning positions (p+1) to (p+ω), it is determined in step 934 that the input data received so far does not contained the specific complex string C. Otherwise, step 934 reports, to the decision module 580, an occurrence of the specific complex string C in the portion of the input data terminating in position (p+ω) and step 940 is executed next.
Step 940 determines if all strings in set Σ have been processed. If the set Σ is not yet exhausted, another subset is processed (step 924). Otherwise, a new simple-string matching position p, as determined in step 920, is considered.
The span between a current position p and a previous position π associated with a specific complex string is determined as [p−π]modulo Γ, Γ being determined according to either of the two schemes described above. In step 1120, the Boolean variable STATE is shifted to the left a number of positions equal to the span associated with the complex string C. Each position in STATE, from which a bit is shifted, is assigned a value of "0", except the right-most position which is always assigned a value of "1" after a shift operation. In step 1122, a bit-wise logical ANDing is performed and the result overwrites the variable STATE.
As described, the bitmask used in step 1122 is considered to originate at the rightmost bit and, consequently, the Boolean state variable is shifted a number of bits equal to (p−π)modulo Γ, where Γ equals 2W, W being the word length assigned to the position indices p and π, in the direction from right to left with the rightmost bit of the Boolean variable set to equal TRUE (binary 1). Alternatively, the bitmask may originate at the leftmost bit and, consequently, the Boolean state variable may be shifted in the direction from left to right with the leftmost bit of the Boolean variable set to equal TRUE as illustrated in
In an alternate realization of the mechanism illustrated in
A ruler 1202 is used to indicate a position of each character of the input data 1250 and each character of the complex string 1220. The input data extracted from a data stream may continue ad infinitum and, therefore, a position in the input data is indexed as a cyclic number. The ruler 1202 is a cyclic ruler having a range dictated by a number of factors including the hardware platform on which the method is realized into an article of manufacture.
In general, the simple search module 820 may detect several simple strings ending in one position of the input data.
As described earlier, the preprocessing module 524 produces an array of bitmasks 754, each bitmask indicating the relative positions of each simple string within its parent complex string. Three bitmasks 1240, individually identified as 1240-0, 1240-1, and 1240-2, respectively indicate the relative positions of simple strings "DE", "KL", and "MPQST" in complex string 1220. A Boolean state variable 1260 having 32 bits is associated with complex string 1220. A current MASK is created in step 926 which is further detailed in
The current MASK is an outcome of bitwise OR operations of bitmasks of all simple strings detected at a given position in the input data 1250 subject to congruence of a prefix of each of simple strings to a corresponding portion of the input data as indicated in step 1022. Notably, the state variable 1260 is initialized in step 1012 as an opaque mask in the process of creating a current mask detailed in
As indicated in step 1120, the state variable 1260 is shifted (p−π) bits (modulo Λ) and the rightmost bit of the shifted state variable is set to equal logical TRUE, which is equated to binary 1. With π=0 at position p=06, and starting with an opaque state { }, the state variable is shifted 6 bits to the left with the bit in position 0 set to equal binary 1 to attain a state of {0}. The shifted state variable is bitwise ANDed with bitmask 1240-0 corresponding to simple string "DE". The result is a state of {0}, i.e., the rightmost bit of the state variable is set to binary 1 and each other bit is set to binary 0. There are two states corresponding to each detected simple string in the input data 1250; a first state resulting from executing step 1120 and a second state resulting from executing step 1122 of
At position 7 (according to ruler 1202) of the input data 1950, the simple-search module 820 detects a set Σ(0) of six simple strings "ABCD", "BCD", "CD", "CD", "CD", "CD", out of the eight simple strings of the segmented dictionary 750, and associates each of the detected simple strings with a parent complex string. A subset σ0 of Σ(0), referenced as 1925-0, contains detected simple strings (only one in this example) belonging to complex string 1920-0. A subset σ1 of Σ(0), referenced as 1925-1, contains detected simple strings (three in this example) belonging to complex-string 1920-1. A subset σ2 of Σ(0), referenced as 1925-2, contains detected simple strings (two in this example) belonging to complex-string 1920-2. The simple string "CD" further appears separately in two portions of input data 1950 to be detected later by the simple-search module 820. Each of the simple strings in set Σ(0) belongs to at least one string segment in at least one complex string in the set of reference complex strings 1920. String segments in the set of reference complex strings 1920 are candidate string segments. Their presence in the input data 1950 may be ascertained only after satisfying congruence conditions as described earlier with reference to
Assuming congruence of all the indefinite characters in the reference complex strings 1920 to corresponding characters of input data 1950, based on the prefix and suffix definitions, the current masks corresponding to subsets σ0, σ1, σ2 of Σ(0) are determined according to the bitwise OR operation of step 1026. Thus, the bitmask for subset σ0 of Σ(0) has only one bit in position 9 set to binary 1. The position of the set bit corresponds to the displacement (19-10) of the end character "D" of the detected simple string "ABCD" from the end character "Y" of the first simple string "UVWXY" of complex-string 1920-0. The bitmask for subset σ1 of Σ(0) has three bits in positions 0, 4, and 12 set to binary 1, the positions being determined by the displacement of each of the simple strings in σ1 from the end character "D" of the first simple string "BCD" in complex string 1920-1. The bitmask for subset σ2 of Σ(0) has two bits in positions 10 and 17 set to binary 1, the positions being determined by the displacement of each of the simple strings in σ2 from the end character "C" of the first simple string "DC" in complex string 1920-2.
As illustrated in
At position 19 (according to ruler 1202) of the input data 1950, the simple-search module 820 detects a set Σ(2) identical to Σ(1) and the same composite current masks 2080-1 and 2080-2 also apply.
The 16 complex strings 2510 are distinct. However, the method described with reference to
Each bitmask corresponds to a string segment in the segmented dictionary 2650 and has a bit in a position corresponding to the end character of the string segment set to "true" (binary 1). The position is relative to the end character of the first simple string of the complex string.
The invention thus provides a computationally efficient method for screening a data stream to detect and locate complex strings belonging to a basic complex dictionary. The basic complex dictionary may comprise a very large number of complex strings, each including coherent strings and ambiguous strings. The method is partly based on establishing equality of coherent strings and congruence of ambiguous strings, where congruence of any two characters is based on their joint membership to one of predefined character classes.
The method is well adapted to software realization in a single-processor or multi-processor computing environments. The segmentation process of the basic complex dictionary into a segmented dictionary and associated segment descriptor and bitmasks, as illustrated in
Furthermore, in a multi-processor environment, the processes implemented by the two basic components 820 and 840 of the string-search module 528, may be pipelined to increase the rate at which complex strings can be detected and, hence, enable handling data streams of high flow rates.
Although specific embodiments of the invention have been described in detail, it should be understood that the described embodiments are intended to be illustrative and not restrictive. Various changes and modifications of the embodiments shown in the drawings and described in the specification may be made within the scope of the following claims without departing from the scope of the invention in its broader aspect.
|Cited Patent
|Filing date
|Publication date
|Oct 24, 1991
|Mar 29, 1994
|Digital Equipment Corporation
|System and method for analyzing complex sequences in trace arrays using multiple finite automata
|Jun 17, 1993
|Feb 7, 1995
|Matsushita Electric Industrial Co., Ltd.
|Finite state automation text search apparatus having two-level memory structure
|Dec 11, 1995
|Jan 27, 1998
|Ab Initio Software Corporation
|Methods and systems for reconstructing the state of a computation
|Feb 17, 1999
|Aug 21, 2001
|John Andrew Curtis
|Search engine using indexing method for storing and retrieving data
|May 2, 2001
|Aug 31, 2004
|Unisys Corporation
|Method for execution of query to search strings of characters that match pattern with a target string utilizing bit vector
|Mar 28, 2000
|May 10, 2005
|Cisco Technology, Inc.
|Method and apparatus for high-speed parsing of network messages
|Jun 13, 2002
|Oct 4, 2005
|Intel Corporation
|Full regular expression search of network traffic
|Mar 12, 2004
|Jul 25, 2006
|Sensory Networks, Inc.
|Apparatus and method for memory efficient, programmable, pattern matching finite state machine hardware
|Feb 4, 2003
|Nov 7, 2006
|Stellenberg Gerald S
|Method and apparatus for data packet pattern matching
|Feb 13, 2002
|May 29, 2007
|Cisco Technology, Inc.
|System and method for performing regular expression matching with high parallelism
|Apr 26, 2002
|Aug 7, 2007
|P-Cube Ltd.
|Apparatus and method for pattern matching in text based protocol
|Apr 22, 2004
|Jan 29, 2008
|Id3Man, Inc.
|Database with efficient fuzzy matching
|Aug 17, 2005
|Jul 29, 2008
|Intel Corporation
|Full regular expression search of network traffic
|Nov 5, 2004
|Nov 18, 2008
|Qiang Wang
|Fast signature scan
|Oct 21, 2004
|Mar 24, 2009
|International Business Machines Corporation
|Pattern-matching system
|Sep 19, 2006
|May 5, 2009
|Netlogic Microsystems, Inc.
|Search circuit having individually selectable search engines
|Mar 9, 2006
|Dec 28, 2010
|Microsoft Corporation
|Data parsing with annotated patterns
|Aug 10, 2009
|Jan 18, 2011
|Netlogic Microsystems, Inc.
|Counter circuit for regular expression search engines
|Jul 27, 2010
|Mar 29, 2011
|Netlogic Microsystems, Inc.
|Reformulating regular expressions into architecture-dependent bit groups
|Feb 16, 2006
|Jun 7, 2011
|Microsoft Corporation
|Visual design of annotated regular expression
|Dec 3, 2001
|Mar 13, 2003
|Raqia Networks Inc.
|High speed data stream pattern recognition
|Dec 2, 2004
|Jun 2, 2005
|Nec Corporation
|Efficient retrieval of variable-length character string data
|Dec 12, 2003
|Jun 16, 2005
|Fast, scalable pattern-matching engine
|May 21, 2004
|Dec 8, 2005
|Mcmillen Robert J
|Regular expression acceleration engine and processing model
|Jul 26, 2004
|Jan 26, 2006
|Norton Marc A
|Methods and systems for multi-pattern searching
|Apr 12, 2006
|Oct 19, 2006
|Argentar David R
|Identifying patterns of symbols in sequences of symbols using a binary array representation of the sequence
|Jun 30, 2005
|Jan 11, 2007
|Santosh Balakrishnan
|Stateful packet content matching mechanisms
|Oct 27, 2006
|Jun 7, 2007
|Curtis L. Harris
|General Purpose Set Theoretic Processor
|Sep 19, 2006
|Mar 20, 2008
|Netlogic Microsystems, Inc.
|Inexact pattern searching using bitmap contained in a bitcheck command
|A New Approach to Text Searching, by R.A. Baeza-Yates and G.H. Connet, Communication of the ACM, 35, Oct. 1992, p. 74-82.
|Alicherry et al. High Speed Pattern Matching for Network IDS/IPS; Lucent Bell Laboratories; IEEE, 2006.
|Efficient String Matching: An Aid to Bibliographic Search Alfred V. Aho and Margaret J. Corasick Bell Laboratories Bell Laboratories; 1975.
|Efficient String Matching: An Aid to Bibliographic Search, by A.V. Aho and M.J. Corasick, Communication of the ACM, Jun. 1975, v.18, No. 6, p. 333-340.
|Gonzalo Navarro, Mathieu Raffinot Practical and flexible pattern matching over Ziv-Lempel compressed text Journal of Discrete Algorithms 2 (2004) 347-371 www.elsevier.com/locate/jda2 Feb. 2004.
|Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa Faster Approximate String Matching over Compressed Text IEEE 2001.
|Regular Expression Search Algorithm, by Ken Thompaon, Communications of the ACM, Jun. 1968, v.11, No. 6, p. 419-422.
|Xu Kefu, Qi Deyu, Qian Zhengping, Zheng Weiping "Fast Dynamic Pattern Matching for Deep Packet Inspection" 2007 IEEE.
|Citing Patent
|Filing date
|Publication date
|Oct 13, 2008
|Sep 18, 2012
|University Of Florida Research Foundation, Inc.
|Efficient intrusion detection
|Oct 13, 2008
|Aug 5, 2010
|University Of Florida Research Foud
|Efficient intrusion detection
|Dec 8, 2010
|Jun 14, 2012
|Clark Christopher F
|Pattern matching
|U.S. Classification
|707/780, 707/755, 707/756
|International Classification
|Cooperative Classification
|European Classification
|Jun 9, 2011
Owner name: TREND MICRO KABUSHIKI KAISHA, JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:THIRD BRIGADE INC.;REEL/FRAME:026415/0001
Effective date: 20090515
Owner name: THIRD BRIGADE INC., CANADA
Free format text: CHANGE-CORRECTION OF NAME AND ADDRESS;ASSIGNOR:THIRD BRIGADE, INC.;REEL/FRAME:026414/0233
Effective date: 20090414
Owner name: TREND MICRO INCORPORATED, JAPAN
Free format text: CONFIRAMTION OF COMPANY NAME AND ADDRESS;ASSIGNOR:TREND MICRO KABUSHIKI KAISHA;REEL/FRAME:026414/0364
Effective date: 20090803
Owner name: THIRD BRIGADE, INC., CANADA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BOYCE, KEVIN GERARD;REEL/FRAME:026414/0795
Effective date: 20070220
|Dec 11, 2014
|Fee payment
Year of fee payment: 4


text:
Nearby Restaurants
Ilios Noche - Park Rd.
0.68 mi away at 8426 Park Rd
Spread the word!
Keep up to date!
Straight to your inbox
Please note: The term Quail Hollow Club as well as all associated graphics, logos, and/or other tradermarks, tradenames or copyrights are the property of the Quail Hollow Club and are used herein for factual descriptive purposes only. We are in no way associated with or authorized by the Quail Hollow Club and neither that entity nor any of its affiliates have licensed or endorsed us to sell tickets, goods and or services in conjunction with their events.