text:
It is Thursday, a good day to tell you all to go **** yourselves.
It is Thursday, a good day to tell you all to go **** yourselves.
"Frank's Redhot - I Put That **** On Everything!" ~ Ethel
I've honestly never met a person who genuinely thought the earth was 6,000 years old. Absolutely fascinates me that people like that still exist. When that Reeves guy that just signed up said creationism may be pathological, he may very well have a point.
It's a shame though, it's not that he's stupid, it's that clearly anyone who believes such things was raised to believe such things as a child. No 50 year old man ever became a young-earth creationist (or if there was, you could probably talk that guy into a few other things as well). He's so secure in his paradigm that he'll believe whatever fairy tale story or explanation he needs to believe in order to fit with his world-view, no matter how ludicrous, because that's just simply easier for him than getting the proverbial rug pulled out from beneath his feet & realizing that many of the things he's believed in his whole life have been wrong, or concerning God's existence, at the very least not proven by some silly syllogism.
The only other reasons I could even fathom would be that he either has an unbearably intense fear of death, & needs to believe he's secured a place in heaven for him to be able to function, or, building off that last point, did something horrible & wants to repent as he fears he might otherwise be bound for eternal damnation.
Any way you slice it though, what that dude needs is 3 grams of dried psilocybin, an isolation tank, & a hug.
It's just like with this Manti Te'o thing. At first, I thought there was no way on Earth anyone could be hook, line & suckered that hard for over 3 years. You have to be all-time, first-ballot hall of fame gullible to get trolled so hard for so long. Then, I remembered he was a Mormon, & I thought of a very appropriate quote from Joe Rogan (in reference to anti gay-marriage ads made by Mormons); "I could see why they're concerned about it; if someone could talk you into being a Mormon, they could probably talk you into sucking some dick".
Funny show if you follow the UFC ^
btw tyler, idk if you've tried this, but Jack Daniel's Tennessee Honey w/ Sprite is my new jam.
I shot it once. Im a fan of Jack in general though. That sounds like a good drink though. Actually havent been doing liquor much since I got back in the states. I tend to drink almost strictly liquor home and beer here. Economics doesnt lend itself well to beer in the Bahamas, but liquor is cheap as dirt compared to the states. I actually had a bottle of Captain Private Stock, which I never drink in excess with because its too good to waste on a drunk tongue. I ended up drinking the whole fifth one night to prove a point. I won the point, but now I have no good booze.
You ever tried cider shag
Dolphins Til I Die


text:
Trying to Reason with Hurricane Season
Posted on August 10, 2012
The fall season offers many great reasons to travel to Windjammer Landing, low rates on accommodations and all-inclusive, hot weather, and lots of space at the beach and pools all add to the already irresistible allure of Saint Lucia. However, there is one factor that can intimidate travelers from taking advantage of these seasonal opportunities, the unpredictable threat of hurricane season. Although the risk of a hurricane actually occurring during your vacation is very small, taking the following steps can help you ensure that you get the most out of your hurricane-season vacation.
Be Prepared
The best way to mitigate the risk of losing your travel investment or getting caught in dangerous weather is to understand that there is always a small chance of your vacation coinciding with some less-than-desirable weather, and be prepared for this possibility. The simplest thing you can do is purchase travel insurance and check to insure that hurricanes are covered by your plan. Typically, guests have no problem re-scheduling their vacations around bad weather without additional costs, as airlines and resorts such as Windjammer Landing are just as happy to avoid hurricanes as you are.
Do Your Homework
Or have us do it for you, knowing some basic facts about hurricanes will help you limit your risk even further while still getting great prices. Windjammer offers summer and fall specials throughout the year, so you can be sure to find a great price. But if you want to be sure to avoid hurricanes, just check your calendar! About seventy percent of tropical storms occur between August and October, with September 10 being identified as the worst day of the year, so get a head start on your summer getaway and take a pass on bad weather.
Steal a Deal
For those willing to ignore the slight risks associated with hurricane season, there are fantastic deals everywhere you look. In addition to low rates on accommodations and all-inclusive, most resorts will not be anywhere near capacity throughout the season. This provides risk-averse travelers with all of the freedom and amenities that they could possibly want, including open beaches and pools, no waiting for drinks or dining, and flexibility to customize your vacation to your personal preference. Ignore the label "hurricane season", and you won't believe vacations like this are even possible!
Safety First
In the unlikely event that you are caught in St. Lucia during a hurricane, whether it's a brush-by (about once every 3.5 years) or a direct hit (every 20 years), you need to know that every possible measure will be taken to ensure your safety. Windjammer Landing was exposed to a direct hit by Hurricane Tomas in 2010, and no staff or guests were hurt during the storm. In addition, the resort is capable of providing its own electricity and drinking water regardless of weather conditions, facilitating a fast return to "business as usual".
So, don't let the chance of a tropical storm or hurricane stop you from enjoying a fantastic Caribbean vacation for a great price this year. The risks of actually encountering any troublesome weather during your stay are incredibly low, and the vast majority of storms can be detected days or weeks in advance. In the unlikely event that a storm does coincide with your vacation, there are always alternatives such as re-scheduling or re-locating your summer getaway with little to no financial risk.
Spotted in LEISURE TRAVEL GROUP: Families Make the World a Classroom Through Group Travel
Spotted in the TELEGRAPH: Top 10: Caribbean Family Holidays
Spotted in THE HOTEL GURU: Best Places to Stay in St. Lucia
Spotted in TRAVEL WEEKLY: Weddings - My Big Fat Family Wedding
Spotted in TRAVEL WEEKLY: Spa three ways - Save, spend, splurge
Spotted in USA TODAY: Five Caribbean resorts your teenager will love
Spotted in: NATIONAL GEOGRAPHIC TRAVELLER
Spotted in DAD INFO: Send Your Kids to School in the Caribbean
Spotted in KODOMO: Windjammer Landing Villa Beach Resort
Spotted in DESTINATIONS OF DISTINCTIONS: All-Inclusive of yesteryear's…meet the new kid in town
Spotted in EBONY: What Makes Luxe St. Lucia a Must-See
Spotted in VACAY.CA: 5 best March Break hotels for families
Spotted in THE TELEGRAPH: The best Caribbean holidays
Spotted in CARIBBEAN JOURNAL: New Look at St Lucia's Windjammer Landing Resort
Spotted in TRAVEL WEEKLY: St. Lucia Windjammer's villa revamp
A Royal Babymoon Package: Save 20%
Recently Engaged? Why not a destination wedding at Windjammer Landing?
Renovation Update - Constantly striving to provide you the best
Trying to Reason with Hurricane Season
Summer in Saint Lucia
Saint Lucia Honeymoon = Romance, Adventure & Stress Free
St Lucia Carnival
Need help planning a destination family reunion?
Trip Advisor Awards Windjammer Landing
Summer: The Season to Say I Do
Every Day is Mother's Day at Windjammer Landing
St. Lucia Jazz Festival Features "Boo"
We Won! We Won!
Windjammer: 2012 Readers Choice Awards
Windjammer's Junior Chef Paulyn Eugene Makes the Cut
Sweep Your Sweetheart Off Their Feet
Winter Holidays in the Caribbean
Snowflaks or Snuba?
Gratitude, Giving Thanks
And the winner is.....
November is Island Party Month
Photo Contest: Month Two
St. Lucia Halloween

subset: commoncrawl


text:
Clark Duramold F-46 Fairchild - Duramold aircraft was built with a molded wooden fuselage. NASA Sherman Mills Fairchild - DuramoldSherman Mills Fairchild Duramold - Molded Plywood ConstructionThe History of Flight Howard Hughes and the Spruce GooseSpruce Goose Pilot Howard Hughes Howard Hughes Biography How come Howard Hughes's Spruce Goose flew only once? Sherman Mills Fairchild - Duramold Aircraft - Spruce GooseThe largest aircraft of duramold construction was the Spruce GooseIn the late 1930s, aircraft of composite materials began to appear made of plastic-impregnated wood materials called duramold. The most famous and largest aircraft of duramold construction was the eight-engine Howard Hughes flying boat dubbed the Spruce Goose.
Sherman Mills Fairchild"Shelly" Fairchild loved aerial photography. By 1925, Fairchild created a group of aircraft companies for aerial photography, the manufacture of airframes, and power plants. Fairchild also bought two materials processing companies: the Duramold Aircraft Corporation in 1937, and the Al-Fin Corporation in 1941. Fairchild started to research the forming and bonding processes in aircraft manufacture.According to the Fairchild Corporation, "In the mid-1930s, Fairchild pioneered the application of composite structures to airframe design and production - duramold. The adhesive bonding processes and techniques are still followed in the manufacture of composite structures today. Fairchild also developed the first nine-lens mapping camera for the U. S. Coast and Geodetic Survey in 1936." Duramold AircraftThe duramold aircraft was an aircraft built with a molded wooden fuselage. Duramold was originally developed by Colonel V. E. Clark, famous for the Clark Y airfoil. The Duramold Aircraft Company became a subsidiary of the Fairchild Corporation, the photo to the right depicts the F-46 designation for Fairchild carried by the craft. Spruce GooseThe Spruce Goose was not the first airplane to use duramold material. Many small planes had been built using duramold during the early thirties by the Fairchild Aviation.Sherman Mills Fairchild - DuramoldSherman Mills Fairchild Duramold - Molded Plywood ConstructionThe History of Flight Howard Hughes and the Spruce GooseSpruce Goose Pilot Howard Hughes Howard Hughes Biography How come Howard Hughes's Spruce Goose flew only once? Important disclaimer information about this About site. |
User Agreement | Ethics Policy | Patent Info. | Privacy Policy | Kids' Privacy Policy
©2006 About, Inc., A part of The New York Times Company. All rights reserved.


text:
While the main house is a site to behold, the gangster's former pool house showcases views that will leave you breathless. Take a peek at Al Capone's former island hideaway on Miami Beach.
The two-story pool house features a guest bedroom on the second floor.
By Kara Franker
6 of 10


text:
Marbury Honored On China's Stamp Argentina Losing Hooliganism Battle Qatar F1 Race Hopes Remain Distant DEB Avoids Bankruptcy, Includes Pro Clubs Thai Businessman To Take Over AC Milan Tokyo Faces Major Redevelopment Executive Transactions UAE To Bid For 2021 Rugby League WC SPFL To Delay Decision On Playoff Dates ARU Reports A$6.3M Deficit For 2014
SBD Global/December 21, 2012/Media
Print All-
Chinese Sports Fans Move Away From TV Toward Internet For Live, On-Demand Coverage
Peer-to-peer video sharing website PPTV has become China's "leading online sports center, though it offers much more than sports," according to WANT CHINA TIMES. As more sports fans in China turn to the Internet for live and on-demand broadcasts, the "sun might be about to set on China's national sports channel CCTV-5." Global Entrepreneur magazine reports that "the site functions as an online home base for sports enthusiasts in the country." PPTV "saw a staggering 30 million viewers tune in for the final of the UEFA Champions League this year." During the European football tournament, PPTV broadcast to Chinese fans equivalent to 40% of CCTV-5's viewership. The live coverage "has also produced a 300% return on investment for the site." PPTV is China's second biggest online video platform by number of users. It is accessed by more than 34 million viewers daily, trailing only Youku (WANT CHINA TIMES, 12/20).
Sophomore Slump Catches Up With Twenty20 Big Bash League
The Twenty20 Big Bash League "has stalled at the start line of its heavily promoted second edition, with ratings down 30% and crowds dipping nearly 40% from the same stage of the competition last year," according to Chris Barrett of the SYDNEY MORNING HERALD. In "a blow for Cricket Australia and the competition's broadcaster, Fox Sports," ratings comparisons obtained by Fairfax Media reveal that "interest in the city-based domestic league has fallen significantly, while plummeting attendances also point toward second-year syndrome." After the first nine games of the tournament "the average national TV audience was 237,000, a drop of 29% on the same point of '11-12, the first year of the revamped league." Average crowds are 11,167, while, after the same number of matches last December, the BBL had "average attendances of 17,575." The numbers "are a concern" for CA as it prepares for final negotiations for a five-year domestic broadcast deal. Fox Sports, which will bid to retain the BBL rights, is "understood to be content with the ratings despite the slide," having also used its coverage of the competition "to bump up subscriber numbers" (SMH, 12/21).
German Cup Games Land High Ratings For ARD, Sky
German public broadcaster ARD "obtained high ratings with its Wednesday coverage of the German Cup's round of 16," according to Manuel Weis of QUOTEN METER. ARD attracted 6.25 million viewers with its broadcast of the match-up between Dortmund and Hannover. The market share for the game, which started at 8:30pm local time, was 19.9%. In the target age demographic 14-49, the game received a 16.5% share. In comparison to Tuesday's broadcast, where ARD aired the game between Bayern Munich and Augsburg, the game attracted only 160,000 less viewers.
PAY-TV: German pay-TV channel Sky "obtained high ratings for its broadcast of Wednesday's cup games." A total of 310,000 viewers tuned in to watch all four Wednesday games on Sky. The number equaled a 1.1% overall market and a 1.4 share in the target demographic (QUOTEN METER, 12/20).


text:
Volume 11, Number 11—November 2005
Vibrio cholerae Pathogenic Clones
On This Page
Suggested citation for this article
We resolved the relationships between 2 pandemic clones of Vibrio cholerae. Using 26 housekeeping genes, we showed that the US Gulf clone, the Australian clone, and 3 El Tor strains isolated before the seventh pandemic were related to the seventh pandemic clone. The sixth pandemic clone was well separated from them.
Cholera caused by Vibrio cholerae is a major disease that has caused great fear since the first recorded pandemic in 1817 because of the frequency of death and the rapidity with which it occurs (1,2). Approximately 200 O antigens have been distinguished serologically (3,4), but only O1 and O139 have been found in epidemic and pandemic cholera isolates (5,6).
The seventh pandemic (1961–present) is still widespread and has a severe impact on 3 continents. The sixth pandemic ended in 1923, but the clone persisted at least until the 1990s (7). Furthermore, several cholera outbreaks were reported after the sixth pandemic retreated but before the start of the seventh pandemic. Isolates from these outbreaks were recognized as different from those of the sixth pandemic and were allocated to the El Tor biotype, while the sixth and fifth pandemics, both of which had been studied microbiologically, were referred to as the classical biotype. These El Tor outbreaks occurred in Indonesia and the Middle East (1926–1960) (5) and are often referred to as prepandemic isolates because they were later seen as forerunners of the seventh pandemic, which was also of the El Tor biotype. However, now that environmental V. cholerae has been studied in some detail, major components of the El Tor phenotype are known to be present in most environmental isolates, and the classical biotype is believed to have arisen by loss of characters otherwise widely present in the species (8). Also, cases of sporadic indigenous cholera have been detected in Australia (9) and the United States (10), both of the O1 El Tor biotype. These are generally referred to as the US Gulf and Australian clones. All of the pathogenic forms discussed above had the O1 serotype, but in 1992 a variant of the seventh pandemic appeared with a new O antigen, O139; this variant is known as V. cholerae O139 Bengal (11).
The relationships of V. cholerae have been studied in several ways, but the most useful insights have come from multilocus enzyme electrophoresis (12) and more recently by multilocus sequence analyses (4,13,14). In this study, we sequenced 26 housekeeping genes from V. cholerae isolates representative of the sixth and seventh pandemic clones and other closely related toxigenic strains to determine relationships to better understand the origins of pandemic clones.
Twenty-six housekeeping genes distributed evenly on both chromosomes (Table A1) were studied by using 5 nontoxigenic environmental isolates and 12 toxigenic V. cholerae isolates, which comprise 5 sixth and seventh pandemic isolates and 7 pathogenic isolates related to them (Table). One of the 3 seventh pandemic isolates is N16961; the sequence of its genome (15) was used in this study. All 26 housekeeping genes were successfully sequenced from the remaining 11 toxigenic isolates. However, 4 genes could not be amplified by polymerase chain reaction from 1 of the environmental isolates (sdaA for 370-94, hmpA for 905-93, glgX for 928-93, and pepN for 370-94) and were not sequenced. The GenBank accession numbers for the nucleotide sequences determined in this study are DQ020969–DQ021380.
The 5 nontoxigenic environmental isolates had different sequences for each gene. These sequences were not found in any of the 12 toxigenic isolates. The average pairwise difference among the 5 environmental isolates in the 22 genes sequenced ranged from 0.67% to 5.29%, an indication that V. cholerae as a species has a high level of sequence variation. However 11 of the 26 housekeeping genes (glyA, gppA, pntA, icd, purM, plsX, ndh, glgX, adk, carA, and speA) were identical in all toxigenic V. cholerae isolates, confirming that they are closely related.
Figure 1
There were 18 mutation/recombination events among the 15 genes with sequence variation in the 12 toxigenic isolates. Three (malP, pyrC, and gyrB) of these genes had undergone 2 changes. Seven cases of single base differences, which are attributed to mutation, were clearly distinct from 11 cases of multiple base differences, which are attributed to recombination. Ten of the events attributed to recombination involve changes in 10 to 51 bases (Figure 1). The metG gene, in which the 2 sequences differ by only 4 bases, might have undergone 4 mutational events rather than a single recombination event, but we considered this to be most unlikely.
Some of the 11 genes believed to have undergone recombination may have undergone >1 recombination event. This possibility is likely because 11 of 26 genes have undergone recombination. For example, in metE the base changes are at the 2 ends and may represent 2 recombination events; the same applies, to a lesser extent, to malP.
With regard to the length of DNA involved in recombination events, segments longer than a gene are most common because only in the genes discussed above and in sdaA and gyrB are the bases that differed clustered within the gene. This is suggestive of recombination within that gene.
Figure 2
The sequences for the 26 genes were used to produce a tree with mutational and recombinational events and given equal weight, which is shown in Figure 2. By sequencing 26 genes, we have observed sufficient variation to determine the relationships of the isolates studied. The tree is unrooted because the environmental isolates share no alleles with each other or toxigenic isolates. The relatively high rate of recombination in V. cholerae means that the level of sequence similarity does not indicate relatedness of the isolates unless the sequences are very similar and differences can be attributed to mutation, as in the toxigenic strains. However, other reasons exist for believing that the root is on the long 10-event branch that includes 2 mutational changes. The 10 El Tor isolates on 1 end are, at most, 3 steps from it and the 2 classical sixth pandemic isolates are separated by 1 event. The isolates date from 1937 to 1992 for the former group and from 1921 to 1965 for the latter group. Since 1 group giving rise to the other while undergoing little divergence itself is highly improbable, we believe that the root lies somewhere on that branch. The properties that characterize the El Tor biotype are those of environmental strains, which makes it unlikely that they are derived from the sixth pandemic, and the reverse seems even less likely because the fifth pandemic was also the classical biotype. We therefore treat the tree as being rooted on the long branch, which enables us to follow the sequence of events.
Among the El Tor isolates, the Australian clone is the most closely related of the current clones to the seventh pandemic clone, with 1 and 2 events along the 2 branches separating them. The Australian clone, although not discovered until 1977, must have arisen before the seventh pandemic and spread to Australia. The prepandemic outbreak isolates are located separately among the surviving El Tor pathogenic clones, with the 1937 Indonesian 66-2 (Makassar 759) isolate located closest to the seventh pandemic clone. The US Gulf clone diverged before the Australian clone and the seventh pandemic clones diverged, with a single recombination event on the branch to the common ancestor of the Australian and the seventh pandemic clones.
The 2 sixth pandemic isolates are well separated from the other strains, differing from them at 10 loci, an average of 5 events per branch. These include recombination events affecting 8 genes. If representative, ≈30% of the genes have undergone recombination during divergence of the sixth pandemic clone and the El Tor group of pathogenic clones that includes the seventh pandemic clone. The extensive divergence between the sixth pandemic and other toxigenic isolates studied indicates a long period since divergence from the common ancestor, which presumably occurred well before the sixth pandemic (1899–1923). In the absence of any intermediates, we cannot allocate individual events to either branch but presume that each is equally likely to have occurred on either branch.
This study using sequences of 26 genes has resolved the evolutionary relationship of the 2 major pandemic clones of V. cholerae and the relationships of the seventh pandemic clone to other pathogenic El Tor clones and isolates. With the relationships established it is clear that study of the prepandemic isolates and Australian clone in particular could illuminate the events involved in the emergence of the current seventh pandemic clone from this lineage.
Ms Salim is a PhD student in microbiology at the University of Sydney. Her research interests include population genetics and evolution of V. cholerae.
We thank all donors of isolates and the anonymous referees for their helpful suggestions.
This research was supported by grants from the National Health and Medical Research Council of Australia and a University of New South Wales Goldstar award.
- Pollitzer R. Cholera. Geneva: World Health Organization; 1959. p. 147–58.
- Lacey SW. Cholera: calamitous past, ominous future. Clin Infect Dis. 1995;20:1409–19. DOIPubMed
- Shimada T, Arakawa E, Itoh K, Okitsu T, Matsushima A, Asai Y, Extended serotyping scheme for Vibrio cholerae. Curr Microbiol. 1994;28:175–8. DOI
- Kotetishvili M, Stine OC, Chen Y, Kreger A, Sulakvelidze A, Sozhamannan S, Multilocus sequence typing has better discriminatory ability for typing Vibrio cholerae than does pulsed-field gel electrophoresis and provides a measure of phylogenetic relatedness. J Clin Microbiol. 2003;41:2191–6. DOIPubMed
- Barua D. History of cholera. In: Barua D, Greenough III WB, editors. Cholera. New York: Plenum; 1992. p. 1–36.
- Albert MJ. Vibrio cholerae O139 Bengal. J Clin Microbiol. 1994;32:2345–9.PubMed
- Safa A, Bhuiyan NA, Alam M, Sack DA, Nair GB. Genomic relatedness of the new Matlab variants of Vibrio cholerae O1 to the classical and El Tor biotypes as determined by pulsed-field gel electrophoresis. J Clin Microbiol. 2005;43:1401–4. DOIPubMed
- Reeves PR, Lan R. Cholera in the 1990s. Br Med Bull. 1998;54:611–23.PubMed
- Desmarchelier PM, Wong FY, Mallard K. An epidemiological study of Vibrio cholerae O1 in the Australian environment based on rRNA gene polymorphisms. Epidemiol Infect. 1995;115:435–46. DOIPubMed
- Johnston JM, Martin DL, Perdue J, McFarland LM, Caraway CT, Lippy EC, Cholera on a Gulf Coast oil rig. N Engl J Med. 1983;309:523–6. DOIPubMed
- Bhattacharya MK, Bhattacharya SK, Garg S, Saha PK, Dutta D, Nair GB, Outbreak of Vibrio cholerae non-O1 in India and Bangladesh. Lancet. 1993;341:1346–7. DOIPubMed
- Wachsmuth IK, Olsvik Ø, Evins GM, Popovic T. Molecular epidemiology of cholera. In: Wachsmuth IK, Blake PA, Olsvik Ø, editors. Vibrio cholerae and cholera, molecular to global perspectives. Washington: ASM Press; 1994. p. 357–70.
- Byun R, Elbourne LDH, Lan R, Reeves PR. Evolutionary relationships of the pathogenic clones of Vibrio cholerae by sequence analysis of four housekeeping genes. Infect Immun. 1999;67:1116–24.PubMed
- Farfan M, Minana-Galbis D, Fuste MC, Loren JG. Allelic diversity and population structure in Vibrio cholerae O139 Bengal based on nucleotide sequence analysis. J Bacteriol. 2002;184:1304–13. DOIPubMed
- Heidelberg JF, Eisen JA, Nelson WC, Clayton RA, Gwinn ML, Dodson RJ, DNA sequence of both chromosomes of the cholera pathogen Vibrio cholerae. Nature. 2000;406:477–83. DOIPubMed
Suggested citation for this article: Salim A, Lan R, Reeves PR. Vibrio cholerae pathogenic clones. Emerg Infect Dis [serial on the Internet]. 2005 Nov [date cited]. http://dx.doi.org/10.3201/eid1111.041170
Table of Contents – Volume 11, Number 11—November 2005
- Page created: February 17, 2012
- Page last updated: February 17, 2012
- Page last reviewed: February 17, 2012
- Centers for Disease Control and Prevention,
National Center for Emerging and Zoonotic Infectious Diseases (NCEZID)
Office of the Director (OD)


text:
Artifact on NX6800GT due to Sleep mode
View Single Post
Registered User
Join Date: Nov 2005
Location: Greece
Posts: 17
Re: Artifact on NX6800GT due to Sleep mode
Originally Posted by
Well it looks that my problem solved just momentarily.
Well ...
It's clear now to me, that it's a pure hardware bug , and its not related to software, like drivers or operating system, or other hardware parts.
This computer setup, was unchanged for 11 months, with out stability problems, even overclocked to 14x236Mhz Bus ( 3.3GHz) .
Prior VGA card ATI 9600XT (Sapphire) , never had a problem with it.
If it's a 6800GT Bug , i am not sure, that i like to live with it.
I was had one super stable - problem free system, even OCed .
I do thanks you about your report, if all the 6800GT cards act the same , i will have to think double times, before i start an RΜΑ form.
But i still hope that there must be a solution to it , other Bios ? who knows ?!!
At MSI at first i made web based asking for help report, but i got nothing.
Now i emailed them too.
Is any other person with a 6800GT totaly healthy around, so to inform as with details of the healthy card ?? Bios ver ..etc etc ..
P4 2.8C @ 3.3GHz 236FSB_ SLK900U+SFII 90mm _ P4C800-E Dlx _ OCZ 3200 R2 1024 tccd _ HEC525W _ MSI NX6800GT TD256 _ NV5 R2 _ 2x RAPTOR 74 Raid1
View Public Profile
Find More Posts by overvolt


text:
Optimal Cluster Association in Two-Tiered Wireless Sensor Networks
Click here to download now
Overview: This paper studies the two-tiered Wireless Sensor Network (WSN) architecture and proposes the optimal cluster association algorithm for it to maximize the overall network lifetime. A two-tiered WSN is formed by number of small Sensor Nodes (SNs), powerful Application Nodes (ANs), and Base-Stations (BSs, or gateways). SNs capture, encode, and transmit relevant information to ANs, which then send the combined information to BSs. Presuming the locations of the SNs, ANs, and BSs are fixed, the paper discusses how to unite the SNs to ANs such that the network life span is maximized while every node meets its bandwidth requirement.


text:
Shows on DVD/ / / /
/ / / Punk Book / /
/ / / / / Punk Book/ / / / / / / Holiday
Specials on DVD / /
/ / / / Classic
Commercials / / / / / TV
Shows on DVD Reviews |
on the title to order - huge discounts and free shipping through Amazon.com! How I Met Your Mother: Season Four 'Mother' and 'Sunny' reflect raunchy nature of modern sitcoms "How I Met Your Mother" (HIMYM) is one of the few current sitcoms that I enjoy. Much of the good humor, as the September 29 blu-ray and DVD release of the fourth season of this show will demonstrate, comes from the raunchy dialogue and plots regarding sexual promiscuity. I want to stress too that my criticism regarding the time slot of the show is a separate issue than my appreciation of the quality of the writing and the acting. I also enjoy the even raunchier sitcom "It's Always Sunny in Philadelphia" (Sunny), the fourth season of which was released on DVD on September 15. I am pairing this show with HIMYM because of their similar natures. Seeing the truly unbridled glee with which highly randy ladies man Barney Stinson of HIMYM spouts PG-13 puns and concocts clever schemes for sexual conquests that will not even last an entire night is hilarious. Having the uber-talented Neil Patrick Harris, who is known for playing innocent young Doogie Howser, in the role is a great bonus. I would love to see Barney talk a character played by one of "The Facts of Life" girls into bed and make a joke about her having taken the good and having to take the bad of being kicked out of his bed now that he was done with her. My primary criticism of HIMYM, which has always aired at 8:00 or 8:30 p.m., is that it should not be on before 9:00 p.m. As old-fashioned as it sounds, the tradition of not having sexually explicit programs on during the "family hour" makes sense. It seems inappropriate that these shows be on when young children are still watching TV. I realize that DVRs and the availability of shows online greatly undermines my argument, but the principle is still the same. The preview disc, which had eight episodes from the fourth season, of HIMYM that was provided for this review show the raunchy elements of the program and how this New York City-based hybrid of "Seinfeld" and "Friends" has taken the format of these shows to the next level. An episode in which former lovers and current roommates Ted the adorkable sincere architect and Robin the gorgeous gun-toting Canadian tomboy and former teen pop star try having meaningless sex to avoid arguing about things such as leaving dirty dishes in the sink and not buying milk is perhaps the best example of the tone of HIMYM. This plot was similar to Jerry and Elaine of "Seinfeld" attempting having a friendship with benefits. However, HIMYM went one step further by having naive attorney Marshall walk in on Robin and Ted in bed twice. Additionally, Ted and Robin entertained their buds with stories about the trivial incidents that prompted their couplings. Robin even commented that she will always leave the empty pizza box on the floor if that leads to sex. The b-story in this episode supports my thesis even better. Marshall admits to George Costanza-style anxieties regarding "making number two" in his office bathroom and uses the euphemism "reading a magazine" in reference to the activity. Barney responds that he "reads a magazine" at the office every day because he has to do it even though it is not pretty. Barney next remarks explicitly that he is referring to masturbation; this is a far cry from the famous reference to "Master of your Domain" in "Seinfeld." Another "Seinfeld" esques element of the fourth season of HIMYM is the "naked man" technique of stripping naked during a first date while the other person is out of the room. HIMYM describes this as a desperate ploy for sex if a date is going badly. Three of the five HIMYM characters attempt this and achieve varying success. As Johnny Carson would say, HIMYM is "good stuff." Sunny is equally good stuff but is on at a more appropriate time. It airs at 10:00 p.m. on the FX network, and I do not think that FX airs reruns any earlier than that. Sunny is about four friends, including brothers Dennis and Dee, with a fraction of the intelligence, education, and income of the HIMYM gang. This blue-collar group owns a dive bar in Philadelphia that largely just gives them a place to hang out. They are joined by Frank, who is the father of Dennis and Dee, played by the hilarious Danny Devito. Episodes from the fourth season included one entitled "Who Pooped the Bed." This involved a mystery surrounding who kept leaving a "present" in the bed that Frank shared with Charlie, who is described as the "wild card" of his quartet. Another fairly explicit episode had Mac tricking models who were auditioning to appear on a billboard for the bar have sex with him and each other to get the job. Dennis kept busy prancing around in his tightie whities to land the job as the billboard's male model. The funniest episode of the season had the gang appear in the hilariously awful low-budget musical "The Nightman Cometh" that Charlie had written. Highlights of this episode include the song lyric "You have to pay the troll toll if you want inside this boy's hole," siblings Dennis and Dee playing love scenes, and simulated homosexual anal rape. The extras on the DVD set include a hilarious live performance of "The Nightman Cometh" by the Sunny cast. The enthusiasm of the audience for the musical and the series was infectious. Anyone with thoughts regarding HIMYM, Sunny, or raunchy shows in general is welcome to e-mail me at email@example.com. Please do share your thoughts regarding this show as e-mail to email@example.com. TV on DVD Reviews: |
TVparty! for TV Shows on DVD! Patrick Duffy of Dallas Interview Review by John Stahl
John Stahl is a freelance legal writer who is also a fan of classic and cult television programs. He can be reached at firstname.lastname@example.com. How I Met Your Mother: Season Four Product Details
From dating dilemmas to career conundrums, the recently engaged Ted and his feisty friends find themselves at the crossroads of young adult life. While newlyweds Marshall and Lily contemplate parenthood, single gal Robin explores the advantages of having "friends with benefits." Meanwhile, the irrepressible, opinionated Barney continues his hilariously dogged pursuit of the fairer sex. As for Ted, his Miss Right is out there, but amid bar brawls, blizzards, and buck-naked strangers, how will he ever find her? Disc 1: 179 Minutes - **Do I Know You? (Season Premiere) **Commentaries Disc 2: 186 Minutes - **The Naked Man **Commentaries Disc 3: 196 Minutes - **The Front Porch **A Night With Your Mother (Academy of Television Arts & Sciences Panel Discussion) PR4 & PR5 Pages for ads - CHEAP! Carol Burnett Show on DVD
Everything you're looking for is here: |
to the menu
Us /
Other Cool TV Sites
TV Blog


text:
US 6947934 B1 Abstract A technique for executing a statement in a computer to manipulate data in a data store connected to the computer. Initially, a statement having an aggregate predicate is received. Then, when evaluating the statement, the aggregate predicate is processed to rank data. Furthermore, evaluating includes performing an extended sort operator with early termination.
Claims(39) 1. A method of executing a statement in a computer to manipulate data in a data store connected to the computer, the method comprising:
receiving a statement having a rank operator for specifying an aggregate predicate; and
when evaluating the statement, processing the aggregate predicate to produce a rank-sorted set of tuples by performing an extended sort on an input stream of tuples using a rank, a group-by list and a scoring expression.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
determining a group round radius; and
when the tuple has a different round radius than the group round radius,
setting the group round radius to that round radius; and
if a desired number of tuples have been identified for the group, freezing the group.
12. The method of
13. The method of
14. An apparatus for executing a statement to manipulate data, comprising:
a computer having a data store connected thereto, wherein the data store stores data; and
one or more computer programs, performed by the computer, for receiving a statement having a rank operator for specifying an aggregate predicate and when evaluating the statement, processing the aggregate predicate to produce a rank-sorted set of tuples by performing an extended sort on an input stream of tuples using a rank, a group-by list and a scoring expression.
15. The apparatus of
16. The apparatus of
17. The apparatus of
18. The apparatus of
19. The apparatus of
20. The apparatus of
21. The apparatus of
22. The apparatus of
23. The apparatus of
24. The apparatus of
determining a group round radius; and
when the tuple has a different round radius than the group round radius,
setting the group round radius to that round radius; and
if a desired number of tuples have been identified for the group, freezing the group.
25. The apparatus of
26. The apparatus of
27. An article of manufacture comprising a computer program carrier readable by a computer and embodying one or more instructions executable by the computer to perform method steps for executing a statement in a computer to manipulate data in a data store connected to the computer, comprising:
receiving a statement having a rank operator for specifying an aggregate; and
when evaluating the statement, processing the aggregate predicate to produce a rank-sorted set of tuples by performing an extended sort on an input stream of tuples using a rank, a group-by list and a scoring expression.
28. The article of manufacture of
29. The article of manufacture of
30. The article of manufacture of
31. The article of manufacture of
32. The article of manufacture of
33. The article of manufacture of
34. The article of manufacture of
35. The article of manufacture of
36. The article of manufacture of
37. The article of manufacture of
determining a group round radius; and
when the tuple has a different round radius than the group round radius,
setting the group round radius to that round radius; and
if a desired number of tuples have been identified for the group, freezing the group.
38. The article of manufacture of
39. The article of manufacture of
Description 1. Field of the Invention This invention relates in general to computer implemented database management systems, and more particularly, to aggregate predicates and search in database management systems. 2. Description of Related Art Databases are computerized information storage and retrieval systems. For example, a Relational Database Management System (RDBMS) is a database management system (DBMS) which uses relational techniques for storing and retrieving data. Relational databases are organized into physical tables which consist of rows and columns of data. The rows are formally called tuples or records; A database will typically have many physical tables and each physical table will typically have multiple tuples and multiple columns. The physical tables are typically stored on random access storage devices (RASD) such as magnetic or optical disk drives for semi-permanent storage. Additionally, logical tables or �views� can be generated based on the physical tables and provide a particular way of looking at the database. A view arranges rows in some order, without affecting the physical organization of the database. In existing database systems, aggregate predicate support is not available. Many applications, however, need a search capability using aggregate predicates. For example, aggregate predicates are needed for the following situations:
In existing database systems, users can limit the results of queries by using standard relational operators (<, <=, =, < >, >, >=) and logical operators (and, or, not). In addition to these relational and logical operators, object relational databases, such as DB2� from International Business Machines, Corporation, also allow users to define predicates that can be used in queries and be exploited by a query optimizer. W. Chen, J.-H. Chow, Y.-C. You, J. Grandbois, M. Jou, N. Mattos, B. Tran, Y. Wang, �High Level Indexing of User-Defined Types,� Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, September 1999, pages 554�564. These predicates are scalar predicates that are true or false for individual values, independent of other individual values. For example, consider a condition such as distance (customer.location, store.location)<5. For the distance condition, given any pair of customer and store locations, the distance condition evaluates whether the distance between the customer and store location is less than 5 or not (i.e., the condition evaluates either true or false), independent of any other customer or store locations. Existing database systems support both scalar functions and a few aggregate functions. For example, some scalar functions are: abs (which returns an absolute value) and sqrt (which returns the square root of an argument). The aggregate functions operate on a collection of values (i.e., a column) and return a scalar value. Examples of aggregate functions include: max (which returns a maximum non-null value in a column), min (which returns a minimum non-null value in a column), and avg (which returns an average of the non-null values in a column). The main difference between scalar functions and aggregate functions is that aggregate functions work over a set of values, while scalar functions take only individual values as arguments. Recently, aggregate functions have been generalized to on-line analytical processing (OLAP) functions. F. Zemke, K. Kulkarni, A. Witkowski, B. Lyle, �Introduction to OLAP Functions,� ISO/IEC JTC1/SC32 WG3-YGJ-nnn, ANSI NCITS H2-99-154, Apr. 12, 1999. OLAP functions are aggregate functions. Each invocation of an OLAP function has an associated window that specifies the set of values over which the OLAP function applies. Unlike functions, existing database systems do not support-aggregate predicates that are true or false of individual values with respect to a given set of values. Many real world applications require aggregate predicates. The following are just some of the common examples:
These examples share some common aspects. First, each example involves an aggregate predicate. For example, one cannot determine if a hospital is closest to a given location without comparing it with other hospital locations relative to that given location. Second, all of the examples require the search based upon an aggregate predicate. In other words, the goal is not to check to see if a given hospital is closest to a location. Instead, we are searching for a hospital (from, possibly, a group of many hospitals) that is closest to a given location. Thus, there is a need in the art for introducing aggregate predicates into existing database systems and to enable search based upon aggregate predicates. To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a method, apparatus, and article of manufacture for a computer-implemented technique for enabling aggregate predicates and search in database management systems. In accordance with the present invention, a statement is executed in a computer to manipulate data in a data store connected to the computer. Initially, a statement having an aggregate predicate is received. Then, when evaluating the statement, the aggregate predicate is processed to rank data. Furthermore, evaluating includes performing an extended sort operator with early termination. Referring now to the drawings in which like reference numbers represent corresponding parts throughout: In the following description of an embodiment of the invention, reference is made to the accompanying drawings which form a part hereof, and which is shown by way of illustration a specific embodiment in which the invention may be practiced. It is to be understood that other embodiments may be utilized as structural changes may be made without departing from the scope of the present invention. Operators of the computer system 102 use a standard operator interface 106 to transmit electrical signals to and from the computer system 102 that represent commands for performing various search and retrieval functions, termed queries, against the databases. In one embodiment of the present invention, these queries conform to the Structured Query Language (SQL) standard, and invoke functions performed by Relational DataBase Management System (RDBMS) software. The SQL interface has evolved into a standard language for RDBMS software and has been adopted as such by both the American National Standards Institute (ANSI) and the International Standards Organization (ISO). The SQL interface allows users to formulate relational operations on the tables either interactively, in batch files, or embedded in host languages, such as C and COBOL. SQL allows the user to manipulate the data. In the preferred embodiment of the present invention, the RDBMS software comprises the DB2� for Universal Database (UDB) product offered by International Business Machines, Corporation. Those skilled in the art will recognize, however, that the invention has application to any database software. When a SQL statement is prepared for execution, the UDB optimizer analyzes the statement and considers the alternative ways to satisfy the request, estimates the cost of each alternative, and then chooses the alternative with the lowest cost (in terms of processing and I/O requests). In doing this, the optimizer generates an access plan for executing the statement. The access plan indicates how the request will be satisfied (e.g., by using an index or joining data from two tables). The access plan can often be depicted as a graph that shows how data flows from one or more tables and/or indexes, through processing nodes (e.g., a join node), and to a result set that satisfies the original SQL statement. At the center of the DB2� for UDB system is the Database Services module 108. The Database Services module 108 contains several submodules, including the Relational Database Service (RDS) 110, the Data Manager 112, the Buffer Manager 114, and other components 116 such as an SQL compiler/interpreter. These submodules support the functions of the SQL language, i.e. definition, access control, interpretation, compilation, database retrieval, and update of user and system data. The present invention is generally implemented using SQL statements executed under the control of the Database Services module 108. The Database Services module 108 retrieves or receives the SQL statements, wherein the SQL statements are generally stored in a text file on the data storage devices 104 or are interactively entered into the computer system 102 by an operator sitting at a monitor 118 via operator interface 106. The Database Services module 108 then derives or synthesizes instructions from the SQL statements for execution by the computer system 102. Generally, the RDBMS software, the SQL statements, and the instructions derived therefrom, are all tangibly embodied in a computer-readable medium, e.g. one or more of the data storage devices 104. Moreover, the RDBMS software, the SQL statements, and the instructions derived therefrom, are all comprised of instructions which, when read and executed by the computer system 102, causes the computer system 102 to perform the steps necessary to implement and/or use the present invention. Under control of an operating system, the RDBMS software, the SQL statements, and the instructions derived therefrom, may be loaded from the data storage devices 104 into a memory of the computer system 102 for use during actual operations. Thus, the present invention may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. The term �article of manufacture� (or alternatively, �computer program product�) as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope of the present invention. Those skilled in the art will recognize that the exemplary environment illustrated in The invention provides the syntax for an aggregate predicate. Additionally, the invention provides access techniques for aggregate predicate search. In particular, the SQL language provides the capability to include a search condition in a SQL query or statement. The search condition (e.g., x<5) results in a BOOLEAN value. The invention extends the SQL language by defining an aggregate predicate that my be included in a search condition of a SQL statement (e.g., in a WHERE clause or a HAVING clause). Once the rank operator is defined, the compiler for the SQL language has to be able to process the rank operator. Therefore, the invention also provides a rk�sort operation (i.e., an extended sort operation), which the compiler includes in an access plan for a SQL statement containing an aggregate predicate. The following description will be organized as follows:
A. Introduction of an Aggregate Predicate into a Database System This invention makes several contributions towards aggregate predicates and search in a DBMS (Data Base Management System). First, the invention extends the SQL used in a DBMS with the concept of aggregate predicates. Aggregate predicates can be used in the same way as the traditional scalar predicates (i.e., relational and logical operators) in queries. Second, the invention designs a flexible language mechanism for aggregate predicates. An aggregate predicate can be either a primitive or a compound predicate (with logical operators). An aggregate predicate operates over a set of values determined by a window specification. Third, the invention designs run time query execution strategies for aggregate predicates that support both ranked incremental retrieval with no explicit bound and ranked incremental retrieval with a specific bound (such as the top 10). Rather than trying to approximate search based upon aggregate predicates, the invention strategies compute results of search based upon aggregate predicates correctly. Fourth, the invention designs indexing and query optimization strategies for aggregate predicates when the rank in an aggregate predicate is computed using only system defined functions. Finally the invention extends indexing and query optimization strategies for aggregate predicates whose rank is computed by a user-defined function. The invention supports extensible indexing with aggregate predicates. There are several advantages of using the present invention, including:
A key advantage of the invention is that users are able to perform search based upon aggregate predicates in database applications and to have better performance. More specific advantages are listed below. First, the introduction of aggregate predicates into the SQL language provides enhanced expressive power for users. While users may be able to simulate some aggregate predicates using application programs or stored procedures that invoke aggregate functions provided by the SQL language, such an approach has a usability problem and performance problem. This is because aggregate functions and aggregate predicates serve different purposes. The purpose of aggregate functions is to compute some scalar value for a set of values, such as max, min, avg, count, or out. The purpose of aggregate predicates is to search for some values that satisfy a particular aggregate property. With aggregate functions, for usability, if a user wants to find the top 5 nearest restaurants, the user has to create an explicit column to store data for ranking of restaurants, and then create a condition on the explicit ranking column. For performance, aggregate functions are always computed. On the other hand, the search based upon aggregate predicates can avoid or limit such computations. Second, by supporting the search based upon aggregate predicates directly, the invention is able to provide a performance improvement for many applications. A simple approach for evaluating an aggregate predicate is to compute the ranking of every possible candidate for the aggregate predicate, and then select only those candidates that satisfy the aggregate predicate. For example, to find the top 5 nearest restaurants, the simple approach will compute the distance between the current location and the location of every restaurant, and then select the top five nearest restaurants with the shortest distances. One embodiment of the invention offers a search mechanism for aggregate predicates that limits the search space, while guaranteeing the correctness of the answers. Third, the invention provides a uniform treatment of the traditional scalar predicates (relational and logical operators) and aggregate predicates. Consequently, the existing framework of indexing and query optimization can be generalized to aggregate predicates. For example, the notions of local predicates and key predicates are equally applicable to scalar and aggregate predicates. Fourth, the invention supports extensible indexing with aggregate predicates for the first time. With the variety of applications, aggregate predicates often involve ranking based upon user-defined functions. In one embodiment, the database system does not decide how to search based upon aggregate predicates. For this embodiment, the invention empowers application developers so that they can take advantage of their domain knowledge to develop effective search strategies for aggregate predicates. Overall the usability and performance advantages from this invention make it possible to apply database technology to a wider variety of applications. B. Language and Semantics of an Aggregate Predicate One embodiment of the invention provides a SQL extension to support aggregate predicates. The approach treats scalar predicates and aggregate predicates in a uniform way so that the existing infrastructure for scalar predicates can be used for aggregate predicates. Consider a scalar predicate, such as c1<c2+1 0. To determine the truth value of the scalar predicate, only the values for c1 and c2 are needed. In contrast, an aggregate predicate needs more information in order to determine its truth value. For instance, in order to find the top five salaries, the following information is needed:
The invention defines a new syntax, aggregate predicate, into the �search condition� of the SQL language. (For simplicity, the following syntax does not illustrate compound aggregate predicates. However, one skilled in the art would recognize that compound aggregate predicates may be used within the scope of the invention.) The extended syntax is as follows:
A predicate may be either a scalar predicate or an aggregate predicate. Furthermore, for an aggregate predicate, the RANK keyword (i.e., aggregate predicate identifier) identifies the scalar-expression as an aggregate predicate. The desired order of the ranking is performed according to the ASC (i.e., ascending) keyword or DESC (i.e., descending) keyword (i.e., an result ordering indicator). The number of desired results is specified in the FIRST clause. If the FIRST clause is missing, all results are output in the specified order. The window-specification in the OVER clause, if present, determines how the aggregation is to be performed (i.e., specifies the set of values over which the aggregate predicate is evaluated). If no aggregation window is specified, the result is aggregated over an entire table. When evaluating an aggregate predicate, initially, all of the required information is captured. Then, further processing, which will be described below, is performed. For one particular example, suppose there is a table called emp, with columns of name, dept, salary, and age. The following example SQL statement requests the top five salaries and the corresponding names:
For the above statement, one way to evaluate the query is to retrieve all records and sort them based on salary. Then, the top five are returned, in descending order. To retrieve the top five salaries in each department, the following example SQL statement may be used:
In the above, the window-specification is dept. Therefore, if there are two departments, the top 5 employees for each department are returned. Aggregate predicates can be used together with scalar predicates. Consider the following example SQL statement:
Since the aggregate predicate and scalar predicate are on the same level, the semantics of the above SQL statement is to find the dept, name, and the salary of employees in each department who earn one of the top five salaries in the department and who is younger than 25. To find the top five salaries among young employees in each department, the following example SQL statement may be used:
Note that when the HAVING clause does not have any aggregate predicates, all scalar predicates in the HAVING clause can be merged with predicates in the WHERE clause if there are no side effects caused by the evaluation of the scalar predicates. Generally, however, such a merge is not performed if the HAVING clause has at least one aggregate predicate.) Even if there is a GROUP BY clause, it will interact with aggregate predicates nicely since aggregate predicates have their own group specification (indicated by OVER). For the salary example, if the top fifth and the top sixth salary are same, in one embodiment, the sixth salary is also included in the answer set. In this case, an additional keyword, such as RANKGAP, is used to indicate that when there are duplicate items (e.g., the same salary) retrieved, they are displayed. In another embodiment, duplicate items are not displayed (e.g., only the fifth salary is displayed, and not the sixth). The above examples have considered isolated aggregate predicates. Just like scalar predicates, aggregate predicates can be combined with others using logical operators, such as AND, OR, or NOT. Notice that such combinations of aggregate predicates are different from those considered by Fagin in R. Fagin, �Fuzzy Queries in Multimedia Database Systems,� Proceedings of the 1998 ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. To support compound aggregate predicates like those in the Fagin article (R. Fagin, �Fuzzy Queries in Multimedia Database Systems,� Proceedings of the 1998 ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems), the following sample syntax may be used:
The above statement is trying to find, for each department, the top five young and high salaried employees. The ranking of a compound aggregate predicate depends upon how the ranking of each component aggregate predicate is combined with each other. In one embodiment, new syntax is defined for giving a particular weight to each component aggregate predicate. (In fact, in the Fagin article cited above, each component aggregate predicate provides a ranking value in the range of [0,1], and then a combination function is used to compute the ranking value of a compound aggregate predicate.) For another example, let distance be a user defined function (UDF) which computes the Euclidean distance between two 2-dimensional points (e.g., in an x-y plane). The following statement finds the nearest 10 ATMs (automatic teller machines) from a given location using an �aggregate predicate� in the WHERE clause of the example SQL statement:
Intuitively, the query engine fetches the tuples in the ATM table and sorts them based on the value of the UDF invocation in the WHERE clause. The top 10 tuples in the sort order are returned as the result. If there are less than 10 records, the entire table is returned. In one embodiment, duplicate tuples are eliminated from the result set, if they appear at the end of the top-10 list. Besides appearing in the WHERE clause, aggregate predicates can also appear in the HAVING clause as shown in the following example SQL statement:
The result set of this statement contains, for each store, tuples which represent the top 10% of customers in terms of their annual income. The WHERE clause specifies the join condition between the two tables, and the HAVING clause specifies the aggregation to be done for each store. C. Extended Index and Access Techniques for Aggregate Predicate Search One embodiment of the invention provides extended index and access techniques for aggregate predicate search. The following is an example in existing SQL language:
To support aggregate predicates, an embodiment of the invention defines a new access plan operator, rk�sort, which is a variation of the SORT node (i.e., an extended sort operator). The rk�sort operator takes four inputs and produces as output a rank-sorted set of tuples. The first argument is the input stream. A designated column for �round radius� is associated with each tuple of the input stream. The concept of round radius is used to facilitate early termination of the rk�sort operation in certain cases where the input stream is divided into multiple rounds such that if, up to round n, there have been at least k tuples with the scoring expression less than or equal to the radius of round n, then the rk�sort for that group can terminate by ignoring the remaining tuples which belong to that group. Intuitively, the search for candidates is performed based on a sequence of �rings� from inside out. The round radius is assigned to a record by someone who understands the distribution of data. Statistics on the data may be obtained by, for example, executing statistics utilities, such as RUNSTATS. The round radius corresponds to a column value (e.g., salary). Once this is done, the access plan will retrieve records based on their round radius for processing. If an index is built on the column value associated with the round radius, the access plan will use the index to retrieve only those records in the round radius of interest. This reduces the amount of records that are processed and sorted. That is, there is early termination of sort. Thus, the technique of the invention improves efficiency. The second argument, rank, is the rank of the search, which determines the group cardinality of the result set. That is, for the example of selecting the top 5 salaries, the rank is 5. The rank is obtained from the numeric-expression (following FIRST) in the aggregate predicate. The third argument, groupByList, is the list of expressions which defines the formation of groups. For example, if employee names are to be selected by department, the groupByList would be department. The groupByList is obtained from the window-specification (following OVER) of the aggregate predicate. The fourth argument, scoringExp, is the expression on the left hand side of the aggregate predicate. For example, salary <50,000 may be a scoringExp. The scoringExp is obtained from the scalar-expression (following RANK) of the aggregate expression. The formal semantics of the rk�sort operator is described by the following pseudo code. rk�Sort(stream(roundRadius), rank, groupByList, scoringExp)=
Note that the term frozen indicates that there is no need to look for more records for this round. The above pseudocode is also described using flow diagrams in D. Query Examples In the following, access plans are illustrated for different aggregate predicate scenarios. In all table scan cases, the round radius passed on to the rk�SORT operator is the infinity value and never changes so that all records are fetched in a single round. The same holds for index exploitation cases, in which the index being exploited is defined on an attribute other than the one from the aggregate predicate. In such cases, there is partial index exploitation to filter out some records, but there is no index exploitation for early termination based on the ranking. In order to be able to fully exploit the index for rank-based early termination, the rk�SORT operator appears immediately after the FETCH operator following an ISCAN, with the aggregate predicate being used as a local predicate. The following is an example SQL statement for a simple aggregate predicate:
The above statement selects the nearest 10 customers to STL (i.e., Santa Teresa Laboratory). Another example SQL statement for a simple aggregate predicate is given below:
The above statement selects the top 10 customers with highest income, and the statement uses a table attribute (i.e., the income column of the customer table) rather than a UDF as the aggregate predicate. Without index exploitation, in access plan 600, the TSCAN node scans the customer table for tuples. The table records and round radius are passed from the TSCAN node to the rk�SORT node. The rk�SORT node evaluates the aggregate predicate, ranks tuples, and pipes the top 10 to the MATERIALIZE node returns attributes from the piped tuples in the final result set. With index exploitation, the ISCAN node scans the customer.loc index for record identifiers (RIDs), using dist(c.loc,:stl) as a local predicate. Additionally, a range generator, which is provided by a user who knows the statistics of the data, provides range data to the ISCAN node. Then, the ISCAN node passes record identifiers and a round radius to the FETCH node. The FETCH node fetches tuples from RIDS and passes table records and the round radius to the rk�SORT node. The rk�SORT node evaluates the aggregate predicate, ranks tuples, and passes the top 10 tuples to the MATERIALIZE node, which returns attributes from the piped tuples for the final result set. The following is an example SQL statement for an aggregate predicate in a Boolean expression:
The above statement selects only the customers with income greater than 50,000 from the closest 10 customers to STL (i.e., Santa Teresa Laboratory). The following is an example SQL statement for an aggregate predicate in a HAVING clause:
The above statement selects 10 customers whose income is greater than 50,000 and who are nearest to STL (i.e., Santa Teresa Laboratory). In particular, the ISCAN node scans an index for record identifiers (RIDs) for records in the customer table using dist(c.loc, :stl) as a local predicate. The ISCAN node passes record identifiers and a round radius to the FETCH node. The FETCH node fetches tuples from the RIDS, using c.income>50,000 as a pre-filter. The rk�SORT node receives the table records and the round radius. Next, the rk�SORT node evaluates the aggregate predicate and ranks and selects the top 10 tuples. These are passed to the MATERIALIZE node, which returns attributes from the piped tuples as a final result set. An alternative is to exploit an index on c.income, rather than c.loc. and then to do the ranked sort in one round. This results in the access plan 900, illustrated in Depending on which index is available, or what the selectivity estimate for each predicate is in case both indices are available, the compiler can choose between the two access plans 800 or 900, or if no index is available, the compiler generates a straight-forward table scan access plan 1000, illustrated in The following is an example SQL statement for an aggregate predicate over a window in a JOIN:
The above statement selects the nearest 10 customers for every store location. The access plans it generates are illustrated in The following is an example SQL statement for an aggregate predicate in a JOIN with a GROUPBY clause:
The above statement selects the top 10 stores serving the customers with highest overall cumulative income. In this case, the index cannot be exploited for early termination because the ranking is based on an aggregate function for each group. That function cannot be evaluated until all records from the group are fetched and sorted, so the ranking has to commence after that and cannot be terminated before the whole table is scanned. If there is an index defined on customer.loc, however, the index could be exploited to filter out some records before the ranking is begun. In particular, one TSCAN node scans a store table for table records and passes these to the JOIN node. An ISCAN node scans an index for record identifiers (RIDs) for the customer table, using (within(c.loc,s.zone)=1) as a local predicate, and passes these, along with a round radius, to a FETCH node. The FETCH node fetches tuples from the customer table using the RIDs and passes these, along with the round radius, to a JOIN node. Next, the JOIN node joins the received records, and passes these on, along with the round radius, to a SORT node. The SORT node sorts tuples by s.id and passes them, along with the round radius, to a GROUPBY node. The GROUPBY node evaluates aggregate functions and groups tuples. The grouped tuples and round radius are passed on to the rk�SORT node. The rk�SORT node evaluates the aggregate predicate, ranks tuples, and passes the top 10 tuples to the MATERIALIZE node, which returns attributes from the piped tuples as a final result set. The following is an example SQL statement for an aggregate predicate with a
For the above statement, suppose that the sizeRating attribute from the store table denotes the size of the customer base of a given store, according to some external rating. The above statement would then return the total sales for the stores from each of the top ten size groups. Even though the aggregate predicate in this case, store.sizeRating, is an attribute, and not an aggregate function as in the previous example, the above statement would not be able to exploit any index on store.sizeRating because the ranking is performed on the group records, not on individual table records. The access plan generated for this statement would, therefore, be identical to access plan 1400, if there is an index defined on store.loc. If there is no index to be exploited, the access plan would be a straight-forward table scan access plan. E. Flow Diagrams Block 1602 represents the extended sort operator initializing the group round number to −1 for all groups. In Block 1604, the extended sort operator determines whether it is the end of stream (i.e., whether all tuples have been processed). If it is the end of stream, the extended sort operator continues to Block 1622, otherwise, the extended sort operator continues to Block 1606. In Block 1606, the extended sort operator fetches the next available tuple in the stream. In Block 1608, the extended sort operator determines whether the target group for the tuple is frozen. If so, the extended sort operator continues to Block 1610, otherwise, the extended sort operator continues to Block 1612. In Block 1610, the extended sort operator discards the tuple and loops back to Block 1604. In Block 1612, the extended sort operator determines whether the round radius in the tuple is different from the group round radius. If so, the extended sort operator continues to Block 1614, otherwise, the extended sort operator continues to Block 1620. In Block 1614, the extended sort operator sets the group round radius to the new round radius. In Block 1416, the extended sort operator determines whether (the number of tuples with scoring expression less than or equal to the current group round radius) is greater than or equal to rank (i.e., the desired number of tuples). If so, the extended sort operator continues to Block 1618, otherwise, the extended sort operator continues to Block 1620. In Block 1618, the extended sort operator freezes the current group (i.e., indicates that no more tuples will be processed for the group). Then, the extended sort operator loops back to Block 1604. In Block 1620, the extended sort operator inserts a tuple into a sorted table based on values in the group by list and the scoring expression. Then, the extended sort operator loops back to Block 1604. In Block 1604, if the end of the stream is reached, the extended sort operator continues to Block 1622 and freezes groups which are not already frozen. Then, the extended sort operator pipes the rank-sorted table to the next stage of the access plan. F. Additional Advantages of the Invention This section provides some additional advantages of the invention. These stated advantages are provided for illustration only and do not represent all of the advantages of the invention. Several approaches have been explored to support aggregate predicates. One approach is to develop indexing mechanisms that target specific applications. For example, evaluation of nearest neighbor queries has been investigated using R-trees in Nick Roussopoulos, Stephen Kelley and Frederic Vincent, �Nearest Neighbor Queries,� Proceedings of the 1995 ACM-SIGMOD International Conference on Management of Data, San Jose, Calif. New indexing data structures have also been developed, such as SS-trees, in D.A. White and R. Jain, �Similarity Indexing with the SS-tree,� Proceedings of the 12th IEEE International Conference on Data Engineering, February 1996, pages 516�523. While this approach works for specific domains, new applications will require new implementations of the usual tree facilities for search, concurrency and recovery. The cost of implementing such trees for a specific application is high. Another approach is to developed generalized search trees that support nearest neighbor and ranked search. This approach is exemplified by the extension of GiST in Paul Aoki, �Generalizing �Search� in Generalized Search Trees.� This approach has the advantage of extensibility by allowing users to control every step of the traversal of a tree. The disadvantage is that such user control is often accomplished through user-defined functions. Invoking a user-defined function at each step of the tree traversal can cause heavy runtime overhead. The third approach is to reduce a top-k selection queries to a normal selection query using a range, e.g., as described by Surajit Chaudhuri and Luis Gravano, �Evaluating Top-k Selection Queries,� Proceedings of the 25th VLDB Conference, 1999. The main problem with this approach is that there is a need to determine a corresponding range query at compile time for a top-k selection query. If the estimate at compile time is not correct, it may not be able to obtain answers to the top-k selection query. The invention described herein has several advantages. First, the invention is extensible in the sense that users can control ranked search, avoiding the shortcomings of a domain specific approach. Second, such control is exercised at a high level in the framework by generating a sequence of search ranges that are used by the underlying access methods. This avoids the runtime overhead of the approach in GiST. Third, the invention is dynamic and incremental. This concludes the description of the preferred embodiment of the invention. The following describes some alternative embodiments for accomplishing the present invention. For example, any type of computer, such as a mainframe, minicomputer, or personal computer, or computer configuration, such as a timesharing mainframe, local area network, or standalone personal computer, could be used with the present invention. The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Rotate |


text:
Share via
As his bestseller The Kite Runner is put on stage, Khaled Hosseini says it has helped explain the tragedy of Afghanistan
Writing is, to a degree, an act of thievery. You adapt experiences and anecdotes — not always your own — for your purposes. I began writing The Kite Runner in 1999, after seeing a news report on the Taleban banning a slew of things in Afghanistan, most of which was to do with public dress. What stuck in my mind was that they had banned kite flying, something I had loved as a child in Kabul. I wrote a 25-page story on a whim then consigned it to the garage until 2001, when my wife encouraged me to revisit it.
The Kite


text:
We can't afford to sit back and let another young (but talented) Florida quarterback get comfortable and play the game of his life. I hope Coach Chizik/Roof and Co. throw the kitchen sink at the young quarterbacks and make life absolutely torturous. They need to be hit all game long and by night's end feel as if Auburn played defense with 13 guys!
4. Fan support. Jordan-Hare needs to be rocking and rolling for a prime-time night game. This is an enormous recruiting weekend and these high-level recruits should leave having experienced a truly unique and raucous setting.
As a player, I used to admire the fact our support never wavered, even during years we made it hard to be Auburn fans. Bring your 'A' game to the stadium Saturday night and support a group coming off of consecutive road games against Top 10 talent.
5. Tackle! Florida's only chance in my opinion is to break the big play. I don't see Florida driving consistently without making mistakes of their own. Auburn can not afford to give away cheap TDs with poor tackling, poor assignment football, poor angles, a short field with turnovers. Florida will give their quarterbacks easy routes to throw and hope their speedy play-makers can be just that. Tackle well, and Florida's offense will struggle.


text:
Neri di Bicci art links
More options
Link to this pageReport a broken link
Neri di Bicci at the Detroit Institute of Arts, MichiganTobias and Three Archangels, 1471 Kress Foundation Collection(Look for the "Image" links for super high resolution scans)Altar Wing with Five Saints, ca.1445Saints Bartholomew and James Major, 1460-70 Museum of Fine Arts, Boston Allen Art Museum at Oberlin College, OhioAltar Wing with Five Saints Ashmolean Museum at the University of Oxford, UK Brooklyn Museum, New York City Cleveland Museum of Art, Ohio Courtauld Institute of Art, London, UKVirgin and Child enthroned with Saint Michael and Saint John the Baptist Harvard University Art Museums, Massachusetts Neri di Bicci in the Los Angeles County Museum of Art Database Philadelphia Museum of Art(Tip: On the zoom-in page, use the slider bar to magnify the image)Saint Thomas Receiving the Virgin's Belt Pomona College Museum of Art, CaliforniaThe Martyrdom of Saint Apollonia, ca.1470 Pomona College Museum of Art, CaliforniaClick on "View objects by this artist" State Museums of Florence Digital Archive, Italy Strossmayer's Old Master Gallery, CroatiaThe Mother of God Holding Baby Jesus The Walters Art Museum, Maryland
Christie's Past Sale Archive NEW!(database goes as far back as 1991; images go about as far back as 1999) Sotheby's Sold Lot Archive NEW!(database goes as far back as 1998; images where permitted by copyright go about as far back as 2001)
Neri di Bicci in the Art Renewal Center Neri di Bicci at CGFA Neri di Bicci in the Web Gallery of Art Wikimedia Commons Image Database Bildindex der Kunst und Architektur (in German) (a welcome screen is displayed for a couple of seconds before the search results appear) University of Michigan SILS Art Image Browser Additional Image Search Tools: NEW! (SafeSearch set to "strict"; go to Advanced Search (Flickr/Google) or Preferences (Bing) to change) Flickr: "Neri di Bicci" All Images Image Use Allowed Commercial Use Allowed Google Images: "Neri di Bicci" All Images Labeled for Reuse Labeled for Commercial Use Bing Images: "Neri di Bicci"
The Modernist Journals Project(Click "Retrieve Images" to see artworks)
Union List of Artist Names (Getty Museum) Reference sheet with basic information about the artist and pointers to other references.
Search Amazon for books related to Neri di Bicci Search AllPosters for reproductions of works by Neri di Bicci
We cannot be responsible for the content of external web sites.All images and text on this Neri di Bicci page are copyright 2011 by John Malyon/Specifica, Inc., unless otherwise noted. Note that the listings on this site are a unique compilation of information and are protected by copyright worldwide.


text: Slow and Positive Job Growth for Women and Men Continues in April According to IWPR analysis of the May employment report from the U.S. Bureau of Labor Statistics (BLS), job growth continued in April with 115,000 jobs added to nonfarm payrolls. In April, women gained 84,000 jobs (nearly three-quarters of jobs added) and men gained 31,000. |


text:
Dow AgroSciences' supportive, family-friendly programs help you maintain a healthy balance between work and family life. To learn more, select a program from the list below.
HolidaysPersonal Choice Days
New Hire Vacation Schedule
Regular Vacation Schedule
Family and Personal Leaves of Absence
Child Daycare Facility
Lactation Support Stations
Adoption Assistance
Dependent Care Reimbursement Accounts
Employee Assistance Program
Child and Elder Care Referrals
Fun and Fitness
Fitness Center
Credit Union and Discount Event Tickets
Nature Trails/Forest Preserve
Dress Code
Eligible employees receive the following company holidays:
- New Year's Day
- Good Friday
- Memorial Day
- Independence Day
- Labor Day
- Thanksgiving Day
- Friday after Thanksgiving
- Christmas Eve
- Christmas Day
- New Year's Eve
Personal Choice Days
Personal Choice days offer eligible employees a way to take time off for birthdays, religious holidays or extra vacation time without using vacation days. During each year that you work for The Dow Chemical Company ("Dow"), you may take a maximum of two Personal Choice days that:
- must each be taken as an intact eight hours off,
- cannot be carried over into the following year,
- are your choice (not determined by work group or site), and
- cannot be chosen, then worked for Holiday Pay
New Hire Vacation Schedule
The New Hire Vacation Schedule applies to eligible new hires that accept a regular full-time salaried position with Dow. The vacation is based on an 8-hour workday. Vacation for less-than-full-time employees will be prorated based on hours worked.
The chart below lists the total vacation you will receive for the first two years of your employment (hire year and following year).
Hire Month |
Year 2 Vacation Days |
January |
10 |
12 |
February |
9 |
12 |
March |
8 |
12 |
April |
8 |
12 |
May |
7 |
12 |
June |
6 |
12 |
July |
5 |
12 |
August |
4 |
12 |
September |
3 |
12 |
October |
3 |
12 |
November |
2 |
12 |
December |
1 |
12 |
Regular Vacation Schedule
For eligible employees, the regular vacation schedule goes into effect after their first full calendar year (January 1st through December 31st) of Dow employment. The vacation is based on an 8-hour workday. Vacation days are granted on January 1st of each year for that year.
Years of Service |
Vacation Days |
May Borrow (Days) |
2 |
12 |
5 |
3-4 |
13 |
5 |
5-9 |
18 |
5 |
10-14 |
20 |
5 |
15-19 |
22 |
5 |
20-24 |
25 |
10 |
25-29 |
27 |
10 |
30+ |
29 |
10 |
- Any number of days may be carried over with supervisor approval
- Upon termination, the amount of carryover vacation that will be "paid in lieu" (unless located in California) is:
- 19 years of service or less: 40 hours maximum
- 20+ years of service: 40 hours maximum
A standard 9-5 workday isn't the ideal arrangement for all employees. Therefore we have options, such as flextime, which allows people to come in earlier or later than the standard 7:30 a.m. start time and adjust the rest of their day accordingly.
We also have less-than-full-time employment, with management approval, for employees who have been employed at least one year.
Family and Personal Leaves of Absence
Dow AgroSciences realizes that sometimes employees may need an extended period away from work to deal with personal issues or support family, to participate in political or military activities, to invest in additional education or just to take a sabbatical. We help satisfy this need with our family and personal leave policies. Again, management approval is required. Leaves can range in duration from less than 90 days up to more than two years, in some cases.
Child Daycare Facility
Dow AgroSciences global headquarters site offers preferred access to two first class daycare facilities located a short two minute drive off the main campus. This makes having lunch with your son or daughter and keeping them more integrated into your life an option.
Lactation Support Stations
Dow AgroSciences tries to make the return to work after a pregnancy as easy a transition as possible by making private lactation stations available in our Occupational Health Department for our breastfeeding mothers.
Adoption Assistance
Adoption of a child is a special time for any family. Dow AgroSciences will reimburse you for expenses such as eligible legal and medical costs that are related to the adoption of a child, up to a maximum of $3,000 per child. Dow also offers Adoptive Leave with full continuation of salary and benefits. This provides up to four weeks paid Adoptive Leave for an employee where there is no other parent available in the home.
Dependent Care Reimbursement Accounts
Dependent care, whether it is for a child or an adult incapable of self-care, is an expense many employees face today. Our program allows you to contribute from $100 to $5,000 a year to pay for these expenses with pre-tax dollars.
Employee Assistance Program
Our Employee Assistance Program provides confidential counseling services through an outside vendor to employees and their families to assist in dealing with any personal issues or problems. There are a variety of services available as part of this package including Traditional Short-Term Counseling, Long Term Counseling Referral, Child and Elder Care Resources, Legal Counseling/Referral Services and Financial Counseling Services.
Child and Elder Care Referrals
Child and elder care referrals are available through our Employee Assistance Program.
Fun and Fitness
Taking time for yourself is essential for a balanced life. You'll have lots of these opportunities at our global headquarters site in Indianapolis. We have volleyball and basketball courts…we have hiking trails and picnic tables. And we have a stocked lake just waiting to be fished. You'll see many of our employees taking advantage of these activities during their lunch hours.
Fitness Center
Our state-of-the-art Employee Development Center (EDC) has a fitness center offering not only basic exercise equipment, but also other fitness programs such as aerobics, kick boxing and yoga. Fitness classes are held at convenient times either over lunch or directly after work. The Fitness Center is staffed by personnel from the National Institute of Fitness and Sport who can you help design a fitness program to meet your individual needs. Or you can relax with a 15-minute massage available on Fridays.
Meet with a nutrition consultant at the EDC to establish your weight goals or to discuss eating habits for you or your children. You can also learn more about cholesterol, anemia or diabetes and other nutrition topics.
Credit Union and Discount Event Tickets
As an employee of Dow AgroSciences, you can join the NorthPark Community Credit Union (formerly known as Dow Employees Credit Union), which offers online banking, checking, savings, and low rate loans. In addition to having an ATM, the credit union in the EDC offers discount event tickets for movies, amusement parks, local entertainment events and many other things.
Nature Trails/Forest Preserve
A large part of the 325-acre site is set aside as a forest preserve, with nature trails and wildlife. A section of the land has been restored to the growth of natural prairie grass, which once flourished across the Midwestern United States.
Dress Code
No need to stress out over what you are going to wear at Dow AgroSciences – dress is always "business casual/business appropriate" year round.
Please keep in mind…
- This information is intended only as an overview for quick reference purposes. Many details and provisions of the various plans and policies have been omitted. If there are discrepancies between this information and the plan documents, summary plan descriptions, certificates of insurance, or other official documents, such documents shall govern.
- Availability of some plans and programs and benefits coverages may differ for certain bargained-for groups.
- The Dow Chemical Company reserves the right to amend, modify and terminate any plan, program or policy at any time, at its sole discretion.


text:
Keep bones strong, healthy
There are 20 comments on the Jul 17, 2006, Iowa City Press-Citizen story titled Keep bones strong, healthy. In it, Iowa City Press-Citizen reports that:
If you have not been affected by osteoporosis, you probably know someone who has been.Join the discussion below, or Read more at Iowa City Press-Citizen.
United States |
Jul 22, 2006
Our M.D. tells us that calcium alone will not replace the bone loss in osteoporosis cases.
What he didn't tell us was that Dolommite is a natural, perfect blend of calcium and magnesuim, which, when taken in daily supplements of at least 1200 MB or more, in combination with the mineral Strontium salts,(600-700 Mg daily, on an empty stomach), may increase bone mass in the vertebrae of people with osteoporosis. There is research that Strontium has been shown to promote strong ostoporosis-resistant bones. A member of my family is taking the above daily. Reference: Preventing & Reversing Osteoporosis-Gaby,AR-Published 1994 |
Canada |
Sep 15, 2006
Very true, I just started using another product AlgaeCal ( http://www.algaecal.com ) a while ago and had very good results on my last dexa scan!
Sydney, Australia |
Sep 16, 2006
The latest study in the british medical Journal has shown that calsium supplements do nothing to build stronger bones. That story was in the paper yesterday so I am sure it would be easy to find if you went to their site.
Sep 20, 2006
i have heard that the best absorbable calcium is an asporotate. Also I am taking Strontium citrate 2 times 340mg at nite.
Oct 23, 2006
Itis Oct.06 and I need feed back from other people who take natural bone building products. How long have you been taking algaecal? what else do you take with it? |
Oct 24, 2006
I've read about that. What I give my patients is a calcium blend containing other minerals that have been shown to increase bone density and quality. Results have been impressive. http://naturalwomanshealth.com/Osteoporosis/... |
Australia |
Nov 19, 2006
Guys did you know that the latest research on women consuming too much cola shows that lose their bone density and are at high risk for ostepporosis!!!!! The messag ehere -- dont drink too much cola... it will eat away at your bones. I found this site which shows this:
http://www.vitalhealthzone.com/nutrition/late... |
Feb 10, 2007
My first dexa scan in 1998 showed left hip mild osteopenia with t-score of -1.37. year 2000 showed -1.0. Now 7 years later t score is -1.2. My primary dr wants me to go on fosamax. I want to try the AlgaeCal....Does anyone have an opinion of this decision?? I feel I can do better NOT taking fosamax or any oth4er prescription bone building product... Thank you!
Sep 4, 2007
I have been diagnosed with osteopenia with my femurs on the verge of osteoporosis. Have tried Actonyl (several doses) and most recently Boniva (one dose). These meds did cause gastric upset (I have ulcers). I do want to try AlgaeCal and wondered if anyone else has had good results on the supplement. |
Sep 9, 2007
The exercise video "Skeletal Fitness" by Mirabai Holland has good weight bearing routines to increase bone density. See http://www.movingfree.com/SkeletalFitness.htm...
Since: Sep 07 2 United States |
Sep 22, 2007
I recommend http://www.hyperimmuneegg.org to all my patients. This is the scientific website. My ordering website is http://www.yourimmunehealth.com
Hyperimmune egg also known as i26 has been clinically proven to balance the immune system and takes you beyond nutrition. Your joint health is related to your immune system. For more info about how to use this all natural product contact Dr. Hellen Greenblatt, Phd. She has a dual doctorate in immunology and microbiology and is available to talk to people around the world. 800-746-0300. Tell her Dr. Nancy sent you. |
United States |
Sep 25, 2007
True, calcium/magnesium does help with strenthening the bones, but other things factor in also. The number one thing that really can affect your bones and back pain is eating too much sugar. It depletes the body of vitamins and minerals. It also affects the absorption of calcium and magnesium.
http://www.herniated-disc-treatment.com |
Australia |
Oct 18, 2007
By the way, in terms of osteoporosis, there is more than just calcium that is necessary for bone health. The following are just as important:
Vitamin D Boron Magnesium Phosphorus Plus, women are also recommended to keep exercising, especially weight-bearing exercise that provides any resistance-type of exercise (light weights, pilates, etc) to help the bones keep their mass and prevent osteoporosis. This is especially true for women over 50, or any women that have undergone menopause, as that is the high risk time for this condition. To understand what conventional and alternative treatment there are for this condition, look at the link below (sorry but you cant buy anything on this site, it's only information): http://www.vitalhealthzone.com/health/conditi... Samantha |
Nov 18, 2007
Dolomite is an inferior form of calcium and, if you research Strontium, you'll learn that it must be taken inbetween the consumption of calcium supplements. My bottle of strontium also directs this. STrontium is used in Europe for the treatment of osteoporosis. Good forms of calcium are citrate and hydroxapatite. Remember equal amounts of magnesium should be taken with calcium supplements. Other nutrients that help with calcium absorption are silica, boron, D3 and Vit. K1 and 2. |
Since: Nov 07 3 Guadalajara, Mexico |
Nov 22, 2007
there is more important things thatn just clacium for bone health like Vitamin D,Boron,Magnesium and
Phosphorus but the suplement i have been taking has all of these properties and more, and has been proven to improve bone health. algaecal( http://www.algaecal.com ) is where i get all my tips and supplements that help imorve my lifestyle |
Australia |
Feb 28, 2008
I need feed back on people who are taking FosamaxPlus. My Dr wants me to go on this. Anyone taking alggaecal with comments as I am thinking of trying it. Have recently been diagnosed with Osteoporosis of the hip. My dentist tell me if I go on Foramax I will not be able to have any extractions due to Necrosis of the Jaw Thank You
United States |
Feb 29, 2008
Check this site out for some useful information.
Osteoporosis, or porous bone, is a disease characterized by low bone mass and structural deterioration of bone tissue, leading to bone fragility and an increased susceptibility to fractures of the hip, spine and wrist. Although often characterized as a woman's disease, men as well as women suffer from osteoporosis. http://www.herbalwartremoval.com/osteoporosis... |
United States |
Mar 1, 2008
Facts about Osteoporosis, Risk factors that cannot be changed:, Risk factors that can be changed:, Symptoms, Detection, Complications, Reducing Your Risk, Medications Used to Treat Osteoporosis, Reducing the Risk of Falling, Prevention, References,
http://www.herbalwartremoval.com/osteoporosis... |
Mar 8, 2008
There is a natural solution with no side effects. Natural Option corp has developed a calcium supplement to help osteporosis sufferers. Look and read for yourself. http://www.naturaloptioncorp.com
May 11, 2008
Too much vitamin A is not good either. There's a good summary of this issue at www.vitaminA.org .
Add your comments below
Nutrition Discussions
Title | Updated | Last By | Comments |
Why do I often crave eating clay? (Jan '09) | 18 hr | georgie | 8,952 |
School Leaders Fire Back Against Claims Of Unhe... (May '10) | Thu | Robert Anderson Phd | 17 |
'My 600-Lb. Life' takes viewers on 'Joe's Story... | Wed | justMe | 6 |
Paltrow cuts back for food stamp challenge | Apr 11 | Dfinnnley22 | 2 |
Families pump up nutrition, exercise know-how | Apr 6 | FREE FRIED CHICKEN | 4 |
Obese children may have a harder time tasting f... | Apr 5 | stephenpe | 22 |
Northeast, Blue Cross team up for 'fitNEss' | Mar 28 | Why teach | 1 |
Find what you want!
Search Nutrition Forum Now
Copyright © 2015 Topix LLC