text:
56th from "A" to Randolph
Arterial Street Rehabilitation
Project Information
May 29, 2013
The City of Lincoln proposes to rehabilitate 56th from "A" to Randolph beginning on June 3, 2013, weather permitting. The existing concrete base will be removed in the outside lanes. The existing west curb will remain in place. 56th Street will be widened to 35 feet to accommodate a center common left turn lane. New concrete base will be poured in the outside lanes along with new curb and gutter. The roadway will be overlaid with new asphalt and pavement markings. Pedestrian curb ramps along 56th Street will be reconstructed to meet ADA standards. Construction is expected to take eight weeks. Utility relocations by LES, Windstream, Time Warner Cable, and Black Hills Energy will be taking place with this project.
Constructors Inc. will be the contractor. They will perform the work under a total street closure with the road closed to through traffic. The detour for 56th Street will be west of "A" to 48th, north on 48th to Randolph, and east on Randolph to 56th. During the construction operations, access to side streets and driveways will be restricted at times. The City will work with local businesses and residences regarding access during construction.
If a business or residence has a sprinkler system along the project route, either in close proximity to the curb ramps, driveways, and alley returns or along the curb line of South 56th Street, they are asked to flag the sprinkler heads to aid the contractor in minimizing damage.
Public Involvement
- Neighborhood Meeting - March 28, 2012
- 5:00 to 6:30 p.m.
- Gere Library, 56th and Normal
Project Contacts
Construction Project Manager
Ron Edson
Public Works and Utilities, Engineering Services
Phone: 402-525-9294
Email: firstname.lastname@example.com
Project Contractor
Constructors Inc.
Steve Samuelson


text:
Thursday, September 10, 2009
26 comments:
This beggars the imagination. Campy, creepy, carnal, contrived calumny.
Puppet abuse indeed, I wonder how many kids will have nightmares about Jesus being eight feet tall with an African war mask for a face and ping-pong paddles for hands?
What is most surprising is we don't see anyone walking out of this "mess" in disgust.
- September 10, 2009 at 7:53 PM
- Damian Geminder said...
This "Mass" is a gathering of the heretical "Call to Action" crowd, if memory serves me right. Everyone there wholeheartedly approved of this travesty, you can be sure.
- September 10, 2009 at 8:49 PM
oh dear....
- September 10, 2009 at 9:02 PM
Mental institution chapel?!?!?!
- September 11, 2009 at 7:05 AM
- Quotidian Grace said...
OMG! How did anyone keep a straight face.
Never saw anything like this--it is equally hilarious and dismal and appalling.
- September 11, 2009 at 9:03 AM
- Elephantschild said...
But hey, they've got the thurible swinging. Does that make 'em "high church" liturgical monster puppet abusers? Snort.
- September 11, 2009 at 11:48 AM
- Lynn said...
Kinda stumbled on this site by accident and keep coming back because it is interesting. I only watched the first three minutes and I am not familiar with what the liturgy should be because I am not Catholic, Presbyterian, Anglican, Episcopalian or clergy of any sort so I am humbly and rather timidly commenting on this from a lay perspective. The first thing that struck me besides "that's certainly different" was the diversity of giftings that were being utilized and the varied ages of the people involved. so, while such a "presentation" may not be for either you or I (my own church would probably be horrified) I was impressed that people of all ages, varying giftings and the different media were used. sometimes God uses the strangest things to get our attention.
- September 11, 2009 at 2:10 PM
Lynn, I'm not sure it was God who was getting our attention with those scary larger-than-life puppets (not to mention the liturgical dancers!).
Do they remind anyone else of this?: http://www.youtube.com/watch?v=w4HMRtxY-ik
- September 11, 2009 at 3:57 PM
Lynn, I think this "diversity" is certainly misplaced. Sacredness of the liturgy is not a platform for performances. Worship Services of any sort should have God as the center of attention, not the community. Community gatherings OUTSIDE the service is perfectly fine for showing off this wonderful talent.
- September 11, 2009 at 8:14 PM
- Iggy said...
It looks like they are in a hotel conference room.
The speaker talks about "rebuilding the church."
I wonder what the story behind this is?
- September 12, 2009 at 8:14 AM
- St. Blogwen said...
@Quotidian Grace-- Actually, have you ever seen this: http://www.pcusa.org/pcnews/2008/08282.htm ?
Before I saw the fully-vested priest, I thought this was a PCUSA performance! Aaaagggghhhh!!
- September 13, 2009 at 1:59 AM
- Dakotapam said...
average age of "congregation" once again noted.
- September 14, 2009 at 3:03 PM
- Elephantschild said...
Ok, maybe that's a bad term to use...
- September 14, 2009 at 4:13 PM
- The Bovina Bloviator said...
Fr. Bergstrazer that's not Jesus, I believe it's St. Spatula of Ecko, the patron saint of kitchen utensils.
- September 16, 2009 at 2:49 PM
Run away. RUN AWAY!!!
*sound of coconuts clapped together*
- September 18, 2009 at 12:08 PM
But where are the snakes? Aren't you supposed to handle rattlesnakes when you do this sort of thing?
- September 30, 2009 at 6:55 AM
I'm not a churchgoer anymore, but I love the ancient art, ritual and that is found in the historic liturgies (whether Catholic, Anglican, Orthodox, Lutheran, etc.)
This is just disgraceful. I hate, absolutely hate, unequivocally hate liturgical dance. The big puppets are fun and interesting, but they belong in performance or on the street, not during a worship service.
If a non-believer feels this way it must be bad!!!
- October 6, 2009 at 6:17 PM
- Sand Mama said...
Please please stop the whirling!
- October 27, 2009 at 12:00 PM
do those people who do the 'liturgical dance' get asked, or do they always volunteer?
- November 2, 2009 at 6:50 PM
- stpetric said...
Anonymous said, "EEEEEKKKKK!!!!!
Mental institution chapel?!?!?!"
I've been chaplain in a mental hospital, and *we* never put on anything like this!
- November 21, 2009 at 2:25 PM
I sure didn't think that you could top the clown service.........Yep!!
- November 23, 2009 at 1:45 AM
- FrZ+ said...
At least the priest seemed mildly embarrassed...
I was going to say that he was old enough to know better, but, well... at least he's old enough to remember better.
I have to admit, it's been awhile since I've laughed so. And grateful that, for once, this travesty was from the other side of the Tiber!
- January 2, 2010 at 11:04 AM
- Christopher Orczy said...
And we wonder why people ignore the church. Truly dreadful and embarrassing for everyone involved. Liturgical dance is always awful, but combined with giant puppets it is beyond comprehension.
- February 26, 2010 at 10:26 PM
- Chris said...
I was hoping that we would get to see the puppets attempting to take communion with their paddle hands? Communion in both kinds, even?
- August 26, 2010 at 9:23 AM
Very easy to be dismissive of someone else's form of worship, very easy to sneer as those who know better. Where two or three are gathered in my name, there I am. People are individual and this is one collective's effort to understand the mystery of God made Man. How are the puppets different from presenting Christ through other images, statues, icons, or even someone dressing as Him as they did at my Catholic Easter service?
- March 16, 2012 at 7:13 AM
- Chris said...
Yes Anonymous - they really make it too easy. I'm not sneering, but no doubt a watching world is. This form of liturgical stupidity and indulgence opens up the name of Christ to all kinds of dishonour and mockery.
Now as a reformed presbyterian, I don't abide by icons or images either (although I acknowledge some inconsistency in my life in this regard), but this seems to be in a whole other category. I get how Christians can find images useful (I really do!), but this is just disturbing.
As for your quote about "when two or three are gathered...", perhaps you should check the context there. It's talking about discipling a church member, not giving licence for every kind of foolishness. Oh, and I think it means two or three people, not two or three puppets.
- April 13, 2012 at 6:25 AM

subset: commoncrawl


text:
I have made over 25 teams from around the world on my NBA Live 10 and have saved them to a USB. I am wondering if I can transfer the files and email them to whoever would want to play with them. I have teams like Canada, Taiwan, Norway, Jamaica, Bahamas, Aruba, Indonesia, Thailand, Sudan, Namibia, Sudan U-22, Chad, Haiti, Haiti U-22, Chile, Dominican Republic, Somalia, Scotland, DR of Congo, Guinea, Niger, Guyana, Cayman Islands, Israel, Dominica, Mongolia, Tanzania, U.S. Virgin Islands, Kyrgyzstan
It may not be the best international teams, but it's fun to take the small countries and go against the FIBA teams, or you can play them against each other.
If someone can figure out how to or let me know if it is possible to transfer the files via email or ps3 please tell me. Thanks


text:
Reduced energy consumption
Helping equipment do more with less
Functioning almost as a mini-city, airport terminals use a tremendous amount of energy. With emissions regulations long standing and PPPs (Public Private Partnerships) on the rise, airport managers have a growing focus on the bottom line. SKF can help with a range of condition monitoring services, maintenance tools and bearing solutions.
SKF Energy Efficient deep groove ball bearings
Next generation bearings operate with 30 % less friction than conventional bearings
SKF Automatic lubricators
Gas or electro-mechanically driven single point automatic lubricators
Low-friction seals for housings
Less friction means less wasted energy
SKF condition monitoring products, services and software
Solutions to get a programme off the ground or take it to the next level
SKF MetroCon
Boost uptime and smooth flow of people with SKF condition-based maintenance
SKF Sealed Energy Efficient deep groove ball bearing
SKF offers a new sealed deep groove ball bearing line which offers 30% lower friction while maintaining high seal ability


text:
Dermatosis occurring either as an isolated genetic trait with autosomal dominant inheritance or together with connective tissue disorders such as Ehlers-Danlos syndrome, Marfan's syndrome and osteogenesis imperfecta. In this dermatosis, transepidermal extrusion of elastic material occurs, frequently peri- or transfollicularly. The disorder presents with annular, circular, serpiginous, ridged lesions consisting of narrow, hard, keratotic or verruciform reddish papules. The lesions show a tendency to peripheral progression and central healing. The neck, the cheeks, and the extremities are particularly involved. Perforating Elastoma mainly begins in youth.
Perforating Elastoma, Elastosis Perforans Serpiginosa, Elastosis Intrapapillare Perforans Verucciforme, Perforating Serpiginous Elastosis
Disease, Lutz-Miescher, Elastoma, Miescher's, Elastosis perforan serpiginosa, Elastosis perforans serpiginosa, Elastosis, perforans serpiginosa, Keratosis follicul serpiginosa, Keratosis follicularis serpiginosa, LUTZ-MIESCHER DISEASE, Miescher's elastoma, Perforat serpiginous elastosis, Perforating elastoma, PERFORATING ELASTOSIS, Perforating serpiginous elastosis


text:
The first anti-bullying law in Massachusetts was signed yesterday following the tragic suicide of Phoebe Prince.
Civil rights lawyers and plaintiffs' attorneys are now questioning if the law has gone too far in limiting student's right to free speech.
As Governor Deval Patrick signed the anti-bullying law supported celebrated it as the best effort yet in deterring the behavior which led 15-year-old Phoebe Prince to take her own life.
Some 44 states across the country now ban bullying of student, both online and in person. However federal law suits are now increasing as parents of students who have been charged under these acts are fighting back.
State Representative Martha Walz, who was the primary sponsor for the anit-bullying bill in Massachusetts said she had focused on drafting a bill that preserved the First Amendment rights of students.
She said "That was a very significant concern of mine — that we do not trample on the civil liberties of students."
Walz said the bill is unique as it has built on the laws which other states hold. The bill gained momentum as the news of Phoebe Prince's suicide made international headlines.
This bill will require all students from kindergarten through 12th grade undertake anti-bullying curriculum every year. This course will be covered in private as well as public schools.
"The way we're going to address the bullying problem is to fundamentally change the school culture," said Walz.
"One of the ways to do that is to educate the students from a very early age about how to interact with one another, how to deal with conflict, and how to help classmates when they are being treated inappropriately."
While Walz's attitude to bullying makes sense others believe that it is against the First Constitution.
Evan S. Cohen, a Los Angeles lawyer, won a federal case on behalf of his daughter. She had been suspended from school for posting a video on YouTube. The video contained footage of her friends mocking a classmate in a restaurant.
In this case the judge ruled said "simply because another student takes offense to their speech, without any evidence that such speech caused a substantial disruption of the school's activities.
"The court cannot uphold school discipline of student speech simply because young persons are unpredictable or immature, or because, in general, teenagers are emotionally fragile and may often fight over hurtful comments."
In Mercer County, Pennsylvania the district lost the right to suspend a teenage boy after he created a fake MySpace page for his principal, referring to him as a "big steroid freak" and a "big whore". The court ruled that the page was protected under free speech.
It seems that school districts are finding it difficult to strike a balance between combating cyber-bullying and avoiding freedom of speech violations.
Boston civil rights lawyer, Harvey A. Silverglate said "School authorities are going to overreact, and we're going to have a firestorm of administrative actions against kids for saying things that are merely slightly unpleasant but do not qualify as bullying or harassment or stalking or any other such thing."
Walz said she has already taken note of problems that might arise, such as every little complaint being brought to the attention of the police. The state Department of Elementary and Secondary Education plan to draft a policy on when schools should contact the police.
She believes that most bullying allegations will remain in the schools but will be highlighted and brought into the light. It is hoped that steps such as these will prevent tragedies, like Phoebe Prince's suicide, happening again.


text:
BRECKENRIDGE, Colo.—A Summit County judge has issued a gag order in the case of a man facing charges alleging he struck his wife in the back of her head with a hatchet.
Prosecutors say 43-year-old Michael Newcomb is charged with attempted murder, assault with a deadly weapon and menacing. The woman needed stitches for her injuries.
The woman was taken to a hospital Jan. 31 with a skull fracture from the hatchet and a blow to the front of her head from a metal pipe.
According to the Summit Daily ( http://tinyurl.com/a8ddgbx), Judge Edward Casias granted a defense motion Tuesday asking the media to refrain from publishing information that might prejudice possible jurors.
Family members have protested, saying Newcomb has not been allowed to tell his side of the story.
Information from: Summit Daily News, http://www.summitdaily.com/


text:
As part of the practice squad at Team USA training camp earlier this month, Thompson took a weeklong pounding from the likes of Kobe Bryant, LeBron James and Russell Westbrook. But by camp's end, he had accomplished everything he hoped to. He got some intense training. He got to test his skills against the best in the game.
And he got some respect.
"I like Klay. I think he's got one of the brightest young futures in our game," James said. "With his ability, the way he can shoot the ball and make plays, and with his size, Golden State's really got something in him."
"He just knows how to play the game of basketball," Brooklyn Nets point guard Deron Williams said. "I think he's going to be special as the years go on. As a rookie last year, I thought he made a great impact. He'll continue to get better."
http://www.mercurynews.com/warriors/ci_ ... n-team-usa
I really think this experience is going to speed up the progression of Thompson's game. He's practicing against the best the NBA has to offer, and he's being schooled, yet competing at a high level. If you read the article, there's multiple players (Kobe, Lebron, D Will) that are giving him props. My hope is that he soaks up as much advice and lessons as possible. He's clearly seeing what makes these players elite, and what he needs to work on in order to reach their level.
i'm very excited about Klay Thompson's future.


text:
French Art Deco Geometric Design Rug Carpet
Click Image for Gallery
French Art Deco Geometric Design Rug Carpet
Click on image to enlarge
Inventory ID: 051913
French Art Deco geometric design rug carpet with purple and beige colors signed with the initial "R" inside a "C" 5.5 x 7.5'
Measurements: 66" w x 90" d
*As seen in the following movies and tv productions:
Columbia Pictures/ "Hitch"
HBO/Bootleg Prods.,Inc/ "Boardwalk Empire"About Us For four generations, Newel has inspired international collectors and designers with one of the most extensive decorative and fine arts galleries in the world.A family business since 1939, our roots are firmly planted in New York, where we spent our earliest days furnishing some of Broadway's most fabled productions. Today, we continue the tradition as the world's premier decorative arts resource for distinguished private collectors and industry-leading designers.From our vast collections to our curated gallery, we inspire our clients to discover the magic moment when classic style meets modern elegance.Our current collection boasts over 10,000 extraordinary works from around the globe, with classic pieces dating from the 17th- to 21st-centuries, in addition to a trove of contemporary original designs and reproductions.In 2015, we celebrated a significant expansion, with our curated services now offered at two new locations: a 9000-square-foot gallery and showroom in Manhattan, and a 55,000-square-foot building in nearby Long Island City, the permanent home to our extended collection. Questions? Click here to contact seller Payment Payment We accept payment by: Paypal, Bank Wire and CheckPlease note: If payment is made by check, the check first has to clear before the merchandise will be available for pickupPlease contact us through messages for further questions. Office hours are Monday through Friday from 9am to 5pm. Shipping Shipping We do not pack, wrap, crate or ship any items. All shipping must be arranged by the buyer. We are happy to assist with shipping by obtaining shipping quotes. If a shipping quote is requested before the purchase of an item and approved, we can add the shipping fee to the final invoice of the item. Please contact us through messages for further questions. Office hours are Monday through Friday from 9am to 5pm. Terms Terms 1. PURPOSE AND EFFECT. The following terms and conditions set out all the terms of agreement other than price between you as buyer andNewel as seller, in relation to the sale and purchase of the item or items identified in the invoice, which we refer to below as the "work". We confirmthat we either own the Work or are authorized to sell it on behalf of the owner. If you wish to rely on any variation of, or addition to, these termsand conditions, you must ensure that any such variation or addition has been agreed in writing by Newel.2. STATEMENTS ABOUT THE WORK2.1 All items are sold AS IS. Any and all statements by us as to the authenticity, attribution, description, date, age, provenance, title, orcondition of the work constitute our judgment and opinion only and are not warranted by Newel. We do not accept any liability as a result of anychanges in expert opinion by Newel or any third party which may take place subsequent to the sale. This paragraph, however, shall not operate so asto exclude any liability on Newel's part for any fraudulent misrepresentation concerning the work.2.2 Newel cannot warrant and is not authorized to certify UL Laboratory compliance for any item.2.3 While we will on request explain the condition of the work, at the time of the sale and provide any information about condition forwhich you may reasonably ask, we will not be responsible for any subsequent deterioration of the work, however occasioned, after the sale.2.4 You are responsible for satisfying yourself as to statements made by us as to the matters set out in paragraphs 2.1, 2.2 and 2.3 above.3. PAYMENT OF PURCHASE PRICE 3.1 You have 30 days from the date of the invoice to make full payment of the purchase price, together with the appropriate New Yorksales tax unless a properly executed resale/exempt use certificate or Bill of Lading for out of New York State delivery is in our possession.3.2 You are responsible for paying any delivery, packing, and insurance charges as well as all taxes including but not limited to import tax,duty, merchandise, sales or use tax that have to be paid in the country or destination whether on shipment or on import or any other time.3.3 If you fail to pay the purchase price in full within 45 days after the invoice date, we may assert any of our legal rights including, butnot limited to, canceling the sale. If you have taken delivery of the work we may at our discretion serve you with notice that we require you to returnthe work to us, in which case you must do so at your cost as soon as possible. Money on deposit will be refunded upon our receipt of the work in thesame condition as when it left our premises.4. COLLECTION OF THE WORK AND PASSING OF TITLE AND RISK OF LOSS4.1 You are responsible for arranging for pick up of the work from our premises in New York City after payment in full of the purchaseprice has been made. Any such pick up must be scheduled during regular business hours and at a mutually agreed time and date.4.2 From the time and date of agreed collection of the work from Newel, you will be responsible for the work and the risk of loss ordamage shall pass to you. 4.3 Title to the work shall pass from Newel to you when the purchase price is paid in full. If Newel has agreed to allow you to havepossession of the work before full payment of the purchase price has been made, you agree to: (a) keep possession of the work and insure it for notless than the purchase price, and not sell it or hand it over to any other person or dispose of any interest in the work; (b) allow Newel or a third partyacting on Newel's behalf to have access to the work in order to inspect it; and (c) preserve the work in the same state as it was on delivery and inparticular, not restore, repair, clean or reframe the work.5. RETURNS. The buyer may return the work for a full refund within 7 days of receipt of the work, provided, thatthe work is in the same condition as when it was sold. Any request to return a purchased work after such 7 day period will be for merchandise credit or full refund, only subject to notice of such return and approval of that credit or refund by Newel. In all cases, the cost of return is to be borne by the buyer. ALL custom made pieces are FINAL SALE and CANNOT be returned.6. NEWEL'S WARRANTY. NEWEL WARRANTS THAT THE WORK DELIVERED TO BUYER PURSUANT TO THIS SALES ORDERCONFORMS TO THE CONTRACT SPECIFICATIONS ON THE FACE HEREOF AND IS FREE OF DEFECTS IN TITLE. THE FOREGOINGEXPRESS WARRANTY IS IN LIEU OF AND EXCLUDES ALL OTHER WARRANTIES EXPRESSED OR IMPLIED, INCLUDING THEWARRANTY OF MERCHANTABILITY AND WARRANTY OF FITNESS FOR A PARTICULAR PURPOSE.7. MISCELLANEOUS7.1 These terms and conditions binds & inures to the benefit of the parties' assigns, successors, trustees, heirs, executors & administrators.7.2 Neither Newel's nor buyer's failure to insist upon strict performance of any provision of these terms and conditions shall be deemed awaiver of any rights hereunder.7.3 This transaction is made in the State of New York and all matters pertaining to this transaction and these terms and conditions shall begoverned by the laws of the State of New York, without regard for its principles of conflict of laws. Any proceedings or arbitrations arisinghereunder shall be prosecuted in or before a court, panel or other adjudicatory body located in the County of New York.7.4 The invalidity of any portion of these terms and conditions shall not effect the remainder of these terms and conditions. Trade Pricing Trade Pricing We are pleased to offer special pricing to trade buyers and private clients. Please contact us through messages for further questions. Office hours are Monday through Friday from 9am to 5pm. You may also be interested in... View more great items Template by Froo Apps Frooition | design, store design, shop design, template design, listing design


text:
Prime numbers
From HaskellWiki
1 Prime Number Resources
In mathematics, a prime number (or a prime) is a natural number which has exactly two distinct natural number divisors: 1 and itself. The smallest prime is thus 2.
Prime Numbers at Wikipedia.
Sieve of Eratosthenes at Wikipedia.
HackageDB packages:
Numbers: An assortment of number theoretic functions.
NumberSieves: Number Theoretic Sieves: primes, factorization, and Euler's Totient.
primes: Efficient, purely functional generation of prime numbers.
2 Finding Primes
Any natural number is representable as a product of powers of its prime factors, and so a prime has no prime divisors other than itself. That means that starting with 2, for each newly found prime we can eliminate from the rest of the numbers all such numbers that have this prime as their divisor, giving us the next available number as next prime. This is known as sieving the natural numbers, so that in the end what we are left with are just primes.
2.1 The Classic Turner's Sieve
Attributed to David Turner (SASL Language Manual, 1975), the following is a direct translation of that idea, generating a list of all prime numbers:
primes :: [Integer] primes = sieve [2..] where sieve (p:xs) = p : sieve [x | x<-xs, x `mod` p /= 0] -- or: filter ((/=0).(`mod`p)) xs
This should only be considered a specification, not a code. When run as is, it is extremely inefficient because it starts up the filters prematurely, immediately after each prime, instead of only after the prime's square has been reached. To be admitted as prime, each number will be tested for divisibility here by all its preceding primes, while just those not greater than its square root would suffice. This means that e.g. to find the 1001st prime (
7927), 1000 filters are used, when in fact just the first 24 are needed (upto
89's filter only).
So this in effect creates a cascade of nested filters in front of the infinite numbers supply, and in extremely premature fashion at that. One way of fixing that would be to postpone the creation of filters until the right moment, by decoupling the primes supply from the numbers supply, as in
2.2 Postponed Filters Sieve
primes :: [Integer] primes = 2: 3: sieve (tail primes) [5,7..] where sieve (p:ps) xs = h ++ sieve ps [x | x<-t, x `rem` p /= 0] -- or: filter ((/=0).(`rem`p)) t where (h,~(_:t)) = span (< p*p) xs
This can be seen as essential framework for all the code to come. It only tests odd numbers, and only by the primes that are needed, for each numbers span between successive squares of primes. To find the 1001st prime, the divisibility test is performed by only 24 nested filters corresponding to the first 24 odd primes.
Whereas the first version exhibits near O(n2) behavior, this one exhibits near O(n1.5) behavior, with an orders-of-magnitude speedup.
2.3 More Sieves Filtering the Prime Numbers In
The primes list creation with divisibility testing can be reformulated in a few more ways, using the list of primes as it is being built (a la "circular programming").
2.3.1 Odd numbers, by Trial Division
This is also good for generating a few 100,000s primes (when GHC-compiled as well):
primes :: [Integer] primes = 2: 3: filter isPrime [5,7..] where isPrime n = all (notDivs n) $ takeWhile (\p-> p*p <= n) (tail primes) notDivs n p = n `mod` p /= 0
Instead of relying on nested filters, it tests each odd number by an explicit list of all the needed prime factors. But for each number tested it re-fetches this list anew which will be the same for the increasing spans of numbers between the successive squares of primes.
2.3.2 Generated Spans, by Nested Filters
The other way to go instead of concentrating on the numbers supply, is to directly work on the successive spans between the primes squares.
This version is a bit faster still, creating 158,000 primes (again, GHC-compiled) in the same time as the postponed filters does 100,000 primes:
primes :: [Integer] primes = 2: 3: sieve [] (tail primes) 5 where notDivsBy d n = n `mod` d /= 0 sieve ds (p:ps) x = foldr (filter . notDivsBy) [x, x+2..p*p-2] ds ++ sieve (p:ds) ps (p*p+2)
This one explicitly maintains the list of primes needed for testing each odds span between successive primes squares, which it also explicitly generates. But it tests with nested
filters, which it repeatedly recreates.
2.3.3 Generated Spans, by List of Primes
The list of primes needed to test each range of odds is actually just the prefix of the primes list itself, of known length, and need not be specifically generated at all. Combined with one-call testing by the explicit list of primes, and direct generation of odds between the successive primes squares, this leads to:
primes :: [Integer] primes = 2: 3: sieve 0 (tail primes) 5 sieve k (p:ps) x = [x | x<-[x,x+2..p*p-2], and [x`rem`p/=0 | p<-fs]] -- or: all ((>0).(x`rem`)) fs ++ sieve (k+1) ps (p*p+2) where fs = take k (tail primes)
It produces about 222,000 primes in the same amount of time, and is good for creating about a million first primes, compiled.
The reason to have
sieve function available separately too is that it can also be used to produce primes above a given number, as in
primesFrom m = sieve (length h) ps $ m`div`2*2+1 where (h,(_:ps)) = span (<= (floor.sqrt.fromIntegral) m) primes
It can thus produce a few primes e.g. above
239812076741689, which is a square of the millionth odd prime, without having to compute all the preceding primes (which would number in trillions).
2.4 Getting the Composite Numbers Out
The divisibility testing too should be considered a specification (as in no multiples of p), and not a code per se, because although testing composites is cheap (as most of them will have small factors, so the test is soon aborted), testing prime numbers is costly, and is to be avoided.
2.4.1 Postponed Multiples Removal i.e. Euler's Sieve
All the filtering versions thus far try to keep the primes among all numbers by testing each number in isolation. Instead, we can just remove the prime's multiples in advance. We gain in speed because we now get the primes for free, after all the multiples are removed on a particular span, without performing any divisibility tests at all, with this simple variation of the Postponed Filters sieve:
primes :: [Integer] primes = 2: 3: sieve (tail primes) [5,7..] where sieve (p:ps) xs = h ++ sieve ps (t `minus` tail [q,q+2*p..]) where (h,~(_:t)) = span (< q) xs q = p*p minus :: (Ord a) => [a] -> [a] -> [a] minus a@(x:xs) b@(y:ys) = case compare x y of LT -> x: xs `minus` b EQ -> xs `minus` ys GT -> a `minus` ys minus a b = a
This is, in fact, Euler's sieve.
220.127.116.11 Merged Multiples Removal Sieve
(...((s-a)-b)-...) is the same as
(s-(a+b+...)), and so we can just remove the merged infinite primes multiples, each starting at its prime's square, from the initial numbers supply. This way we needn't explicitly jump to a prime's square because it's where its multiples start anyway:
primes :: [Integer] primes = 2:primes' where primes' = [3] ++ [5,7..] `minus` foldr merge' [] mults mults = map (\p->let q=p*p in (q,tail [q,q+2*p..])) $ primes' merge' (q,qs) xs = q : merge qs xs merge :: (Ord a) => [a] -> [a] -> [a] merge a@(x:xs) b@(y:ys) = case compare x y of LT -> x: merge xs b EQ -> x: merge xs ys GT -> y: merge a ys merge a b = if null a then b else a
This code is yet faster. Its main deficiency still is that it creates a linear nested merging structure, instead of a tree-like structure. Each multiple produced by a prime has to percolate to the top eventually, so it's better to make its path shorter. It'll have to go through fewer merge nodes this way.
The linearity is imposed by type asymmetry of our
(merge' :: a -> b -> b) function, forcing us into the
1+(1+(1+(1+...))) pattern,
+ standing for
merge' (which was defined that way to prevent the run-ahead when folding over the infinite list of lists of multiples).
We need to turn it into an associative operation of uniform type
(:: a -> a -> a) to be able to freely rearrange the combinations into arbitrary tree-like patterns, as in e.g. ((1+1)+(2+2))+(...) etc. The type uniformity is what makes compositionality possible.
The code in the "Implicit Heap" section below improves on that, and is essentially equivalent to using a treefold instead of a standard linear
foldr, as in:
22.214.171.124 Treefold Merged Multiples Removal
primes :: [Integer] primes = 2:primes' where primes' = [3,5] ++ drop 2 [3,5..] `minus` comps mults = map (\p-> let q=p*p in ([q],tail [q,q+2*p..])) $ primes' comps = fst $ tfold mergeSP (pairwise mergeSP mults) pairwise f (x:y:ys) = f x y : pairwise f ys tfold f (a: (b: (c:xs))) = (a `f` (b `f` c)) `f` tfold f (pairwise f xs) mergeSP (a,b) ~(c,d) = let (bc,bd) = spMerge b c d in (a ++ bc, bd) where spMerge b [] d = ([] ,merge b d) spMerge b@(x:xs) c@(y:ys) d = case compare x y of LT -> spCons x $ spMerge xs c d EQ -> spCons x $ spMerge xs ys d GT -> spCons y $ spMerge b ys d spCons x ~(a,b) = (x:a,b)
The fold used here creates a
(2+(2+2))+( (4+(4+4)) + ( (8+(8+8)) + ... )) structure, better adjusted for primes multiples production than
1+(2+(4+(8+...))), used by the "Implicit Heap" code, giving it additional 10% speedup.
mergeSP is an associative operation, preserving of the invariant such that for a list of multiples
[(a,b),(c,d), ...], it's always the case that
last a < head b && last a < head c. These "split pairs" represent ordered list as a pair of its known and (currently) finite prefix, and the rest of it. Such pairs under
mergeSP operation form a monoid, and if we were to declare a
mergeSP its
tfold its
comps would just become
This code exhibits approximately O(n1.20)..O(n1.15) local asymptotic behavior (tested interpreted, in GHCi, for 10,000 to 300,000 primes produced). When compared with Melissa O'Neill's PQ code from the ZIP package which was modified to work on odds only as well, it is 3.2x times faster, with used memory reported about 2.5x times smaller.
It can be further improved with the wheel optimization (as described below at the Prime Wheels section):
126.96.36.199 Treefold Merged Multiples, with Wheel
primes :: [Integer] primes = 2:3:5:7:primes' where primes' = [11,13] ++ drop 2 (rollFrom 11) `minus` comps mults = map (\p-> fromList $ map (p*) $ rollFrom p) $ primes' comps = fst $ tfold mergeSP (pairwise mergeSP mults) fromList (x:xs) = ([x],xs) rollFrom n = let x = (n-11) `mod` 210 (y,_) = span (< x) wheelNums in roll n $ drop (length y) wheel wheelNums = roll 0 wheel roll = scanl (+) wheel = 2:4:2:4:6:2:6:4:2:4:6:6:2:6:4:2:6:4:6:8:4:2:4:2: 4:8:6:4:6:2:4:6:2:6:6:4:2:4:6:2:6:4:2:4:2:10:2:10:wheel
This runs about 2.5x times faster than the Priority Queue-based code as present in Melissa O'Neill's ZIP package, with similar local asymptotic behavior of about O(n1.25)..O(n1.17) (tested interpreted, in GHCi, for 10,000 to 300,000 primes produced), with used memory reported about twice less as well.
2.4.2 Multiples Removal on Generated Spans, or Sieve of Eratosthenes
Euler's sieve, with work done segment-wise, on the spans of numbers between the successive primes squares, becomes
primes :: [Integer] primes = 2: 3: sieve [] (tail primes) 5 where sieve fs (p:ps) x = [x,x+2..q-2] `minus` foldl merge [] mults ++ sieve ((2*p,q):fs') ps (q+2) where q = p*p mults = [ [y+s,y+2*s..q] | (s,y)<- fs] fs' = [ (s,last ms) | ((s,_),ms)<- zip fs mults]
This modifies the Generated Spans sieve to "mark" the odd composites in a given range (instead of testing all the odds' divisibility) by generating them - just as a person performing the original sieve of Eratosthenes would do, marking one by one the multiples of the relevant primes.
Interpreted under both GHCi and WinHugs, it runs faster, takes less memory, and has better asymptotic behavior, its performance approximately the same as in the Merged Multiples Removal sieve. The advantage in working with spans explicitly is that this code is easily amendable to using arrays for the composites marking and removal on each finite span.
2.5 Using Immutable Arrays
2.5.1 Generating Segments of Primes
The removal of multiples on each segment of odds in the Sieve of Eratosthenes can be done by actually marking them in an array, instead of manipulating lists with "minus" and "merge":
primes :: [Integer] primes = 2: 3: sieve [] (tail primes) 5 where sieve fs (p:ps) x = [i | i<- [x,x+2..q-2], a!i] ++ sieve ((2*p,q):fs') ps (q+2) where q = p*p mults = [ [y+s,y+2*s..q] | (s,y)<- fs] fs' = [ (s,last ms) | ((s,_),ms)<- zip fs mults] a = accumArray (\a b->False) True (x,q-2) [(i,()) | ms<- mults, i<- ms]
Apparently, arrays are fast too. This code, compared with Treefold Merged with Wheel version (itself 2.5x times faster than Melissa O'Neill's PQ version), runs at about the same time and memory usage, but improving slightly with slightly better local asymptotics.
2.5.2 Calculating Primes Upto a Given Value
primesToN n = 2: [i | i<-[3,5..n], ar!i] where ar = f 5 $ accumArray (\a b->False) True (3,n) [(i,()) | i<- [9,15..n]] f p a | q > n = a | True = if null x then a' else f (head x) a' where q = p*p a'= a//[(i,False)|i<-[q,q+2*p..n]] x = [i | i<-[p+2,p+4..n], a' !i]
2.5.3 Calculating Primes in a Given Range
primesFromTo a b = (if a<3 then [2] else []) ++ [i | i<-[o,o+2..b], ar!i] where o = max (if even a then a+1 else a) 3 r = floor.sqrt.fromInteger $ b+1 ar = accumArray (\a b-> False) True (o,b) [(i,()) | p <- [3,5..r] , let q = p*p s = 2*p (n,x) = quotRem (o - q) s q' = if o <= q then q else q + (n + signum x)*s , i<- [q',q'+s..b] ]
Although testing by odds instead of by primes, the array generation is so fast that it is very much feasible and even preferable for quick generation of some short spans of relatively big primes.
2.6 Using Mutable Arrays
Using mutable arrays is the fastest and most memory efficient way to calculate prime numbers in Haskell.
2.6.1 Using ST Array
This method implements the Sieve of Eratosthenes, similar to how you might do it in C.
import Control.Monad import Control.Monad.ST import Data.Array.IArray import Data.Array.MArray import Data.Array.ST import Data.Array.Unboxed primesToNA :: Int -> UArray Int Bool primesToNA n = runSTUArray sieve where sieve = do a <- newArray (2,n) True :: ST s (STUArray s Int Bool) let sr = floor . (sqrt::Double->Double) . fromIntegral $ n+1 forM_ [4,6..n] $ \j -> writeArray a j False forM_ [3,5..sr] $ \i -> do si <- readArray a i when si $ forM_ [i*i,i*i+i+i..n] $ \j -> writeArray a j False return a primesToN :: Int -> [Int] primesToN n = [i | (i,e) <- assocs . primesToNA $n, e]
2.6.2 Bitwise prime sieve with Template Haskell
Count the number of prime below a given 'n'. Shows fast bitwise arrays, and an example of Template Haskell to defeat your enemies.
{-# OPTIONS -O2 -optc-O -XBangPatterns #-} module Primes (nthPrime) where import Control.Monad.ST import Data.Array.ST import Data.Array.Base import System import Control.Monad import Data.Bits nthPrime :: Int -> Int nthPrime n = runST (sieve n) sieve n = do a <- newArray (3,n) True :: ST s (STUArray s Int Bool) let cutoff = truncate (sqrt $ fromIntegral n) + 1 go a n cutoff 3 1 go !a !m cutoff !n !c | n >= m = return c | otherwise = do e <- unsafeRead a n if e then if n < cutoff then let loop !j | j < m = do x <- unsafeRead a j when x $ unsafeWrite a j False loop (j+n) | otherwise = go a m cutoff (n+2) (c+1) in loop ( if n < 46340 then n * n else n `shiftL` 1) else go a m cutoff (n+2) (c+1) else go a m cutoff (n+2) c
And places in a module:
{-# OPTIONS -fth #-} import Primes main = print $( let x = nthPrime 10000000 in [| x |] )
Run as:
$ ghc --make -o primes Main.hs $ time ./primes 664579 ./primes 0.00s user 0.01s system 228% cpu 0.003 total
2.7 Implicit Heap
The following is a more efficient prime generator, implementing the sieve of Eratosthenes.See also the message threads Re: "no-coding" functional data structures via lazyness for more about how merging ordered lists amounts to creating an implicit heap and Re: Code and Perf. Data for Prime Finders for an explanation of the
data People a = VIP a (People a) | Crowd [a] mergeP :: Ord a => People a -> People a -> People a mergeP (VIP x xt) ys = VIP x $ mergeP xt ys mergeP (Crowd xs) (Crowd ys) = Crowd $ merge xs ys mergeP xs@(Crowd (x:xt)) ys@(VIP y yt) = case compare x y of LT -> VIP x $ mergeP (Crowd xt) ys EQ -> VIP x $ mergeP (Crowd xt) yt GT -> VIP y $ mergeP xs yt merge :: Ord a => [a] -> [a] -> [a] merge xs@(x:xt) ys@(y:yt) = case compare x y of LT -> x : merge xt ys EQ -> x : merge xt yt GT -> y : merge xs yt diff xs@(x:xt) ys@(y:yt) = case compare x y of LT -> x : diff xt ys EQ -> diff xt yt GT -> diff xs yt foldTree :: (a -> a -> a) -> [a] -> a foldTree f ~(x:xs) = x `f` foldTree f (pairs xs) where pairs ~(x: ~(y:ys)) = f x y : pairs ys primes, nonprimes :: [Integer] primes = 2:3:diff [5,7..] nonprimes nonprimes = serve . foldTree mergeP . map multiples $ tail primes where multiples p = vip [p*p,p*p+2*p..] vip (x:xs) = VIP x $ Crowd xs serve (VIP x xs) = x:serve xs serve (Crowd xs) = xs
2.8 Prime Wheels
The idea of only testing odd numbers can be extended further. For instance, it is a useful fact that every prime number other than 2 and 3 must be of the form 6k + 1 or 6k + 5. Thus, we only need to test these numbers:
primes :: [Integer] primes = 2:3:primes' where 1:p:candidates = [6*k+r | k <- [0..], r <- [1,5]] primes' = p : filter isPrime candidates isPrime n = all (not . divides n) $ takeWhile (\p -> p*p <= n) primes' divides n p = n `mod` p == 0
Such a scheme to generate candidate numbers first that avoid a given set of primes as divisors is called a prime wheel. Imagine that you had a wheel of circumference 6 to be rolled along the number line. With spikes positioned 1 and 5 units around the circumference, rolling the wheel will prick holes exactly in those positions on the line whose numbers are not divisible by 2 and 3.
A wheel can be represented by its circumference and the spiked positions.
data Wheel = Wheel Integer [Integer]
We prick out numbers by rolling the wheel.
roll (Wheel n rs) = [n*k+r | k <- [0..], r <- rs]
The smallest wheel is the unit wheel with one spike, it will prick out every number.
w0 = Wheel 1 [1]
nextSize (Wheel n rs) p = Wheel (p*n) [r' | k <- [0..(p-1)], r <- rs, let r' = n*k+r, r' `mod` p /= 0]
mkWheel ds = foldl nextSize w0 ds
Now, we can generate prime numbers with a wheel that for instance avoids all multiples of 2, 3, 5 and 7.
primes :: [Integer] primes = small ++ large where 1:p:candidates = roll $ mkWheel small small = [2,3,5,7] large = p : filter isPrime candidates isPrime n = all (not . divides n) $ takeWhile (\p -> p*p <= n) large divides n p = n `mod` p == 0
It's a pretty big wheel with a circumference of 210 and allows us to calculate the first 10000 primes in convenient time.
A fixed size wheel is fine, but how about adapting the wheel size while generating prime numbers? See the functional pearl titled Lazy wheel sieves and spirals of primes for more.
2.9 Using IntSet for a traditional sieve
module Sieve where import qualified Data.IntSet as I -- findNext - finds the next member of an IntSet. findNext c is | I.member c is = c | c > I.findMax is = error "Ooops. No next number in set." | otherwise = findNext (c+1) is -- mark - delete all multiples of n from n*n to the end of the set mark n is = is I.\\ (I.fromAscList (takeWhile (<=end) (map (n*) [n..]))) where end = I.findMax is -- primes - gives all primes up to n primes n = worker 2 (I.fromAscList [2..n]) where worker x is | (x*x) > n = is | otherwise = worker (findNext (x+1) is) (mark x is)
3 Testing Primality
3.1 Primality Test and Integer Factorization
Given an infinite list of prime numbers, we can implement primality tests and integer factorization:
isPrime n = n > 1 && n == head (primeFactors n) primeFactors 1 = [] primeFactors n = go n primes where go n ps@(p:pt) | p*p > n = [n] | n `rem` p == 0 = p : go (n `quot` p) ps | otherwise = go n pt
3.2 Miller-Rabin Primality Test
find2km :: Integral a => a -> (a,a) find2km n = f 0 n where f k m | r == 1 = (k,m) | otherwise = f (k+1) q where (q,r) = quotRem m 2 millerRabinPrimality :: Integer -> Integer -> Bool millerRabinPrimality n a | a <= 1 || a >= n-1 = error $ "millerRabinPrimality: a out of range (" ++ show a ++ " for "++ show n ++ ")" | n < 2 = False | even n = False | b0 == 1 || b0 == n' = True | otherwise = iter (tail b) where n' = n-1 (k,m) = find2km n' b0 = powMod n a m b = take (fromIntegral k) $ iterate (squareMod n) b0 iter [] = False iter (x:xs) | x == 1 = False | x == n' = True | otherwise = iter xs pow' :: (Num a, Integral b) => (a -> a -> a) -> (a -> a) -> a -> b -> a pow' _ _ _ 0 = 1 pow' mul sq x' n' = f x' n' 1 where f x n y | n == 1 = x `mul` y | r == 0 = f x2 q y | otherwise = f x2 q (x `mul` y) where (q,r) = quotRem n 2 x2 = sq x mulMod :: Integral a => a -> a -> a -> a mulMod a b c = (b * c) `mod` a squareMod :: Integral a => a -> a -> a squareMod a b = (b * b) `rem` a powMod :: Integral a => a -> a -> a -> a powMod m = pow' (mulMod m) (squareMod m)
4 External links
- A collection of prime generators; the file "ONeillPrimes.hs" contains one of the fastest pure-Haskell prime generators. WARNING: Don't use the priority queue from that file for your projects: it's broken and works for primes only by a lucky chance.


text:
No-Show Policy
A no-show is a student who does not attend class or make any attempt to contact his or her instructor during the first full week of the semester. You are expected to attend class beginning the first day of the semester. If you are absent from the first class meeting, it is your responsibility to contact your instructor and confirm that you intend to be a student in his or her class.
Students taking online courses must log into the online instructional system within the first five days of the start of the academic term and complete the specified academic assignment as directed by the course instructor. Otherwise, instructors of online courses will report students as No Shows.
Consequences of Being a No-Show
The office of registration and records will remove no-show students from their classes, and instructors will not allow these students to attend classes during the second or subsequent weeks of the semester.
The Financial Aid Office will not award aid benefits for courses in which instructors report students as no-shows. The Financial Aid Office may also require students to repay all or a portion of the HOPE or Pell funds they received for the semester.


text:
A Simple SVG Converter based on Cairo
Project description
CairoSVG is a SVG converter based on Cairo. It can export SVG files to PDF, PostScript and PNG files.
For further information, please visit the CairoSVG Website.
Project details
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size & hash SHA256 hash help
|File type
|Python version
|Upload date
|CairoSVG-2.3.0-py3-none-any.whl (51.0 kB) Copy SHA256 hash SHA256
|CairoSVG-2.3.0.tar.gz (38.9 kB) Copy SHA256 hash SHA256


text: This event covers SBA loan options including which loan program meets a specific entrepreneurial need. The session begins with the grant funds myth for starting or expanding a business followed by the 5 C's of credit including character, cash flow, collateral, capitalization and conditions. It then transitions to an overview of SBA's actual loan programs. Lastly, specific information will be shared about interest rates and repayment terms plus our participating lenders. You Should Attend Whether you are an existing entrepreneur or have given thought to starting a business, this seminar will put you ahead of the game in government guaranteed lending. Jacqueline Merritt, Small Business Administration, is the presenter.


text:
Bisons close out exhibition season with loss at GSU
The Lipscomb Bisons soccer team closed out the preseason schedule Saturday night with a 2-1 loss at Georgia State.
The Bisons took a 1-0 lead in the first half when Garrett McLaughlin connected on a penalty kick at the 18:47 mark.
Georgia State came back to score two goals in the second half.
The Bisons attempted nine shots, six of them shots on goal. Garret Pettis led with three shots. McLaughlin led in shots on goal with two.
Goalkeeper Brent McGee mad three saves for the Bisons.
Georgia State attempted eight shots with five shots on goal.
The Bisons open the regular season Saturday at 7:30 in Dallas in the first round of the Southern Methodist Invitational.


text:
MLB.com sits down with Kasper, Gillispie
Len Kasper is the Cubs' television play-by-play broadcaster, while Mick Gillispie handles the radio broadcasts for the Double-A Tennessee Smokies. Kasper and Gillispie combine in Spring Training to deliver webcasts on Cubs.com, and they have watched nearly every one of the team's Cactus League games this spring. Here, they talk with Cubs.com's Carrie Muskat about the coming 2014 season.
MLB.com: What are some of the strengths of the team?
Len Kasper is the Cubs' television play-by-play broadcaster, while Mick Gillispie handles the radio broadcasts for the Double-A Tennessee Smokies. Kasper and Gillispie combine in Spring Training to deliver webcasts on Cubs.com, and they have watched nearly every one of the team's Cactus League games this spring. Here, they talk with Cubs.com's Carrie Muskat about the coming 2014 season.
MLB.com: What are some of the strengths of the team?
Kasper: I think the new coaching staff has brought an interesting energy here. Obviously, the Cubs will continue to do the things that [former manager] Dale Sveum and his staff did in terms of defensive shifting, but I think fundamentally this team will be good this season.
Gillispie: I like the energy, too. There's a lot of positivity when you walk into the clubhouse. It's been a lot of fun to watch some of the young guys play. They might not make the team, but when you watch Javier Baez and Albert Almora, those two, to me, have had great camps.
Kasper: Absolutely.
MLB.com: Talk about the buzz over Baez. Every time the guy hits a home run, you can sense in the ballpark the excitement.
Kasper: It seems to me that every time Baez is in a ballgame, he's noticeable. I would say 95 percent of the time it's positive. He had one little miscue at second base, but that's a position he probably is going to have to learn as time goes on. The Cubs will keep him at shortstop for the most part at Triple-A. If he needs to move defensively, they'll find a spot for him. His bat can play in the big leagues right now.
Gillispie: I think he'll make mistakes wherever he plays defensively. He makes up for them with the fact that not only does he hit home runs, but they come in big spots and it changes games. The power he has to all fields -- he's electric, and he's different than any other Minor League player the Cubs have. It's not just fastball power: He can hit any pitch out of the park. Is he going to swing at strikes and be disciplined, or is he going to swing at pitches out of the zone and strike out?
Kasper: I also think his bat speed is so off the charts that he can get fooled on pitches and still make good contact. Even when he hits a pop up, it reminds me of Mark McGwire. The ball is up in the air forever. When he hits home runs, they're not 365-footers; they're usually 410, 450. We saw him hit one over 450 against the Rockies this spring, and it's one of the longest home runs I've ever seen.
MLB.com: Are there a couple of players on the current team, the 2014 team, that fans should keep an eye on?
Kasper: I think Emilio Bonifacio, who was signed really late, in February, is a really intriguing guy. The Cubs have not had a lot of switch-hitters on their roster over the years, they haven't had a lot of speed and they haven't had a guy who can play as many positions can as Emilio can.
Gillispie: I like him in the leadoff spot, too. He had a slug-bunt single during camp; he hits it in the gaps and turns a double into a triple. Not only his versatility, but the fact that at the top of the lineup, they need a great leadoff guy.
Kasper: There's another guy, too, who could have a bust-out year, and that's Welington Castillo. I thought in the second half in 2013 he had a much more patient approach at the plate. I think maybe some of his offensive struggles early in 2013 may have been affected by all the stuff he has to know as a catcher. I think the pitchers now trust him, and I think he may be the most underrated player on the roster.
MLB.com: How about the pitching, with Jeff Samardzija on top. Do you like what you see from the starters?
Gillispie: I think Jeff Samardzija on the Yankees could win 20 games. You talk about this team, he's got to go out there and just throw strikes and try to keep the ball down. The start he made at Scottsdale Stadium, his stuff was as good as any pitcher I've seen. The fastball was always in the mid 90s, and the other pitches he was throwing that day had so much movement on them.
Kasper: I like the top two guys. You have a righty in Samardzija, a lefty in Travis Wood. Both guys will battle you. Travis never lets anything bother him, an All-Star last year. I think a lot of people are waiting to see how Year 2 will go for him after the All-Star appearance, but I think he's poised to have another good year.
MLB.com: One of the things I like about the team is that the closer situation is set. What have you seen from [Jose] Veras so far?
Kasper: Veras is a guy, you walk into the Cubs' clubhouse and all the pitchers seem to gather around his locker. He's 33 years old, came up as a Yankee, has been around the game for a long time and is really good for the young guys. The other thing I like is they have options. It's very rare to go through the course of an entire 162-game schedule and have one closer not have any sort of problems, either just needing a day off or struggling, and Pedro Strop gives them a nice backup option.
Gillispie: I think Alberto Cabrera has had a good spring, too. He's a guy from Minor League camp who has been on the 40-man roster. He's gotten to the big leagues a few times. But if he's one of those guys who could come up and throw strikes, that helps out, too.
Carrie Muskat is a reporter for MLB.com. She writes a blog, Muskat Ramblings, and you can follow her on Twitter @CarrieMuskat.


text:
Buggin Out: Random Guy Trys To Run Game On Keyshia Cole's Mother 'Frankie' "White Boys Love Black Bitches" + Frankie Scares Always Some Folks & Smacks The Hell Out Of A Dog
Frankie Walking Around. Buggin Out
Please click the "Report" button below if the video on this page is not working properly.
Comments will only be displayed by verified emails. No Spamming or Racism.


text:
Web Design And Auto Shop SEO For Kennewick, WA
Is your auto shop website not getting as many clicks as you anticipated? When it comes to bringing your auto company online, it requires a strong internet marketing plan, great web design, and organic SEO. These factors allow your auto shop to draw the attention of Google. Our team are experts in web design and auto shop SEO for Kennewick, WA. Utilizing content management, social media, and skilled web design, we make websites perform well in search engines, showing better results over time in the search engines and increasing visibility to potential auto customers. Let our skills go to work for your auto company today!
Call us at 800.377.3068 to get a free consultation and information on how web design and auto shop SEO can help your web presence grow today!
Complete Internet Marketing And Organic SEO
When it comes to optimizing and increasing your auto website's performance within the search engines, we are experts in the field. We offer lower rates than our competitors and no long term contracts, meaning you will be getting the best deal for your top-rate web design and auto shop SEO in Kennewick, WA. That's not all! We provide social media management services for your auto company's Facebook, Twitter, and Instagram accounts. With more people online than ever before, utilizing social media services is a must for auto companies that wish to grow and maintain their auto shop's customer base.
Another way people are starting to search for their needs, is through mapping programs, such as Google Maps. Typing "auto shop near me" will bring any auto shop mapped with Google up on their phones or laptops in an instant. Make your auto company one of the first they see! We offer optimization of our clients' auto company online presence, including mapping and directory listing. All of this, on top of our other services, means you are getting one sweet deal!
Let us help you improve your auto company's web presence today! Give us a call at 800.377.3068 for a free consultation! We offer low rates and do not require a long term contract to offer you the best web design and auto shop SEO in Kennewick, WA!
Interesting Facts About [City]
Kennewick, Washington is home to 77,421 individuals. Out of the 68,053 locals who are on the web in Kennewick, 34,707 (51%) are searching the internet from their smartphones. So what does this mean for your business? It means that having a website that loads quickly and is responsively designed will go a long way in reaching this audience!
Consider, too, that half of mobile searches are for nearby services, and over 60% of those inquiries resolve with a transaction of some sort. This is a big deal for local businesses! In light of this fact, your internet marketing must include mapping for the local area so that these consumers can find you as they search online.
85% (65,808 people in Kennewick, WA) rely on web searches to locate products and service providers, and it's hard to ignore the impact of social media on the search process given that 35,614 (46%) consumers in Kennewick, WA consider these platforms as they narrow down their options.
All of these facts point to the importance of having solid social media coverage and effective internet marketing in place! With nearly 68,053 (87.9%) people in Kennewick, WA searching online, it's vital that your SEM strategy appeals to those potential customers and gets you noticed.


text:
|Image by WonderBros
I started reading comic books in earnest in the early1980s, a good time for comics. I was introduced to the work of John Byrne, Walt Simonson, Frank Miller, Michael Golden, Bill Sienkiewicz, John Romita Jr., and other, then young, creators of the time.
|There's a bird in this image that you'll find if you look hard enough.
Glen told me that his mentor, Ollie Johnston, would say to him that every line in a drawing only exists in relationship to every other line in the drawing. Glen said that it took a while before Ollie's words made sense to him. But after a few years he got it. And he could see in watching Picasso that he got it, too.


text:
When the ceramics arts class from Falmouth High School visited Woods Hole Oceanographic Institution in November 2012, biologist Heidi Sosik showed them delicate and intricate images of a wide variety of life forms that thrive, unseen, in the local ocean.[ MORE ]
The images were taken by the Imaging FlowCytobot, an automatic underwater microscope deployed offshore at WHOI's Martha's Vineyard Coastal Observatory. [ LESS ]
Falmouth High School ceramics teacher Corine Adams wanted her students to think creatively about marine animals and art. The students gathered in WHOI's Redfield auditorium to hear about unfamiliar marine creatures and see images of them.[ MORE ]
Student Tyler Ragonese (center) took notes, as WHOI scientists gave short, illustrated introductions to plant and animal plankton, corals, and seafloor-dwelling animals. [ LESS ]
At the WHOI Exhibit Center, Falmouth High School ceramics students Christian Lineweaver and Tyler Ricketson take a turn trying to fit in the model of the submersible Alvin's personnel sphere. (The actual sphere carries three people on eight-hour dives to the ocean floor.[ MORE ]
Falmouth High School student Brittney Woodward looks through a microscope at the WHOI Exhibit Center. The class visit to WHOI, supported by the Falmouth Education Foundation, was organized by FHS art teacher Corine Adams and WHOI Exhibit Center manager Kathy Patterson.[ MORE ]
From left, Emily Turner, Sarah Elloian, Sarah Monteiro, and Donye Gonsalves work on ceramics projects at Falmouth High School. Teacher Corine Adams assigned three pieces to be inspired by marine biology.[ MORE ]
"I'm trying to come up with lessons that I can teach them something with, but that also has their interest and motivation, so they want to make something that they're happy with, that they can bring home or put on display." [ LESS ]
Nick Dinello shapes his clay sculpture in the FHS ceramics room. "I'm doing a brain coral," he said. "It's still coming along, so the colors will make it look more realistic.[ MORE ]
I'm going to paint the base purple and the lumps a vibrant green." On a visit to WHOI, the art students heard from Liz Drenkard, a Ph.D. student in the MIT-WHOI Joint Program who studies corals. Inset: The finished coral sculpture. [ LESS ]
Her right arm in a bright pink cast, Madison Heberl paints her piece the exact same color. "This is my abstract piece, and it's a puffer fish. It had to be abstract, so I made it a different color, and put eyes all around it.[ MORE ]
The painting's really bad, because I had to do it with my left hand!" [ LESS ]
After seeing WHOI postdoctoral scientist Amy Maas's presentation on types of tiny swimming snails called pteropods, Emily Turner decided to use them as a theme. "They are a kind of plankton.[ MORE ]
Sea angel and sea devil are what they're called. And these are salt and pepper shakers. They're the same kind of animal, kind of, but one's good, and one's bad and eats the other." Inset: the finished pieces. [ LESS ]
"I made a lobster, and a bowl with waves" said Donye Gonsalves. "It was difficult making the lobster's and connecting the tail. I make the legs, attach them, and sometimes they break off, so I keep putting them on.[ MORE ]
It's my realistic piece, so you have to have all the parts. I have to get the right paint color and paint them with the brush so it looks real." Lower right: the finished bowl. [ LESS ]
Art teacher Corine Adams discusses a technique with student Sarah Montiero. "For the realistic piece, I'm looking at proportion," Adams said. "If it's a whale, the tail has to be proportional to the body.[ MORE ]
And I'm looking at texture—if a starfish, that it has a lot of texture, and also color. They need me some of the time, but if they're not sure, they ask each other, 'How did you do that?' " [ LESS ]
WHOI President and Director Susan Avery (right) attended a reception March 22, 2013, at WHOI for Falmouth High School ceramics arts students. In front of cases displaying student art, Avery (right) talked with Rebekah Raber (holding her polar bear sculpture) and Anna Adams.[ MORE ]
The ceramics pieces will be on display in WHOI's Clark Laboratory until the end of April 2013. [ LESS ]
If muses for Pottery and Science roam the Earth, they don't often cross paths, especially in the halls of high school. But Falmouth High School art teacher Corine Adams wants her ceramics students to relate to the ocean that surrounds Cape Cod. So she gave them an unusual task: to research and make clay pieces inspired by marine animals.
In November 2012, Adams brought her students to Woods Hole Oceanographic Institution (WHOI) to hear about marine creatures from experts.
"The assignment was to do three pieces," Adams said, "one realistic, whether a fish or shell or animal; one completely or partially made on the potters' wheel; and one that was more abstract or unique—I didn't want to see another fish! It was wide open. Some liked the abstract one, some struggled with it. But it makes them think. It's not just skills, but thought, creativity behind it.
WHOI researchers presented slideshows and short descriptions of creatures they study: Scientist Heidi Sosik talked about microscopic plankton; graduate student Liz Drenkard discussed corals and reefs; postdoctoral scientist Amy Maas presented swimming snails called pteropods; and scientist Scott Gallager and researcher Amber York showed 3-D images of seafloor fish and other animals. Then WHOI Exhibit Center manager Kathy Patterson took the class to the center to explore.
"So many people don't appreciate how much of science has a connection to art," said Sosik. "Using art to reach young people with science seems like a great way to avoid preconceptions about science being complicated or boring. The students saw how such diverse forms of life thrive in the ocean—maybe without even knowing they were learning some science."
The students used their impressions from the day and their own research on marine life as inspiration for creative ceramics projects.
In December and January in a light-filled studio at Falmouth High School, students worked the clay. They molded and shaped, attached handles or animal legs, and decorated, painted, and fired their pieces—all while talking, listening to music, checking animals' images on their phones, and talking technique with their teacher.
With themes from plankton to killer whales, octopuses, and osprey—plus a few fish—students created sculptures, dinnerware, and abstract expressions.
"I liked hearing the talks at WHOI," said student Nicholas Dinello. "And I really like color. So when I saw the slides of corals, with all the bright color, I knew that was what I was going to do." His sculpture of a brain coral reveals his appreciation of vivid color.
"I did this with last year's class," Adams said. "Once the students started making these things, I contacted Kathy and said, 'I think you should see this.' This year I wrote a grant, funded by the Falmouth Education Foundation, which helped with the WHOI field trip and also with clay, glazes, and certain tools we didn't have, to give the students the opportunity to make things larger and use more colors."
The finished pieces are on display from March 9 to the end of April, 2013, in the lobby of the Clark Laboratory on the WHOI Quissett Campus. A reception for the students took place March 22, 2013, attended by WHOI President and Director Susan Avery.


text:
This month I got to choose the baking challenge on Have the Cake. As much as I love all the sweet stuff, I thought I would try more of a straight "baking" challenge and offer up bagels as this month's contest.
Before attempting this project however, I needed to finish my other project in the kitchen - painting. Before Christmas I started painting the kitchen, suffering from a brief memory lapse that allowed me to think that with a toddler and a 9-month-old I would be able to find the time to complete the painting before Christmas. Thanks to some wonderful friends who took the kids for a few hours this weekend, we finally completed the painting and here is the finished product:
And now on to bagels!
The bagel recipe that I used was one clipped from an old Sunset magazine of my mother's. It's a recipe for Asiago bagels, but since I didn't have Asiago (and don't really like Asiago bagels) I made onion bagels and Everything bagels with the basic bagel recipe.
Onion/Everything Bagels (Makes 12 bagels)
2 packages active dry yeast
3 Tblsp. sugar
1 1/2 tsp salt
3 Tblsp. dehydrated onion (optional)
About 6 cups all-purpose flour
1 large egg yolk
1. Combine yeast and 2 cups of warm water in a large mixing bowl; let stand 5 minutes until the yeast has bloomed. Mix in the sugar, onion, salt, and 5 1/2 cups of the flour until the dough forms a sticky ball.
2. Spread 1/2 cup of flour on a board and knead the flour into the dough. Knead the dough for about 10 minutes until the dough is smooth and no longer sticky, adding flour if necessary.
3. Put the dough into a warmed and oiled bowl and cover with plastic wrap or a cloth towel. (To warm the bowl swish hot water around the bowl, dry off the excess and then oil the bowl.) Allow the dough to rise until doubled in size (about 40 minutes).
4. Once the dough has risen, knead the dough briefly on a floured board and then divide into 12 equal portions. Form each piece into a ball and then while holding the ball in both hands use your thumbs to form a hole in the center of the ball. Keeping a thumb in the center, work around the bagel to make it smooth and evenly thick.
5. Allow the bagels to rise on a floured board, covered, for about 10 minutes.
6. Meanwhile, bring 3 quarts of water to a boil in a large pot.
7. Once the bagels have risen, drop them into the boiling water and boil until the bagels are spongy, but firm, 3 to 5 minutes.
8. Remove the bagels from the water with a slotted spoon and allow to drain on a towel or board. Once drained, put the bagels on greased baking sheets.
9. Beat the egg yolk with 1 Tblsp water and brush over the bagels. Add more onions for onion bagels and for "Everything" bagels, sprinkle with onion, salt, sesame seeds, poppy seeds and anything else you would like!
10. Bake the bagels in a 375 degree oven until browned, 30-35 minutes, and then cool on racks.
The dough itself was easy to make and I got it done quickly while the baby was napping and Anna was at her pre-pre-school class.
I do love kneading bread dough - there's something really relaxing about the folding and pushing of the soft dough under my hands. It was especially lovely kneading the dough since the baby was quiet, Anna was gone and I was listening to the "Garden State" soundtrack. I then let it rise in my warmed, oiled bowl:
Once I had formed the bagels (I really did not get the "12 equal portions" thing right!) and they had risen, I plopped them into the boiling water.
Fair warning here - I discovered that bagels get MUCH larger while they are boiling - I ended up with some really huge bagels!
After they were drained I basted the bagels with the egg wash and since I was using a paintbrush Anna, who was back from class by then, had to help with the basting:
She also had a great time helping me sprinkle all of the toppings onto the bagels...
While I was trying to boil, baste and then bake the bagels I had stupidly timed it to coincide with lunch time. So, while I was boiling bagels I was trying to also feed Henry his baby cereal and make Anna's lunch. It became a little hectic and I accidentally left Henry with the cereal spoon within reach. After sliming himself with the cereal from the spoon he got tired and starting pulling at his hair, resulting in this:
And yes, there was a bath for the small boy after the bagels were done...
But the chaos was well worth it as the bagels turned out beautifully!
They were yummy and chewy; just what I was hoping for in my bagel making adventure!


text:
As long-time readers know, Middlebury's Commencement, which took place this past Sunday, is when I traditionally pen my "Ode to My Favorite Graduating Student." This graduation, however, Middlebury awarded one of its honorary degrees to Vermont's senior Senator Patrick Leahy. Rather than spending commencement blogging, I was fortunate, along with my wife Alison, to spend time during the weekend with the Senator and his vivacious wife Marcelle. I can tell you that they are as down-to-earth and personable as any two Vermonters you might meet. Not surprisingly from someone who was first elected to the Senate in 1974, making him the second most senior current senator, Leahy in his almost four decades in the Senate has experienced the gamut of political life, from the momentous to the mundane to the comical, and he draws on all those experiences to produce a seemingly endless store of anecdotes – stories that he tells well, and with relish. I had the good sense to shut my mouth, listen and learn.
Given my research interests, of course, I was particularly interested in his take on the eight presidents with whom he has officially interacted, including President Obama. He did not disappoint, providing illuminating stories about almost all of them. (Since these were private conversations, I'm not going to repeat them here, but I can say it is clear that he has the utmost admiration and respect for Obama.)
Of perhaps greater interest, however, was his take on the current polarized nature of politics on Capitol Hill. When I indicated that voting studies suggest that the recent congresses are among the most polarized since the post-Civil War reconstruction period, he said that the polarization ran deeper than simply partisan differences on votes. It was reflected, for example, in instances in which senatorial colleagues could not be trusted to keep their word.
In his public comments at the dinner honoring the honorary degree recipients, Leahy drove that point home, but he did so not by criticizing his Senate colleagues but instead by reminiscing about his mentor – Vermont Senator Robert Stafford. Stafford was a Republican who represented Vermont in the House for a decade before being appointed in 1971 as the state's junior senator when the incumbent senator died in office. Stafford went on to win the special election to fill the vacancy, and was reelected in 1976 and 1982. (Many of you may recognize Stafford's name because of legislation he sponsored that funded undergraduate loans: the Stafford Elementary and Secondary Act of 1987.) He retired in 1989, and passed away in 2006.
Although he took office as a fiscal conservative and anti-communist, Stafford moderated his views the longer he remained in national office, most notably when he turned against the Vietnam War. He also became an early supporter of the environmental movement. But it wasn't Stafford's changing policy views that Leahy remembered – it was the Republican Stafford's willingness to reach across the aisle to the junior Democrat senator from Vermont. Most of you know Leahy as one of the most liberal members of the Senate, representing perhaps the most liberal state in the Union. But when Leahy first won election in 1974, he was the first Democrat ever to represent Vermont in the Senate (and technically remains the only Democrat to do so, since Bernie Sanders is officially an independent.) Vermont in 1974 was a staunchly Republican state, and had been for more than a century. Nonetheless, as Leahy recalled, Stafford went out of his way to work closely with the junior Senator although he was from a different party. For example, he suggested that Leahy serve on different committees than Stafford so that Vermont's interests could be more broadly served, and he shared office space as Leahy's staff got settled. More generally, Leahy recalled, Stafford in myriad ways sought to work closely with Leahy despite their partisan differences.
Today, in the current period of intense political polarization, when many critics have advocated reforming the Senate by, for instance, weakening the filibuster rule, Leahy's comments are a reminder that what ails the Senate is likely not going to be cured by procedural reforms. Instead, it requires changes to what political scientist James Q. Wilson, writing in 1987 (and drawing on Don K. Price), described as the "unwritten Constitution" – "those customs and arrangements that allow a government of separated institutions to work at all." Wilson was focused on the structural deficits that had at that point dominated political debate for almost a decade, and he was reacting to critics who cited those deficits as evidence that the American system of shared powers could no longer govern without institutional reforms. Wilson disagreed, arguing that no one could understand the way Congress worked by simply looking at its formal procedures and organization – instead, one must examine its informal customs and traditions. Leahy, in his public comments this weekend, made a similar point: that what is wrong with the Senate today is not that its rules and structure need changing, but that the norms of reciprocity, accommodation and bipartisanship that characterized the Senate of four decades ago have been largely lost. Whether – and how – they can be regained Leahy did not say. But if he is right, procedural reforms by themselves are unlikely to mitigate the intense polarization that now characterizes the United States Senate.