Only several days ago, the acrimony between Minnesota Vikings Coach Dennis Green and the team's new owner, Red McCombs, seemed thicker than cement. McCombs had rejected two contract proposals from Green's agent, Ray Anderson, with the latest rejection coming just last week. It increasingly looked as if Green was going to leave the Vikings at the end of the season.
Then Anderson received a shocking call from representatives of McCombs on Wednesday -- they wanted to make a deal. For the next 48 hours the two sides hammered out an agreement and now Green has what he wanted and what many around the National Football League say he deserved: a long-term contract and security.
Early yesterday, Green signed a multiyear extension that makes him one of the richest coaches in the National Football League. While exact figures were unavailable, it is believed Green will earn at least $1.5 million a year. Despite one of the best track records of any active coach, Green had been severely underpaid. He is 57-45 as Vikings coach, has made the playoffs five of the past six years, won two division titles, and last year led the Vikings over the Giants in one of the biggest playoff comebacks in history, yet his $900,000 salary made him among the 10 lowest-paid coaches.
Green is the only coach in the National Football Conference Central with a winning record against the Green Bay Packers in the 1990's, still, he was the lowest paid coach in the division. Green's huge salary bump is yet another indication that coaches are becoming more powerful. Kansas City Coach Marty Schottenheimer, who made less than $400,000 as coach of the Cleveland Browns in 1988, now makes more than $2 million a year.
Coaches have become more powerful because they are required to do more as free agency has led to players moving from team to team in conveyor-belt like fashion. For a team to have cohesion, a good coach must make that talent gel. Most teams recognize this. Denver Broncos Coach Mike Shanahan recently signed the richest head coaching contract in N.F.L. history; a deal that will pay him more than $2.4 million a season. According to coaching salary information obtained from various sources, Shanahan is among a growing number of coaches who will make at least $2 million a year.
Others include Bill Parcells of the Jets ($2.4 million a season), Mike Ditka of New Orleans ($2 million), and Jimmy Johnson of Miami ($2 million).
In addition to receiving bonuses for getting to a playoff or Super Bowl, coaches have lucrative deals for local television and radio shows. Wannstedt and Bill Cowher of Pittsburgh each receive $250,000 a year for media rights and expenses; Johnson $300,000.
When Rod Woodson of the Baltimore Ravens violated the league's substance abuse policy by refusing to take a second drug test, it set off an intense debate between officials with the N.F.L. and the players association.
Last month Woodson passed a routine drug test for illegal substances such as cocaine and marijuana. Then, as part of the league's program of random testing for performance enhancing drugs like steroids or androstenedione, Woodson was again requested to give a sample of his urine. According to several team executives, Woodson was upset that he had already given a sample only one day earlier. Even though Woodson eventually did give the second sample, his initial refusal counts as a positive test.
Thus, Woodson, who team executives said has never tested positive for any illegal or banned substances, is in Stage 1 of the league's substance abuse policy. It calls for an evaluation by a psychiatrist, as well as an increase in random drug testing.
The league and union are in negotiations about what to do. The union believes that since Woodson, a future Hall of Famer who is a member of the league's 75th anniversary team, eventually took the second test, he should be given a break. The league thinks that if it bends the rules for Woodson, it would set a bad precedent for other players.
Giants General Manager Ernie Accorsi has quietly made two key moves in recent months that show why he has been such a highly regarded executive.
First, he drafted U.C.L.A. defensive back Shaun Williams. At the time, the pick was questioned because the Giants already had a number of players at the position, but Accorsi now looks like a genius because cornerback Jason Sehorn is lost for the season and Williams gives them depth at Sehorn's position.
Second, Accorsi is following the practice of his predecessor, George Young, by continuing to lock up young players to long term contracts. Last week both quarterback Danny Kanell and young tackle Scott Gragg agreed to long-term contract extensions.


text:
Thread: {Bashar and solipsism**
the_ohmbudsman
Likes: 298 (226 Posts)
Originally Posted by doctorc
I have listened to both Bashar and also Passio and find value in both, but the core of what they are saying seems to be incompatible. Who is right then?
Bashar says follow your highest excitement and all else falls into place. It is very solipsistic, but seems to work when applied. If we all do what brings us the greatest joy, then perhaps in that alignment we meet those whom we are supposed to meet and live the lives we are meant to live. So maybe not being in alignment with this, which could also be called fear, is where the worlds ills come from from, from people who are not following the path they are supposed to be on.
I also really like Mark Passio's work, his view is a more altruistic take and he says there are core truths or natural laws operating in our experience, the basic duality of love=freedom and fear=control. He feels we should be trying our best on an individual level to change the world and disseminate truth to wake people up. He says that much of the new age, which he would classify Bashar as, is a trick to get people to ignore the darkness and do nothing about it, as others have said. It makes sense logically, but in actual practice I am not so sure he is right.
My experience seems to indicate that by fighting against the perceived evil or injustice in the world, resisting it in other words, you actually give it attention and empower it and draw more of it into the world. Life is basically the result of our attention, both individually and collective. The way to solve a 'problem', in ones own life at least, is simply to stop giving it attention, and put your attention on the opposite. This goes to scale collectively as well. While I really agree with alot of what Passio says, in actually applying the two systems, I would have to side with the former as bringing the best results.
This book on the shadow has a lot of insight into how we project the shadow onto others by scapegoating.
http://www.goodreads.com/book/show/9...pegoat_Complex
"The Hebraic image of the scapegoat is connected with the ritual of atonement. This extremely ancient ritual involved two goats. Every year, on the Day of Atonement, one goat was dedicated to Yahweh and was killed as a sin-offering, so that its blood might cleanse and make sacred the sanctuary, tabernacle and altar. In Leviticus 16:16 we are told that the blood of this goat placated the angry god and atoned for the "uncleanness" of the people, "for their transgressions and for all their sins". The goats' remains were treated as unclean and were burned outside the boundaries of the community. The other goat was expelled from the community and was dedicated to Azazel, a chthonic god who was later considered to be a fallen angel. Over this goat's head, the high priest confessed all the transgressions of the people, laying them to the goat's charge. The living goat was then taken away and sent out into the wilderness. Leviticus 16:22 tells us, "And the goat will bear all their faults away with it to a desert place." The blood of the sacrificed goat thus atones and purifies, while the wandering exiled goat removes the taint of guilt. As sin-bearer, it carries the confessed evils away from the community – or, in psychological terms, away from the collective consciousness. The "scape" in "scapegoat", by the way, is a contraction of the word "escape": the goat who escapes."
Last edited by the_ohmbudsman; 09-12-2014 at 05:31 PM.
Find More Posts by the_ohmbudsman

redpajama_set_name: RedPajamaCommonCrawl


State and federal discrimination laws protect the rights of workers to practice whatever religion they choose without fear of retaliation.
At The Chandra Law Firm LLC in Cleveland, we take your religious freedom seriously. A boutique litigation firm, our employment-litigation attorneys are driven to help you get the justice you deserve when your employer discriminates or negligently allows discrimination to occur. We can represent you in state and federal courts throughout Ohio or across the nation.
These cases often hinge on whether your employer made "reasonable" accommodations for you and your religious practices. As successful trial lawyers, we know how to craft the case strategies necessary to best position you for a positive outcome. It is why we have built a track record of securing six-figure and multimillion-dollar settlements and verdicts for our clients in cases that many other law firms regarded as long shots.
We obtained a sizable settlement for a Muslim woman who faced discrimination in a hospital for wearing Muslim headdress.
We represented Muslim association that was facing discrimination while trying to establish a cemetery.
We helped obtain dismissal of charges against a Hindu Bhutanese refugee who was wrongly suspected of terrorism.


text:
Round 1… Fight: Washington Capitals vs Boston Bruins
Kassie Coulson Boston Bruins, Hockey, NHL, Washington Capitals May 14, 2021 May 14, 2021 4 Minutes
Season Record Predicted Goaltender GAA / SV%
Washington Capitals 36-15-5 TBD —
Boston Bruins 33-16-7 Tuukka Rask 2.28 / .913
Predicted Starting Goaltenders
The playoff field is final, and the matchups are set. The Washington Capitals are taking on the Boston Bruins in Round 1 of the Stanley Cup Playoffs. The Capitals have the longest current playoff appearance streak, with seven straight postseason berths. The Bruins have the 2nd longest streak with five consecutive playoff appearances (mcubed). In eight regular season meetings, the two teams split the series with four wins apiece, including an 8-1 beatdown by Washington back in April, and a similar 6-3 win for the Bruins just seven days later.
The Washington Capitals ended their shortened 56-game season with 36 wins and a .688 win percentage, landing them 6th overall in the league and in 2nd place in the Mass Mutual East, right behind the rival Pittsburgh Penguins. More than half of the Caps' wins (19) came on the road, giving them the best road record in the league. Offensively, Washington averaged 3.36 goals per game and boasted the 3rd best power play in the league (24.8%). At one point, the Capitals power play at home was well over 80% but ended the season as the best among all teams (30.6%). Unfortunately, Washington allowed a league-most eight shorthanded goals, despite having one of the league's best penalty killing units. Under Todd Reirden, the Caps had failed to advance beyond the first round each of the last two seasons. But head coach Peter Laviolette has taken his three previous teams to three Stanley Cup Finals, winning one with the Carolina Hurricanes, but falling just short to the Pittsburgh Penguins with the Predators in 2016-17.
In 55 games, Backstrom played his 1000th career NHL game (all with the Washington Capitals), scored 15 goals, and tallied 38 assists for 53 points (leads team). Arguably the best Cap of the season, Nicklas had eight-multi assist games and seven games in which he both scored and provided either a primary or secondary assist. In 128 career playoff games, Backstrom has 36 goals and 71 assists, and in six games versus the Bruins in the postseason, Nicky has four points (1G, 3A).
Daniel Sprong
Although not considered a mainstay in the Caps lineup early on, Sprong has made a strong case to remain there. In 42 games played, Daniel tallied 13 goals and 7 assists for 20 points, marking a new career high previously set with Anaheim (2018-19). After finding a home comfortably within the middle six forwards, Sprong put up six goals in his final eight games, including a two-goal performance versus the Islanders.
Vitek Vanecek
The 25-year old Czech netminder has been the story of the Capitals season. After Ilya Samsonov was placed on the COVID Protocol list to begin the year, Vanecek suddenly found himself thrust into the spotlight and quickly and convincingly won not only the hearts of Caps fans, but also the #1 goaltender in DC. Vitek's first NHL start turned into his first NHL win, and went on to tally 21 wins in 37 games played, including two shutouts. Vanecek led rookie goaltenders in wins, and ranked 6th among all goalies across the NHL. He was named the NHL's Rookie of the Month in January after failing to lose in regulation in all seven starts. In 21 wins, Vanecek tallied a .934 save percentage and allowed just 1.79 goals against, but over his 10 losses, those number shifted dramatically to .865% and 4.16 GAA (respectively).
The Boston Bruins tallied 33 wins, 16 losses, and 7 overtime losses, ending their season with a .652 win percentage. Eight of their 33 wins came by way of an overtime period or the shootout. They did however drop two games to the Caps in which extra hockey was needed (OTL, SOL). Boston's season began pretty poorly, having lost nearly half of all games played in the opening month of January as well as in February with 12-5-3 and 22-12-6 records, respectively. The Bruins ranked 13th in goals for and allowed the 4th fewest goals against. Boston's power play rounded out the season 10th best overall (21.9%), tallied nine shorthanded goals, and boasted the 2nd best penalty kill in the league, killing off 86% of all penalties taken. Impressive when you consider that the Bruins took the most minor penalties (194) of all teams.
Marchand led his team in goals, assists, and points with 29, 40 and 69, respectively. In 121 career playoff games, Marchand has 37 goals and 58 assists, with 16 goals coming in his most previous two seasons. 'The Rat' has been a thorn in Washington's side with 33 points in 39 games, including 15 goals, three of which were power play goals. With that being said he has just two points (1G, 1A) against the Capitals in the post-season.
Taylor Hall
After coming over from the Sabres in a HALLmark trade with the Bruins, former Hart Trophy recipient Taylor Hall has met and exceeded all expectations previously set for him. The winger, in 16 games with Boston, has 8 goals and 6 assists for 14 points. Compare those numbers to 2 goals and 17 assists in 37 games with Buffalo prior to said trade. Hall has arguably been the Bruins most consistent player, putting up points in 11 of his final 16 games, and never going more than a single game without doing so. Taylor boasted a career-best 16.7% shooting percentage in the same span, up from a measly 2.3% in 37 games with Buffalo earlier in the season. In 14 playoff games, Hall has 4 goals and 8 assists (NJD, ARI).
Patrice Bergeron
The center registered 23 goals and 25 assists for 48 points in 54 games, including 7 power play goals (leads team). Bergeron was riding a five-game goal streak before failing to register a point in his final game of the season versus the Islanders on May 10th. 'Bergy' marked a career best 64% Fenwick For, meaning that the Bruins controlled the puck more often than not when he was on the ice. Once again, he is a Selke Trophy Finalist, and should Bergeron win it, it would mark his 5th time taking home the two-way trophy.
Below is the official schedule vs. BOS (all times in EST):
Game 1: Saturday May 15 at 7:15pm
Game 2: Monday May 17 @ 7:30pm
Game 3: Wednesday May 19 @ 6:30pm
Game 4: Friday May 21 @ 6:30pm
Game 5 *if necessary*: Sunday May 23 @ TBD
Game 6 *if necessary*: Tuesday May 25 @ TBD
Game 7 *if necessary*: Thursday May 27 @ TBD
The Washington Capitals and Boston Bruins will play Game 1 on Saturday May 15th at 7:15 EST, and can be watched on NBCSN and on NBC Sports Washington.
Published by Kassie Coulson
View all posts by Kassie Coulson
Previous Post NHL Daily – West is Finally Settled
Next Post NHL Daily – The Stanley Cup Playoffs Begin!!


After going big with Avengers: Infinity War, Marvel will go small.
It will follow up that record-breaking crossover event with its next movie following Ant-Man, Marvel's tiniest superhero.
A new trailer for Ant-Man and the Wasp just dropped online, and it suggests The Wasp, played by Evangeline Lilly, will have a more prominent role than she had in the first Ant-Man, released back in 2015.
Here's an official synopsis from Marvel.
The action won't be on the same scale as that of Infinity War, but bigger isn't always better.


Buy The Sims 4 for PC today! A real-life simulation game that lets you create & control people in a virtual world like never before. This is a digital code with no expiry date.
The acclaimed daily life simulator is back with its 4th instalment - The Sims 4! Full of new features and improvements to make your Sims characters and environments even more unique, relatable, and appealing than before. The Sims 4 allows you to interact with your customized world like you always did – like a generous and loving all-powerful being (with a God-like status) who isn't shy of carrying out potentially lethal actions in order to keep their world intact!
Enjoy the power to control and create people in a virtual world with no rules. Express your creativity with customized Sims having unique personalities and distinct appearances. Select their hairstyles, choose their fashions, and give them hopes and dreams they can aspire to.
Effortlessly construct perfect homes for your Sims with the brand new room based Build Mode by selecting your favorite decor and designs. Help your Sims' pursue new careers, develop relationships, and shape the entertaining and rich moments of their lives. Discover beautiful worlds with different environments and journey through neighborhoods to meet other interesting Sims and see new venues. Be free and powerful while you play with life but most of all have fun!
Create a wide range of unique Sims each having all-new emotions, big personalities, and distinct appearances. Design your Sims' body type using the new and powerful 'Create A Sim Tool' - choose from walk-styles, fashions, and hairstyles. Give their lives some purpose by hand-picking their individual aspirations and traits that give you complete control over their heart, mind, and body.
The new room-based 'Build Mode' let's you effortlessly design and build homes for your Sims. Build your dream home by customizing its layout, altering the landscape, and choosing its furnishings to the T. You could even add a basement or pool if you'd like!
Explore interesting venues, discover vibrant neighborhoods, and journey between worlds. Your Sims can expand their social circle by visiting new communities, hanging out with friends in parks, or by collecting and finding fun new objects.
Take control of every entertaining and rich moment of your Sims' lives, right from their relationships through to their careers. Every aspect of your Sims' lives, from birth to adulthood is shaped by your decisions. Develop your Sims' skills and pursue new hobbies.
Discover and add great community content to your game, or better still share your unique creations with the world with the all-new Sims Gallery. Like, comment, and download complete homes, fully designed rooms, and your favorite Sims.
Can't get enough of The Sims 4? Why not try the fun and exciting The Sims 4: Cats & Dogs DLC or better still take a look at our wide range of Sims PC DLC's and Games for the one that excites you the most!
Buying The Sims 4 for PC from Livecards.eu is as easy as 1 2 3! Simply fill in your email address, select a payment method and complete the payment!
We have some of the cheapest The Sims 4 for PC on the market.


text:
Ontario Upgrading Buildings at York University
Archived News Release
Improvements Support Research and Learning Opportunities for Students
February 17, 2017 12:45 P.M.
Ministry of Training, Colleges and Universities
Ontario is investing in building and systems upgrades at York University that will better equip students with the skills they need for the jobs of today and tomorrow.
Steven Del Duca, MPP for Vaughan, was joined by Judy Sgro, MP for Humber River-Black Creek at York University today to announce funding for the Major Science Building Renewal Project, the Central Utilities and Co-Generation Upgrade Project and the Schulich School of Business Expansion.
Investments from the province and the federal government will allow York University to proceed with construction that will improve research and experiential learning opportunities for students. Work will include modernizing four major science research buildings at the Keele and Glendon campuses, replacing turbines and boilers, and building an addition to the Schulich School of Business. Site work and demolition has already started.
Ontario is making the largest infrastructure investment in hospitals, schools, public transit, roads and bridges in the province's history. To learn more about what's happening in your community, go to Ontario.ca/BuildON.
Investing in postsecondary infrastructure is part of our plan to create jobs, grow our economy and help people in their everyday lives.
The overall cost to complete these projects is approximately $113 million, and includes nearly $41 million from Canada's Strategic Investment Fund, nearly $6.6 million from Ontario, and more than $65 million from York University.
Ontario has invested $735 million in capital funding for colleges and universities since 2013-14.
Research shows that every $100 million of public infrastructure investment in Ontario boosts the gross domestic product by $114 million, particularly in the construction and manufacturing sectors.
Ontario colleges and universities
BuildON
"Our government is proud to support this important project, which will give York University students access to renewed and upgraded facilities that provide space for three projects; the Major Science Building Renewal project, the Central Utilities and Co-Generation Upgrade project and the Schulich School of Business Expansion. We know that providing access to high-quality education and training facilities is critical to building the highly-skilled workforce we need to support good jobs and economic growth for today and tomorrow, and this investment will help us to do exactly that."
Steven Del Duca
Minister of Transportation
"Our government has made the support of science the cornerstone of policy development and roll-out and this announcement is part of that approach. This strategy, coupled with the fact that York has long been on the forefront of research and cutting edge development, means York's role is one that must expand in ways that assures the University has the tools needed to do the job effectively. This funding is an important step on that path and I am pleased to be here to lend my support to York University and to the concept of policy rooted in science and data."
Hon. Judy Sgro
MP, Humber River –Black Creek
Sandra Zeni
Sandra.Zeni@ontario.ca
Stephanie Rea
Minister's Office
Stephanie.Rea@ontario.ca
This document was published on February 17, 2017 and is provided for archival and research purposes.


At this point in our tale, it was the summer. Being a bit shortsighted and not at all aware of what was going on in the industry, I forgot that most shows go on hiatus. This means that my main source of grind it out income, extra work, became scarce. If there's two things that … Continue reading Longshots and Lenses.


I just wanted to point out that I found the Sack Boris Campaign website the other day, and took the opportunity to donate some cash to get some Sack Boris Oyster card wallets. A friend of mine works in the TFL Lost Property Office, so I am thinking of "accidentally losing" a few and asking if he has found them.
With the TFL fare increase, and the state of the economy, one way to give back to the community might be to look into handing out free PAYG oyster cards with the wallets. We could top them up with say £5 each, and let people hand in their old PAYG oyster cards (and wallets, naturally) to be topped up and donated. That's a free day's fare in and out of the city, to visit Occupy London.
We all know TFL/Boris did this to try and prevent support for Occupy London, by pricing the poor off of public transport, and thus limiting their access to the camp and the facilities that they provide. We shouldn't let them get away with this. Instead, we should turn it to our advantage.
Okay, maybe this is just a conspiracy theory of mine, but fares are something Boris has direct control over, and if you have a registered Oyster card, then your journeys are tracked, so TFL can see how many people are travelling to the sites closest to the Occupy camps. You don't think they would be monitoring that sort of information?
In fact, the Oyster card itself, while convenient, is also a thinly disguised means of tracking people's movements. This is WHY they offer a discount on journeys made using Oyster – they want people to use Oyster, so they can track what people are doing. Now, it has always been my philosophy that you cannot hide what you are doing, rather you should always act and be prepared as if you are being watched. In my case, I generally don't care whether people see me or not. If something needs to be done, I will do it, and it doesn't matter if I am being watched or not.
Maybe I should run for London Mayor this year? As an Occupy candidate?
Until you played your card as a conspiracy theorist, all of your posts have been pretty sensible: even I might have voted for you… Except I am not registered in London.
I think most conspiracies are a matter of perception myself – There are many theories, and I am a theorist. It comes from being a psycho-sociologist. It's just that sometimes they happen to be about conspiracies. All the good conspiracy theories do actually have sense in them, which is why it can be so hard to work out whether they are true or not. My attitude is to always keep an open mind and an open eye. I come across a lot of interesting information all the time.
You may have competition in the mad Mayor of London stakes.
Now, I'll freely admit to being a bit of a grumpy old cynic (well, a grumpy cynic, anyway…), but when I read the description of a 'psycho-sociologist' the phrase 'get a life' sprang to mind for some reason. And while I'm in full grump mode, the moniker 'Hairyloon' sounded highly approptiate in this case.
Now then – 'the poor'. Is that the 'poor' that are getting up to £26,000 a year tax free in benefits? Those poor? Or is it the poor tw*t working his socks off and trying to pay all the bills on about £20,000 a year gross?
Having spent some time with the forums, Hairyloon is actually quite good fun.
A sympathetic northern critic who has been trying to goad the Occupiers closer to planet earth.
Challenged as this may be, I think it pales next to the intellectual challenge of their "Diploma in Occupied Economics".
I swear that page actively reduces IQ.
SadButMadLad on The Thrills and Spills of the European Parliament…Part 1.
permanentexpat on The Thrills and Spills of the European Parliament…Part 1.
Anna Raccoon on The Thrills and Spills of the European Parliament…Part 1.
Simon Cooke on The Thrills and Spills of the European Parliament…Part 1.


text:
Eliot studied English Language and Literature at Christ Church, Oxford, before training at the Guildford School of Acting. Directing credits include Baroque Around the Block and Monteverdi's Flying Circus for Armonico Consort, Three Servants and Voyagers for Jet Theatre/Croydon Warehouse, Sex and Suicide, Sorry Island and Postcards from Transylvania (Durham Theatre Company) and The Love Letters of Private Blade (Riverside Sudios). Over the last 20 years he has worked extensively as an actor in theatre, film and TV. Recent work includes the title role in The Beekeeper (for which he received a Best Actor nomination in the 2012 Off West End Awards).
What first attracted you to the theatre?
I realised it was somewhere where you could show off and not get into trouble! My Archangel Gabriel in the School Nativity play, aged 5 was, I'm reliably informed, a sight to behold.
If you could pick any one person or theatre company to work with on your next project, who/which would it be?
I adore Shakespeare and I've had the great good fortune to have performed at Shakespeare's Globe as an actor. If I could wave my wand I'd love to direct a show there; there's something about the space with the actors sharing the same light as the audience that just has a bit of magic about it.
What is your opinion of Off West End theatre, in general?
Buzzing, underfunded and full of creative energy.
What was the most inspiring production you have ever seen? Why?
I was blown away by Phelim McDermott's Shockheaded Peter when I first saw it. It was completely thrilling – a crazy dark mix of panto, puppets, music hall and children's nightmares – and so original. Likewise Theatre de Complicite's Street of Crocodiles, which created images that stayed with me long after the show ended. Even now, some 20 years later, I can still remember a man coming out of an impossibly small crate, defying gravity and walking up a wall.
What piece of work are you the most proud of?
I'm very proud of my current production actually. Knackerman has just opened at the White Bear Theatre Club in Kennington, and I think the writer, Rosanna Negrotti, is an absolutely original and unique new voice. I'm really looking forward to finding out what an audience makes of her play in all it's malevolent glory, so book your tickets quick and let me know!
What things in your personal life do you draw upon when you direct?
I try not to draw on my personal life at all. It's rarely as interesting as the script I'm working on!
Are there any actors/actresses you would like to direct?
The list is endless really. I'm a great admirer of protean actors – people like Mark Rylance, Henry Goodman and Kevin Spacey – though I suspect they can pretty much direct themselves.
Which director do you respect most on OffWestEnd at the moment?
I've worked with Lucy Bailey on a number of occasions as an actor and I have great admiration for her. She's bold and fearless and her productions always make for compelling viewing.
Can you tell our readers about what you're doing now/next?
Next up for me is Blackeyed Theatre's production of Dracula, which is definitely something for me to get my teeth into. It's a muscular new adaptation of Bram Stoker's novel by John Ginman, and the show will be touring nationally from the end of September through to spring 2014. We have a fabulous creative team in place and we are well into pre-production. Touch wood, it's shaping up to be a really exciting project.


text:
using namespace std;

int DEBUG = 0;
map<string, double> calculated_data;

// PRINTING FUNCTIONS
void print_map(map<string, vector<int> > mapa);
void print_path(vector<string> path);
void print_path_and_values(vector<string> path, map<string, vector<int> > mapa);
void print_array_of_paths(vector<vector<string>> path_array);
void print_array_of_paths_and_values(vector<vector<string>> path_array, map<string, vector<int> > mapa);

// DISTANCE CALCULATION
double get_distance(string s1, string s2, map<string, vector<int> > mapa);
double get_path_length(vector<string> nodes, map<string, vector<int> > mapa);
double get_path_length(vector<string> nodes, map<string, vector<int> > mapa);
double find_calculated_data(string id_1, string id_2);
void add_to_calculated_data(string id_1, string id_2, double value);

// COMPARE FUNCTIONS
bool contains_cycles(vector<string> path);

// COLLECTION FUNCTIONS
map<string, vector<int>> build_data_map();
map<string, vector<int> > build_bigger_data_map();
map<string, vector<int> > build_biggest_data_map();
vector<string> get_nodes(map<string, vector<int> > mapa);
vector<vector<string>> create_initial_population(map<string, vector<int>> mapa, unsigned int population_size);

// UTILITIES
vector<string> shuffle(vector<string> nodes);
vector<string> find_best_path(vector<vector<string>> population, map<string, vector<int> > mapa, unsigned int worst_possible_path_lenght);
vector<vector<string>> pick_better_half(vector<vector<string>> population, map<string, vector<int> > mapa, unsigned int worst_possible_path_lenght);
int get_random_num(int mod);
vector<vector<string>> pick_two(vector<vector<string>> population);
vector<vector<string>> crossover(vector<vector<string>> parents, map<string, vector<int> > mapa);
vector<vector<string>> mutation(vector<vector<string>> children, map<string, vector<int> > mapa);
void solve(vector<vector<string>> population_1, map<string, vector<int> > mapa, int iterations);

int main(){

	// VARIABLES
	unsigned int population_size = 30;
	double mutation_threshold = 0.021;
	unsigned int iteration_threshold = 100;
	unsigned int worst_possible_path_lenght = UINT_MAX;

	// SEEDING
	srand(time(NULL));

	// BUILDING DATA MAP
	map<string, vector<int> > mapa = build_data_map();
	map<string, vector<int> > mapa2 = build_bigger_data_map();
	map<string, vector<int> > mapa3 = build_biggest_data_map();

	//print_map(mapa3);
	//return 0;

	population_size = mapa2.size();

	// CREATING INITIAL POPULATION
	vector<vector<string>> population_1 = create_initial_population(mapa3, population_size);

	// SOLVING
	clock_t begin_pt = clock();
	solve(population_1, mapa3, iteration_threshold);
	//clock_t end_pt = clock();
	std::cout << "Time spent solving " << double(clock() - begin_pt) / CLOCKS_PER_SEC << endl;

	system("PAUSE");
	return 0;

}

void print_map(map<string, vector<int> > mapa){
	vector<string> v;
	for (map<string, vector<int>>::iterator it = mapa.begin(); it != mapa.end(); ++it) {
		v.push_back(it->first);
	}
	for (unsigned int i = 0; i < v.size(); ++i){
		cout << v.at(i) << ": [ x: " << mapa[v.at(i)][0] << ", y: " << mapa[v.at(i)][1] << " ]" << endl;
	}
}

void solve(vector<vector<string>> population_1, map<string, vector<int> > mapa, int iterations){

	double best_path_length = UINT_MAX;
	vector<string> best_path;
	unsigned int best_path_reached_in_iteration = 0;
	unsigned int iteration_counter = 0;
	unsigned int total_iterations = iterations;
	vector<vector<string>> local_population = population_1;

	// GENERATE GIVEN NUMBER OF GENERATIONS
	while (iterations > 0){
		vector<vector<string>> next_population;
		vector<vector<string>> better_half = pick_better_half(local_population, mapa, UINT_MAX);

		// FILL WHOLE POPULATION
		//while (next_population.size() < (population_1.size() /1.5)){
		while (next_population.size() < population_1.size()){

			// PICKING PARENTS
			vector<vector<string>> parents = pick_two(better_half);

			// CROSSING CHILDREN
			vector<vector<string>> children = crossover(parents, mapa);

			// MUTATING CHILDREN
			children = mutation(children, mapa);

			// VERIFYING CHILDREN VALIDITY
			bool cycles_in_daughter = contains_cycles(children.at(0));
			bool cycles_in_son = contains_cycles(children.at(1));

			// IF NOT TWINS
			if (children.at(0) != children.at(1)){
				if (next_population.size() < 1){
					// IF POPULATION IS FRESH - EXTEND IT WITHOUT CHECKING
					if (!cycles_in_daughter) next_population.push_back(children.at(0));
					if (!cycles_in_son) next_population.push_back(children.at(1));
				}
				else {
					// CHECK FOR POTENTIAL GENE DUPLICATION
					int daughter_check = 0;
					int son_check = 0;
					for (unsigned int i = 0; i < next_population.size(); ++i){
						if (children.at(0) == next_population.at(i)) ++daughter_check;
						if (children.at(1) == next_population.at(i)) ++son_check;
					}
					// ADD THOSE THAT WILL BE UNIQUE IN POPULATION
					if (daughter_check < 1 && !cycles_in_daughter) next_population.push_back(children.at(0));
					if (son_check < 1 && !cycles_in_son) next_population.push_back(children.at(1));
				}
			}
			// IF TWINS - CHOOSE ONE
			else {
				// CHECK FOR POTENTIAL GENE DUPLICATION
				int daughter_check = 0;
				for (unsigned int i = 0; i < next_population.size(); ++i){
					if (children.at(0) == next_population.at(i)){
						++daughter_check;
					}
				}
				if (daughter_check < 1 && !cycles_in_daughter) next_population.push_back(children.at(0));
			}
		}

		// PICK BEST PATH AND GET LENGTH
		vector<string> local_best_path = find_best_path(next_population, mapa, UINT_MAX);
		double local_best_path_length = get_path_length(local_best_path, mapa);

		// INFORM ABOUT CURRENT ITERATION
		cout << "[INFO] Iteration " << iteration_counter + 1 << ". Best path length: " << local_best_path_length << endl;

		// CHECK IF CURRENT ONE IS BEST
		if (local_best_path_length < best_path_length) {
			best_path_length = local_best_path_length;
			best_path = local_best_path;
			best_path_reached_in_iteration = total_iterations - iterations;
		}
		// T = T+1
		local_population = next_population;
		++iteration_counter;
		--iterations;
	}
	cout << "[FINAL] Best path length: " << best_path_length << " reached in " << best_path_reached_in_iteration << " iteration." << endl;

}

vector<vector<string>> mutation(vector<vector<string>> children, map<string, vector<int> > mapa){

	// MUTATION HAPPENS FOR 0.02 PERCENTILE
	if (get_random_num(1000) > 21){
		return children;
	}

	// VARIABLES
	vector<vector<string>> mutated_children;
	vector<string> daughter = children.at(0);
	vector<string> son = children.at(1);

	// CHOOSE MUTATION POINTS
	int mutation_point_1 = get_random_num((children.at(0)).size());
	int mutation_point_2 = get_random_num((children.at(0)).size());
	while (mutation_point_1 == mutation_point_2){
		mutation_point_2 = get_random_num((children.at(0)).size());
	}

	// GET CROSSING POINTS IN ORDER
	unsigned int smaller = (mutation_point_1 < mutation_point_2) ? (mutation_point_1) : (mutation_point_2);
	unsigned int bigger = (mutation_point_1 < mutation_point_2) ? (mutation_point_2) : (mutation_point_1);

	// COLLECTING SUBPATH FOR MUTATION
	vector<string> daughter_mutation;
	vector<string> son_mutation;
	for (unsigned int i = smaller; i < bigger; ++i){
		daughter_mutation.push_back(daughter.at(i));
		son_mutation.push_back(son.at(i));
	}

	// REORDERING SUBGENOMS
	reverse(daughter_mutation.begin(), daughter_mutation.end());
	reverse(son_mutation.begin(), son_mutation.end());

	// MUTATING
	unsigned int index = 0;
	for (unsigned int i = smaller; i < bigger; ++i){
		daughter[i] = daughter_mutation.at(index);
		son[i] = son_mutation.at(index);
		++index;
	}

	// FILLING THE RESULT
	mutated_children.push_back(daughter);
	mutated_children.push_back(son);

	return mutated_children;
}

vector<vector<string>> crossover(vector<vector<string>> parents, map<string, vector<int> > mapa){
	// CREATES DESCENDANTS
	vector<vector<string>> children;

	// CHECK WHETHER PARENTS LIKE EACH OTHER ENOUGH
	if (get_random_num(100) > 70) return parents;

	// CHOOSE CROSSING POINTS
	int crossing_point_1 = get_random_num((parents.at(0)).size());
	int crossing_point_2 = get_random_num((parents.at(0)).size());
	while (crossing_point_1 == crossing_point_2){
		crossing_point_2 = get_random_num((parents.at(0)).size());
	}

	// GET CROSSING POINTS IN ORDER
	unsigned int smaller = (crossing_point_1 < crossing_point_2) ? (crossing_point_1) : (crossing_point_2);
	unsigned int bigger = (crossing_point_1 < crossing_point_2) ? (crossing_point_2) : (crossing_point_1);

	vector<string> daughter;
	vector<string> son;

	// FILLING CHILDREN WITH EMPTY GENES
	for (unsigned int i = 0; i < (parents.at(0)).size(); ++i){
		daughter.push_back(" ");
		son.push_back(" ");
	}

	// FILLING CHILDREN WITH PARENT GENES BETWEEN CROSSING POINTS
	// SON GETS GENES FROM MOTHER, DAUGHTER FROM FATHER
	// COLLECTING DATA FOR RULES CREATION
	vector<string> mother_data;
	vector<string> father_data;
	for (unsigned int i = smaller; i < bigger; ++i){
		daughter[i] = (parents.at(1)).at(i);
		mother_data.push_back((parents.at(1)).at(i));

		son[i] = (parents.at(0)).at(i);
		father_data.push_back((parents.at(0)).at(i));
	}

	// CREATE RULES FROM PARENTS
	vector<vector<string>> rules;
	for (unsigned int i = 0; i < mother_data.size(); ++i){
		vector<string> rule_1;
		vector<string> rule_2;
		rule_1.push_back(mother_data.at(i));
		rule_1.push_back(father_data.at(i));
		rule_2.push_back(father_data.at(i));
		rule_2.push_back(mother_data.at(i));
		rules.push_back(rule_1);
		rules.push_back(rule_2);
	}

	// FILLING CHILDREN EMPTY GENES 1
	for (unsigned int i = 0; i < smaller; ++i){
		for (unsigned int j = 0; j < rules.size(); ++j){
			if ((rules.at(j)).at(0) == (parents.at(0)).at(i)){
				daughter[i] = (rules.at(j)).at(1);
			}
			if ((rules.at(j)).at(0) == (parents.at(1)).at(i)){
				son[i] = (rules.at(j)).at(1);
			}
		}
	}

	// FILLING CHILDREN EMPTY GENES 1
	for (unsigned int i = bigger; i < daughter.size(); ++i){
		for (unsigned int j = 0; j < rules.size(); ++j){
			if ((rules.at(j)).at(0) == (parents.at(0)).at(i)){
				daughter[i] = (rules.at(j)).at(1);
			}
			if ((rules.at(j)).at(0) == (parents.at(1)).at(i)){
				son[i] = (rules.at(j)).at(1);
			}
		}
	}

	// COLLECTING UNUSED GENES FROM MOMMY
	vector<string> unused_mommy_genes;
	vector<string> unused_daddy_genes;
	for (unsigned int i = 0; i < daughter.size(); ++i){
		if (daughter.at(i) == " ") unused_mommy_genes.push_back((parents.at(0)).at(i));
	}
	for (unsigned int i = 0; i < son.size(); ++i){
		if (son.at(i) == " ") unused_daddy_genes.push_back((parents.at(1)).at(i));
	}

	// FILLING REMAINING EMPTY GENES IN CHILDREN
	unsigned int index = 0;
	for (unsigned int i = 0; i < daughter.size(); ++i){
		if (daughter.at(i) == " "){
			daughter[i] = unused_daddy_genes.at(index);
			++index;
		}
	}
	index = 0;
	for (unsigned int i = 0; i < son.size(); ++i){
		if (son.at(i) == " "){
			son[i] = unused_mommy_genes.at(index);
			++index;
		}
	}

	// FILLING THE RESULT
	children.push_back(daughter);
	children.push_back(son);
	return children;
}

vector<vector<string>> pick_two(vector<vector<string>> population)
{
	// PICKS RANDOM TWO FROM POPULATION
	vector<vector<string>> pair;

	while (pair.size() != 2){

		// CHOOSING RANDOM FROM POPULATION
		unsigned int random = get_random_num(population.size());
		vector<string> choosen = population.at(random);

		// IF THIS IS FIRST ONE - ASSIGN TO PAIR
		if (pair.size() == 0){
			pair.push_back(choosen);
		}
		// ELSE ASSIGN TO PAIR ONLY IF CHOSEN ONE IS DIFFERENT
		else {
			if (pair.at(0) != choosen) pair.push_back(choosen);
		}
	}
	return pair;
}

int get_random_num(int mod)
{
	return rand() % mod;
}

vector<vector<string>> pick_better_half(vector<vector<string>> population, map<string, vector<int> > mapa, unsigned int worst_possible_path_lenght)
{
	// GETTING BETTER HALF OF POPULATION FOR POTENCIAL CROSSOVER
	vector<vector<string>> better_half;
	vector<vector<string>> local_population = population;

	// PICKING BEST OF THE BEST ONE BY ONE
	for (unsigned int i = 0; i < population.size() / 2; ++i){

		// PICK SINGLE BEST
		vector<string> best_one = find_best_path(local_population, mapa, worst_possible_path_lenght);
		better_half.push_back(best_one);

		// REMOVING CURRENT PICK FROM POPULATION
		for (unsigned int j = 0; j < local_population.size(); ++j){
			if (best_one == local_population.at(j)){
				// REMOVAL
				local_population.erase(
					std::remove(local_population.begin(), local_population.end(), best_one),
					local_population.end()
					);
			}
		}
	}
	return better_half;
}

vector<string> find_best_path(vector<vector<string>> population, map<string, vector<int> > mapa, unsigned int worst_possible_path_lenght)
{
	// FINDS BEST SOLUTION IN POPULATION
	vector <string> best_path;
	double best_path_length = worst_possible_path_lenght;

	// ITERATING OVER ALL POPULATION
	for (unsigned int i = 0; i < population.size(); ++i){
		double length = get_path_length(population.at(i), mapa);
		if (length < best_path_length){
			// BEST ONE FOUND
			best_path_length = length;
			best_path = population.at(i);
		}
	}
	return best_path;
}

bool contains_cycles(vector<string> path)
{
	// CHECKS FOR CYCLES IN PATH
	for (unsigned int i = 0; i < path.size(); ++i){
		int check = 0;
		for (unsigned int j = 0; j < path.size(); ++j){
			if (path.at(i) == path.at(j)){
				// CYCLE FOUND
				++check;
				if (check > 1) return true;
			}
		}
	}
	return false;
}

vector<string> get_nodes(map<string, vector<int> > mapa)
{
	// GETS ALL NODE NAMES FROM MAP AND STORES IN A STRING VECTOR
	vector<string> result;
	for (map<string, vector<int> >::iterator it = mapa.begin(); it != mapa.end(); ++it){
		result.push_back(it->first);
	}
	return result;
}

double get_distance(string s1, string s2, map<string, vector<int> > mapa)
{
	// GETS EUCLIDESIAN DISTANCE BETWEEN TWO POINS IN A PLANE
	int x1 = mapa[s1].at(0);
	int y1 = mapa[s1].at(1);
	int x2 = mapa[s2].at(0);
	int y2 = mapa[s2].at(1);
	return sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
}

void print_path(vector<string> path){
	// PRINTS PATH
	for (unsigned int i = 0; i < path.size(); ++i){
		cout << path.at(i) << " ";
	}
	cout << endl;
}

void print_path_and_values(vector<string> path, map<string, vector<int> > mapa){
	// PRINTS PATH
	for (unsigned int i = 0; i < path.size(); ++i){
		cout << path.at(i) << " ";
	}
	cout << "\t" << get_path_length(path, mapa);
	cout << endl;
}

void print_array_of_paths(vector<vector<string>> path_array){
	// PRINTS MULTIPLE PATHS
	for (unsigned int i = 0; i < path_array.size(); ++i){
		print_path(path_array.at(i));
	}
}

void print_array_of_paths_and_values(vector<vector<string>> path_array, map<string, vector<int> > mapa){
	// PRINTS MULTIPLE PATHS
	for (unsigned int i = 0; i < path_array.size(); ++i){
		print_path_and_values(path_array.at(i), mapa);
	}
}

double old_get_path_length(vector<string> nodes, map<string, vector<int> > mapa){
	// GETS LENGTH OF A GIVEN PATH

	double sum = 0;
	for (unsigned int i = 0; i < nodes.size() - 1; ++i){
		double partial_sum = find_calculated_data(nodes.at(i), nodes.at(i + 1));
		if (partial_sum != -1){
			sum += partial_sum;
		}
		else {
			partial_sum = get_distance(nodes.at(i), nodes.at(i + 1), mapa);
			add_to_calculated_data(nodes.at(i), nodes.at(i + 1), partial_sum);
			sum += partial_sum;
		}
	}
	return sum;
}

double get_path_length(vector<string> nodes, map<string, vector<int> > mapa){
	// GETS LENGTH OF A GIVEN PATH

	double sum = 0;
	int tid, nthreads, i;
	omp_set_num_threads(4);
#pragma omp parallel shared(sum, calculated_data, mapa) private(tid, i)
	{
		tid = omp_get_thread_num();
		// if (tid == 0){
		// 	nthreads = omp_get_num_threads();
		// 	//cout << "Number of threads: " << nthreads << endl;
		// }
#pragma omp for schedule(dynamic)
		for (i = 0; i < nodes.size() - 1; ++i){
			double partial_sum = find_calculated_data(nodes.at(i), nodes.at(i + 1));
			if (partial_sum != -1){
				sum += partial_sum;
			}
			else {
				partial_sum = get_distance(nodes.at(i), nodes.at(i + 1), mapa);
				add_to_calculated_data(nodes.at(i), nodes.at(i + 1), partial_sum);
				sum += partial_sum;
			}
		}
	}
	return sum;
}

vector<string> shuffle(vector<string> nodes){
	// REORDERING NODES IN PATH
	random_shuffle(nodes.begin(), nodes.end());
	return nodes;
}

vector< vector<string> > create_initial_population(map<string, vector<int> > mapa, unsigned int population_size){
	// CREATES INITIAL POPULATION
	vector<vector<string>> population;
	vector<string> adam = get_nodes(mapa);

	// FILL WHOLE POPULATION
	while (population.size() < population_size){

		// GENE REORDERING OF FIRST BEING
		vector<string> being = shuffle(adam);
		if (population.size() < 1){
			population.push_back(being);
		}
		else {
			// ADD ONLY THE ONES THAT WILL CONTAIN UNIQUE
			// ORDERS OF GENES IN POPULATION
			unsigned int check = 0;
			for (unsigned int i = 0; i < population.size(); ++i){
				if (being == population.at(i)){
					++check;
				}
			}
			if (check == 0){
				population.push_back(being);
			}
		}
	}
	// CHECK FOR CYCLES IN POPULATION
	for (unsigned int i = 0; i < population.size(); ++i){
		if (contains_cycles(population.at(i))){
			cout << "[ERR] F2: Cycle detected at " << i << endl;
		}
	}
	return population;
}

void add_to_calculated_data(string id_1, string id_2, double value){
	// ADDS ALREADY CALCULATED VALUES TO MAP
	string id = id_1 + "-" + id_2;
	string di = id_2 + "-" + id_1;
	calculated_data[id] = value;
	calculated_data[di] = value;
}

double find_calculated_data(string id_1, string id_2){
	// CHECKS IF DISTANCE HAS ALREADY BEEN CALCULATED
	string id = id_1 + "-" + id_2;
	double result = calculated_data[id];
	if (result != 0) {
		return result;
	}
	else {
		return -1;
	}
}

map<string, vector<int> > build_data_map(){

	vector<int> point;
	map<string, vector<int> > mapa;

	point.push_back(0);
	point.push_back(13);
	mapa["A"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(26);
	mapa["B"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(27);
	mapa["C"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(39);
	mapa["D"] = point;
	point.clear();

	point.push_back(2);
	point.push_back(0);
	mapa["E"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(13);
	mapa["F"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(19);
	mapa["G"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(25);
	mapa["H"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(31);
	mapa["I"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(37);
	mapa["J"] = point;
	point.clear();

	return mapa;
}

map<string, vector<int> > build_bigger_data_map(){

	vector<int> point;
	map<string, vector<int> > mapa;

	point.push_back(0);
	point.push_back(13);
	mapa["A"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(26);
	mapa["B"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(27);
	mapa["C"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(39);
	mapa["D"] = point;
	point.clear();

	point.push_back(2);
	point.push_back(0);
	mapa["E"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(13);
	mapa["F"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(19);
	mapa["G"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(25);
	mapa["H"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(31);
	mapa["I"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(37);
	mapa["J"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(43);
	mapa["K"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(8);
	mapa["L"] = point;
	point.clear();

	point.push_back(8);
	point.push_back(0);
	mapa["M"] = point;
	point.clear();

	point.push_back(9);
	point.push_back(10);
	mapa["N"] = point;
	point.clear();

	point.push_back(10);
	point.push_back(10);
	mapa["O"] = point;
	point.clear();

	point.push_back(11);
	point.push_back(10);
	mapa["P"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(10);
	mapa["Q"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(5);
	mapa["R"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(13);
	mapa["S"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(19);
	mapa["T"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(25);
	mapa["U"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(31);
	mapa["V"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(37);
	mapa["W"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(43);
	mapa["X"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(8);
	mapa["Y"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(11);
	mapa["Z"] = point;
	point.clear();
	return mapa;
}

map<string, vector<int> > build_biggest_data_map(){

	vector<int> point;
	map<string, vector<int> > mapa;

	point.push_back(0);
	point.push_back(13);
	mapa["001"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(26);
	mapa["002"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(27);
	mapa["003"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(39);
	mapa["004"] = point;
	point.clear();

	point.push_back(2);
	point.push_back(0);
	mapa["005"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(13);
	mapa["006"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(19);
	mapa["007"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(25);
	mapa["008"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(31);
	mapa["009"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(37);
	mapa["010"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(43);
	mapa["011"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(8);
	mapa["012"] = point;
	point.clear();

	point.push_back(8);
	point.push_back(0);
	mapa["013"] = point;
	point.clear();

	point.push_back(9);
	point.push_back(10);
	mapa["014"] = point;
	point.clear();

	point.push_back(10);
	point.push_back(10);
	mapa["015"] = point;
	point.clear();

	point.push_back(11);
	point.push_back(10);
	mapa["016"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(10);
	mapa["017"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(5);
	mapa["018"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(13);
	mapa["019"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(19);
	mapa["020"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(25);
	mapa["021"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(31);
	mapa["022"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(37);
	mapa["023"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(43);
	mapa["024"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(8);
	mapa["025"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(11);
	mapa["026"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(13);
	mapa["027"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(15);
	mapa["028"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(17);
	mapa["029"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(19);
	mapa["030"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(21);
	mapa["031"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(23);
	mapa["032"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(25);
	mapa["033"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(27);
	mapa["034"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(29);
	mapa["035"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(31);
	mapa["036"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(33);
	mapa["037"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(35);
	mapa["038"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(37);
	mapa["039"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(39);
	mapa["040"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(41);
	mapa["041"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(42);
	mapa["042"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(44);
	mapa["043"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(45);
	mapa["044"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(11);
	mapa["045"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(15);
	mapa["046"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(22);
	mapa["047"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(23);
	mapa["048"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(24);
	mapa["049"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(26);
	mapa["050"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(28);
	mapa["051"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(29);
	mapa["052"] = point;
	point.clear();

	point.push_back(25);
	point.push_back(9);
	mapa["053"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(16);
	mapa["054"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(20);
	mapa["055"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(28);
	mapa["056"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(30);
	mapa["057"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(34);
	mapa["058"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(40);
	mapa["059"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(43);
	mapa["061"] = point;
	point.clear();

	point.push_back(28);
	point.push_back(47);
	mapa["062"] = point;
	point.clear();

	point.push_back(32);
	point.push_back(26);
	mapa["063"] = point;
	point.clear();

	point.push_back(32);
	point.push_back(31);
	mapa["064"] = point;
	point.clear();

	point.push_back(33);
	point.push_back(15);
	mapa["065"] = point;
	point.clear();

	point.push_back(33);
	point.push_back(26);
	mapa["066"] = point;
	point.clear();

	point.push_back(33);
	point.push_back(29);
	mapa["067"] = point;
	point.clear();

	point.push_back(33);
	point.push_back(31);
	mapa["068"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(15);
	mapa["069"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(26);
	mapa["070"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(29);
	mapa["071"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(31);
	mapa["072"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(38);
	mapa["073"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(41);
	mapa["074"] = point;
	point.clear();

	point.push_back(34);
	point.push_back(5);
	mapa["075"] = point;
	point.clear();

	point.push_back(35);
	point.push_back(17);
	mapa["076"] = point;
	point.clear();

	point.push_back(35);
	point.push_back(31);
	mapa["077"] = point;
	point.clear();

	point.push_back(38);
	point.push_back(16);
	mapa["078"] = point;
	point.clear();

	point.push_back(38);
	point.push_back(20);
	mapa["079"] = point;
	point.clear();

	point.push_back(38);
	point.push_back(30);
	mapa["080"] = point;
	point.clear();

	point.push_back(38);
	point.push_back(34);
	mapa["081"] = point;
	point.clear();

	point.push_back(40);
	point.push_back(22);
	mapa["082"] = point;
	point.clear();

	point.push_back(41);
	point.push_back(23);
	mapa["083"] = point;
	point.clear();

	point.push_back(41);
	point.push_back(32);
	mapa["084"] = point;
	point.clear();

	point.push_back(41);
	point.push_back(34);
	mapa["085"] = point;
	point.clear();

	point.push_back(41);
	point.push_back(35);
	mapa["086"] = point;
	point.clear();

	point.push_back(41);
	point.push_back(36);
	mapa["087"] = point;
	point.clear();

	point.push_back(48);
	point.push_back(22);
	mapa["088"] = point;
	point.clear();

	point.push_back(48);
	point.push_back(27);
	mapa["089"] = point;
	point.clear();

	point.push_back(48);
	point.push_back(6);
	mapa["090"] = point;
	point.clear();

	point.push_back(51);
	point.push_back(45);
	mapa["091"] = point;
	point.clear();

	point.push_back(51);
	point.push_back(47);
	mapa["092"] = point;
	point.clear();

	point.push_back(56);
	point.push_back(25);
	mapa["093"] = point;
	point.clear();

	point.push_back(57);
	point.push_back(12);
	mapa["094"] = point;
	point.clear();

	point.push_back(57);
	point.push_back(25);
	mapa["095"] = point;
	point.clear();

	point.push_back(57);
	point.push_back(44);
	mapa["096"] = point;
	point.clear();

	point.push_back(61);
	point.push_back(45);
	mapa["097"] = point;
	point.clear();

	point.push_back(61);
	point.push_back(47);
	mapa["098"] = point;
	point.clear();

	point.push_back(63);
	point.push_back(6);
	mapa["099"] = point;
	point.clear();

	point.push_back(64);
	point.push_back(22);
	mapa["100"] = point;
	point.clear();

	point.push_back(71);
	point.push_back(11);
	mapa["101"] = point;
	point.clear();

	point.push_back(71);
	point.push_back(13);
	mapa["102"] = point;
	point.clear();

	point.push_back(71);
	point.push_back(16);
	mapa["103"] = point;
	point.clear();

	point.push_back(71);
	point.push_back(45);
	mapa["104"] = point;
	point.clear();

	point.push_back(71);
	point.push_back(47);
	mapa["105"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(12);
	mapa["106"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(16);
	mapa["107"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(20);
	mapa["108"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(24);
	mapa["109"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(29);
	mapa["110"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(35);
	mapa["111"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(39);
	mapa["112"] = point;
	point.clear();

	point.push_back(74);
	point.push_back(6);
	mapa["113"] = point;
	point.clear();

	point.push_back(77);
	point.push_back(21);
	mapa["114"] = point;
	point.clear();

	point.push_back(78);
	point.push_back(10);
	mapa["115"] = point;
	point.clear();

	point.push_back(78);
	point.push_back(32);
	mapa["116"] = point;
	point.clear();

	point.push_back(78);
	point.push_back(35);
	mapa["117"] = point;
	point.clear();

	point.push_back(78);
	point.push_back(39);
	mapa["118"] = point;
	point.clear();

	point.push_back(79);
	point.push_back(10);
	mapa["119"] = point;
	point.clear();

	point.push_back(79);
	point.push_back(33);
	mapa["120"] = point;
	point.clear();

	point.push_back(79);
	point.push_back(37);
	mapa["121"] = point;
	point.clear();

	point.push_back(80);
	point.push_back(10);
	mapa["122"] = point;
	point.clear();

	point.push_back(80);
	point.push_back(41);
	mapa["123"] = point;
	point.clear();

	point.push_back(80);
	point.push_back(5);
	mapa["124"] = point;
	point.clear();

	point.push_back(81);
	point.push_back(17);
	mapa["125"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(20);
	mapa["126"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(24);
	mapa["127"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(29);
	mapa["128"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(34);
	mapa["129"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(38);
	mapa["130"] = point;
	point.clear();

	point.push_back(84);
	point.push_back(6);
	mapa["131"] = point;
	point.clear();

	point.push_back(107);
	point.push_back(27);
	mapa["132"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(13);
	mapa["133"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(26);
	mapa["134"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(27);
	mapa["135"] = point;
	point.clear();

	point.push_back(0);
	point.push_back(39);
	mapa["136"] = point;
	point.clear();

	point.push_back(2);
	point.push_back(0);
	mapa["137"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(13);
	mapa["138"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(19);
	mapa["139"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(25);
	mapa["140"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(31);
	mapa["141"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(37);
	mapa["142"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(43);
	mapa["143"] = point;
	point.clear();

	point.push_back(5);
	point.push_back(8);
	mapa["144"] = point;
	point.clear();

	point.push_back(8);
	point.push_back(0);
	mapa["145"] = point;
	point.clear();

	point.push_back(9);
	point.push_back(10);
	mapa["146"] = point;
	point.clear();

	point.push_back(10);
	point.push_back(10);
	mapa["147"] = point;
	point.clear();

	point.push_back(11);
	point.push_back(10);
	mapa["148"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(10);
	mapa["149"] = point;
	point.clear();

	point.push_back(12);
	point.push_back(5);
	mapa["150"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(13);
	mapa["151"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(19);
	mapa["152"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(25);
	mapa["153"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(31);
	mapa["154"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(37);
	mapa["155"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(43);
	mapa["156"] = point;
	point.clear();

	point.push_back(15);
	point.push_back(8);
	mapa["157"] = point;
	point.clear();

	point.push_back(18);
	point.push_back(11);
	mapa["158"] = point;
	point.clear();

	return mapa;
}

redpajama_set_name: RedPajamaGithub


text:
April 9, 2014 by Simon Sweetman
R.I.P. The Ultimate Warrior
Perhaps you had – or still have – comic book heroes. I didn't. Not really. Not unless you count pro-wrestlers. They were my comic-book heroes. There were rock stars too, sure. And pro-wrestlers were rock-stars too. For a while at least. I probably started discovering them around the same time.
That's why – even though I'll probably never watch any wrestling ever again – it kinda means something to me to hear that The Ultimate Warrior has died. He was the Ultimate! When I was 12 years old he was it. There was Macho Man and Andre The Giant and Hulk Hogan and Jake "The Snake" and Brutus "The Barber" Beefcake and they all – rather sickeningly, perhaps – meant something to me. But Warrior was the ultimate.
I had the best part of two decades away from wrestling – then returned to it with some strange, vaguely journalistic curiosity. I wanted to write a feature article about how pro-wrestling was a lot like pornography – both were fantasy-versions of the real thing, the extreme end point, unobtainable and absurd. Fetishist/bullshit: guilty pleasures for many. There were strange parallels and contrasts – as the budgets got bigger for wrestling it got more absurd, pornography lost a lot of its drama and "storyline"/angles and the budgets, erm, drooped.
Anyway, I never got around to writing that article – possibly because I was the only person on the planet who thought they might like to read something like that. I did, however, revisit my childhood, rekindle a passion of sorts and start collecting up experiences, renting out old VHS tapes and new DVDs, I even interviewed a bunch of wrestlers when they came to NZ, I got a gig writing for a pro-wrestling website – I did phoners with other childhood wrestling heroes, Bret "The Hitman" Hart and Ric Flair. I always wanted to interview The Ultimate Warrior.
That never happened.
A request or two was made. Ignored at first. Later declined.
But you see I'd always followed – vaguely at least – what this Warrior character was up to. Even when I wasn't at all interested in wrestling. He was fascinating to me, because clearly the character had disappeared long ago, absorbed into Jim Hellwig's bloodstream along with all sorts of monkey-juice.
I even received a Christmas Card from him once. True. I've still got it.
He had changed his name to Warrior, legally. In fact he was called Warrior Warrior: first name, then surname. And he was mostly involved with his own website and speaking engagements. You could watch his "lectures" on YouTube. He talked giant loads of horseshit. As if steroid residue was crawling out of his mouth convinced it was dressed up preppy and looking pretty and ready for college.
He seemed a sad case. That made him absolutely fascinating.
There was the documentary about him – a hatchet job, because he was not on speaking terms with his former employees; they set out to make him look bad. They had so much to work with. Somehow, that documentary, as grinning and gurning as it was, seemed to tell the truth, or at least a truth. You could picture this nut-job through all of that.
But hey, that's all irrelevant. Because when I was 12 years old this guy was it. I watch those tapes back now – or rather, watched them back a decade or so ago – and see the full absurdity, he's like a Chippendale-as-Clydesdale, you could all but imagine he downed several ounces of horse jizz before he jerked the curtain and shook up them ring ropes.
Where the other wrestlers talked in broad clichés this guy had these off-the-hook promos about taking "the little warriors" with him on a spaceship and blasting through stratospheres and he was like some crazy, religious guy. And it was fucking wonderful. Or he just stomped and snorted. Sometimes it was hard to tell which he had settled on – the promos and interviews made no sense most of the time anyway. You could see these other big baby-type wrestlers actually looking a bit scared when they had to work with him, and the interviewers too. He could have popped at any point.
They say wrestling isn't real. He's one of the ones that took it far too seriously.
I kinda liked knowing this guy was around though.
I have that Xmas Card he sent me. What happened was: a mate bought me an Ultimate Warrior beanie as a Christmas gift a few years ago, back in 2006 it was. When I emailed him and told him thanks for the gift; good joke…he wrote back going, "did you get the card?" And I said that nah, no card from him was in there. "Not from me" he goes on to tell me. "From Warrior…"
He sends me his correspondence with Warrior. He had emailed him and chased him up. Warrior had explained that the cards had all gone out with a personal note but they had been sent separately and though there might be a delay the card would still arrive and he hoped that the recipient would still appreciate the thought that went into the message.
I did receive the card shortly after that.
Simon –
Merry Christmas and a Happy New Year!! I'm not one to "wish" or "hope", but my affirmation for you is that you will enlarge your belief in the potential your life holds. We are all Created to do something unique in our lives! The most powerful thing you can do is BELIEVE this every single moment. I will be thinking positively for you that you do!!
Always believe.
Warrior.
2006 – X-mas.
The Ultimate Warrior was inducted into the WWE's Hall of Fame this past weekend. I'm not up with the play, I'm just learning this from glancing past a couple of obituaries. But he had not been on speaking terms with the company for some time – there was legal action going on and he had fought to keep his character available so that he could wrestle again, pitifully no doubt. But anyway…
He appeared at the recent Wrestlemania 30 and the following night's TV show – this, by the way, is all just a couple of days ago as I write this.
And now he's dead. The curse of wrestling, the sickness, the attachment to the lifestyle, the pennilessness of it, the drugs, the painkillers – the worst drugs of all, it seems – the dependency on all of it, the fame that's so fleeting, so pointless, so superficial, the rush that's needed, the joke of it all – how you'll get fans, wide-eyed in wonder, so quick to justify it, but to anyone else your career and life is just a joke.
Something got him in the end. His heart probably gave out. Because his heart was more in it than just about anyone else I ever watched play that mad, daft, wonderful, stupid "sport"
R.I.P you mad bastard. For a while there – and maybe just a little bit for always – I loved what you did. Whatever the fuck it was.
Posted in Blog, Mixtapes and tagged with Eulogy, Jim Hellwig, Pro-Wrestling, R.I.P., The Ultimate Warrior, Tribute, Ultimate Warrior, Warrior, Warrior Warrior, Wrestlemania, Wrestlemania 30, WWE, WWF. RSS 2.0 feed.
« Wilko Johnson/Roger Daltrey: Going Back Home
Conrad Wedde: Space World »
6 Responses to R.I.P. The Ultimate Warrior
Very nice, Simon. 🙂
brian f says:
fantastic article 🙂
OhopeBeachBuoy says:
Excellent obit. You've captured exactly how I felt back in the 1980s as a little kid seeing this roided up freak on TV. Something to aspire to…before the veil dropped along with your balls and you realised it was all unsophisticated legerdemain.
Jack P says:
Blaxter says:
Nicely written Simon. I was in denial for a few days, maybe consumed with the 20th anniversary of Kurt's demise and Hole's 2nd album. Pro-wrestling seems just as absurd as being in a band signed to a major label. I've re-enacted WWF moves on friends trampolines and dabbled in rock'n'roll but never taken it as far as Warrior. Such a sad career that was captured in essence by Mickey Rourke in The Wrestler.
spotty says:
After this enjoyed some youtube promos of Macho Man Randy Savage who died in2011. He was absolutely fricken off the planet hilarious, so funny!Ohhhhhh Yeeeahhh


More than 50 years ago Russ Staples trekked from Kathmandu to Mount Everest in sneakers and a borrowed backpack, making him one of the earliest Americans to set foot at the 17,800 ft. basecamp.
On December 19 at 1:00 pm at the Cook Library, Russ Staples will give a book talk and Q&A answer questions about his new memoir, My Everest Odyssey. Copies of the book will be available for sale and signing.
The Tamworth native was one of the earliest trekkers to the base of Mount Everest, the world's tallest mountain. While a Peace Corps volunteer in southern India in 1967 the 22-year old set out with a borrowed backpack, $200 in his pocket and an abundance of youthful enthusiasm that would serve him well on his often-harrowing, 27-day, 400-mile journey by foot.
Unlike Everest adventures of today, Staples' 1967 hike was unsupported – the robust Everest tourism industry hadn't yet arrived in Nepal. There were no planes, no hospitals, and certainly no rescues. Instead, he relied on the generosity and kindness of rural Nepali farmers and his own grit and determination. His journey took him by ancient Buddhist monasteries, through neatly terraced fields and pristine Himalayan wilderness as he walked in the footsteps of Sir Edmund Hillary and the 1963 American expedition.
Staples' memoir is based on the journal he kept during his trek and includes incredible, never-before-published photos of an Everest and a Nepal that exist now only in the pages of history books.
Russell Staples gained his love of the mountains and hiking early in life by fishing, camping and hiking throughout the White Mountains of his native New Hampshire. A graduate of the University of New Hampshire, Russ joined the Peace Corps in 1966.
After three years as a Volunteer, then as an associate director in India, Russ returned to the States to spend a few years as a Peace Corps recruiter. He spent twelve years as Scoutmaster to the local Boy Scout troop and was a foster parent to ten boys with special needs.
After sixteen years working in the field of special education, Russ retired. He now resides in the foothills of New Hampshire's White Mountains where he is an avid gardener, hiker and fly-fishing enthusiast.


Our Companies are driven with passion and dedication.
We create experiences beyond the expected, moments filled with pride and a clear purpose of building relationships. Relationships that strengthen the link between people, brands and customers, employees and partnerships.
We create places for dialog, playfulness and for keeping the conversation alive. We do it through entertainment, activites, food, meetings and communication. We do it every day, we do it at work.


Washington (AFP) - French Finance Minister Bruno Le Maire warned on Friday that Europe was ready to hit back at any US tariffs over Airbus subsides as he pleaded for an "amicable solution" to the long-running dispute.
Le Maire had already pleaded on Tuesday for an amicable solution. And on Friday, he met US Trade Representative Robert Lighthizer and top White House economic advisor Larry Kudlow.


text:
(312) 846-1116 johnlothian@johnlothian.com
JLN News
JLN Series
Open Outcry Traders History Project
The Path to Electronic Trading
The JLN Daily Update
The Botanicals Podcast
The CryptoMarketsWik Podcast
WRITTEN SERIES
Banks, Brokers & Managed Funds
Environmental/Energy
Exchanges, OTC & Clearing
Fixed Income/Credit
Giving News
Tech/HFT
John Lothian Newsletter
JLN Options Newsletter
MarketsWiki
MarketsWiki Education
Become a MarketsWiki Editor
Advertise on JLN and MarketsWIki
Subscribe to the John Lothian Newsletter
Subscribe to the Options Newsletter
Subscribe/Pay
Subscribe to John Lothian Newsletter
difference between national and international standards
by | Dec 2, 2020
In most countries, standards have been affiliated with National Standards Bodies. National means within or across one nation. Financial Accounting Standards Board. The NFPA has few codes; most of its documents are standards. Founded on February 23, 1947, the organization promulgates worldwide proprietary industrial and commercial standards. The International Organization for Standardization widely known as ISO, is an international standard-setting body composed of representatives from various national standards organizations. Learn More, Evaluating how your products and services meet and exceed quality, safety, sustainability and performance standards. International projects reach beyond national boundaries. Further information on cookies is available in our data protection statement. Technical Barriers to Trade Part 3: Difference between standards and technical regulations A standard is a document approved through consensus by a recognized (standardization) body, that provides, for repeated and common use, rules, guidelines or characteristics for products or related processes and production methods, with which compliance is not mandatory. Any standards developed under the Australian Standard® name have been created in Australia or are adoptions of international or other standards. Accounting standards are national or international principles set in various areas of business accounting. MCA has to spell out the accounting standards applicable for companies in India. Intertek tests to the following national and international standards for Textile and Apparel, Footwear, Leathergoods and Luggage, Home Furnishings and Furniture, Appliances and Electronics, Toys and Games, Juvenile Products, Food, Hardlines, Cosmetics and Beauty, Pharmaceuticals, Chemicals: • Australia: Australian Standards (AS) • Canada: National Standard of Canada (CAN/CGSB) • European Union: European Standard (EN) • France: Association Francise de Normalisation (NF) • Germany: Deutsches Institut Für Normung (DIN) • Japan: Japanese Industrial Standard (JIS) • Mexico: Normas Officiales Mexicanas (NOMS) • Taiwan: Chinese National Standards (CNS) • UK: British Standards (BS) • United States America: American Association of Textile Chemists and Colorist (AATCC); ASTM International (ASTM); American National Standard Institute (NIST); The U.S. Consumer Product Safety Commission (CPSC) (including to new CPSIA regulations) ; American National Standard Institute (ANSI); Association of Official Analytical Chemist (AOAC); Food and Drug Administration (FDA) • International Organization for Standardization (ISO), and many others, G Mark Requirements for Electronics Imported to the Gulf Member States, Consumer Product Safety Improvement Act (CPSIA), Insight Bulletins (formerly Sparkles) Related to CPSIA. Further information on cookies is available in our data protection statement, Area guarding with two and three-dimensional sensors, CMSE® - Certified Machinery Safety Expert, Customer magazine - Receive regular information, Environmental protection and energy efficiency, PSENmag - non-contact, magnetic safety switches, PSENcode - non-contact, coded safety switches, PSENmech with guard locking - safety gate system, United States (toll-free): +1 877-PILZUSA (745-9872). De Jure Versus De Facto. The EN standards are applied at European level. They can also be developed by consortia of businesses to address a specific marketplace need, or by government departments to support regulations. Please read chapter 3.4! Standards in Europe are subdivided into what are termed A, B and C standards. National vs International . This study examines the theoretical structure of accounting in Turkey and its differences from the International Accounting Standards. Standards can be used to guarantee that products and services are fit for purpose, comparable and compatible. Whether your business is local or global, we can ensure your products meet quality, health, environmental, safety, and social accountability standards for virtually any market around the world. Until now, the TASB has issued 29 standards for the publicly traded companies and it is also preparing International Accounting Standards for the SMEs in Turkey. EN IEC or EN ISO standards are the result of these efforts. We have reviewed the curriculum frameworks for Cambridge Primary English, mathematics and science alongside the National Curriculum for England, which can be found on our website here.For each subject, there is a summary of the key similarities and differences between the two curricula and an overview of how the learning objectives relate to the National Curriculum level descriptors. Learn More. With locations in over 100 countries, Intertek tests a wide range of consumer goods to both national and international standards, helping to extend your brand's reach and recognition within the global marketplace. Access to IAASB publications is available to users who register via the IFACwebsite. Please activate the cookies of your browser to be able to use all the features of this web site. On their own, standards are voluntary. International is a derived term of national. Today, many standards are developed almost in a package as an IEC or ISO standard in co-operation with the EU via CEN and CENELEC. The standard will spell out what kind of system and how it must work. Explain the relationship between International Standards on Auditing and national standards. 73760 Ostfildern Felix-Wankel-Straße 2 The Ind AS are named and numbered in the same way as the corresponding International Financial Reporting Standards (IFRS). Through our network of over 46,000 people in 1,000 laboratories and offices in 100 countries, Intertek provides quality and safety solutions to a wide range of industries around the world. E-Mail: support@pilz.com. The series started with IAS 1, and concluded with the IAS 41, in December 2000. The adoption of international standards results in the creation of equivalent, national standards that are substantially the same as international standards in technical content, but may have (i) editorial differences as to appearance, use of symbols and measurement units, substitution of a point for a comma as the decimal marker, and (ii) differences resul… It will be seen that there are two primary differences between the standards. Standards can be developed by national, regional and international standards developing organizations and also by businesses or other organizations for their own internal use. Do you require further information? The National Curriculum of England is very common in international schools, but is very often adapted to make it more relevant to an international student population and appropriate for the host country – this may mean including relevant learning references to the country's history and culture. E-Mail: pilz.gmbh@pilz.de, Telephone: +49 711 3409 222 Pilz GmbH & Co. KG CEN: Mechanics). Learn More, Formally confirming that your products and services meet all trusted external and internal standards. National Standards These are developed either by a national standards body (like Standards Australia) or other accredited bodies. By using this web site, you agree that we set cookies. One way of looking at the differences between codes and standards is that a code tells you what you need to do, and a standards tells you how to do it. International standards may be used either by direct application or by a process of modifying an international standard to suit local conditions. 21 May 2003 The European … "International Accounting Standards Board." 1 January 2003 The IAASB made available the full text of International Standards on Auditing for free on its website and stated that all future final pronouncements would be published for free online. As IAS and IFRS are standards in the accounting practice that one adheres to in financial reporting, it is important to know the difference between IAS and IFRS. What Manufacturers Should Know as We Approach the New Year. Regional Standards. First, UL 347A addresses only the ISAs V Local Legislation. The aim is to regulate bookkeeping and accounting in relevant legal areas by means of statutory requirements, thereby standardising the process of reporting on company finances and making statements relevant and comparable. The global role of BSI as the national standards body . A series of accounting standards, known as the International Accounting Standards, were released by the IASC between 1973 and 2000, and were ordered numerically. Anyone who live in the US can participate. Enabling you to identify and mitigate the intrinsic risk in your operations, supply chains and business processes. These boundaries or divisions are not natural, but man made on the basis of perceived similarities between peoples, cultures, languages and religions. The EN standards are applied at European level. 10 Differences between Some National Standards and IFRS. The differences between standard and international project management rely on purpose, scope, stakeholders, risk intensity, and mainly, culture understanding. The second thing to understand is how standards development started in the U.S. vs other jurisdictions. The coordination of time and frequency transmissions around the world began on 1 January 1960. They are multicultural. National and International Standards for Consumer Goods. Intertek is the industry leader with over 46,000 people in 1,000 locations in over 100 countries. Germany, Telephone: +49 711 3409-0 CEN and CENELEC also divide out the standards (CENELEC: Electrical and electronic engineering. (CEN and CENELEC build the framework for all the national standards organisations in Europe.) (CEN and CENELEC build the framework for all the national standards organisations in Europe.) The tools and techniques that apply for standard projects also apply for international ones. CEN and CENELEC also divide out the standards (CENELEC: Electrical and electronic engineering. They are normally developed at the initiative of the EU by the European standards organisations CEN and CENELEC. Coordinated Universal Time (or UTC) is the primary time standard by which the world regulates clocks and time. ... standards (referred to as generally accepted accounting practice (GAAP)). International means across the globe. IFAC is not able to enforce its standards. When comparing two standards it is important to point out both the similarities and differences between them. The English Safety Compendium offers knowledge around machine safety. Whereas in the U.S., standards originally were written by what is in essence trade groups (like the National Fire Protection Association NFPA and so on). For instance, a national competition in the US means that this competition is across the US and not just one place of the US. "Standards." National Advisory Committee on Accounting Standards (NACAS) recommend these standards to the Ministry of Corporate Affairs (MCA). A code may say that a building must have a fire-alarm system. The world is divided geographically into close to 200 countries or nations. International Financial Reporting Standards Foundation. The American National Standards Institute oversees standards and conformity assessment activities in the United states. It is up to individual countries to implement the standards if they deem it appropriate. Many of these national standards have a name that begins with "BS" followed by a number. Tables 2A and 2B show a section by section comparison of UL 347A and IEC 61800-4. A significant difference between European regional standardisation and international ... International Standards, there will be Standards in which local changes have to be incorporated. It is within about 1 second of mean solar time at 0° longitude, and is not adjusted for daylight saving time.It is effectively a successor to Greenwich Mean Time (GMT).. Key Differences . Accessed May 15, 2020. The relationship between ISAs and national standards. National and International Standards for Consumer Goods. Learn More, Validating the specifications, value and safety of your raw materials, products and assets. To provide you with user-defined settings, the reminder list and the administration of the shopping basket on our web site, information on your visit is stored in cookies. Many of these national standards have a name that begins with "BS" followed by a number. The primary difference between the two systems is that GAAP is rules-based and IFRS is principles-based.This disconnect manifests itself in specific details and interpretations. As adjectives the difference between national and international is that national is of or having to do with a nation while international is of or having to do with more than one nation. The International Organization for Standardization (ISO) has developed a set of tools to help policy-makers understand the benefits of international standards, and to support increased cooperation between standards developers and policy makers.
Tubular Bells Time Signature, Palmer's Firming Butter Review, How To Use Cinnamon Sticks For Scent, Options Leverage Calculator, Cat Face Clip Art Black And White, Zulu Proverbs Pdf, Red Clover For Men,
Website Designed By JOHN LOTHIAN PRODUCTIONS
Disclaimer: All John Lothian Newsletters, JohnLothianNews.com, MarketsWiki.com, CryptoMarketsWiki.com and MarketsReformWiki.com are products of John Lothian News, a division of John J. Lothian & Company, Inc. The opinions expressed in all John J. Lothian & Company, Inc. publications are strictly those of their respective editors. They are intended solely for informative purposes and are not to be construed, under any circumstances, by implication or otherwise, as an offer to sell or a solicitation to buy or trade in any commodities or securities herein named. Information is obtained from sources believed to be reliable, but is in no way guaranteed. No guarantee of any kind is implied or possible where projections of future conditions are attempted. Security futures are not suitable for all customers. Futures and options trading involve risk. Past results are no indication of future performance. Nothing on any John J. Lothian & Company site should be considered an endorsement by any sponsor of any website or newsletter content. © 2020 John J. Lothian & Company, Inc. All Rights Reserved.


text:
Maine Forest Service helicopter helps battle Hallowell woods fire
The fire started in the trees and came within 30 feet of a home at 50 Overlook Drive.
By Charles EichackerStaff Writer
A forest ranger operating a helicopter and a few local fire departments helped knock down a blaze in the woods off Overlook Drive in Hallowell on Friday afternoon.
The fire started in the woods and came within 30 feet of a home at 50 Overlook Drive, said James Owens, chief of the Hallowell Fire Department.
A Maine Forest Service helicopter drops water on a fire off Overlook Drive in Hallowell Friday. The helicopter first pulled water from the Kennebec River and then dropped it on the fire. Photo courtesy of Laura Martz
But after the fire was reported at 1:45 p.m., firefighters were able to extinguish it before it reached the residence. They were aided by a ranger from the Maine Forest Service who used a helicopter to retrieve water from the Kennebec River, according to witnesses.
"He started to dump water on the fire before we did," Owens said. "I think he made three passes with the water bucket."
Owens did not know how the fire started and said a ranger would be investigating its causes on Saturday. The owners of the nearby home were away on a camping trip at the time of the blaze, which was mostly concentrated in the grass, he added.
Firefighters came to the scene from Hallowell, Augusta and Manchester, Owens said. Using hoses, rakes and axes, they were able to knock down the blaze in about 20 minutes. The fire was about 50 feet from the road.
Charles Eichacker — 621-5642
Twitter: @ceichacker


text:
Judicial Evaluation
Attorney of the Year
Law Firm Awards
SBWLF Donor of the Year
Join SBWL
SBWL
Tara Rengifo
SBWL PRESIDENT, SBWLF PAST-PRESIDENT
Tara Rengifo has a diverse legal practice with a focus on environmental law. She currently works as an associate attorney at Adams Broadwell Joseph & Cardozo, handling a variety of cases involving environmental laws such as the California Environmental Quality Act and other land use laws. Prior to joining the firm in August of 2021, Tara dedicated four years to the Environmental Defense Center (EDC), a non-profit environmental law firm. In addition to her legal practice at EDC, she also gained experience with coalition building, multi-sector partnerships, and communications through outreach materials, media, webinars, and public forums. Before joining EDC, Tara practiced as a civil litigator in Santa Barbara. In addition to serving as the President of SBWL and on the Foundation Board, she has served on the Board for the Santa Barbara County Bar Association and previously acted as co-editor for the Santa Barbara Lawyer Magazine. Tara graduated from the University of Maryland Carey School of Law with honors and a certificate in environmental law in 2015.
Diana Lytel Natalie Mutz


text:
Latest South Dakota News
Allen has 23 as UMKC takes down Denver 70-60
KANSAS CITY, Mo. (AP) — Shemarri Allen's 23 points helped UMKC defeat Denver 70-60 on Saturday night. Allen added nine rebounds, five assists, and four steals for the Kangaroos (10-13, 6-4 Summit League). Rayquawndis Mitchell scored 13 points, going 3 of 14 from the floor,...
South Dakota defeats St. Thomas 81-67
ST. PAUL, Minn. (AP) — Tasos Kamateros had 20 points in South Dakota's 81-67 win over St. Thomas on Saturday night. Kamateros also had nine rebounds for the Coyotes (10-12, 5-5 Summit League). Damani Hayes and Kruz Perrott-Hunt scored 13 points apiece. The Tommies...
Massner has 30, Western Illinois tops South Dakota St. in OT
MACOMB, Ill. (AP) — Trenton Massner's 30 points led Western Illinois over South Dakota State 81-73 in overtime on Saturday. The score was tied at 69 for the last 1:28 of regulation then the Leathernecks outscored the Jackrabbits 12-4 in overtime. Massner also added...
Nelson scores 36, leads North Dakota State over North Dakota
FARGO, N.D. (AP) — Grant Nelson scored 36 points to lead North Dakota State over North Dakota 91-75 on Friday night. Nelson also added seven rebounds and three blocks for the Bison (9-13, 6-4 Summit League). Boden Skunberg had 17 points and seven rebounds, while Tajavis Miller...
PIERRE, S.D. (AP) — South Dakota's Senate Republican leader said Friday that a committee will investigate a suspended senator for allegedly harassing a legislative aide during an exchange over childhood vaccines and breastfeeding. Sen. Casey Crabtree, the Senate GOP leader, had...
South Dakota's Noem breaks news conference tradition
SIOUX FALLS, S.D. (AP) — South Dakota Gov. Kristi Noem has yet to make herself available to the Capitol press during the first three weeks of the state's legislative session, breaking with a decades-old ritual of South Dakota governors holding a weekly news conference to publicly discuss their...
S. Dakota tribes seek disaster declaration in storm recovery
PIERRE, S.D. (AP) — South Dakota's congressional delegation wrote letters to President Joe Biden in support of the Pine Ridge and Rosebud reservations' requests for a major disaster declaration following winter storms that left six people dead. The declaration would assist the...
Editorial Roundup: South Dakota
Madison Daily Leader. January 25, 2023. Editorial: Can we avoid a "Santos" In S.D.? Rep. George Santos is a member of the United States House of Representatives, representing New York's Third Congressional District. He was elected on a platform of lies. This...
St. Thomas takes 60-54 victory over South Dakota State
SAINT PAUL, Minn. (AP) — Andrew Rohde had 15 points in St. Thomas' 60-54 win against South Dakota State on Thursday night. Rohde had eight assists and four steals for the Tommies (14-9, 5-5 Summit League). Ahjany Lee scored 12 points and added eight rebounds and three blocks....
Senate moves forward with child witness protections bill
PIERRE, S.D. (AP) — Child witnesses have the right to a safe courtroom, South Dakota state legislators agreed during an initial bill hearing on Thursday. The Senate Judiciary committee unanimously voted to move forward with a legal amendment that would provide extra support to...


text:
Sarcinella minor är en ringmaskart som beskrevs av Ziegler 1984. Sarcinella minor ingår i släktet Sarcinella och familjen Serpulidae. Inga underarter finns listade i Catalogue of Life.

Källor

Havsborstmaskar
minor

redpajama_set_name: RedPajamaWikipedia


Want to work at Jettainer?
We at Jettainer are highly motivated professionals, many with an airline or freight background. Profound knowledge of the industry is key to become part of our winning team.
In case you wish to explore details about these positions at Jettainer and apply, please visit the be-Lufthansa job portal. There, you will also find all other open positions within the Lufthansa Group and further information regarding recruitment.