text:
*image shown is 5 x 8 or larger rug
*smaller sizes will not show complete pattern, will be scaled down to fit.
Additional 20% discount will be applied in cart once discount code is entered. Please note discount code does not apply to Dalyn, Loloi, Capel, Milliken, select Nourison rugs, clearance rugs and rug pads.
Name: Braided BRD313A
Manufacturer: Safavieh Rugs
Collection: Braided
Material: Polypropylene
Construction: Hand Made
Thickness: approx. 0.25 in
Colors: Tans/Browns/Rusts , Ivory/Beige
Made in: India
Description: Safavieh updates the enduring beauty and charm of the braided rug, a beloved American classic. Fashion right colors and modern fibers make our braided rug collection perfect for casual 21st century homes and lifestyles, and their easy care properties make Safavieh's reversible braided rugs a practical choice for families. (Braided BRD313A - Hand Made Polypropylene Rugs from Safavieh)
Please note: Image shown is for 5 x 8 or larger rug. Smaller sizes will not show complete pattern, and will be scaled down to fit.
Ships within 3 to 6 business days*
* Estimated business days to ship within continental US. Expect longer delivery times for remote locations and oversized rugs (longer than 9'). Custom & braided rugs take longer (up to 4-5 weeks).
Other Related Patterns You Will
Related products are usually selected because they employ the same materials and colours of the product featured above but in different patterns and therefore are often perfect for use in the same or adjacent rooms.


text:
Spreading its infectious rib-tickling satire from its base in London across the world, the award winning Pets Rock phenomenon combines a passion for furry friends and the ever intriguing celebrity culture. Adopt yourself with a pop culture pet with these Pets Rock® iPhone 6s and iPhone 6s plus cases!
Self-Collection Within Singapore (FREE for all orders!):
Local Shipping (Singapore Only)
International Shipping
Click here for more information

subset: commoncrawl


text:
After five years, it's hard to imagine a world without World of Warcraft. Released Nov. 23, 2004, the massively multiplayer online role-playing game has set the standard for the genre.
More than 11.5 million players from around the world, from all walks of life, spend hours a day in the world of Azeroth. They embark on epic adventures, battle other players or just hang out. And each of them pays developer Blizzard Entertainment $15 per month for the privilege.
Players create characters and develop them over time, forging relationships with other gamers and going on quests to gain experience or loot. Whether they play with strangers, friends or alone, Warcraft's polished virtual world proves easy to get into and hard to get out of.
Though the game's success has spawned dozens of imitators, not one has posed a serious threat to Blizzard's dominance. But perhaps the best praise for WoW is that other game designers love to play it. Among its devotees are Tetris creator Alexey Pajitnov and BioShock creative director Ken Levine.
"It's the game I've played more than any other," Levine told Wired.com. "It's an aesthetic masterpiece…. So much of the world tells a story when you look at it."
Most videogames wear out their welcome after a few months. But Blizzard's stewardship of its persistent world — filled with orcs and trolls, humans and dwarves — has been so successful that the game shows no signs of slowing, even a half-decade on.
Amazingly, World of Warcraft almost didn't happen. The world's most popular MMORPG has its roots in real-time strategy games Warcraft: Orcs & Humans and Warcraft II: Tides of Darkness. In 1998, while half of a Blizzard development team was assigned to work on Warcraft III, the other half ended up working on a game that was canceled.
With nothing to do, the team members looked at the games they were playing the most at the time — massively multiplayer online games like Sony's EverQuest and Electronic Arts' Ultima Online. At the time, both games topped out at around 200,000 subscribers each, and Blizzard thought it could do better by making a virtual world that was more accessible to newbies.
"We felt there was such an opportunity in that genre, and that Warcraft was such a great universe for a game like that," said Blizzard's Rob Pardo, the first lead designer on WoW. "We started talking about it, getting excited about it, and we decided to make it."
Pardo aimed for the sky: 1 million subscribers, which would have made his game far and away the most popular MMO of all time.
WoW passed that milestone in a matter of months. "We were off by about an order of magnitude," he said.
Pardo, now an executive VP at Blizzard, said he never thought that Warcraft's world could go on for five years. "When you look historically at what other MMOs have done, by the time you hit the five-year mark, you've already hit your peak," he said. "With World of Warcraft, people are like, 'I've been playing this game for five years, and I still love it.'"
BioShock's Levine, who played WoW's beta version more than five years ago, says he still devotes several hours to the game every week.
"I just love being in that world," he said. "When you go into [the city] Stormwind, you go across the bridge and see all those giant statues of the heroes, that sells the space. It's over the top, it's huge and you know what you're getting into."
The fastidiously detailed underwater dystopia of BioShock was influenced by WoW's grandeur, Levine said: "Any project where you need to sell people on a space in a videogame, you can learn something from World of Warcraft."
WoW has been a double-edged sword for the MMO genre, said Pardo. On the one hand, its massive popularity across demographic lines has brought the MMO out of the basement and into the mainstream: "You start hearing moms at a grocery store talk about it," he said.
On the other hand, even though WoW is attracting competition, its huge popularity and loyal fan base isn't leaving many consumers for other games in the genre. First-person shooter fans will buy Halo, Modern Warfare and Borderlands for $60 a pop, but MMO players won't pony up $15 per month to delve into three different virtual worlds.
Of the three major fantasy MMOs released last year that stood the best chance of combating WoW — Age of Conan, Pirates of the Burning Sea and Warhammer Online — all have had to merge their gameplay servers because there weren't enough adventurers to go around.
And the list of MMOs that have shut down completely is long. Many of these shuttered games had big licenses or pedigrees behind them: Tabula Rasa, The Matrix Online, The Sims Online and Myst Online.
Where WoW goes from here depends on what its army of 11.5 million players want, Pardo says. Blizzard's goal is to continue to appease its players with new upgrades and remain a few steps ahead of the competition. It will release an expansion next year called Cataclysm, which Pardo says will revamp the entire game world.
Pardo is bullish on the game's future. "WoW is going to be a bigger world five years from now," he said.
Whether it's still around in 2014, making it through the first half-decade is an incredible achievement, says Levine. "You (rarely) have something that lasts that long, is that well loved and that frequently played — I mean, what other game does anyone have a five-year relationship with and constantly play?" he says. "Outside of Bejeweled."
See Also:
- Cataclysm Expansion Will Rock World of Warcraft, Blizzard Says
- Why Tetris Creator Secretly Plays World of Warcraft as Woman
- As World of Warcraft Reboots in China, Gamers Lose Their Loot
- You Play World of Warcraft? You're Hired!
- Warhammer Online's Endless Trial Period


text:
Watch this all new 2013 episodes of just for laughs TV in one video with an exciting Quality.
Watch this all new 2013 episodes of just for laughs TV in one video with an exciting Quality.
My coder is trying to persuade me to move to
.net from PHP. I have always disliked the idea because of the expenses.
But he's tryiong none the less. I've been using Movable-type on
numerous websites for about a year and am nervous about switching to another platform.
I have heard great things about blogengine.net. Is there a way
I can import all my wordpress content into it? Any help would be greatly appreciated!
Price is a little expensive, but well worth it I think.
Digital camera prices fell quickly so the only thing I don't like is the premium price I paid to get this camera earlier.
" Both the i – Phone 5s and Samsung Galaxy S5 also povide fingerprint lock and unlock capability.
I do not even understand how I stopped up right here,
but I assumed this publish was once great. I do not know who you're however definitely you're going
to a famous blogger in the event you aren't already.
hi!,I like your writing so much! share we communicate more about your post on AOL? I require an expert on this area to solve my problem. Maybe that's you! Looking forward to see you.


text:
This is our website. Would you prefer to shop on our website?
This is our website. You previously shopped on our website. Would you like to go to our website now?
Other country sites
My Account
My Bag
You are here:
Elevate your shirt collection with the Clive shirt from Jiggler Lord Berlue. Designed with long sleeves, a pointed collar and a central button up closure. The Clive boasts an all over floral finish, buttons and branded stitched detailing to the cuffs, making it the perfect contemporary update to a stylish man's wardrobe.
Product code: 558072
Exchanges & Returns We will happily offer an exchange or refund within 14 days of delivery. For full details please read our returns policy
Using the standard service, your order should be with you within 3-5 days.
International delivery is available for this product. The cost and delivery time depend on the country.
We use cookies to give you the best customer experience possible. If you continue to use our website, we will assume you are happy to receive cookies from us and our partners.
More info


text:
Technology in the English Classroom
There are many ways to use technology to enhance literature and English lessons.
By Amy Wilding
Times have changed, and the role of teachers in the classroom has too. No longer can teachers be effective without incorporating technology into their lessons. For some, the thought of using computers, WebQuests, or Promethean Boards is a daunting proposition. However, there are some easy ways to use technology.
If you are looking for a way to introduce your students to multimedia projects, try using Power Point. It is a very easy program to teach and learn. Students can practice copying and pasting pictures and text from the Internet, and experiment with colors and text effects. Once they have completed their project, students can present their finished work by showing their work slide-by-slide or having the PowerPoint presentation run like a movie. I have used Power Points to have students complete debates, book reports and multi-step projects. Before students begin work on these projects, I create a rubric that requires a specific number of slides, pictures, music etc . . . so that students know what I am expecting. I also evaluate how well the student used the available special effects.
There is a new program called "Lit Trips" that is great for practically any content area. The specific topic is created by fellow teachers. Each trip contains numerous activities, discussion questions, pictures and even music. My "trip" was with "The Kite Runner." Using Google Earth, the trip mapped out the entire book chapter-by-chapter. Within the trip, students were able to listen to music, take 3-D tours of historical buildings, and see up to date pictures of the cities. The "Lit Trip" is a fun and interactive way for students to learn about the text and go beyond classroom discussion. Depending on the age of your students, you may be able to let them explore the trip on their own. Otherwise, you could create a specific list of questions they have to answer, or places they have to visit.
Another easy way to prepare your students for using technology is to start a blog. Blogs are an interactive way for students to communicate their ideas. The blog can be used for regular classroom assignments. After students have read a piece of literature or completed an assignment, they can comment on the classroom blog. This was a particular success with students who were afraid to share ideas in class. Using the blog, these students could communicate in a more comfortable environment. Once a week we would review the comments and questions in class. An additional benefit to using the blog format is that the same one can be used for several classes so that students can share ideas with students who aren't in their class.
Here are some more ideas and lessons that effectively incorporate technology.
Technology Lessons:
This lesson introduces students to webquests through a Holocaust lesson. It is designed for twelfth grade students, but could be adapted for ninth through eleventh. The lesson even includes possible problems so that you can work out any challenges ahead of time. I think that this lesson would be a good way to prepare students to making more advanced web pages like "wiki-pages."
Student Centered WebQuests for Works of Literature
This lesson takes technology one step further. In this lesson students create their own WebQuest based on the text they are reading. The lesson is not very detailed, but provides additional links that can give more specific directions. The lesson could easily be adapted for any grade seventh through twelfth.
This lesson incorporates Power Point. Working in groups, students create a Power Point presentation based on "The Giver." The lesson includes step-by-step instructions and links. Given the topic, I think that this would be a great lesson that not only incorporates technology, but has students practice cooperative learning as well.
The Great Depression--An Oral History on the Internet
This lesson outlines how students can use the Internet to search for topics related to the Great Depression. If you are looking for a way to use computers, this is a great lesson. I would suggest bringing laptops into the classroom. That way you could address student needs immediately. Once the students are finished researching, they can use the laptops to create Power Point presentations or papers in the comfort of the classroom.


text:
On A Quest To Consolidate
Kansas Division of Printing
The Division of Printing for the State of Kansas is already a large operation—$7.3 million in sales, 83 full-time employees, three satellite locations—but Director Richard Gonzales would love to see it expand.
"We've consolidated [work from in-plants in] the Departments of Health, Revenue and Human Resources, and have assumed a large portion of the work from the Department of Transportation," says Gonzales. "We visited the print shops, researched their jobs and showed them in black and white what it was actually costing them."
Those hard figures helped convince the departments to pool their workloads. For example, the division's newest satellite copy center essentially replaced the internal copy center the Department of Health was operating, says Assistant Director Skip Anderson.
"Now, our copy center covers all of the other agencies located in that building as well, which was the point of that consolidation," he adds.
Despite the efforts of Gonzales and Anderson, in-plants remain active in other state agencies thanks to the twin forces of convenience and tradition.
"A lot of people can't face the fact that they're operating a shop that isn't truly justifiable," says Gonzales. "There's a duplication of equipment and administration. All these people are operating their plants only eight hours a day, while we run 24 hours a day, and our facility is large enough that we can take on work without adding more bodies. The more work we bring in, the better it is for the taxpayer."
Gonzales believes future consolidation is assured. "The State of Kansas…is looking for ways to save money," he says. "It would save the state to somehow combine all these plants." Consolidation would bring other benefits as well.
"There's no uniform cost accounting system in place across the state, so it's very difficult to do any meaningful kind of cost comparison from one in-plant to another," says Anderson.
- Places:
- Kansas


text:
converting a great room into upper and lower room
Hey all,
We have a "great room" that has 20 foot ceilings. The first floor has 10 foot ceilings. Basically, we're considering putting a floor/ceiling across the great room. So our current great room would just have 10 foot ceilings vs. 20 foot, and there would be a new room above.
The current room is about 15 feet wide by about 23 feet long.
This is existing construction in a 13 year old finished house.
Is this a crazy idea, or has it been done before?
As I look at the current space - it would be ideal if literally, I could snap my fingers and have that floor/ceiling in place. I say this because all the drywall, paint, window locaitons are perfect. Obviously I'd ideally want to keep what's already done looking good.
So I wonder if I could somehow take off a strip of drywall horizontally 10 feet up on all sides, and run joists across the room to the existing walls. I wonder if there is already a header in the existing walls about 10 feet up. Maybe I could use a ledger board or joist hangers then.
The only other possibility I see would be putting up completely new framing up/against the drywall on the first floor, 10 feet high, to create something for the new joists to sit on. But that would shrink the size of the lower room by about 4.5 inches on all sides and I'd have to re-drywall.
Any ideas here?
What about a mezzanine floor?
I would never attach framing member through drywall, I always use wood to wood connection. should the drywall be damaged then you do not have a tight connection.
I do not know how your Great Room exterior wall is framed. It should have been framed with tall wall studs going from the subfloor to the top of the wall. I have seen these framed with basically two walls stacked on top of each other. Myself, I would want to know how the wall was framed.
In typical Western or Platform framing (typical framing of today) floor joists sit on top of walls.
Attaching a ledger to the interior side of the wall, or along side the exterior wall stud is basically balloon framing. You would have to install fire blocking per the building code. click the link for code requirements.
if you have a basement then you probably have a center beam that the floor joists are supported on. since you are adding additional load onto the beam you should have the beam evaluated based upon the new loads and the span between supports. Again, I do not know what you have or the capacity of your beam. This link will provide you with prescriptive span requirements for center beams based upon the 2009 International Residential Code.
I see some redrywalling in your future.
I'm certain you will get more comments. Good luck! :thumbsup:
What you want to do is perfectly reasonable and doable, no worries.
I just got the approval from the local Building Department on a project very similar to what you are looking to do.
Needed engineering as we are in a seismic D category but that was no big deal.
Andy - what was the general process or how was it framed or built?
We have done a few of these as well. Having it properly engineered is very important. As someone said earlier, the existing beam and post will need to be evaluated to insure that they can handle the increased loads. The ledger idea is fine but fastening must be done wood to wood with proper fastener size and spacing.
The process is typical:
!. Construct an architectural set of plans that show all pertinent information like the Site plan, Floor plans (exist. & new) elevations if required, exist. framing details, electrical plans, plumbing plans etc.
2. Send plans and pictures showing the existing framing etc. to engineer for structural design.
3. co-ordinate all sets of plans with other needed info like Energy calcs. (Calif.) etc.
4. Submit to Planning and Building Departments. Pay plan check fee.
5. Wait for approval and or corrections.
6. resubmit with any revisions and/or corrections.
7. Wait.
8. Pick up approved set after paying for permits.
Build the bloody thing.
5 Attachment(s)
the others are right. theres nothing wrong at all with what you want to do. you can very easily attach a lvl ledger board to the studs as long as they are bolted and the joists your using are rated for the span required. .
youll have to add one or two circuits to the panel for the electrical to pass as your now creating new rooms
hopefully you dont have tallwalls that are built the way gbr mentioned. building them that way would never pass a proper inspection both by a regular inspector or a engineer. the reason being it creates a hinge point. ive built several of these walls both for high end custom homes and large additions, any wall taller than 14' has to be constructed from engineered lumber studs either lvl studs or timberstrand studs to meet proper deflection ratings under wind loads
the only real consideration i can think of is how does the new floor height effect the existing windows. almost all of the tallwalls ive built are basically a large wall of glass.. mostly windows. you dont want your floor system running through a window. all windows that are 6" or less off a finished floor must be tempered glass, so check your floor elevation in regards to the windows
|All times are GMT -5. The time now is 04:48 AM.
vBulletin Security provided by vBSecurity v2.2.2 (Pro) - vBulletin Mods & Addons Copyright © 2017 DragonByte Technologies Ltd.
User Alert System provided by Advanced User Tagging (Pro) - vBulletin Mods & Addons Copyright © 2017 DragonByte Technologies Ltd.


text:
Nearly 500 elementary and middle school students competed in the 2012 FIRST LEGO® League "Food Factor" Robotics Tournament, held today on the campus of Roger Williams University. Rep. James R. Langevin (D-R.I.) and RWU President Donald J. Farish provided opening remarks for the Rhode Island Challenge, now in its 11th year.
Each member of the winning team, the self-named Mindstorms Mayhem team from All Saints Academy in Middletown, R.I., walked away with not only top honors at the competition, but a four-year RWU scholarship of $5,000 per year – a total of $200,000 in scholarship dollars awarded. This marks the fourth year the University has offered winning scholarship prizes and its sixth year hosting the tournament. Roger Williams was the first organization to offer a college scholarship to a FIRST LEGO League winning team in the international competition's 13-year history.
During this morning's opening ceremony, Rep. Langevin encouraged participants to continue their involvement in science, technology, engineering and mathematics studies. "Science and technology change the world; they change lives. Especially now, STEM-related studies are the key to our success as a nation, and it is programs like FIRST LEGO that give our kids the skills needed to make that kind of impact. These young people are the innovators of tomorrow."
Fifty-four teams of students ages 9 to 14, from across Rhode Island and nearby Massachusetts, spent the morning presenting robots and research projects to judges and the afternoon on playing fields in points-based robot competitions. The team that excelled in the three judging categories – core values, robot and project – won the Champion's Award and the tournament. Innovator and entrepreneur Kipp Bradford provided the closing keynote address to encourage students to create innovative solutions to problems they see around them.
Each team focused on this year's "Food Factor" challenge, exploring how food gets to plates safely and ready to eat, and where along the supply chain food might be contaminated. The 54 teams also met throughout the season to design, build and program a LEGO MINDSTORMS® NXT robot. Along the way, they identified and conducted research on a chosen food safety issue and developed an innovative solution to prevent or address the problem.
"FIRST LEGO League introduces students to scientists and industry professionals and broadens the students' concept of what science is," said FIRST LEGO League Rhode Island Coordinator Mary Johnson. "The competition also encourages students to sharpen their math and science skills while discovering how innovation helps solve problems facing our communities. With Roger Williams University's continued support and presentation of scholarships, the program is a real investment in our state's future."
"The values represented by the FIRST LEGO student teams today match what we stand for here at Roger Williams University," said RWU President Donald J. Farish, Ph.D., J.D. "Not only does our institution support the notion that more study and work is necessary in the STEM areas, but we also value programs that allow elementary and middle school students to engage their inherent interest and curiosity with the environment they're living in. This is the University's sixth year hosting the tournament and we are very proud of that."
FIRST LEGO League is an international competition for elementary and middle school children featuring an annual real-world challenge that engages them in authentic scientific research and hands-on robotics design using LEGO MINDSTORMS® technologies and play materials. Roger Williams University has hosted the annual Rhode Island FLL Championship Tournament on its campus since 2006. The Rhode Island FIRST LEGO League program is supported locally by dozens of corporations and community organizations.
About RWU: Roger Williams University located in Bristol, R.I. is a leading independent, coeducational liberal arts university with education for the professions, where students learn to be global citizens. With 42 academic programs, an array of co-curricular activities and study abroad opportunities on six continents, RWU is committed to its mantra of learning to bridge the world. In the last decade, the University has achieved unprecedented successes including recognition as one of the best colleges in the nation by Forbes, College of Distinction by Student Horizons, Inc. and as both a best college in the Northeast and one of the nation's greenest universities by The Princeton Review.
About FIRST: Accomplished inventor Dean Kamen founded FIRST (For Inspiration and Recognition of Science and Technology) in 1989 to inspire an appreciation of science and technology in young people. Based in Manchester, N.H., FIRST designs accessible, innovative programs to build self-confidence, knowledge, and life skills while motivating young people to pursue opportunities in science, technology and engineering. With the support of many of the world's most well-known companies, the not-for-profit organization hosts the FIRST Robotics Competition and FIRST Tech Challenge for high-school students, FIRST LEGO® League for children 9-14 years old, and the Junior FIRST LEGO League for 6 to 9 year olds. To learn more about FIRST, go to www.usfirst.org. To learn more about the "Food Factor" Challenge, go to www.FIRSTLEGOLeague.org.


text:
Low-energy distal radius fractures in middle-aged and elderly men and women—the burden of osteoporosis and fracture risk
- First Online:
- Received:
- Accepted:
DOI: 10.1007/s00198-009-1068-x
- Cite this article as:
- Øyen, J., Gjesdal, C.G., Brudvik, C. et al. Osteoporos Int (2010) 21: 1257. doi:10.1007/s00198-009-1068-x
- Citations
- 403 Downloads
One third of 218 men and half of 1,576 women with low-energy distal radius fractures met the bone mineral density (BMD) criteria for osteoporosis treatment. A large proportion of patients with increased fracture risk did not have osteoporosis. Thus, all distal radius fracture patients ≥50 years should be referred to bone densitometry.
Main objectives were to determine the prevalence of patients with a low-energy distal radius fracture in need of osteoporosis treatment according to existing guidelines using T-score ≤ −2.0 or ≤−2.5 standard deviation (SD) and calculate their fracture risk.
A total of 218 men and 1,576 women ≥50 years were included. BMD was assessed by dual energy X-ray absorptiometry (DXA) at femoral neck, total hip, and lumbar spine (L2–L4). The WHO fracture risk assessment tool (FRAX®) was applied to calculate the 10-year fracture risk.
T-scores ≤−2.0 and ≤−2.5 SD at femoral neck was found in 37.7% and 19.6% of men and 51.1% and 31.2% of women, respectively. The risk of hip fracture was 6.2% for men and 9.0% for women. The corresponding figures for patients with T-score ≤−2.0 SD were 11.6% and 14.5% and for T-score ≤−2.5 SD 16.3% and 18.2%, respectively. A large proportion of distal radius fracture patients with a high 10-year FRAX® risk did not have osteoporosis.
Every second to every third fracture patient met the present BMD criteria for osteoporosis treatment. Because a large proportion of distal radius fracture patients did not have osteoporosis, treatment decisions should not be based on fracture risk assessment without bone densitometry. Thus, all distal radius fracture patients ≥50 years should be referred to bone densitometry, and if indicated, offered medical treatment.


text:
Most of the major religious traditions of the world have an appreciation for fasting. While they vary in specific practices, the religions share a recognition of fasting as a sacred discipline that teaches self-control and respect for the gift of sustenance.
Muslims are about to enter into Ramadan (June 17-July 17), the ninth month of the Islamic calendar, during which they fast daily from dawn to sunset. Ramadan commemorates the presentation of the Quran to the Prophet Muhammad and is considered one of the most important observances of Islam.
Fatuma is a single mother of nine children, two of whom are sponsored through Unbound. She and her family live in Kenya and are devout Muslims. Recently Fatuma shared with us what Ramadan means to them.


text:
|Publication number
|Publication type
|Application number
|Publication date
|May 1, 1979
|Filing date
|Feb 28, 1977
|Priority date
|Mar 3, 1976
|Publication number
|Richard M. Bird, Ju C. Tu
|Original Assignee
|Operating Systems, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (9), Referenced by (41), Classifications (10), Legal Events (2)
|External Links: USPTO, USPTO Assignment, Espacenet
This Application is a continuation in part of copending application, Ser. No. 663,524 filed Mar. 3, 1976, now abandoned, by the same inventors as this application and assigned to the same assignee.
This invention relates to electronic digital computer systems and more particularly to a novel and improved associative crosspoint processor system operable on an associative search system.
Retrieving information from mass storage systems can be accomplished either by addressing specific locations in the mass memory or by serially searching each location for a specific content. The latter is usually accomplished by software using conventional hardware which is a software approach to content-addressing, or associativity. The so-called search-by-content method can also be accomplished by a hardware implementation of the associative memory. With this method externally applied information or data, which shall be referred to herein as key words, is compared to certain of the stored data or information in the mass memory. When the key data and stored data match, that stored data and any data associated therewith can then be retrieved.
In the prior art, in a rapid access associative memory, simultaneous comparisons are made bit-by-bit of every word stored in the memory against the contents of an interrogation register. A match signal identifies those words which compare with those words in the interrogation register.
Generally, an information retrieval system of this type is used in conjunction with a general-purpose digital computer which consists of a single central processing unit referred to herein as a CPU. A mass memory such as a magnetic memory disk is used and is capable of storing a very large amount of information for use in the CPU. Such memory disks normally access each track sequentially. Thus, to eliminate the need for supplying addresses to each block of stored data, the associative searching technique is employed.
Heretofore, searching systems have been devised whereby a bit-by-bit comparison of each word is performed by sequentially accessing each track from the disk into a comparison unit where each word on each track is compared bit-by-bit with the search word in a key register associated therewith. Such a system is shown and described in U.S. Pat. No. 3,435,423.
A feature of the present invention is that it improves on these prior art systems by making byte-by-byte comparisons of the information from the mass storage system with the key words in the key memories.
A further feature of the present invention is that it can operate on a variable-length textword base in the associative crosspoint processor as compared to fixed length words in the prior art system.
Yet a further feature of the present invention is that each comparison unit is operable with more than one key word in the associative searching system whereas prior art searching systems are operable on only a single key word.
Still another feature of the present invention is that this sytem is operable in conjunction with computer software available for controlling the associative searching system.
To better describe the preferred embodiment of this invention, the following terms used herein are defined as follows:
A "character" or "byte" is herein defined to consist of eight bits and can therefore take on any value from 000 to 225. For other embodiments, "character" or "byte" need not be restricted to eight bits. "Diskword" or "computerword" is defined to be a 16-bit word, sent from the disk, or bulk memory through the BUS to a peripheral device. A diskword, or more generally, a computer word comprises two 8-bit characters, called bytes. For other embodiments, "diskword" or "computerword" need not be restricted to 16 bits.
"Text word" is defined herein as a string of characters or bytes including natural language words (e.g. the English word "lawyer", "1975", numbers, symbols and patterns) delimited on either end by special characters or code bits. These special characters or code bits are called "variable field delimiters".
"Word length" of a text word is herein defined to be the number of characters or bytes between the closest "variable field delimiters".
"Key word" as used herein, is defined to be a whole text word, or the starting 15 characters or bytes thereof, not containing any characters or bit codes called "variable field delimiters."
"BUS" is used herein to denote a plurality of conductors to transmit signals and data from one or many sources to one or many destinations. In another embodiment, the BUS could be replaced by a "channel" or a "daisy chain", terms well-known to those skilled in the arts.
"Variable field delimiter registers" are herein defined to be registers or memory cells to be used for a comparison of their contents with one or more characters or bytes originating from the input buffers. Certain results from this comparison, such as an exact match, determine the end of a previous text word, and the beginning of the next text word.
"Key memories" are herein defined to be a plurality of addressable memories consisting each of a plurality of memory cells, which will all contain key words.
"Pointer memory" is herein defined to be a plurality of addressable memory cells, which contain the starting key memory addresses of the key words.
"Hash memory" is herein defined to be a plurality of addressable memory cells, grouped into 4 consecutive cells, one group for each word length. Each cell contains the location information for one bit (the so-called hash bit), namely, the number of the byte in which it resides, and the number of the bit within said byte. Even though this specification refers only to four such hash bits, it is not confined to four and can be changed or their number can be a specific function of the word length, or some other criterion.
"Extended comparing logic" is herein defined to be one or a plurality of comparing circuits. One or several of these comparing circuits can be enabled by a mask loaded before each search. The enabled comparing circuits will compare the text word simultaneously, byte by byte, to the key words residing at the same address in all key memories.
"Word register" is herein defined to be a shift register containing 16 bytes or more of text words being read in from the input buffers.
"Word length memory" is herein defined to be an addressable, first-in, first-out memory containing a plurality of memory cells, each cell containing the computed word length of the text words shifted into a word register. The contents of the earliest memory cell is transferred into the "word length register" which will thus always contain the word length of the text word which is ready to be shifted out of the word register and be compared to the appropriate keywords in the keymemories.
"Input buffers" are herein defined to be a plurality of first-in, first-out memory buffers, each containing a plurality of memory cells, each cell containing a disk word.
"Output buffers" are herein defined to be a plurality of first-in, first-out memory cells. The output buffer receives one or more computer words of output from the various registers and it stores the oldest output into a register which then can, on command, transmit the contents thereof through the output interface to the central processing unit.
"Text word distance counter" is herein defined as a counter which resets to zero in response to the byte for beginning of the search and which increments by one for each textword shifted out of the word register.
"Load interface" is herein defined to have the following functions: When the central processing unit is processing a loading program, it uses a specific instruction to be able to communicate with the load interface. The load interface then interprets the data sent to it and distributes the data to the variable field delimiter register, to one of a plurality of key memories, to the pointer memory, to the hash memory, or to the extended comparing logic. The load interface is a standard device for a particular host computer. For instance, the load interface and the programming requirements for Digital Equipment Corporation, PDP 11, can be found in the Peripheral Handbook for said company describing programming with device registers.
"Search interface" is defined herein to have the following functions: Responding to a specific instruction issued by the central processing unit, the search interface will direct the data subsequently sent over the BUS to one of a plurality of input buffers. The search interface is a standard device for a particular host computer.
"Output interface" is defined herein to have the following functions: Responding to a specific instruction issued by the central processing unit, the output interface makes available to the central processing unit the contents of the output register. The output interface is a standard device for a particular host computer. "BUS isolater interface" is herein described to have the following function: Responding to a specific instruction issued by the central processing unit, it splits the BUS into two functional halves. The bus isolater interface is a specially implemented device which is herein described.
A secondary embodiment of this invention applies the identical techniques described herein to the task of pattern recognition. In order to adequately define this embodiment, as set forth in the claims for this invention, a set of equivalences of terminology can be described as follows:
A "character" or "byte" is equivalent to a "bit".
A "word", a "disk word", "text word", or "computerword" is equivalent to a "bit pattern".
"Variable field delimiter" is equivalent to a "bit pattern string."
Depending on the context, "bit pattern" and "bit pattern string" can be interchangeable. The nuances of this interchangeability are easily understood by those familiar with the art.
Briefly described, the present invention is an associative searching system which searches a data input stream of characters or bytes, herein referred to as "text words" or "fields" exhibiting certain relationships with characters referred to herein as "key words". The associative crosspoint processor system of the present invention is a peripheral device communicating with the CPU and contains four interfaces.
A first interface, referred to herein as a "loading interface", loads key words into key memories. As used herein, each key memory is an addressable memory and may contain 1024 (or more) bytes. There may be two to eight (or more) key memories containing all the key words. Each text word byte from the input system into the associative crosspoint processor of this invention is searched in parallel in all key memories, starting at a certain address contained in the pointer memory for as many bytes as the word length indicates.
A pointer memory is loaded from the loading interface with the beginning key word addresses of the key words. As used herein the pointer memory usually contains 256 locations (of ten bit pointer memory words) pointing to the key memories' starting byte of a key word.
Location information of discriminant bits are loaded into a hash memory. A discriminant bit as denoted herein is used in a block of data to define a group of key words of the same word length.
An isolater interface as used herein is shown in FIG. 2. This isolater interface, on command, divides the bus, which is used to couple all the components of this system, and thus isolates the mass storage system from the CPU and couples the mass storage system directly into the associative crosspoint processor system. This, then, cuts the bus traffic from the mass storage system to the CPU and isolates it with the associative crosspoint processor system. The bus isolator itself is a logic controllable bus switch which is a standard device for a particular host computer.
These and other features and advantages will become more apparent to those skilled in the art when taken into consideration of the following detailed description wherein like references indicate like or corresponding parts throughout the several views and wherein:
FIG. 1A is a functional block diagram of the associative crosspoint processor system coupled in communication with a central processing unit and a bulk storage system;
FIG. 1B is a block diagram of FIG. 1A for showing the functions of the associative crosspoint processor system.
FIG. 2 is a functional block diagram of the bus isolater interface shown in 1A;
FIGS. 3A, 3B, and 3C are functional block diagrams of systems identifying variable field delimiters as used in connection with the system set forth in FIG. 1A;
FIG. 4 is a functional block diagram of the input buffering scheme used in connection with the system set forth in FIG. 1A;
FIG. 5 is a functional block diagram of the word length memory used in connection with the system set forth in FIG. 1A;
FIG. 6 is a functional block diagram of the hash memory used in connection with the system shown in FIG. 1A;
FIG. 7 is a functional block diagram of an alternate embodiment of the key memories;
FIG. 8 is a functional block diagram of extended comparing logic useful in connection with the system shown in FIG. 1A;
FIG. 9 is a functional block diagram of the output buffering scheme used in connection with the system set forth in FIG. 1A.
Turning now to a more detailed description of one embodiment of this invention, there is shown in FIG. 1A a data processing system with which an, associative crosspoint Processor 9 (AXP) is interfaced as a peripheral device. The data processing system comprises a central processing unit 1 (CPU), a memory device 4, and a bulk memory device (such as a rotating disk) 7, all of which are connected by a cable system (hereinafter called BUS) 10, and the AXP system 9.
As shown in FIG. 1A, the AXP 9 as one of the peripheral devices, is connected to the BUS 10 by means of four interfaces: the load interface 13, the search interface 17, the output interface 20, and the isolater interface 23.
Preparatory to searching the bulk memory or disk 7 for every occurrence of the user-specified key words, the AXP is first loaded by means of commands from the central processing unit 1 hereinafter referred to as CPU 1 through the load interface 13 to variable field delimiter registers 26, to the key memories 29, to the pointer memory 32, to the hash memory 35, and to the extended comparing logic 38.
The variable field delimiter registers 26, also shown in more detail in FIGS. 3A, 3B and 3C, are loaded with the binary codes representing the various delimiters of the text words to be searched, such as spaces, punctuation codes, etc.
One example of an operating embodiment of an AXP is shown in FIG. 1B. Here, the variable field delimiter registers are loaded with the code for a space, which then begins and ends each text word.
The key memories 29 are loaded with the various user-specified key words.
Again referring to FIG. 1B, at addresses 455 through 457, for example, key memory n is loaded with the key word "BAT," while key memory n+1 is loaded with the key word "AIR," for example, and key memory n+2 is loaded with "SEA," for example.
Pointer memory 32 is loaded with the starting key memory addresses of the key words. As shown in FIG. 1B, pointer memory address 03.15 is loaded with the key memory address 455, while pointer memory address 03.05 is loaded with the key memory address 000. The hash memory 35 is loaded with the location of the hash bits for each group of key words of the same word length.
Location 14 of hash memory 35 will receive, for text words of word length 3, the location information for hash bit 1, namely 0.6 (byte 0, bit 6); locations 15 to 17 will be loaded with 0.5, 2.6, and 1.0 respectively. This information was found by the loading software by inspecting the bit positions of all key words of word length 3. The following table shows the octal ASCII code (American Standard Code for Information Interchange, well known to those skilled in the art) for the key words considered:
______________________________________byte 0 1 2______________________________________Key WordAIR 101 111 122BAT 102 101 124MPH 115 120 110SEA 123 105 101______________________________________
To split up these four key words into several groups (here just two), the loading program decided to designate as hash bit 1 the 6th bit of byte 0, as hash bit 2 the 5th bit of byte 0, as hash bit 3 the 6th bit of byte 2, and as hash bit 4 the 0th bit of byte 1. The state of hash bits 4 to 1 for the three key words AIR, BAT, and SEA will be 1101 (in binary), or 15 (in octal). For this reason, these key words are loaded at the same key word address (e.g. 455), pointed at by the contents of pointer memory 32 at address 03.15. The state of the four hash bits for key word MPH will be 0101 (binary), or 05 (in octal). Thus MPH is loaded at another address of key memory 29 (e.g. 000) which is contained in pointer memory address 03.05.
The extended comparing logic 38 (explained in more detail in connection with FIG. 8) is loaded with the mask for the desired relationships between the key words and fields to be searched on the disk.
Referring to the example shown in FIG. 1B, the extended comparing logic will be loaded with a mask denoting exact match.
Preparatory to searching the bulk memory or disk 7, the BUS isolator 41 has to be enabled to separate the BUS into two halves, so that the data and command traffic from disk 7 to the search interface 17 does not overcrowd the data and command traffic between CPU 1 and memory 4 and between output interface 20 and CPU 1 and/or other traffic from and to CPU 1.
Prior to enabling the BUS isolator 41, CPU 1 commands disk 7 to start reading at the beginning of the data to be searched, it commands the search interface 17 to accept the incoming data, and it then commands the isolator interface 23 to enable the BUS isolator 41.
The search interface 17 is coupled to all input buffers 44; logic circuits thereof direct the disk words to the first free input buffer, filling sequentially all empty buffers. The search interface 17 then attempts to fill the first buffer again, repeating the process until the search is stopped when all input buffers are full or when the AXP 9 recognizes an end-of-collection character. In the former case, the search is suspended until the next input buffer in sequence is freed. Meanwhile, the input buffers are emptied in the same order as they were filled, each disk word being sent to the variable field delimiter register 26. Here, each byte or several adjoining bytes are examined for being a variable field delimiter, such as a blank, a punctuation code, etc. Details of the variable field delimiters are explained in connection with FIG. 5.
When a variable field delimiter has been shifted out of the word register 36, the correct cell in the word length memory 39 will have stored the content thereof into the word length register 40, which now contains the word length of the text word about to be shifted out of the word register 36. The first character of this text word is compared simultaneously across all key memories 29, starting at a certain key memory address. This address is arrived at indirectly, by way of the pointer memory 32. The address into the pointer memory 32 is comprised in part from the word length of the text word to be compared, and in part from four bits (hash bits) located anywhere in that text word. The location information for the four hash bits is found in the hash memory by using as an address the word length contained in word length register 40 where four consecutive locations contain the information in which character and in which bit each hash bit is to be found. It is possible now to compare the text word shifted out of the word register 36, byte by byte, simultaneously across all key memories 29, starting at an initial address found in the pointer memory 32, and ending when the next variable field delimiter is detected.
Referring to FIG. 1B, the text words AIR FORCE 1, for example, are being shifted out of word register 36, the word length memory 39 containing their word length 03, 05, and 01, respectively. The word length register 40 also contains 03, thus referring to the part of hash memory 35 containing the hash bit location information for 3 byte long text words. The four hash bits for AIR are examined and the state thereof found to be 1101, or octal 15. Thus, address 03.15 is generated, 03 representing the word length and 15 representing the state of the hash bits. Thus, location 03.15 in pointer memory 32 is examined, and its contents 455 used as an address. The character A is now shifted out of the word register 36 and compared with all characters at location 455, namely B,A,S, etc., of key memory 29. The I and R are shifted out and compared with the contents of location 456 and 457, respectively, of key memory 29.
The extended comparing logic 38, as shown in FIG. 8, will determine from a mask loaded through the load interface 13, which one or ones of the various relationships (equal to key word, less than key word, greater than key word, between limits of keys) are to be used for the comparison.
If the comparison does not hold true, no output is generated. If it is true, the output will consist of two computer words which will be stored into the output buffer 46. The first computer word contains the pointer memory address, pointing to the location of the first character of the key word used, the number of the key memory in which the requested comparison occurred, and the comparison code. This identifies the key word compared. The second computer word contains the contents of the text word distance counter 49. This counter always contains the number of text words input from the disk 7. Text word distance counter 49 is set to zero, when a character code, denoting the beginning of a search, is input.
As shown in FIG. 1B, the key word AIR in the n+1st key memory 29 matches the text word AIR shifted out of the word register 36. The first output word stored into the next available output buffer memory cell will contain the location 03.15 of pointer memory 32, the key memory number n+1, and the code for exact match comparison. The second output word will contain the contents of the text word distance counter 49 at the moment of the match.
A code, denoting the end of a document, also generates an output consisting of two computer words, namely the contents of a computer word counter 52, split into two parts. The disk word counter is a count of the disk words from disk 7 sent to the AXP 9. It is reset to zero only at the beginning of a search command. In another embodiment, where the mass storage location of each successfully compared text word is unimportant, but where an identification of the document in which is was found is required, this document identification is transferred into the output buffers upon recognition of an end-of-document code.
The output register 55 always receives the earliest output stored into the output buffer 46. The output register 55 is emptied through the output interface 20 on command from the CPU 1.
Referring now to FIG. 2, there is shown an embodiment of the bus isolater interface circuit 23 which comprises a control register 301 which is coupled to receive a re-set signal from the control bus interrupt line 310 and has an output coupled directly into the address decoder 302. The control register may provide, for example, a Q into a receiver 303. The receiver 303 has an output coupled to a driver 304 through a delay line logic 305. The Q output from the control register 301 is also coupled into the driver 304. The purpose of the bus isolater interface 23 is to disconnect and reconnect the bulk memory controller 7 and the search interface 17 from and with the bus of the central processor unit 1.
For example, to disconnect a host computer, a bus disconnect command is sent through the bus isolater interface 23 which is characterized by a specific address through an address bus 306 and by a specific data bit through the data bus 307. Upon receiving the bus disconnect command, the output line Q of the control register 301 goes to a low state disabling the bus isolater 41 which performs the function of disconnecting the bulk memory control 7 and the search interface 17 from the central processing unit 1. At the same time, the low state of Q enables both the receiver 303 and the driver 304 for the purpose as set forth hereinafter.
The bulk memory controller 7, sends one computer word at a time through the search interface 17 but must receive an appropriate response, sometimes referred to as a "hand-shaking" response, before the computer word is actually transferred. When the receiver 303 and driver 304 are enabled in conjunction with the delay line, the "hand-shaking" function is performed. When the bulk memory controller 7 sends a bus request signal through the control bus request line 308, the bus request signal is gated through the receiver 303 into the delay 305. After a specified delay, this signal is then gated through the driver 304 into the controlled bus grant line 309. The resulting signal on the controlled bus grant line 309 then reaches the bulk memory controller 7 to signify to the controller that the transfer to the search interface is to occur, thus activating signals on the data bus, address bus and the control line bus. This procedure is then repeated for each computer word transferred into the search interface 17.
After the search operation transfer transferring data from the bulk memory 7 to the search interface 17 is completed, it then becomes necessary for the bus isolater 41 to reconnect the bus and to disable receiver 303 and driver 304. This is accomplished as set forth hereinafter.
When the search operation is finished, the interrupt signal is generated by the controller 7. This enables the bus isolater 41 and disables the receiver 303 and driver 304 through the control bus interrupt line 310 in the following manner; The interrupt signal from the controller 7 resets the control register 301 and the output signal Q returns to the high state. This enables the bus isolater 41 connecting the bulk memory controller 7 and the search interface 17 back to the central processing unit side of the bus while also disabling both the receiver 303 and the driver 304.
FIG. 3A shows one embodiment of a variable field delimiter scheme. Here, each incoming byte is held in a register 100, which is connected to eight AND gates 107. The contents of register 100 is also compared to one of the 256 cells of a 256�1 bit memory 104. The address of this cell is formed by the contents of the byte register 100. The output of memory 104 is gated to all eight AND gates 107, and through inverter 111, to AND gate 114. All cells of memory 104 will be filled with ones, except at the addresses corresponding to codes for delimiters (such as periods, colons, spaces, etc.). For example, if the byte held in register 100 is the code for a colon (octal 072), address 072 of memory 104 will have been loaded with a zero, therefore holding all outputs of AND gates 107 to zeros, except bit 5, thus converting this delimiter to the code for a space (octal 040), which can then be used as the only delimiter code necessary.
FIG. 3B shows a different embodiment of a variable field delimiter scheme. Again, the contents of byte register 100 are used as an address into memory 105, a 256�1 memory device. Memory 105 is filled with zeros, except at addresses corresponding to the codes for field delimiters. The output of memory 105 is thus a 1 for each field delimiter byte, otherwise a zero. For example, at address 040 through 043, corresponding to the codes for space, exclamation point, double quote, and number sign, a one is written into memory 105. Every time one of these field delimiter bytes is loaded into register 100, the delimiter output 108 is held in the logical 1 state.
FIG. 3C shows a different embodiment of a variable field delimiter scheme which comprises a low byte register 116 operable in connection with a low byte memory 120 and a high byte register 121 operable in connection with high byte memory 122, whereby any combination of specific adjacent bytes (a low byte and a high byte) are considered a field delimiter. To each combination of such 2-byte field delimiters is assigned a code from 1 to 14. This code is written into low memory 120 (at the outset initialized to all zeros) at the address formed by the value of this low byte, and also into high memory 122 (at the outset initialized to all ones) at the address formed by the value of this high byte. The outputs of both memories 120 and 122 are fed into a comparator 125. On an equal comparison, delimiter output 130 is held high, denoting that a field delimiter has been input.
If, for example, only the two combinations "period" followed by "space", and "period" followed by the code for "line-feed" are to be considered field delimiters, a code of, say 3 will be written into octal address 056 in low memory and into octal addresses 404 and 012 in high memory. (056 is the code for "line-feed".) Thus, an equal comparison at delimiter output 130 can only result from one of the two desired combinations.
This embodiment requires two memories, each with 256 addresses of 4 bits each. To enlarge the capacity to more than 14 different pairs of delimiter bytes, both memories and comparator sizes could be increased.
FIG. 4 depicts one embodiment of the input buffering scheme. The input buffers 44a through 44n are connected in parallel to the data-in lines 202 (DIN) to accept (write) data from the disk 7. Similarly, said input buffers are connected in parallel to the data-out lines 204 (DOUT) to read data into the variable field delimiter registers 26. Each input buffer has an associated address counter 205 directing the data to or from the address indicated by the contents of counter 205.
Since the purpose of this buffering scheme is to accept data from the disk 7 at the fixed rate dictated by the disk speed, while unloading it to the AXP 9 asynchronously, it is not permitted to read and write from the same input buffer. Two buffer counters are provided: a write buffer counter 207, and a read buffer counter 209. The overflow line 230 (OF), connected to all address counters 205, is coupled to detector 231, which is controlled by write phase clock 233 (WO) and read phase clock 232 (RO). An overflow out of any address counter 205, when writing, will cause therefore a write overflow output WOF on line 211. An overflow out of any address counter 205, when reading, will cause a read overflow output ROF on line 213. Set to zero at the beginning of the search, write buffer counter 207 is incremented by one in response to each signal on write overflow line 211 (WOF). Similarly, read buffer counter 209 is incremented by read overflow signals. Comparator 214 compares the contents of read buffer counter 209 with the contents of the write buffer counter 207 and, on an equal comparison sends a signal to AND gates 217 and 220. A write overflow signal on line 211 also sets a flip-flop 223 so that its true output Q, ANDed with an equal comparison from comparator 214, results in the read-enable signal RE from AND gate 217, enabling the input buffer denoted by the contents of read buffer counter 209 only to be read, not to be written.
On the other hand, a read overflow signal on line 213 resets flip-flop 223, so that its false output Q, ANDed with an equal comparison signal from comparator 214, results in a write-enable signal WE from AND gate 220, enabling the input buffer denoted by the contents of the write buffer counter 207, only to be written, not to be read. This condition also holds at the beginning of the search, since flip-flop 223 is then initially reset, allowing the first input buffer 44a to be written into.
FIG. 5 shows an embodiment of the word length memory where each byte shifted into word register 36 is also directed to the input comparator 260. A second input into input comparator 260 contains the code from a variable field delimiter, such as a code for a space. If no matching condition exists, line NMA increments the contents of word length counter 37 by one. A matching condition supplies, through line MA a write pulse to the word length memory 39, which thus accepts the contents (i.e., the word length of the previous text word) of the word length counter 37. Multiplexer 261 is at this time, connected to the write address register 262, containing the write address initially set to zero at the start of the search. At this time the write address register will be incremented by one.
Each byte shifted out of word register 36 is also compared in output comparator 263 to the variable field delimiter code. On an equal comparison, line RMA is connected to the READ input to the word length memory 39, using the contents of read address register 264 through multiplexer 261 as an address, and reading the contents of the address into word length register 40. At this time, the read address register 264 will be incremented by one.
FIG. 6 refers to one embodiment of the hash memory 35 and the system operable therewith. Through the load interface 13, the hash memory 35 is filled sequentially from the address 000 to the highest address with the computed hash memory codes.
During a search operation, hash memory address register 152 is loaded with the word length WL0 to WL3 from word length register 40, while the least significant two address bits are supplied from shift advance counter 156, initialized to zero. The resulting six address lines ABCDEF determine a hash memory cell, whose contents are available on the search output lines 153. The three most significant bits determine, in word register 36, the byte pair, the next significant bit, the even or odd byte of said pair, and the three least significant bits through decoder 158 determine the bit of said byte. The state of said bit (the so-called hash bit) produces bit H0 in pointer memory address register 155. A shift advance pulse into the shift advance counter 156 associated with the hash memory address register 152 advances the address into the hash memory 35 and produces (through the same logic) bit H1; and further shift advances produce bits H2 and H3. The remaining 4 bits of pointer memory address register 155 are supplied by the word length lines ABCD.
FIG. 7 shows a further embodiment of the key memories 29, having associated sequence memories 270 and tag memories 271, which permit the AXP 9 to make a distinction between single key words SW1, SW2, SW3, (such as the word "LAWYER", "AID", "POSTPONEMENT", etc.) and multiple key words MWi1, MWi2, MWi3,. . . MWm1, MWm2, (such as words "SUPREME COURT JUSTICE", or "PATENT LAW").
With each key memory n, there is associated a sequence memory n and a tag memory n, so that for each cell in pointer memory 32 there is a corresponding 1-bit cell in each sequence memory and tag memory.
At the time of loading the AXP 9, the sequence memories 270 and tag memories 271 are initialized with zeros, and the sequence memories 270 are loaded with a zero or a one depending on the following conditions: For each single key word SWn loaded into key memory i at an address found in pointer memory cell k, a zero will be loaded into corresponding cell k of sequence memory i, (e.g. key word "AID"). For each key word which is part of a multiple key word MNn1, MWn2, etc., loaded into key memory n at an address found in pointer memory cell k, a one will be loaded into the corresponding cell k of sequence memory n (e.g. key word "LAW").
At the time of searching the AXP 9, when the required comparison between key word and text word has been found, a one is written into cell k of the tag memory associated with the key memory compared. However, an output of two computer words is produced only if sequence memory cell k is a one, or if sequence memory k is a zero, while tag memory cell k had previously been a zero. When an end-of-document character is found, the tag memory 271 is cleared to zero.
Thus, outputs are only generated when multiple key words are successfully compared, or when single key words are successfully compared for the first time in a document.
This allows the software to make any sophisticated analysis of logical connections between multiple key words.
FIG. 8 shows an embodiment of the extended comparing logic. For each of a plurality of cells in key memory 29 there is an associated comparator 160. Each comparator simultaneously receives one byte of information from its associated key memory 29 at the address initially read out from pointer memory 32. All comparators receive, as a second input, the data byte shifted out of the word register 36.
The output of each comparator 160 comprises three lines EQ for "equal" comparison, LT for "less than" comparison, and GT for "greater than" comparison, each serving as an input to an AND gate 167. Each N+1 comparator also has associated a fourth AND gate which is connected to its LT line and, in addition, is connected to the GT line of comparator N, thus indicating a BK comparison (between keys). A further input into every AND gate 167 originates from a mask memory 170 which is loaded with a mask at load time. The mask indicates the desired type of comparison or comparisons. The outputs of each group of four AND gates 167 are used as inputs to an OR gate 175. The output of said OR gate keeps a latch set until a mismatch occurs in which case the latch will stay reset until a new text word is recognized. When a variable field delimiter is recognized before being shifted out of word register 36, this latch, when set, will cause an output of two computer words into the output buffer.
For example, if the comparison required at the outset of the search is decided to be a "less than or equal" comparison, the mask memory 170 is loaded in such a way that all AND gates 167 fed by the LT and the EQ lines are enabled. Thus, if the data byte compares "lower" than a particular byte of a key word, the output of the LT AND gate is a one, and, in turn, the output of the OR gate 175 is a one. If the latch is set, it will stay set. (i.e., matched) If it was reset (i.e., indicating an unmatched condition), it will stay unmatched.
Another feature of the extended logic not shown in FIG. 8 is the recognition of a "don't care" comparison: Each byte read out of each key memory 29 into comparators 160 is first compared to a special byte which denotes a "don't care" condition.
If it is not such a byte, the comparison with the data byte occurs in comparator 160 as described above.
If the key memory byte is found to be a "don't care" byte, the output of OR gate 175 is inhibited, thus keeping the latch unchanged (set or reset). Thus a "don't care" byte in any key memory will bypass the comparison in the comparators 160 and will cause any data byte in this position in a text word to be considered successfully compared.
FIG. 9 shows an embodiment of the output buffering scheme where the data coming from various sources is clocked into output buffer 46 with the shift-in clock pulse 248 and is shifted out into the output register 55 with the shift-out clock pulse 249. The latter is the output of AND gate 244, the inputs of which are the output ready signal and a load clock pulse. Output register 55 is reset from AND gate 245, thereby indicating that no output is available. This AND gate 245 has as inputs the same load clock pulse and the "output-not-ready" signal.
Referring back to FIGS. 1A through 9, in the foregoing discussion, the further embodiment of the invention as a device for pattern recognition simply requires the exchange of equivalent terms as defined previously. Those skilled in the art will have no problem making these transitions in reviewing the foregoing descriptions.
|Cited Patent
|Filing date
|Publication date
|Jul 9, 1964
|Jul 18, 1967
|Sperry Rand Corp
|Search memory
|Nov 25, 1966
|Jun 3, 1969
|Bell Telephone Labor Inc
|Associative match circuit for retrieving variable-length information listings
|Apr 10, 1967
|Mar 2, 1971
|Method of storing and retrieving records
|Nov 24, 1959
|Feb 15, 1972
|Compagnic Generale De Telegrap
|Microstrip aerials
|May 25, 1971
|Oct 10, 1972
|Pattern recognition by multiple associative transformations
|Sep 15, 1970
|May 15, 1973
|Shell Mex Bp Ltd
|Data locating device
|Sep 27, 1973
|Oct 8, 1974
|Honeywell Inf Systems
|Status indicator apparatus for tag directory in associative stores
|Apr 14, 1975
|Jun 15, 1976
|International Computers Limited
|Information retrieval systems
|Aug 6, 1975
|Aug 23, 1977
|International Computers Limited
|File searching system with variable record boundaries
|Citing Patent
|Filing date
|Publication date
|Oct 24, 1979
|Feb 2, 1982
|Bunker Ramo Corporation
|High-speed term searcher
|Jun 23, 1980
|May 17, 1983
|Sperry Corporation
|Apparatus and method for searching a data base using variable search criteria
|Jun 10, 1980
|Apr 17, 1984
|Jacques Vidalin
|System for hi-speed comparisons between variable format input data and stored tabular reference data
|Jun 16, 1981
|Apr 24, 1984
|International Business Machines Corporation
|Program identification encoding
|Oct 14, 1980
|Jun 26, 1984
|Texas Instruments Incorporated
|Data processing system having multiple buses
|Mar 17, 1981
|Aug 14, 1984
|Tokyo Shibaura Denki Kabushiki Kaisha
|Information processing system including a one-chip arithmetic control unit
|Feb 24, 1983
|Mar 12, 1985
|Sperry Corporation
|High speed data base search system
|Aug 12, 1982
|Jun 25, 1985
|L'universite De Bordeaux 1
|Method for controlling the comparison to be effected between reference logical entities and logical entities issuing from a file
|Jan 25, 1982
|Jul 23, 1985
|Skinner Jr James T
|Text comparator
|Jan 12, 1983
|Nov 25, 1986
|Skinner James T
|Textual comparison system for locating desired character strings and delimiter characters
|Nov 16, 1984
|Sep 13, 1988
|Allen-Bradley Company, Inc.
|I/O module with multi-function integrated circuits and an isolation interface for multiplexing data between a main processor and I/O devices
|Jul 25, 1985
|Feb 28, 1989
|Canon Kabushiki Kaisha
|Information searching apparatus
|Oct 1, 1981
|Mar 7, 1989
|Texas Instruments Incorporated
|Quadruply extended time multiplexed information bus for reducing the `pin out` configuration of a semiconductor chip package
|Nov 26, 1986
|Jun 20, 1989
|American Telephone And Telegraph Company, At&T Bell Laboratories
|Method and apparatus for accessing data from data attribute tables
|Jun 25, 1986
|Sep 26, 1989
|Thinking Machines Corporation
|Method for searching a database system including parallel processors
|Mar 16, 1989
|Oct 30, 1990
|Kabushiki Kaisha Toshiba
|Data string retrieval apparatus for IC card
|Apr 26, 1989
|Feb 5, 1991
|International Business Machines Corporation
|Method for language-independent text tokenization using a character categorization
|Oct 4, 1989
|Jan 26, 1993
|Mitsubishi Denki Kabushiki Kaisha
|Retrieving data using hash memory address generated by reversing /xor bits of selected bit strings of an input packet id
|Dec 27, 1988
|Aug 17, 1993
|Ncr Corporation
|Control method and apparatus for controlling the data flow rate in a FIFO memory, for synchronous SCSI data transfers
|Jul 22, 1992
|Oct 25, 1994
|Mitsubishi Denki Kabushiki Kaisha
|Taken storage apparatus using a hash memory and a cam
|Jul 14, 1994
|Sep 5, 1995
|International Business Machines Corp.
|Data search and compression device and method for searching and compressing repeating data
|Nov 19, 1993
|Apr 9, 1996
|Nec Corporation
|Data processing system having scanner for searching memory for message having top priority and/or identity code identical with new message
|Aug 1, 1994
|Jan 12, 1999
|Cypress Semiconductor Corporation
|Instruction set for a content addressable memory array with read/write circuits and an interface register logic block
|Nov 19, 2002
|Apr 5, 2005
|Netlogic Microsystems, Inc.
|Block-writable content addressable memory device
|Jun 13, 2002
|Aug 2, 2005
|Intel Corporation
|Method and system for performing inserts and lookups in memory
|Feb 1, 2002
|Aug 23, 2005
|Netlogic Microsystems, Inc.
|Content addressable memory with hashing function
|Nov 22, 2003
|Mar 20, 2007
|Netlogic Microsystems, Inc.
|Content addressable memory device
|Dec 24, 2004
|Jun 3, 2008
|Netlogic Microsystems, Inc.
|Block-writable content addressable memory device
|May 31, 2012
|Jan 3, 2017
|International Business Machines Corporation
|Intra-block partitioning for database management
|Aug 30, 2012
|Jan 3, 2017
|International Business Machines Corporation
|Intra-block partitioning for database management
|Nov 5, 2008
|May 2, 2017
|Micron Technology, Inc.
|Pattern-recognition processor with results buffer
|Jun 13, 2002
|Dec 18, 2003
|Sreenath Kurupati
|Method and system for performing inserts and lookups in memory
|Nov 5, 2008
|May 6, 2010
|Micron Technology, Inc.
|Pattern-Recognition Processor with Results Buffer
|May 31, 2012
|Dec 5, 2013
|International Business Machines Corporation
|Intra-block partitioning for database management
|Aug 30, 2012
|Dec 5, 2013
|International Business Machines Corporation
|Intra-block partitioning for database management
|Oct 23, 1981
|Aug 18, 1982
|Siemens Aktiengesellschaft
|Microcomputer system for rapidly finding blocks of signs
|Oct 23, 1981
|Mar 28, 1984
|Siemens Aktiengesellschaft
|Microcomputer system for rapidly finding blocks of signs
|Jan 12, 1983
|Oct 31, 1990
|SKINNER, James T. Jr.
|Text comparator
|Mar 15, 1989
|Sep 20, 1989
|Kabushiki Kaisha Toshiba
|Data string retrieval apparatus
|Mar 15, 1989
|Jun 13, 1990
|Kabushiki Kaisha Toshiba
|Data string retrieval apparatus
|May 17, 2002
|Nov 28, 2002
|Stevebsibm Michael J
|Graphics transfers for use in rotational molding
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Jun 8, 1984
Owner name: DATAFUSION CORPORATION, A CA CORP.
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:LOGICON, INC.;REEL/FRAME:004270/0599
Effective date: 19840531
|Oct 15, 1984
Owner name: DATAFUSION CORPORATION, A CA CORP.
Free format text: ASSIGNOR DOES HEREBY RELEASE LICENSE AGREEMENT RECORDED JUNE 8,1984 ON REEL 4270, FRAME 599,;ASSIGNOR:LOGICON, INC;REEL/FRAME:004316/0766
Effective date: 19841008


text:
|Thread Tools
thank you I hope in the next 2 weeks to have it under epoxy, I went with grey since it is my first paint job and I didn't want to go with white since my color is so close to white I want to see where I have been... I figure mix up about 2 quarts at a time?
Glad to help Simon.PM me when your ready for some more. Mike O.
well the epoxy arrived today... I also got some reducer from them... I ordered monday and got it today... fast delivery.. this weekend I may spend some time getting the (booth) ready.
dont forget the hotline number I gave you.I just sprayed some today,I love this stuff!!! You got my # too If you have an emergency...Good luck "painter"
thanks for all the support, and HELP... hopefully this weekend I will have everything ready as far as the make shift paint booth... I remeber you mentioning spraying water on the floor... is this to keep dust down or to attract some of the nasty chemicals? I hope in the next couple of weeks to get it under epoxy primer, if I mix up 2 quarts will that be enough for two wet coats? once again thanks for putting up with all my questions and taking your time to help me
I dont recomend watering down the floor,theres just too many disadvantages plus working in wet shoes all day wrinkles your feet and they'll start to hurt,not to mention splashing water on your freash paint by accident.do wash it down but let it dry
here is what I plan on painting the "29" in ... it is 12x20x8 both the front and rear doors open... I plan on putting 2 box fans (which I have yet to buy) at the rear door blowing out, and let air get pulled thru the vents.. there is screen on the vents do I need to put a filter over them as well? I am going to put filters on the inside of the fans.. to catch any overspray... the enclosure is about 30-35 yards from the back of my house and about 60 yards from my closest neighbor so I don't think fumes will be an issue... hopefully I can get an overcast day to paint since it get very hot in there with the sun shineing.. may not be too bad with the fans pulling air in through the vents ....
get lotsa duct tape,cut a hole for filter,tape filter to outside seal it up good,then one on the inside making a sandwich with the tarp in the middle put fan inside,put tarp over grass for a floor tape it to the sides,tape every crack from inside then do same thing on outside just to make sure.one fan on the out side blowing in through filter,then go to lowes get some stire foam sheets up on roof ,it'll help ......alot..oh yeah get something tacky in a spray can thats cheap like glue spray in on the inside of the intake filters(use two stacked together and taped together) no need for anything on the exhaust furnase filters.oh...place filters at chest level and front to back dont even try making a down draft you'll be sorry.sorry it took so long to get back ,some moron got me side tracked.your getting there Simon you been practicing?Youve really bitten off a lot here I'm glad to see so much effort,shows me a lot about you.My grand father once said somethingto me I'd like to share It has nothing and everything to do with paint and can be applied to anything:Theres a right way and a wrong way to do everything.....If your ever confussed on which path to take.......the right way is NEVER ez ..Now some may say this is a hack way do do this and its to much work but are you over 1,000 dollars yet?If you dont or cant paint a car ,has what you learned here worth it?if it dosent work out for you arnt you glad it didnt cost 5,000 to find out.You'll be fine ,and proud of your work,You'll see,I can always tell when someones got it or not and YOU ,brother ...got it...just dont quit your job to be a painter ,you'll be sorry,trust me on this,If this works out for you like I think it will PLEASE dont get a big head.I'd hate to think I created a monster.The last comment was more for anyone else who may be reading this than you I never would have taken so much time if I thought for a second you didnt have the attitude to be a great painter,which BTW has more to do with attitude than actual painting ....as you already found out any moron can paint... only a few are painters
okay... so the way i was going to do this is going to cause me problems?? my plan was to get two box fans taped together then some insulation board on either side to finish the span of the door... I was going to have these fans blowing out of the building with furnace filters on the inside of them.... then I was going to put a filters over the vents one at each end of the building as you can see in the picture... now im a little confused.. is there a way I can do this with out having to cut (destroy) my temporary garage since I plan on storing my 92 mustang in it... ? (maybe it would be better with no fans at all just the vents at the top that are already there)???or 1 fan blowing inward and letting it vent through the vents or 2 fans one on each end blowing in?? the fans I was going to get are those box fans that have 3 speeds ... only 14.99 at homedepot... and trust me if this turns out nice I am not going to change careers... I have been at the same place for almost 19 years... and I definatly will not let it go to my head... I never brag or act stuckup about what I know since I know there is always someone that knows more than me and there is always something to learn.... and yes even if my paint job goes to hell I would be glad I tried it and even though I wasn't able to pull it off I did learn a lot from you !!!!!
Last edited by atichargr; 07-02-2009 at 04:24 PM.
oops,I didnt notice the vents that'll work,if you notice a lot of dirt try tacking again between the first and second coat after waiting thirty min,first coat has to be dry enough to lightly touch and touch the overspray on the paper not the car,if the second coat looks trashy ,finish the second coat,but no more after that,no problem just make sure to tape up all your seams best you can and cover that floor up with a tarp your way will work too.Dont worry about the trash yet if you get some we can deal with that ez enough and stop worrying so much you'll lose sleep and get your blood pressure up all for nothing.Dont forget to call me right before you start so we can run through it and its best to paint as early in the morning as possible so the dew keeps the dirt from blowing around. OK? OK.damn now I'm getting excited, you'll be fine just say a little prayer the night before.it cant hurt and you'll need all the luck you can get.Me, on the other hand,I say my prayers AFTER dinner,its not funny youve never had my wifes cooking ,I'm still alive so theres your proof.
I spent 4 hours today getting the fenders remounted and taping everything off... was excited to spray a guide coat so next weekend I can sand it with 400 and get it ready for the spi epoxy! I started spraying the guide coat it is black!!! I told the guy the car was under a black epoxy he told me the guide coat was grey!!! I guess I can block sand it anyway and maybe take pictures of it before I wipe the dust off so I can see the highs and lows.... what a let down
lol,I use cheap white spray paint,the cheaper the better,black for gray primer.I've found those fenders to be a challenge to paint on the car plus the overspray and extra masking is a beach,with that compressor you have it might be easyer to do off the car,EZ sand finishing putty will make short work on your low spots just sand where you use it first.
Simon,I swear I'm losing my mind I have a great gun you can have (no charge )its a devilbis siphon feed I bought new used three times and got a sata theres nothing wrong with it and if you haven't got a gun yet its yours it'll last for years.but if you already have your gun I'll give it to someone that needs it.I painted with these for years its all there was till gravity guns came out and I was problably the last to switch over those guns looked funny with the cup on top,this gun still looks newtoo
I had one of those myself. Don't know what happened to it. Yes, they were and are great guns. You have both nozzles for that?
|Recent Body - Exterior posts with photos
|Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
|Thread Tools
|Similar Threads
|Thread Starter
|Last Post
|383 stroker
|Question about vehical weight and engine question
|Pointers on spraying lacquer?
|Body - Exterior
|How long will lacquer primer last?
|Body - Exterior


text:
Will Facebook Friend Preteens?
When Mary Kay Hoal started a social networking website for kids in 2007, the mother of five wanted to create a wholesome service her young family could enjoy. She quickly realized that catering to children on the Internet requires paying a steep toll. Hoal says she burned through hundreds of thousands of dollars just so her site, Yoursphere.com, could comply with the Children's Online Privacy Protection Act (COPPA), a 1998 law that sets strict rules for sites targeting preteens. Its main requirement: that sites get parental consent before collecting personal information about children or allowing them to open accounts.
Hoal, a Davis (Calif.) entrepreneur, tried working with a number of third parties—phone banks, credit-card companies, identity verification services—before settling on an e-mail notification to parents when their kids try to sign up. Parents must respond before the account becomes active. "It's a headache for a website publisher," she says.
The law that blew Hoal's budget will take on new importance now that Facebook, the world's largest social network, is exploring whether to open its site to kids, according to Bloomberg News. Doing so could help the company tap a new population of potential members. Facebook needs the help: It already has reached almost 1 billion members, and a recent report by ComScore says the social network's growth has slowed dramatically—a warning sign for some investors. Allowing preteens to create profiles would introduce a valuable new demographic for advertisers to reach.
And yet the idea of opening Facebook to youngsters makes some uncomfortable: "What's next? Facebook for toddlers?" says James Steyer, chief executive officer of Common Sense Media, a child advocacy organization. "Facebook should not target children under 13. Period." The problems of keeping children safe online became horrifyingly apparent on June 12 when Skout, a mobile social network popular with teens, partially suspended its service after three adult members allegedly raped minors.
Currently, preteens are not permitted to create a profile on Facebook. But many lie: A Consumer Reports survey last year claimed that Facebook has 7.5 million users younger than 13. Eric Goldman, an associate professor at Santa Clara University School of Law, says "having Facebook comply with COPPA might be better than the current situation, where Facebook basically treats underage users like adults."
Facebook says it's difficult to enforce age restrictions on the Internet, in part because parents help kids access online services. "We are in continuous dialogue with stakeholders, regulators, and other policymakers about how best to help parents keep their kids safe in an evolving online environment," says company spokesman Andrew Noyes. Facebook declined to comment on whether it plans to lower its age limit.
The social network, which raised $16 billion in its recent initial public offering, could easily afford to implement a parental verification system—and given Facebook's history of privacy-related public-relations blowups, it may want something that goes beyond what COPPA requires. Last year, when Vincent Cannistraro created WhatsWhat.me, a social site for kids, he was careful to follow COPPA by setting up ways for parents to e-mail or fax permission slips, or provide a credit-card number. (The free site charges the card a penny only to make sure it's active.) In addition, the Waltham (Mass.) startup requires that every new member take a Webcam photo, which is reviewed by an employee to make sure the person in the photo is a child. Each time members log in, they take another Webcam photo. Facial recognition software checks to ensure the photos match. Cannistraro says adults try to register or log in under existing accounts "all the time," but the added security blocks them.
To comply with COPPA, Facebook would also have to offer parents the option to not have their children's online activities tracked. That could be problematic because Facebook makes the majority of its revenue by mining user data and serving targeted ads. If large numbers of parents opt not to let Facebook track their children, then advertising to them could become a challenge since online advertisers have come to expect a certain level of detail about who their ads are reaching. Chad Perry, founder of an Orem (Utah) social network for kids called ScuttlePad, says sponsorship negotiations with a publishing company fell through when he refused to link users directly to the company's site. Perry says he forbade the practice because he can't control content on a third-party site.
"I'm open to advertising but it has to be right for us—it has to be safe and not promote ideas that are going to affect kids in a negative way," says Perry. "However, the only way to stay free in the long run is through advertising. And that's our challenge every day."


text:
Hi guys,
Thinking of purchasing a E46 320D as i need a bigger car.
Just wanted to know real world MPG round town and motorway and how many miles you get to a tank combined. My driving is 90% round town and 10% motorway.
I have always been a big fan of the 3 series that's why I want one of these
Fuel consumption's a big factor as im going from a small 1.2 Corsa Petrol to a 2.0 Diesel i'm not expecting it to be better than that obviously just wanted some real world statistics before i purchase one.
I have Googled around and cannot find much with regards to this so advice would really be appreciated.


text:
History of Medicine
Guide to Collections Relating to the History of Artificial Internal Organs
Bakken Library and Museum
Canada Science and Technology Museum
Deutsches Hygiene-Museum
Deutsches Medizinhistorisches Museum
DeWitt Stetten Jr. Museum of Medical Research
Dittrick Medical History Center
Hong Kong Museum of Medical Sciences
International Center for Artificial Organs and Transplantation
International Center for Medical Technologies
International Museum of Surgical Science
John P. McGovern Historical Collections and Research Center
Mayo Foundation Archives, Mayo Clinic
Medical History Museum of the University of Copenhagen
Medical History Museum of the University of Zurich
Medicinhistoriska Museet
Minnesota Historical Society
Museu Nacional de Historia da Medicina
Museum Boerhaave
Museum of Health Care at Kingston
Mutter Museum
National Library of Medicine
National Museum of American History
National Museum of Health and Medicine
Science Museum of London
Semmelweis Medical Historical Museum, Library and Archives
Thackray Museum
University of Iowa Hospitals and Clinics Medical Museum
University of Utah, Marriott Library, Special Collections
University of Washington
Vanderbilt University
Wellcome Library for the History and Understanding of Medicine
International Museum of Surgical Science
1524 N. Lake Shore Drive, Chicago, Ill 60610
(312) 642-6502
(312) 642-9516
Lenard Kliwinski, Curator
Researchers should make an appointment to view the collection. Museum is open Tuesday through Saturday, 10 a.m to 4 p.m.
The International Museum of Surgical seeks to inspire students and the public through programming and exhibits on the important developments of the history of surgery and medicine. This is done through: Inquisitor, a self-guided tour book; Video theatre; Scopecam; Magiscopes; Surgical Microscopes; Anatomical models; Civil War replica; and Amputation kits displays.
IMSS Artifact Collection, 17th century to present day
To date, there are over 7,000 artifacts including surgical instruments, paintings, murals and statutes that highlight the history of surgery.
The museum has collected surgical related artifacts since its opening in 1952 and originally welcomed members of the International College of Surgeons to contribute to the foundation of the collection.
From scalpels to skulls, the museum collection spans over 4,000 years of surgical history. Housed in a land marked status mansion, the collection is exhibited on all four floors. Originally organized by a particular country, the artifacts are displayed by either country or discipline for example radiology, orthopedics, and a turn of the century apothecary. Collection items relating to the history of artificial organs include:
- Iron lung
- Heart Valve Collection, approximately 100 objects


text:
10 / 34 Emsworth Street, Wynnum QLD 4178
Property Details$430,000
Bayside Apartment 1st Home Buyer ? Save $20K ?
Yes ! You will appreciate the Bay breeze. Only a short stroll to Wynnum Shopping Centre, Train Station, Pubs,Clubs,Cafes and the Waterfront. What a lifestyle! Designed to provide a balance of indoor Living and Outdoor entertaining the recently completed Emsworth Street Apartments offer an affordable alternative for those wanting a Bayside Lifestyle. Inspection will reveal a quality finish including stone bench tops, dishwasher, split cycle air conditioning and intercom. Located in a quiet back street yet close to the revamped business centre and parkland. Brisbane Airport / Gateway Motorways are within easy access and there are a variety of private and public schools in the area. Manly Boat Harbour is just down the road and the Esplanade is a haven for walking and cycling. Whether investing or nesting, the Wynnum Bayside has a lot on offer and is undergoing a major re development. First home Buyers see the following link for suitability https://firsthomeowners.initiatives.qld.gov.au/


text:
Text Size: A A A
The Student Nurse Internship is an 8-week program designed to provide baccalaureate nursing students entering their senior year with the opportunity for clinical practice in a supportive learning environment. Interns are assigned to a Registered Nurse preceptor on a particular clinical unit. Nurse Educators meet with the interns and their preceptors regularly throughout the summer. Interns also participate in educational sessions on a variety of clinical issues and professional development topics. The internship provides nursing students with coaching and mentoring that will build confidence in patient care, critical thinking, time management, priority setting, and clinical decision-making. Student nurse interns become valuable members of the patient care team.
Applications are accepted from November to February of each year.
The program will provide students with the opportunity to apply theoretical knowledge to the clinical setting by:
Opportunities Beyond the Summer Internship Program
At Saint Francis you will experience...
Internships are available in several clinical areas including:


text:
RaffleCopter Makes GiveAways
& Raffles A Snap!
Give-Away contests are notoriously a pain in the butt!
Traditionally, you have to do a lot of tracking, bookkeeping, counting, and paperwork and then deal with a random number generator to find the winner.
So when Andy offered me the opportunity to raffle off a premium copy of Commentluv, I was concerned about not having enough time to do a good job.
Fortunately, several of my blogging friends had had good results using RaffleCopter and suggested I try them out.
Greg from over at @RaffleCopter was awesome and hooked me up with a beta invite.
I gotta say, the widget is a win! It was incredibly easy to set up, manage and low-maintenance.
It's the least work I've EVER done for a online action-to-enter raffle!
Rafflecopter Demo
How to Enter Rafflecopter Giveaways
There is no plugin required and it is simply copy and paste code into the html section of your site and you're good to go.
A tip: WordPress can be cranky about script codes, so after you paste it, stay on the HTML tab, hit publish and leave. Don't go back to the visual tab.
I will definitely be on the look out for more cool things I can offer as giveaways in the future. If you're interested in learning more about doing that on your blog, check out Ana's blog for a post on how to get sponsors for giveaways (and reviews).
Did you enjoy the contest? What were your thoughts as you participated in the raffle and used the widget? Did you find it good, bad, awesome or see any bugs? It is still in beta and Greg and I both welcome your feedback!
Taking The Headaches Out Of Internet Marketing
PS: I do not know what or how or if it will be priced when it comes out of beta. So far it appears that everyone that has gotten a beta invite has been able to use it for free. Enjoy it and be sure to give them plenty of feedback!


text:
$ 24.99
Hashtag WANT.Made of PU leather, this tri-fold clutch/wallet has:-
$ 12.99
Our #Awesome onesie is adorable and so on point with trends! Super cute, excellent quality, and super comfy! Made of soft cotton. Includes onesie only. Size 0-6 months. Unisex. View full product details
Sold Out
Crazy Cute and Crazy Fun! Adorable Crochet Mint Skirt by Crazy Train. Elastic waist. View full product details
$ 24.99
Hotter than August in Texas! Is this overall dress the absolute cutest? Sheer black ankle length denim dress with the cutest front pocket. Would be perfect for your next soiree. Note:... View full product details
Sold Out
Adorable Marilyn Monroe baby onesie. This is our favorite image of Marilyn in her pretty white ballerina tutu dress! Your little girl will look like quite the princess in this cute onesie.... View full product details