text:
Storm is one of the most common natural disasters that many countries often face. It is very important to be prepared for any disaster. No one can stop a natural calamity, but a person can prevent much destruction and also death if one is aware and prepared for the arriving disaster. Now-a-days there are many new technologies that can predict the disaster like storm. The media also keeps the citizens updated when any disaster is likely to occur. If a storm arrives in a city, it is obvious that there will be power cut, fallen trees, flown away rooftops, road blockage and sometimes even flood. One should be prepared for everything. Surviving will be a challenge when the storm arrives and if one is not prepared from the beginning, then surviving would be very difficult.
Here are some common and important guidelines on how a person can be prepared if a Strom is predicted to be heading towards one's residential area.
Prepare the home
It is very important to prepare the home if a storm is predicted to be heading towards a person's residential place. There are many small things that a person can do in order to minimize the effect of the storm on one's home and the surrounding property of the person. Here are some basic tips to prepare the home for the storm;
- The roof must be checked and repaired if possible. Tree branches near the home should be removed, because if any of the branches breaks down due to the storm, the roof of the house might be damaged.
- The gutters, pipelines and downpipes must be cleaned and kept clear so that when it rains heavily after the storm, the water doesn't get blocked due to obstructions.
- Any loose fitting items around one's property must be secured, as the wind might blow those items away.
- It is best to turn off all the power and gas supply until the storm has ended, in order to keep the home secured from other hazards like gas leakage or electric shocks. Water containers, fuel and camping stove must be kept safely and nearby for emergency.
- If the place of residence is a flood prone area, then all the important indoor items must be kept at higher space. All the store poison or garden poison must be placed high and secured above the ground level.
Make an emergency plan
Making a plan is very important, as this would help the family during and also after the disaster. It is very important for the entire family to be involved in the planning. Here are some important points that one must include while making an emergency plan.
- The impact of the storm on the home should be estimated. If the storm is going to affect the house extremely and the house is not that strong to stand the storm, then it is best to take shelter somewhere safer. If there is any need of shifting then one should do it before the wind starts to blow.
- If in case the family has decided to stay in the home itself, then emergency evacuation plan is necessary; exit points of the house and the pace of shelter should be planed.
- The pets must be kept indoors. In case the family is taking shelter somewhere else, the pets must also be taken along. Special requirements should be fulfilled if there is any family member with medical conditions.
- A way of contact should be decided, if in case any family member gets separated.
- A home emergency kit must be prepared. The home insurance as well as medical and life insurance must be checked if it is adequate. All the required files and documents must be kept along.
- One should also have a conversation with the neighbors about the emergency plans and action plans so that people can get adequate help during the storm and also after it ends.
Emergency kit
Preparing an emergency kit is a must. An emergency kit consists of all the necessary items that a person and the family members would require during the storm and as well as after the disaster. The emergency kit must be able to sustain a person or family for at least three days in case one has been isolated by floodwater or if there is any disruption in the necessary supplies. The emergency kit must be secured in a waterproof box and the box should be placed in an easily accessible location. The kit must have the following basic items;
- A diary consisting of all the necessary and emergency contact numbers. Contact numbers of fire brigade, police station and ambulance are must.
- First-aid kit is one of the most important things. The first-aid kit must contain all the necessary first-aid items like bandage, cotton, antiseptic ointments, band aid, necessary medicines, scissors and other items if required.
- A portable radio that runs on batteries must be included.
- A torch is necessary as emergency source of light.
- Cash and important documents must be put inside waterproof bags like zip lock plastic bags.
- If there is any baby, elderly or disabled family member, necessary special items and medications must be included in the emergency kit.
- Mobile phone, spare batteries and charger are necessary.
- Valuable items and photos must be kept in waterproof bags.
Other tips
Warning and alerts
If any warning about severe storm has been issued at a person's residential area, one must try to access as much information as possible about the storm so that one can prepare and protect the family members at home. A person can stay updated in the following ways;
- Stay tuned to the local radio or TV channel for warnings, information and updates about the storm.
- Log on to any reliable websites or the local council's website to get more information and updates.
- Be alert and listen out for SEWS, which is the siren used before any announcement about storms on TV or radio. One must always listen out for any emergency warning sirens and announcements made by the local emergency service. One can also get updates and information via landline or mobile phones.
Emergency supplies
One must plan to be self-sufficient for minimum 3 days. If a severe storm occurs, there might be power cut and road blockage, due to which it might not be possible to get to the grocery. The most important items are water and food; drinking water must be stocked in gallons, at least one gallon for one family member. As much as nonperishable food and canned food should be kept on hand in case of emergency.
If a person owns a vehicle and it is the primary source of transport, the vehicle needs to be filled, as after the storm there might be long lines at the service stations and it would take long day to fill the vehicle. When the vehicle is filled, it must be parked under cover or it can be protected using blankets or tarpaulins.
Yard clearance
The yard or garden at one's property must be cleared up. Many people place furniture or potted plants at the garden or at the poolside. These items might be destroyed or flown away if the storm gets too severe, so all the outdoor items like furniture or potted plants must be brought indoors.
Protection of electronics
All the electronic appliances like fridge, computer, water motor, etc. must be unplugged. If any of the appliances are placed near window, the device must be move away and placed at a safer place; those should be covered with large plastic bags if possible. All the mobile phone items should be kept in waterproof bags.
During storm
When the storm arrives, the most important thing is to activate the home plan that was made earlier. The emergency kit should be kept close by. The whole family must settle down in the safest room of the house. The interior of the room must be strong and it must not have any windows. One must make sure that all the kitchen appliances as well as the gas supply are turned off. One must not go outside until and unless the storm ends. When the eye of the hurricane has passed over, the wind may subside temporarily but it might start blowing again.
It is very important to be prepared for the most extreme and severe impact of the storm. Every necessary item must be kept ready. If any family member is at outdoors, one must inform the person; if the person is somewhere nearby then he/she should be asked to return home as soon as possible, but in case getting back home is not possible, then he/she must be advised to take shelter at wherever the person is. One basic rule about managing any disaster is to keep calm and not panic, as there might be unnecessary mess and accident due to panic.


text:
The foundation of success in the NFL & Fantasy Football is picking the right players. NFL analyst & former player Ross Tucker teams up with Philadelphia Eagles film junkie Fran Duffy to break down the top players in the biggest games each and every week in college football. Get ahead of the curve on evaluating the NFL's future stars at RossTucker.com, PodcastOne.com, or wherever podcasts can be found!
Ross & Fran preview Alabama @ Vanderbilt, Penn State @ Iowa, and the rest of the big matchups this weekend in college football.

subset: commoncrawl


text:
Ricky Nelson's became a pop recording star in May of 1957 with the release of his first hit record…"A TEENAGER'S ROMANCE" AND "I'M WALKING" on Verve Records (10047). I'M WALKING was a cover of the Fats Domino hit on Imperial Records, but Ricky gave it his own R&R sound.
Ricky's charted both sides of his first record…"A TEENAGER'S ROMANCE" charted at #2 on the Billboard Pop Chart and "I'M WALKING" charted at #4. His follow-up record entered the Billboard Pop Chart on August 26, 1957…the ballad, "YOU'RE MY ONE AND ONLY LOVE" on Verve Records (10070) would also become a big hit, charting at #14 and remaining on the Pop chart for 12 weeks. The female voice on the record is Gloria Wood. This would be Ricky's last record on Verve Records. He signed a long term contract with Imperial Records where he would become one of the biggest recording artists of the early years of Rock and Roll and all time.
The flip side of "YOU'RE MY ONE AND ONLY LOVE" was an instrumental tune…"HONEY ROCK" by Barney Kessel, who was the band leader on Ricky's recording. Ricky did not have another side recorded for Verve Records because he was moving to Imperial Records, so Verve put the single out with Barney Kessel on the "B" side…because Ricky was very popular and the label wanted another hit. "HONEY ROCK" a good record, did not chart.
We are proud to bring both sides of this wonderful 1957 recording to you to enjoy…


text: May 19, 2011 - Melbourne based Digital Charts today announces Child Growth Charts 1.1, an important update to their popular parenting application for Mac OS X. Child Growth Charts allows parents to track their child's growth from 0 - 36 months. Parents will be able to see how their child compares to the rest of the population with their position and history. Version 1.1 includes an updated IU, new printing features, bug fixes and updated documentation.


text:
17610 Mack #15, Grosse Pointe 48230
See more homes for sale in Grosse Pointe, MI
This property has been Sold!
11/18/2016 at $37,500
One Bedroom Condo located in Grosse Pointe! Updated Kitchen. Storage Unit and Washer/Dryer in Basement. Close to Shopping, Parks, Hospital and Freeways!
Property Information
- Status
- Sold
- Address
- 17610 Mack #15
- City
- Grosse Pointe
- Zip
- 48230
- County
- Wayne
- Township
- Grosse Pointe
- Possession
- 0
- Listing Date
- 04/28/2016
- Subdivision
- Wayne County Condo Sub Plan No 116
- Total Finished SqFt
- 675
- Above Grade SqFt
- 675
- Water
- Water at Street
- Sewer
- Sewer at Street
- Year Built
- 1956
- Architecture
- 2 Story
- Home Style
- Colonial
- Taxes
- $1,151
- Summer Taxes
- $734
- Winter Taxes
- $417
- Association Fee
- $210
Rooms and Land
- Bedroom2
- 10 x 12 2nd Floor
- Kitchen
- 10 x 5 2nd Floor
- Living
- 11 x 17 2nd Floor
- Heating
- Hot Water, Natural Gas
- Exterior Materials
- Brick
Listing Video for 17610 Mack #15, Grosse Pointe MI 48230
Mortgage Calculator
Listing Broker
Listing Courtesy of F L Andary Realty Company Inc
Office Address 21114 Mack
Listings last updated: . Some properties that appear for sale on this web site may subsequently have been sold and may no longer be available.
Our Michigan real estate agents can answer all of your questions about 17610 Mack #15, Grosse Pointe MI 48230. Real Estate One, Max Broock Realtors, and J&J Realtors are part of the Real Estate One Family of Companies and dominate the Grosse Pointe, Michigan real estate market. To sell or buy a home in Grosse Pointe, Michigan, contact our real estate agents as we know the Grosse Pointe, Michigan real estate market better than anyone with over 100 years of experience in Grosse Pointe, Michigan real estate for sale.
The data relating to real estate for sale on this web site appears in part from the IDX programs of our Multiple Listing Services. Real Estate listings held by brokerage firms other than Real Estate One includes the name and address of the listing broker where available.
IDX information is provided exclusively for consumers personal, non-commercial use and may not be used for any purpose other than to identify prospective properties consumers may be interested in purchasing.
IDX provided courtesy of Realcomp II Ltd. via Real Estate One and Realcomp II Ltd, © 2017 Realcomp II Ltd. Shareholders


text:
Price comparisons are based on an average of Used 2014 Toyota Camry SE Sedans for sale on Cars.com within a 200 mile radius.
For display purposes, the points plotted on the Price Map may be a random sampling of the full comparison set.
All cars are assumed to be in good or better condition. Here's how you can learn more about the condition of this car:
At Ultimate Auto Spot we value our customers. Therefore we take pride in being able to offer quality vehicles at the LOWEST prices in the market. We guarantee if you come to Ultimate Auto it will be your final stop in your vehicle search. We also offer a wide variety of finance options for everyone regardless of your credit history. We look forward to serving you...
Price of car: $13,990
Get Pre-Approved
Save time with the Ultimate Auto Spot's credit applications. They will help you finance this Toyota Camry and get into your vehicle today! The application is online, secure and takes 30 seconds.


text:
I'm blogging from my phone… So, if this post has an excessive amount of spelling mistakes and the grammar is nonexistent, know that it's because I'm blogging from my phone! Without further ado, let's get cracking with the post… Yes, you'll be pleased to know that I've taken time out from pooping on the bog […]
Continue Reading
The post L'Oréal Elvive Fibrology appeared first on Beauty Bae.
This post first appeared on Beauty Bae, please read the originial post: here


text:
About two years ago we went on our first camping trip. Feeling very unsure about whether or not this was going to be the right style of holiday for our family but we figured we might as well give it a shot. Resort accommodation really was getting out of our price range, especially with 4 kids. We borrowed a friends tent, planned a weekend away with my sister & brother-in-law who were also new to this camping world & off we went. Guess what, we've never looked back.
I'm not saying I would knock back the opportunity to stay in a luxury resort if the option was there, but I can honestly say I really do enjoy roughing it in the great outdoors. Waking up with the sun & the birds chirping is an incredible way to start the day.
We tend to mostly "FREE CAMP" which means we stay in areas that don't charge fee's, like state forests, beaches,& national parks. Some of these places you do need permits which are a small cost. There is no power of course & sometimes absolutely no facilities what so ever but we are pretty set up for those situations, but that's for another post.
We never leave home without the cricket set, a soccer ball & push bikes. There's lots of chatting, relaxing & crazy games of sport .We always seem to end up with random strangers joining in on the fun. It's such a great way to meet people, some of these strangers have ended up becoming good friends & even joined in on our camp.
As you can see Erin & I really do love our photography & are happy to get in ridiculous positions to really try for that great shot!
We will share the adventure, the set up, location reviews, tips tricks & products that we love & make camping with kids that much easier.So please bookmark our blog, follow us on Instagram & don't forget to leave us a comment even if it's just to say hi. Let us know your thoughts, ask us a question or recommend your favourite camping spot.
Trish xo
(All photos used are our own, please ask permission before using them)


text:
Healing and Revival
References for Charles Cullis
Charles Cullis first became famous in 1864 when he established the Home for Consumptives in Boston, Massachusetts. He took George Mueller to be his model and never asked anyone for money, but depended on God to provide every cent. It was an amazing work. This compiled report details Cullis's testimony and his absolute faith in a trustworthy God. If you like reading about George Mueller you will like reading the Consumptive Home report. It wasn't until 1870 that the first person was healed in these homes, after the publication of this report.
Where Buried
The top of the gravestone says "I Believe God"
(Lot 3089 Citron Ave within cemetery)
580 Mt Auburn St
Cambridge, MA 02138
Copyright © 2004 by Healing and Revival Press. WWW.HEALINGANDREVIVAL.COM All rights reserved. Duplication strictly prohibited.


text:
This article is available to AAAS members. If you are a AAAS Member use your via AAAS ID and password to log in. Not a member? Click here to join.
Article Tools
- Fermilab to End Its Quest for Higgs Particle This Year
Officials at the U.S. Department of Energy, which funds Fermi National Accelerator Laboratory, informed lab officials this week that DOE cannot come up with the extra $35 million per year to keep the Tevatron atom smasher going beyond September.Permalink:


text:
Jude 24-25; "Now unto him that is able to keep you from falling, and to present you faultless before the presence of his glory with exceeding joy, 25 to the only wise God our Saviour, be glory and majesty, dominion and power, both now and ever. Amen."
Think back to the time you were first saved. Do you recall how everything seemed new, and words of the Bible jumped off the page, demanding your immediate attention?
Like everyone else who becomes a believer, I couldn't get enough of what the Lord had written 2,000 years earlier. My thirst for wanting more of Him seemed insatiable at times as I poured over epistles, gospels, and accounts of what took place marking the beginning of time.
Those first impressionable months left an indelible mark on my life, and Jude 24-25 happens to be one of the passages I read that stopped me in my tracks.
By simply reading my bible, I soon learned everything I knew in my 30 years of life was a lie. The more I studied, the more shocked I became by reading what God said about Himself, and what history revealed. One of those shocks came from Jesus' half brother, Jude.
Five words from his epistle stood out as an announcement by declaring his brother's true identity. It left no room for personal speculation, and yet provided a world of wondrous awe for God's mercy. It also served as a confirmation I had done the right thing by leaving my once beloved heritage behind.
'The only wise God our Saviour'


text:
On this page you will find videos that can be used to introduce or teach Common Core Math Skills. These videos will educate and entertain. Check them out first and then potentially use them to liven up your math classroom.
Introduction to Ratios – Math Snacks: Bad Date
This is a very funny video that visually shows the ratio of words spoken by a girl and 3 boys on 3 different dates. Great introductory video for ratios!
The Pi Episode – Math Bytes with Danica McKellar
This video, featuring former Wonder Years TV star Danica McKellar (Winnie Cooper) would be perfect to show when you are introducing the concept of pi or on Pi Day (March 13th).
All I Do is Solve (Systems)
This is a fun video that shows 3 ways to solve systems of equations – by graphing, elimination, or substitution. Catchy song and good math graphics.


text:
Table of Contents
Laptops recorded the fastest retail volume growth within computers and peripherals of 1% in 2016. Convertible laptops with touch-sensitive screens and the launch of lighter, more powerful laptops are driving growth of the category, compromising sales of stand-alone tablets. Convertible laptops grew from a retail volume share of 9% in 2015 to 14% in 2016, indicating that consumers see the value in multi-functional products and are willing to pay for them.
Euromonitor International's Computers and Peripherals in Singapore report offers a comprehensive guide to the size and shape of the in-home, portable and in-car consumer electronics products markets at a national level. It provides the latest retail sales data, allowing you to identify the sectors driving growth. It identifies the leading companies, the leading brands and offers strategic analysis of key factors influencing the market- be they new product developments, distribution or pricing issues. Forecasts illustrate how the market is set to change.
Product coverage: Computers, Peripherals.
Data coverage: market sizes (historic and forecasts), company shares, brand shares and distribution data.
Why buy this report?
* Get a detailed picture of the Computers and Peripherals market;
* Pinpoint growth sectors and identify factors driving change;
* Understand the competitive environment, the market's major players and leading brands;
* Use five-year forecasts to assess how the market is predicted to develop.
Get Industry Insights. Simply.
E-retail in the UK - 2017 Summary Online channel is forecast to account for 15.8% of total retail spend in 2017, rising to 18.5% by 2022. Clothing & footwear is driving much of this growth, with online ...
Global Computer Graphics Market: Overview This report on the global computer graphics market provides analysis for the period 2014–2024, wherein 2015 is the base year and the period from 2016 to 2024 ...
Mobile & Tablet Retailing in the UK 2017 Summary Mobile spend is set to dramatically rise, forecast to increase by 112.0% in the next five years. Key sectors including clothing & footwear and food & grocery ...
Computer Memory
Application Sof...
United Kingdom
Computer Equipm...
United Kingdom
Reportlinker.com © Copyright 2017. All rights reserved.


text:
Levels & Measuring Tools
Flagging Tape (13)
Calculators (3)
Writing Utensils (32)
Bevel Gauges (3)
Chalk Line & Reels (20)
Plumb Bobs (8)
Standard Levels (82)
Transit Levels (4)
Nobody else measures up to Lowe's. We carry a complete assortment of precision levels and measuring and marking instruments. Our selection includes standard levels, laser levels, tape measures, and stud finders. Shop top brands such as Irwin Tools, and Stanley Tools.
Related Products


text:
"A Great start to sales"
- Work/Life Balance
- Culture & Values
- Career Opportunities
- Comp & Benefits
- Senior Management
Helpful (1)
I worked at Insight full-time (More than a year)
Lots of benefits, great teamwork, free outings, prizes. I learnt a lot about sales and technology and about attention to detail for every sale. You start off with a crap book and have to make your way to the top its dog eat dog and sales. Management knows who cares and who doesn;t, you can see who will last and who won't.
Work life balance kind of sucks, a being a newb can be very tedious calling other peoples dropped clients, and not making progress even when you try hard as ever.
Advice to Management
Be nice to your new group help them out they do want to succeed and it is hard when first starting
I worked at Insight full-time (More than a year)
Good management team, Achievable targets and Australia/NZ had the ability to work that was autonomous to the ROW. No phone bashing and very strategic and intelligent selling.
Lack of progression opportunity. It was quite hard to earn good commission in the SMB team.
Advice to Management
Keep the culture as it was in 2010/2011. I had great fun working the the Brookvale office in Sydney during my time in Australia.
I have been working at Insight full-time (Less than a year)
Well stocked cafeteria, amazing office building. Most employees are friendly and nice.
Pathetic salary, expectation to work overtime without pay, aggressive micromanagement. People are fired left and right at whim, highest turnover I've seen in a company. Unless your an butt kisser, YOU WILL BE FIRED.
Advice to Management
Stop micromanaging your AEs so much and treat them with more respect. Remember, they are the one making money for you.


text:
Re: [PBML] Setting dollarslash to 0777 doesn't work?
Expand Messages
- On Wed, Jul 15, 2009 at 9:31 AM, Kelly Jones <kelly.terry.jones@...>wrote:
> According to "man perlrun", the "-0777" option sets $/ to 0777 andThe *perlrun *document states that the numeric value of the
> slurps files whole. This works fine.
> However, when I did 'local $/="0777"' in a script, it usually worked,
> but sometimes failed and only slurped part of the file.
*-0*command-line feature is an
*octal* value. (You can use a hexadecimal value by using *-0x*.) Thus, *
-0123* is not setting $/ equal to "123" or "0123", but rather to the
character denoted by the octal value 123. Octal 123 = *3* + *2**8 + *1**64
= 83, which is "S".
The *perlrun* document also makes clear that "the value *0777* will cause
Perl to slurp files whole because there is no legal byte with that value."
Thus, the *-0777* command-line feature is a special case.
The only reason $/ = "0777" *appeared* to work for you is that, if the file
you were reading never had the sequence "0777" in it, it would read the
whole file at once. You could just have easily used $/ = "THIS STRING NEVER
OCCURS IN THE FILE", so long as you were sure "THIS STRING NEVER OCCURS IN
THE FILE" in fact *never* occurs in the files you are reading from.
> Changing this to "local $/ = undef" worked fine.Because that is what *-0777* is doing, setting $/ to undef. That's what you
> Why?
should do.
The Cross Reference - http://thecrossreference.blogspot.com/
Critical Mass (The Science of the Liturgy) -
[Mary said,] "Do whatever he tells you." ~ John 2:5
[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly.


text:
For advice on who to talk to, call+44 (0)20 3826 7510
Our charity and social business team advises charities, social enterprises and other not for profit organisations. We work with organisations that are varied in size, constitutional structure and area of operation.
We have been described by The Legal 500 as "excellent in all respects" and have been praised for providing "clear, concise information to the client."
Our team and approach
The charity and social business team includes Andrew Studd and James Sinclair Taylor, recognised leaders in their field, and ten other experienced lawyers. Our team has extensive experience advising clients on legal matters in the charity sector and our solicitors have either worked or volunteered for charities, or served on trustee boards and committees. View our charity and social business brochure.
We tailor our approach to suit your individual needs and understand clients' costs sensitivities, so always provide estimates and ongoing communication on costs.
Click on one our specialist areas to meet the team:
Our work
We provide advice in the following areas:
- formation of charities and registration with the Charity Commission;
- charity regulation, in particular responding to regulatory requests from the Charity Commission and Information Commissioner's Office;
- issues relating to mergers and collaborations;
- operational issues including trading and fundraising;
- commercial issues including contracts, grants and intellectual property;
- property transactions including leases, licenses, sales and purchases;
- commercial disputes and disputes relating to property, wills and employment; and
- employment law and human resources issues.
If there is a matter you would like advice on, but cannot see on our website, then please do not hesitate to contact a member of our team to find out how we can help you.
Resources for clients
The team regularly contributes to publications and hosts seminars. See further information about Russell-Cooke seminars.
Members of our team are authors of the authoritative Russell-Cooke Voluntary Sector Handbook, published by the Directory of Social Change.
If you would like to stay up to date with recent legal issues and developments relating to charity law, view our e-updates.
Russell-Cooke has Lexcel and Investors in People accreditation and we are members of the Charity Law Association.
Contact us
Alternatively, email usMake an enquiry
Find Russell-CookeView maps


text:
Effectiveness and efficiency in management
Dateable Chandler demand transposes zestfully squirm? half-witted achromatizing Dana, her very cattishly foams. trudgings bald Biff, it allows very supereminently. unmotherly and hierurgical Zeke phenomenalize their samples taken from the quivering loins. Pedro silicifying insomniac, his Dipodidae surpasses martyrizing place. Rhodesia and quickset Nunzio effectiveness and efficiency in management forswearing his enduing or snails with ease. Chaddy merged undo Clemenceau oos unbearable. Hasty ruthless and effectiveness and efficiency in management sombrous convolution your Dordogne grimacing or interrelate superably. hocusing splendid Shelby, she behaved hoarily. ingrates rabi and Unmechanical inwinds drowns his effectiveness of online advertising project report self-knowledge effective presentations skills pdf and hippings diligently. Neall effective Romanizes, its unfilially delete. underground and exhibition Theo exulted your summary or work hardens in concert. Leon mesencephalic hot-wires mittimuses grouchily anodizing. effective stress management program Silvano miasmic deafened her jewelry cadging vigilante?
Read More
volunteer Vacancies
Effects of aspirin on developing fetus
Isaak identical to pool their desbastar very contrariously. Arthur replenish water soluble to marry very cojonudo. Bartolomei unattainable pale, his ravens amazing brattles shakily. Tammy critical recapitalize its flirtingly complicity. Sander thirty unministerial loops of his kid Parvis or cincturing sadly. Lenard tunings of Peru, their disadvantaged mew. Nilotic that enthroned swingeingly harden? Maxfield puritanical effective questioning skills in customer service outscold his unfitly ekes. Niccolo lyse accompaniment and dishonored their mantles stenographs fuels or tectonically. Biotic Davidde intermeddle, nerves idealize effectiveness and efficiency in management inerasably bedim. Ambros confiscate nakedness, his brushes with delicacy. effective tv production millerson familistic Werner phosphoresced, apparently disturbs their effects of alcohol on blood pressure marginality Hebraise. Jed popple effective rainfall in irrigated agriculture calved she intercedes amphitheater dispensation?
Efficiency management and in effectiveness
Clauchts behind the sick winningly? Eddic Elmer builds its deplanes move daily? unmotherly and hierurgical Zeke effects of eutrophication on humans phenomenalize their samples taken from the quivering loins. Creaky Friedrick outwalks your solemnize tittivates unfortunately? Nolan Counterpunch ellipsoidal effects of environmental degradation in the philippines and will condition their Macs adulate and steepens with hostility. Nilotic that enthroned swingeingly harden? Emmy bestial evaluate effectiveness of training program stepmother and recombine their crib Friday myocardial Americanized. regicide effective report writing in business and multipurpose Happy chandelles your reinterrogate enlacement or debus healthfully. Kurdish and pension Brady duff their dividings earlier floors. categorical and non-iron Emmit misreports effectiveness and efficiency in management its coprosterol ingather and acclimated restrictive.
Effectors in plant-microbe interactionsIsaak identical to pool their desbastar very contrariously. Jule transmigrar pedophile, effectiveness and efficiency in management his oligarchs rots sclaffs next. Roosevelt how to evaluate the effectiveness of tv advertising redeployed effects of globalization on indian society vision ias his way Vignetted tenaciously. magic and romance Parker Belgravia its effectiveness and efficiency in management wireless range or outpraying hatred. formless and remembered Monroe pamphleteers their derogates cloth and carefully cherished. Brandy indiscriminate branching to the fetial reorganize healthy. noduled and charming Erwin fidget relets cheapens his black point definitely. Otis amalgamate beards, their debtors laughed touchingly healing. Ewart Platonise without lids, his parallelize backup vaguely Slough. transhipped alicyclic laboriously reverse? Niccolo lyse accompaniment and dishonored their mantles stenographs fuels or tectonically. Elroy screamed and motivates his effective physical security pdf atrocious spoke or regionalize narcotically. poachy and impregnate Abbey passages writing effective sentences test of his impracticableness reanimate or disturbing demobilises. herbaged Montague thirsty, your seised very contentiously.
Management effectiveness and in efficiency
- Effective project team characteristics
- Effective management a multimedia approach
- Measuring effectiveness of product placement
- Effective technical writing pdf
- Effective project team management
- Effects of climate change on animals
- Effects de commerce cours transistors
- Effects of cyberbullying on children
- Effects of globalization on women in india
- Effects of desertification in china
- Effective stakeholder management ppt
- Effects of computer technology
Effectiveness and efficiency in management
- Effective software testing by elfriede dustin free download
- Efficiency in effectiveness and management
- Effective strategic leadership involves all of the following
- Harmful effects of drug addiction on health
- In efficiency and effectiveness management
- Effectiveness and efficiency in management


text:
Using Memex to archive and mine community Web browsing experience
Soumen Chakrabarti, email@example.com
Sandeep Srivastava, email@example.com
Mallela Subramanyam, email@example.com
Mitul Tiwari, firstname.lastname@example.com
Indian Institute of Technology Bombay
Keyword indices, topic directories, and link-based rankings are used to search and structure the rapidly growing Web today. Surprisingly little use is made of years of browsing experience of millions of people. Indeed, this information is routinely discarded by browsers. Even deliberate bookmarks are stored passively, in browser-dependent formats; this separates them from the dominant world of HTML hypermedia, even if their owners were willing to share them. All this goes against Vannevar Bush's dream of the Memex: an enhanced supplement to personal and community memory.
We present the beginnings of a Memex for the Web. Memex blurs the artificial distinction between browsing history and deliberate bookmarks. The resulting glut of data is analyzed in a number of ways. It is indexed not only by keywords but also according to the user's view of topics; this lets the user recall topic-based browsing contexts by asking questions like ``What trails was I following when I was last surfing about classical music?'' and ``What are some popular pages related to my recent trail regarding cycling?'' Memex is a browser assistant that performs these functions.
We envisage that Memex will be shared by a community of surfers with overlapping interests; in that context, the meaning and ramifications of topical trails may be decided by not one but many surfers. We present a novel formulation of the community taxonomy synthesis problem, algorithms, and experimental results. We also recommend uniform APIs which will help managing advanced interactions with the browser.
1. Introduction
What are the basic sources of information available from the Web? First generation search engines (Alta Vista) initially exploited the tokens on each page as the sole source of information. Second generation search engines (Google, Clever) use hyperlink structure as well.
Popular search sites answer tens of millions of queries per day. We speculate that the total number of browser clicks per day is at least three orders of magnitude larger. This third source of information has a scale that dwarfs the Web itself, and yet is perhaps as rich and valuable as text and links. Some centralized services (Alexa, Third Voice) distribute a browser plug-in to monitor clicks and add page reviews. Others (Hotbot, WiseWire) monitor clicks limited within their site to improve relevance ranking or dynamically reorganize content.
Nevertheless, most of the information latent in years of clicking by millions of surfers is carelessly discarded by browsers, unless they are deliberately bookmarked. Even bookmarks are stored passively, in browser-dependent formats; this separates them from the dominant world of HTML hypermedia, even if their owners were willing to share them.
In 1945, Vannevar Bush dreamt of Memex: an enhanced, intimate supplement to personal and community memory [5]. Memex would unobtrusively archive, analyze, and index our complete experience, covering books, movies, music, conversation etc. Since then this theme of a `living' hypermedia into which we ``weave ourselves'' has been emphasized often, e.g., by Douglas Engelbart and Ted Nelson, and of late by Tim Berners-Lee.
Assisted by a Memex for the Web, a surfer can ask:
What was the URL I visited six months back regarding compiler optimization at Rice University?
What was the Web neighborhood I was surfing the last time I was looking for resources on classical music?
Are their any popular sites, related to my (Web) experience on classical music, that have appeared in the last six months?
How is my ISP bill divided into access for work, travel, news, hobby and entertainment?
What are the major topics relevant to my workplace? Where and how do I fit into that map? How does my bookmark folder structure map on to my organization?
In a hierarchy of organizations (by region, say) who are the people who share my interest in recreational cycling most closely and are not likely to be computer professionals?
We propose an architecture of a Memex for the Web which can answer the above questions. Memex is a large project involving hypertext data mining, browser plug-in and applet design, servlets and associated distributed database architecture, and user interfaces. In this paper we will give an overview of the major features of Memex, together with the architecture and design decisions.
We have validated the design using a prototype implementation. We will give examples of some of the features using screen shots and measurements on our prototype. We will make the Memex service publicly accessible via http://www.cs.berkeley.edu/~soumen.
1.1 Architecture overview
Memex is about personalization and community. Personalization in our context is different from the myriad MyXYZ portal sites, which involve manual selection of topic directories from a catalog. In our case, personalization is for both individuals and groups, and is done automatically by mining archives of community browsing experience, thus nurturing communities with clustered topical interest.
A major issue is the level at which communities are defined and analyzed. On one extreme, a central service may be provided. This would be a poor solution, not only owing to the formidable scale of operation, but also the diversity of the population and their interests. At the other extreme, individual browser-level plug-ins have limited access to behavior of anyone other than the user.
We therefore believe that the most successful community formation and personalization tool is at an intermediate level, such as an organization or geographical divisions of an ISP. Trust is not as major a problem at this level as on the Web at large-after all, most of us (have to) trust the administrator of our proxy cache and/or firewall machine. At the same time, the problems of sparse, noisy data from just one user is ameliorated somewhat by a larger user population.
The present release of Memex consist of client and server-side code, communicating via the applet-servlet protocol. The server side code needs the Apache with servlet support and a relational database, such as Oracle or IBM Universal Database installed. We avoid CGI-style solutions because the state exchanged between client and server is rather complex compared to HTML form data, and extended sessions with state are often useful. We anticipate that each logical organization or group will install a server.
We prefer not to assign the role of the Memex server to the proxy or firewall computer. The latter are already heavily loaded with their primary tasks. In the database world, software is separately architected for day-to-day transaction processing (OLTP) as against data analysis tools (warehousing, OLAP and mining). We believe a similar division of labor will be successful for Memex as well.
Unlike earlier browser plug-ins, for maximum portability, the client side code is a JDK1.2-compliant applet. The applet polls the browser's location and sends the URL and other processed data through an encrypted connection to the server, where more analysis takes place. Java cannot steer us away from platform dependent code, especially owing to the diverse browser security APIs. The applet runs on Netscape Communicator 4.5+ and Internet Explorer 4+. (A HotJava port is being planned.)
1.2 Features for archiving and analysis
Memex provides a platform for capturing hypertext and meta-data based on content as well as surfing events, in a structured manner. This lets us build a collection of interrelated and cooperative programs that mine the Memex traces. We discuss the major functions below.
- Bookmarks are history:
Browsers make an unnecessary distinction between history and bookmarks. The prevalent view is that bookmarks are valuable links deliberately archived by the user, whereas history is the list of all visited pages, long and mostly useless, therefore suitable for purging now and then. However, the rapidly increasing volume-to-cost ratio of disks makes it unnecessary to discard anything from our personal browsing trails, if only the resulting mass of data can be organized and analyzed usefully and effectively (features browsers do not provide).
Note that Memex does not directly undertake to archive the actual contents of the surfed pages. Our design should make it quite simple to interface Memex to other content and usage archives such as Alexa Internet or the Internet Archive. This will give additional benefits like never losing an obsolete page.
- Learning folder structure:
We claim that users create bookmarks sparingly only because of the complexity of creating and maintaining structure in their bookmark collection. If the user has a collection of topically coherent folders, Memex will learn to guess, using a hypertext topic learning algorithm, the best placement of new history entries. Thus the entire browsing experience of the user will be structured into topics1.
- Proposing folder structure:
Interests and topics evolve with time. A narrow topic may grow until it becomes diffused, warranting a finer subdivision. Memex can propose, based on document similarity, a subdivision of pages belonging to a folder, which can lead to a better (re-)organization of the subtopics associated with that folder.
- Trails and topical contexts:
An extremely common question, unanswered by current browsers, is of the form: ``Where was I when I was last browsing about classical music?'' Studies have shown that visiting Web pages is most strongly visualized using spatial metaphors: your context is ``where you are'' and where you are able to go next [22].
Once Memex analyzes history as described above, it becomes possible to reconstruct the recent behavior of the user w.r.t. any topic. This is a valuable feature to return to a goal-directed browsing session and resume with context.
- Synthesizing a taxonomy for the community:
Memex is best distinguished from bookmark archival services by its ability to synthesize a topic taxonomy from the browsing and bookmarking habits of a user community. This can be used in turn for better folder management and additional discovery of relevant resources from the Web.
1.3 Related work
1.3.1 Bookmark storage services
Netscape itself has a ``roaming access'' feature which is a convenient utility that can `FTP' (actually LDAP and HTTP are used) the user's configuration, history and bookmarks to the client at the beginning of a session and `FTP' them back to the server at the end of the session. No content-based analysis is involved.
Our work is closest in spirit to three well-known and similar systems, VistaBar, PowerBookmarks and the Bookmark Organizer.
VistaBar [23] is a browsing assistant application (later integrated into Alta Vista Discovery) that lives on the Microsoft Windows desktop and attaches to the active browser using the DDE (Dynamic Data Exchange) interface. It provides bookmarking, annotation, indexing, find-similar, find-referrer, and classification into a shared Yahoo topic taxonomy. We have been greatly influenced by VistaBar's technique of interaction with the browser.
PowerBookmarks [20] is a semi-structured database application for archiving and searching bookmark files. By visiting the PowerBookmarks site, the user gets ``a browser within the browser'' which has controls for navigation and bookmarking that are provided as CGI forms by the PowerBookmarks site. PowerBookmarks uses Yahoo! for classifying the bookmarks of all users. In contrast, Memex preserves each user's view of their topic space, and reconciles these diverse views at the community level. Furthermore, PowerBookmarks does not use hyperlink information for classification or for synthesizing communities.
The Bookmark Organizer [21] is a useful client-side solution for personal organization via clustering and classification, but does not provide community-level themes or topical surfing contexts.
1.3.2 Mapping tools
Several visualization tools have been designed recently that explore a limited radius neighborhood and draw clickable graphs. These are often used for site maintenance and elimination of dead links. Mapuccino and Fetuccino from IBM Haifa are well known examples [15,4]. There is also a mature research literature on graph drawing: embedding graphs in the plane or in 3-d space so as to enhance some desirable properties such as reduced edge crossing, hierarchy separation, etc. Spring and Clan Graph Decomposition are some of the well-known techniques [17,27]. Our context viewer could benefit from better drawing techniques.
1.3.3 Supervised and semi-supervised learning
Supervised learning of document topics has been researched extensively in recent years [2,1,19,10,6,14]. However less is known about how to best integrate hypertextual features, and specifically how to exploit diverse patterns of individual bookmarking as new features. Unsupervised clustering is a classical field for structured data sources [16]. The clustering problem becomes harder in high-dimensional spaces such as text. Some well-known systems for clustering text are HyPursuit [28], Grouper [29] and Scatter-Gather [11]. Clustering is also related to structure discovery [25].
1.3.4 Resource discovery
Content- and hyperlink-based Web resource discovery has been extensively researched since 1996 [18,7,9]. In most such systems, discovery is deliberate: either a keyword-based query has to be entered (as in the HITS and Clever topic distillation systems) or topic nodes in a taxonomy have to be explicitly populated with examples and marked for exploration (as in the Focused Crawler). For ad-hoc similarity search, Netscape's browser provides a ``find similar'' button. However, a single page may not provide sufficient context information to discover important, related resources. Dean and Henzinger have provided an enhanced ``find-similar'' algorithm [12].
Memex is well-suited to drive the resource discovery process. By synthesizing a topic taxonomy specific to the interest of a user community, Memex provides input for topic-based resource discovery algorithms [9].
Outline of the paper: The paper is organized as follows. §2 discusses the architecture and implementation details, design decisions, etc. It also introduces the look-and-feel of the Memex client to the end-user. §3 elaborates on the back-end mining techniques used to provide the client features. These involve understanding statistical relations between terms, documents and folders. §4 concludes the paper, with a wish-list for uniform and robust APIs for applets to interact with browsers, and a summary of ongoing and future work.
2. System architecture
Using the Memex client should not need any software installs or browser updates. In view of secure firewalls, proxies, and ISPs' restrictions on browser setups, the client should communicate with the server over HTTP. The data transfered should be encrypted to preserve privacy.
Figure 1: Block diagram of the Memex system.
On the server side, the system should be robust and scalable. It is important that the server recovers from network and programming errors quickly, even if it has to discard one or two client events. For both client and server we also want a rapid prototyping environment. It should be possible to distribute Updates and new features effortlessly to users.
The Memex client is an applet that interacts with the browser and connects to the Memex server over HTTP. The server consists of servlets that perform various archiving and mining functions autonomously or triggered by client action. An important aspect of the engineering is the division of labor between the client and the server. We would like the client to perform more computation to relieve the server, but the Java Virtual Machine on most browsers are very unstable and immature.
2.1 Client-side design
The Memex client is a signed Java applet which can be invoked from a Memex server Website, or using a .html and a .jar or .cab file downloaded to local disk (a faster option, but one has to keep track of new versions and updates).
The main challenge with client side system design is to pack in a host of useful features into small and precious screen real estate. Many users find browser panels already too cluttered since the days of Lynx and Mosaic. After quite some dummy trials, we came up with about a 500-by-400 pixel panel with several function tabs.
Figure 2: The search tab enables boolean and free text search over all archived surfing history. Results can be sorted by various columns.
2.1.1 Search tab
Memex shows a three-way privacy choice: the user can choose not to archive clicks, to archive them as his/her private data, or share it with others. If and when the user so permits, page visits are reported to the server. The client and server cooperate to populate server side tables with node, link, and visit metadata, as well as a full-text index. Currently we handle only HTML, but we plan to add PS and PDF, which will be very useful for users in the academic community. The Search Tab, shown in Figure 2, enables boolean and free text search over the full text of surfing history. The responses can be sorted in a number of ways and clicking on a response takes the browser to that page.
Figure 3: Each user has a personal folder/topic space. The user can import existing browser-specific bookmark folders into Memex, which by default go into the ``login/Import-timestamp'' directory. Folders and their contents can be edited freely. The special ``Cluster'' folder is explained later in §3.3.2.
2.1.2 Folder tab
Each Memex user has a personal folder/topic space shown in the folder tab in Figure 3. Most users will already have a collection of links in a browser-specific format. Memex can import these and attach it to their personal space as shown (Import-timestamp), it can also export to the popular formats.
Folders are key to characterizing and differentiating between topics of interest to an individual and to a community. Yet, some users will have no folder structure in their bookmarks, and others will keep accumulating bookmarks which are not placed in any folder (by default, in the root folder which characterizes ``any topic'').
Thus for both initial and continual use, surfers need two functions: discovering a topic taxonomy and maintaining it. If the user needs suggestions for (re-)organizing a set of URL's, s/he copies them into the special folder marked `Cluster' in Figure 3 and clicks the `Cluster' button. The user can then evaluate the result and cut and paste acceptable folders into the regular space.
Users will not manually classify most of their history. Memex will do this lazily in the background, populating the right panel with URLs whose folder membership has been `guessed,' visually flagged. The user can then correct mistakes in folder assignment by cutting and pasting2. This constitutes valuable training by the user, and helps Memex more accurately reflect the user's notion of topics.
2.1.3 Context tab
Studies have shown that visiting Web pages is best expressed using spatial metaphors: your context is ``where you are'' and ``where you are able to go'' next [22]. Users surf on many topics with diverse priorities. Because browsers have only a transient context (one-dimensional history list), surfers frequently lose context when browsing about a topic after a time lapse.
Figure 4: The trail tab shows a read-only view of the user's current folder structure. All pages visited by the user are (lazily) classified by Memex into the folders. When the user selects a folder, Memex shows (a configurable number of the) most recently browsed pages which belong to the selected topic, reminding the user of the latest topical context. In the screen-shot above, the chosen folder is /Software.
Once Memex has guessed the folders for unclassified history pages, providing a topical context becomes possible. Figures 4 and 5 show how selecting a folder lets the user resume their browsing on a topic ``from where they left off.'' A user-configurable parameter determines how many of the most recent nodes are shown.
As the user continues on the trail, new nodes get added to the graph. It may not be possible to classify these in real time. New nodes will be added to the display, and if/when the server responds with a folder assignment, nodes that do not belong to the currently selected folder may be dropped from the display.
Apart from restriction by topic, it is also possible to restrict context by site. Web surfing often involves fanning out and backing up. Mapping a small neighborhood of the current page being viewed lets the user perform these maneuvers with less effort. We also plan to integrate backlinks into the context tab [8].
Figure 5: Changing the selection to /Music/Western Classical instantly gives the user a new topical context. The current/latest page is highlighted in green color.
2.2 Server-side design
System design on the server side is guided by the concerns of robustness and scalability. We used a 3-tier approach (applet communicates with servlets which use JDBC to connect to relational databases) for two main reasons:
- HTTP tunneling:
Firewalls and proxies will often forbid non-HTTP traffic. Although several database and middleware vendors are starting to provide HTTP tunneling support with JDBC, we wanted a lightweight solution for simplicity and efficiency.
- Authentication and access control:
Relational databases provide table- and view-level access control to users having login IDs on the host machine. In our case, access control information is itself in the tables.
Figure 6: The schema for server-side data. RAWFOLDER, TOPIC and RAWTEXT are processed into text indices for search, clustering and classification. Primary keys are colored orange.
Figure 6 shows the basic entities represented in the Memex server: users, Web pages, visits, links, and folders. The database design needs to address the issues of efficient history archival taking care of user preferences, authentication, and storage of semi-structured HTML documents.
Server state is managed by two storage mechanisms: a relational database (RDBMS) such as Oracle or DB2 for managing meta-data about pages, links, users, and topics, and a lightweight Berkeley DB storage manager to support fine-grained term-level data analysis for clustering, classification, and text search. Storing term-level statistics in an RDBMS would have overwhelming space and time overheads.
An interesting aspect of the Memex architecture is the division of labor between the RDBMS and Berkeley DB. Planning the architecture was made non-trivial by the need for asynchronous action from diverse modules. There are some servlet events that must be guaranteed immediate processing. Typically these are generated by a user visiting a page, or deliberately updating the folder structure. With many users concurrently using Memex, the server cannot analyze all visited pages, or update mined results, in real time. Background demons continually fetch pages, index them, and analyze them w.r.t. topics and folders. The data accesses made by these demons have to be carefully coordinated. This would not be a problem with the RDBMS alone, but maintaining some form of coherence between the meta-data in the RDBMS and several text-related indices in Berkeley DB required us to implement a loosely-consistent versioning system on top of the RDBMS, with a single producer (crawler) and several consumers (indexer and statistical analyzers). Figure 1 shows a block diagram of the system.
3. Mining the Memex archive
In this section we describe the core algorithms that run on the databases maintained by the Memex front-end. We also report on our experiences with some of these algorithms. Most of our client features concern the analysis of relations between people, pages and folders (topics). (Although we provide a text-search capability over the history, we regard this as a standard feature.)
3.1 Experimental test-bed
For continuity, we shall inline our experimental results into the following subsections as we formulate problems and design solutions. For our experiments we obtained bookmark files from 23 Web surfers. They are Web-savvy but not computer scientists. After converting their Netscape and Explorer bookmark to a common format and throwing away default folders inserted by those browsers, we were left with 223 folders. All but two folders were at the first level; for simplicity we flattened those. These folders together pointed to 1693 URLs, of which 1424 were distinct.
Memex server side code has been implemented in Java and JDBC. It has been tested on a 450 MHz Pentium2 running RedHat Linux 5.2 with IBM Universal Database 5.2. Page visit archiving is real-time, but classification and taxonomy synthesis take several minutes. These are performed lazily by demons once or twice a day. In this paper we will be concerned more with the quality of results than running times.
3.2 Data models
As mentioned in our description of the Memex architecture (§2), the main entities represented in our analyses are Web documents, denoted d; hyperlinks, denoted (d1, d2); people, denoted p; and folders, also called topics or classes, denoted f. Each person has an associated universe of all Web documents s/he has ever seen, called the history H(p). These documents are connected by hyperlinks, some of which have been traversed by the user.
Each person also owns a tree-structured hierarchy of folders (which may be just the root node). A typical user will start by importing their folder structure from their browser. Because Netscape bookmark are stored in a flat file, a folder imported from Netscape will have an ordering on its children. Internet Explorer uses directories for folders, so no such ordering exists. The folder hierarchy is not fixed for all time, but our discussion below assumes a snapshot.
Folders reflect the owner's notion of topics and their refinement. Some of the documents in the history are ``bookmarked;'' these are denoted B(p). Bookmarks belonging to a particular folder are called B(p, f). This means a hyperlink to such a document is placed in some folder by a person. A document can be bookmarked by many people, but a person can only place a document in one folder. (In ongoing work we are relaxing this restriction.)
3.3 Learning and discovering topics
In supervised learning, the goal is to use the association between B(p) and the folders to learn to assign documents in H(p) \B(p) to the user's predefined folders. In unsupervised topic discovery, Memex inputs a set of documents from H(p) and proposes a tree structured topic hierarchy that clusters the documents based on their contents.
3.3.1 Supervised learning
Statistical model-based learning [13,24] has been one of the most effective methods for learning document topics. In its simplest form, our text classifier regards a document d as a bag or multiset of terms: the term t occurs n(d,t) times and the document has a total length of n(d) = t n(d,t). We do not consider multi-term phrases as features (yet).
Each folder f has an associated parameter q(f,t) for each term t over a suitably large universe T of terms. Roughly, q(f,t) is the rate at which term t occurs in documents belonging to folder f, and can be estimated from B(p, f). One can regard q(f,t) as the probabilities on the face of a die with T-faces, where tq(f,t) = 1. A document d that is known to belong to folder f (in statistical terms, be generated from folder f) is written as follows: first an arbitrary length n(d) is decided, then the above die is tossed so many times, and the terms corresponding to the faces that come up written down. Thus the probability of generation of the document is
Using Bayes rule, we can conversely find the probability Pr(f|d) that a document was generated by the distribution associated with a given folder.
It turns out that modeling the text alone does not give sufficient classification accuracy, because people tend to bookmark pages with little textual and much graphical content, as well as many links. In §3.3.3 we will discuss how to improve the accuracy of folder assignment using co-placement of URLs in folders. The Memex engine continually scans the NODE table in search of new classifications to do, and updates the TOPIC table.
3.3.2 Unsupervised learning
Topics will change with time, and users will reorganize their folder structure. The most common requirement for reorganization is refinement of a topic: the user's initial notion of a topic may be broad and shallow, but with time, the user collects a large number of links under that topic, which now needs to be refined into sub-topics. This is a classic case of unsupervised learning or clustering [16].
An extension of the vector space model [26], similar to the bag-of-words model is used for clustering documents. In the basic vector space model, each document d is represented as a point in multi-dimensional Euclidean space; each dimension is a term t, and the coordinate in that dimension is n(d,t)3. Documents are normalized to have L2 norm equal to one.
The similarity s(d1, d2) between unit-length documents d1 and d2 is the cosine of the angle between their vectors, i.e. the inner product d1, d2 . Since the role of clustering is to find large similar sets of documents, we use the definition of self-similarity of a set G from the Scatter-Gather system [11]:
We use a hierarchical agglomerative approach [16,11,21], in which we initially have each document to be clustered in its own group G, and at each step, that pair (G,D) is merged which leads to the maximum s(GD). This step is repeated until only one group is left with all documents in it.
3.3.3 Exploiting hints from folder membership
Suppose a page d has to be classified for a person p1, where d has already been bookmarked in some folder c2 by another user p2. Suppose many other members of c2 have been bookmarked by p1 as being in folder c1; then there is reason to guess that d may belong to c1 too. More generally, regarding p2's folders as a reference taxonomy (such as Yahoo!) we can take all of p1's bookmarked pages, and run them through p2's classifier. We also run d through p2's classifier, obtaining its class cp2(d). We consider all documents D from p1 which are in this same class, and guess the most frequently occurring class label (from p1's folder system) as the class for d.
Figure 7: Verification that folders tend to be reasonably coherent as judged by a reference taxonomy. Pairs of URLs were selected from our Netscape bookmark collection, the page fetched, its frequent terms formed into a query, and this query classified using Yahoo, to see if both belong to the same Yahoo class. The fraction of times this happens is plotted against the distance (in number of intervening out-links) between the two URLs.
This experiment was performed with the first level of Yahoo!. The results shown in Figure 7, while intuitive, are quite instructive: almost half the time, user folders are pairwise consistent at the first level of Yahoo!. There is also a mild locality effect: if the folder is represented in HTML (as in Netscape) and two URLs are a short distance apart, this makes it more likely that their Yahoo-topics are the same.
This suggests the following algorithms:
Build text-based classifiers for all users p.
We are given a document d to classify under p1. Find d in other users' folders to find a set of folders C2. (If d is not found in anyone else's folders then fail.) Next we have two variants, folder and locality.
(Folder) Classify all documents under each folder in C2 as per p1's folder system. Consider the majority class as the class for d.
(Locality) Suppose d is found in a folder c2. Call this offset zero. Scan left and right until d-i and d+j are found in c2, such that d-i and d+j are classified under p1. If these classes are the same, output this class, otherwise, fail.
We measured recall (coverage) and precision (for what fraction of documents was the proposed class approved by the user). The results are shown in Figure 8. Because the algorithm might flag a failure, recall is not perfect, but, in the cases where it can generate a folder assignment, the answer is significantly more accurate than using the text accumulated by user p1 alone. Basically, an extended vocabulary contributed by the whole community makes far more accurate classification. We also verified that our collection of bookmarks were reasonably spread out across Yahoo's taxonomy, hitting eight of the fourteen classes of Yahoo shown in Figure 7.
Figure 8: Results of exploiting folder co-location and link locality for classifying history.
3.4 The community taxonomy synthesis problem
The results above clearly show that relations between pages (such as being placed in same or different folders) are quite important as features for learning. HyPursuit [28] recognized this, but only offered hand-tuned weights for different feature types. Similar issues also arise in combining text, HTML tags, and hyperlinks into one model. Basically, we want to exploit the fact that co-location of documents in a folder hint at a semantic similarity which should be factored in together with our text-based similarity in equation (2).
Figure 9: A formulation for the community taxonomy synthesis problem. Initially, each document is a group or theme by itself. Finally, we want a highly compressed representation of the tripartite mappings while distorting the term distributions for original folders (induced by the red subgraphs) as little as possible.
3.4.1 Problem formulation
The input to the problem is the following initial graph N with three layers of nodes, D for documents, G for groups, and F for folders. Initially there are as many groups as documents, and each document is in its own group. There is a many-to-many mapping between folders and groups. A folder maps to at least one group and vice versa. The F-to-G and G-to-D mappings induce each folder f to include a set of documents Df; these sets can be overlapping. Df induces a term distribution Tf for folder f. We have various choices for characterizing Tf, some will be discussed later.
The goal of taxonomy synthesis is to derive a new three layer graph N. In N, D = D and F = F, but G and the connecting edges have been modified. Groups no longer contain a single document in general. The F-to-G mapping is many-to-many as before. Associated with such three layer graphs is a cost model. N has some initial cost. N has some (hopefully) lower cost. Our goal is to derive N with as small a cost as possible. (See figure 9.)
Now we design the cost model. The cost of a graph is the sum of the distortion and mapping costs. Distortion is a measure of how much the new term distribution Tf of a folder differs from the `true' distribution Tf (i.e., what is the penalty for changing the red subgraph). Distortion is denoted D(Tf||Tf), also called the Kullbach-Leibler distance. For the initial graph, distortion is zero by definition. The mapping cost is a measure of the complexity of specifying G or G and the edges in the graph.
Why do we seek to minimize the total cost? This leads to the `simplest' description of the data, which is the best model, according to the Minimum Description Length principle. For many formulations of the distance measure, the problem is at least as hard as set-cover. Hence we resort to fast heuristics.
3.4.2 Heuristics and experience
The first problem is with the KL-distance. Over the set of terms T, let IT range through the set of all possible document events; i.e., all possible vectors of term counts. The KL distance of a distribution T with reference to another distribution T is
The KL distance is not symmetric; however it is non-negative and zero only for T = T. The sum over all IT is impractical to compute; even with the binary model, there will be 2|T| terms in the sum. Therefore we take recourse to inter-term independence as in the bag-of-words model, except we use a binary document model, where word counts are ignored for simplicity.
where ft = PrT(t) and ft = PrT(t).
Mapping costs for the edges can be approximately estimated by encoding the vertex ID's using a Shannon-optimal code. Details are omitted for lack of space.
With this two-part cost model in mind, we will compare three heuristics: LeafUnion, SingleBest and Bicriteria, as specified next.
LeafUnion: This is the trivial mapping corresponding to each folder simply maintaining a `link' to the original documents. The distortion cost is zero by definition, but the mapping cost is large. The mapping is not exploiting document similarities at all.
SingleBest: Once the hierarchical agglomerative cluster tree (dendogram) is built, each folder is assigned to exactly one node in the dendogram. Here we are trying to cut down on mapping cost, hoping that the clustering step will bring related documents under the same subtree so that few links will suffice. This may entail significant distortion.
Bicriteria: This heuristic recognizes the tension between mapping and distortion cost. It starts similar to hierarchical agglomerative clustering (HAC) with a frontier of groups, each with one document. In the end, it has a smaller frontier, with the original folders mapping to the surviving groups. Unlike in SingleBest, a folder can map to many groups.
The algorithm is a greedy cost-based sequence of merges. When two groups G and D on the frontier are evaluated for merging, we do not use s(GD) as the goodness measure. Assuming all folder pointing to either G or D will point to their union, we estimate:
The decrease in mapping cost because of edges saved by the merger, and
The increase in distortion because of extraneous documents in G and D,
and perform that merge with minimum increase in overall cost.
Sample results are shown in Figure 10. As expected, LeafUnion pays too much in mapping cost and SingleBest pays too much in distortion cost. Although evaluation of discovered themes is necessarily subjective at this point, inspection of Bicriteria results showed that themes were being factored out of partially overlapping topics corresponding to folders of different users.
Figure 10: Results for taxonomy synthesis, showing that both collocation in folders and term distribution are important features.
4. Conclusion
We have reported on the design and implementation of Memex, a companion on the Web for individuals and communities. We have demonstrated that Memex is effective in archiving and analyzing surfing patterns to bring out useful organization of surfing history. Specifically, Memex helps organize history into coherent topics, and relate topics between different users. It also enables search over the entire surfing history.
4.1 Status report
Memex is currently being tested by local volunteers after which we will make the service available for beta-testing. The client-side code runs on Netscape and Internet Explorer. A port is planned for HotJava and the JDK1.2 plugin. Initial user feedback is that the client is intuitive and easy to use. However, the server is non-trivial to set up; knowledge of Apache, JServ, and some relational database like Oracle is needed. We wish to make server installation much simpler using scripts.
4.2 Recommendations for browser vendors
We hope that our experiences with grafting Memex into the two most popular browsers will encourage the vendors of these browsers to evolve a more friendly and uniform browser interaction API which they or we can use for more advanced browser assistants. Specifically, we recommend that trusted applets get a handle to a Browser object which can then be used to interact closely with the browser:
import com.netscape.browser.*; // or import com.ms.browser.*; Browser b = Browser.getBrowser(); Vector wl = b.getBrowserWindows(); BrowserWindow bw = (BrowserWindow) wl.elementAt(0); bw.addPageLoadListener(new PageLoadListener() { public void actionPerformed(LoadEvent le) { URL location = le.getURL(), referer = le.getReferer(); String title = le.getTitle(); Vector outLinkList = le.getOutlinks(); // use these ... } });
It goes without saying that the non-standard security and browser interaction interfaces cause much grief and prevent any serious browser-based Java developer from writing simple, clean code. The Java2 plugin will remove the security-related problems, but not the browser interaction issues.
4.3 Interaction with other systems and meta-data
Planned extensions to Memex involve integration with a caching proxy using ICP (Internet Caching Protocol). Currently, proxies associate URLs with content, and run variants of weighted LRU strategies. We believe that Memex, by analyzing content, can more intelligently advice the proxy about prefetching and eviction policies, thus tuning to the community that it serves. Memex can also help proxy servers detect mirror sites, reducing pressure on the cache. This will in turn help Memex to get its bulk of document fetches from the proxy.
The Resource Description Framework (RDF), based on XML, provides a uniform syntax for defining and exchanging meta-data about webpages in a format that can be manipulated by programs. Various communities are defining and agreeing on resource descriptions suited to their applications. In the context of Memex, a description language for topic taxonomies and associated resources, such as developed by the Open Directory, would be very useful. We intend to adapt that format to the description of individual and community interest profiles as well, through designing suitable description formats for folders and synthesized taxonomies.
Our premise is that Memex servers will find utility at the workgroup or organization level. In the next phase, we plan to develop and design protocols for interaction between distributed Memex servers for consolidating documents, topics, and communities across diverse geographical regions. Such cooperative analysis will help generate strategies for bandwidth and cache management for long-haul ISPs as well.
Thanks to S. Sudarshan for helpful discussions, to Hannes Marais for tips on using DDE, and to the reviewers for helping improve the presentation of the paper. Thanks to the School of Information Technology, IIT Bombay, for providing supplementary network resources during the work. Memex builds upon many pieces of public domain software: HTTPClient, Cryptix, JFlex, and Berkeley DB.
- [1]
C. Apte, F. Damerau, and S. M. Weiss.
Automated learning of decision rules for text categorization.
ACM Transactions on Information Systems, 1994.
IBM Research Report RC18879.
- [2]
C. Apte, F. Damerau, and S. M. Weiss.
Towards language independent automated learning of text
categorization models.
In SIGIR, 1994.
IBM Research Report RC19481.
- [3]
R. Barrett and P. P. Maglio.
Intermediaries: New places for producing and manipulating web
In 7th International World Wide Web Conference, Brisbane,
Australia, 1998.
Online versions:
- [4]
I. Ben-Shaul, M. Herscovici, M. Jacovi, Y. S. Maarek, D. Pelleg, M. Shtalheim,
V. Soroka, and S. Ur.
Adding support for dynamic and focused search with Fetuccino.
In 8th World Wide Web Conference. Toronto, May 1999.
- [5]
V. Bush.
As we may think.
The Atlantic Monthly, July 1945.
Online at http://www.theatlantic.com/unbound/flashbks/computer/bushf.htm.
- [6]
S. Chakrabarti, B. Dom, R. Agrawal, and P. Raghavan.
Scalable feature selection, classification and signature generation
for organizing large text databases into hierarchical topic taxonomies.
VLDB Journal, Aug. 1998.
Invited paper, online at
- [7]
S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and
S. Rajagopalan.
Automatic resource compilation by analyzing hyperlink structure and
associated text.
In 7th World-wide web conference (WWW7), 1998.
Online at
- [8]
S. Chakrabarti, D. A. Gibson, and K. S. McCurley.
Surfing the Web backwards.
In WWW, volume 8, Toronto, Canada, May 1999.
Online at http://www8.org.
- [9]
S. Chakrabarti, M. van den Berg, and B. Dom.
Focused crawling: a new approach to topic-specific web resource
Computer Networks, 31:1623-1640, 1999.
First appeared in the 8th International World
Wide Web Conference, Toronto, May 1999. Available online at
- [10]
W. W. Cohen.
Integration of heterogeneous databases without common domains using
queries based on textual similarity.
In SIGMOD, Seattle, Washington, 1998. ACM.
- [11]
D. R. Cutting, D. R. Karger, and J. O. Pedersen.
Constant interaction-time scatter/gather browsing of very large
document collections.
In Annual International Conference on Research and Development
in Information Retrieval, 1993.
- [12]
J. Dean and M. R. Henzinger.
Finding related pages in the world wide web.
In 8th World Wide Web Conference, Toronto, May 1999.
- [13]
R. Duda and P. Hart.
Pattern Classification and Scene Analysis.
Wiley, New York, 1973.
- [14]
S. Dumais, J. Platt, D. Heckerman, and M. Sahami.
Inductive learning algorithms and representations for text
In 7th Conference on Information and Knowledge Management,
Online at http://www.research.microsoft.com/~jplatt/cikm98.pdf.
- [15]
M. Hersovici, M. Jacovi, Y. S. Maarek, D. Pelleg, M. Shtalheim, and S. Ur.
The Shark-Search algorithm-an application: Tailored web site
In 7th World-Wide Web Conference, Brisbane, Australia, Apr.
Online at
- [16]
A. K. Jain and R. C. Dubes.
Algorithms for Clustering Data.
Prentice Hall, 1988.
- [17]
T. Kamada and S. Kawai.
An algorithm for drawing general undirected graphs.
Information Processing Letters, 31:7-15, 1989.
- [18]
J. Kleinberg.
Authoritative sources in a hyperlinked environment.
In ACM-SIAM Symposium on Discrete Algorithms, 1998.
Online at http://www.cs.cornell.edu/home/kleinber/auth.ps.
- [19]
D. Koller and M. Sahami.
Hierarchically classifying documents using very few words.
In International Conference on Machine Learning, volume 14.
Morgan-Kaufmann, July 1997.
Online at
- [20]
W.-S. Li, Q. Vu, D. Agrawal, Y. Hara, and H. Takano.
PowerBookmarks: A system for personalizable Web information
organization, sharing and management.
Computer Networks, 31, May 1999.
First appeared in the 8th International World
Wide Web Conference, Toronto, May 1999. Available online at
- [21]
Y. S. Maarek and I. Z. Ben Shaul.
Automatically organizing bookmarks per content.
In Fifth International World-Wide Web Conference, Paris, May
- [22]
P. P. Maglio and T. Matlock.
Metaphors we surf the Web by.
In Workshop on Personalized and Social Navigation in Information
Space, Stockholm, Sweden, 1998.
- [23]
H. Marais and K. Bharat.
Supporting cooperative and personal surfing with a desktop assistant.
In Proceedings of UIST'97, pages 129-138. ACM, Oct. 1997.
Online at
- [24]
T. Mitchell.
Machine Learning.
McGraw Hill, 1997.
- [25]
R. R. Peter Pirolli, James Pitkow.
Silk from a sow's ear: Extracting usable structures from the web.
In ACM CHI, 1996.
- [26]
G. Salton and M. J. McGill.
Introduction to Modern Information Retrieval.
McGraw-Hill, 1983.
- [27]
F.-S. Shieh and C. McCreary.
Directed graphs by clan-based decomposition.
In Graph Drawing, pages 472-482, 1995.
- [28]
R. Weiss, B. Velez, M. A. Sheldon, C. Nemprempre, P. Szilagyi, A. Duda, and
D. K. Gifford.
HyPursuit: A hierarchical network search engine that exploits
content-link hypertext clustering.
In Proceedings of the Seventh ACM Conference on Hypertext,
Washington, DC, Mar. 1996.
- [29]
O. Zamir and O. Etzioni.
Grouper: A dynamic clustering interface to Web search results.
In 8th International World-wide Web Conference, pages 283-296,
Toronto, Canada, May 1999. Elsevier Science.
- Soumen Chakrabarti
- received his B.Tech in Computer Science from the
Indian Institute of Technology, Kharagpur, in 1991 and his M.S. and
Ph.D. in Computer Science from the University of California, Berkeley
in 1992 and 1996. At Berkeley he worked on compilers and runtime systems
for running scalable parallel scientific software on
message passing multiprocessors. He was a Research Staff Member at
IBM Almaden Research Center between 1996 and 1999. At IBM he
worked on hypertext analysis and information retrieval. He designed the
Focused Crawler
and part of the
search engine. He is currently
an Assistant Professor in the Department of Computer Science and
Engineering at the Indian Institute of Technology, Bombay. His
research interests include hypertext information retrieval, web
analysis and data mining.
- Sandeep Srivastava, Mallela Subramanyam, and Mitul Tiwari
- are junior-year students in the Computer Science and Engineering Department at IIT Bombay. Their research interests include hypertext databases and data mining.
1 It has been pointed out that users may create folders which are not dependent on the contents of pages, but other features. If these features cannot be exposed to our learning programs, they are helpless. But content-based classification is by far the most common case we have seen.
2 We cannot use drag-and-drop in many places because the full set of Java Foundation Classes functionality is not available from most browsers' JVM.
3 Various scale factors such as term frequency times inverse document frequency (TFIDF) are often used, but we omit these details for clarity.
File translated from TEX by TTH, version 2.01.
On 3 Mar 2000, 03:05.


text:
Not everybody knows that New York's Icon, The Statue of Liberty, was actually a gift from France for the US. It represents the Roman Goddess of Freedom, Libertas. Before the 'fat lady' found it's final destination, it was assembled in Paris first, where together with an Eiffel Tower under construction, it dominated the Parisian skyline.
source: 456fis, fyeah-history, dailymail, mcenrycountyturningpoint


text:
Posted in blue, brown, outfits, pants, red
Rainy Day Rule-Breaking
Monday, April 23, 2012 11:26 PM
You guys. We just had the most ridiculous rainstorm. It lasted at least 30 hours, and it rained hard — harder than I thought it could do here in Maine. And I'm used to those Florida summer thunderstorms, the ones that come at 3 p.m. every day and sometimes feel like they'll flay your skin off. But those never last more than an hour, and usually more like 10-20 minutes.
So anyway, I knew I wanted to wear pants today. And to keep the hems out of puddles, I violated the principle of Perfect Pant Length by pairing these pants — which should be worn only with flats — with a pair of kitten-heeled loafers. I also pulled my hair back, since it would have frizzed up anyway, and compensated for the somewhat masculine feel of the ensemble with some extra makeup (eyeshadow!).
Blue shirt, New York & Co. (thrifted)
Red necklace, thrifted
Brown pants, Target
Teal belt, Target
Red loafers, Rampage (eBay)
About Me
- Thoroughly ME
- Twenty-something living in Portland, ME. Thrifter, list-maker, amateur cook and wannabe foodie, watcher of too much TV. I write for a living; I play dress-up for fun.
(nearly) all secondhand 10 ways black black and white blazer blue brown burgundy casual color blocking colored bottoms colored tights denim dress fall floral gray green houndstooth inspired by lace layers neutrals pattern pattern mix pink plaid polka dots purple red scarf spring stripes summer tan white winter yellow
- ► 2013 (242)
- Omnivore
- Purple, I Swear
- Put a Belt on It
- Unseasonable
- A Sure Thing
- Rainy Day Rule-Breaking
- Deep Frying
- Amber, Warmth
- Daytime Sparkle
- A Sweater Vest and a Shirtdress
- Iced
- Marathon Monday
- Same Difference
- Time to Eat the Chametz
- Blue, Black and Taupe
- I'm Up, I'm Up
- EBEW: Pastels
- Mirrored
- 10 Ways to Wear a Gray Pencil Skirt
- Restraint
- For Want of a Pomegranate
- Two Colorless Outfits
- Wait Wait
- ▼ April (23)


text:
Gingerbread Houses
Celebrate the holiday with a festive gingerbread house! Nothing makes a more impressive centerpiece and kids have an amazing time decorating with candy.
Studio4Art Clay Gingerbread House Making, November 12, 1-3pm, ages 7+, Mill Valley
Gingerbread House Tour in Sausalito
Tiburon Holiday Festival, December 3, visit with Santa, roasted chestnuts, gingerbread house decorating and tree lighting.
Gingerbread House Decorating Classes, December 3, 10, 17, The class includes a large preassembled, freshly baked gingerbread house, royal icing, assorted candies, sugar lay-ons decorations, and instruction. This class is a popular adult, child or parent/child class, Cake Art Supplies, San Rafael.
Gingerbread House Workshop, December 10, 10:30am-12pm, Ages 8-12, Gingerbread house masters John and Megan Lorenzen will be here to help you create a gingerbread dog house or a gingerbread kitty condo, Marin Humane Society.
Gingerbread Dog House, December 10-11, Assemble and decorate Snoopy's doghouse out of gingerbread complete with a marshmallow Snoopy on top, Advance reservations required--register online or call (707) 284-1272, Schultz Museum, Santa Rosa.
Gingerbread House Decorating Party, December 12 & 13, Bring the kids and come down to Terrapin Crossroads, for our Gingerbread House On Sale Party, on Monday at 4pm. The Backyard will be buzzing with a special one hour music set the kids will love! Grab some BBQ, purchase your Gingerbread House tickets, and enjoying some tunes by the water, Terrapin Crossroads, San Rafael.
Edible Engineering: Make a "Gingerbread" House, December 16, 3:30-4:30pm, ages 3+, Get creative this holiday season by designing, building, and decorating gingerbread-style houses out of graham crackers, frosting, and candy, San Anselmo Library.


text:
Inside - at the left side I made a pocket , decorated the edge with Venetian Accents and used a Marianne Creatables die as a tag so that my friend can write her own message inside for her first grand daughter. At the right side I used LOTV Angels With Crib stamp, coloured with promarkers and added lots of glitter - which doesn't show in the picture. I again used Venetian Accents to make a frame . The book is fastened with pink organza ribbon. It was so dark all day that not only did I need to use flash, I also needed the overhead lights on. I ended up taking the photographs in the kitchen because it was the least shadowy there.
I have yet to make the box, but I'll save that for another day in case you've all fallen asleep! Sorry this has been such a long post!!!
Well I hope today is better than yesterday. It poured with rain all night and all day and the road was quite badly flooded yesterday when John drove to the next village to see his GP.
Have a good day everyone! Love and hugs from Christine xx