text:
Difference between revisions of "Taxi"
(Wording, moved a detail to 'design')
|Line 18:
|Line 18:
== Design ==
== Design ==
For [[Grand Theft Auto 1]] there are three versions of the Taxi; the [[Liberty City in GTA 1|Liberty City]] version is based on the [[Portsmouth]], the [[City of San Andreas|San Andreas]] version is based on the [[Vulture]], and the [[Vice City in GTA 1|Vice City]] version is based on the [[Flamer]]. The Taxi in [[Grand Theft Auto 2]] is similar to an elongated [[wp:Fiat 500|Fiat 500]].
For [[Grand Theft Auto 1]] there are three versions of the Taxi; the [[Liberty City in GTA 1|Liberty City]] version is based on the [[Portsmouth]], the [[City of San Andreas|San Andreas]] version is based on the [[Vulture]], and the [[Vice City in GTA 1|Vice City]] version is based on the [[Flamer]]. The Taxi in [[Grand Theft Auto 2]] is similar to an elongated [[wp:Fiat 500|Fiat 500]] .
=== GTA III — GTA Vice City Stories ===
=== GTA III — GTA Vice City Stories ===
Revision as of 18:09, 11 August 2009
The Taxi is a four door sedan-based taxi featured, in some form or other, in nearly all of the games in the Grand Theft Auto series so far. The Taxi represents modern but generic taxis of their setting's era, and is often one of the most common vehicles on the road. Like other taxis from Grand Theft Auto III to Grand Theft Auto: Vice City Stories, the Taxi can be used to perform taxi side-missions. The Taxi does not appear in Grand Theft Auto: Chinatown Wars.
Appears in
- Grand Theft Auto 1
- Grand Theft Auto 2
- Grand Theft Auto III
- Grand Theft Auto: Vice City
- Grand Theft Auto: San Andreas
- Grand Theft Auto Advance
- Grand Theft Auto: Liberty City Stories
- Grand Theft Auto: Vice City Stories
- Grand Theft Auto IV
For Grand Theft Auto 1 there are three versions of the Taxi; the Liberty City version is based on the Portsmouth, the San Andreas version is based on the Vulture, and the Vice City version is based on the Flamer. The Taxi in Grand Theft Auto 2 is similar to an elongated Fiat 500 with the checkered stripe going only through the roof horinzotal.
GTA III — GTA Vice City Stories
From GTA III onwards, the Taxi is usually based on the same model as the police car from the same game.
In GTA III, the Taxi resembles a cross between a late model [ http://en.wikipedia.org/wiki/Chevrolet_Caprice Chevrolet Caprice] and [ http://en.wikipedia.org/wiki/Ford_Crown_Victoria Ford Crown Victoria], with a [ http://en.wikipedia.org/wiki/Chevrolet_Corsica Chevrolet Corsica] inspired grille and headlights. There are minor variants available, with darker bumpers, and different taxi lights. In Grand Theft Auto: Vice City, the Taxi is a [ http://en.wikipedia.org/wiki/Ford_LTD_(North_America) Ford LTD] lookalike. In Grand Theft Auto: San Andreas the Taxi is based on the Premier, which is an [ http://en.wikipedia.org/wiki/Chevrolet_Caprice#1991-1996 early-nineties Chevrolet Caprice]. The taxis in Grand Theft Auto:Liberty City Stories and Grand Theft Auto:Vice City Stories are largely identical to the GTA III and GTA Vice City renditions, respectively. The GTA Liberty City Stories rendition may appear with yellow, black or grey bumpers.
The Taxi in GTA Advance has little indication of which car it is based on, but is generally more boxy in design when compared to the game's Police.
There are two different taxi sedans in Grand Theft Auto IV; one built by Declasse, based on the Merit, and the other built by Vapid, influenced strongly by the Ford Crown Victoria P72. Vapid Taxis may have yellow, grey or black bumpers; some have rooftop advertisements for WTF, Conjoined Twins, and Banging Trash Can Lids For An Hour. The Vapid taxi shares a chassis with the Police and NOOSE Cruisers; this chassis is not used in any civilian car.
Early renditions of the Taxi are generally undesirable due to their mediocre performance. While differing between cities and partially based on muscle vehicles, GTA1's taxis are generally slow, but compensate with good steering. In GTA 2 the opposite is the case, with moderate speed but sluggish controls, inferior to the Taxi Xpress. Both games' renditions have moderate crash endurance.
GTA III — GTA Vice City Stories
The appearance of the Taxi between GTA III and GTA Vice City Stories varies drastically, however the Taxi's performance in all the games of this era may be described as all-round average. With moderate speed, moderate acceleration, light construction, moderate endurance, capable steering and stable cornering (all traits which are helpful during Taxi Driver missions), the Taxi is generally an acceptable vehicle to drive. The vehicle is also front wheel drive, reducing the chances of tailspins when cornering and allowing the vehicle to perform 180-degree turns backwards or forwards with ease.
The Declasse Merit-based taxi in GTA IV is powered by a V6, coupled to a 5 speed gearbox in a RWD layout. Acceleration is very good, and the top speed is also good for a vehicle as common as this. The brakes have been upgraded over the civilian model, and requires a shorter stopping distance. The suspension has also had an upgrade, making this vehicle corner more effectively at speed. Crash deformation is acceptable, and the cab can survive a few frontal hits before failing.
The Vapid Police Cruiser-based Taxi is powered by a 4.6L V8, coupled to a 5 speed gearbox in a RWD layout. Acceleration is good, and the top speed is above average. Its braking and suspension are very good, identical to that of the Police Cruiser; ABS is standard, and the suspension makes quick work of cornering and the bumpy roads of Liberty City. Crash deformation is good, and the vehicle can sustain multiple frontal impacts before failing.
Hailing a cab
In GTA Vice City, and every subsequent game in the GTA III Era, if the player gets Busted or Wasted during a mission, a cab outside the police station or hospital can return them to the mission's starting point.
A new feature introduced in GTA IV is the ability to hail cabs. Niko can whistle for a cab, take a seat in the back, and be driven anywhere in the city for a fee. Upon entering the Taxi, the player can use a terminal within the vehicle to direct the driver to various preset landmarks (safehouses, mission starting locations, recreational facilities such as bowling alleys or the Helitours depot, etc); the player can also direct the driver to any waypoint they set, and during some missions, the player can take a taxi to (stationary) mission markers. The taxi fare is determined by distance, and whether the player used the 'hurry' option (which allows the driver to drive aggressively and ignore road rules) or 'trip-skip' option (where the journey is omitted entirely, the game resuming as the cab pulls up at its location).
In GTA IV, cabs that already have passengers won't normally stop when hailed, but if caught, they can still be used -- Niko will pull the passenger out of the back seat and hop in. Passengers do not retaliate, and there is no Wanted penalty or reaction from the driver.
Niko can get free cab rides from Roman Bellic after the player has earned his respect (Roman will call to inform Niko once the service is available). Selecting "Car Services" from Roman's address-book entry in the Cell Phone will initiate a call to Roman, and he will dispatch one of his cabs to Niko's location. In the beginning of the game, Roman's taxis are customised dark grey Esperantos (see Roman's Taxi), but as his fortunes rise, his company switches to using dark grey Cavalcades.
Taxi side mission
- A Vapid Taxi can be found parked in an alley near Manganese Street and Burlesque in Star Junction, Algonquin.
- In some of the games in the series, Taxis' radios default to certain stations. They are as follows:
- GTA Vice City and GTA Vice City Stories - Espantoso or VCPR
- GTA San Andreas - K-JAH Radio West
- GTA Liberty City Stories - Radio Del Mundo
- GTA IV - San Juan Sounds (in the Declasse Taxi) ; WKTT, PLR, Integrity 2.0 (in the Vapid Taxi)
- In GTA Vice City, Taxis have white spots on the windshield due to an error in applying the vehicle's reflection map.
- In GTA III and GTA Vice City, Taxis may spawn without their lights on top. In GTA IV, the taxi light can be broken off by impacts.
- Taxi drivers tend to be vengeful, exiting their vehicle and assaulting the player if he or she damages their vehicle; they may pull the player out of their own vehicles, or throw punches if they meet the player on foot. In GTA IV, they may cling onto the player's car door while he or she attempts to escape, until the gaining speed forces them to let go.
- The GTA IV Taxi originally had a black variant, as seen in the Vladimir Glebov trailer.
Modifications (GTA San Andreas)
- Libertytaxi.JPG
A Liberty City Taxi in GTA 1.
- SAtaxi.JPG
A San Andreas Taxi in GTA 1.
- VCtaxi.JPG
A Vice City Taxi in GTA 1.
- Taxi 2.jpg
A Taxi in GTA 2.
- Taxi (GTA3) (rear).jpg
A Taxi in GTA III; rear view.
- Taxi Differences GTAIII.jpg
The two taxi differences in GTA III.
- Taxi (GTAVC) (front).jpg
A Taxi in GTA Vice City.
- Taxi (GTAVC) (rear).jpg
A Taxi in GTA Vice City; rear view.
- Taxi 1.jpg
A Taxi in GTA San Andreas.
- Taxi 2 (GTASA) (back).jpg
A Taxi In GTA San Andreas Rear Quarter View
- GTA Taxi.jpg
A Taxi in GTA Advance.
- Taxi (GTA4) (Declasse) (front).jpg
A Declasse "Taxi Car" in GTA IV
- Taxi (GTA4) (Declasse) (rear).jpg
A Declasse "Taxi Car" in GTA IV; rear view.
- Taxi (GTA4) (Vapid) (front).jpg
A Vapid "Taxi Car" in GTA IV.
- Taxi (GTA4) (Vapid) (rear).jpg
A Vapid "Taxi Car" in GTA IV; rear view.
See also
- London Cab, the British equivalent featured in Grand Theft Auto: London, 1969 and London, 1961.
- Taxi Xpress, another taxi featured in Grand Theft Auto 2.
- Cabbie, the older, Checker cab-style equivalent seen in the GTA III trilogy.
- Cabby, a minivan taxi featured in Grand Theft Auto IV.
- Premier, the civilian equivalent of the taxi in Grand Theft Auto: San Andreas.
- Pages with broken file links
- Featured
- Vehicles
- Vehicles in GTA 1
- Vehicles in GTA 2
- Vehicles in GTA III
- Vehicles in GTA Vice City
- Vehicles in GTA San Andreas
- Vehicles in GTA Advance
- Vehicles in GTA Liberty City Stories
- Vehicles in GTA Vice City Stories
- Vehicles in GTA IV
- Public Transport Vehicles
- Taxicabs
- 4-Door Sedans and Coupes


text:
Used 1999 Plymouth Values
Read more Read less
Plymouth Book Values: Plymouth offered models such as the Voyager, Neon, Colt, Acclaim, Laser, Sundance, Volare and Fury). Classic (vintage) Plymouth values range for from the 1968 Barracuda to the Plymouth Savoy. Plymouth, launched by Walter P. Chrysler in 1926, saved the Chrysler Corporation during the great depression offering an alternative to upscale Chrysler and Dodge models. However, after many years of low sales and waning interest in the Plymouth brand, Chrysler Corporation ended Plymouth production in 2001.
Select a 1999 Plymouth model below to get used trade-in values and retail prices
(2001 - 1928 including exotics and classic cars)
1999 Plymouth Breeze
Riding smoother on a retuned double touring suspension, the 1999 Plymouth Breeze sedan comes with either a 2-liter or a more potent 2.4 liter four-cylinder powerplant.
1999 Plymouth Neon
A compact sedan with fantastic fuel mileage, the 1999 Plymouth Breeze is a solid car that features heated mirrors and a 6-speaker sound system.
1999 Plymouth Voyager
A minivan with various engine options, the 1999 Plymouth Voyager has seating for seven and self leveling suspension.

subset: commoncrawl


text:
Sign up for Equitymaster's free daily newsletter, The 5 Minute WrapUp and get access to our latest Multibagger guide (2017 Edition) on picking money-making stocks.This is an entirely free service. No payments are to be made.
Here is the latest stock price and chart of HIFCO MARVEL. For a sector overview, read our finance sector report.
|Live BSE Quotes
|Not listed
|Live NSE Quotes
|Not listed
|BSE Sensex | CNX Nifty
Benchmark indices in US corrected marginally by 0.8% during the week. Minutes of Federal Reserve's July meeting are out and the situation looks to be in favor of the emerging markets.
HDFC starts FY18 on robust loan growth but asset quality slips on increased exposure to developer loans.
Demonetisation led slowdown coupled with shift to stringent bad loan norms keep Shriram Transport Finance on a slow wicket.
Power Finance Corporation earnings hit by RBI mandated higher provision on state government power generation projects where the recovery continues to be 100%.
IDFC regains its tempo in FY17 post the demerger of the banking business.
HDFC ends FY17 on a tepid note as it remains conservative on the asset quality front.More Views on News
The data tells us quite a different story from the one the government is trying to project.
Don't miss these proxy bets on growing companies or in a few years you will be looking back with regret.
Bharat-22 is one of the most diverse ETFs offered so far by the Government. Know here if you should invest...
The India VIX is up 36% in the last week. Fear has gone up but is still low by historical standards.
Raksha Bandhan signifies the brother-sister bond. Here are 7 thoughtful financial gifts for sisters...More


text:
Financial mathematicians are unlikely to be impressed by Lord Turner's review of the banking crisis. Their discipline features quite prominently in the first part of the report, looking at what went wrong, but hardly at all in subsequent sections that prescribe solutions.
Lord Turner, chairman of the Financial Services Authority, blames "misplaced reliance on sophisticated maths" for misleading banks' top management into a false sense of security about the risks they were taking. That is unfair. As Tim Johnson of Heriot-Watt University puts it, the problem was that banks did NOT use sophisticated maths; their mathematical models were far too simple. They had no incentive to employ more complex and realistic models because the simple "single factor" models used for pricing gave an illusion of accuracy and precision – and lulled the market into believing banks had everything under control.
Putting it another way, the models were built to fit market prices. The result was that whacky prices were reinforced by an overlay of scientific respectability.
Lord Turner should have said that we need more and better maths for the future. In particular we require better models of the interdependency of different financial variables and of the risk of extreme events. That means more funding of research in financial mathematics, by the public and private sector.
Another priority, not mentioned by Lord Turner, is to educate bankers about the mathematical basis of their industry. It should no longer be acceptable for them to use models as "black boxes" without making any attempt to understand the underlying assumptions.


text:
CLEVELAND (AP) -- A new addition to Cleveland's cultural scene is getting a chance to show off.
This weekend the Transformer Station owned and operated by the Fred and Laura Ruth Bidwell Foundation is holding an open house with gallery tours.
The space has been renovated from a former streetcar power station. The tours include exhibitions of contemporary photography and photo-based art.
The Cleveland Museum of Art says it expects to present at least two shows per year at the location. The foundation and museum will share exhibit scheduling.


text:
iHome Clock Radio for Cell Phones
This is a very cool speaker dock and alarm clock for those of us with music collections in our cell phones. Its Bluetooth enabled to stream your music and the large LCD screen will display your caller ID info. You can also use the speakers as a speaker phone set up so you don't need to undock your phone when you receive a call. Has a remote control as well.


text:
An Open-Label Multicenter Phase 2 Window of Opportunity Study Evaluating Ganetespib in Women With Breast Cancer (Enchant)
This study has been completed.
Synta Pharmaceuticals Corp.
Information provided by (Responsible Party):
Synta Pharmaceuticals Corp.
ClinicalTrials.gov Identifier:
First received: July 9, 2012
Last updated: November 4, 2015
Last verified: November 2015
- Full Text View
- Tabular View
- No Study Results Posted
- Disclaimer
- How to Read a Study Record
The purpose of this study is to determine if ganetespib (STA-9090) is effective in the treatment of patients with HER2+ or triple negative breast cancer who have not received prior systemic treatment in the metastatic setting.
|Breast Cancer HER-2 Positive Breast Cancer Triple Negative Breast Cancer ER/Progressive Response (PR) + Refractory to Prior Hormonal Treatment
|Drug: ganetespib
|Phase 2
|Study Type:
|Study Design:
|Allocation: Non-Randomized
Intervention Model: Parallel Assignment
Masking: Open Label
Primary Purpose: Treatment
|Official Title:
|An Open-Label Multicenter Phase 2 Window of Opportunity Study Evaluating Ganetespib in Women With Breast Cancer
Resource links provided by NLM:
Genetics Home Reference related topics: breast cancer
MedlinePlus related topics: Breast CancerU.S. FDA Resources
Further study details as provided by Synta Pharmaceuticals Corp.:
Primary Outcome Measures:
- Objective response rate [ Time Frame: Week 12 ]Objective response rate is based on RECIST criteria
Secondary Outcome Measures:
- Duration of response and progression free survival [ Time Frame: Every six weeks until progression ]Progressive disease based on RECIST criteria. CT scans at week 6, week 12 and every 6 weeks thereafter for the duration of the study.
|Study Start Date:
|July 2012
|Study Completion Date:
|August 2015
|Primary Completion Date:
|April 2015 (Final data collection date for primary outcome measure)
|Assigned Interventions
|Experimental: HER2+ breast cancer
Drug: ganetespib
Ganetespib 150 mg/m2 will be administered intravenously, twice weekly, for three consecutive weeks of each 4 week cycle.
Experimental: Triple negative breast cancer
Closed to enrollment
Drug: ganetespib
Ganetespib 150 mg/m2 will be administered intravenously, twice weekly, for three consecutive weeks of each 4 week cycle.
|Experimental: ER/PR+ Refractory to Prior Hormonal Treatment
Drug: ganetespib
Ganetespib 150 mg/m2 will be administered intravenously, twice weekly, for three consecutive weeks of each 4 week cycle.
|Ages Eligible for Study:
|18 Years and older (Adult, Senior)
|Sexes Eligible for Study:
|Accepts Healthy Volunteers:
Inclusion Criteria:
- Pathologically confirmed diagnosis of invasive breast cancer.
- Stage IV disease.
- Documented HER2 and hormonal receptor status per protocol, ER/PR+ patients must be refractory to at least one prior hormonal treatment.
- ECOG Performance status 0-1.
- Measurable disease per RECIST (1.1).
- Adequate hematological function per protocol.
- Adequate hepatic function per protocol.
- Adequate renal function per protocol.
- Negative serum pregnancy test at study entry for patients of childbearing potential.
- Ability to understand and sign written consent and to comply with the study protocol.
Exclusion Criteria:
- Presence of active or untreated CNS metastases as determined by MRI/CT scan performed during screening.
- Active malignancies other than MBC within the last 5 years except adequately treated in situ carcinoma of the cervix uteri or basal or squamous cell carcinoma of the skin.
- Bone as the only site of metastatic disease from breast cancer.
- Prior radiotherapy to the only area of measurable disease. NOTE: Radiotherapy to a limited area other than the sole site of measurable disease is allowed, if received prior to initiation of ganetespib treatment. Patients must have completed treatment and recovered from all acute treatment-related toxicities prior to administration of first dose of ganetespib.
- Pregnancy or lactation.
- Known serious cardiac illness.
- Uncontrolled intercurrent illness per protocol.
- Other severe acute or chronic medical condition or abnormality that may increase the risk associated with study participation or study drug administration, or may interfere with the interpretation of study results, or that in the judgment of the investigator would make the patient inappropriate for entry into the study.
Contacts and Locations
Choosing to participate in a study is an important personal decision. Talk with your doctor and family members or friends about deciding to join a study. To learn more about this study, you or your doctor may contact the study research staff using the Contacts provided below. For general information, see Learn About Clinical Studies.
Please refer to this study by its ClinicalTrials.gov identifier: NCT01677455
Hide Study Locations
Please refer to this study by its ClinicalTrials.gov identifier: NCT01677455
Hide Study Locations
|United States, Alabama
|Synta Pharmaceuticals Investigative Site
|Birmingham, Alabama, United States, 35249
|United States, Georgia
|Synta Pharmaceuticals Investigative Site
|Altanta, Georgia, United States, 30341
|United States, Massachusetts
|Synta Pharmaceuticals Investigative Site
|Boston, Massachusetts, United States, 02111
|United States, New York
|Synta Pharmaceuticals Investigative Site
|New York, New York, United States, 10065
|United States, North Carolina
|Synta Pharmaceuticals Investigative Site
|Durham, North Carolina, United States, 27710
|United States, Ohio
|Synta Pharmaceuticals Investigative Site
|Columbus, Ohio, United States, 43210
|United States, Pennsylvania
|Synta Pharmaceuticals Investigative Site
|Philadelphia, Pennsylvania, United States, 19111-2497
|United States, Texas
|Synta Pharmaceutical Investigative Site
|Houston, Texas, United States, 77030
|Synta Pharmaceuticals Investigative Site
|Cordoba, Argentina
|Synta Pharmaceuticals Investigative Site
|Rosario Santa Fe, Argentina, S2000KZE
|Synta Pharmaceuticals Investigative Site
|Brussels, Belgium, B-1000
|Synta Pharmaceutical Investigative Site
|Charleroi, Belgium, 6000
|Synta Pharmaceuticals Investigative Site
|Wilrijk, Belgium, 2610
|Synta Pharmaceuticals Investigative Site
|Sao Paulo, Brazil, 01246
|Korea, Republic of
|Synta Pharmaceutical Investigative Site
|Seoul, Gangnam-GU, Korea, Republic of
|Synta Pharmaceuticals Investigative Site
|Seoul, Jongno-Gu, Korea, Republic of
|Synta Pharmacuetical Investigative Site
|Seoul, Seodaemun-GU, Korea, Republic of
|Synta Pharmaceuticals Investigative Site
|Seoul, Songpa-Gu, Korea, Republic of
|Synta Pharmaceuticals Investigative Site
|Lima, Peru
|Synta Pharmaceuticals Investigative Site
|Barcelona, Spain, 08035
|United Kingdom
|Synta Pharmaceutical Investigative Site
|Edinburgh, United Kingdom, EH4 2XU
|Synta Pharmaceutical Investigative Site
|Glasgow, United Kingdom, G12 0YN
|Synta Pharmaceutical Investigative Site
|Nottingham, United Kingdom, NG51PB
|Synta Pharmaceuticals Investigative Site
|Oxford, United Kingdom, OX3 9DU
|Synta Pharmaceutical Investigative Site
|Peterborough, United Kingdom, PE3 9GZ
Sponsors and Collaborators
Synta Pharmaceuticals Corp.
More Information
Keywords provided by Synta Pharmaceuticals Corp.:
Additional relevant MeSH terms:
ClinicalTrials.gov processed this record on August 16, 2017
|Responsible Party:
|Synta Pharmaceuticals Corp.
|ClinicalTrials.gov Identifier:
|NCT01677455 History of Changes
|Other Study ID Numbers:
|Study First Received:
|July 9, 2012
|Last Updated:
|November 4, 2015
Keywords provided by Synta Pharmaceuticals Corp.:
Hsp90 inhibitor
Additional relevant MeSH terms:
Breast Neoplasms
Triple Negative Breast Neoplasms
Neoplasms by Site
Breast Diseases
Skin Diseases
ClinicalTrials.gov processed this record on August 16, 2017


text:
Bring an empty tissue box to the library, and use our materials to make a funny Valentine monster, ready to gobble up all the Valentines you get from your friends! Perfect for school parties or to decorate your shelf at home. All ages, register at your local branch in person or by phone. We can supply empty boxes until they run out.
Caledonia: Thursday, February 7, 5 PM
LaRue: Monday, February 11, 5 PM
Prospect: Tuesday, February 12, 4 PM


text:
Tag: sheffield
Dont Flop "To The Test 6" Behind The Scenes [Video]
As many of the Hip-Hop Kings fans will already know, we are the official media partner for the filming and behind the scenes footage for the Don't Flop battle league. Both myself and Dan from Nomadic Productions were recently in Sheffield for the "To The Test 6" battle event, which featured the likes of Lunar C, Matter, Bowski and Jefferson Price amongst the battlers. Look out for the behind the scenes footage in London coming very soon, however you can watch Dont Flop "To The Test 6" behind the scenes on the video player below.
Please follow and like us:
Category: Uncategorized


text:
Attention Deficit Hyperactivity Disorder: Diagnosing ADHD
There is no single test used to diagnose attention deficit hyperactivity disorder. ADHD is diagnosed after a person has shown some or all of symptoms of ADHD on a regular basis for more than six months.
Diagnosing ADHD in Children
Health care providers, such as pediatricians and child psychologists can diagnose ADHD with the help of standard guidelines from the American Academy of Pediatrics. The diagnosis involves gathering information from several sources, including schools, caregivers, and parents. The health care provider will consider how a child's behavior compares with that of other children the same age.
Some symptoms suggestive of ADHD in children include inattention, hyperactivity, and/or impulsivity in a variety of ways. Many children with ADHD:
Learn more about the symptoms of ADHD in children.
To diagnose ADHD, your child should receive a full physical exam. That includes a discussion of medical history to screen for other conditions that may affect a child's behavior. Certain conditions that could mimic ADHD or cause the ADHD-like behaviors are:
Diagnosing ADHD in Adults
It is not easy for a health care provider to diagnose ADHD in an adult. Sometimes, an adult will recognize the symptoms of ADHD in himself or herself when a son or daughter is diagnosed. Other times, they will seek professional help for themselves and find that their depression, anxiety, or other symptoms are related to ADHD.
Symptoms of ADHD in adults include:
If these difficulties are not managed appropriately, they can cause emotional, social, occupational and academic problems in adults.
In order to be diagnosed with ADHD, an adult must have childhood-onset and persistent, current symptoms. ADHD symptoms continue as problems into adulthood for approximately 60% of children with ADHD. For an accurate diagnosis, the following are recommended:
Reviewed by Marina Katz, MD on February 21, 2011
Last Editorial Review: 2/21/2011


text:
The New York Mets today announced that Bench Coach Sandy Alomar Sr. and First Base Coach Luis Alicea will not be returning for the 2010 season. Alomar Sr. will be offered another position within the organization.
Hitting Coach Howard Johnson, Pitching Coach Dan Warthen and Bullpen Coach Randy Niemann will return to Manager Jerry Manuel's staff in the same positions next year. Third Base Coach Razor Shines and Catching Instructor Sandy Alomar Jr. will be part of the Major League staff in 2010 in yet to be determined roles.
What are your thoughts on these changes? Shines didn't exactly live up to his name as a third-base coach, though he seemed to improve as the season went along.
It'll be interesting to see what role they give to Alomar and who will take his place as bench coach.


text:
You won't be able to dismiss this by usual means (escape or click button), but you can close it programatically based on user choices or actions.
"I am so happy with my invitations. The quality of the paper is great...weighty and perfectly textured. The design is so elegant. The only thing I would say is that they are smaller than I expected but I was reading that's that is a good thing as it saves on postage! Service was also prompt and a pleasant experience."
"Absolutely beautiful. It was really easy to customize the wedding invite. My designer did a great job of brining my ideas to life. I really wanted to be able to include our parents in the invite and the designer came up with a great solution and moved a few things around. The invite is exactly what we wanted. Thank you so much!"
"Great design with a tint of nostalgia. WPD designers are easy to work with - incorporated more wording on the back of the card at my request. Customer service was also top notch. My cards were delayed - WPD happily sent me another batch for next day delivery. Would definitely recommend this design and WPD in general to friends."
"I was so afraid to order my shipment without seeing the exact card proof but I love them! I had ordered the LINEN background because others had recommended it, and instead of the textured I ordered the PEARL WHITE SHIMMER for a more modern look. I couldn't be happier with them. It looks like, from other reviewers, you really have to change the background to linen if you want the shimmer. I hadn't liked the roughness of the original sample. The red is a bit on the pink side but not too much. The designers were able to put the little Ganesh in the top circle for me which I was very impressed with! I definitely recommend!"
"Absolutely love how the cards turned out! We received so many complements from our family and friends. I used one of our engagement shots and added the ceremony details to personalize. The process was simple and shipping was fast. Customer service was excellent too."


text:
NetWellness is a global, community service providing quality, unbiased health information from our partner university faculty. NetWellness is commercial-free and does not accept advertising.
Monday, August 21, 2017
McDaniels-Wilson, PhD
Adjunct Professor
Criminal Justice Research Center
Department of Sociology
The Ohio State University
Dr. McDaniels-Wilson is an Adjunct Professor in the Department of Family Medicine at The Ohio State University in Columbus Ohio. She is also an Assistant Professor of Psychology at Xavier University. Dr. McDaniels-Wilson research interests include sexual trauma, obesity and body image, incest and rape, behavioral medicine, and attention deficit disorder. She has published articles in journals like The Business Review, Violence Against Women and The International Journal of Africana Studies to name a few. Dr. McDaniels-Wilson went to the University of Cincinnati and graduated with a PhD in Clinical Psychology. She belongs to the American Psychological Association, Association of Black Psychologist, Ohio Psychological Association and Ohio Psychological Association.
More about Dr. McDaniels-Wilson


text:
Hey there, time traveller!
This article was published 20/3/2013 (1615 days ago), so information in it may no longer be current.
During his political career, Brian Tobin always seemed pleased when the lights shone on him.
But in his post-political career as a corporate director -- and in particular as the chairman of the board of New Flyer Industries, a position he's held since 2005 -- he is a study in, well, good corporate governance.
And that means to yield the limelight to the management team.
Tobin chose to make a rare public appearance in Winnipeg Wednesday to talk about the relationship between a board chairman and the CEO.
The event was a regular meeting of the local chapter of the Institute of Corporate Directors, an organization that provided a platform, of sorts, for Tobin's post-political life.
"When I left political life, I wanted another career," he told the crowd of 180 people at the Manitoba Club, more than twice as large as a typical ICD events. "I had been in political life for 22 years and I was 47. I made the decision I didn't want to be another longtime politician that came out and spent time on the edges of whatever, and then really retired."
He made a few calls and a friend at the University of Toronto told him the first class of the ICD's director-designation course was about to begin.
Tobin was in the inaugural class and a confidant of John Marinucci, then the CEO of New Flyer, was also in the class.
"I think my name, purely as a result of going through the program, was put up as a potential director," he said. "I guess the network worked in that case."
A year after taking his seat at the New Flyer board, he became chairman of Consolidated Thompson Iron Mines Ltd., where the former Newfoundland premier helped orchestrate the $4.9-billion sale of that firm to Cliffs Natural Resources Inc. in 2010.
Even though he was recruited by Marinucci who is still on New Flyer's board, Tobin's relationship with the bus-maker's current CEO, Paul Soubry, seems to be filled with the kind of respect, professional thoroughness and good humour of which good corporate partnerships are made.
Tobin seemed to enjoy poking fun at Soubry, alleging he was snubbed by Soubry at his Winnipeg hotel while Soubry fawned over the chairman of the board's compensation committee.
Later he said, "Our management team are standup guys. Last year, they did not get paid a whole bunch because we had a tough year. But no one came and said we missed targets, but pay us anyway."
While the ICD event gave him a chance to brag about his and the company's dedication to good governance, New Flyer really does have a good track record.
Soubry is known for almost maniacal attention to detail and a dedication to operational excellence. For instance, succession planning at New Flyer goes deeper than just senior management; Soubry draws up complicated checklists on levels of briefings provided to the board; and every board member must receive the ICD designation.
In 2012, the company experienced significant declines in profits as its mainly U.S. customers -- municipal transit authorities -- saw their resources jammed up as U.S. governments dealt with the financial crisis. But the orders are starting to come back and in the meantime, New Flyer spent $25 million becoming more efficient. Brazilian bus-maker Marcopolo recently sunk $116 million into the company for a 20 per cent stake and it acquired the parts business from shuttered former competitor Orion.
"When you look at a lot of the wreckages during the last four to five years and the companies that disappeared or were bailed out, a lot of it was because people began to manage for compensation, for bonuses," Tobin said. "People stopped taking the view of... building for the next generation."
But not New Flyer; with Soubry at the helm and Tobin in the background making sure he knows where he's going.


text:
GREG Hernandez led the way as Essex Leopards won the National Trophy in thrilling fashion, beating Tees Valley Mohawks 99-91 in over-time.
Hernandez was named MVP after top scoring for the Big Cats with 26 points.
But he was keen to play down his part in the triumph.
"I may have got an award but it was a real team effort and everyone played a part in the win," said Hernandez, 24.
"Taner (Adu) had 25 points before he got injured, Simon (Cummings) had a complete game and although Carl Josey won't show up on the stats line he did a crucial job in defence in order for us to win it.
"It was a real see-saw, up and down game but we were able to come out on top and it was a fantastic feeling.
"Hopefully we can keep playing well now and can get another trophy by winning the play-offs at the end of the season."
Both sides traded baskets in the opening exchanges in Leicester before an Adu three capped a 9-2 run to put Leopards 15-8.
They led 19-15 at the end of the first period but the second belonged to Mohawks James Hansen as he poured in 20 points including six three pointers to put his side in the driving seat with a 51-42 lead at half-time.
However, Cummings opened the second half scoring to launch an 8-0 run which saw the Big Cats pull within a point before Hansen scored what proved to be his only three pointer after half-time.
A pair of three-point plays from Cummings gave Leopards their first lead after the break but there was little to choose between the teams in the rest of the period and Leopards went into the fourth period with a 70-68 lead.
Adu then hit a single free-throw to open before Rowell Graham made it a five point game.
But it took until 40 seconds from the end of the fourth period before an and-one from Hernandez put the Big Cats back into the lead at 84-83.
Kohn replied with a three point play of his own to put Mohawks up by two before Hansen fouled Cummings with 25 seconds left, and the American guard coolly drained both free throws to level things.
After that, Kohn missed a shot with eight seconds on the clock and Youngblood grabbed the rebound to set Hernandez up for an attempted buzzer-beater, but it rimmed out and the game went to an extra period.
The additional five minutes belonged to Leopards as Youngblood showed that even as he approaches his 43rd birthday he can still take over a game.
The Leopards' coach hit the first two baskets of the additional period, and although Cummings missed a pair at the foul line, Josey made it a five point game with a single free-throw.
Jorge Ebanks hit a three to cut the lead to 91-89 with 2:09 minutes on the clock before Youngblood doubled the advantage after Josey had pulled down a rebound.
Youngblood and Cummings both split pairs of free-throws to make it a six point game with 22 seconds remaining and that sealed Leopards' win.


text:
ResNet is the residential network service provided to students living on campus at UMD. ResNet is how you connect to the Internet!
There are no additional fees for Internet access from your residence hall room.
Wireless access: Wireless access is the primary way most students connect their devices to the Internet. In Lake Superior Hall, wireless access is the only option.
Wired access: Most rooms are wired with one network jack per student; the major exception being Lake Superior Hall, which does not offer wired Internet access. While wired jacks can be reliable, often users find our wireless Internet service to be faster and more convenient. If you decide to use a wired connection, you will need to bring or purchase your own Ethernet RJ45 cable to use the wired network service.
For access to the University network, you will need to authenticate with your University Internet/email ID and password.
If you do not know your Internet ID and password, please call or stop by the ITSS TechCenter during business hours (Kirby Plaza 165, 218-726-8847).
Follow these instructions to get online with your computer or other network devices:
ResNet service is provided to allow students to complete their educational mission. It is a limited resource shared by all residents. Please keep in mind that we are not a commercial Internet provider, so some restrictions do apply:
Violation of these terms may result in removal from the network and/or referral to the Office of Student and Community Standards.
For the complete version of these terms and disciplinary action, see: UMD Network Terms and Conditions.
Downloading or sharing copyrighted material is against the law; doing it while on the University network (ResNet, wireless, VPN or modem) is against University policy. You should be aware of the risks you take if you choose to participate in this activity.
While the University does not monitor network traffic for content, the recording and motion picture industries do monitor networks for illegal sharing of their copyrighted materials via peer-to-peer (P2P) software. When they find evidence of this on a computer on our network, they send the University a DMCA "cease and desist" notice, which we in turn pass on to the student. For a first notice, your network access is temporarily disabled and you must review the UMD Network Terms and Conditions and re-register your computer to regain access. Additional notices have more restrictive consequences.
In some cases, the copyright holder may choose to send pre-litigation or preservation notices, which can be pre-cursors to further legal action (i.e., suing for copyright infringement).
Here's what you should know about file-sharing:
Make smart choices while you're here. If you choose to use the University network, remove all peer-to-peer file-sharing software from your computer.
Rev: 08.13 alj


text:
You won't be able to dismiss this by usual means (escape or click button), but you can close it programatically based on user choices or actions.
"Purchased the place card after ordering the rehearsal dinner invitations in the same design. Was so pleased with the invitations (first time order), decided to order the matching place cards. Standard paper is of excellent quality and color vibrant. Very impressed with their quick delivery. Example on website does not do justice to the beautiful finished product."
"I removed the table #____. These are the perfect size & thickness for seating cards. The colors match a pink themed wedding perfectly. I also ordered the matching invitations."
"I ordered these for my wedding for the tables and place cards. i then called to place a smaller order of the same cards with no writing on them so i can use them to label some family photos and favors etc. they came with the writing on them so i called and they fixed the problem right away and overnighted the correct cards."
"Designers were very helpful! Willing to add family passage to the back of our place cards and very fast delivery. Highly recommend!"
"These place cards turned out just as we expected. We love the color, paper quality and overall design. We can't wait to use them for our upcoming wedding! Thanks Wedding Paper Divas!!!!"


text:
This yarn is a stunning blend of 70% mohair and 30% silk and features a white core, giving a subtle melange effect. When knitted, a vintage-look fabric is created, making it an ideal choice for all layering pieces, accessories and essential shapes.
Our ever popular Kidsilk Haze is a beautiful and versatile fine yarn made from a blend of super kid mohair and silk.
The perfect blend of lambswool and kid mohair creates a lovely soft yarn which is worked into a beautiful colour palette.
This wonderful soft roving British yarn is a designer's dream.


text:
Fix My Blinds offers replacement parts and string for blinds and shades. We have a large library of instructional videos, written instructions, and part diagrams. We take pride in offering exceptional customer service and fast order processing times. If you have questions about a part or repair please email us at email@example.com or call us at 719-597-0696.
Back to top


text:
Item #: re-can301
Lucaya Octagonal Coffee Table
We think eclectic, modern, fresh, innovative...something from the islands to accent your coastal home. Refined. Worldly and uncompromising. This sexy collection takes its inspiration from the classic blending of French and Vietnamese during the 1920's and 30's. It is clubby, a little deco, and very atmospheric; think exotic,the islands, tropical...Bahamian.
The materials are solid cane and woven rattan. Very strong and sturdy, yet light weight for easy moving. The finish shown is dark chocolate brown tortoise but each piece comes in a dazzling selection of fresh colors! Custom finishes ship 4-6 weeks.
Measures 32"W x 19"H x 32" D.
We can customize and are happy to loan finish samples at no charge. Email your color selections and mailing address to email@example.com
If in stock, Ships in 4-6 weeks.
Custom made for you. Not eligible for return or exchange. Please view our return policy for more information. Ships white glove delivery.


text:
DİDEM ÜRER: The customs officer that the Syrians have attacked has been martyred; the news just came.
ADNAN OKTAR: May Allah rest his soul. Of course we should look into why something like that has happened because it is terrible for people to be left in that region, it is like Hell out there. They should be able to pass by the border, come in from the Turkish Border. Those dear ones of mine, they would be perfectly happy even witha loaf of bread and a piece of cheese, they would happily and peacefully live there.
But the situation in Syria should be resolved as soon as possible. It cannot go on like this. Al-Assad is too comfortable. His applauders have gathered around him.
He should leave already! How can it be acceptable to pass the government from father to son? And it will pass to the grandson and then who knows who? Just step down so that free elections can be held. Well, of course you can also run in the elections - no one would say anything to that. If you win, that is okay, right? Maybe you can get into a coalition government.
But he wants to be in power in any case. Forget about that, it is not acceptable. You have to accept democracy. You do not embrace democracy, you demand a dictatorial regime. You want tyranny; you want the system of the dajjal (anti-Christ).
I have said this thirty times; I have told him to "...talk about the unity of Islam openly." See what his men said; "He cannot say that, Baath people would not let him say that."
Well my brother, you are doomed then but now we do not say anything about that either. Now if we tell him to "flee" he cannot do that either. He has been besieged. Only Russian diplomats can go in and take him out. For instance, if the Russian Minister of Foreign Affairs were to go and take him to a capital ship of the Russian navy, they can then take him out with a helicopter or with escorts from the navy. No one would dare to come close to their navy and the matter would thus be solved.
They should talk to Putin and persuade him. Al-Assad should be willing to leave. He is held as a captive in the hands of the Syrian deep state organization. As far as I see, he is not able to leave. What should be done is to involve Russia in this matter. The US should back Russia up as well, it is not acceptable to leave Russia alone in this. The US should support this mission: They can get in contact with China as well, China should support them. We are talking to the Chinese officials and they are very reasonable about this. (Adnan Oktar, May 2nd, 2013: A9 TV)2013-06-16 13:35:52


text:
Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |
Cognitive Psychology: Attention · Decision making · Learning · Judgement · Memory · Motivation · Perception · Reasoning · Thinking - Cognitive processes Cognition - Outline Index
The Tower of Hanoi or Towers of Hanoi is a mathematical game or puzzle. It consists of three pegs, and a number of disks of different sizes which can slide onto any peg. The puzzle starts with the disks neatly stacked in order of size on one peg, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another peg, obeying the following rules:
- Only one disk may be moved at a time.
- Each move consists of taking the upper disk from one of the pegs and sliding it onto another peg, on top of the other disks that may already be present on that peg.
- No disk may be placed on top of a smaller disk.
Origins Edit
The puzzle was invented by the French mathematician Édouard Lucas in 1883. There is a legend about an Indian temple which contains a large room with three time-worn posts in it surrounded by 64 golden disks. The priests of Brahma, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle. According to the legend, when the last move of the puzzle is completed, the world will end. The puzzle is therefore also known as the Tower of Brahma puzzle. It is not clear whether Lucas invented this legend or was inspired by it. The Tower of Hanoi is a problem often used to teach beginning programming, in particular, as an example of a simple recursive algorithm.
If the legend were true, and if the priests were able to move disks at a rate of one per second, using the smallest number of moves, it would take them 264−1 seconds or roughly 600 billion years (operation taking place is ) .[1] (In context, the universe is currently about 13.7 billion years old.)
There are many variations on this legend. For instance, in some tellings, the temple is a monastery and the priests are monks. The temple or monastery may be said to be in different parts of the world — including Hanoi, Vietnam, and may be associated with any religion. In some versions, other elements are introduced, such as the fact that the tower was created at the beginning of the world, or that the priests or monks may make only one move per day.
The Flag Tower of Hanoi may have served as the inspiration for the name.
Solution Edit
Most toy versions of the puzzle have 8 disks. The game seems impossible to many novices, yet is solvable with a simple algorithm:
Simple solutionEdit
The following solution is a simple solution for the toy puzzle.
Alternate moves between the smallest piece and a non-smallest piece. When moving the smallest piece, always move it in the same direction (either to the left or to the right, but be consistent). If there is no tower in the chosen direction, move it to the opposite end. When the turn is to move the non-smallest piece, there is only one legal move.
Recursive solutionEdit
As in many mathematical puzzles, finding a solution is made easier by solving a slightly more general problem: how to move a tower of h (h=height) disks from a starting peg f (f=from) onto a destination peg t (t=to), r being the remaining third peg and assuming t ≠ f. First, observe that the problem is symmetric for permutations of the names of the pegs (symmetric group S3). If a solution is known moving from peg f to peg t, then, by renaming the pegs, the same solution can be used for every other choice of starting and destination peg. If there is only one disk (or even none at all), the problem is trivial. If h=1, then simply move the disk from peg f to peg t. If h>1, then somewhere along the sequence of moves, the largest disk must be moved from peg f to another peg, preferably to peg t. The only situation that allows this move is when all smaller h-1 disks are on peg r. Hence, first all h-1 smaller disks must go from f to r. Subsequently move the largest disk and finally move the h-1 smaller disks from peg r to peg t. The presence of the largest disk does not impede any move of the h-1 smaller disks and can temporarily be ignored. Now the problem is reduced to moving h-1 disks from one peg to another one, first from f to r and subsequently from r to t, but the same method can be used both times by renaming the pegs. The same strategy can be used to reduce the h-1 problem to h-2, h-3, and so on until only one disk is left. This is called recursion. This algorithm can be schematized as follows. Identify the disks in order of increasing size by the natural numbers from 0 up to but not including h. Hence disk 0 is the smallest one and disk h-1 the largest one.
The following is a procedure for moving a tower of h disks from a peg f onto a peg t, with r being the remaining third peg:
- Step 1: If h>1 then first use this procedure to move the h-1 smaller disks from peg f to peg r.
- Step 2: Now the largest disk, i.e. disk h-1 can be moved from peg f to peg t.
- Step 3: If h>1 then again use this procedure to move the h-1 smaller disks from peg r to peg t.
By means of mathematical induction, it is easily proven that the above procedure requires the minimal number of moves possible, and that the produced solution is the only one with this minimal number of moves.
Using recurrence relations, the exact number of moves that this solution requires can be calculated by: . This result is obtained by noting that steps 1 and 3 take moves, and step 2 takes one move, giving .
The algorithm can be written elegantly in various programming languages:
Objective CamlEdit
let rec move_tower n a b c = match n with | 1 -> [(a,c)] | _ -> (move_tower (n-1) a c b) @ (move_tower 1 a b c) @ (move_tower (n-1) b a c);;
PL/I programming languageEdit
hanoi:proc(n, f, t, u) recursive; dcl(n, f, t, u) fixed bin(31); if n > 0 then do; call hanoi(n-1, f, u, t); call movedisk(f, t); call hanoi(n-1, u, t, f); end; end hanoi; movedisk:proc(f, t); dcl (f, t) fixed bin(31); put skip list('move' || f, '->' || t); end movedisk;
Solution from an arbitrary initial configurationEdit
To find the optimal solution from an arbitrary initial configuration, the algorithm can be generalized as follows:
In JavaScript (adapted from http://my.opera.com/sykora/blog/the-towers-of-hanoi):
function transfer(numDiscs, source, destination, storage) { // If there is nothing to transfer, do nothing. if (numDiscs == 0) return; //Transfer all but the last disc to the temporary storage location transfer(numDiscs - 1, source, storage, destination); //Transfer the last disc to the destination document.writeln("Moving disc " + numDiscs + " from " + source + " to " + destination + "<br />"); //Transfer all but the last disc from the temporary storage to the destination transfer(numDiscs - 1, storage, destination, source); } function main() { numDisks = prompt("Please enter the number of disks you want to use:", ""); source = 'A'; destination = 'C'; storage = 'B'; transfer(numDisks, source, destination, storage); }
In Ruby:
def transfer_discs(discs_id, source, destination, temporary) if discs_id>0 transfer_discs(discs_id-1, source, temporary, destination) puts("Moving disc #{discs_id} from #{source} to #{destination}") transfer_discs(discs_id-1, temporary, destination, source) end return end print("input disc amount: ") discs_amount=STDIN.gets discs_amount=discs_amount.tr("\r\n", '') while(/^[1-9][0-9]*$/.match(discs_amount)==nil) puts("amount error") print("input disc amount: ") discs_amount=STDIN.gets discs_amount=discs_amount.tr("\r\n", '') end discs_amount=discs_amount.to_i flat_1_name="A" flat_2_name="B" flat_3_name="C" transfer_discs(discs_amount, flat_1_name, flat_2_name, flat_3_name)
In Java:
public class Towers { public static void main(String args[]) { hanoi(2,"A","B","C"); } //from, tmp, to public static void hanoi(int n, String a, String b, String c) { if (n==1) { System.out.println("Moved from:"+a+" to "+ c); } else { hanoi(n-1,a,c,b); hanoi(1,a,b,c); hanoi(n-1,b,a,c); } } }
In Scheme:
; Let conf be a list of the positions of the disks in order of increasing size. ; Let the pegs be identified by the numbers 0, 1 and 2. (define (hanoi conf t) (let ((c (list->vector conf))) (define (move h f t) (vector-set! c h t) (printf "move disk ~s from peg ~s to peg ~s~n" h f t)) (define (third-peg f t) (- 3 f t)) (define (hanoi h t) (if (> h 0) (let ((h (sub1 h))) (let ((f (vector-ref c h))) (if (not (= f t)) (let ((r (third-peg f t))) (hanoi h r) (move h f t))) (hanoi h t))))) (hanoi (vector-length c) t)))
In C:
int conf[HEIGHT]; /* Element conf[d] gives the current position of disk d. */ void move(int d, int t) { /* move disk d to peg t */ conf[d] = t; } void hanoi(int h, int t) { if (h > 0) { int f = conf[h-1]; if (f != t) { int r = 3 - f - t ; hanoi(h-1, r); move(h-1, t); } hanoi(h-1, t); } }
In PASCAL:
procedure Hanoi(n: integer; from, to, by: char); Begin if (n=1) then writeln('Move the plate from ', from, ' to ', to) else begin Hanoi(n-1, from, by, to); Hanoi(1, from, to, by); Hanoi(n-1, by, to, from); end; End;
In Visual Basic.NET:
Private Sub MoveDiscs(ByVal FromPost As String, ByVal ToPost As String, _ ByVal IntPost As String, ByVal N As Integer) If N = 0 then 'Stopping case lstMoves.Items.Add("Move disc 0 from post " + FromPost + " To Post" + ToPost) Else MoveDiscs(FromPost, IntPost, ToPost, N - 1) lstMoves.Items.Add("Move disc" + Cstr(N) + " from post " + FromPost + _ "To Post" + ToPost) MoveDiscs(IntPost, ToPost, FromPost, N - 1) End If End Sub
trbDiscs being a track bar to choose amount of discs
Non-recursive solutionEdit
The list of moves for a tower being carried from one peg onto another one, as produced by the recursive algorithm has many regularities. When counting the moves starting from 1, the ordinal of the disk to be moved during move m is the number of times m can be divided by 2. Hence every odd move involves the smallest disk. It can also be observed that the smallest disk traverses the pegs f, t, r, f, t, r, etc. for odd height of the tower and traverses the pegs f, r, t, f, r, t, etc. for even height of the tower. This provides the following algorithm, which is easier, carried out by hand, than the recursive algorithm.
In alternate moves:
- move the smallest disk to the peg it has not recently come from.
- move another disk legally (there will be one possibility only)
For the very first move, the smallest disk goes to peg t if h is odd and to peg r if h is even.
So if the number of disks is even the solution will start:
- Move disk 0 from peg f to peg r ignoring peg t.
- Move disk 1 from peg f to peg t ignoring peg r.
- Move disk 0 from peg r to peg t ignoring peg f.
- Move disk 2 from peg f to peg r ignoring peg t.
- Move disk 0 from peg t to peg f ignoring peg r.
- Move disk 1 from peg t to peg r ignoring peg f.
- Move disk 0 from peg f to peg r ignoring peg t.
- Move disk 3 from peg f to peg t ignoring peg r.
- Move disk 0 from peg r to peg t ignoring peg f.
- Move disk 1 from peg r to peg f ignoring peg t.
- Move disk 0 from peg t to peg f ignoring peg r.
- Move disk 2 from peg r to peg t ignoring peg f.
- Move disk 0 from peg f to peg r ignoring peg t.
- Move disk 1 from peg f to peg t ignoring peg r.
- Move disk 0 from peg r to peg t ignoring peg f.
- Move disk 4 from peg f to peg r ignoring peg t.
Also observe that:
- Disks whose ordinals have even parity move in the same sense as the smallest disk.
- Disks whose ordinals have odd parity move in opposite sense.
- If h is even, the remaining third peg during successive moves is t, r, f, t, r, f, etc.
- If h is odd, the remaining third peg during successive moves is r, t, f, r, t, f, etc.
Binary solutionsEdit
Disk positions may be determined more directly from the binary (base 2) representation of the move number (the initial state being move #0, with all digits 0, and the final state being #2n−1, with all digits 1), using the following rules:
- There is one binary digit (bit) for each disk
- The most significant (leftmost) bit represents the largest disk. A value of 0 indicates that the largest disk is on the initial peg, while a 1 indicates that it's on the final peg.
- The bitstring is read from left to right, and each bit can be used to determine the location of the corresponding disk.
- A bit with the same value as the previous one means that the corresponding disk is stacked on top the previous disk on the same peg.
- (That is to say: a straight sequence of 1's or 0's means that the corresponding disks are all on the same peg).
- A bit with a different value to the previous one means that the corresponding disk is one position to the left or right of the previous one. Whether it is left or right is determined by this rule:
- Assume that the initial peg is on the left and the final peg is on the right.
- Also assume "wrapping" - so the right peg counts as one peg "left" of the left peg, and vice versa.
- Let n be the number of greater disks that are located on the same peg as their first greater disk and add 1 if the largest disk is on the left peg. If n is even, the disk is located one peg to the left, if n is odd, the disk located one peg to the right.
For example, in an 8-disk Hanoi:
- Move #0)
- The largest disk is 0, so it is on the left (initial) peg.
- All other disks are 0 as well, so they are stacked on top of it. Hence all disks are on the initial peg.
- Move #2^8-1)
- The largest disk is 1, so it is on the right (final) peg.
- All other disks are 1 as well, so they are stacked on top of it. Hence all disks are on the final peg and the puzzle is complete.
- Move #0b11011000)
- The largest disk is 1, so it is on the right (final) peg.
- Disk two is also 1, so it is stacked on top of it, on the right peg.
- Disk three is 0, so it is on another peg. Since n is odd, it is one peg to the right, i.e. on the middle peg.
- Disk four is 1, so it is on another peg. Since n is still odd, it is one peg to the right, i.e. on the right peg.
- Disk five is also 1, so it is stacked on top of it, on the right peg.
- Disk six is 0, so it is on another peg. Since n is even, the disk is one peg to the left, i.e. on the middle peg.
- Disks seven and eight are also 0, so they are stacked on top of it, on the middle peg.
The above algorithm can be coded in Scheme as follows:
(define (conf m h f t) ; m=move number, h=height of tower, f=starting peg, t=destination peg ; Identify the pegs by the numbers 0, 1 and 2. (let loop ((prev-zero? #t) (mask (arithmetic-shift 1 (sub1 h))) (rotation (- t f)) (f f)) (if (zero? mask) () (let ((zero-bit? (zero? (bitwise-and mask m))) (mask (arithmetic-shift mask -1))) (if (eq? prev-zero? zero-bit?) (cons f (loop zero-bit? mask (- rotation) f)) (let ((f (modulo (+ f rotation) 3))) (cons f (loop zero-bit? mask rotation f)))))))) ; This procedure produces a list of the positions of the disks in order of decreasing size. ; Example: (conf #e6022e20 80 0 2) ; in less than a milisecond on a plain 1.8 GHz personal computer: ;--> (01111111100001201201221111201112012000) ; #e6022e20 = 602, which is about the number of [[Avagadro]].
The source and destination pegs for the mth move can also be found elegantly from the binary representation of m using bitwise operations. To use the syntax of the C programming language, the mth move is from peg
(m&m-1)%3 to peg
((m|m-1)+1)%3, where the disks begin on peg 0 and finish on peg 1 or 2 according as whether the number of disks is even or odd. Furthermore the disk to be moved is determined by the number of times the move count (m) can be divided by 2 (i.e. the number of zero bits at the right), counting the first move as 1 and identifying the disks by the numbers 0, 1, 2 etc in order of increasing size. This permits a very fast non-recursive computer implementation to find the positions of the disks after m moves without reference to any previous move or distribution of disks:
; h : total number of disks ; m : move counter, starting with 1 for the first move. ; f : starting peg; the pegs are identified by the numbers 0, 1 and 2. ; t : destination peg ; d : disk (numbered 0, 1, 2, etc in order of increasing size) ; Function =quotient= takes two integer numbers and computes their quotient rounded to integer towards zero. ; (rot3 m) : sense of rotation of the remaining third peg during move m. ; (rotd d) : sense of rotation of disk d. ; mcnt : number of moves disk d has made after a total of m moves. ; from : the peg a disk is taken from during move m. ; onto : the peg a disk is put onto during move m. ; thrd : the remaining third peg. (- 3 from onto) ; disk : disk being moved. ; conf : position of disk d after a total of m moves. (define (exp2 n ) (expt 2 n)) (define (mod2 n ) (modulo n 2)) (define (mod3 n ) (modulo n 3)) (define (pari n ) (add1 (mod2 (add1 n)))) (define (rotd h d f t) (mod3 (* (- t f) (pari (- h d))))) (define (rot3 h f t) (rotd h 0 f t)) (define (mcnt m d ) (quotient (+ m (exp2 d)) (exp2 (add1 d)))) (define (thrd m h f t) (mod3 (- f (* m (rot3 h f t))))) (define (onto m h f t) (mod3 (- (thrd m h f t) (rotd h (disk m) f t)))) (define (from m h f t) (mod3 (+ (thrd m h f t) (rotd h (disk m) f t)))) (define (conf m h d f t) (mod3 (+ f (* (rotd h d f t) (mcnt m d))))) (define (disk m ) (sub1 (bit-count (bitwise-xor m (sub1 m)))))
Gray code solutionEdit
The binary numeral system of Gray codes gives an alternative way of solving the puzzle. In the Gray system, numbers are expressed in a binary combination of 0s and 1s, but rather than being a standard positional numeral system, Gray code operates on the premise that each value differs from its predecessor by only one (and exactly one) bit changed. The number of bits present in Gray code is important, and leading zeros are not optional, unlike in positional systems.
If one counts in Gray code of a bit size equal to the number of disks in a particular Tower of Hanoi, begins at zero, and counts up, then the bit changed each move corresponds to the disk to move, where the least-significant-bit is the smallest disk and the most-significant-bit is the largest.
- Counting moves from 1 and identifying the disks by numbers starting from 0 in order of increasing size, the ordinal of the disk to be moved during move m is the number of times m can be divided by 2.
This technique identifies which disk to move, but not where to move it to. For the smallest disk there are always two possibilities. For the other disks there is always one possibility, except when all disks are on the same peg, but in that case either it is the smallest disk that must be moved or the objective has already been achieved. Luckily, there is a rule which does say where to move the smallest disk to. Let f be the starting peg, t the destination peg and r the remaining third peg. If the number of disks is odd, the smallest disk cycles along the pegs in the order f->t->r->f->t->r, etc. If the number of disks is even, this must be reversed: f->r->t->f->r->t etc. [1]
Long solutionsEdit
A modification of the game can be to move the tower from one peg to another peg using as many moves as possible without ever producing the same distribution of disks more than once. A simple algorithm (written in Scheme) is:
(define (long-move-tower h f t r) (if (positive? h) (let ((h (sub1 h))) (long-move-tower h f t r) (move-disk h f r t) (long-move-tower h t f r) (move-disk h r t f) (long-move-tower h f t r))))
Where procedure (move-disk d f t r) moves disk d from peg f onto peg t, ignoring peg r. The number of moves of this uniquely defined solution is 3height-1 and all 3height different distributions of disks are traversed (when including the starting and final distribution). This is called a Hamilton path. For this solution the disk to be moved can be found with a ternary gray code in a similar way as explained for the shortest solution. In fact there is a ternary Gray code starting with all digits 0 and ending with all digits equal 2, that lists the successive distributions of disks of a Hamilton path from peg 0 to peg 2 for a tower of h disks, each code showing the positions of the disks in decreasing order of size when read from left to right. This Gray code is uniquely defined by imposing the extra condition that each digit is switched more often than each more significant digit on the left. This is the code needed for the Tower of Hanoi.
(define (number->p-ary-gray-code n h p) ; n h p --> n-th h digit p-ary gray-code (let ((2p (* 2 p))) (let loop ((n n) (h h) (gc ())) (if (zero? h) gc (let ((q (quotient n p)) (r (modulo n 2p))) (loop q (sub1 h) (cons (if (>= r p) (- 2p r 1) r) gc))))))) (define (p-ary-gray-code->number gc p) ; n-th p-ary gray-code --> n (let loop ((gc gc) (significance (expt p (sub1 (length gc))))) (if (null? gc) 0 (let ((digit (car gc)) (gc (cdr gc))) (let ((n (loop gc (quotient significance p)))) (+ (* digit significance) (if (odd? digit) (- significance n 1) n))))))) (define (number->hanoian-gray-code n h) (number->p-ary-gray-code n h 3)) (define (hanoian-gray-code->number gc) (p-ary-gray-code->number gc 3))
The disk to be moved is determined by the number of times the move counter can be divided by 3. Where the disk is to be moved to can easily be determined too. For every triplet of moves, move the smallest disk twice in succession in the same direction, followed by a move of one of the larger disks (only one direction possible) Between every triplet of moves reverse the direction of the smallest disk. The very first move of the smallest disk is to be made from the starting peg onto the remaining third peg. Also observe that the unused peg of each move alternates between the starting and destination peg. These statements are easily proven by mathematical induction.
(define (exp3 n ) (expt 3 n)) (define (mod3 n ) (modulo n 3)) (define (mod4 n ) (modulo n 4)) (define (mcnt m d ) (+ (* 2 (quotient m (exp3 (add1 d)))) (mod3 (quotient m (exp3 d))))) (define (thrd m h f t) (if (odd? m) t f)) (define (onto m h f t) (posi m h (disk m) f t)) (define (from m h f t) (- 3 (onto m h f t) (thrd m h f t))) (define (posi m h d f t) (vector-ref (vector f (- 3 f t) t (- 3 f t)) (mod4 (mcnt m d)))) (define (disk m) (if (zero? (mod3 m)) (add1 (disk (quotient m 3))) 0))
Another modification is to move a tower from a peg back to the same peg while traversing all distributions of disks. (circular Hamilton path) There are exactly two solutions, but they mirror each other in the sense that there is in fact one path that can be traversed in both directions. Obviously, the length of the path is 3height. A simple algorithm for the circular Hamilton path is:
(define (circular-hamilton-move-tower h a b c) ; h=height. a, b and c are the three pegs. (if (positive? h) ; start with a tower at peg a, move tower to peg b, then to peg c and finally return to peg a. (let ((h-1 (sub1 h))) (hamilton-start h-1 a c b) ; The largest disk is moved three times. (move-disk h-1 a b c) ; Between these moves the longest non selfcrossing path is used in order to move the (long-move-tower h-1 c a b) ; partial tower consisting of the h-1 smaller disks from one peg onto another one. (move-disk h-1 b c a) ; Together the procedures hamilton-start and hamilton-finish make such a longest (long-move-tower h-1 a b c) ; non selfcrossing path too. The moves made by hamiton-finish followed by (move-disk h-1 c a b) ; those of hamilton-start form a longest non selfcrossing path for the same (hamilton-finish h-1 b a c)))); partial tower from peg b to peg c. (define (hamilton-start h a b c) (if (positive? h) (let ((h-1 (sub1 h))) (hamilton-start h-1 a c b) (move-disk h-1 a b c) (long-move-tower h-1 c b a)))) (define (hamilton-finish h a b c) (if (positive? h) (let ((h-1 (sub1 h))) (long-move-tower h-1 a c b) (move-disk h-1 a b c) (hamilton-finish h-1 c b a))))
Graphical representationEdit
The game can be represented by an undirected graph, the nodes representing distributions of disks and the branches representing moves. For one disk, the graph is a triangle:
/\ /__\
For h+1 disks, take the graph of h disks and replace each small triangle by:
/\ /__\ / \ / \ /\ /\ /__\ __ /__\
The above graph is for 2 disks. The angular points of the outermost triangle represent distributions with all disks on the same peg. For 3 disks the graph is:
ccc /\ ; call the pegs a, b and c acc /__\ bcc ; list disk positions from left to right in order of increasing size / \ abc / \ bac /\ /\ bbc /__\ __ /__\ aac / cbc cac \ bba / \ aab /\ /\ cba /__\aba bab/__\ cab / \ / \ caa / \aca bcb/ \ cbb /\ /\ /\ /\ aaa /__\ __ /__\ __ /__\ __ /__\ bbb baa bca cca ccb acb abb
Each side of the outermost triangle represent the shortest ways of moving a tower from one peg to another one. The branch in the middle of the sides of the largest triangle represents a move of the largest disk. The branch in the middle of the sides of each next smaller triangle represents a move of each next smaller disk. The sides of the smallest triangles represent moves of the smallest disk.
The longest non repetive way for three disks can be visualized by erasing the unused branches:
ccc /\ ; call the pegs a, b and c acc / \ bcc ; list disk positions from left to right in order of increasing size / \ abc / \ bac \ / bbc __\ /__ aac / cbc cac \ bba / \ aab / \ cba /__ aba bab __\ cab \ / caa \aca bcb/ cbb /\ \ / /\ aaa / \ __ __\ /__ __ / \ bbb baa bca cca ccb acb abb
The circular hamilton path for three disks is:
ccc /\ ; call the pegs a, b and c acc / \ bcc ; list disk positions from left to right in order of increasing size / \ abc / \ bac \ / bbc __\ /__ aac / cbc cac \ bba / \ aab \ / cba __\aba bab/__ cab / \ caa / aca bcb \ cbb / /\ /\ \ aaa /__ __ / \ __ / \ __ __\ bbb baa bca cca ccb acb abb
The graphs clearly show that:
- From every arbitrary distribution of disks, there is exactly one shortest way to move all disks onto one of the three pegs.
- Between every pair of arbitrary distributions of disks there are one or two different shortest paths.
- From every arbitrary distribution of disks, there are one or two different longest non selfcrossing paths to move all disks to one of the three pegs.
- Between every pair of arbitrary distributions of disks there are one or two different longest non selfcrossing paths.
- Let Nh be the number of non selfcrossing paths for moving a tower of h disks from one peg to another one. Then:
- Nh+1=(Nh)2+(Nh)3.
- For example: N8≈1.5456x10795
Applications Edit
The Tower of Hanoi is frequently used in psychological research on problem solving. There also exists a variant of this task called Tower of London for neuropsychological diagnosis and treatment of executive functions.
The Tower of Hanoi is also used as Backup rotation scheme when performing computer data Backups where multiple tapes/media are involved.
As mentioned above, the Tower of Hanoi is popular for teaching recursive algorithms to beginning programming students. A pictorial version of this puzzle is programmed into the emacs editor, accessed by typing M-x hanoi. There is also a sample algorithm written in Prolog.
The Tower of Hanoi is also used as a memory test by neuropsychologists trying to evaluate amnesia.
Four pegs and beyond Edit
Although the three-peg version has a simple recursive solution as outlined above, the optimal solution for the Tower of Hanoi problem with four or more pegs is still an open problem. This is a good example of how a simple, solvable problem can be made dramatically more difficult by slightly loosening one of the problem constraints.
The fact that the problem with four or more pegs is an open problem does not imply that no algorithm exists for finding (all of) the optimal solutions. Simply represent the game by an undirected graph, the nodes being distributions of disks and the edges being moves (of length 1) and use Dijkstra's algorithm to find one (or all) shortest paths moving a tower from one peg onto another one. However, even smartly implemented on the fastest computer now available, this algorithm provides no way of effectively computing solutions for large numbers of disks; the program would require more time and memory than available. Hence, even having an algorithm, it remains unknown how many moves an optimal solution requires and how many optimal solutions exist for 1000 disks and 10 pegs.
Though it is not known exactly how many moves must be made, there are some asymptotic results. There is also a "presumed-optimal solution" that can be recursively applied to find a solution - see Paul Stockmeyer's survey paper for an explanation and some variants of the four-peg problem.
Although it agrees with computer experiments for small numbers of disks, there is not yet a general proof that this presumed-optimal solution is in fact optimal. However, results in 2004 showed that the presumed-optimal solution must be of the same order of magnitude as the optimal solution.
Description of the presumed-optimal solution Edit
The problem for four pegs is sometimes called "Reve's puzzle". A solution for four (or more) pegs, which has not been proved to be optimal, is described below:
- Let be the number of disks.
- Let be the number of pegs.
- Define to be the number of moves required to transfer n disks using r pegs
The algorithm can be described recursively:
- For some , , transfer the top disks to a single other peg, taking moves.
- Without disturbing the peg that now contains the top disks, transfer the remaining disks to the destination peg, using only the remaining pegs, taking moves.
- Finally, transfer the top disks to the destination peg, taking moves.
The entire process takes moves. Therefore, the count should be picked for which this quantity is minimum.
This algorithm (with the above choice for ) is presumed to be optimal, and no counterexamples are known.
Two stacks and more stacksEdit
A recent U.S. patent application discloses multistack Tower of Hanoi puzzles [Feb. 1, 2007, Serial No.11/701,454] with two or more stacks and twice as many pegs as stacks. After beginning on a particular peg, each stack displaces and is displaced by a different colored stack on another peg when the puzzle is solved. Disks of one color also have another peg that excludes all other colors, so that there are three pegs available for each color disk, two that are shared with other colors and one that is not shared. On the shared pegs, a disk may not be placed on a different colored disk of the same size, a possibility that does not arise in the standard puzzle.
The simplest multistack game (2 x 4) has two stacks and four pegs, and it requires 3[T(n)] moves to solve where T(n) is the number of moves needed to solve a single stack classic of n disks. The game proceeds in seesaw fashion with longer and longer series of moves that alternate between colors. It concludes in reverse seesaw fashion with shorter and shorter such series of moves. Starting with the second series of three moves, these alternate series of moves double in length for the first half of the game, and the lengths are halved as the game concludes. The solution involves nesting an algorithm suitable for Tower of Hanoi into an algorithm that indicates when to switch between colors. When there are k stacks of n disks apiece in a game, and k > 2, it requires k[T(n)] + T(n-1) moves to relocate them.
The addition of a centrally located universal peg open to disks from all stacks converts these multistack Tower of Hanoi puzzles to multistack Reve's puzzles as described in the preceding section. In these games each stack may move among four pegs, the same combination of three in the 2 x 4 game plus the central universal peg. The simplest game of this kind (2 x 5) has two stacks and five pegs. A solution conjectured to be optimal interlocks the optimal solution of the 2 x 4 puzzle with the presumed optimal solution to Reve's puzzle. It takes R(n) + 2R(n-1) + 2 moves, where R(n) is the number of moves in the presumed optimal Reve's solution for a stack of n disks.
In popular culture Edit
In the classic science fiction story Now Inhale, by Eric Frank Russell (Astounding Science Fiction April 1959, and in various anthologies), the human hero is a prisoner on a planet where the local custom is to make the prisoner play a game until it is won or lost, and then execution is immediate. The hero is told the game can be one of his own species', as long as it can be played in his cell with simple equipment strictly according to rules which are written down before and cannot change after play starts, and it has a finite endpoint. The game and execution are televised planet-wide, and watching the desperate prisoner try to spin the game out as long as possible is very popular entertainment; the record is sixteen days. The hero knows a rescue ship might take a year or more to arrive, so chooses to play Towers of Hanoi with 64 disks until rescue arrives. When the locals realize they've been had, they are angry, but under their own rules there is nothing they can do about it. They do change the rules, which will apply to any future prisoners. This story makes reference to the legend about the Buddhist monks playing the game until the end of the world, and refers to the game as arkymalarky. (The slang term "malarky", meaning nonsense, pre-dates this story by at least 30 years. [2])
In the movie Stranger than Fiction, a miniature Towers of Hanoi puzzle can be seen on the cluttered desk of Professor Jules Hilbert.
In the Doctor Who serial "The Celestial Toymaker", the Toymaker challenges the Doctor to complete the "Trilogic Game" (ten disk Hanoi) in exactly 1,023 (210 − 1) moves.
There is a band named Towers of Hanoi.
In video games Edit
The puzzle is featured regularly in adventure and puzzle games. Since it is easy to implement, and easily-recognised, it is well-suited to use as a puzzle in a larger graphical game. Some implementations use straight disks, but others disguise the puzzle in some other form. What follows is a partial list of games which use the puzzle:
- Black & White
- The Island of Dr. Brain
- The Secret Island of Dr. Quandary
- Star Wars: Knights of the Old Republic
- Zork Zero
- The Legend of Kyrandia: Hand of Fate
- Escape from Paradise
- ECHO: Secrets of the Lost Cavern
- Clan Lord
- Mass Effect
- ↑ 1000 Play Thinks.
See alsoEdit
External links Edit
Online demonstrationsEdit
- Tower of Hanoi Interactivity Raptivity Customizable Interaction Model(CIM) for the Tower of Hanoi.
- Tower Of Hanoi Game developed using Javascript
- A JavaScript implementation featuring Shuffle disks and Help buttons
- An online Java demonstration of this famous puzzle: allows trying to solve for up to 20 disks, or lets the computer solve.
- An online flash demonstration of this famous puzzle: allows trying to solve for n disks (with n being a maximum of ten disks).
- Multipeg Tower of Hanoi Graphs.
- Simple 4 disk demonstration of Towers of Hanoi.
- Tower of Hanoi implement in Java.
- A Multi-Peg Tower of Hanoi Applet.
- Tower Of Hanoi Animation.
- Tower of Hanoi Flash Game: a Flash implementation of the Tower of Hanoi game.
- Oshiro: A flash game with Tower of Hanoi concept incorporated with colors, different board, and different end goals.
- Towers of Hanoi by Jay Warendorff based on a program by Jaime Rangel-Mondragón, The Wolfram Demonstrations Project.
- Theory, recursive and a per step algorithms with Java implementation at cut-the-knot
- Towers Of Hanoi in c++ using Stacks at 24bytes
- Bicolor Tower of Hanoi at cut-the-knot
- Hanoimania, implementations of the Tower of Hanoi problem in over 100 different programming environments and languages
- Towers of Hanoi Online game
- Play Towers of Hanoi Online
- Binary Numbers and the Standard Gray Code, with a diskussion of the Gray Code solution
- Some implementations including a mysterious binary solution
- Tower of Hanoi game for Palm OS
- A variety of Tower of Hanoi Algorithms in PLT MzScheme
- Solution in an all web-based interactive classical BASIC environment
- Two non-recursive solutions in C++
|This page uses Creative Commons Licensed content from Wikipedia (view authors).


text:
Boston — EnerNOC, a leading provider of data-driven energy efficiency applications, announced that Sears Holdings has selected EnerNOC's EfficiencySMART Commissioning, which blends traditional commissioning services with real-time, persistent commissioning technology, to drive energy savings at its 2.4 million-sq.-ft. corporate headquarters in Hoffman Estates, Ill., a 2010 Energy Star rated facility.
For Sears, EfficiencySMART is expected to deliver annual savings of approximately 8% of the facility's addressable energy spend, primarily through operational measures.
The EfficiencySMART suite of applications and services is designed to deliver energy savings to customers through the lifecycle of energy efficiency management and complement EnerNOC's other suites of energy management applications and services.


text:
OUTGOING Minehead Mayor Val Welch was present to help two women carry out their coastal walk from Minehead.
Felicity Bissett, from Aldeburgh, in Suffolk, and her daughter, Kasia Watson, from Berkhampsted, in Hertfordshire, are doing the walk in memory of Felicity's great aunt, Isobel Wilson.
Isobel did the walk in 1871 and recorded the holiday in a journal which Felicity and Kasia are using to track their route.
They are photographed wearing the type of outfit similar to Isobel's and are fund-raising for the Alzheimer's Society.


text:
The 85th Annual Academy Awards
Here are the rest of the Oscars because after spending all night on Twitter I can't talk about them anymore without living in fear of another Seth MacFarlane musical number. Holy shit, a man who can sing! What unexpected wonders you possess, Hollywood! In the meantime, if you're looking for Anne Hathaway's nipple dress and/or Jennifer Lawrence's breasts, they got their own posts because I didn't see either of the movies they won for which I'm sure wasn't what they were after anyway. "Well, the script's good, but if I'm nominated for an award can I make my nips look like giant triangle knives? That's mostly what I'm interested in."
Photos: Getty


text:
LUNA – Scheduled Maintenance
All scheduled downtime for LUNA will be posted on this page. If you're having technical difficulty not listed here, please contact the VRC for assistance.
- Scheduled updates occur between 8am and 9am on Thursdays. You may experience limited collection access during this time.
- The first time you log in to LUNA, you may get an error message. Click your back button and try again—you should be able to login without error.


text:
SAINT LEO, Fla. – The Saint Leo softball team (3-1) split its regional doubleheader with Palm Beach Atlantic (4-2), Sunday afternoon from University Softball Stadium. The Lions fell in 12 innings in game one, 5-4, before exploding for eight runs in the nightcap victory.
The Lions saw a two-out, three-run rally in the seventh inning spoil a solid team performance in game one, as Saint Leo fell in its longest contest since 2005. However, a five-run first inning guided the Green and Gold to an 8-4, game two victory.
In total, eight different Lions posted hits, including a trio of Lions who registered four apiece. Danielle Moreda, Rachelle Gremo, and Ashlee Sismilich each went 4-for-9, while Brittany Yates recorded three hits, in addition to Alex Garris' two-hit performance. Torrie Weindorf, Victoria Cooper, and Dianne Gonzalez rounded out the Lions' 21-hit day.
Saint Leo struck first in the opening contest as they scored two runs on a Garris infield single, coupled with a run-scoring passed ball. Seeing their lead cut in half in the fifth, Gremo assisted the Lions' response as she belted a two-out double off the fence to score Sismilich. Yates' in-side the park home run, her first ever inside-the-park home run and 31st of her career, made the score 4-1 going into the final frame. Unfortunately, PBA, with the bases empty, used a two-out, three run rally to tie the game at four. The two teams exchanged runners, but could not cross the plate until the Sailfish saw an RBI single by Stokes put the the visitor's up for good.
Kristen Kelly was the tough luck loser as she fell to 1-1 on the season. Colena Lazar received the no decision.
Game two featured a much more aggressive Lions' bunch as they batted-around in a five-run, first inning. Gremo's leadoff triple, coupled with a Moreda RBI double highlighted the inning for Saint Leo. The Sailfish chipped away at the Saint Leo lead, eventually cutting reducing the advantage to 5-4 in the fifth inning. The Lions learned from previous mistakes, however, as they stopped the Sailfish momentum and scored three runs of their own in the bottom of the sixth inning, highlighted by a Yates' RBI double.
Megan Still collected her first win of the season, while Ashley Ehlers was hung zeros on the board in registering her first save.
Despite the 21 hits, the Lions left 13 runners on base, while PBA stranded 25.
The Lions will return to action on Friday, February 10, when they travel to Clearwater, Fla. to compete in the Eckerd College Spring Invitational. Contests with Colorado Christian, 5:30 p.m., and regional opponent West Florida, 7:30 p.m., are the first of six games to take place at the Eddie C. Moore Complex.
For the latest news, information, and updates on the softball team, visit SaintLeoLions.com.


text:
Did you know?
uShaka Sea World's tanks hold a combined 17 500 cubic metres of water.
One of the biggest aquariums in the world, uShaka Sea World not only has all the traditional elements of an aquarium – including a seal pool and penguin rookery – but it also boasts a number of interactive activities that will thrill marine enthusiasts and children looking to get a little closer to their favourite fish.
The Snorkel Lagoon, for example, allows visitors to swim amongst a huge variety of marine life (nothing too big or dangerous though) while the Touch Pool gives folk an opportunity to touch a starfish or feel the skin of a sea cucumber.
This Durban aquarium features both indoor and outdoor seawater exhibits, many of them specially themed. There's the Open Ocean, where fish such as tuna, dorado and various rays can be seen, while Reefs Predators focuses on shark species and the Turtle Lagoon features these graceful reptiles.
Don't miss out on the ever-so-cute penguins in their own special rookery and eye-level undersea habitat or the Eco House, where water and power-saving ideas are on display. Make a Penguin Promise before you leave!
Dangerous Creatures forms part of Sea World and houses a remarkable variety of snakes, amphibians and reptiles.
The Deep Zone is fascinating, collecting together as it does some of the weirdest and most spectacular animals of the dark depths – animals usually well hidden from human eyes below hundreds of metres of water.
The vivid and vibrant colours of the coral gardens, where the richest and most diverse ecosystem on Earth has been recreated, will enthral children.
And no visit to uShaka Sea World would be complete without a show at the 1 200-seater dolphin stadium, boasting water-level windows that provide views of the mammals both above and below the water.
Travel tips & Planning info
Who to contact
uShaka Marine World
Tel: +27 (0)31 328 8000
Email: email@example.com
How to get here
uShaka Sea World is part of the uShaka Marine World complex on the beachfront, next to the harbour. It's on all major bus and taxi routes.
Best time to visit
uShaka Sea World is open from 9am to 6pm every day of the week throughout the year. It is also open after dark on Sundays.
Around the area
There's a theme park on site, featuring some groovy rides. uShaka Village Walk is a great place to shop and there's also uShaka Beach for those needing sand with their sun.
What will it cost
R139 for adults, R105 for senior citizens, and R105 for children.
Length of stay
A full day if you plan to visit all of uShaka Marine World, half a day just for the aquarium.
What to pack
A swimming costume, hat, sunscreen and towel if you plan to enjoy the rides at the uShaka Marine World theme park.
What to eat
uShaka Marine World has a variety of refreshment options available on-site, from sit-down restaurants to takeaway stalls.


text:
Hats off to moms
Fundraiser aims to raise awareness about perinatal mood disorders
Wednesday, Jan 15, 2014 06:00 am
As joyous as the experience of becoming a new mother can be, it can also be incredibly overwhelming.
The Edmonton chapter of Perinatal Mood Disorder Awareness Ltd. is holding its first fundraising event in St. Albert on January 18 to recognize the stresses that new parents face � including postpartum depression � and help them find ways to get through it.
Event organizer and mother of three, Melissa Baker, knows first hand how difficult it can be to deal with a growing family and how hard it is to ask for help.
�There are a lot of expectations on moms to have a baby and then have it figured out,� she said.
Baker found herself suffering from isolation and anxiety after the births of her youngest two children, 16 months apart. Combined with a move from Cranbook, B.C. to St. Albert and having a lack of family and social supports, Baker felt she had no where to turn.
�I found it very hard to attach to my children, I wanted to detach somehow. I also had a lot of anxiety about leaving my kids with anybody,� she explained. �When it�s just too much to deal with � you can�t deal with anything.�
Dealing came in the form of a glass of wine at the end of the night, noted Baker, but soon it got out of control.
�I really wasn�t able to function. I found it very hard to spend any amount of time with my children unless I was looking forward to drinking at the end of the night. I needed something to look forward to because I just couldn�t attach to them.�
�I was numb to any of my emotions.�
Baker eventually sought medical attention and counselling for her postpartum addiction and trained as a birth and postpartum doula so she could help other women after the birth of their babies. But asking for help wasn�t easy.
�I didn�t want to reach out because I didn�t want to be judged,� she said.
She explained that what people know about perinatal mood disorders, which includes postpartum depression, obsessive-compulsive disorder, anxiety, postpartum psychosis and post-traumatic stress disorder, is usually negative.
�When moms have taken their kids lives that is very much the most extreme form of it. There can be many variations from having simple anxiety to OCD. It�s all very common but a lot of women don�t understand it and there isn�t a lot of information about it.�
�We get a lot of support when we�re pregnant but not so much afterwards.�
The upcoming event will feature expert speakers � women�s wellness advocates Dr. Jane Carr and psychologist Rita Balanko � to help break down the stigmas associated with perinatal mood disorders and help new parents navigate postpartum resources.
The fundraiser comes on the heels of a new postpartum education and support group funded by Perinatal Mood Disorder Awareness Ltd. that began at the St. Albert Family Resource Centre on Jan. 6.
The free support group, which runs on Mondays from 1 to 3 p.m., aims to help individuals and families affected by all types of perinatal mood disorders, whether they are suffering from symptoms, seeking preventative help or interested in learning more.
Baker hopes the fundraising event hosted in partnership with Modern Mama St. Albert, will start a conversation as well as bring people out to the support group.
The event, which will also include a zumba class, silent auction and door prizes, will take place on Saturday, Jan. 18 from 1 to 4 p.m. in the gymnasium of the Salvation Army Church at 165 Liberton Drive.
Advance tickets are $15, available online at www.modernmamastalbert.com or $20 at the door. 100 per cent of the proceeds will go to Perinatal Mood Disorder Awareness Ltd. initiatives.


text:
HOUSTON - School will be back in session soon and whether you have a child in school or not, there are some driving tips you need to keep in mind.
- Slow down in school zones and follow the posted school zone speed limit. It's not only the law, but it's to protect our children.
- In the city of Houston, speeding in a school zone will run you at least $220 in fines.
- What about the temptation to text and drive? According to police, you will be ticketed in a school zone for texting and driving where signs are posted.
- If you must make a call, do so while stopped or use a hands-free device.
- If lights are flashing on a school bus during loading or unloading, drivers must stop.
- If there's a divided roadway, such as a median between you and the bus, it is legal to pass.
Alan Delaney, a manager of training and support for HISD, used to drive buses for the district. According to Delaney, parents should stress to their children the importance of listening to directions coming from the bus driver to stay safe.
"Always look, always listen. Always pay attention to what the driver says," Delaney said.
Remember, children are excited about going back to school and may dart out into the streets without thinking about the consequences. So it's a drivers responsibility to obey laws and use common sense.
"You don't want to make up time in a school zone. You need to slow down. Speeding is obviously a big issue in school zones," said Capt. Larry Baimbridge with the Houston Police Department. "If the lights are flashing, don't pass. If there's a divided roadway, a median between you, it is legal to pass."
Copyright 2012 by Click2Houston.com. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.