text:
click to reveal the promo code
Please provide us with your promo code at the time of order (202 241 3404) to receive 10% off your total purchase!
You must like us on facebook to reveal the code.
If you have already liked us, you may need to unlike and like again.


text:
Odd photo by Dinur.
Two nights after stealing a rare road win from the league-best Anaheim Ducks, the Jets head (slightly) north to face the always dangerous San Jose Sharks. Jets fans remember well the last time these two teams met back on November 10th, when captain Andrew Ladd was able to win an exciting, back and forth affair in the shootout at the MTS Centre.
When you're hot, you're hot, and the Jets are hot, but they may find just as big of a challenge waiting for them in San Jose as they did in Anaheim.
The Sharks share similar numbers with Anaheim so far this season:
Goals Against
San Jose may not score as much as Anaheim, but they certainly defend better. Their defensive corps contains a healthy mix of shut-down specialists and puck-movers, and almost every forward is a talented two-way player.
As pointed out by our own Travis Hrubeniuk, the Jets were able to beat the Ducks mainly because of puck luck. Most of Winnipeg's scoring chances came from sloppy neutral zone turnovers, bad passes, and forwards caught deep after a failed rush – in other words, predominantly defensive lapses.
The stingy Sharks are unlikely to offer up such presents to the Jets.
- Ladd – Little – Frolik
- Kane – Scheifele – Wheeler
- Setoguchi – Jokinen – Byfuglien
- Thorburn – O'Dell – Peluso
With the winning streak still going, Maurice is content to keep playing the same hand. Jets fans may not be so keen on this idea, and it was hard to not notice how the Jokinen line has gotten increasingly worse every game. Byfuglien's time at forward will inevitably end, but it may take a loss for Maurice to pull the trigger.
Kane's return sparked his line on Tuesday, and the top two lines were booming. It's hard to want anything more than their effort in the 3-1, so let's hope they push the pace early again tonight.
Call me crazy, but I'd say O'Dell has played well enough to move up to the third line. Move Buff back to D, promote O'Dell, dress Tangradi, and the Jets have an even stronger line-up.
- Bogosian – Enstrom
- Stuart – Trouba
- Pardy – Ellerby
- Pavelec
- Montoya
Same case as the forwards – Maurice isn't going to change anything until it stops working. It came close in Anaheim.
The Bogo-'Stromy combination held their own very well against the dynamic duo of Perry and Getzlaf, and they'll have to be just as strong against the Sharks. Stuart had a decent game for him (so still quite bad), but we never quite know what we'll get from him and Trouba. Ellerby and Pardy were the weakest link the Jets' chain, so let's hope they can put up a better effort against a thinning Sharks forward corps.
Ondrej Pavelec kept the Jets in it against the Ducks, but he keeps giving us reasons to doubt him every game. He's still often out of position, over-committing, and giving up bad rebounds, but it's impossible to say when goals will be scored because of it. If he can stay calm and stay in his net, Pavelec will give his team a better chance to win.
- Pavelski – Thornton – Burns
- Nieto – Marleau – Wingels
- Kearns – Desjardins – Kennedy
- Sheppard – McCarthy – Hayes
Injuries to Logan Couture, Tomas Hertl, and Raffi Torres thin this line-up out quite a bit, but there are threatening pieces nonetheless.
Joe Thornton is still going strong in his 17th NHL season, putting up 53 points in 50 games, good enough for 6th in the league. Joe Pavelski and Patrick "Disney's Captain Hook" Marleau's point production is only slightly behind Thornton's, with 50 and 47 points in as many games respectively. Brett Burns is thriving on the wing since his move to forward last season, and Tommy Wingels has already doubled his previous career season-high point total with 25 points.
As mentioned, the impact of injuries are a problem. San Jose has been forced to ice AHLers in Kearns, McCarthy, and Hayes between depth players like Kennedy and Sheppard. Evander Kane's return gives the Jets a solid top-nine forwards, and they could exploit the Sharks in this area.
- Boyle – Irwin
- Vlasic – Demers
- Stuart – Braun
- Niemi
- Stalock
When they're on, the Sharks don't give up a lot of scoring chances. Anything that gets through to the net is either low or along the ice, and shots like that never get past Antti Niemi.
Boyle, Demers, and Vlasic are putting up good point totals for the Sharks, while Irwin, Stuart, and Braun help shut down the opposition effectively. This is a fast-paced defensive corps with a quick transition game. The Jets will have to forecheck fast and hard, or the puck will be back in their zone before they know it.
This will be just as tough of a test as the Ducks were. San Jose can score in bunches, and have a handful of guys playing incredible hockey right now in Thornton, Marleau, Pavelski, Niemi, and Vlasic.
However, Winnipeg is firing at all cylinders too, and their potential edge in forward depth could help them grind out a win. The Jets scored four goals on the Sharks back in November, but that's a task that'll be hard to repeat. Winnipeg will need to play with a lot of patience, and take advantage of every opportunity they get.

subset: commoncrawl


text:
White House's Weak Response To Petition Against ACTA
from the bad-petition,-bad-result dept
However, while it took a while, the White House has finally responded, in the form of Miriam Sapiro, who is the deputy US Trade Rep -- i.e., second in command to USTR Ron Kirk. So, it's no surprise that her response is the usual mix of misleading to downright questionable statements:
As you may know, the proliferation of counterfeit and pirated goods poses considerable challenges for legitimate trade and economic development. Protecting intellectual property rights helps to further public policies that are designed to protect the public. ACTA will help authorities, for example, protect against the threat posed by potentially unsafe counterfeit goods that can pose a significant risk to public health, such as toothpaste with dangerous amounts of diethylene glycol (a chemical used in brake fluid), auto parts of unknown quality or suspect semiconductors used in life-saving defibrillators.Yup. Start out with the usual misleading crap of focusing solely on "health" risks from physical counterfeiting... totally ignoring that physical counterfeiting is an entirely different issue than copyright infringement of digital goods. But never bother to separate out or differentiate, even though the bulk of ACTA is targeted at dealing with digital infringement. As ACTA supporters have done since day one, they figure that if they just keep talking about counterfeit physical goods causing harm enough, perhaps they can avoid addressing the real issues -- which is exactly what Sapiro does here. Weak.
ACTA specifically recognizes the importance of free expression, due process, and privacy. It is the first -- and only -- international intellectual property rights agreement to provide explicitly that enforcement of intellectual property rights in the context of the Internet "shall be implemented in a manner that … preserves fundamental principles such as freedom of expression, fair process, and privacy." No provision in ACTA requires parties to disclose information "contrary to … laws protecting privacy rights." This includes the protections already in place in U.S. law.This, unfortunately, is because of the oddly worded original petition, that focused on "privacy," rather than the many other more serious problems with ACTA. It gave Sapiro an out by pretending that ACTA deals with the "problems" people are raising, while avoiding addressing any of the real problems, which aren't really about privacy.
In addition to the United States, approximately thirty countries have signed the Agreement, including Australia, Canada, Korea, Japan, New Zealand, Morocco, Singapore, and a majority of European Union member states, as well as the EU itself.This is a nice bit of trickery. While many countries did "sign" the agreement, signing and ratifying are completely different issues, and as we've seen, the EU Parliament is hopefully very, very close to rejecting ACTA. That Sapiro doesn't even acknowledge this true state of things is really rather incredible. As with her boss, she seems to be actively insulting the intelligence of people who are concerned about ACTA, by pretending (completely falsely) that there is worldwide acceptance of ACTA already.
We believe that ACTA will help protect the intellectual property that is essential to American jobs in innovative and creative industries. At the same time, ACTA recognizes the importance of online privacy, freedom of expression and due process, and calls on signatories to protect these values in the course of complying with the Agreement.[citation needed]
This whole response is pretty insulting. Yes, part of the problem was the poorly worded original petition, but the fact that Sapiro doesn't address any of the actual concerns of ACTA, and then pretends everything's just peachy with the agreement (and totally ignores the major constitutional question about how the Executive Branch can sign a treaty covering powers only granted to the Congress without Congressional approval), suggests a White House and USTR that still thinks it's pulling a fast one over on the American public.


text:
Such a strange day. Spent it listlessly looking at old diaries. Yes, I write detailed diaries - always have, since I was a little girl And all the entries sound like columns!! Even at age 12! Well, today I was searching for something specific. But I got so distracted reading about an encounter with Richard Gere a few years ago at Parmeshwar Godrej's palatial home that I fell off my chair laughing. He is quite a character. For all his Buddhist beliefs and closeness to the Dalai Lama, he is far from humble. In fact, I found him sharp, sardonic and arrogant. This was just before he got embroiled in the Shilpa Shetty kissing controversy and had an arrest warrant out for him! I'm not sure about the status of that warrant. Perhaps, his long absence from Mumbai has something to do with it?? That infamous kissing clip is worth studying, though. It was replayed on some tv channel recently, and I still feel it was offensive and downright cheeky, given the context ( an AIDS awareness programme for truckers). This was no friendly peck on the cheek, it was a full-on , slobbering attack, with Gere plastering several noisy smooches all over Shilpa's face. The poor girl looked startled as she awkwardly pushed him away - but he had her firmly in his grip, in that old Broadway position ( amorous man flips giggly bimbo over backwards) - and Shilpa could do nothing but grin and bear it.
There are many desi Geres in our lechy society, and a lot of women find it hard to fend them off when the ridiculous 'mwaah mwaah' nonsense takes place . I resist with all my might ... and succeed most times. I begin by doing a 'namastey' from a safe distance. If that is ignored, I extend my hand. Often, that's the mistake. Once the lech gets that hand, he refuses to let go. Worse, he pulls hard on that hand and shoves his horrible face close to yours. Wrenching the hand away at this point, is rather difficult. That leaves two options : you nimbly dodge that disgusting kiss by sharply turning to greet someone else ( the wrist can get seriously damaged during such a manoeuvre), or the lech ends up kissing the back of your head - and looking supremely foolish! It's better than submitting to unwarranted , unsolicited and totally ugh 'chummas' from randoms.
I decide who gets a kiss from me. It is my option. Anybody who tries that old slimey trick, risks getting publicly snubbed. GEDDIT????
Saif-Kareena. Ranbir-Katrina. Two pairs. Two movies. Lots of money riding on both. I prefer the latter. What's your verdict??


text:
Robert G. Gardner, 83, Brookfield, died Monday, June 24, 2013, at Pershing Memorial Hospital, Brookfield.
Robert G. Gardner, 83, Brookfield, died Monday, June 24, 2013, at Pershing Memorial Hospital, Brookfield.
Funeral services will be held at 11 a.m. Thursday, June 27, 2013, at Rhodes Funeral Home with Rev. Mike White officiating. Masonic services will be held at 5:30 p.m. today, June 26, 2013, at the funeral home with the family receiving friends from 6-8 p.m. Burial with military honors will be in Rose Hill Cemetery, Brookfield.
Memorials to the Kidney Foundation or the Diabetes Association may be left at or mailed to the funeral home at 216 Linn St., Brookfield, Mo. 64628. Online condolences may be left at www.rhodesfh.com.
Robert Gene was born September 22, 1929, in Denison, Kan., son of Byron and Cynthia Elizabeth (Bowser) Gardner. June 8, 1979, he married Maxine Scott in Laclede.
He was a member of the Masons, Evangelical United Methodist Church, the Eagles Lodge for many years, and a lifetime member of VFW. He joined the Marines in June 1948 and served aboard the USS Valley Forge CV45 during the Korean War. He was discharged in June 1952. He then joined the U.S. Air Force and was an air traffic controller at Offutt Air Force Base. He was discharged in February 1959. He then went to worked for CB & Q Railroad in February 1953. He was laid off in February 1955. He then went back into the U.S. Air Force for four years and went back to work for the railroad in 1959. He retired from the railroad in August 1991.
Survivors include his wife, Maxine, of the home; children, Heather Gardner, and friend, Michael R. Tetzlaff, St. Louis, Lloyd and Darlene Gardner, Frankfort, Gayla and Jim Sportsman, and Robin and Bob Gray, Brookfield; step-son, Kenny Almond, Laclede; sisters, Louise and Phillip Jenkins, Topeka, Kan., John and Betty (Yocom) Miller, Kansas City, Dorothy Stroud, New Boston; grandchildren, Nicole and Roxanne Sportsman, Brookfield, Cathleen and Josh Cline, Liberty, Sarah Gardner, Liberty; step-grandchildren, Kelly and Sheri Almond, Dallas, Ga.; great-grandchildren, Kaiden Cline, Liberty, Avery James Sportsman, Brookfield, Paisley Smith, North Dakota; step-great-grandchildren, Orlando Almond, Lothian, Md., Kenny and Kelly Almond, Dallas, Ga., Kaitlan Schultz, Omaha, Neb., and L/C Adam Schultz, U.S. Marine Corps.
He was preceded in death by his parents; one brother, Richard Gardner; one sister, Norma Gardner; and one brother-in-law, James Stroud.


text:
Calif. HIV patient, specialty pharmacy case against Anthem Blue Cross settled
NEW YORK — Anthem Blue Cross patients with HIV can continue receiving their drugs through community specialty pharmacies under a settlement of a lawsuit filed against the healthcare company by an advocacy organization.
In mid-November, Anthem Blue Cross adopted a policy that would require specialty pharmacy patients in California, most of them HIV patients, to receive their drugs via mail order through CuraScript, pharmacy benefit manager Express Scripts' in-house specialty pharmacy, in order to receive coverage.
The policy sparked criticism and allegations that the policy discriminated against HIV patients by forcing them to use mail order, while other members could continue using the pharmacies of their choice. In January 2013, the group Consumer Watchdog and law firm Whatley Kallas filed suit against Anthem Blue Cross. Critics said that HIV patients depend on longstanding relationships with their community pharmacies, which provides services such as medication adherence services, counseling, monitoring and aid in securing financial assistance.
Under the new settlement, Anthem members can opt out of the mail-order program by contacting CuraScript, according to the Law Offices of David Balto, which also represented independent pharmacies affected by the decision.
Leave a Reply
You must be logged in to post a comment.
No comments found


text:
Your Cart×
You have 0 items in your cart.
Handbook of Practical Logic and Automated Reasoning
- Author: John Harrison, Intel Corporation, Portland, Oregon
- Date Published: April 2009
- availability: Available
- format: Hardback
- isbn: 9780521899574
Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.com providing details of the course you are teaching.
This book meets the demand for a self-contained and broad-based account of the concepts, the machinery and the use of automated reasoning. The mathematical logic foundations are described in conjunction with practical application, all with the minimum of prerequisites. The approach is constructive, concrete and algorithmic: a key feature is that methods are described with reference to actual implementations (for which code is supplied) that readers can use, modify and experiment with. This book is ideally suited for those seeking a one-stop source for the general area of automated reasoning. It can be used as a reference, or as a place to learn the fundamentals, either in conjunction with advanced courses or for self study.Read more
- One stop reference that is broad-based and self-contained
- Constructive approach that enables topics to be discussed algorithmically; implementation of these algorithms provided as code
- Can be used as a reference, or as a place to learn the fundamentals, either in conjunction with advanced courses or for self study
Reviews & endorsements
"Valuable as both a strong introduction for complete beginners and a rich reference source, even for expert logicians."
D.V. Feldman, CHOICESee more reviews
" [...] if you want to implement ATP (automated theorem proving) code this book is an excellent choice. It has complete implementations of absolutely everything in OCaml (a dialect of ML, a mostly functional programming language) which is an excellent choice for this type of application."
D. Fox, amazon.com
"[...] sure to fill a need for a well-rounded work that can serve both as a reference on a range of topics and as an introductory text, especially for those who wish to study the subject for its possible practical uses. [...] Good features of the book are its overall readability, the good historical perspective conveyed while retaining its serious scholarly gravitas, and the use of OCaml to work with the concepts, presented alongside."
Shrisha Rao, Computing Reviews
"Harrison exhibits both the remarkable flexibility and limitations of OCaml (and other languages) for automated theorem proving. [...] I strongly recommend Harrison's handbook to mathematicians working on provability, computer program developers working to establish self-coherence of some parts of their programs, and students looking to understand propositional and first-order logic."
Arturo Ortiz-Tapia, Computing Reviews
"[...] the book is remarkable in many ways, including the breadth of its scope, the depth of its insights, and the clarity and readability of its prose. [...] while Harrison does focus on implementation and practical issues, he does not skimp on the underlying theory; indeed, the text passes between the two poles with surprising fluidity. The book does not assume background in logic, and appendices review the requisite background in mathematics and programming. As a result, the text is accessible to a broad audience, including sufficiently advanced undergraduates. [...] Harrison does a very good job of providing broader context and pointers to the literature. Each section ends with copious notes and references. As a result, the book can serve as a helpful introduction to the contemporary literature, like having a friendly uncle working in the field. [...] It provides a lucid and synoptic overview of these topics, conveys a solid theoretical background, provides tools for experimentation, and offers notes and pointers that facilitate a smooth transition to the contemporary literature. [...] Anyone working in automated reasoning, or looking to come up to speed on developments in the field, will want to have a copy at hand."
Jeremy Avigad, Theory and Practice of Logic Programming
"Overall this is an excellent book that provides a wide-ranging view on automated reasoning techniques for classical logic. The author achieves a good balance between providing good intuition and rigour in presenting the selected materials. Its breadth will make sure that even an expert in the area will find something useful in the book."
Alwen Tiu, The Bulletin of Symbolic Logic
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
Product details
- Date Published: April 2009
- format: Hardback
- isbn: 9780521899574
- length: 702 pages
- dimensions: 255 x 174 x 37 mm
- weight: 1.39kg
- contains: 10 tables 155 exercises
- availability: Available
Table of Contents
Ideological orientation
How to read this book
1. Introduction
2. Propositional logic
3. First-order logic
4. Equality
5. Decidable problems
6. Interactive theorem proving
7. Limitations
Appendix 1. Mathematical background
Appendix 2. OCaml made light of
Appendix 3. Parsing and printing of formulas
General Resources
Welcome to the resources site
Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
Showing of
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email email@example.com
Sign In
Please sign in to access your account
Not already registered? Create an account now. ×
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.com Sign in
» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×


text: Hi, I want to see the data frames/packetes entering and leaving my PC. I have some or required knowledge in TCP/IP . But, I feel like I am only bookworm,nothing in the real world. Can anyone suggest me such software? I am using win2000 and I am behind the router. Thanks.


text:
Blizzard The Latest To Kill Features, Call It An Upgrade
from the yeah,-that-doesn't-work dept
Either way, this seems like a move that's designed to backfire badly. It's all about taking away value, rather than adding value (or a reason to buy). LAN parties using StarCraft were a huge part of the appeal of the game -- and even though there were many pirated versions out there, it's part of what drove more people to buy the legitimate version. One thing that we've seen over and over again is that any business that focuses on "safeguarding against piracy" isn't focusing enough on providing unique value to customers. It's amazing that it still needs to be explained in this day and age, but you succeed in business by providing more positive value to customers, not in taking it away just because it doesn't fit with your business model.


text:
Vibration analysis of plain bearings
SLT10Plain bearings are the predominant choice for bearings used to position the rotors of high power turbo machinery, ship propulsion machinery and other equipment where reliability as well as life is very important.
This course includes vibration analysis and diagnostic studies with common vibration problems that can occur in plain bearings. A case study on a turbine generator set is discussed in this course. It also gives information about the selection, operation and performance characteristics of plain bearings.
List of topics
- Journal bearings (hydrodynamic bearing pressure, eccentricity, rotor instability), and classifications of journal bearings
- Vibration in bearings
- Common bearing problems
High points
This course gives an in-depth overview of:
- Vibration analysis of plain bearings to diagnose problems in bearings during operation
- Methods of reducing the stoppage of machinery
- Methods of increasing the life of machine/bearing
Practical tips, exhaustive case studies and stimulating exercises.
Discover our e-learning courses
On-line courses
- Angular contact ball bearings
- Assessment basics
- Balancing basics
- Bearing basics
- CARB toroidal roller bearings
- Deep groove ball bearings
- Introduction to industrial seals for rotating motio
- Introduction to lubrication analysis
- Introduction to lubrication
- Introduction to shaft alignment
- Introduction to thermography
- Introduction to vibration analysis
- Maintenance strategy review
- Operator Driven Reliability
- Power transmission
- Proactive reliability maintenance
- SKF Machine condition advisor
- Spare part management
- Spherical roller bearings
- Taper roller bearings
Off-line courses


text:
Start by entering your postcode to set up your FREE
account and read reviews about childcarers local to you.
You can then book childcare online – just select the
date, time and address for your booking.
Choose the local carers you'd prefer us to offer your bookings
to first and we'll keep you updated of progress by email.
Your childcarer will call you before the booking and you should pay
her for her time at the end. Rates start from just £7.85.
Pay nothing until after you have used Sitters - guaranteed. A booking
fee (£4-£6) and quarterly membership fee (£14.95) will only be
charged to your credit card after your booking has taken place.
Read reviews of approved Sitters local to you
Many thanks to Siria for looking after our two lively daughters while we were at conference dinner in Central London, visiting from Scotland. She arrived early at our hotel, armed with things to do, and the girls had a great evening with her. She was polite and fun, and we would definitely book with her again if we are back in London.
Allison continues to provide an excellent service to our family, the children are very attached to her and she is our firm favourite. an excellent ambassador and asset to the Sitters Team. Thanks from all the Nutman family.
Fiona arrived at our house well prepared and within minutes was building a good rapport with our three children, chatting with them and teaching them some good games that she had brought with her. She also brought some books that our children loved and kindly left one or two behind until next time. My husband and I needed one night out for dinner and were really struggling with bedtimes and routine having been travelling the last few weeks. By the time we got home all the children had been happily tucked up in bed and were fast asleep which gave us a much needed break.


text:
- Date Taken: 01-Jan-1970 00:00:00
- Copyright: Birgit Bode
- Focal Length: 0mm
- Aperture: f/0
Projects You Absolutely Can't Miss at Maker Faire UK
By Goli Mohammadi, 04/25/2018 @ 10:37 pm= | Full size is 1000 × 667 pixels
I'm a word nerd who loves to geek out on how emerging technology affects the lexicon. I was an editor on the first 40 volumes of MAKE, and I love shining light on the incredible makers in our community. In particular, covering art is my passion — after all, art is the first thing most of us ever made. When not fawning over perfect word choices, I can be found on the nearest mountain, looking for untouched powder fields and ideal alpine lakes.
Contact me at [email protected] or via @snowgoli.
you are now signed up to the Make: newsletter.
Thanks for signing up. Please check your email to confirm.
Your FREE PDF is on its way. Please check your email. You will also be receiving the weekly Make: Newsletter to keep you inspired with new projects and more product reviews.
The reCAPTCHA box was not checked. Please try again.


text:
- Data: Numbers
- Why am I getting long decimals (eg, 19.9499999999999) instead of the numbers I should be getting (eg, 19.95)?
- Why isn't my octal data interpreted correctly?
- Does perl have a round function? What about ceil() and floor()? Trig functions?
- How do I convert bits into ints?
- How do I multiply matrices?
- How do I perform an operation on a series of integers?
- How can I output Roman numerals?
- Why aren't my random numbers random?
- Data: Dates
- Data: Strings
- How do I validate input?
- How do I unescape a string?
- How do I remove consecutive pairs of characters?
- How do I expand function calls in a string?
- How do I find matching/nesting anything?
- How do I reverse a string?
- How do I expand tabs in a string?
- How do I reformat a paragraph?
- How can I access/change the first N letters of a string?
- How do I change the Nth occurrence of something?
- How can I count the number of occurrences of a substring within a string?
- How do I capitalize all the words on one line?
- How can I split a [character] delimited string except when inside [character]? (Comma-separated files)
- How do I strip blank space from the beginning/end of a string?
- How do I extract selected columns from a string?
- How do I find the soundex value of a string?
- How can I expand variables in text strings?
- What's wrong with always quoting "$vars"?
- Why don't my <<HERE documents work?
- Data: Arrays
- What is the difference between $array[1] and @array[1]?
- How can I extract just the unique elements of an array?
- How can I tell whether an array contains a certain element?
- How do I compute the difference of two arrays? How do I compute the intersection of two arrays?
- How do I find the first array element for which a condition is true?
- How do I handle linked lists?
- How do I handle circular lists?
- How do I shuffle an array randomly?
- How do I process/modify each element of an array?
- How do I select a random element from an array?
- How do I permute N elements of a list?
- How do I sort an array by (anything)?
- How do I manipulate arrays of bits?
- Why does defined() return true on empty arrays and hashes?
- Data: Hashes (Associative Arrays)
- How do I process an entire hash?
- What happens if I add or remove keys from a hash while iterating over it?
- How do I look up a hash element by value?
- How can I know how many entries are in a hash?
- How do I sort a hash (optionally by value instead of key)?
- How can I always keep my hash sorted?
- What's the difference between "delete" and "undef" with hashes?
- Why don't my tied hashes make the defined/exists distinction?
- How do I reset an each() operation part-way through?
- How can I get the unique keys from two hashes?
- How can I store a multidimensional array in a DBM file?
- How can I make my hash remember the order I put elements into it?
- Why does passing a subroutine an undefined element in a hash create it?
- How can I make the Perl equivalent of a C structure/C++ class/hash or array of hashes or arrays?
- How can I use a reference as a hash key?
- Data: Misc
- How do I handle binary data correctly?
- How do I determine whether a scalar is a number/whole/integer/float?
- How do I keep persistent data across program calls?
- How do I print out or copy a recursive data structure?
- How do I define methods for every class/object?
- How do I verify a credit card checksum?
perlfaq4 - Data Manipulation ($Revision: 1.19 $, $Date: 1997/04/24 22:43:57 $)
The section of the FAQ answers question related to the manipulation of data as numbers, dates, strings, arrays, hashes, and miscellaneous data issues.
Data: Numbers
Why am I getting long decimals (eg, 19.9499999999999) instead of the numbers I should be getting (eg, 19.95)?
Internally, your computer represents floating-point numbers in binary. Floating-point numbers read in from a file, or appearing as literals in your program, are converted from their decimal floating-point representation (eg, 19.95) to the internal binary representation.
However, 19.95 can't be precisely represented as a binary floating-point number, just like 1/3 can't be exactly represented as a decimal floating-point number. The computer's binary representation of 19.95, therefore, isn't exactly 19.95.
When a floating-point number gets printed, the binary floating-point representation is converted back to decimal. These decimal numbers are displayed in either the format you specify with printf(), or the current output format for numbers (see "$#" in perlvar if you use print.
$# has a different default value in Perl5 than it did in Perl4. Changing
$# yourself is deprecated.
This affects all computer languages that represent decimal floating-point numbers in binary, not just Perl. Perl provides arbitrary-precision decimal numbers with the Math::BigFloat module (part of the standard Perl distribution), but mathematical operations are consequently slower.
To get rid of the superfluous digits, just use a format (eg,
printf("%.2f", 19.95)) to get the required precision.
Why isn't my octal data interpreted correctly?
Perl only understands octal and hex numbers as such when they occur as literals in your program. If they are read in from somewhere and assigned, no automatic conversion takes place. You must explicitly use oct() or hex() if you want the values converted. oct() interprets both hex ("0x350") numbers and octal ones ("0350" or even without the leading "0", like "377"), while hex() only converts hexadecimal ones, with or without a leading "0x", like "0x255", "3A", "ff", or "deadbeef".
This problem shows up most often when people try using chmod(), mkdir(), umask(), or sysopen(), which all want permissions in octal.
chmod(644, $file); # WRONG -- perl -w catches this
chmod(0644, $file); # right
Does perl have a round function? What about ceil() and floor()? Trig functions?
For rounding to a certain number of digits, sprintf() or printf() is usually the easiest route.
The POSIX module (part of the standard perl distribution) implements ceil(), floor(), and a number of other mathematical and trigonometric functions.
In 5.000 to 5.003 Perls, trigonometry was done in the Math::Complex module. With 5.004, the Math::Trig module (part of the standard perl distribution) implements the trigonometric functions. Internally it uses the Math::Complex module and some functions can break out from the real axis into the complex plane, for example the inverse sine of 2.
Rounding in financial applications can have serious implications, and the rounding method used should be specified precisely. In these cases, it probably pays not to trust whichever system rounding is being used by Perl, but to instead implement the rounding function you need yourself.
How do I convert bits into ints?
To turn a string of 1s and 0s like '10110110' into a scalar containing its binary value, use the pack() function (documented in "pack" in perlfunc):
$decimal = pack('B8', '10110110');
Here's an example of going the other way:
$binary_string = join('', unpack('B*', "\x29"));
How do I multiply matrices?
Use the Math::Matrix or Math::MatrixReal modules (available from CPAN) or the PDL extension (also available from CPAN).
How do I perform an operation on a series of integers?
To call a function on each element in an array, and collect the results, use:
@results = map { my_func($_) } @array;
For example:
@triple = map { 3 * $_ } @single;
To call a function on each element of an array, but ignore the results:
foreach $iterator (@array) {
To call a function on each integer in a (small) range, you can use:
@results = map { &my_func($_) } (5 .. 25);
but you should be aware that the
.. operator creates an array of all integers in the range. This can take a lot of memory for large ranges. Instead use:
@results = ();
for ($i=5; $i < 500_005; $i++) {
push(@results, &my_func($i));
How can I output Roman numerals?
Get the http://www.perl.com/CPAN/modules/by-module/Roman module.
Why aren't my random numbers random?
The short explanation is that you're getting pseudorandom numbers, not random ones, because that's how these things work. A longer explanation is available on http://www.perl.com/CPAN/doc/FMTEYEWTK/random, courtesy of Tom Phoenix.
You should also check out the Math::TrulyRandom module from CPAN.
Data: Dates
How do I find the week-of-the-year/day-of-the-year?
The day of the year is in the array returned by localtime() (see "localtime" in perlfunc):
$day_of_year = (localtime(time()))[7];
or more legibly (in 5.004 or higher):
use Time::localtime;
$day_of_year = localtime(time())->yday;
You can find the week of the year by dividing this by 7:
$week_of_year = int($day_of_year / 7);
Of course, this believes that weeks start at zero.
How can I compare two date strings?
Use the Date::Manip or Date::DateCalc modules from CPAN.
How can I take a string and turn it into epoch seconds?
If it's a regular enough string that it always has the same format, you can split it up and pass the parts to timelocal in the standard Time::Local module. Otherwise, you should look into one of the Date modules from CPAN.
How can I find the Julian Day?
Neither Date::Manip nor Date::DateCalc deal with Julian days. Instead, there is an example of Julian date calculation in http://www.perl.com/CPAN/authors/David_Muir_Sharnoff/modules/Time/JulianDay.pm.gz, which should help.
Does Perl have a year 2000 problem?
Not unless you use Perl to create one. The date and time functions supplied with perl (gmtime and localtime) supply adequate information to determine the year well beyond 2000 (2038 is when trouble strikes). The year returned by these functions when used in an array context is the year minus 1900. For years between 1910 and 1999 this happens to be a 2-digit decimal number. To avoid the year 2000 problem simply do not treat the year as a 2-digit number. It isn't.
When gmtime() and localtime() are used in a scalar context they return a timestamp string that contains a fully-expanded year. For example,
$timestamp = gmtime(1005613200) sets $timestamp to "Tue Nov 13 01:00:00 2001". There's no year 2000 problem here.
Data: Strings
How do I validate input?
The answer to this question is usually a regular expression, perhaps with auxiliary logic. See the more specific questions (numbers, email addresses, etc.) for details.
How do I unescape a string?
It depends just what you mean by "escape". URL escapes are dealt with in perlfaq9. Shell escapes with the backslash (\) character are removed with:
Note that this won't expand \n or \t or any other special escapes.
How do I remove consecutive pairs of characters?
To turn "abbcccd" into "abccd":
How do I expand function calls in a string?
This is documented in perlref. In general, this is fraught with quoting and readability problems, but it is possible. To interpolate a subroutine call (in a list context) into a string:
print "My sub returned @{[mysub(1,2,3)]} that time.\n";
If you prefer scalar context, similar chicanery is also useful for arbitrary expressions:
print "That yields ${\($n + 5)} widgets\n";
See also "How can I expand variables in text strings?" in this section of the FAQ.
How do I find matching/nesting anything?
This isn't something that can be tackled in one regular expression, no matter how complicated. To find something between two single characters, a pattern like
/x([^x]*)x/ will get the intervening bits in $1. For multiple ones, then something more like
/alpha(.*?)omega/ would be needed. But none of these deals with nested patterns, nor can they. For that you'll have to write a parser.
How do I reverse a string?
Use reverse() in a scalar context, as documented in "reverse" in perlfunc.
$reversed = reverse $string;
How do I expand tabs in a string?
You can do it the old-fashioned way:
1 while $string =~ s/\t+/' ' x (length($&) * 8 - length($`) % 8)/e;
Or you can just use the Text::Tabs module (part of the standard perl distribution).
use Text::Tabs;
@expanded_lines = expand(@lines_with_tabs);
How do I reformat a paragraph?
Use Text::Wrap (part of the standard perl distribution):
use Text::Wrap;
print wrap("\t", ' ', @paragraphs);
The paragraphs you give to Text::Wrap may not contain embedded newlines. Text::Wrap doesn't justify the lines (flush-right).
How can I access/change the first N letters of a string?
There are many ways. If you just want to grab a copy, use substr:
$first_byte = substr($a, 0, 1);
If you want to modify part of a string, the simplest way is often to use substr() as an lvalue:
substr($a, 0, 3) = "Tom";
Although those with a regexp kind of thought process will likely prefer
$a =~ s/^.../Tom/;
How do I change the Nth occurrence of something?
You have to keep track. For example, let's say you want to change the fifth occurrence of "whoever" or "whomever" into "whosoever" or "whomsoever", case insensitively.
$count = 0;
++$count == 5 # is it the 5th?
? "${2}soever" # yes, swap
: $1 # renege and leave it there
How can I count the number of occurrences of a substring within a string?
There are a number of ways, with varying efficiency: If you want a count of a certain single character (X) within a string, you can use the
tr/// function like so:
$string = "ThisXlineXhasXsomeXx'sXinXit":
$count = ($string =~ tr/X//);
print "There are $count X charcters in the string";
This is fine if you are just looking for a single character. However, if you are trying to count multiple character substrings within a larger string,
tr/// won't work. What you can do is wrap a while() loop around a global pattern match. For example, let's count negative integers:
$string = "-9 55 48 -2 23 -76 4 14 -44";
while ($string =~ /-\d+/g) { $count++ }
print "There are $count negative numbers in the string";
How do I capitalize all the words on one line?
To make the first letter of each word upper case:
$line =~ s/\b(\w)/\U$1/g;
This has the strange effect of turning "
don't do it" into "
Don'T Do It". Sometimes you might want this, instead (Suggested by Brian Foy <email@example.com>):
$string =~ s/ (
(^\w) #at the beginning of the line
| # or
(\s\w) #preceded by whitespace
$string =~ /([\w']+)/\u\L$1/g;
To make the whole line upper case:
$line = uc($line);
To force each word to be lower case, with the first letter upper case:
$line =~ s/(\w+)/\u\L$1/g;
How can I split a [character] delimited string except when inside [character]? (Comma-separated files)
Take the example case of trying to split a string that is comma-separated into its different fields. (We'll pretend you said comma-separated, not comma-delimited, which is different and almost never what you mean.) You can't use
split(/,/) because you shouldn't split if the comma is inside quotes. For example, take a data line like this:
SAR001,"","Cimetrix, Inc","Bob Smith","CAM",N,8,1,0,7,"Error, Core Dumped"
Due to the restriction of the quotes, this is a fairly complex problem. Thankfully, we have Jeffrey Friedl, author of a highly recommended book on regular expressions, to handle these for us. He suggests (assuming your string is contained in $text):
@new = ();
push(@new, $+) while $text =~ m{
"([^\"\\]*(?:\\.[^\"\\]*)*)",? # groups the phrase inside the quotes
| ([^,]+),?
| ,
push(@new, undef) if substr($text,-1,1) eq ',';
If you want to represent quotation marks inside a quotation-mark-delimited field, escape them with backslashes (eg,
"like \"this\"". Unescaping them is a task addressed earlier in this section.
Alternatively, the Text::ParseWords module (part of the standard perl distribution) lets you say:
use Text::ParseWords;
@new = quotewords(",", 0, $text);
How do I strip blank space from the beginning/end of a string?
The simplest approach, albeit not the fastest, is probably like this:
$string =~ s/^\s*(.*?)\s*$/$1/;
It would be faster to do this in two steps:
$string =~ s/^\s+//;
$string =~ s/\s+$//;
Or more nicely written as:
for ($string) {
How do I extract selected columns from a string?
Use substr() or unpack(), both documented in perlfunc.
How do I find the soundex value of a string?
Use the standard Text::Soundex module distributed with perl.
How can I expand variables in text strings?
Let's assume that you have a string like:
$text = 'this has a $foo in it and a $bar';
$text =~ s/\$(\w+)/${$1}/g;
Before version 5 of perl, this had to be done with a double-eval substitution:
$text =~ s/(\$\w+)/$1/eeg;
Which is bizarre enough that you'll probably actually need an EEG afterwards. :-)
See also "How do I expand function calls in a string?" in this section of the FAQ.
What's wrong with always quoting "$vars"?
The problem is that those double-quotes force stringification, coercing numbers and references into strings, even when you don't want them to be.
If you get used to writing odd things like these:
print "$var"; # BAD
$new = "$old"; # BAD
somefunc("$var"); # BAD
You'll be in trouble. Those should (in 99.8% of the cases) be the simpler and more direct:
print $var;
$new = $old;
Otherwise, besides slowing you down, you're going to break code when the thing in the scalar is actually neither a string nor a number, but a reference:
sub func {
my $aref = shift;
my $oref = "$aref"; # WRONG
You can also get into subtle problems on those few operations in Perl that actually do care about the difference between a string and a number, such as the magical
++ autoincrement operator or the syscall() function.
Why don't my <<HERE documents work?
Check for these three things:
- 1. There must be no space after the << part.
- 2. There (probably) should be a semicolon at the end.
- 3. You can't (easily) have any space in front of the tag.
Data: Arrays
What is the difference between $array[1] and @array[1]?
The former is a scalar value, the latter an array slice, which makes it a list with one (scalar) value. You should use $ when you want a scalar value (most of the time) and @ when you want a list with one scalar value in it (very, very rarely; nearly never, in fact).
Sometimes it doesn't make a difference, but sometimes it does. For example, compare:
$good[0] = `some program that outputs several lines`;
@bad[0] = `same program that outputs several lines`;
The -w flag will warn you about these matters.
How can I extract just the unique elements of an array?
There are several possible ways, depending on whether the array is ordered and whether you wish to preserve the ordering.
- a) If @in is sorted, and you want @out to be sorted:
$prev = 'nonesuch'; @out = grep($_ ne $prev && ($prev = $_), @in);
This is nice in that it doesn't use much extra memory, simulating uniq(1)'s behavior of removing only adjacent duplicates.
- b) If you don't know whether @in is sorted:
undef %saw; @out = grep(!$saw{$_}++, @in);
- c) Like (b), but @in contains only small integers:
@out = grep(!$saw[$_]++, @in);
- d) A way to do (b) without any loops or greps:
undef %saw; @saw{@in} = (); @out = sort keys %saw; # remove sort if undesired
- e) Like (d), but @in contains only small positive integers:
undef @ary; @ary[@in] = @in; @out = @ary;
How can I tell whether an array contains a certain element?
There are several ways to approach this. If you are going to make this query many times and the values are arbitrary strings, the fastest way is probably to invert the original array and keep an associative array lying about whose keys are the first array's values.
@blues = qw/azure cerulean teal turquoise lapis-lazuli/;
undef %is_blue;
for (@blues) { $is_blue{$_} = 1 }
Now you can check whether $is_blue{$some_color}. It might have been a good idea to keep the blues all in a hash in the first place.
If the values are all small integers, you could use a simple indexed array. This kind of an array will take up less space:
@primes = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31);
undef @is_tiny_prime;
for (@primes) { $is_tiny_prime[$_] = 1; }
Now you check whether $is_tiny_prime[$some_number].
If the values in question are integers instead of strings, you can save quite a lot of space by using bit strings instead:
@articles = ( 1..10, 150..2000, 2017 );
undef $read;
grep (vec($read,$_,1) = 1, @articles);
Now check whether
vec($read,$n,1) is true for some
Please do not use
$is_there = grep $_ eq $whatever, @array;
or worse yet
$is_there = grep /$whatever/, @array;
These are slow (checks every element even if the first matches), inefficient (same reason), and potentially buggy (what if there are regexp characters in $whatever?).
How do I compute the difference of two arrays? How do I compute the intersection of two arrays?
Use a hash. Here's code to do both and more. It assumes that each element is unique in a given array:
@union = @intersection = @difference = ();
%count = ();
foreach $element (@array1, @array2) { $count{$element}++ }
foreach $element (keys %count) {
push @union, $element;
push @{ $count{$element} > 1 ? \@intersection : \@difference }, $element;
How do I find the first array element for which a condition is true?
You can use this if you care about the index:
for ($i=0; $i < @array; $i++) {
if ($array[$i] eq "Waldo") {
$found_index = $i;
$found_index has what you want.
How do I handle linked lists?
In general, you usually don't need a linked list in Perl, since with regular arrays, you can push and pop or shift and unshift at either end, or you can use splice to add and/or remove arbitrary number of elements at arbitrary points.
If you really, really wanted, you could use structures as described in perldsc or perltoot and do just what the algorithm book tells you to do.
How do I handle circular lists?
Circular lists could be handled in the traditional fashion with linked lists, or you could just do something like this with an array:
unshift(@array, pop(@array)); # the last shall be first
push(@array, shift(@array)); # and vice versa
How do I shuffle an array randomly?
Here's a shuffling algorithm which works its way through the list, randomly picking another element to swap the current element with:
@new = ();
@old = 1 .. 10; # just a demo
while (@old) {
push(@new, splice(@old, rand @old, 1));
For large arrays, this avoids a lot of the reshuffling:
@new = ();
@old = 1 .. 10000; # just a demo
for( @old ){
my $r = rand @new+1;
$new[$r] = $_;
How do I process/modify each element of an array?
for (@lines) {
Here's another; let's compute spherical volumes:
for (@radii) {
$_ **= 3;
$_ *= (4/3) * 3.14159; # this will be constant folded
How do I select a random element from an array?
Use the rand() function (see "rand" in perlfunc):
srand; # not needed for 5.004 and later
$index = rand @array;
$element = $array[$index];
How do I permute N elements of a list?
Here's a little program that generates all permutations of all the words on each line of input. The algorithm embodied in the permut() function should work on any list:
#!/usr/bin/perl -n
# permute - email@example.com
permut([split], []);
sub permut {
my @head = @{ $_[0] };
my @tail = @{ $_[1] };
unless (@head) {
# stop recursing when there are no elements in the head
print "@tail\n";
} else {
# for all elements in @head, move one from @head to @tail
# and call permut() on the new @head and @tail
foreach $i (0 .. $#head) {
@newhead = @head;
@newtail = @tail;
unshift(@newtail, splice(@newhead, $i, 1));
permut([@newhead], [@newtail]);
How do I sort an array by (anything)?
Supply a comparison function to sort() (described in "sort" in perlfunc):
@list = sort { $a <=> $b } @list;
The default sort function is cmp, string comparison, which would sort
(1, 2, 10) into
(1, 10, 2).
<=>, used above, is the numerical comparison operator.
If you have a complicated function needed to pull out the part you want to sort on, then don't do it inside the sort function. Pull it out first, because the sort BLOCK can be called many times for the same element. Here's an example of how to pull out the first word after the first number on each item, and then sort those words case-insensitively.
@idx = ();
for (@data) {
($item) = /\d+\s*(\S+)/;
push @idx, uc($item);
@sorted = @data[ sort { $idx[$a] cmp $idx[$b] } 0 .. $#idx ];
Which could also be written this way, using a trick that's come to be known as the Schwartzian Transform:
@sorted = map { $_->[0] }
sort { $a->[1] cmp $b->[1] }
map { [ $_, uc((/\d+\s*(\S+)/ )[0] ] } @data;
If you need to sort on several fields, the following paradigm is useful.
@sorted = sort { field1($a) <=> field1($b) ||
field2($a) cmp field2($b) ||
field3($a) cmp field3($b)
} @data;
This can be conveniently combined with precalculation of keys as given above.
See http://www.perl.com/CPAN/doc/FMTEYEWTK/sort.html for more about this approach.
See also the question below on sorting hashes.
How do I manipulate arrays of bits?
Use pack() and unpack(), or else vec() and the bitwise operations.
For example, this sets $vec to have bit N set if $ints[N] was set:
$vec = '';
foreach(@ints) { vec($vec,$_,1) = 1 }
And here's how, given a vector in $vec, you can get those bits into your @ints array:
sub bitvec_to_list {
my $vec = shift;
my @ints;
# Find null-byte density then select best algorithm
if ($vec =~ tr/\0// / length $vec > 0.95) {
use integer;
my $i;
# This method is faster with mostly null-bytes
while($vec =~ /[^\0]/g ) {
$i = -9 + 8 * pos $vec;
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
push @ints, $i if vec($vec, ++$i, 1);
} else {
# This method is a fast general algorithm
use integer;
my $bits = unpack "b*", $vec;
push @ints, 0 if $bits =~ s/^(\d)// && $1;
push @ints, pos $bits while($bits =~ /1/g);
return \@ints;
This method gets faster the more sparse the bit vector is. (Courtesy of Tim Bunce and Winfried Koenig.)
Why does defined() return true on empty arrays and hashes?
See "defined" in perlfunc in the 5.004 release or later of Perl.
Data: Hashes (Associative Arrays)
How do I process an entire hash?
Use the each() function (see "each" in perlfunc) if you don't care whether it's sorted:
while (($key,$value) = each %hash) {
print "$key = $value\n";
If you want it sorted, you'll have to use foreach() on the result of sorting the keys as shown in an earlier question.
What happens if I add or remove keys from a hash while iterating over it?
Don't do that.
How do I look up a hash element by value?
Create a reverse hash:
%by_value = reverse %by_key;
$key = $by_value{$value};
That's not particularly efficient. It would be more space-efficient to use:
while (($key, $value) = each %by_key) {
$by_value{$value} = $key;
If your hash could have repeated values, the methods above will only find one of the associated keys. This may or may not worry you.
How can I know how many entries are in a hash?
If you mean how many keys, then all you have to do is take the scalar sense of the keys() function:
$num_keys = scalar keys %hash;
In void context it just resets the iterator, which is faster for tied hashes.
How do I sort a hash (optionally by value instead of key)?
Internally, hashes are stored in a way that prevents you from imposing an order on key-value pairs. Instead, you have to sort a list of the keys or values:
@keys = sort keys %hash; # sorted by key
@keys = sort {
$hash{$a} cmp $hash{$b}
} keys %hash; # and by value
Here we'll do a reverse numeric sort by value, and if two keys are identical, sort by length of key, and if that fails, by straight ASCII comparison of the keys (well, possibly modified by your locale -- see perllocale).
@keys = sort {
$hash{$b} <=> $hash{$a}
length($b) <=> length($a)
$a cmp $b
} keys %hash;
How can I always keep my hash sorted?
You can look into using the DB_File module and tie() using the $DB_BTREE hash bindings as documented in "In Memory Databases" in DB_File.
What's the difference between "delete" and "undef" with hashes?
Hashes are pairs of scalars: the first is the key, the second is the value. The key will be coerced to a string, although the value can be any kind of scalar: string, number, or reference. If a key
$key is present in the array,
exists($key) will return true. The value for a given key can be
undef, in which case
$array{$key} will be
undef while
$exists{$key} will return true. This corresponds to (
undef) being in the hash.
Pictures help... here's the
%ary table:
keys values
| a | 3 |
| x | 7 |
| d | 0 |
| e | 2 |
And these conditions hold
$ary{'a'} is true
$ary{'d'} is false
defined $ary{'d'} is true
defined $ary{'a'} is true
exists $ary{'a'} is true (perl5 only)
grep ($_ eq 'a', keys %ary) is true
If you now say
undef $ary{'a'}
your table now reads:
keys values
| a | undef|
| x | 7 |
| d | 0 |
| e | 2 |
and these conditions now hold; changes in caps:
$ary{'a'} is FALSE
$ary{'d'} is false
defined $ary{'d'} is true
defined $ary{'a'} is FALSE
exists $ary{'a'} is true (perl5 only)
grep ($_ eq 'a', keys %ary) is true
Notice the last two: you have an undef value, but a defined key!
Now, consider this:
delete $ary{'a'}
your table now reads:
keys values
| x | 7 |
| d | 0 |
| e | 2 |
and these conditions now hold; changes in caps:
$ary{'a'} is false
$ary{'d'} is false
defined $ary{'d'} is true
defined $ary{'a'} is false
exists $ary{'a'} is FALSE (perl5 only)
grep ($_ eq 'a', keys %ary) is FALSE
See, the whole entry is gone!
Why don't my tied hashes make the defined/exists distinction?
They may or may not implement the EXISTS() and DEFINED() methods differently. For example, there isn't the concept of undef with hashes that are tied to DBM* files. This means the true/false tables above will give different results when used on such a hash. It also means that exists and defined do the same thing with a DBM* file, and what they end up doing is not what they do with ordinary hashes.
How do I reset an each() operation part-way through?
keys %hash in a scalar context returns the number of keys in the hash and resets the iterator associated with the hash. You may need to do this if you use
last to exit a loop early so that when you re-enter it, the hash iterator has been reset.
How can I get the unique keys from two hashes?
First you extract the keys from the hashes into arrays, and then solve the uniquifying the array problem described above. For example:
%seen = ();
for $element (keys(%foo), keys(%bar)) {
@uniq = keys %seen;
Or more succinctly:
@uniq = keys %{{%foo,%bar}};
Or if you really want to save space:
%seen = ();
while (defined ($key = each %foo)) {
while (defined ($key = each %bar)) {
@uniq = keys %seen;
How can I store a multidimensional array in a DBM file?
Either stringify the structure yourself (no fun), or else get the MLDBM (which uses Data::Dumper) module from CPAN and layer it on top of either DB_File or GDBM_File.
How can I make my hash remember the order I put elements into it?
Use the Tie::IxHash from CPAN.
use Tie::IxHash;
tie(%myhash, Tie::IxHash);
for ($i=0; $i<20; $i++) {
$myhash{$i} = 2*$i;
@keys = keys %myhash;
# @keys = (0,1,2,3,...)
Why does passing a subroutine an undefined element in a hash create it?
If you say something like:
somefunc($hash{"nonesuch key here"});
Then that element "autovivifies"; that is, it springs into existence whether you store something there or not. That's because functions get scalars passed in by reference. If somefunc() modifies
$_[0], it has to be ready to write it back into the caller's version.
This has been fixed as of perl5.004.
Normally, merely accessing a key's value for a nonexistent key does not cause that key to be forever there. This is different than awk's behavior.
How can I make the Perl equivalent of a C structure/C++ class/hash or array of hashes or arrays?
Use references (documented in perlref). Examples of complex data structures are given in perldsc and perllol. Examples of structures and object-oriented classes are in perltoot.
How can I use a reference as a hash key?
You can't do this directly, but you could use the standard Tie::Refhash module distributed with perl.
Data: Misc
How do I handle binary data correctly?
Perl is binary clean, so this shouldn't be a problem. For example, this works fine (assuming the files are found):
if (`cat /vmunix` =~ /gzip/) {
print "Your kernel is GNU-zip enabled!\n";
On some systems, however, you have to play tedious games with "text" versus "binary" files. See "binmode" in perlfunc.
If you're concerned about 8-bit ASCII data, then see perllocale.
If you want to deal with multibyte characters, however, there are some gotchas. See the section on Regular Expressions.
How do I determine whether a scalar is a number/whole/integer/float?
Assuming that you don't care about IEEE notations like "NaN" or "Infinity", you probably just want to use a regular expression.
warn "has nondigits" if /\D/;
warn "not a whole number" unless /^\d+$/;
warn "not an integer" unless /^-?\d+$/; # reject +3
warn "not an integer" unless /^[+-]?\d+$/;
warn "not a decimal number" unless /^-?\d+\.?\d*$/; # rejects .2
warn "not a decimal number" unless /^-?(?:\d+(?:\.\d*)?|\.\d+)$/;
warn "not a C float"
unless /^([+-]?)(?=\d|\.\d)\d*(\.\d*)?([Ee]([+-]?\d+))?$/;
Or you could check out http://www.perl.com/CPAN/modules/by-module/String/String-Scanf-1.1.tar.gz instead. The POSIX module (part of the standard Perl distribution) provides the
strtol and
strtod for converting strings to double and longs, respectively.
How do I keep persistent data across program calls?
For some specific applications, you can use one of the DBM modules. See AnyDBM_File. More generically, you should consult the FreezeThaw, Storable, or Class::Eroot modules from CPAN.
How do I print out or copy a recursive data structure?
The Data::Dumper module on CPAN is nice for printing out data structures, and FreezeThaw for copying them. For example:
use FreezeThaw qw(freeze thaw);
$new = thaw freeze $old;
Where $old can be (a reference to) any kind of data structure you'd like. It will be deeply copied.
How do I define methods for every class/object?
Use the UNIVERSAL class (see UNIVERSAL).
How do I verify a credit card checksum?
Get the Business::CreditCard module from CPAN.
Copyright (c) 1997 Tom Christiansen and Nathan Torkington. All rights reserved. See perlfaq for distribution information.


text:
After a week of intensive investigation following the slaughter of 20 first-graders and six women at a primary school in Newtown, normally promising lines of inquiry have turned up little if anything to shed light on what motivated Adam Lanza, the reclusive, 20-year old gunman, to kill.
A preliminary examination of his mobile telephone showed that he had made or received few, if any calls, investigators and others familiar with the matter said.
No information has yet emerged from investigators on any possible text messages he may have sent or received.
Lanza appears to have spent much of his time during the weeks before the shooting in the basement of the home he shared with his mother Nancy, playing violent video games on his computer, investigators believe based on interviews.
His X-Box, an electronic game playing device that might have led investigators to Lanza's game playing partners across the internet, apparently was not used.
And the thin, withdrawn, young man - a computer tech club member while in high school - destroyed his home computer in a fashion that experts believe may have left it worthless to forensic examiners, as if he had set out to erase clues to his thinking, or who he may have communicated with, before he set out to commit mass homicide.
Before shooting his way into the Sandy Hook Elementary School on December 14, investigators and others familiar with the matter said Lanza also repeatedly shot his mother Nancy, killing the only person with whom he is believed to have been socially engaged.
"He killed the only person who really knew him well and knew what made him tick, so figuring out the why here is going to be difficult," a law enforcement official said.
State police detectives returned to the home on Yogananda Street home he shared with his mother on Wednesday night. They have been combing the 4,000 square-foot house since moments after the gunfire stopped inside the school.
Lanza had two bedrooms in the house, including one in the basement in which he kept his computer, his computer video games and other possessions. Lanza had thousands of dollars worth of video games as well as an X-Box, although it appears he rarely if ever used it, preferring to play violent video games on his computer with other anonymous gamers investigators were told.
The basement also is where Nancy Lanza, a gun enthusiast and target shooter, kept her collection of weapons in a locked box.
She had at least five weapons - two handguns a semi-automatic rifle, a .22 calibre rifle and a shotgun. Lanza had all the weapons except the .22 with him when he drove to the school.
By destroying his hard drive investigators will not be able to trace what games he was playing, who he was playing with and, more importantly, whether he gave anybody forewarning of the horrific violence he unleashed.
Anything he may have written on his computer that could have provided a glimpse into Lanza's thinking also would be irretrievable.
Two state police crime squads have been processing the evidence at the school, with the third one at the house.
Five days after the shootings investigators still are collecting bullets from inside and outside the school. Lanza fired so many rounds that many bullets pierced cars in the school parking lot.
Sources said that Nancy Lanza owned at least five guns and that all of them were purchased legally since her divorce in 2009.
Adam Lanza was carrying three weapons when he entered the school, two pistols and the Bushmaster rifle that he used to spray the hallway and two classrooms with bullets. A source said that he left a shotgun in the boot of his mother's car, which he drove to the scene.
Police also are still trying to determine how long Lanza had been planning Friday's massacre. There is no indication that he made any purchases in the days before.


text:
|2007-08-12, 18:35
|Link #1
GT-R Fanatic
Join Date: Jun 2007
Location: Toronto, Canada
Age: 29
Covers of 鳥の詩
Decided to start this thread because I stumbled across THIS:
The singer and his band (don't quote on this) put their own rock twist on 鳥の詩. The results were very unexpected. Give it a listen and post covers of 鳥の詩 you've encountered.
EDIT: Turns out the band that covered this is X JAPAN. They also played this cover live. See my next post for the vid.
Last edited by HashiriyaR32; 2007-08-16 at 21:00.
|2007-08-16, 10:45
|Link #4
Like a falling star
Join Date: Jul 2007
Location: A snowy town from 7 years ago....
Age: 26
I don't know if a fandub counts, but here's an amazing one by two friends of mine, HIMEKA and fantasiimaker.
EDIT- Dangit, it won't embed correctly....
|2007-08-19, 14:10
|Link #8
Bloody Hell...
There was a metal version of Koi no Mikuru Densetsu that was done, and it was supposedly done by X Japan, but it turns out it was done by some other group (arranged by psycho and sung by J - http://speedfreaks.blog.shinobi.jp/ ) and placed over a concert recording that closely matched the song as far as lip movements and instruments. I want to say the same was done here, since parts of that video don't look right. The song is at least an interesting take though, and well done on placing it over the concert. ^^
I think that Tori no Uta cover was done by the same guys too... I can't read it, but the kanji (forgive me if it's not actually kanji but one of the other writing forms - I'm ignorant on such things at the moment) looks the same on one of the songs on their download list.
EDIT: Downloaded the song - yeah, it's the same song.
Last edited by Alexandrite; 2007-08-19 at 14:28.
|2007-08-19, 17:57
|Link #9
GT-R Fanatic
Join Date: Jun 2007
Location: Toronto, Canada
Age: 29
I assume it basically means that X JAPAN DID NOT cover 鳥の詩?
I thought the slight timing errors were because the vocalist, at least for the first 30-45 seconds of the vocal part, was struggling to hear his own voice...........
I DON'T think it's a fake. Do ANY of X JAPAN's own material feature a piano part at the VERY BEGINNING of the song? Listen to the crowd's reaction to the opener.
Maybe that video was merely a cover of a cover.
EDIT: Got the blog entry with the video it in. http://speedfreaks.blog.shinobi.jp/Date/20070712/ Anyone mind translating what's been posted?
|2007-08-20, 14:45
|Link #10
Join Date: Jul 2007
Looked up the artist for the Mikuru song, the MP3 says "Psycho feat. J" but I remember digging up somewhere that the artist might have been "Animetal", a group that according to Wiki does covers of tokusatsu and anime songs - but I wasn't able to find a connection - maybe it's because I'm searching the title in English.
In any case I wonder if there are any more of these metal anime covers out there, I really enjoy them.
|2007-08-21, 00:23
|Link #11
Bloody Hell...
Okay, to be honest (and I should have mentioned this before I dug a hole), my declaration is mostly fueled by a variety of people all pointing to that source and saying that it's not X Japan. Since I don't really know too much about X Japan (and therefore couldn't tell you if any of their other songs have piano bits to them), I'm just going to have to say that's what I know and wait for someone to correct me, something that seems to be more common than I'd like to admit.
|2007-08-21, 00:47
|Link #12
wingéd prettygirl
The Last Song.
Silent Jealousy.
Endless Rain (almost, apart from a single chord).
So yes. Oh, and it's impossible for X to have covered Tori no Uta anyway - they broke up in what, 1997? When did Air come out, and when was Tori no Uta first recorded? 2000, from memory. Time factors are a bit off there guys
EDIT - that footage is from the Last Live that X played at Tokyo Dome in 1997. From the video, it looks to be a cut of possibly the Last Song, and perhaps Rusty Nail, as Yoshiki is shown on both drums and piano... within half a second of each other.
Personally, my favourite mix of Tori no Uta has always been the original mix by Lia, that was included in the game - although I have rather fond memories of the Re-feel piano arrangement as well.
|2007-12-23, 02:34
|Link #15
GT-R Fanatic
Join Date: Jun 2007
Location: Toronto, Canada
Age: 29
I don't know WHAT you're referring to.
Here's my theory as to why metal versions of 鳥の詩 and 恋のミクル伝説 were dubbed over the 1997 X Japan concert. I'm thinking that this "psycho" guy (that's right, that's his alias), is actually an X JAPAN member.
|2007-12-24, 04:58
|Link #16
wingéd prettygirl
@ HashiriyaR32
I assume you're talking to me, yes? If so, I'll try to be clearer, though I don't see how I can be...
You asked if any X songs (X being X Japan, naturally) have a piano introduction to them. I provided several X songs that do, including the Last Song, Forever Love, Silent Jealousy, and Endless Rain - there are others, if I felt like pulling out my X albums. The footage itself is, as I stated, from the Last Live Concert X Japan performed at the Tokyo Dome on New Year's Eve 1997. Since Tori no Uta was written post 1999, it's highly unlikely that X could have covered it in 1997, no?
As to your theory about a member of X rearranging Tori no Uta and dubbing it over their own final Live concert... firstly, I'd have to ask why exactly they'd even do such a thing, and then I'd have to point out that the only member of X really capable of doing that would be Yoshiki, and what with him acting as a producer, working on Violet UK, newly working on S.K.I.N, and with the new single and new tour for X themselves coming out (and with some of these projects happening since 1999), I can't see him doing it... especially since he's a composer of his own music, and would therefore be unlikely to rearrange something like this, especially over his own band concert. Also, if he was going to do so, why would he stitch together two songs from the Last Live just to run a metal cover of an eroge tune?
As for other X members, hide is dead, Pata is in another band, Toshi has been a little off to the left, and heath has been hiding in the woodwork. Since none of them were really music-writers, more performers, their absence/presence is a tad more academic anyway, but I suppose they had to be raised.
The video is most likely what it appears to be - a fan-made metal arrangement by an anonymous eroge/metal fan, who mixed a song he liked over a band he liked.
|Thread Tools


text:
The Hanuman Chalisa is a 40 verse prayer to Hanuman, the great devotee of Lord Rama in the Indian spiritual epic the Ramayana. It is believed that by reciting with love and devotion the divine qualities of Hanuman, we remember those qualities in ourselves.
Hanuman Chalisa is a devotional prayer with poetic expressions sung for Lord Hanuman, the devotee of Lord Rama and the son of Pawan (wind). Lord Hanuman is believed to be a descendant of Lord Shankar. He is worshipped for his immense strength, intelligence, true knowledge, and an ardent disciple of Lord Rama. Most of the bhakts of Lord Rama also pay homage to Lord Hanuman.
Hanuman Chalisa was originally written by Goswami Tulsidas in the Awadhi language. The poem is a lengthy one with forty versus or chupais. Every verse praises the Lord for his unmatchable qualities.
The devotee enchanting the poem praises the physical strength of the Lord, his qualities of being a great listener, and his unmatched devotion to Lord Rama. He also praises all the yogic powers of the Lord, such as his ability to enlarge and diminish his physical appearance and holding the entire Parbat on one finger. He also applauds his splendid valor that is enough to keep all negative forces at bay.
As Lord Hanuman is also known as Sankat Mochan Hanuman, it is commonly believed that people who recite the prayer regularly sail easily through the ups and downs of their lives. It is said that the Lord takes care of all your problems if you surrender yourself completely to him. The Lord also bestows you with the mental strength you need to confront situations. He also grants his yogic powers to his unconditional disciples. A verse in the Chalisa says that if you enchant the poem 100 times daily, you will be free from the bondage of life and death.
In India, every day is dedicated to a particular deity. Tuesdays and Saturdays are the days of Lord Hanuman. If your busy schedule does not leave enough time for you to enchant Hanuman Chalisa daily, then should do it on the dedicated days.
It is one of widely enchanted prayers across the country. Today, it is translated into many languages for devotees across the world. The Hanuman Chalisa is available in various forms like pocket books, CDs, DVDs, and cassettes. It can also be downloaded from websites.


text:
Hi thanks for stopping by here and welcome to our site. As a premium Oxfords products, indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US were made to give you the ultimate Satisfaction. According to my research, this product has receive so many positive review among users. Most of them love what this product features, so it's should on your top list when you looking for a Oxfords. There are so many Oxfords products with various brands on the market. Each of them claims as the best. In fact, not all those products give the truth as their claimed. Most of them just low quality product with hype marketing tagline.
indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US
If you are seeking an ultimate satisfaction in comfort and fit, please don't buy one before you read this short review. This short review will cover what really the product can do, what is the feature, what real user say about it, and where you can get it with very rationale price.
CRAZY Deal about this product HERE!
A Glance of Premium indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US
Angle for a raise or promotion in the Indigo by Clarks Charlie Brogue oxford. This women's lace-up shoe is a dead ringer for a classic menswear style, its glossy leather upper accented with traditional wingtip details. A leather lining manages moisture as an extra-cushy footbed keeps you comfortable when on foot. The Indigo by Clarks Charlie Brogue oxford flat shoe has a light-texture rubber sole to carry you in complete confidence. …Click here to read full details.
Feature of indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US
- Approx. 34" heel height
- Five-eye lace closure
- Generously cushioned footbed
- Leather lining
- Leather upper
READ All info about this product HERE!
What people say about this indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US?
I get tons of complimentsI wanted a feminine looking oxford that I could use as an alternative to the ballet flat with some casual looks. This is it. Wing tip detailing adds an interesting dimension. I've been stopped by strangers asking where I got them often. Super comfortable, too!
I also wear a size 11…these make my feet look smaller (not that I care but I'm fine with that).
Where You Can Get this indigo by Clarks Women's Charlie Brogue Oxford,Black,8.5 M US with Rationale Price?
This product can easily get from various local store or you can also grab it one from one of online stores across the net. Personally I recommend you to get this amazing product from Amazon.com since they offers great price. Please visit the sales page on amazon by clicking the big 'buy it now' button down below. If you buy a product through our link, that means you have supported this website to keep alive.
Last but not least, thank you for reading this short review, and please give us feedback in order to make this website better.


text:
Callings Helps Students Find Career Passionby Howard Hewitt • February 7, 2013 Share:
For many, real career satisfaction is more than just getting a job and bringing home a paycheck. Wabash College is participating in a new nation-wide program, NetVue, to help students uncover their passions and find a sense of calling in their career.
"We want to help students think about their future endeavors beyond just a job," said Jon Baer, Professor of Religion and co-director of the Wabash NetVUE program. He explained the goal is to assist students in developing a vision based on their interests, and those things about which they are deeply passionate and committed. "We want to help them find that sweet spot where all those things can come together and they can have a vocation that has real purpose and meaning in their lives."
The national NetVUE program is funded by Lilly Endowment. Wabash received $46,000 for its program aptly named, "Callings: Exploring Vocational Identity and Purpose." Assistant Director of Career Services James Jefferies is working with Baer to develop the idea. The program will build around campus speakers, possible course guidance, mentoring, a non-profit internship program, and externships.
"Occasionally there are guys who come with a full tool kit who know exactly what they want to do and have put some careful reflective thinking into it already," Jeffries said. "Then there are guys that come to Wabash not knowing what they want to do, guys not doing much at all, or those with a set career in mind which distracts them from building themselves."
Jeffries and Baer feel too many young men think that career satisfaction is gauged by only financial success.
"Economic pressures right now are pretty significant so a lot of guys come with some sort of goal that really is motivated just by the economic piece," Baer said. "No one can fault them for that. But this program is built to energize that goal with a deeper vision of how it can be more meaningful for them or help them see their passion can lead them to something that not only makes a living but gives them a feeling of substance and meaning."
Both program leaders agreed that Wabash holds a unique challenge and opportunity to work specifically with young men.
"I think we may be in a time period where perhaps a little more deconstruction is involved (in the career decision process)," Baer said. "I think part of the reason why NetVUE funded us is because of the special opportunity that we have to absolutely focus on the challenges that face young men."
Both advocate more intentional discussion about careers as they relate to an individual student's passion and interests. "For example, some students come here thinking they want to be a lawyer. We may need to take that image apart or work to help them identify what they ultimately value, what their skills really are, and whether they can develop a calling out of those traits," Jefferies said.
And that is where the program like internships and externships play a role. Getting students to that point involves discussions and assessments of a student's strengths and weaknesses.
"It means looking hard at talents and strengths that students come with and how they can further develop those talents. We can do more work on that. And it means doing some occasional dismantling or building an image for the students of the way they want to see themselves in their future."
Still, a specific calling or passion cannot always be identified just because of a program (like NetVUE). "Part of what we want to say to the young man (who doesn't feel a calling) is that's okay," Baer explained. "That might not come until you are 28. We all have been around the block enough to know that sometimes the path is a winding one. That can be a great learning experience too — to get out of college and find a job where you discover that it's not the kind of work you want to do.
"We don't pretend to think that between 18 and 22 these kids are going to have it all worked out. We want to introduce them to a larger vision that might take years to unfold. But for the guy (who is unsure of his calling) I would say don't settle long term for something that is deadening your soul and doesn't speak to who you are. Don't stay in a career if it doesn't give you a sense that you are making a positive difference in some kind of way. Seek that kind of career even it if takes you ten to 15 years."


text:
- Top 100
- Athletes
- Businessmen
- Celebrities
- News
- Galleries
"carre otis mickey rourke"
Profession:Actor | Model
Date of Birth: 1968-09-28
Nicknames: Carre Otis, Carr? Brennan Otis
Height: 1.78 m
Country: San Francisco
Date of Birth: 1968-09-28
Nicknames: Carre Otis, Carr? Brennan Otis
Height: 1.78 m
Country: San Francisco
Carre Otis
Carre Otis Net Worth is $3 Million. Carre Otis is Actor | Model. Carre Otis Date of Birth is 1968-09-28. Carre Otis Nickname is Carre Otis, Carr? Brennan Otis. Carre Otis Height is 1.78 m. Carre Otis Country is San Francisco.. Carr?(C) Otis (born September 28, 1968) is an America...
Carre Otis Net Worth is $3 Million.Carre Otis Net Worth is $3 Million. Carre Otis is Actor | Model. Carre Otis Date of Birth is 1968-09-28. Carre Otis Nickname is Carre Otis, Carr? Brennan Otis. Carre Otis Height is 1.78 m. Carre Otis Country is San Francisco. Carr? Otis is an American model and actress.
Carr? Otis was born in San Francisco, and raised in Marin County, California along with her older sister Chrisse and her younger brother Jordan. She attended Marin Academy in San Rafael, California and the John Woolman School in Nevada City, California.
Otis began modeling at age 16. Discovered in San Francisco, she was initially signed to Elite Model Management by John Casablancas. She first achieved fame while working for Elite in Paris, when she appeared on the cover of French Elle in April 1986. Over the next several years, she appeared on covers in the American and foreign editions of Vogue, Harper's Bazaar, Cosmopolitan, Allure, Mirabella, and Marie Claire.
Otis appeared in ads for Guess jeans , Calvin Klein jeans , the 1996 Pirelli calendar, and also posed for the Sports Illustrated swimsuit edition . Otis was also featured in 1990 and 2000 issues of Playboy magazine.
Carre Otis Latest News
Carre Otis: 'Mickey Rourke needs to let go of emotional baggage'
Actress and model Carre Otis has urged her ex-husband Mickey Rourke to let go of the emotional "baggage" surrounding their failed marriage because he will never be able to move on if he continues to s...
Posted: October 12, 2011, 3:57 pm
Mickey Rourke, 66, is smitten with his girlfriend Anastassija Makarenko, 32, as they arrive at a party in Beverly Hills
Mickey used to date Gia Carangi and Elena Kuletskaya, and he was married to Carré Otis for six years until 1998, while he was married to actress Debra Feuer until 1989. The 1970s and 1980s saw the asc...
Posted: December 16, 2018, 11:47 pm
Cindy Crawford, Carrè Otis, Naomi Campbell: a Carpi le fotografie di Albert Watson per Blumarine
Photo by Albert Watson Albert Watson, Blumarine, Los Angeles – primavera/estate 1991. Modella: Carré Otis. Photo by Albert Watson Albert Watson, Londra, 1988-1989. Photo by Albert Watson Albert Watson ...
Posted: April 13, 2018, 6:43 am
The Insider
Time to close the book on Mickey Rourke's stormy three-year relationship and seven-month marriage to model-actress Carré Otis? A source close to Otis says the marriage "is over." We're hearing that Ja...
Posted: November 9, 2018, 11:37 pm
Carré Otis Finally Names Her Alleged Rapist: Her Modeling Agent
In her new memoir, Beauty Disrupted, Carré Otis at last names the man who raped her repeatedly when she was a 17-year-old new face model, just starting out in Paris. It was, she says, Gérald Marie, he...
Posted: November 1, 2011, 11:30 am
Carre Otis, Carre Otis 2013, Carre Otis 2014, Carre Otis 2015, Carre Otis Age, Carre Otis And Matthew Sutton, Carre Otis And Mickey Rourke, Carre Otis Anorexia, Carre Otis Beauty Disrupted, Carre Otis Bellazon, Carre Otis Bio, Carre Otis Biography, Carre Otis Blog, Carre Otis Book, Carre Otis Children, Carre Otis Christmas Vacation, Carre Otis Colorado, Carre Otis Country, Carre Otis Date Of Birth, Carre Otis Daughters, Carre Otis Earnings, Carre Otis Ethnicity, Carre Otis Facebook, Carre Otis Gossips, Carre Otis Guess, Carre Otis Heart Surgery, Carre Otis Height, Carre Otis Height Weight, Carre Otis History, Carre Otis Home Town, Carre Otis Husband, Carre Otis Husband Matthew Sutton, Carre Otis Images, Carre Otis Imdb, Carre Otis Income, Carre Otis Instagram, Carre Otis Interview, Carre Otis Job, Carre Otis Measurements, Carre Otis Mickey Rourke, Carre Otis Mickey Rourke Abuse, Carre Otis Model, Carre Otis Movie List, Carre Otis Nationality, Carre Otis Net Worth, Carre Otis Networth, Carre Otis News, Carre Otis Now, Carre Otis O Magazine, Carre Otis Oprah, Carre Otis Partner, Carre Otis Photos, Carre Otis Pictures, Carre Otis Place Of Birth, Carre Otis Plastic Surgery, Carre Otis Plus Size, Carre Otis Plus Size Model, Carre Otis Poster, Carre Otis Poster Christmas Vacation, Carre Otis Quotes, Carre Otis Rumors, Carre Otis S, Carre Otis Salary, Carre Otis Sebastopol Ca, Carre Otis Secrets, Carre Otis Sports Illustrated, Carre Otis Tattoo, Carre Otis Ted Talk, Carre Otis Today, Carre Otis Tumblr, Carre Otis Twitter, Carre Otis Videos, Carre Otis Vk, Carre Otis Weight, Carre Otis Weight Gain, Carre Otis Wiki, Carre Otis Wikipedia, How Much Is Carre Otis Earnings, How Much Is Carre Otis Income, How Much Is Carre Otis Net Worth, How Much Is Carre Otis Salary, How Much Is Carre Otis Worth, Who Is Carre Otis,


text:
Time: 3/8/13 8:43 pm
Description: Operation Grayscale
"Good evening, Dr. Pang Ph.D, director of the Trattorian National Academy for the Life Sciences and chair of the government biology department," Siri greeted as she walked towards his desk.
Dr. Pang replied "Thank you for using my full title, Kaiserin Siri. I have some work that I need to finish, so please make whatever you request of me quick and efficient."
"Well, I'm going to need you to get out of that chair. I also need you to brief me on how Operation Grayscale is going, how close you are to the objective, etc."
Dr. Pang sighed momentarily, before complying with her demands. "I acquiesce, my lady. Although I still really need to finish those lab reports."
"You can finish them once you have told me how Grayscale is going," Siri commented on the way out.
Dr. Pang had insisted that his office be near his laboratories- it didn't take the two figures long to arrive at their destination.
"Welcome to Soledad Biological Laboratory R369, where we are conducting experiments related to Operation Grayscale," Dr. Pang announced as he and Siri approached the experiment.
"Doesn't seem too impressive," muttered Siri.
"I heard that, and I don't appreciate you belittling our efforts," reprimanded Dr. Pang. "In any case, behold our experiment to wipe out Rainbow-Transparent! As you have commanded, I and my subordinate researchers are attempting to cure the terrible effects of Rainbow-Transparent, perhaps even create a vaccine-esque substance that could stop it entirely. While it is true that Rainbow-Transparent is nothing like we have seen before, a truly intractable piece of pwny 'magic'..."-Dr. Pang coughed and choked a little upon saying that word- "we still believe we can find the laws it obeys and bend them to our advantage- specifically, by negating its effects. Here we have patient zero strapped to a lab table, the original user of Rainbow-Transparent."
"I myself have personally devised and overseen the development of a variety of new pharmaceuticals in the hopes of combatting Rainbow-Transparent. This here is methyl 2-phenyl-2-piperidin-2-ylacetate, a prescription that has recently been proven effective in instantly reducing the reproductive drive of all other species.
"This is the exciting part, now he is proceeding with the injection. The moment of truth is finally coming."
"Does this seriously excite you?" Siri interrupted. "This is as boring as watching paint dry on a wall."
While Siri and Dr. Pang bickered about the entertainment value of science, the biologist continued to work, carefully grasping a vial of Rainbow-Transparent.
Siri and Dr. Pang stopped their argument, however, as they saw a small woman being thrown into the room.
"Oh, about her? She's just a chemicals corporation CEO, caught using rainbow-transparent and kissing an employee. Sad how far up the ladder this stupid plague has crept," Dr. Pang regretted.
The CEO kept insisting on her innocence as the Hazmat troopers prodded her forward. "It was just one small fling- how bad could it be to the Trattorian state and the company?". The trooper, as mandated by the Trattorian Human Test Subjects Protocol, stayed quiet.
Meanwhile, the biologist made motions as a warning as he opened the rainbow-transparent vial, spreading the noxious vanilla-pineapple fumes over the male test subject.
"Good, good, the male test subject is approaching the female test subject, they are shaking hands and having civil interactions. Perhaps this drug has worked?" Dr. Pang hoped.
"Ahhh-my eyes!" screamed Dr. Pang as the experiment took a turn for the worst. As his subordinate researchers also averted their eyes, though, and he subsequently reprimanded them. "You scientists are losing precious data!".
The other scientists ignored him, squirming on the floor and mentally-scarred for their lives.
Dr. Pang felt a bit sheepish as he returned to his office under the weighted glare of Siri.
"I apologize, my madam, for the rather terrible scene. I assure you I will not demonstrate another such failed experimental trial within your sight."
"I don't care this time, Dr. Pang. But you need to find that cure for Rainbow-Transparent soon, or else this whole nation is going down back into the stone ages or worse. And you know just as well as I do that Trattorians are incapable of pregnancy- once some people attempt to reproduce naturally, our whole race faces extinction. And remember the rewards for finding that solution."
Dr. Pang took his nearest Nobel Prize off its shelf, examining the golden medal resting in its lustrous box.
"Get the cure, get all of Trattoria's nomination votes for the Nobel Prize in Medicine. I know, I know- I already have six, a seventh would ruin the nice organization I have on these shelves."
Dr. Pang set his eyes on Siri, staring at her intently and lowering his voice. "Rather, I want the directorship, to be the chief scientist of all projects and research in this nation."
Siri's frown deepened its angle somewhat. "Well, I'm not sure if I can force Dr. Liang to resign so soon after I appointed her. She did, after all, discover the Theory of Everything..."
Dr. Pang lowered his Nobel Prize. "I have won six, and she has won one. I have worked many years, achieving a myriad of great services to our scientific community while she has only one accomplishment to her name. If I discover the cure for Rainbow-Transparent, I will seize the directorship with or without your permission."
Spoiler: show
When people said Over the Rainbow felt incomplete, that's because it was. This is meant to add on to that story but at the time I didn't have the time to construct so many sets.


text:
Sign Up
Contact: Marcy K. Krever, Chief Communications Officer
Phone: No calls please.
E-mail: firstname.lastname@example.com
February 8, 2012, New York, NY—The American Montessori Society will celebrate the highly acclaimed Montessori "glass classroom" from San Francisco's 1915 Panama Pacific International Exposition (PPIE) at its2012 Annual Conference, to be held March 15 – 18 at the San Francisco Marriott Marquis.
On Friday, March 16, AMS will showcase a Demonstration Montessori Elementary Classroom, inside the hotel's atrium, where conference attendees will observe students from Valley Montessori School of Livermore, CA, as they carry out activities typical of their school day. The classroom will spotlight hallmark features of Montessori education, including mixed-aged classes (students will range in age from 6 – 9), specially designed learning materials, and self-directed learning. The Demonstration Montessori Elementary Classroom pays tribute to the glass-walled classroom created inside the Palace of Education and Social Economy at the PPIE, which drew crowds of onlookers and garnered worldwide attention for the Montessori educational model.
"It is fitting that we host our conference, which carries the theme 'Montessori: The Bridge to Learning for Every Child,' in San Francisco," said Richard Ungerer, executive director of The American Montessori Society. "With its backdrop of magnificent bridges, the city is the perfect setting to build our own connections and move forward to strengthen and grow Montessori for our children."
This year's conference is expected to draw more than 2,500 educators, researchers and child advocates from around the world. The conference's opening event, on Thursday, March 15, will honor AMS 2012 Living Legacy Chandra Fernando, who has devoted herself to the Montessori Movement for more than 3 decades. Fernando will pay tribute to the ideals of volunteerism and to those who practice it. A volunteer effort particularly close to Fernando's heart has been to develop Montessori classes for Sri Lankan children orphaned by the tsunami that devastated her homeland in 2005.
Also on the 15th, the AMS Peace Committee will lead attendees in a Day of Service, starting at Larkin Street Youth Services, where the group will lend a hand in sorting donations, preparing meals, and assembling care packages. Later, at GLIDE Memorial Church, they will serve dinner to San Francisco's neediest.
The conference will also feature keynote speakers Drs. Brené Brown, Ann Lieberman, and Brian Swimme, esteemed scholars who will offer insights and strategies sure to resonate with Montessorians.
Throughout the long weekend, more than 100 workshops, networking sessions, and exhibitors will target the specific needs and interests of all who attend.
Back to Top
© 2019 American Montessori Society. All rights reserved. 116 East 16th Street, NY, NY 10003 P: 212-358-1250 F: 212-358-1256 E: email@example.com
Web Site Design and Development by The Berndt Group


text:
Wild Take Big Step Toward Playoff Berth With Win In Winnipeg Monday
The Minnesota Wild topped the Winnipeg Jets 1-0 Monday night in Winnipeg. The Wild essentially clinched a playoff spot with the win.
Charlie Coyle scored the game's only goal for Minnesota 1:05 into the second period at even strength, assisted by Mikko Koivu and Zach Parise. Ilya Bryzgalov earned his second straight shutout for Minnesota with 24 saves to improve to 6-0-3 with the Wild since being traded from Edmonton.
The Wild host the Bruins Tuesday night at Xcel Energy Center (6:30, AM 1390).