text:
LED Lights Urgent Help Please
Hi I am building an 18' x 34' pool and was wondering how many LED lights to install. 2 or 3? I don't want any dead/black spots. Is 3 overkill? Thanks.
Is this just a rectangular pool? Also, it depends on what LED lights you are using to determine the count.
Hi it is a 18 x 34 rectangular pool. It is 8.5 deep and has 3 stairs along the full width of the pool. They are going to use Rainbow Rays Aqua LEDs. Do you think 3 LEDs would be over kill or will it light the pool evenly and nice. Thanks.
I'm not familiar with those lights in particular.
I will however say that I have never heard of a client complaining about a pool being too bright, but have seen multiple people on this board wishing they would have done one more.
Id go with three....worst case scenario: you disable the middle one if it's too bright. I don't believe you can put a dimmer on LED lights, but you may ask your builder specifically.
Looks like a newer brand. I haven't heard of them. I will be watching this thread on how they preform.
They don't claim to be as powerful as the major brands.
I don't see a niche listed in the parts or products listings.
It appears to be a sinker. The Winterizing section of the manual suggests letting it sit below the ice line or removing the bulb. This makes Jazz lights a PITA to work with so I would expect more of the same, just significantly less weight.
Are you in Canada? The manual shows a Canadian company.


text:
Mariners' Sanchez passes away at 20A month after suffering from a head injury in a swimming accident off the coast of Venezuela, Mariners right-handed prospect Victor Sanchez passed away on Saturday, according to MLB.com. MORE »
Astros prospect Correa collects three more hitsCarlos Correa, the third-ranked prospect in baseball, went 3-for-4 with a stolen base for the Astros on Saturday. The 20-year-old shortstop is now 14-for-41 in the Grapefruit League. MORE »
Report: Thorpe needs Tommy John surgeryTwins pitching prospect Lewis Thorpe, who was shut down in September with a sprained ulnar collateral ligament, will undergo Tommy John surgery, reports indicated on Saturday. MORE »
Phillies' Nola fans four in Spring Training debutPhillies No. 2 prospect and 2014 first-round pick Aaron Nola pitched three scoreless innings, striking out four, in his Grapefruit League debut Friday against the Yankees. MORE »
The greatest hits from last season's road tripsAs Benjamin Hill prepares to unveil his 2015 road trip itineraries, he looks back on his best and most ridiculous experiences visiting ballparks around the country last season. MORE »
Mariners lefty Rollins suspended 80 gamesMariners No. 26 prospect David Rollins, acquired in the Rule 5 Draft from Houston, will miss 80 games this year after testing positive for a performance-enhancing drug. MORE »
Prospects Lindor, Owens reassigned to MinorsTop Indians prospect Francisco Lindor, Henry Owens of Red Sox and two Top-100 Cubs prospects were assigned to their organizations' Minor League camps Thursday. MORE »
Royals' Finnegan begins climb back to big stageAfter a historic rise in his first pro season, Royals southpaw Brandon Finnegan is looking to return to the big league stage but first must make a stop in the Minors. MORE »
Reynolds, Bowman pave way to Mets' victoryMatt Reynolds homered and plated three and righty Matt Bowman spun five scoreless frames in the Mets' 8-3 Grapefruit League win over the Nationals. MORE »
Phillies' Crawford out with strained obliquePhillies' top prospect J.P. Crawford, who was expected to open at Double-A Reading or Class A Advanced Clearwater. will miss four to six weeks with an oblique strain. MORE »
MiLB announces ump school changesMinor League Baseball today announced new names and logos for the organization's umpiring and umpire training entities. MORE »
Astros' Correa, Dodgers' Pederson go yard in winsNo. 3 overall prospect Carlos Correa homered and added an RBI double to lead Houston to victory, while No. 14 Joc Pederson belted his fourth of the spring in Los Angeles' win. MORE »
Ottavino rolled with punches to stick in bigsAdam Ottavino once was a starter in the Cardinals organization. But he found a home in the bullpen and then with the Rockies that enabled him to stick in the Majors. MORE »
Report: Magee forsakes football for Red SoxOn Tuesday, Brandon Magee was a linebacker with the Tampa Bay Buccaneers. On Wednesday, he reportedly was headed to Fort Myers, Florida to be an outfielder for Boston. MORE »
Twins' Buxton, Sano 'rusty' but improvingMinnesota's top two prospects, Byron Buxton and Miguel Sano, are both "rusty" after injuries ruined 2014, but the Twins are encouraged that they'll both be ready for strong seasons. MORE »
Another day, another homer for Cubs' BryantCubs' top prospect Kris Bryant slugged a solo home run, his ninth of the spring, as Chicago was routed by Oakland, 14-2, in Cactus League action Tuesday. MORE »
Hedges, Montas among prospects sent downNo. 2 Padres prospect Austin Hedges and No. 3 White Sox prospect Francelis Montas were both sent to Minor League camp by their respective organizations Tuesday. MORE »
Minor Leagues announce pace-of-game rulesMinor League Baseball today announced rules and procedures aimed at improving the pace of play in games at the Triple-A and Double-A levels. MORE »
Minor Leaguers on what it's like to be a fanIt can sometimes be easy for fans to forget that their favorite pro athletes are only human. That's a mistake Minor Leaguers who love watching other sports rarely make. MORE »
Rangers' Gallo, Astros' Appel among roster cutsTexas Rangers third baseman Joey Gallo and Houston Astros pitcher Mark Appel were among the top prospects assigned to the Minors on Monday afternoon. MORE »

subset: commoncrawl


text:
Yoga is a unique science which provides a very balanced, integrated and scientific approach of life
YOGA CENTERS- FOR SPIRITUAL ENRICHMENT Yoga is a unique science which provides a very balanced, integrated and scientific approach of life CLARE ISLAND YOGA RETREAT, IRELAND Set on 240 acres of land on the eastern end off the coast of Ireland, the center run by perfect yogis is perfect for spiritual enrichment. THE ASHTANGA YOGA RESEARCH CENTRE , UBUD Located in Nyuh Kuning Village of Ubud , Bali , this center of choice for an eclectic mix of yoga teachings. Various sessions are practised on Ashtanga Yoga, Ayurveda and Tantra, step-by-step. SIVANANDA YOGA VEDANTA DHANWANTHARI ASHRAM, KERALA Situated on the premises of Neyyar Dam, Kerala, the green coconut tree groves, lake views, all offer an ideal atmosphere for a perfect yoga session. Various classes are conducted to promote the science of Yoga for physical, mental and spiritual well-being. . PURPLE VALLEY ASHTANGA YOGA RETREAT, GOA On the beaches of the Arabian Sea, this yoga centre is a peaceful heaven for Yoga practitioners. The centre specializes in Ashtanga yoga courses. YOGA MEANS THE UNION OF MIND AND BODY WITH THE GOAL OF BEING SPIRITUALLY AWAKENED. Be sure to find some inspirational yoga centers
Pages to are hidden for
"Yoga Centers- for spiritual Enrichment"Please download to view full document


text:
|Check-In Resources
All check-in resources are available on this page by department.
Spring 2015 Estimated Bill Information:
Business Office:
In order to avoid long lines and delays upon your return for the Spring 2015 semester, it is recommended that you clear your account before the check-in date January 4, 2015. Clearing your account early is highly recommended, as this will expedite your wait time.
Business Office Forms
Financial Aid:
Student Services:
NEW STUDENTS - Complete the Medical Information ONLINE!
Registrar's Office:
Public Safety:


text:
Strange Bedfellows -- Politics News
News about Seattle and King County government as well as national politics.
Posts filtered on Category
Seattle mayor's race: The money chase is on
Two candidates in Seattle's mayor's race, City Councilman Tim Burgess and State Sen. Ed Murray, raised far more money than incumbent Mayor Mike McGinn as 2012 came to an end and City Hall candidates revved up to run in the year ahead. Burgess raised $75,062, bringing his total collected to $100,972, and had $81,502 on […] [Read More]
Politics: Bloopers and dubious achievers of 2012
"When I make a mistake, it's a doozy," New York Mayor Fiorello LaGuardia said a couple generations ago. Washington saw its share of doozies in 2012 as politicians stumbled over their tongues, campaign committees blew millions of dollars and an embarrassing email torpedoed a Senate candidacy as it was leaving port. [Read More]
Senators: Down the slopes as U.S. goes over fiscal cliff
The two Republican U.S. senators from Utah have scheduled fundraisers on the ski slopes in the first days of January, just as America is likely to be headed over the fiscal cliff. On Jan. 3, the day that the new Congress takes office, Sen. Mike Lee, R-Utah, will hold a "Ski Day" at Park City, […] [Read More]
Seattle mayor's race: Early money raising totals
The first fund-raising totals are out in a 013 Seattle Mayor's race began before all votes from the 2012 election were counted: They show prominent donors already taking sides or, in memorable words of one well-connected attorney, "investing in politics." City Councilman Tim Burgess, less than two weeks in the race, has taken in $25,910. […] [Read More]
'Dark money' group, exposed in California, spent big bucks here
The brightest light yet shining on "Dark Money" in American politics comes courtesy of a ruling Sunday by the California State Supreme Court. The supremes from the Golden State forced a secretive Arizona-based outfit called Americans for Responsible Leadership to disclose the source of the $11 million it has spent on a California ballot measure. […] [Read More]
Axelrod to shave mustache if Obama loses Pa., Michigan or Minnesota
President Obama needs to carry Pennsylvania, Michigan and Minnesota next Tuesday, at least by a hair, or he is likely to lose the American presidency, and senior adviser David Axelrod will lose the mustache he has worn for the past four decades. Axelrod was on MSNBC's "Morning Joe" on Wednesday and queried by host Joe […] [Read More]
Obama, Romney "weatherproofed" until Hurricane Sandy: McKibben
The 2012 presidential candidate has been "weatherproofed": Climate change rarely came up — with not one question in the three Obama-Romney debates — despite July being the hottest month on record, 2012 shaping up as the world's warmest year, and the fact that Berack Obama and Mitt Romney campaigned through states hit by a great, […] [Read More]
$2.5 million from Chevron USA to Republicans
Big Oil is gassing up the tank for Republicans in Congress during the closing days of the 2012 election campaign. Chevron USA, the No. 3 company on the Fortune 500 list, has donated $2.5 million to the Congressional Leadership Fund, a "SuperPAC" designed to maintain Republican control of the U.S. House of Representatives and win […] [Read More]
A 2012 money milepost: Obama passes $1 billion mark
President Barack Obama has become the first $1 billion candidate in American political history in an all-rules-are-off campaign in which America's 44th president is likely to find himself outspent. With $90.5 million raised in the first half of October, the total take for Obama for America, the Obama Victory Fund and the Democratic National Committee […] [Read More]
Obama backs Referendum 74 — same sex marriage
President Obama, whose position on same-sex marriage "evolved" into support last May, has endorsed Referendum 74 on the November ballot, which would make Washington the nation's seventh state to enact marriage equality. "While the president does not weigh in on every single ballot measure in every state, the president believes in treating everyone fairly and […] [Read More]
Show More


text:
"This card is simple and to the point, just the way we want it. Although the corner of the save the date column looks a bit funny, we still like the simplistic style to this card.
The only complaint we have is actually how the save the date portion is positioned on the left on almost all the save the date cards' design, except for this "Label of Love" one!!!. We originally were going with "Best Date Ever Save The Date", because the save the date portion looks simpler and the fonts for the date are much bigger and eye catching. But the problem with most of the one-photo save the date cards on this website is that the "save the date" portion is almost always on the left. It is already hard to decide on what's our favorite photo to put on a save the date card, having to pick a photo that fit the design just adds another layer of complication."
"I love everything in the cards paper, style, pictures, shipping the only thing don't like is the company logo on the bottom of the cards. I think for special cards and invitation shouldn't show the logo unless it's a free Or promotional product but when you paid for the product shouldn't be there. I can't take off when I'm edit the cards."
"The Save the Dates were perfect! Very good card stock and they arrived quickly, exactly as described and the way they appeared online!"
"This last order was fantastic. The card was clear and very readable (for old folks). Unfortunately the first order I placed, I chose the wrong font for the writing and it was not readable on the card! I did not have time to reprint them then, but this reprint is beautiful! I'll have to remember that when I place the order for the actual invitations!"
"These save the dates were absolutely lovely! Perfect for our laidback beach ceremony without being the "typical" beach theme!"
Personalized save the date cards are the perfect way to get all of your friends and family ready for the big day. Shutterfly's save the date cards are available in a selection of designs, colors and scripts. Personalize your save the dates with a photo or collection of photos and message to let your guests know the details of your wedding. Don't forget to check our other personalized wedding cards and stationery for your big day, including wedding announcements, wedding thank you cards and bridal shower invites.


text:
Take a look inside 534 Crestline in Brentwood, an astonishing estate with elaborate spaces for relaxation and comfort. It also has rather unique features including, not one, but two movie theaters. This episode... Watch »
We're with LA-based designer Christopher Grubb to check out one of his latest projects, a backyard makeover in Beverly Hills. Christopher transforms the space into a chic, stylish entertaining area. This episode... Watch »
Don't miss an all-new Open House this weekend on NBC! Check local listings for air times in your area. Watch »
Just an hour outside New York City, you'll find a magnificent, colonial home known as Sugar Hill Farm. It dates back to the 1700s and is an artful marriage of old and new. It even features a working barn.... Watch »
Let's take a tour of 32 Grove, a townhouse in West Village. Built in the 1850s, some of the architectural elements from the past are still perfectly intact, including original, ornate plaster, gla... Watch »
We're in San Francisco at 2604 Pacific Avenue at a home with one of the best views in the city. This Victorian home was remodeled, but kept its elaborate period features from the late 1800s. This episode of Open... Watch »
Our partners at Coldwell Banker are launching a new campaign aimed at shining the spotlight on man's or woman's best friend. Watch »
Up-and-coming interior designer Anna Burke, who is known for making homes look collected and not decorated, incorporates clean and classic sensibility into her client's Upper East Side home. Take a lo... Watch »
Don't miss an all-new Open House this weekend on NBC. Check local listings for air times in your area. Watch »
She's known for putting together covet-worthy looks and her store, Elyse Walker Boutique, in Pacific Palisades, is stocked with the latest trends from top designers. It's no surprise her own personal closet... Watch »


text:
Win great prizes from the world of film.
Preview: Glasgow Film Festival 2014
The Grand Budapest Hotel and Under the Skin bookend the 10th GFF as its home venue, Scotland's oldest arthouse cinema, celebrates its 75th birthday.
Samuel Wigley
Thursday 20 February 2014
Bigger and even better: The Godfather Part II
With towering performances from Pacino and De Niro, the second Godfather movie is a sequel without equal and a high-water mark of American cinema.
Geoff Andrew
Thursday 20 February 2014
Complete Studio Ghibli feature season announced
As Hayao Miyazaki presents his final film The Wind Rises, BFI Southbank launches a complete Studio Ghibli feature film retrospective from April-May 2014.
Wednesday 19 February 2014
Programme announced for newly titled BFI Flare
A new name, new platforms and the full programme is announced for our long-running London Lesbian and Gay Film Festival.
Wednesday 19 February 2014
The Umbrellas of Cherbourg turns 50
It's 50 years since Jacques Demy's all-sung musical romance premiered in Paris and made a star of Catherine Deneuve.
Samuel Wigley
Wednesday 19 February 2014
Behind the scenes: The Godfather trilogy
17 rare shots of Marlon Brando, Al Pacino and Francis Ford Coppola in production on one of film history's greatest trilogies.
Tuesday 18 February 2014
BAFTAs 2014: the winners in full
12 Years a Slave named best film, but Gravity tops the table with six awards at this year's BAFTAs.
Samuel Wigley
Sunday 16 February 2014
Berlinale 2014: In defence of Latin languors
Could Berlin's quartet of Latin American competition entries be more red-blooded? Demetrios Matheou pleads for restraint.
Demetrios Matheou
Friday 14 February 2014
Shooting the message #14: Barford Productions
Barford Productions' comms films have been seen by everyone from Tony Blair's cabinet to Guinness trainees learning how to pull the perfect pint.
Patrick Russell
Friday 14 February 2014
Nick James considers technological creep and its creepy effects in Spike Jonze's marvellously unsettling cybernautical romance.
Nick James
Friday 14 February 2014
Win great prizes from the world of film.
Back to the top
©2015 British Film Institute. All rights reserved. Registered charity 287780.
Subscribe now for exclusive offers and the best of cinema.


text:
Upgrade your geek with Dwight Silverman
Posts filtered on Tag
Linkpost | 7.17.2013
• Spygate Lawsuit Accuses NSA of Unconstitutional 'Dragnet Electronic Surveillance' – A broad coalition of groups sues the NSA in the wake of disclosures about its electronic surveillance. • Responding to government legal demands for customer data – Microsoft again details, as much as it legally can, what it does and does not provide to […] [Read More]
Linkpost | 7.14.2013
• Nations Buying as Hackers Sell Computer Flaws – Flaws found in software can sell for as much as $150,000. • Has Patent, Will Sue: An Alert to Corporate America – The NYTimes profiles the patent troll who filed more lawsuits last year than anyone else. • One Microsoft: will Ballmer's big reset mean better […] [Read More]
Linkpost | 7.13.2013
• AT&T to acquire Leap Wireless in $1.2 billion deal – Leap Wireless is better known as Cricket. AT&T's in it for the spectrum and getting further into the budget phone market. But AT&T agrees to buy Leap Wireless: Will regulators let this one through? • How the U.S. is forcing Internet firms' hands on […] [Read More]
Linkpost | 7.12.2013
• Revealed: how Microsoft handed the NSA access to encrypted messages – The Guardian says new documents from Edward Snowden show the extent to which Microsoft cooperated with the NSA to provide access to its users' data, including providing pre-encryption access to the Outlook.com email service. And Statement from Microsoft About Response to Government Demands […] [Read More]
Linkpost | 7.11.2013
• PC Shipments Drop 11% in Q2, Say Gartner, IDC; Longest-Ever Period of Decline – The market continues its relentless shift toward smaller devices. PC sales have declined for five quarters in a row. Also Google Chromebook Under $300 Defies PC Market With Growth • T-Mobile unveils 'JUMP': Semiannual smartphone upgrades for $10 per month […] [Read More]
Hello, new Google Maps app. Good-bye, Google Latitude.
Google announced a redesign of its Maps site and apps at its I/O conference back in May, but so far it's only been spotted on the Web-based version of the service. But starting today, a new version of Maps for smartphones and tablets begins rolling out on Android, with an iOS update coming soon, according to Google's Official Blog.
But as we all know, Google giveth and Google taketh away. The arrival of new Maps apps means the death of another Google offering – its Latitude location-sharing service is being retired.[Read More]
Linkpost | 7.10.2013
• How Dropbox Will Remake Itself (And Your Angry Birds) – Dropbox has its first developer conference, aimed at getting software creators to put hooks for its syncing service into their applications. And Dropbox Now Has 175 Million Users, Up From 100M In November 2012 • Exclusive details on Amazon's next-gen Kindle Fire tablets – […] [Read More]
Linkpost | 7.9.2013
• Microsoft Restructuring Set for Thursday – That's the last day of the Worldwide Partner Conference, now underway in Houston. The company is expected to shuffle chairs to focus on devices and services, according to AllThingsD. • Justice Dept. defends secret rulings in new spy court filing – The feds want the surveillance court to […] [Read More]
Linkpost | 7.6.2013
• Venezuela and Nicaragua offer asylum to Edward Snowden – The offer's made, but will Snowden accept it, and can he even get to either of those countries from Moscow, where he's holed up. Also 'Restore The 4th' galvanizes over 100 nation-wide protests against NSA, PRISM, and government spying • How To Opt Out Of […] [Read More]
Linkpost | 7.5.2013
• European PRISM anger gains momentum with fresh cloud warnings and data threats – European leaders are urging their constituents to avoid U.S.-based Web services in the wake of disclosures about the NSA's PRISM surveillance program. And EU votes to support suspending U.S. data sharing agreements, including passenger flight data • Google ordered to rewrite […] [Read More]
Show More


text:
Watch the UFC 189 World Tour press conference in Dublin, where Conor McGregor nearly incited a riot and a rowdy, rude Irish crowd threw insults at the
Check out part two of the UFC 189 World
The UFC 189: Aldo vs. McGregor fight card became
On Episode 9 of UFC 189 World Championship Tour
Beautiful. Why is it EVERY time a fight ends with a dramatic strike, mmaweekly never has a shot of it?
I can remember only one instance where a big shot that ended the fight was captured: Corey Hill's leg braking.


text:
Southern California has been known as a pornography hub for many years, but the industry is picking up and moving out after a condom law was passed. The same group that fought for that law started the push for one in Florida too.
Report: Fla. Has Second Highest Rate Of Underwater Properties
Florida has the nation's second-highest rate of residential properties that were deeply underwater last month according to a new report.
Judge Rejects O.J. Simpson's Bid For A New Trial
A judge in Las Vegas rejected O.J. Simpson's bid for a new trial on Tuesday, dashing the former football star's bid for freedom.
More Lenient Lice Policies May Bug Some Parents
Many will remember that, as a kid, when a classmate had lice—they had to go home and not return until the lice was gone. But some states are changing that policy—meaning students with lice can stay in school.
Best Long Weekend Trips For College Students
Cancun, Mexico, Las Vegas and South Beach Miami are among the best long weekend trips for college students.
No. 10 FSU Puts On Show, Drubs Nevada 62-7
Jameis Winston was a show-stopper early and a spectator late — not a whole lot different from his first game.
No. 1 Alabama Beats Manziel, No. 6 Aggies 49-42
AJ McCarron and Alabama were not about to let Johnny Manziel and Texas A&M get another signature win.
Keys Boat Bust Leads To Suspected Smugglers From Las Vegas
A stolen boat was recovered in the Florida Keys, but not before a chase involving Customs and Border Protection.
Florida Improves Unemployment Numbers, Other States Struggle
South Floridians still stuck in the unemployment line may be in luck. New national data shows that people have higher likelihood of being hired within the Sunshine State.
FSU Opens Football Season At Pittsburgh
The Florida State Seminoles unveiled their 2013 schedule Monday and the Garnet and Gold will travel to Pittsburgh to welcome the Panthers into the Atlantic Coast Conference on September 2.


text:
Reed Rose Cottage Suites, Pool & Gardens
From $250 / night
Hide Property Details
Description from the owner
- 2 bedrooms
- 1 bathrooms
- Sleeps 5
- House
Bedrooms: 2
Bathrooms: 1
Sleeps: 5
Type: HouseReed Rose Cottage Suites, Pool & Gardens
Description from the owner
Reed Rose Cottage is located in Newport in a quiet neighborhood but close to First Beach the Cliff Walk, great Broadway restaurants, Kay Street & Bellevue Avenue...Beautiful property with a Nantucket feel. A garden oasis with a 18 x 38 in ground pool, pool house, patio grill area surrounded by perennials. The Cottage Two Bedroom Suite is 1200 sq ft newly redecorated in a coastal living design with large open sky lighted living room, dining room full kitchen, a queen and double bedroom, aero bed, full bath, well stocked kitchen for cooking, private entrance and off street parking. The unit overlooks the pool and gardens.
About the owner
About the owner
Siest De Mayo Cottage
Siest De Mayo Cottage
Response rate 50%
Response time Within a day
Calendar updated 3 weeks ago
Overall rating4.7 / 5.0 based on 10 reviews and 2 properties
Reed Rose Cottage Suites, Pool & Gardens
Newport, Rhode Island
Additional Location Information
We are located in a quiet area of Newport near First Beach and the beautiful Cliff Walk. Newport offers a variety of attracations. The beaches are pristine, sailing, biking, golfing, history, tennis, shopping, wineries and great selection of restaurants. So much to do all in a resort atmosphere....The Newport waterfront is very exciting shops, restaurants and bars. Easy walk to Bellevue, Broadway, Easton's Beach/First Beach, The Cliff Walk...Waterfront 115-20 minute walk through a beautiful neighborhood of Victorian homes
Please feel free to call us for more information @ 401 846 8790
More About This Location
Beach or lakeside relaxation, City vacations, Waterfront
Getting There
Nearest ferry port: Downtown , 1 miles
Nearest train station: Kingston, 25 miles
Nearest airport: PVD, 20 miles
Car is not necessary
Here 3 more rentals located nearby.
Also Consider
FlipKey has rentals in over 11,000 destinations around the world:
Destin vacation rentals
1,265 rentals from $100/night
Myrtle Beach vacation rentals
1,074 rentals from $34/night
Panama City Beach condos
1,554 rentals from $90/night
Ocean City summer rentals
723 rentals from $100/night
Gulf Shores vacation rentals
718 rentals from $75/night


text:
Los Angeles Dodgers
Rockies Get Rare Win, Down Dodgers 8-7
Jorge De La Rosa sweated almost as much watching the Colorado bullpen preserve the win as he did earning it.
Tulowitzki Takes Another Day Off With Tight Groin
Troy Tulowitzki is being cautious with a tight groin and will miss a second straight game to rest.
Jurrjens Calls Tightness In Chest 'Super Scary'
Jair Jurrjens was breathing a little easier Saturday after the tightness in his chest turned out to be nothing more than a scare.
Kershaw Shuts Down Rockies In 9-0 Win
Clayton Kershaw nearly had no-hit stuff against Colorado again, allowing only two singles over eight masterful innings as the Los Angeles Dodgers beat the Rockies 9-0 on Friday night.
Matzek Allows 10 Hits As Dodgers Beat Rockies 6-1
Tyler Matzek wasn't nearly as successful in his second major league start as he was five days earlier. The Los Angeles Dodgers gave the 23-year-old left-hander a reality check, getting 10 hits off him and not striking out even once.
Dodgers Beat Rockies In Rain-Shortened Game
Hanley Ramirez homered, Clayton Kershaw struck out nine and the Los Angeles Dodgers beat the Colorado Rockies 6-1 Sunday in a game cut short by rain in the sixth inning.
Barnes, Rockies End 8-Game Skid, Top Dodgers In 10
Brandon Barnes hit a winning triple off the center-field wall in the 10th inning and the Colorado Rockies snapped an eight-game losing streak, beating the Los Angeles Dodgers 5-4 Saturday.
Gordon's 2 Triples Lead Dodgers Past Rockies 7-2
Dee Gordon tripled twice among his three hits and drove in three runs as the Los Angeles Dodgers beat Colorado 7-2 on Friday night, handing the Rockies their eighth straight defeat.
7 Team Names That Make No Sense
We all have favorite teams. But some team names just don't make any sense, like these…
Rockies Win 3rd Straight Series, Beat Dodgers
Josh Rutledge hit a three-run homer and Jorge De La Rosa pitched seven strong innings, leading the Colorado Rockies over the Los Angeles Dodgers 6-1 on Sunday.


text:
Click on Thumbnails to see full size images.
Please note that over time links change or are no longer online. This is known as link rot or
link decay.
As such, links may appear that were valid originally, but no longer are.
Images that the Drudge Report links to often expire
after several weeks, consequently we usually only display the original link, not the images
after serveral weeks. You can still click on the link to see if the original image is still available.
DrudgeReportArchive.com © 2015 [DMCA]
CT Inc.
Tag cloud phrases:allows hundreds degrades women dome allows down religious downgrades russia drones work grade fever groups who hundreds drones knowingly traveled launches wartime low grade major military military upgrade moody downgrades religious groups say degrades thumbs down who say work together


text:
Learn how to add functionality to your websites not possible with HTML and CSS alone, with JavaScript and these practical programming techniques.
"I'm completely blown away by the quality and quantity of training you offer. I feel like Neo in The Matrix when they would insert a training program and within a few minutes he could say, "I know jiujitsu!"" —Zolla M.
more from our members »


text: POPSUGAR Celebrity POPSUGAR Celebrity Kristen Stewart by Celebrity 4/28/09 0 Shares Like us on Facebook Previous Photo 1 of 16 View on One Page ADVERTISEMENT ( more slides) Next Share This Link Copy 1 Kristen Stewart Previous Photo 1 of 16 View on One Page ADVERTISEMENT ( more slides) Next Get the scoop with our daily newsletter Enjoy the latest news on the celebs you love. Young Hollywood A Listers Movies TV Sign up with Tracey2538531 2 years robert better than michael kristen and robert in love forever laoff 5 years they look so cute together! 5 years just that i agree with***naked_american,Anonymous, and cupcakers!! They are right!! 5 years NO COMMENT just that i think tnaked_american, Anonymous, and cupcakers!! They are right 5 years I think that she should just stay the MA they look so happy!! Not saying that i don't think he looks better then Robert P. or any thing because i don't its just that i think they look really happy....... TheCuttiex 5 years Well...No comments!!! naked_american 5 years I find it really disturbing how so many tweens (and adults as well, I'm sure, but I'm talking about that core Twilight demographic) are pulling for Rob and Kristen to be together in real life. Seriously, it's scary how kids think that fiction is reality. Rob and Kristen don't "belong together" just because they have chemistry on the job. (And honestly I didn't think Edward and Bella even seemed madly in love, based on the performances in the movie, but that's another story!) cupcakers 5 years umm why are you comparing those two? that's her longtime bf she doesn't belong to Rob, why is it so hard for ppl to realize she's with her bf and not Rob.. 5 years What was MA doing in Vancouver over the weekend while Rob was in LA??? I thought Kristen & MA broke up. Proves you can't believe everything you read. I'm sorry but there's absolutely no comparison between MA and Rob. She belongs with Rob. 5 years They are so cute... Link Love Zendaya on her many hairstyles: "It's called a wig, people" — Us Weekly Dating tips straight from a Game of Thrones actress — HuffPost Celebrity Henry Cavill pops up at a London award show — Lainey Gossip Jon Hamm reveals the big role he had to turn down — Dlisted Jenny McCarthy thinks The View is a sinking ship — ET Paula Patton talks about life after splitting from Robin Thicke — JustJared This Victoria's Secret model's new shoot is so "en pointe" — Hollywood Tuna The Heroes remake signs on another series original! — Pink Is the New Blog Bill Cosby isn't doing himself any favors — The Superficial This star just had a strain of marijuana named after him — The Blemish Latest Celebrity


text:
Spring Sharathon, April 9-11
Family Life will be broadcasting Spring Sharathon on Family Life radio stations between April 9 and 11. The event raises operating funds for the radio network, along with other ministry outreaches of Family Life. If you'd like to make a faith promise during Sharathon, call 1-800-927-9083 or go online at www.fln.org/give
Not only can Sharathon be heard on the air, but it can be seen in person. Come visit us during the three-day event at Family Life in Bath, NY. Fellowship with family and friends, watch radio personalities perform their live broadcasts, meet staff, and enjoy food and entertainment.
On Friday and Saturday, the kids' carnival opens with bounce houses, a petting zoo, face painting, nail art, balloon creations and more. Friday is "Family Night" featuring kid-friendly foods enjoyable for the whole family. Saturday is "Barbeque Day" with roasted chicken and pulled pork served all day. Listen to Family Life Spring Sharathon April 9-11 on your local station, or better yet... take a trip to see us!
106.1 FM - Family Life in Buffalo, NY
We have exciting news! The radio network has extended its reach in Buffalo, NY with a new super translator station. 106.1 FM is now broadcasting to Buffalo, making this signal Family Life's most powerful in the Buffalo area as it reaches nearly 1 million people!
We're very excited about the opportunity to spread and celebrate the Gospel with many new listeners in Buffalo. It's a service we gratefully and joyfully provide as we thank the Lord for another open door to share the message of Jesus Christ.
We encourage you to try listening to Family Life for 30 days at home, work, or in your car. Discover the difference Christ-centered music and programming can have on you and your family.


text:
Tuesday, 19 October 2010
Welcome to the world, not-so-little one
'Golly,' my mother says. 'It's an elephant.'
Well, no, it's Tilly Honey, eight pounds and 14 ounces, with beautiful rosebud lips and a huge pair of lungs.
Big sister tomboy was disappointed - she'd wanted a boy so she could call it Ron Weasley. But we are all thrilled. Maybe this one will like pink.
That's about it
Love Maddie x
9 comments:
Many congratulations:0) xxReplyDelete
Gorgeous post, gorgeous name - Tilly Honey, and just love your Mum!ReplyDelete
that's lovely news... especially the way you tell it.
I enjoy what you share here at this blog... I don't always make time to comment, but I often make time to read.
best wishes for lots of fun with the new family member.
Oh congratulations on the birth of your not-so-wee granddaughter. Such lovely news. I can just picture those lips. Sigh! :)ReplyDelete
Congratulations Gran.ReplyDelete
Congratulations! You got back just in time, then.ReplyDelete
Congratulations Maddie and welcome Tilly.ReplyDelete
Happy congratulations to all!ReplyDelete
Tilly Honey - Nice!
Our middle wanted to name the youngest but biggest (9'15" - ouch!) Buster Tarzan.
Thankfully the parents got to the birth certificate first.
Congratulations! Eight pounds fourteen ounces - that's an average Great Dane baby!ReplyDelete
Popular Posts
There were gasps as the verdict was announced. Surely not? And then the programme went on, with twists and turns, including the unexpect...
It had to happen. It seems there's trouble in Fairyland. This magical spot, about which I've written before but have never name...
We've just had a photo session, Mr Grigg and me, here in the kitchen. It's usually me behind the camera - I've never been much...
Once upon a time, when I was fit, I cycled up to the most wonderful place on earth. It's in West Dorset and, when you get to the to...
Once upon a time, a long time ago, I was a child in a meadow with a woodland circle of beech trees around me. And there was clover growing i...


text:
- Home
- Future Students
- DVM degree program
- Graduate Programs
- Request information
- Contacts, Map, and Directions
- Current Students
- Veterinarians
- Public
- Faculty & Staff
- Alumni
Sarah Nemanic
Assistant Professor
261 Magruder Hall
541-737-4812 (hospital reception)
541-737-4818 (fax)
Education and Professional Training:
- 2011: Residency in Diagnostic Imaging, Michigan State University
- 2007: Small Animal rotating internship, Southern Arizona Veterinary Specialty and Emergency Center
- 2006: DVM University of California Davis
- 2002: PhD in Neuroscience, University of Texas, Health Science Center, Houston
- 1999: MS in Neuroscience, University of Texas, Health Science Center, Houston
- 1996: BS in Animal Physiology and Neuorscience, University of California, San Diego
Professional Organizations:
- American College of Veterinary Radiology
- Phi Zeta-honorary Society of Veterinary Medicine
Professional and Research Interests:
- Imaging of lymph nodes
- Imaging of neoplasia
- Neurobiology of learning and memory
Scollan K, Bottorff B, Stieger SM, Nemanic S, Sisson DD. 2014. Use of Multidetector Computed Tomography in the Assessment of Dogs with Pericardial Effusion.. Journal of veterinary internal medicine / American College of Veterinary Internal Medicine. Abstract
Terry JL, Milovancev M, Nemanic S. 2014. In vitro evaluation of a novel fiducial marker for computed tomography and magnetic resonance imaging of soft tissues in small animals.. American journal of veterinary research. 75(11):974-81. Abstract
Hoehne SN, Milovancev M, Hyde AJ, de Morais HA, Scollan K, Nemanic S. 2014. Placement of a caudal vena cava stent for treatment of Budd-Chiari-like syndrome in a 4-month-old Ragdoll cat.. Journal of the American Veterinary Medical Association. 245(4):414-8. Abstract
Warnock JJ, Nemanic S, O'Donnell MD, Wiest JE. 2014. Comparison of 2 Fluid Ingress/Egress Systems for Canine Stifle Arthroscopy Using Computed Tomography.. Veterinary surgery : VS. Abstract
Nemanic S, Nelson NC, Guiot LP. 2013. Ultrasonographic.. Journal of the American Veterinary Medical Association. 243(5):627-9.
Nemanic S, Nelson NC, Guiot LP. 2013. What is your diagnosis? Journal of the American Veterinary Medical Association. 243(5):627-9.
Nemanic S, Nelson NC. 2012. Ultrasonography and noncontrast computed tomography of medial retropharyngeal lymph nodes in healthy cats.. American journal of veterinary research. 73(9):1377-85. Abstract
Seiler GS, Robertson ID, Mai W, Widmer WR, Suran J, Nemanic S, Lamb CR, Lang J, Johnson JL, Thrall DE. 2012. Usefulness of a half-fourier acquisition single-shot turbo spin-echo pulse sequence in identifying arachnoid diverticula in dogs.. Veterinary radiology & ultrasound : the official journal of the American College of Veterinary Radiology and the International Veterinary Radiology Association. 53(2):157-61. Abstract
Nemanic S, London CA, Wisner ER. 2006. Comparison of thoracic radiographs and single breath-hold helical CT for detection of pulmonary nodules in dogs with metastatic neoplasia.. Journal of veterinary internal medicine / American College of Veterinary Internal Medicine. 20(3):508-15. Abstract


text:
A system for formatting electronic binary image data, which may be in compressed raster form, into transposed or rotated raster form for storage or output, such as on a printing device, is disclosed wherein the image data is first assembled in a buffer in the form of vectors of run ends representing successive raster scan lines of an original image to be reproduced. The elements of an intermediate buffer are initialized to zero and the data is entered into the intermediate buffer by using each run end to set a bit in the intermediate buffer, with the bits being set in the buffer elements in correspondence with the respective raster positions of the run ends. The elements of the intermediate buffer containing the entered electronic data are then combined, such as by EXCLUSIVE-ORing, to create transposed or rotated raster data, which may stored or input to a suitable output device, such as a printer or display. The raster data may be compressed in the process and other processes, such as image reversal, may be carried out with facility.
1. A method for formatting electronic binary image data into transposed or rotated raster form, comprising:
assembling in the storage elements of a first buffer electronic image-indicative data in the form of vectors of run ends representing successive raster scan lines of an original image to be reproduced;
initializing to zero the storage elements of an intermediate buffer capable of containing one bit corresponding to each pel in the image to be transposed or rotated;
entering said electronic data into said intermediate buffer by using each run end in said first buffer to set the bit in said intermediate buffer corresponding to the pel position at which the run ends;
combining the elements of said intermediate buffer containing said entered electronic data with one another in sequence to create raster data; and
storing said raster data generated by the above-recited steps.
2. A method as in claim 1 wherein said combining step comprises EXCLUSIVE-ORing said elements of said intermediate buffer.
3. A method as in claim 2 further comprising the step of inverting the bits of the initial storage element of said intermediate buffer before said combining step, so as to create a transposed representation of said original image with all bits inverted.
4. A method as in claim 1 wherein said combining step further comprises compressing said raster data.
5. A method as in claim 1 wherein said entering step further comprises omitting the entering of run ends outside of a predetermined range of interest, so as to produce clipping of the pels from at least one edge of said original image.
6. A method as in claim 1 wherein said combining step further comprises inserting pad data at at least one of the ends of said raster data, creating padding on at least one edge of said original image.
7. A method as in claim 1 wherein said entering step further comprises storing information on the position in said intermediate buffer of the bits set nearest at least one of the ends of said intermediate buffer, and said combining step further comprises using said stored information to omit the portion of the processing required to determine the value of said raster data respectively for at least one of the leading and trailing sequences of identical lines in said raster data.
8. A method as in claim 1 wherein said entering step further comprises entering said run end raster positions in reverse order in the elements of said intermediate buffer, so as to create a transposed representation of said original image mirrored about the horizontal axis.
9. A method as in claim 1 wherein said combining step further comprises combining said elements of said intermediate buffer in reverse order, so as to create a transposed representation of said original image mirrored about the horizontal axis.
10. A method as in claim 1 wherein said raster data comprises transposed raster data.
11. A method as in claim 1 wherein said raster data comprises rotated raster data.
12. A system for formatting electronic binary image data into transposed or rotated raster form, comprising:
a first buffer having a set of storage elements;
means for assembling in the storage elements of said first buffer electronic image-indicative data in the form of vectors of run ends representing successive raster scan lines of an original image to be reproduced;
an intermediate buffer comprising storage elements containing one bit corresponding to each pel in the image to be transposed or rotated;
means for initializing the elements of said intermediate buffer to zero;
means for entering said electronic data into said intermediate buffer by using each run end in said first buffer to set the bit in said intermediate buffer corresponding to the pel position at which th run ends;
means for combining the elements of said intermediate buffer containing said entered electronic data with one another in sequence to create raster data; and
means for storing said raster data.
13. A system as in claim 12 wherein said combining means comprises means for EXCLUSIVE-ORing said elements in said intermediate buffer.
14. A system as in claim 12 wherein said combining means further comprises means for compressing said raster data.
15. A system as in claim 13 further comprising means for inverting the bits of the initial storage element of said intermediate buffer before the operation of said combining means, so as to create a transposed representation of said original image with all bits inverted.
16. A system as in claim 12 wherein said entering means further comprises means for omitting the entering of run ends outside of a predetermined range of interest, so as to produce clipping of the pels from at least one edge of said original image.
17. A system as in claim 12 wherein said combining means further comprises means for inserting pad data at at least one of the ends of said raster data, creating padding on at least one edge of said original image.
18. A system as in claim 12 wherein said entering means further comprises means for storing information on the position in said intermediate buffer of the bits set nearest at least one of the ends of said intermediate buffer, and said combining means further comprises means for using said stored information to omit the portion of the processing required to determine the value of said raster data respectively for at least one of the leading and trailing sequences of identical lines in said raster data.
19. A system as in claim 12 wherein said entering means further comprises means for entering said run end raster positions in reverse order in the elements of said intermediate buffer, so as to create a transposed representation of said original image mirrored about the horizontal axis.
20. A system as in claim 12 wherein said combining means further comprises means for combining said elements of said intermediate buffer in reverse order, so as to create a transposed representation of said original image mirrored about the horizontal axis.
21. A system as in claim 12 further comprising means for providing said raster data as an input to an output printing device.
22. A system as in claim 12 further comprising means for providing said raster data as an input to an output display device.
This invention relates to the printing and other processing of binary images, and more particularly to systems in which the images are comprised of non-coded digital information in the form of vectors of run lengths or run end positions representing lines of raster bits arranged in a given scan format or direction.
Printer systems in which information to be printed is provided in the form of digital data are well known. Typically an image consisting of text or of a limited number of bit patterns may be represented in coded form, with each character represented by a code consisting of a small number of bits (typically 9). The codes are fed into a character generator which creates the bit pattern to be printed. For many graphical or scanned images, however, this form of representation is not practical because of the large number of potential bit patterns. Such images may be made available in raster form, with each image pel represented by a single bit and with the image lines arranged in raster scan order. This raster data is often stored in a compressed form in which the same information is described more compactly. A variety of systems for compressing and decompressing the binary image data are available. For example, available compression methods for binary images include, but are by no means limited to, those disclosed in:
L. R. Bahl, D. I. Barnea, and H. Kobayashi, "Image Compaction System", U.S. Pat. No. 3,833,900, 1974;
T. H. Morrin, "Recursive Contour Coding of Nested Objects in Black/White Images," International Conference on Communications conference records, June 1975, Vol. 1, pp. 7-17;
Y. Nakagome, H. Teramura, Y. Yamasaki, and Y. Wakahara, "System for Coding Information Change Picture Elements in Facsimile Signal", U.S. Pat. No. 4,040,093, 1977, and "Method for Coding Facsimile Signal", U.S. Pat. No. 4,121,258, 1978;
A. J. Frank, "Variable Length Codes for High Quality Image Encoding", U.S. Pat. No. 4,103,287, 1978;
G. Goertzel and J. L. Mitchell, "Two-Dimensional Image Data Compression and Decompression System," U.S. Defensive Publication No. T985,005, Aug. 7, 1979; and
R. Hunter and A. H. Robinson, "International Digital Facsimile Coding Standards," Proceedings of the IEEE, Vol. 68, No. 7 (July 1980), pp. 854-867.
The image compression method relevant to the present invention is described in the commonly-assigned, copending U.S. patent application Ser. No. 841,483 of J. L. Mitchell, G. Goertzel, and K. L. Anderson, entitled "Method for Encoding and Decoding a Digital Image".
Many printers are designed to print a number of raster scan lines in parallel. In such systems, the image data is arranged so that each unit of input data describes a set of vertically adjacent image pels, the bits in a unit controlling individual print elements. For example, an eight-bit byte may be used to drive a column of eight print elements. The most significant bit may control the top print element, the second most significant bit the second print element, and so on down to the least significant bit which controls the bottom print element. The stream of bytes needed to drive the printer to create an eight-row unit in such a system is the transpose of the eight lines of raster data to be printed. In some systems, such as the IBM 4250 printer, the transposed raster data may be compressed before being transmitted to the printer. For the IBM 4250 printer this compression consists of coding a repetition count for bytes having the values X`00` and X`FF` in order to reduce the transmission time required to send the large areas of black or white pels which occur in many images.
In order to convert image data from the normal raster scan format to a format suitable for transmission to such a printer, the image must be divided into horizontal strips N pels high, where N is the number of bits which are required to control the available column of print elements. Each horizontal strip must then be transposed, or alternatively rotated 90 degrees counterclockwise, which will produce the same result as transposing except that the bytes are in reverse order. Many systems are available to perform this operation, some of which are described below. To print an image which is stored in compressed form, it is necessary to decompress the image to create the raster data before applying the appropriate methods. Any required compression of the transposed data can be folded into the transposition process or performed as a separate step following it. The transposition and compression of data for the 4250 printer can be performed by existing software packages such as IBM Program Products "IPG" and "Image Handling Facility" (IHF).
Several systems are available which can rotate or transpose raster image data. These include those disclosed in:
P. J. Evans, "Image Rotation Apparatus", U.S. Pat. No. 4,168,488, 1979;
G. Goertzel, K. L. Anderson, F. C. Mintzer, and J. L. Mitchell, "Method for Rotating a Binary Image", U.S. Pat. No. 4,627,020, 1986;
J. B. Lotspiech, "Method and Apparatus for Rotating the Scan Format of Digital Images", U.S. Pat. No. 4,271,476, 1981, which describes a method that can be used to rotate images in raster or compressed form;
T. H. Morrin, "Rotation of Images Using Contour Compressed Data", IBM Technical Disclosure Bulletin, Vol. 18, No. 8 (January 1976), pp. 2640-2642, which discusses rotation of images compressed using contour coding methods; and
The present inventors in commonly-assigned U.S. Pat. No. 4,658,430 entitled "System for Rotating a Binary Image", describe a system which accepts data in the run end form used in the present invention and creates a rotated output image in raster form; but this is done by creating the unrotated raster image with the bytes stored in a non-standard order which makes it more convenient to pick up groups of these bytes and rotate them.
The commonly-used methods of decompressing an image and then transposing or rotating the raster data do not take advantage of the fact that in some data compression schemes there exists a representation of the image that is intermediate between the compressed form and the raster data and is produced with less computational effort than the required to create the raster data for the original image. In above-noted, co-pending U.S. patent application Ser. No. 841,483 of J. L. Mitchell et al, entitled, "Method for Encoding and Decoding a Digital Image", this form consists of vectors of run ends representing successive raster scan lines. It is an object of the present invention to take advantage of the existence of this representation to create the transposed or rotated raster image data directly from it, without going through the intermediate stage of creating the untransposed raster image. It is a further object of this invention to perform required alteration of the transposed or rotated raster data as part of the conversion process.
The use of the intermediate representation of the image as input to the transposition process of the invention, while preferred, does not preclude, however, the application of this method to uncompressed raster data, since the raster data can conveniently be converted to the intermediate form. Suitable methods for performing this conversion are described in the commonly-assigned, U.S. Pat. No. 4,610,027 of K. L. Anderson, J. L. Mitchell, and G. Goertzel, entitled "A Method for Converting a Bit Map of an Image to a Run Length or Run End Representation," and in the commonly-assigned, U.S. Pat. No. 4,646,356 of K. L. Anderson, G. Goertzel, J. L. Mitchell, and W. B. Pennebaker, entitled "An Improved Method for Converting a Bit Map of an Image to a Run Length or Run End Representation."
The system and method of the present invention is directed to taking an image expressed in run end or run length form and converting it to a series of transposed horizontal strips, with optional compression of the resulting data. Accordingly, the rows of a binary image are represented as vectors of run end positions. N lines of the image are processed at a time, where N is the number of rows per section to be transposed. A buffer is set up which contains a series of N-bit units or elements which are initially all zero. Each run end in each of the N rows is used to set a bit in the buffer, in an element corresponding to the raster position of the run end, which will cause the pel color to change in the appropriate row when the buffer entries are EXCLUSIVE-OR'd together. Then, after all of the N rows of input have been processed, the elements of the buffer are EXCLUSIVE-OR'd together in sequence to produce the units of transposed data. If compression of the transposed image is required, it may be combined with the exclusive-or process to modify the output produced by that operation.
The invention also allows data from the extremes of the lines, i.e., the beginning and/or end of each input image line, to be discarded, and allows insertion of "padding" pels at the beginning and/or end of each input image line as the output is created. Discarding of original image data is accomplished by ignoring all run ends outside of the range of interest. Padding is done by adding the pad data before and/or after the exclusive-or loop and optional compression are done, to put pad data at the beginning and/or end of each line. Some "knitting" may be required to combine the padding with the real data if compression of the transposed data is being done.
Another feature of the invention is the capability of allowing the input image to be reversed, i.e. converted from black-on-white to white-on-black or vice versa.
This is accomplished by inverting the first element in the buffer in which the elements are EXCLUSIVE-OR'd to produce the transposed image, which causes all subsequent results to appear in inverted form.
A further feature of the invention is that in addition to performing the described transpositions, it also can be used, with minor modifications well within the ability of a skilled programmer, to rotate an image by 90 degrees.
A preferred embodiment of the present invention utilizes a programmed general-purpose computer such as an IBM System/370 or PC, in combination with an IBM 4250 printer.
FIG. 1 illustrates the run end to compressed transposed raster conversion according to the method of the present invention.
FIG. 2 is a flowchart showing the procedure for transposing and compressing a line of input data.
FIG. 3 is a flowchart showing the initialization procedure.
FIG. 4 is a flowchart showing the method for recording the transitions in a line of input data.
FIG. 5 is a flowchart showing two subprocedures used for compressing sequences of X`00` or X`FF` bytes.
FIGS. 6A, 6B, and 6C show the procedure for converting the recorded transition data to compressed transposed data.
FIG. 7 shows a method for coding entire sections of X`00` or X`FF` bytes.
FIG. 8 shows the procedure for coding the data on the left edge of the section.
FIG. 9 shows the initialization required between the coding of one section and the next.
Before proceeding with a description of the details of the invention, it is useful to describe the run end representation used for the input data and the compression scheme used to prepare the transposed data for transmission to the IBM 4250 printer which will be used as an exemplary output device.
Binary images are divided into individual units called pels, which are typically arranged along raster scan lines. Each pel is either white or black. In most documents, pels tend to be grouped into "runs", i.e. sequences of pels having the same value. There may be a run of white pels at the margin, followed by a run of black pels where the first character or line is encountered, followed by another run of white pels for the white space separating the first character or line from the next, and so on across the page. A "run length" is the number of pels in a run. A run end is the displacement in pels from the left edge of the image to the last pel in a run and is the cumulative sum of the lengths of a given run and all of the runs to the left of it. The present invention may be used to generate transposed or 4250-format data from either run ends or run lengths. The description which follows will assume that run ends are supplied. To convert run lengths, a cumulative total of the run lengths processed would be kept.
The preferred embodiment of the invention uses a line or run end buffer for each input line which contains a series of halfwords. The 16 bits in the halfword are adequate to represent images with widths up to 64K. The first halfword in each run end buffer gives the number of bytes of run end data plus two bytes for the count (i.e. the total number of bytes of data in the buffer); this is followed by three zero run ends, an arbitrary number of pairs of white/black run ends, and two additional copies of the last black run end. If the image row begins with a black run, the first white run end must be specified as zero. If the image row ends with a white run, the last black run end will be the same as the last white run end, so that in fact there are three copies of the last real run end. For example, the run end buffer containing the halfword entries
______________________________________24 0 0 0 0 10 27 28 32 32 32 32 16 0 0 0 32 32 32 32 32 0 0 0 0 1 2 3 8 9 12 28 31 32 32______________________________________ 32
would correspond to the following bit image:
______________________________________11111111 11000000 00000000 0001000000000000 00000000 00000000 0000000010100000 10001111 11111111 11110001______________________________________
The format of the data sent to the 4250 printer is as follows. The image is divided into groups of eight lines each, called "sections". Each section is represented by one record containing the image data in a coded form. A record consists of a header followed by the bytes of data. The data bytes may be visualized as the result of a transpose of the section bits, resulting in a column 8 bits wide and NPELS bits deep, where NPELS is the number of pels in a line. The eight bits in each row of this matrix are packed into a byte, and the column is read from top to bottom. The data bytes are compressed as follows. If a byte is all white (X`00`) or all black (X`FF`), the byte is placed in a section or output buffer followed by a count of the total number of contiguous bytes of that type. The count is stored in a byte, so if there are more than 255 bytes in the string, additional copies of the original byte followed by counts are stored to make up the complete number of bytes. Thus a string of 512 white bytes would be coded as "00 FF 00 FF 00 02". There is no compression of bytes which are not either all white or all black; they are simply copied into the section buffer.
Certain aspects of the creation of the output data are not addressed by the method described in this disclosure. For example, in some applications it is necessary to block the section records into units of a fixed size. In general the section record sizes will not correspond to the block size, e.g., one block may contain several section records, or one section record may extend over several blocks. The mechanics of the blocking are considered to be apparent to a skilled programmer and not particularly relevant to the subject of this disclosure. Similarly, the construction of the section record headers is straightforward (given the required format) and will not be discussed further.
The basic procedure for coding one section (omitting edge trimming and padding) is illustrated in FIG. 1. The run end representation is shown to the right of the original bit image. In this representation the length field, three leading zeroes, and two trailing copies of the last run end are omitted. The hexadecimal values below the bit image are the bytes of the transposed matrix. To transpose the section information, an intermediate buffer, BUF, containing NPELS+1 bytes (numbered from 0 to NPELS) is first zeroed. The eight lines of run end data are then processed one at a time. For each run end R<NPELS in a given line, the Rth byte in the buffer is OR'd with a mask. A different mask is used for each input line; the masks are shown at the far right. The mask sets a bit in the appropriate byte of BUF each time a white/black or black/white transition occurs. If the last pel of the line is black, the mask is OR'd with the last byte in BUF. After all eight lines have been processed in this manner, the buffer BUF has the following properties:
1. BUF(0) contains the first data byte in the line.
2. The output byte at any position I>0 in the stream of output bytes (before compression) can be obtained by doing an EXCLUSIVE OR of the output byte at position I-1 with BUF(I).
3. When the last output byte in the line is EXCLUSIVE OR'd with BUF(NPELS), the result is zero
Conditions 1 and 2 arise because of the way the buffer is constructed: each color change on a given line has been indicated by a one in the bit position corresponding to that line in the byte at the position of the color change, and an EXCLUSIVE OR with that one bit causes a color change in the output byte. Condition 3 is set up so that it is not necessary to test for the end of a line unless the current output byte is zero.
After the intermediate buffer BUF has been constructed from the eight lines of input data, it must be read out to produce the transposed data and, if desired, compressed according to the 4250 compression algorithm. A byte B is initialized with the value BUF(0) and EXCLUSIVE OR'd with the successive elements of BUF. The value of B after each operation is shown in the row labelled "B"; note that these bytes are the rows of the transposed input matrix (i.e. the columns of the original image). To compress the transposed data for the 4250 printer, B is examined after each calculation. If B is zero, a test is made to determine whether the end of the line has been reached; if so, processing is complete. Otherwise, if B is black or white (X`FF` or X`00`), BUF is scanned to determine how many bytes of the same color are in this field. As long as the elements of BUF are zero, the value of the output byte will not change; the first nonzero byte in BUF marks the end of the field. After the field length is determined, it is coded as described above, and processing continues with the next byte. If B is not black or white, it is stored in the compressed data buffer CMP and processing continues with the next byte.
The conversion algorithm for the 4250 printer has been implemented as a function which accepts one input line at a time and creates a compressed buffer for a section after every eighth line. This embodiment described could be modified by removing the compression for the 4250 printer in order to produce transposed raster data for use with a more conventional printer. The function makes use of an area of storage provided by the calling function to save the intermediate buffer and various flags and other data between calls. Variables saved in this area include:
IFLAG Flag set to a nonzero value by the caller before the first call to the conversion function for a given image to cause initialization of the conversion function variables. After initialization the flag is set to zero.
PT Pointer to the run end buffer describing the line being processed. After all input lines have been processed, the function is called with PT=0 to flush out the final section data if necessary.
MASK Mask OR'd with intermediate buffer bytes for the current line
SKIP Number of pels to skip on the left edge of the input line
NC Number of bit columns from the input image to be coded for the 4250
IC Number of bit columns in the image described by the run end buffers
LFT Number of bits to pad on the left
RT Number of bits to pad on the right
PCLR Color of padding bits: 0=white, otherwise black
REV Set to nonzero value for reverse video
LIM Column number of last bit column of input data to be used
MAX Largest run end in current section which is less than LIM
MIN Smallest run end in current section which is greater than SKIP
OPT Pointer to output (compressed data) buffer
BP Pointer to element of BUF currently being coded
LIMBP Upper limit for value of BP
The structure of the conversion function is illustrated in FIG. 2. First, the flag IFLAG is examined to determine if it is necessary to initialize the conversion function variables; if so, the initialization is performed and IFLAG is reset. Then the pointer to the next line of input is tested to see if a line of data has been supplied. If not, the entire input image has been processed and it is necessary to put out the final partial section of data if there is one. This is determined by testing MASK to see if its value is X`80`. If so, then the last line processed resulted in the creation of a compressed section and so no action is required; otherwise the intermediate buffer is processed to create a compressed section. Because BUF is initially zeroed and there has been no opportunity to set low-order bits in its elements, the section is constructed as if the bottom of the image had been padded with all-white lines.
If a line of input data has been supplied, the run end data is recorded in BUF and MASK is shifted right one bit to create the mask for the next line. If the one bit is shifted out of MASK, then eight input lines have been processed since the last section was compressed and it is time to compress the data for the current section.
After this is done, some initializations are performed in preparation for processing the next section and MASK is reset to set the high-order bit in intermediate buffer bytes when the next line is processed.
FIG. 3 shows the initialization required before processing the first line of the input image. The number of pels in the input line (obtained from the last halfword in the input buffer) is saved. Tests are then performed to ensure the SKIP is nonnegative and that NC is positive, i.e. some data from the input image is used. The condition "NC+SKIP<=IC" must also be satisfied, which is to say that there are enough pels in the input data lines to supply the required number of pels for the output image. The implementation of the invention allows the calling function to specify NC<=0 to indicate that all available data is to used, and the calculation IC-SKIP (total pels available minus number of pels to be skipped) resets the value of NC in this case. The numbers of pels to pad on the left and on the right are required to be nonnegative. Once the input has been accepted as valid, the value of LIM (the last pel position to be used in the input data) is calculated, the intermediate buffer BUF is zeroed, and MAX AND MIN are initialized for the first section.
The conditions labelled "ERROR" in FIG. 3 may be handled in various ways, according to the judgement of the programmer. They can cause an abort, simply telling the calling function that it will have to get better data and try again. Some of the values can be defaulted if desired; for example, SKIP, LFT, and RT could each default to zero if a negative value is given. If SKIP+NC is greater than IC, the difference could be subtracted from NC and added to the value of RT to produce an image of the width requested but with additional padding, or the size of the output image could be reduced to correspond to the amount of data available. Thus the implementation of this operation is open to considerable variation, but it is assumed during the execution of the remainder of the function that the input values satisfy the conditions described.
The operation of recording transitions is performed on each input line. In addition to recording the transitions, this process keeps a record of the minimum run end MIN found in the section which is greater than SKIP and the maximum run end MAX which is less than LIM. These values are useful because they make it unnecessary to scan to obtain the lengths of the leading and trailing single-color sections (if any). Since many documents have wide borders, such as the margins on a page of typewritten text, the elimination of the scanning of the edge regions often results in a significant savings of processing time.
Before describing the process in detail, the addressing of the intermediate buffer BUF will be discussed. Note that BUF must be large enough to contain one (byte) element for each bit of real data (as opposed to pad bits) in a line of the output image. It is not necessary to allow space for columns of input image data which are to be skipped. If such space is not allocated, then the index of a byte to be altered to recored a run end at position P in the input image is P-SKIP. However, it is inefficient to perform this subtraction once per run end processed. A better solution is to define a second buffer, XBUF, at an offset of SKIP from the beginning of BUF, so that XBUF(P) and BUF(P-SKIP) describe the same byte in storage. The recording of transitions from the run end data can be performed using the buffer XBUF, and the compression of the resulting intermediate data can be accomplished using the "real" buffer BUF. In the present implementation the values of MAX and MIN are collected as the input lines are processed; during this phase their values lie between SKIP and LIM. Before the compression phase begins they are normalized so that they fall between 0 and NC.
FIG. 4 details the process of recording transition data from an input line in the intermediate buffer XBUF. Before beginning this procedure it may be desirable to check to be sure that the image line described by the run end buffer contains the expected number of pels (IC). The pointer to the run end data (PT) is incremented by 8 to skip over the length field and the initial three zero run ends. PT now points to a white/black run end pair. The white and black run ends will be referred to as PTW and PTB, respectively. PT is then incremented by 4 until the black run end it addresses is greater than SKIP. At this point the white run end PTW may be greater than SKIP, in which case the portion of the line which is to be used begins with a white run, or it may be less than or equal to SKIP, in which case the portion of interest begins with a black run.
If the portion of the line to be used begins with a white run, it is necessary only to check the white run end to see if a new minimum has been found before entering the main loop. If the line begins with a black run end, a transition to black at position SKIP (the position from which the first output byte is read) is stored. This process, indicated as "mask XBUF(x)" in the illustration, is done by the operation "XBUF(x)=XBUF(x) OR MASK". The black run end is then compared to the minimum to see if a new minimum has been found. If the black run does not extend to the end of the line, the point where it ends is marked in the intermediate buffer, and PT is incremented to address the next pair of run ends.
The main loop is then entered. As long as the black run whose run end is addressed by PT does not extend to the end of the line, the ends of the white and black runs are marked in the intermediate buffer.
On exit from the main loop, PTW may be less than the maximum input pel position to be used, in which case the line ends with a black run, or it may be greater than or equal to that value, in which case the line ends with a white run. If the line ends with a black run, the position of the white run end is marked in the intermediate buffer, a transition from black to white is marked in the byte at the end of the buffer, and the white run end is compared with MAX to determine if a new maximum has been found. If the line ends with a white run, PT is backed up one pair of run ends and the previous black run end is compared with MAX to see if a new maximum has been found. This completes the recording of transitions from one line of input data.
After the transitions for eight input lines have been recorded, the data in BUF must be used to create a compressed data buffer representing the completed section. Before describing this process, two subfunctions used to code black or white data bytes will be introduced. They are illustrated in FIG. 5.
The first of these procedures is called TCODE, for "test and code". It takes as arguments the byte to be coded (either X`00` or X`FF`) and the number of copies of that byte which appear as columns in the output image. The number of copies (CT) is tested to determine if it is greater than zero; if so, the second coding procedure is called to code the field.
The second coding procedure, CODE, is used when the number of copies of the byte to be coded is known to be greater than zero. It requires the same arguments as TCODE. If CT is greater than 255, it must be broken down into units of 255, each of which is coded separately. This is done by a loop which stores the byte and a count of 255, increments the output pointer, and decrements CT by the 255 bytes just coded. This process continues until CT becomes less than or equal to 255. At that pont, the byte is stored along with the leftover CT and the output pointer is incremented. If CT is not greater than 255, then the loop is bypassed and only the final storage operation is required.
FIGS. 6A, 6B, and 6C describe the coding of the data for one section. FIG. 6A shows the coding of the left padding and an initial white or black field (if any); FIG. 6B shows the coding of the "interior" bytes; and FIG. 6C shows the coding of a final white or black field and the right padding.
The process of coding a section begins, as illustrated in FIG. 6A, with the normalization of MIN and MAX so that they can be used as indices to the buffer BUF. The pointer to the output buffer is set up. If reverse video is required, the first and last bytes in the intermediate buffer are inverted. This is sufficient to invert all of the output bytes, since if the original byte is inverted the results of successive EXCLUSIVE ORs will be the inverse of the original image data, and the inversion of the last byte causes the result of the last EXCLUSIVE OR to be zero as required by the compression process. Next, the final byte in BUF is examined. When the last output byte is EXCLUSIVE OR'd with this value, the result is zero, so the final byte is equal to the last real data byte in the section. If this byte has the value X1 FF`, then the section ends with a black field. Since it is desirable to recognize that the end of the "interior" data has been reached by a test on only one path (the path which processes white bytes), the byte which initially causes B to equal the first X`FF` in the final field (BUF(MAX)) should be inverted to cause B to have the value X`00`. However, this will not work if B has the value X`00` when it reaches BUF(MAX). In that case, the inverse of BUF(MAX) would be zero, and so the scan for the white field would continue past the true end of the white data. To prevent this, BUF(MAX) retains the value of X`FF` in this case, and a second test is introduced to test for the end of the section if a white byte is immediately followed by a black byte in the intermediate buffer.
If the section does not end with a black byte, a test is performed to see if it ends with a white byte. If it does not, then it will be necessary to process the bytes of BUF until the last element of BUF is reached, so MAX is set to the buffer size to indicate this.
Next, a limit is set up for the pointer BP which will step through the "interior" bytes of BUF (from BUF(MIN) to BUF(MAX)). This value is used in testing for the end of the section data. The byte B is then initialized with the value of the first byte in the section.
If the section begins with a white byte, MAX is tested to determine if the section contains all white data. If MAX is zero, there are no run ends in the section which are between 0 and NC. In this case the entire section is white, so that information is coded (this process will be described in more detail later) and processing of the section is complete. If MAX is greater than zero, the section begins with a white field but contains some nonzero data. The left padding and the initial white field are coded, and the loop to code the "interior" points is entered.
If the section begins with a black byte, the first byte of BUF is cleared so that it will not be necessary to zero BUF between positions 0 and MIN before recording transitions from the next group of input lines. In a process similar to that used for a section beginning with a white byte, MAX is tested to determine whether the section is all black. If so, the padding and section data are coded and processing is complete; otherwise the left padding and initial field are coded and the loop to code the "interior" bytes is entered.
If the section begins with a byte which is neither black nor white, MIN is reset to zero to indicate that BUF must be processed from the beginning; B is set to zero since it will be EXCLUSIVE OR'd with BUF(0) at the beginning of the loop to code "interior" bytes; and any padding bytes required are coded. The interior loop is then entered.
FIG. 6B shows the loop which codes the "interior" bytes of the section, i.e. those between offsets MIN and MAX in BUF. As new values of B are created, they are classified as either white (X`00`), black (X`FF`), or mixed (anything else), and the appropriate point in the code is branched to.
The pointer BP is used to address successive elements of BUF. It is initialized to point to BUF(MIN), and is incremented either explicitly or by the SCAN procedure until it reaches the value LIMBP. After BP is initialized, the first byte from the intermediate buffer is read into a temporary storage location and compared to zero. If the byte is equal to zero then the previous output byte was mixed, since this point in the code is reached only if the previous byte was mixed or if the first byte is being read, and the first byte is known to be nonzero. Since B XOR 0 is equal to B, the new byte to be coded is identical to the old one and is mixed, so control goes to the part of the code which processes a mixed byte. This processing consists of storing the byte in the output buffer and incrementing the output pointer and the input pointer BP, and then continuing to the next byte.
If the next byte in the buffer is nonzero, it is EXCLUSIVE OR'd with B to obtain a new output byte. If the resulting byte is white, BP is compared to LIMBP to determine if the end of the section data has been reached. If so, the loop is exited. Otherwise BUF is scanned beginning at BP+1 to determine the number NZ of zero bytes in BUF. BP is incremented during scanning to point to the nonzero byte following the field of zeroes. Adding one to NZ to include the initial byte of the field (which had a nonzero BUF entry which created the zero byte) gives the total number of contiguous zero bytes; these are coded using CODE. B then receives the value of the nonzero byte following the zero field; this is equivalent to EXCLUSIVE ORing that byte with B, which had the value zero. B must now be either black or mixed. If B is mixed, control passes to the code which processes mixed bytes. If B is black, it is necessary to test again to see if the end of the data has been reached, as discussed above. If so, the loop is exited; otherwise control passes to the part of the code which processes black bytes.
The portion of the code which processes black bytes may be entered either directly, after a white field has been processed, or via a test which separates mixed bytes from black bytes after an element of BUF has been EXCLUSIVE OR'd with a mixed B. As in the procedure for processing white bytes, BUF is scanned beginning at BP to determine the length of the black field; BP is set to the first nonzero byte in BUF following this field. The appropriate number of black bytes is then coded, and B is reset by EXCLUSIVE ORing the element of BUF addressed by BP with B (which has the value X`FF`). The resulting value is either white or mixed; a test determines which portion of the code to branch to.
FIG. 6C shows the procedure for coding a final black or white field and the padding on the right edge. The last element of BUF is examined to determine the color of the last data byte in the line; since this element EXCLUSIVE OR'd with the last data byte must be zero, the two must be equal. If the last data byte is white, PCLR is examined to determine whether black or white padding is required. If white padding is required, the number of bytes in the field is the sum of the number of padding bits required and the length of the original field. This length is given by NC-MAX and is at least one (since the last byte is white). If black padding is required, the length of the white field is coded and then the padding bytes, if any, are coded separately.
Similarly, if the last data byte is black, PCLR is examined to determine the color of any padding bits. For black padding, the pad length and the black field length are summed to obtain the number of bytes to be coded; for white padding, the black field length is coded and then the padding bytes, if any, are coded.
If the last data byte is mixed, PCLR is tested and the appropriate color of padding bits are coded if RT is nonzero.
This completes the compression of the data from one section.
FIGS. 7 and 8 show details of some of the processes outlined in FIG. 6A. FIG. 7 shows the procedures for coding a section consisting entirely of white bytes or entirely of black bytes. For a white section, the pad color PCLR is tested; if the padding color is white, the length of the white field is the sum of the number of bytes in the section and the left and right padding lengths. If the padding color is black, then the padding must be coded separately and the padding widths must be tested to see if they are nonzero before coding. (Because of the restrictions outlined with reference to FIG. 3, NC must be greater than zero, so no test is required before coding a field of NC bytes.) To code a black section, the conditions are reversed, i.e., if the padding is black, the section may be coded in one operation, otherwise the white padding must be coded separately with appropriate tests.
FIG. 8 shows the procedures for coding the left padding bits and an initial white or black field for a section which is not mono-colored. If the section begins with a white field, PCLR is tested. If the padding color is white, the padding and the white field (of length MIN) may be coded together. Otherwise the padding must be coded separately with a test to determine whether the padding width is nonzero before coding; after this has been done, the white field is coded.
The procedure for a section which begins with a black field is similar. If the pad color is black, the padding and field widths are combined for coding; otherwise they are coded separately. When a section begins with a byte which is neither white nor black, only the padding must be coded before entering the loop to code the interior bytes; PCLR is tested and (if the padding width LFT is greater than zero) padding bytes of the appropriate color are coded.
FIG. 9 shows the initializations required after a section has been processed in order to prepare for the next section. If the image data for the section which has just been compressed is not mono-colored (i.e. at least one run end exists between 0 and NC), the portion of BUF which contains nonzero entries must be zeroed. This portion extends from position MIN to position MAX and is 1+MAX-MIN bytes in length. In any case, the last byte of BUF is zeroed. MAX and MIN are reset to SKIP and LIM respectively, so that any run end greater than SKIP will be recorded in MAX and any run end less than LIM will be recorded in MIN.
If the compression for the 4250 printer is not required (i.e., only the transposition is to be done), the method above may be simplified. For processing the padding and mono-color sections at the ends of lines, the "CODE" procedure shown in FIG. 5 is modified to write CT copies of BYTE into the output buffer, incrementing the pointer appropriately. The main loop illustrated in FIG. 6B is reduced to a very simple loop which reads the next byte into TB, EXCLUSIVE ORs it with B (the preceding steps may be combined for many processors), tests for the end of line if B is zero and exits if the end of line is found, and otherwise loops around to store B and increment the input and output pointers. Alternatively, the method of forcing B to become zero at the end of the line may be discarded and BP may instead be compared against LIMBP on every iteration of the loop. Since for this case the buffer and the output data are comprised of the same number of bytes, the output may be constructed directly in the buffer (or equivalently, the buffer may be overlaid on the output storage area) if desired. In that case the same pointer can be used to address the input and output data.
Many other variations and enhancements of the basic method are possible. For example, the output data can be caused to represent the transpose of the image formed by mirroring each section about the vertical axis rather than the transpose of the original section. This can be done either by reading the bytes of the buffer in reverse order as the section data is read out in the loop of FIG. 6B, or by storing the run end data in reverse order in the buffer by using the additive inverse of each run end instead of the run end itself as an index for the byte to be masked in the procedure shown in FIG. 4 (the base pointer to which the index is added must be adjusted appropriately to point to or beyond the end of the buffer in this case). Note that the transposed mirrored image is equivalent to the original image rotated 90 degrees counterclockwise. A 90 degree clockwise rotation can be achieved by using the rows of the original image in reverse order to obtain data to be entered into the intermediate buffer, effectively mirroring the image data about the horizontal axis before transposing it.
It will accordingly be seen that a system and method have been disclosed which create transposed or rotated raster data, or 4250 section files, working directly with the run end form of the input binary image data, by recording the image transitions in an intermediate buffer and then using the bytes of that buffer to invert bits to create the output raster data. Advantageous features inherent in the disclosed method include the ability to skip over mon-colored fields at the margins of a document, facility in inverting all of the bits in the original image, and an efficient and straightforward implementation in software.
Patent Citations
Referenced by
Legal Events
Original Image


text:
rabbit proof plants, bulbs anyone...?
My niece lives in the high desert country (6300 ft. elevation) where water is at a premium but would like plants she could have that the rabbits would leave alone (rarely has a deer come into the yard). Are there lists I could go to to find these rabbit resistant outdoor plants to have? She has to cover the tomato plant in a barrel with chicken wire & still the rabbits try & knock the wire cage off & eat the tomatoes, plant & all! I'd like to give her some of my spring bulbs (tulips, iris, daffodils) to try but not sure if they are rabbit/pocket gopher proof or not?!
We have both rabbits and deer. Sometimes it's hard to say who ate what. Currently they are surprising me by eating the tops from winter onions. They are not supposed to do that but each animal can have individual tastes. Or it could be the voles.
I have to cage most of my vegetables and many of my fruits. They especially love eating plum trees and apple trees. That's the deer. Rabbits eat the stems from my young fig trees.
In my yard, they don't touch bearded irises, daffodils, anemones, helleborus, or hyancinthoides - bluebell bulbs. I think the rabbits are what ate the grape hyacinths. They eat tulips down to the ground. They usually leave alliums alone but something ate some buds from a few alliums last year. Those were the gigantic type alliums. They left the smaller ornamental alliums alone.
Chives and garlic chives have very nice flowers and I plant those too. Along the edges of some raised beds, I have a row of garlic chives and anemones to deter rabbits. I don't know if they help or just make me feel better.
Hope that helps.
Here is a link that might be useful: rabbit resistant plants
Thanks!! I will send her this list of plants that those pesky rabbits WILL eat so she can avoid them! They also have field mice that like to chew/eat the insulation off the vehicle wiring underneath... some makes of vehicles more than others ... depends on what the insulation is made of I guess?!


text:
Board of Supervisors
San Francisco Supervisors To Fund Relief Efforts For Undocumented Children Crossing Border
San Francisco's Board of Supervisors voted unanimously last week to fund relief efforts for as many as 250 children a month, according to some immigrant advocates, that are arriving in the country.
San Francisco Supervisors Consider Tax Breaks To Seed Urban Garden Growth
A new proposal before the Board of Supervisors would give significant tax breaks for property owners willing to set aside their empty lots as urban gardens.
San Francisco Soda Tax Plan Step Closer To Getting Onto November Ballot
The San Francisco Board of Supervisors' Budget and Finance Committee unanimously voted today to recommend a tax on soda and sugary beverages sold in the city for the November ballot.
San Francisco Supervisor Avalos Admits To Affair With Top Aide Who Is Now On Leave
An aide to a San Francisco supervisor is on leave after it was revealed Wednesday that she was romantically involved with her boss.
SFO Airfield Safety Officers Receive Commendations For Response Following Asiana Crash
The five Airfield Safety Officers were honored at Tuesday's San Francisco Board of Supervisors meeting.
San Francisco Board Of Supervisors Approve Laura's Law
The measure proposed by Supervisor Mark Farrell was approved by a 9-2 vote and will allow court-ordered treatment for the severely mentally ill.
Airfield Safety Officers Who Were First On Scene Following Asiana Airlines Plane Crash At SFO To Receive Commendations
The Airfield Safety Officers arrived within two minutes of the initial impact of Asiana Flight 214, and nearly a minute before the first fire truck arrived on scene.
Airbnb Starts Collecting Hotel Tax In Portland— San Francisco Likely To Be Next
Airbnb began collecting hotel taxes Tuesday for all of its reservations in Portland, Oregon and is expected to soon do the same in San Francisco.
San Francisco Examines Potential Speed Limit Reductions To Achieve Ending Pedestrian Fatalities
San Francisco will consider lowering speed limits on city streets to as low as 20 miles an hour in some cases to achieve its goal of ending pedestrian fatalities.
AT&T Park's Concession Stand Workers May Be Getting More Job Security
Legislation is moving forward at the San Francisco Board of Supervisors to force large employers in the hospitality industry to retain workers for at least 90 days if the company is sold.


text:
A woman accused of killing four people, including three of her relatives, at a tiny American Indian tribe's Northern California headquarters had been evicted from tribal housing because she was suspected of stealing from the tribe, the tribe's lawyer said Monday.
Cedarville Rancheria attorney Jack Duran said Cherie Lash Rhoades was suspended as tribal chairwoman just three weeks before the gun and knife attack, pending a federal investigation into allegations that she embezzled at least $50,000 in federal grant money.
Rhoades' son, Jack Stockton, was ousted as vice chairman and evicted from tribal housing on the same grounds, Duran told The Associated Press.
Stockton was not at Thursday's hearing when the shooting broke out. He does not have a listed phone number.
Duran said the meeting in Alturas, Calif., was being held to consider Rhoades' appeal of her eviction.
But at some point, Rhoades opened fire, killing her brother Rurik Davis, 50, who had been named interim chairman by the tribal council, authorities said.
Also killed in the attack were Rhoades' niece Angel Penn, 19; her nephew Glenn Calonicco, 30; and Shelia Lynn Russo, 47. They were all members of the tribal council that evicted Rhoades, and Russo was the tribal administrator.
Duran said Penn was holding her newborn infant on her lap when she was shot, but the baby was unhurt and will be placed with a sister.
Davis' two daughters, Monica and Melissa Davis, were critically wounded, court documents said.
Responding officers arrested Rhoades outside the building, where a declaration of probable cause says Modoc County Undersheriff Ken Richardson saw Rhodes stabbing one of the victims in the parking lot and handcuffed her after another person tackled her. The document adds that police talked to six people who witnessed the shooting. The two women who survived bullet wounds were also cut with a knife.
A criminal complaint filed Monday in Modoc County Superior Court charges Rhoades with four counts of murder with a 9 mm semi-automatic handgun, and two counts of attempted murder. She was to be arraigned Tuesday morning.
District Attorney Jordan Funk said she will face the death penalty if she's convicted, because the complaint carries the special circumstance of multiple victims.
Funk said it wasn't immediately clear if attorneys had been appointed for Rhoades yet, because they would have to be qualified to handle a capital case.
Continue reading this story on the...


text:
UK tops poll for most unhealthy snackers but what should we be eating?
Health Teas: What To Drink When And Why
When Do The UK Clocks Go Forward In 2015?
The Ultimate Guide To A Perfect Night's Sleep
This Little Girl Refused To Stop Smiling During Six Months Of Gruelling Surgery
The Diet Necklace Could Give You Added Willpower
How To Have Happy Feet In Heels
Peanut Eaters May Live Longer
Is Your Mobile Phone Brainwashing You?
Lazy Workout: Burn calories while you cook
Top Gear Live shows to go on but with a big change
Dramatic rescue for crew of tourist pirate ship
Business leaders write letter backing Tories
How to half cherry tomatoes in seconds
Time is running out to get an ISA


text:
(Prior to Fall 2010, this course was known as PHIL 34.The information below might still reflect the old course numbers. Bracketed numbers, if any, are the old course numbers. Learn more...)
3 hours; 3 credits
Philosophical problems of formal logic: logical truth, entailment, meaning and reference, ontology, logical and semantical paradoxes, semantic categories, relation of formal logic to natural languages.
Prerequisite: Philosophy 3203 [13] or 3204 [33], or an equivalent logic course or permission of the chairperson.
Take advantage of our two five-week summer sessions for both undergraduate and graduate students.
If you can't be here in person, take our virtual tour and discover the beauty and vitality of our campus.
Our faculty not only share their discoveries and knowledge with you, they invite you to be active members of their research teams.
A privately owned residence hall is located just blocks from the college.
© 2012 All Rights Reserved Brooklyn College
2900 Bedford Avenue, Brooklyn, NY 11210