Ladies and Gentlemen, Good evening. First of all, Matthew, my former colleague, thank you very much for your words.
Allow me to say that I am thrilled that this is my first speech as the United Nations Secretary-General's Special Advocate for Inclusive Finance for Development. A mouthful of a title. I would like to thank the Clinton Global Initiative for giving me this opportunity to speak to you tonight.
When talking about access to finance around the world, the challenges are huge. Despite some important developments over the past 10 years, over 2 billion people still do not have access to financial services, services that none of us can imagine living without. This of course means credit, which is vital for helping people to generate income. But it also means lack of access to other financial products and services that help to reduce life's uncertainties, and to protect families from unforeseeable shocks.
This is why, where we used to talk mainly of "microcredit" or "microfinance", we now speak of "inclusive finance". Inclusive finance means universal access, at a reasonable cost, to a range of financial services, provided by a variety of sound and sustainable institutions. In addition to credit, this range of financial services includes savings, mortgages, insurance, local and international money transfers, and so on.
Inclusive finance is a powerful tool, one that will help reduce poverty, empower women and contribute to the achievement of many of the Millennium Development Goals. But the question is, how can we achieve it? Or, in the spirit of the Clinton Global Initiative, who needs to do what?
That is why we are here tonight, to discuss the answers to these questions, in particular the role of innovations. But while I believe innovations are absolutely necessary, I also believe we need to focus more deliberately on some of the basics.
The first one is: poor people need vastly improved access to simple savings accounts. For a variety of reasons - despite being an obvious service - savings has not received the same level of attention or resources as credit. But research shows that it is equally as important - if not more so.
Credit instruments may not be optimum vehicles for everybody. Savings, on the other hand, affords a debt-free way to buffer against life's risks, build assets and provide opportunities for the next generation. Despite the important role of savings, only 20% of the world population has a formal savings account, meaning that 80% do not have a safe place to put their money.
We must leave behind us the myth that poor people cannot save. They just need good saving products to do so. For instance, in Rwanda, more than half a million small new savings accounts drew $40 million into circulation in 2001 when people had access to these products. Think about what this means for domestic capital growth. Think about the multiplier effect this has on the availability of credit. Think about less dependency on international capital flows and foreign aid.
Therefore, I urge all of us here today to give "access to savings" the time and attention it deserves. This case needs to be made forcefully, and in many countries, regulatory frameworks need to be adapted accordingly. Remember that much of banking regulation and supervision focuses on deposit-taking institutions.
The other "basic" issue is, that in any given country, financial inclusion needs a widely shared vision and an agreed strategy for getting there. This vision and strategy must engage the government, the country's regulators and supervisors, financial institutions (including NGO's) and even telecom providers and retailers.
This means: That the rules and regulations that act as barriers to access to finance are evaluated and removed; That potential ways to streamline processes and create effective tax structures are examined; That the legal vehicles needed to promote growth in the sector are established; and That the needed financial infrastructure investments are realized.
It seems rather obvious that I speak about having a vision and a strategy. Yet this basic building block is lacking in far too many of the world's developing countries. Therefore, I urge you to consider how you can contribute helping individual countries establish sound visions and strategies for inclusive finance. As a guideline, I leave with you these Key Messages to determine what role you could play.
Now, having made my pitch for a couple of "basics", let me now turn to the important issue of innovations.
Here, let me focus on the concept of "integrated microfinance" and the innovations necessary to reach the poorest, especially in rural areas where the challenges of poverty are the most severe.
"Integrated microfinance" means linking microfinance with other products that are strongly demanded by poor people. The most obvious and well known case involves mobile phones. Clearly, linking financial services to the rapid spread of mobile phones offers excellent prospects for increasing financial inclusion, particularly for those living for away.
Yet there are other promising examples of "integrated microfinance" helping to service poor people better. Many of the examples offer sound business opportunities for the private sector.
Just to cite an example, through microenterprise loans, BRAC in Bangladesh promotes solar energy for rural households who live in the 50,000 villages outside of the national power grid. This allows villagers to have light at night and even charge their mobile phones.
What could be more powerful than linking financial products with activities that will keep people healthy, put children in school, reduce poverty and empower women? And what could be more important than doing so in rural areas, where needs are often the greatest?
I can cite similar examples of microfinance integrated with water irrigation systems, healthy and efficient cooking stoves, water filtering systems, etc. Such solutions call for innovative "out of the box" thinking. I hope we can return to this topic in our table discussions.
Ladies and gentlemen, in closing, my mandate as Special Advocate is to guide governments, legislators, supervisors and international institutions on key issues in the development of inclusive financial sectors.
As you can imagine, a lot of work needs be done but I trust that many of you here present will play their part in achieving the ambitious goal of inclusive finance. After all, shared understanding and concrete commitments to take action are the very essence of the Clinton Global Initiative. And therefore I very much look forward to hearing your views tonight.


Activist investors are gobbling up shares of Houston-based BMC Software in an attempt to get the company to put itself up for sale.
Convex Management LP said in a regulatory filing today that it took a 1 percent stake in the company, or more than 1.5 million shares. The activist hedge fund, founded by an associate of billionaire Carl Icahn, didn't state its intentions. Today's filing showed Convex bought its shares as of March 31.
Convex's ownership came to light a day after BMC said that another investor, Elliott Associates, notified the company that it had purchased 5 percent of BMC's common stock. Earlier today, Elliott nominated five directors in its effort to force BMC to consider a sale.
Jesse Cohn, a portfolio manager at Elliott, had a "friendly meeting" with BMC management last week, according to a letter the fund filed with the Securities and Exchange Commission today. BMC's response, however, has been less cordial. Yesterday, the company adopted a poison pill anti-takeover plan.
"I was disappointed to read that the Board's response appears aimed at entrenchment rather than at exploring opportunities," Cohn wrote.
BMC's shares have risen 10 percent in the past two days as the takeover speculation intensified. But even at today's close of $44.51 the stock is trading well below its 52-week high of $56.50 from last July.
BMC has struggled with its transition from a maker of mainframe software to a information technology services company.
"The transition has become more challenging in recent years, as BMC has suffered from sluggish growth, substantial execution challenges and underperformance on its business plan, and new competitive pressures," Cohn wrote.
As a result, the market values BMC as a growth-impaired company, and Elliott believes the company's value will continue to erode if it remains independent. BMC, however, remains attractive to "multiple strategic acquirers," that include other tech companies looking to capitalize on its customer base and technology or to private equity funds that would generate a premium for the company's shareholders, Cohn wrote.
"While the company is always open to alternatives that fully reflect the value and prospects of the company, the board of directors has determined that forming a special committee and pursuing a sale at this time is not in the best interest of stockholders," the company responded in a statement.


text:
One year in a hotel
It wasn't just poor performances on the pitch that led to David Moyes' early exit from Spanish football management.
By Euan McTear
This article first appeared in Issue 1 which was published in September 2016.
he remained resident at what is regarded as one of the smartest hotels in the whole of northern Spain. Damningly, he was staying there at considerable cost to his new club.
Every September the city of San Sebastián in the Basque Country of northern Spain hosts one of the world's most prestigious film festivals. Since the festival was founded in 1952 it has premiered many Oscar-winning movies and has helped launch the careers of stars such as Pedro Almodóvar and Francis Ford Coppola. Known in the local Basque language as Donostia Zinemaldia, it is considered the premier film festival in the Spanish-speaking world, but it also screens English-language films and has over the years handed out awards to classics such as The Full Monty and Alien.
It is little surprise that the city's plushest hotel, the María Cristina, is fully booked with movie stars and directors come September time. It is nigh on impossible to reserve a room during that month unless you're involved in one of the festival's movies or if your name is Brad Pitt or Tom Hanks or Jennifer Lawrence. Or David Moyes.
Last September the María Cristina hotel was filled as usual with movie stars. Only one room escaped the influx of actors and film-makers – that of David Moyes. The Glaswegian had been staying at the hotel ever since his move to San Sebastián in November 2014, when he became coach of the city's beloved football team Real Sociedad following his sacking by Manchester United.
Moyes has said that he had been searching for an apartment from the day he arrived in the city. Ten months later he had yet to find a home; he remained resident at what is regarded as one of the smartest hotels in the whole of northern Spain. Damningly, he was staying there at considerable cost to his new club – and unsurprisingly this did not endear him to the fanbase in San Sebastián. It is not overstating things to say that Moyes' choice of address contributed to his early exit as Real Sociedad boss.
It did not help Moyes that he was arriving as manager of a team whose fans had begun to take an increasing interest in the club's accounts. They would still sing, chant and whistle the referee from the terraces like football supporters everywhere, but would become accountants in the most popular post-match bars afterwards. Fans were all too aware, therefore, of the club's upcoming £31m stadium renovation – it would be no major surprise if some knew the exact cost of every nut, bolt and screw. That is why it they found it especially controversial that Real Sociedad would contribute to Moyes' hotel bill just one year in advance of this pricey renovation.
Given how much Moyes was earning from his basic salary, many supporters of the blue and whites were baffled that their club would contribute to his hotel bill. According to France Football's annual report on player and manager wages, Moyes earned £5.1m in 2014 between his commercial deals and his Manchester United and Real Sociedad payslips, which put him joint-tenth in the world, alongside PSG's Laurent Blanc. Put simply, he could have afforded any house in the city, and fans felt he was taking one too many cookies out of the club's biscuit tin.
Moyes is not the first – and nor will he be the last – footballing personality to live in a hotel. Carlo Ancelotti never moved out of his hotel in his two years of managing Real Madrid, while Zlatan Ibrahimović famously joked about buying the Parisian hotel he was staying in when he was struggling to find a house in the French capital. Yet the difference is that Ancelotti led Real Madrid to a Champions League triumph, while Zlatan has fired his name into the PSG history books by becoming their all-time top scorer.
Moyes' Real Sociedad tenure, however, was anything but successful. No goals. No goals. No goals. That was the story of Real Sociedad's first three matches in Moyes' first full season in charge. It had not been much better the previous campaign; Real Sociedad won nine of 27 league fixtures in 2014/15 after Moyes took over. Such uninspiring performances on the pitch did not bring Moyes the unquestioning loyalty of the supporters, which meant he needed to maintain his popularity off the pitch. Staying at a posh hotel at the club's expense was never going to help.
His relationship with the San Sebastiánites had started off well. In a match against Villarreal in January, 2014 – one of his first home matches in charge – Moyes was sent off for suggesting none too subtly that the referee should have gone to Specsavers by making the familiar glasses gesture. Unfamiliar with the stadium layout, he hopped over a fence and watched the rest of the match with fans in the main stand, even accepting some cheesy crisps from a nearby fan, much to everyone's amusement and appreciation.
His initial enthusiasm for his new job was obvious for all to see. Moyes tirelessly toured the north of Spain, scouting players and opposition. Reports of him being the first one in and the last one of the club's Zubieta training ground appeared to be true and not simply the often trotted-out cliché. These were promising early signs, but the problem was that they never developed into anything more than promise.
The team's performances were a slight improvement on what had come before, making fans optimistic that further advances would arrive. However Moyes' initial enthusiasm turned out to be the peak rather than beginning of an evolution into the role.
Very quickly approval of their manager among locals faded, not helped by his continued residence at the María Cristina. A manager's relationship with a Spanish club's fanbase is as important and complex as the putting together of a Formula 1 car: it can be ripped apart by the slightest bump in the road. Unfortunately for Moyes, the hotel issue was just the first of many hiccups.
The manager started to openly criticise his players' performances. He relegated to the substitute's bench one star for addressing him as 'David'. After a while he brought in his own British backroom staff, Billy Mckinlay and Dave Billows, rather than stick with the established local coaches.
His lack of effort to learn Spanish also frustrated supporters, who took it as a sign of a lack of commitment to the club, to the league and, most significantly, to the city. No reasonable Real fan expected Moyes to learn the complex Basque language, but that he quickly gave up learning the more straightforward Spanish national tongue Castilian was poorly received. Despite beginning his Spanish lessons with great enthusiasm – even mustering up the courage to slightly awkwardly tell a press conference that some B-team players had been "training with me uno, dos, tres, cuatro times" – Moyes soon began to slack when it came to his Spanish homework and, unforgivably, his Spanish teacher eventually became no more than his interpreter.
That was when the locals at the pintxo bars in San Sebastián began to think that Moyes was giving up. In return, they began to give up on him. "He's a nice guy, but he doesn't fit in and he isn't trying to," one local bar owner told me ahead of the first home game of last season. "Moyes? He's weird," one of the bar's regulars chipped in.
If you cannot achieve results on the pitch and if you lose the support of the barmen in a city as small as San Sebastián then your days are numbered. Even if the club president has your back. Jokin Aperribay, the president who made it his mission to entice Moyes to La Liga, continued to believe in the man he had hired despite seeing the team limp meekly towards Primera División survival in Moyes' first season.
With his number one fan conveniently also being his boss, Moyes should have been able to buy himself enough time to turn results around. Because Aperribay still believed that Moyes was a long-term project, the club even tried to tackle the former Everton and Manchester United gaffer's unpopularity head on by addressing his continued stay in the hotel. In October 2015, as Tito Irazusta of local sports station Deportes Gipuzkoa explained, "Real Sociedad told Moyes that, because of the image it was giving off, he'd have to leave the Maria Cristina." A week later Moyes confirmed that he would indeed be leaving the hotel for an apartment in the centre.
For the fans it was too little, too late; 11 months too late. The anti-Moyes sentiment was irreversible and when results did not approve, Aperribay had no choice but to listen to the supporters and send Moyes on his way 363 days after his arrival.
Football is, of course, a results business and it was Moyes' 29% win percentage that ultimately pushed him towards the exit. However popular managers are often afforded a few extra lives; Moyes' poor standing among the fanbase accelerated his departure. That is why few supporters were distraught to see Moyes depart, although maybe the finance manager at the María Cristina Hotel will have been an exception. The local TV station Euskal Irrati Telebista showed an amusing sketch the week after Moyes' sacking depicting half a dozen desolate hotel workers holding a banner which read 'María Cristina Hotel Hearts Moyes'.
Nobody loved Moyes, but nobody hated him. He simply didn't fit in, and nor did he make much of an effort to do so. That sort of attitude was never going to buy Moyes much margin for error on the pitch.
Every cloud has a silver lining, though. A couple of extra celebrities can now stay in luxury at the smartest hotel in town when they attend this year's San Sebastián film festival
← Rover's return
Grounds for optimism →

redpajama_set_name: RedPajamaCommonCrawl


In this post we return to a few matters related to The Battle for Sovereign Grace. This book is very instructive in terms of what it means to be a part of the church militant here on earth, fighting the good fight of faith, not only against our own sin, but also against the continual perversion of the pure gospel, which is the church's most precious treasure. There are many in the broader ecclesiastical world today who insist that there should not be any battles within the church. Doctrinal disputes, it is often said, are needlessly divisive. Instead, the church ought to be concerned with presenting a united witness before the world, joining together to fight social injustice and the like. This is the message of the ecumenical movement, a movement which often accuses Protestant Christianity of tearing apart the body of Christ because of the proliferation of denominations following the Reformation. Many seem to find this criticism convincing, for the Ecumenical movement continues to gain significant influence within Protestant and Reformed denominations. And the result has been a widespread surrender of the distinctive truths of the gospel among which sovereign particular grace holds a preeminent place.
What does this have to do with The Battle for Sovereign Grace? The material presented in this book is the history of a very significant doctrinal battle within the sphere of Reformed Christianity that has implications for all confessional Reformed churches, not only our own denomination. As the author makes abundantly clear, the Declaration is a document of immense import, for the error of the conditional covenant is one which persists in much of the Reformed church world. However, what I want to focus on briefly is not so much the content of the declaration (which we know and love) but the example that this history lays out for us, that is, how we are to view doctrinal controversy. Although we are called to seek peace and unity, doctrinal dispute is ultimately inevitable. Due to the sinfulness and pride of man, error will not cease to arise within the church. God in His providence often employs these controversies to refine and sharpen the Church's understanding of the truth. This fact is clear, for example, in the case of the early Christological controversies from which emerged our ecumenical creeds. We ought to be very thankful for the peace and unity which we currently enjoy in our churches that is not imperiled by any serious controversy. This is a blessing from God to be sure.
In this regard, I was very impressed with how instructive this history in this book is for the present day, particularly with respect to the ecumenical movement. Ecumenism is a great threat to the purity of the Church, and it is probable that this threat will only intensify in the coming years. We live in a society, both secular and ecclesiastical, that stresses unity, tolerance of divergent opinions, and which finds doctrine and dogma distasteful. "Peace, peace" it is so often said, yet there is no peace. For those of us who have attended or are attending a Christian college, many have felt the draw of this movement which is especially popular among evangelicals of our generation. As we live in this cultural environment, it is very easy to become acclimated to its lukewarm perspective of the truth of the gospel, and as a result importance of maintaining the distinctive doctrinal standards of the Reformed faith may seem to be increasingly unimportant and irrelevant. This is something for us young people and young adults to consider, since in the coming years the mantle of leadership in the church will fall upon us, and we must have the same knowledge, courage, and strength to stand on the battle lines of truth and error as our predecessors. Will we be up to the task? We can only pray for God's strength, for of ourselves we are nothing, but by His grace we can stand immovable. The fact is that the battle for sovereign grace is an ongoing battle. The adoption of the Declaration of Principles was certainly a decisive victory. But the danger never quite disappears. Again as church history shows, old heresies never die. They resurface over and over again with a refurbished appearance and behind the cloak of new terminology. By now we have all likely heard of the federal vision, a heresy which has its source in the theology of a conditional covenant; this is just one such example of a new mutation in the genome of "salvation by works" theology.
Moreover this history has much to teach us of the cost of standing for the truth, a price which we must be ready to pay. Ultimately the Declaration's presentation of the unconditional covenant not only prevented formal ecclesiastical unity with numerous new immigrants from the Netherlands, but also it precipitated the devastating schism of 1953 in which our churches lost a substantial portion of their membership. From an Ecumenist's perspective, this was a disaster. Schism is in their view the worst possible outcome, and so egregious errors are tolerated because it is better to have divided opinion under one very broad roof. So, was it really worth it? Is the technical definition of the covenant as "unconditional" or "conditional" so important as to justify such a painful event. Our answer should be a resounding yes! Don't get me wrong, schism is terrible and undesirable. But the history of the Church shows it is necessary to preserve and develop the truth and to purify the Church from error. The Church is better because of it. As Christ said, unless one is willing to sacrifice all and take up his cross and follow Him, one is not worthy of Him. This is a very important reminder for us whenever we feel the allure of ecumenism. Our ecclesiastical unity consists of a common confession of the distinctive truth of the gospel as taught in the Scripture and summarized in the Confessions. Unity that is based on anything else is false unity. As soldiers of Christ we are called to follow the captain of our salvation, and this entails battle. Young people and young adults, are we prepared and willing to defend the truth of the gospel with same devotion as our forefathers?


Sparks flew at the Australian Grand Prix this weekend at Philip Island as Marc Marquez snatched the title from favourites Jorge Lorenzo, Valentino Rossi, and Andrea Iannone, in what could only be described as an incredibly thrilling bout.
The 22-year-old Spaniard and reigning Moto GP champion won his fifth race of the year thanks to a near-perfect final lap that saw him overtake Lorenzo on the course's final turn. Just 0.249 seconds separated the pair, and now there's a mere 11 points splitting the Yamaha riders.
The result is welcome news for Marquez, whose recent outings to Phillip Island have been marked with failure. In 2014 the racer crashed out while in first place, and in 2013 was disqualified for failing to change bikes before lap 11, thus missing his pit window. This time was different though, and a lightning-fast track record of 1:29:280 was set by the rider in the final lap, signalling to fans and pundits alike that lessons had been learned and skills had been honed.
"I didn't expect to overtake Jorge but I'm really happy with this victory because we've pushed really hard," Marquez said.
In Moto3, British rider Danny Kent is looking forward to a likely grand prix win, despite a tumultuous crash on Sunday's race that afforded Miguel Oliveira the top spot. 40 points now separate the pair, although if Kent comes in above sixth place in Malaysia, he will secure the title before the final clash in Spain.
Finally, in Moto2, Spain's Alex Rins has won the second race of his debut season. France's Johann Zarco has already claimed the season title.


No Exit has announced a crime short story competition for unpublished writers.
Are you a crime fiction aficionado? Think you have what it takes to become the next bestseller? Well, No Exit Press wants you! From 25 May - 22 June No Exit Press are opening submissions for crime fiction short stories. Your story must be no longer than 3,000 words and have the strong, compelling writing that epitomises our list, be it classic police procedural, psychological thriller or gritty noir.
If this sounds like you, then fill out the details below, attach your short story, pay the £5 submission fee and keep your fingers crossed. Be sure to read the terms and conditions!
The judges will be Ion Mills, MD of Oldcastle Books (No Exit's parent), which is 30 years old this year; author Leigh Russell; agent Annette Crossland; and author and critic Barry Forshaw.
No Exit will announce a longlist on 20 July, a shortlist on 1 September, and a winner on 1 November.


text:
"Parlez-moi d'amour" is a song written by Jean Lenoir in 1930. An English translation was written by Bruce Sievier (1894, Paris – 1953) and is known as "Speak to Me of Love" or "Tell Me About Love". Lucienne Boyer was the first singer to record the song and she made it very popular in France, America, and the rest of the world.

It was also recorded by Dalida in 1961, and it features her 1961 album, Garde-moi la dernière danse.

Caterina Valente recorded it in 1960, but she sang it with a very special timbre.

Film soundtracks
The song is sung by Constance Bennett on a film set in What Price Hollywood? (1932). It is heard in one of the early scenes of Casablanca (1942), played on Sam's piano when Ingrid Bergman first appears in Rick's Cafe. It also appears in One Way Passage (1932) as an orchestration on the soundtrack as a steward brings drinks to Frank McHugh and Aileen McMahon in their cabin.

"Speak to Me of Love" was recorded by Barbra Streisand on her 1966  "Je M'Appelle Barbra" LP, using both French and English lyrics.

A modern arrangement by Mark Isham is featured in the Alan Rudolph film, The Moderns (1988); it is sung by CharlElie Couture. The song is featured prominently in the 1998 American film The Impostors and in Woody Allen's Midnight in Paris (2011).

Lyrics
{Refrain}

Parlez moi d'amour
Redites-moi des choses tendres
Votre beau discours
Mon coeur n'est pas las de l'entendre
Pourvu que toujours
Vous répétiez ces mots suprêmes:
Je vous aime

Vous savez bien
Que dans le fond je n'en crois rien
Mais cependant je veux encore
Ecouter ces mots que j'adore
Votre voix aux sons caressants
Qui les murmure en frémissant
Me berce de sa belle histoire
Et malgré moi je veux y croire

{Refrain}

Il est si doux
Mon cher trésor d'être un peu fou
La vie est parfois trop amère
Si l'on ne croit pas aux chimères
Le chagrin est vite apaisé
Et se console d'un baiser
Du Coeur on guerit la blessure
Par un serment qui le rassure

{Refrain}

References

1930 songs
French songs
Lucienne Boyer songs
Caterina Valente songs
Jeanette MacDonald songs

redpajama_set_name: RedPajamaWikipedia


Six CF-18 Hornet aircraft of the Royal Air Force of Canada and their flight and technical personnel arrive at the 71st Air Base of Câmpia Turzii, today, around 17.00.
The Canadian troops will participate in training exercises and activities with the Romanian troops.
Journalists interested in participating in the activity are expected to arrive at the base headquarters (1 Aerodromului St.), from 16.15.


text:
Smriti Mandhana
Full name: Smriti Shriniwas Mandhana
Born: 18th July 1996, Bombay (now Mumbai), Maharashtra, India
Teams: India Women (Women's International Twenty20: 2012/13-2019/20);
India Women (Women's ODI: 2012/13-2019/20);
India Women (Women's Test: 2014-2014/15);
Maharashtra Women (Women's List A: 2010/11-2017/18);
Maharashtra Women (Women's Twenty20: 2010/11-2018/19);
Brisbane Heat Women (Women's Twenty20: 2016/17);
Western Storm (Women's Twenty20: 2018-2019);
Hobart Hurricanes Women (Women's Twenty20: 2018/19);
Wisden Leading Woman Cricketer in the World: 2019
Wisden India Cricketer of the Year: 2019
Articles: Suzie Bates scoops ICC Women's ODI and T20I Player of the Year awards
Pictures: Smriti Mandhana
Women's Test Career Batting and Fielding (2014-2014/15)
M I NO Runs HS Ave 100 50 SRate Ct
India Women 2 3 0 81 51 27.00 0 1 43.54 0
Women's ODI Career Batting and Fielding (2012/13-2019/20)
India Women 51 51 4 2025 135 43.08 4 17 84.41 17
Women's International Twenty20 Career Batting and Fielding (2012/13-2019/20)
India Women 75 73 5 1716 86 25.23 0 12 119.41 18
Women's First-Class Career Batting and Fielding (2014-2014/15)
Overall 6 8 1 299 109 42.71 1 2 43.33 1
Women's First-Class Career Bowling (2014/15)
West Zone Women 6 0 4 0 0-4 4.00
Women's List A Career Batting and Fielding (2010/11-2019/20)
M I NO Runs HS Ave 100 50 SRate Ct St
Overall 120 120 10 4426 155 40.23 6 34 74.38 40 1
Women's List A Career Bowling (2010/11-2019/20)
Balls Mdns Runs Wkts BB Ave 4wI 5wI SRate Econ
Overall 60 2 41 2 1-13 20.50 0 0 30.00 4.10
Women's Twenty20 Career Batting and Fielding (2010/11-2020/21)
Overall 166 161 16 4141 102 28.55 1 27 121.79 52
Women's Twenty20 Career Bowling (2016/17)
Brisbane Heat Women 28 0 18 3 2-6 6.00 0 0 9.33 3.85
Women's Big Bash League Career Batting and Fielding (2016/17-2018/19)
Overall 25 23 2 407 69 19.38 0 2 129.61 8
Women's Big Bash League Career Bowling (2016/17)
Kia Super League Career Batting and Fielding (2018-2019)
Western Storm 21 20 2 689 102 38.27 1 4 158.02 7


text:
#include "mirtk/ClosestPointLabel.h"

#include "mirtk/Math.h"
#include "mirtk/Array.h"
#include "mirtk/Queue.h"
#include "mirtk/UnorderedMap.h"
#include "mirtk/UnorderedSet.h"
#include "mirtk/EdgeTable.h"
#include "mirtk/Parallel.h"
#include "mirtk/Profiling.h"
#include "mirtk/PointSetUtils.h"
#include "mirtk/VtkMath.h"

#include "vtkNew.h"
#include "vtkSmartPointer.h"
#include "vtkPointData.h"
#include "vtkCellData.h"
#include "vtkDataArray.h"
#include "vtkIdTypeArray.h"
#include "vtkFloatArray.h"
#include "vtkIdList.h"
#include "vtkOctreePointLocator.h"

namespace mirtk {

// =============================================================================
// Auxiliaries
// =============================================================================

namespace ClosestPointLabelUtils {

// -----------------------------------------------------------------------------
/// Determine number of distinct labels
int NumberOfLabels(vtkDataArray *labels, Array<int> &labelSet, UnorderedMap<int, int> &labelPos)
{
  UnorderedSet<int> uniqueLabelSet;
  for (vtkIdType i = 0; i < labels->GetNumberOfTuples(); ++i) {
    uniqueLabelSet.insert(labels->GetComponent(i, 0));
  }
  int idx = 0;
  labelSet.reserve(uniqueLabelSet.size());
  labelPos.clear();
  for (UnorderedSet<int>::const_iterator i = uniqueLabelSet.begin(); i != uniqueLabelSet.end(); ++i, ++idx) {
    labelSet.push_back(*i);
    labelPos[*i] = idx;
  }
  return static_cast<int>(labelSet.size());
}

// -----------------------------------------------------------------------------
struct ComputeClosestLabeledPoints
{
  vtkPointSet      *_DataSet;
  EdgeTable        *_EdgeTable;
  const Array<int> *_LabelSet;
  vtkDataArray     *_Labels;
  vtkDataArray     *_MinDistance;
  vtkDataArray     *_ClosestPoint;

  bool IsBoundaryPoint(int ptId, int label) const
  {
    const int *adjPtId, *adjPtEnd;
    for (_EdgeTable->GetAdjacentPoints(ptId, adjPtId, adjPtEnd); adjPtId != adjPtEnd; ++adjPtId) {
      if (static_cast<int>(_Labels->GetComponent(*adjPtId, 0)) != label) return true;
    }
    return false;
  }

  void Initialize(int c, Queue<int> &active) const
  {
    const int label = _LabelSet->at(c);
    while (!active.empty()) active.pop();
    for (vtkIdType ptId = 0; ptId < _DataSet->GetNumberOfPoints(); ++ptId) {
      if (static_cast<int>(_Labels->GetComponent(ptId, 0)) == label) {
        _ClosestPoint->SetComponent(ptId, c, ptId);
        _MinDistance ->SetComponent(ptId, c, .0);
        if (IsBoundaryPoint(ptId, label)) active.push(static_cast<int>(ptId));
      } else {
        _ClosestPoint->SetComponent(ptId, c, -1.0);
        _MinDistance ->SetComponent(ptId, c, numeric_limits<double>::infinity());
      }
    }
  }

  void operator ()(const blocked_range<int> &re) const
  {
    double p1[3], p2[3], curDistance, minDistance, newDistance;
    int ptId, closestPtId;
    Queue<int> active;
    UnorderedMap<int, int>::const_iterator it;
    const int *adjPtId, *adjPtEnd;

    for (int c = re.begin(); c != re.end(); ++c) {
      Initialize(c, active);
      while (!active.empty()) {
        ptId = active.front(), active.pop();
        _DataSet->GetPoint(ptId, p1);
        minDistance = _MinDistance ->GetComponent(ptId, c);
        closestPtId = static_cast<int>(_ClosestPoint->GetComponent(ptId, c));
        for (_EdgeTable->GetAdjacentPoints(ptId, adjPtId, adjPtEnd); adjPtId != adjPtEnd; ++adjPtId) {
          curDistance = _MinDistance->GetComponent(*adjPtId, c);
          if (curDistance <= minDistance) continue;
          _DataSet->GetPoint(*adjPtId, p2);
          newDistance = minDistance + vtkMath::Distance2BetweenPoints(p1, p2);
          if (curDistance <= newDistance) continue;
          _ClosestPoint->SetComponent(*adjPtId, c, closestPtId);
          _MinDistance ->SetComponent(*adjPtId, c, newDistance);
          active.push(*adjPtId);
        }
      }
    }
  }
};

// -----------------------------------------------------------------------------
struct FindClosestLabeledPoints
{
  vtkPoints                    *_TargetPoints;
  vtkDataArray                 *_TargetLabels;
  vtkAbstractPointLocator      *_Source;
  const UnorderedMap<int, int> *_LabelIndex;
  vtkDataArray                 *_ClosestPoint;
  Array<int>                   *_SourceIndex;
  Array<double>                *_Distance;

  void operator ()(const blocked_range<vtkIdType> &re) const
  {
    int label;
    double p1[3], p2[3];
    vtkIdType closestPtId;
    UnorderedMap<int, int>::const_iterator it;
    for (vtkIdType ptId = re.begin(); ptId != re.end(); ++ptId) {
      label = static_cast<int>(_TargetLabels->GetComponent(ptId, 0));
      it = _LabelIndex->find(label);
      if (it == _LabelIndex->end()) {
        (*_SourceIndex)[ptId] = -1;
      } else {
        _TargetPoints->GetPoint(ptId, p1);
        closestPtId = _Source->FindClosestPoint(p1);
        closestPtId = static_cast<vtkIdType>(_ClosestPoint->GetComponent(closestPtId, it->second));
        (*_SourceIndex)[ptId] = static_cast<int>(closestPtId);
        _Source->GetDataSet()->GetPoint(closestPtId, p2);
        (*_Distance)[ptId] = vtkMath::Distance2BetweenPoints(p1, p2);
      }
    }
  }
};

// -----------------------------------------------------------------------------
/// Label points based on simple majority voting of neighboring cell labels
struct ConvertCellLabelsToPointLabels
{
  vtkPointSet  *_DataSet;
  vtkDataArray *_CellLabels;
  vtkDataArray *_PointLabels;

  void operator ()(const blocked_range<vtkIdType> &re) const
  {
    UnorderedMap<int, int> count;
    UnorderedMap<int, int>::iterator it;
    int label, maxcount;

    vtkNew<vtkIdList> cellIds;
    for (vtkIdType ptId = 0; ptId < _DataSet->GetNumberOfPoints(); ++ptId) {
      _DataSet->GetPointCells(ptId, cellIds.GetPointer());
      count.clear();
      for (vtkIdType i = 0; i < cellIds->GetNumberOfIds(); ++i) {
        label = static_cast<int>(_CellLabels->GetComponent(cellIds->GetId(i), 0));
        it = count.find(label);
        if (it != count.end()) ++it->second;
        else count[label] = 1;
      }
      maxcount = 0;
      for (it = count.begin(); it != count.end(); ++it) {
        if (it->second > maxcount) {
          _PointLabels->SetComponent(ptId, 0, it->first);
          maxcount = it->second;
        }
      }
    }
  }
};

// -----------------------------------------------------------------------------
vtkSmartPointer<vtkDataArray> CellLabelsToPointLabels(vtkPointSet *dataset, vtkDataArray *cellLabels)
{
  vtkSmartPointer<vtkDataArray> pointLabels;
  pointLabels.TakeReference(cellLabels->NewInstance());
  pointLabels->SetName("Labels");
  pointLabels->SetNumberOfComponents(1);
  pointLabels->SetNumberOfTuples(dataset->GetNumberOfPoints());
  ConvertCellLabelsToPointLabels convert;
  convert._DataSet     = dataset;
  convert._CellLabels  = cellLabels;
  convert._PointLabels = pointLabels;
  parallel_for(blocked_range<vtkIdType>(0, dataset->GetNumberOfPoints()), convert);
  return pointLabels;
}

// -----------------------------------------------------------------------------
void UpdateClosestLabeledPoints(const RegisteredPointSet        *target,
                                const RegisteredPointSet        *source,
                                vtkSmartPointer<vtkIdTypeArray> &closest_points,
                                UnorderedMap<int, int>          &label_pos)
{
  if (closest_points) closest_points->Initialize();
  else closest_points = vtkSmartPointer<vtkIdTypeArray>::New();
  // Get source point labels
  vtkSmartPointer<vtkDataArray> targetLabels, sourceLabels;
  targetLabels = GetArrayByCaseInsensitiveName(target->PointSet()->GetPointData(), "labels");
  if (!targetLabels) {
    vtkDataArray *cellLabels = GetArrayByCaseInsensitiveName(target->PointSet()->GetCellData(), "labels");
    if (cellLabels) targetLabels = CellLabelsToPointLabels(target->PointSet(), cellLabels);
  }
  sourceLabels = GetArrayByCaseInsensitiveName(source->PointSet()->GetPointData(), "labels");
  if (!sourceLabels) {
    vtkDataArray *cellLabels = GetArrayByCaseInsensitiveName(source->PointSet()->GetCellData(), "labels");
    if (cellLabels) sourceLabels = CellLabelsToPointLabels(source->PointSet(), cellLabels);
  }
  if (targetLabels == NULL || sourceLabels == NULL) {
    cerr << "ClosestPointLabel::Update: Missing data array named \"Labels\" (case insensitive)" << endl;
    exit(1);
  }
  Array<int> labelSet;
  const int nlabels = NumberOfLabels(sourceLabels, labelSet, label_pos);
  if (nlabels == 0) return;
  // Build edge table from source mesh
  MIRTK_START_TIMING();
  EdgeTable sourceEdges(source->PointSet());
  MIRTK_DEBUG_TIMING(5, "building the edge table");
  // Determine closest points to each label
  MIRTK_RESET_TIMING();
  vtkSmartPointer<vtkFloatArray> minDistance = vtkSmartPointer<vtkFloatArray>::New();
  minDistance->SetName("MinDistance");
  minDistance->SetNumberOfComponents(nlabels);
  minDistance->SetNumberOfTuples(source->NumberOfPoints());
  closest_points->SetName("ClosestPointId");
  closest_points->SetNumberOfComponents(nlabels);
  closest_points->SetNumberOfTuples(source->NumberOfPoints());
  ComputeClosestLabeledPoints init;
  init._DataSet      = source->PointSet();
  init._Labels       = sourceLabels;
  init._EdgeTable    = &sourceEdges;
  init._LabelSet     = &labelSet;
  init._MinDistance  = minDistance;
  init._ClosestPoint = closest_points;
  parallel_for(blocked_range<int>(0, nlabels), init);
  MIRTK_DEBUG_TIMING(5, "distance transform for each label");
}

// -----------------------------------------------------------------------------
/// Find corresponding source points with label identical to the one of the target point
void UpdateCorrespondences(const RegisteredPointSet     *target,
                           const RegisteredPointSet     *source,
                           vtkIdTypeArray               *closest_points,
                           const UnorderedMap<int, int> &label_pos,
                           Array<int>                   &cor,
                           Array<double>                &distance)
{
  MIRTK_START_TIMING();
  cor     .resize(target->NumberOfPoints(), -1);
  distance.resize(target->NumberOfPoints(), .0);
  vtkSmartPointer<vtkOctreePointLocator> octree = vtkSmartPointer<vtkOctreePointLocator>::New();
  octree->SetDataSet(source->PointSet());
  octree->BuildLocator();
  FindClosestLabeledPoints find;
  find._TargetPoints = target->Points();
  find._TargetLabels = GetArrayByCaseInsensitiveName(target->PointSet()->GetPointData(), "labels");
  find._ClosestPoint = closest_points;
  find._LabelIndex   = &label_pos;
  find._Source       = octree;
  find._SourceIndex  = &cor;
  find._Distance     = &distance;
  parallel_for(blocked_range<vtkIdType>(0, target->NumberOfPoints()), find);
  MIRTK_DEBUG_TIMING(5, "update of point correspondences");
}

} // namespace ClosestPointLabelUtils
using namespace ClosestPointLabelUtils;

// =============================================================================
// Construction/Destruction
// =============================================================================

// -----------------------------------------------------------------------------
ClosestPointLabel::ClosestPointLabel()
{
}

// -----------------------------------------------------------------------------
ClosestPointLabel::ClosestPointLabel(const ClosestPointLabel &other)
:
  ClosestPoint(other),
  _TargetComponent(other._TargetComponent),
  _SourceComponent(other._SourceComponent)
{
  if (other._TargetIds) {
    _TargetIds = vtkSmartPointer<vtkIdTypeArray>::New();
    _TargetIds->DeepCopy(other._TargetIds);
  }
  if (other._SourceIds) {
    _SourceIds = vtkSmartPointer<vtkIdTypeArray>::New();
    _SourceIds->DeepCopy(other._SourceIds);
  }
}

// -----------------------------------------------------------------------------
PointCorrespondence *ClosestPointLabel::NewInstance() const
{
  return new ClosestPointLabel(*this);
}

// -----------------------------------------------------------------------------
ClosestPointLabel::~ClosestPointLabel()
{
}

// -----------------------------------------------------------------------------
ClosestPointLabel::TypeId ClosestPointLabel::Type() const
{
  return TypeId::ClosestPointLabel;
}

// =============================================================================
// Correspondences
// =============================================================================

// -----------------------------------------------------------------------------
void ClosestPointLabel::Init()
{
  if (_FromTargetToSource) {
    UpdateClosestLabeledPoints(_Target, _Source, _SourceIds, _SourceComponent);
  }
  if (_FromSourceToTarget) {
    UpdateClosestLabeledPoints(_Source, _Target, _TargetIds, _TargetComponent);
  }
}

// -----------------------------------------------------------------------------
void ClosestPointLabel::Initialize()
{
  // Initialize base class
  ClosestPoint::Initialize();

  // Initialize this class
  ClosestPointLabel::Init();
}

// -----------------------------------------------------------------------------
void ClosestPointLabel::Reinitialize()
{
  // Reinitialize base class
  ClosestPoint::Reinitialize();

  // Reinitialize this class
  ClosestPointLabel::Init();
}

// -----------------------------------------------------------------------------
void ClosestPointLabel::Update()
{
  // Update point features
  PointCorrespondence::Update();

  // Find closest points with identical label
  if (_FromTargetToSource) {
    UpdateCorrespondences(_Target, _Source, _SourceIds, _SourceComponent, _SourceIndex, _SourceDistance);
  }
  if (_FromSourceToTarget) {
    UpdateCorrespondences(_Source, _Target, _TargetIds, _TargetComponent, _TargetIndex, _TargetDistance);
  }
}

} // namespace mirtk

redpajama_set_name: RedPajamaGithub


text:
If you are seeking Pro Bono assistance, CILEx has put together a list of Pro Bono charities where you may be able to find help.
What is Pro Bono?
The term 'pro bono' comes from the Latin phase 'pro bono publico' which simply translated means 'for the public good'.
Pro Bono work is legal work lawyers undertake without receiving payment. It can take the form of giving advice at drop in clinics, helping a charity with a piece of legal work or agreeing to represent someone in court.
Doing Pro Bono work offers lawyers many different benefits. Besides giving you the opportunity to give something back to your community, you can also develop your legal skills and knowledge in your area of work, or get involved in new areas of work.
A Pro Bono Protocol has been developed to quality mark Pro Bono work and ensure lawyers give an equal level of care, attention and priority to Pro Bono work as would apply to paid work.
What about Legal Aid?
Pro bono work is not a replacement for a properly funded legal aid system. CILEx and the CILEx Pro Bono Trust firmly believe that government has a responsibility to ensure that everyone has access to good quality legal advice and representation even if they cannot afford to pay for it. Nevertheless there will always be some gaps and many community and charitable organisations have limited resources which would be better applied to their real aims rather than spent on legal fees. Pro Bono aims to fill those gaps while continuing to campaign for a better legal aid system.
Pro Bono Week 2020
Pro Bono Week will take place this year from 2 to 6 November 2020, returning for it's 19th year to the traditional timing of the first full week of November.
Pro Bono Week provides an opportunity to encourage and recognise the voluntary contribution of lawyers in giving free legal help to those in need.
Resources and updates are at National Pro Bono Centre.
Where to Find Pro Bono Help
CILEx works in partnership with and supports other Pro Bono projects and services, however CILEx is unable to provide or arrange any Pro Bono help directly to members of CILEx or the general public. At present, CILEx does not maintain insurance nor any register of volunteers for the provision of such general services.
If you are looking for help with a problem, the best thing would be to contact your local Citizens Advice Bureau or Law Centre who will be able to direct you to someone who can help or refer you to Pro Bono providers such as LawWorks, Advocate or the Free Representation Unit.


Brioni has selected legendary actor Sir Anthony Hopkins to front its upcoming fall ads. The black-and-white portraits were photographed in Los Angeles by Gregory Harris.
The veteran star's striking photos will first appear on airport billboards in Rome, at Milan airport Malpensa, and in Beijing on 1 September (17), WWD reports. Marketing imagery will then be rolled out in business and financial newspapers across the U.K., U.S., Germany, and Japan.
Anthony has long been a fan of Brioni, wearing the label at the premiere of Transformers: The Last Knight in Chicago last month.
Brioni's ad includes the tagline of "Tailoring Legends since 1945" – the date the company was founded in Rome – and the polished, sleek photos emphasize the house's tailoring expertise.


text:
DREW GENTLE / ABOUT DREW GENTLE
Drew Gentle, originally from Los Angeles, received his BFA from Chouinard Art Institute (now California Institute of the Arts). His notable 50-year career as an animation artist included studio work for Disney & Hanna-Barbera, among many others.
Over the course of his career, he developed a reputation as a multi-skilled animation artist, becoming known as a top echelon conceptual designer, working from a script to create the "look" of new shows, constantly in demand for theatrical animated movies, direct-to-video features, and T.V. shows.
His credits include The Flintstones, Batman, Scooby-Doo, Bugs Bunny, The Smurfs, Yogi BearJohnny Quest, The Land Before Time, Teenage Mutant Ninja Turtles and Family Guy, as well as animated feature versions of King Kong, The King and I, and the Care Bears Feature.
While working for the studios, Drew unwound from the rigors of animation work by "playing" with abstract figurative personas, keeping hundreds of these drawings in notebooks. 30 years later, this trove of drawings forms the basis for his large print series & for paintings & sculpture.
After his career in animation ended, Gentle returned to his original impulse of creating fine art. Drew says "I had a full and wonderfully rewarding career in animation, something I can feel very good about, but by the time it ended, I was more than ready to do so . . . and I had a serious passion to do my own art."
Drew arrived in Eureka Springs in the summer of 2007, where he
draws, paints and sculpts, exhibiting his work in various galleries, group
& solo shows.


text:
Q: Proof that Epicycloids are Algebraic Curves? Epicycloids are most commonly described by the parametric equations,
$x(t) = (R + a)\cos(t) – a \cos \left(\frac{R + a}{a} t \right),$
$y(t) = (R + a)\sin(t) – a \sin \left(\frac{R + a}{a} t \right).$
Where $R$ is the radius of the fixed circle and $a$ is the radius of the rolling circle.
With $R = ka$ we also have,
$x(t) = a[(k + 1)\cos(t) - \cos((k + 1)t)],$
$y(t) = a[(k + 1)\sin(t) - \sin((k + 1)t)].$
Several books discussing epicycloids mention that if the ratio of the radii of the circles $\left( \frac{R}{a} = k \right)$ is rational, then they are algebraic curves. However, I've only been able to find the Cartesian equations for the cardioid, nephroid and ranunculoid. With the cardioid being,
$(ax + x^2 + y^2)^2 = a^2(x^2 + y^2).$
The nephroid,
$(-4a^2 + x^2 + y^2)^3 = 108a^4y^2.$
And the ranunculoid,
$-52521875a^{12} – 1286250a^{10} (x^2 + y^2) – 32025a^8 (x^2 + y^2)^2 + 93312a^7 (x^5 – 10x^3y^2 + 5xy^4) – 812a^6 (x^2 + y^2)^3 – 21a^4 (x^2 + y^2)^4 – 42a^2(x^2 + y^2)^5 + (x^2 + y^2)^6 = 0.$
Clearly this doesn't cover all epicycloids where $\frac{R}{a}$ is rational.
What is the proof that shows that epicycloids, where the ratio of the radii are rational, are algebraic curves?

A: If the number is rational, using multiplication formulas for $\cos$ and $\sin$ you can express the original parametrization in terms of $\cos$ and $\sin$ of multiples of a single argument. Then you can use a rational parametrization of the circle to replace those $\cos$ and $\sin$ by rational functions of the parameters, and then you can eliminate the parameter.
The following Mathematica code does this:
R = 1;
a = 4;
u[t_] := (R + a) Cos[t] - a Cos[(R + a) t/a];
v[t_] := (R + a) Sin[t] - a Sin[(R + a) t/a];
Eliminate[
    TrigExpand[{x - u[t] == 0, y - v[t] == 0}
       /. t -> a s]
       /. {Cos[s] -> (1 - m^2)/(1 + m^2), Sin[s] -> 2 m/(1 + m^2)},
    {m}
    ]

With $R=1$ and $a=3$, we get the equation
$$x^8+x^6 \left(4 y^2-84\right)+x^4 \left(6 y^4-252 y^2+1974\right)+x^2 \left(4 y^6-252 y^4+3948
   y^2-10612\right)+13824 x=-y^8+84 y^6-1974 y^4+10612 y^2+5103$$
With $R=1$ and $a=4$,
$$x^{10}+x^8 \left(5 y^2-180\right)+x^6 \left(10 y^4-720 y^2+10710\right)+x^4 \left(10 y^6-1080
   y^4+32130 y^2-231060\right)+x^2 \left(5 y^8-720 y^6+32130 y^4-462120 y^2+1230705\right)-1600000
   x=-y^{10}+180 y^8-10710 y^6+231060 y^4-1230705 y^2-58982$$

redpajama_set_name: RedPajamaStackExchange


The Dedalus Group, one of the first Italian companies in the production of healthcare software production and organization, was the main focus at the Digital Innovation Award in Healthcare of the Polytechnic of Milan, which took place on the 12th of May. The computer module for the management of the University Hospital of Verona, in collaboration with the Dcare Dedalus Group through the solution Dcare Warehouse System, has won the first prize awarded by the Digital Innovation Observatory of Healthcare, which aims to promote the best projects of the Italian healthcare, able to use digital technologies as a lever for innovation and improvement.
The participation in this result represents an important and further recognition for Dedalus, a company with over 1,000 employees including 250 in foreign locations and a turnover over 80 million, which has always focused on innovation and quality of its human resources to make products more capable of making the most efficient health and with less waste.
In this case it is a mobile computing platform that allows to track goods at different stages. This system allows the streamlining of activities for operators, an optimized management of the warehouse, with the decrease of stocks and expired drugs and devices, the ability to track the movements of the trucks and 32 operating rooms, monitoring precisely the flow of stock and allowing the investigation of actual consumption in the operating theater material.
"We are proud of these statement" - said Giorgio Moretti President of Dedalus - "because it underscores our commitment to create and develop software increasingly able to meet the needs of health care companies and hospitals and therefore able to offer better and more efficient services to citizens ".


text:
Q: How to compare all the letters in for anagrams in Java In the for loop i want to compare letter by letter in the first word to all of the letters in the second word. I thought about putting it into alphabetical order but i think that's against the rules.
import java.util.*;

public class Anagrams{

public static void main (String [ ] arg){

    Scanner Scan = new Scanner (System.in);
    //ask for thingss...am i allowed to use scanner?

    System.out.println("enter the first word");
    String word1 = Scan.nextLine().toLowerCase();

    System.out .println("enter the second word");
    String word2 = Scan.nextLine().toLowerCase();

    //make into string builder

    StringBuilder ThisWord = new StringBuilder ("");
    ThisWord.append(word1);

    StringBuilder ThatWord = new StringBuilder ("");
    ThatWord.append(word2);

    //do the booleanssss

    boolean lnth = true;
    boolean found = false;

    //see if they the same length
    if(ThisWord.length() != ThatWord.length())
    {
        lnth = false;
        System.out.println("sorry sis, "+ThatWord+" and "+ThisWord+" not the same length");
    }
    else
    {
        outerloop:
        for (int i = 0; i < ThisWord.length(); i++)
        {
        for (int j = 0; i < ThatWord.length(); i++)
            {
            found = false;

            if(ThisWord.charAt(i) == ThatWord){
                ThatWord.deleteCharAt(j);
                found = true;
                break;
            }
            else{
                System.out.println(ThisWord+" and "+ThatWord+" not anagrams - letters do not match");
                found = false;
                break outerloop;
            }

            }

        }
    }

A: Can we use something like this:
public class Anagrams
{
    public static void main(String[] args)
    {
        System.out.println(checkAnagram("abc","cba"));
        System.out.println(checkAnagram("abca","cba"));
        System.out.println(checkAnagram("abd","cba"));
        System.out.println(checkAnagram("otp","pot"));
        System.out.println(checkAnagram("poo","oop"));
    }

    private static boolean checkAnagram(String first, String second)
    {
        if(first.length()!=second.length())
            return false;
        int []  alphabet = new int [26];
        for(int i= 0;i< first.length();i++ )
        {
            alphabet[first.charAt( i ) - 97]++;
            alphabet[second.charAt( i ) - 97]++;
        }

        for(int i =0 ;i< alphabet.length;i++)
        {
            if(alphabet[i] % 2!=0)
            {
               return false;
            }
        }
        return  true;

    }
}

A: Few methods you can consider
Method 1 -
Sorting the strings via the alphabet and then comparing them.
Method 2-
Creating a helper array. For each character in the first string you
would increment the value in the array[charValue] by 1. For each character in the
second string you would decrements the value in the array[charValue].
If it is an anagram you would get an array that will be filled with zeros at the end.
Method 3-
iterating characters of the first string and removing the character from the second string when found. If str2.isEmpty () -> Anagram.

A: One solution might be to assign prime numbers to the letters of the alphabet (let's say these, where the first column should be the characters in the alphabet and the other are the primes obviously). Put these in a HashMap<Character, Integer>. Let's call it PRIME_MAP. It should look like a -> 2, b -> 3, c -> 5, ...
You create 2 for cycles. In each, you iterate through ThisWord and ThatWord respectively.
You create a product from the letters of the words like so:
int thisWordProduct = 1;
for(int i = 0; i < ThisWord.length(); i++) {
    thisWordProcuct *= PRIME_MAP.get(thisWordProduct.charAt(i);
}

And similarly for the other.
If the 2 products are equal, the 2 words are anagrams.
This solution might be a bit more abstract then the others suggested, but this should be more optimal then nested loops

A: *

*The method László mentioned is the fastest. Pair the letters of the alphabet with prime numbers:

HashMap<Character, Integer> alphabet = new HashMap<Character, Integer>();
    //assign prime numbers to alphabet
    alphabet.put('a', 1);
    alphabet.put('b', 2);
    alphabet.put('c', 3);
    alphabet.put('d', 5);
    alphabet.put('e', 7);
    alphabet.put('f', 11);
    alphabet.put('g', 13);
    alphabet.put('h', 17);
    alphabet.put('i', 19);
    alphabet.put('j', 23);
    alphabet.put('k', 29);
    alphabet.put('l', 31);
    alphabet.put('m', 37);
    alphabet.put('n', 41);
    alphabet.put('o', 43);
    alphabet.put('p', 47);
    alphabet.put('q', 53);
    alphabet.put('r', 59);
    alphabet.put('s', 61);
    alphabet.put('t', 67);
    alphabet.put('u', 71);
    alphabet.put('v', 73);
    alphabet.put('w', 79);
    alphabet.put('x', 83);
    alphabet.put('y', 89);
    alphabet.put('z', 97);

*Loop through both strings and find the product of their letters. If the product is the same for both then the strings are anagrams. Here's the method:

public static boolean anagram(String str1, String str2) {
        if(str1.length() != str2.length())
            return false;

        int str1product = 1;
        int str2product = 1;

        for(int i = 0; i < str1.length(); i++) {
            str1product *= alphabet.get(str1.charAt(i));
            str2product *= alphabet.get(str2.charAt(i));
        }

        return (str1product == str2product);
}


The last couple of months, I have been amazed about the Raspberry Pi. I won't go into great detail on this wonderful device, other than the obvious.
So, the device itself is just screaming for some interesting projects, interfacing with stuff that normally are not integrated with your IT stack. I've tried it out in a few different ways already, and I've bought a handful of devices. One of them has a fixed position, connected to my TV, running XBMC.
Well, let's go back a few years in time. Quite many years, will say. Back to the days when I had just started growing a beard, and was just that naïve that only youngsters freshly out of high-school can be. I headed off to university and one of the first day of the introduction week we went to the student pub. There I saw one of the coolest things since the invention of sliced bread, a pedestrian crossing light.
Normally, such thing would not leave that much of an impression with me, but this one was special. Our own student pub was one of three student pubs in the same basement corridor. But there was only one WC. In principle, this was not a problem early in the evening, but as the night went on, the line to the WC was an annoyance. In our pub, the one with the crossing light, we were less stressed about it than people in the other pubs, since our crossing light was connected to the lock of the WC door. Whenever the lock was locked, our crossing light was red; hence when the door was unlocked it was green.
When we relocated the pub, we ended up in a location where the WC situation was much better. I had personally made sure that we brought the crossing light with us, but I could never come up with as good of a use for it. This was a long time ago, but the bright idea (pun intended) stuck with me over the years.
When I implemented Nagios/OP5 at my new workplace, I started playing with the thought that I wanted some way of raising the attention of the monitoring with my guys. The classical "big screen on the wall" was of course one of the first things that crossed our minds. This was easy, and people notice it – goal achieved. But I wanted something else, something more… catchy.
Just by a coincident, I got in contact with a guy who is responsible for replacing old bulb-based traffic lights with new LED-based traffic lights. He gave me a handful of 3-light (red, yellow, green) pedestrian crossing lights, and now I was able to get going with my latest project.
A Nagios/OP5 installation that shows service states on a traffic light.
Note that you are on your own when connecting the things together. If you are not completely sure of what you are doing, then don't. I've been doing things like this for a while, so I trust myself. But I do not take any responsibility what so ever for any mistakes you do yourself. This project involves 220V, which can be lethal. Don't blame me if things go bo-boo. End of disclaimer.
All in all, I've got a Nagios/OP5 installation in a virtual machine. In this example, one of my services is configured with an event handler, pointing to a command configured in checkcommands.cfg. I decided that the communication between my monitoring system and the Raspberry Pi would go over nrpe, which is anyways the standard Nagios Agent. Adding a couple of scripts on the server to take care of events, and the client side, to control the GPIO, was fairly simple.
Let us go through the whole chain on both hosts, the Nagios/OP5 system and the Raspberry Pi. I will start in a reverse order, as the Nagios configuration is simple and does not require much of explanation. Which service to chose for your traffic light is up to you. There are a couple of interesting constructs that come with OP5, that is not readily available out of the box in a Nagios installation. One of these is the "Business process view", that allows you to perform logical operations on service states. You can also create new services from these aggregations. I will leave this part out of this blog entry, but the principle is so easy, that if you manage with the rest in this article, your should not have a hard time figuring that part out either.
In principle, I just chose one service and added an event_handler to it. That's it. The event_handler is configured as any other command in the _checkcommands.cfg_ file. An event handler should take care of a couple of checks, so that you are sure that you really want to do something when the event hander is triggered, as it is triggered quite often. Basically, check the state (OK, WARNING, CRITICAL) and the state type (hard, soft) and make up your mind.
As mentioned before, I chose to use _check_nrpe_ to integrate Nagios with my Raspberry Pi, since it is readily available and very simple to configure. All I need to do, is to remotely run a script on the Raspberry Pi, which nrpe allows me to do after a very simple configuration. I just had to come up with a name for my remote command, add it to the nrpe configuration on the Raspberry Pi, restart nrpe, and start using check_nrpe on the Nagios/OP5 server.
On the Nagios/OP5 server, you need to get the following into your configuration files. When using OP5 there is a very simple web-gui to do this in. Othervise just fire up your favorite editor (which should be _vi_).
This event handler is configured in the Nagios/OP5 configuration file checkcommands.cfg. Note the arguments I am sending to the script.
I used a 12V/DC power source to drive the relays, since I could not quickly find any 5V/DC relays. If you do find such relays, just connect the Raspberry Pi pin 2 (5V) to the driver, and you will save yourself a couple of bucks.


The U.S. FDA approved a new formulation for all strengths of Zohydro ER, the single-agent, extended-release hydrocodone product, which is a schedule II controlled substance. Zohydro ER, manufactured by Zogenix, is indicated to treat severe chronic pain that needs continuous treatment and that has not been relieved by previous therapy options.
The new form is considered 'abuse resistant' and it is made with a proprietary technology called BeadTek. BeadTek creates thick, sticky goo if the capsules are opened or crushed and the contents dissolved in liquids or solvents. The FDA has not yet approved product labeling that specifies abuse resistance, however, Zogenix, is planning to provide the FDA with results of studies showing that the new formulation is difficult to abuse.
The first FDA approved version of Zohydro ER was approved in October 2013 without any abuse deterrents and will be phased out and replaced with the new form during the second quarter of 2015.
Last Updated Friday, April 19, 2019 - 07:48 PM.


text:
Q: Facebook openId integration button click event is being firing by default I  have used facebook open id button on one of my asp.net site. when i am pressing enter key by default event for this button is being called. I couldn't figure how to to make it out of focus. I tried very hard. I have other button thats needs to fire on default enter key and used asp panel for the same. my code is here
Please suggest me how to make it out of focus..

A: Since you listed no code, I'll take my guess.
It sounds like you're having more of a problem with the Default Button than OpenID integration. Try that link for several ways to cancel the submit / default button behavior.


Don't forget to watch Dr. Rushing on Talk of the Town as she talks about our Halloween Candy Buy Back! Kids are encouraged to "sell" their excess Halloween candy for $1 per pound. The Candy buy back will take place on Monday November 4th from 2:30-5:30. We will continue to accept candy through Thursday the 8th before shipping it to operation gratitude to be used in care packages for our troops. Letters to troops are always appreciated! Last year we collected over 500 pounds of candy, and while that seems like a lot we would like even more this year. Mark you calendars and tell a friend!
Update: Check the link to view Dr. Rushings segment with Lelan Statom on Talk of the Town.


SAN DIEGO, Calif. — June 4, 2015 — kChamp Games is proud to announce a number of updates to its popular multiplayer artillery game, ShellShock Live — which has now reached Version 0.9.1.7 and is discounted to $6.99 on Steam.
ShellShock Live is a strategic online multiplayer artillery game centered around using tanks to blow your opponents to smithereens. ShellShock Live encourages players to keep playing as they level up and unlock new tanks, music, maps and hundreds of upgradeable weapons. If you're a fan of Scorched Earth, Death Tank, and Worms, you'll be right at home with ShellShock Live.
8-player online multiplayer battles: Team or free-for-all, with several game modes and options; turn-based shooting or all-shot (i.e., everyone shoots at once).
200+ unique upgradable weapons: Use weapons frequently to upgrade them to more powerful weapons (e.g., stream -> creek -> river -> tsunami).
100+ ranks: Earn XP to level up to a new rank–unlocking new weapons, maps, tank parts, and skill points; use skill points to upgrade your tank and unlock new skills.
Fully customizable and upgradable tanks: Earn tank parts by leveling up and completing challenges; customize your tank with parts you've earned.
ASSASSIN tasks each player with eliminating a target. Any damage to other tanks will result in 0 damage. Assassin kills will result in 5 Kill XP + 5 Assassination XP.
JUGGERNAUT has a random player take on the role of the Juggernaut, who in turn gets increased hp and armor. Gameplay is Juggernaut vs. All (up to 7v1).
POINTS rewards a more strategic approach to combat — allowing players to fight each other for points rather than only to the death. The player with the highest score when all players have been destroyed wins the pot!
Backend system for more modes in the future.
Game option to choose weapon system.
XP Multiplier, which also affects weapon XP: Distinct game setups can now earn players different amounts of XP.
XP Multiplier affected by game mode, player count, shot type, and weapon system.
Reduced Skill Point reset wait time from 30 days to 7 days.
Visit http://steamcommunity.com/games/shellshocklive/announcements/ for full patch notes on all updates.
ShellShock Live can be purchased for $6.99 from Steam Early Access and is compatible with Windows, Mac, and Linux. A bundle that includes four full copies of the game is also available for $19.99.
Founded by Kyle Champ in 2011, kChamp Games is a one-man independent game development studio based in Southern California. Kyle started as a Flash game developer at the age of 17 and moved on to new platforms at the wise old age of 23. With more than 30 million combined plays, the ShellShock Live series is his most popular endeavor. To learn more about kChamp Games, please visit http://www.kchampgames.com/.


(CityAM) Greece's finance minister Yanis Varoufakis was yesterday adamant that the country would reach a deal with its creditors, while a European Central Bank (ECB) official warned that Greece could begin using a parallel currency.
"I trust an agreement will be in the offing in the next few days, or weeks," Varoufakis said yesterday, speaking at a conference in Brussels. He added that Grexit – a Greek exit from the euro – was "a forbidden thought in our minds".
However, a government spokesperson reiterated that Greece would not give in on certain areas. "We won't go beyond the limits of our red lines. It's clear that we cannot cut pensions," they said.
Earlier in the day the finance ministry announced it was rehiring cleaning staff fired as part of the previous government's cuts.
Yves Mersch, who sits on the ECB governing council, said that if Greece ran out of cash it could pay public sector workers with IOUs.
"There are intermediate solutions circulating, such as the issuance of a parallel currency or IOUs," he told Spanish newspaper La Vanguardia.


dc.description.abstract Susceptibility to abacavir hypersensitivity has been attributed to possession of the specific human leukocyte antigen allele HLA-B*57:01. HLA-B*57:01-restricted activation of CD8+ T-cells provides a link between the genetic association and the iatrogenic disease. The objectives of this study were to characterize the functionality of drug-responsive CD8+ T-cell clones generated from HLA-B*57:01+ drug-naive subjects and to explore the relationship between abacavir accumulation in antigen presenting cells and the T-cell response. Seventy-four CD8+ clones expressing different Vβ receptors were shown to proliferate and kill target cells via different mechanisms when exposed to abacavir. Certain clones were activated with abacavir in the absence of antigen presenting cells. Analysis of the remaining clones revealed two pathways of drug-dependent T-cell activation. Overnight incubation of antigen presenting cells with abacavir, followed by repeated washing to remove soluble drug, activated approximately 50% of the clones, and the response was blocked by glutaraldehyde fixation. In contrast, a 1 h antigen presenting cell pulse did not activate any of the clones. Accumulation of abacavir in antigen presenting cells was rapid (less than 1 h), and the intracellular concentrations were maintained for 16 h. However, intracellular abacavir was not detectable by mass spectrometry after pulsing. These data suggest that T-cells can be activated by abacavir through a direct interaction with surface and intracellular major histocompatibility complex (MHC) molecules. With the former, abacavir seemingly participates in the MHC T-cell receptor binding interaction. In contrast, the latter pathway likely involves MHC binding peptides displayed as a consequence of abacavir exposure, but not abacavir itself.
html.description.abstract Susceptibility to abacavir hypersensitivity has been attributed to possession of the specific human leukocyte antigen allele HLA-B*57:01. HLA-B*57:01-restricted activation of CD8+ T-cells provides a link between the genetic association and the iatrogenic disease. The objectives of this study were to characterize the functionality of drug-responsive CD8+ T-cell clones generated from HLA-B*57:01+ drug-naive subjects and to explore the relationship between abacavir accumulation in antigen presenting cells and the T-cell response. Seventy-four CD8+ clones expressing different Vβ receptors were shown to proliferate and kill target cells via different mechanisms when exposed to abacavir. Certain clones were activated with abacavir in the absence of antigen presenting cells. Analysis of the remaining clones revealed two pathways of drug-dependent T-cell activation. Overnight incubation of antigen presenting cells with abacavir, followed by repeated washing to remove soluble drug, activated approximately 50% of the clones, and the response was blocked by glutaraldehyde fixation. In contrast, a 1 h antigen presenting cell pulse did not activate any of the clones. Accumulation of abacavir in antigen presenting cells was rapid (less than 1 h), and the intracellular concentrations were maintained for 16 h. However, intracellular abacavir was not detectable by mass spectrometry after pulsing. These data suggest that T-cells can be activated by abacavir through a direct interaction with surface and intracellular major histocompatibility complex (MHC) molecules. With the former, abacavir seemingly participates in the MHC T-cell receptor binding interaction. In contrast, the latter pathway likely involves MHC binding peptides displayed as a consequence of abacavir exposure, but not abacavir itself.
Abacavir induced T cell reactivity from drug naïve individuals shares features of allo-immune responses.
Immune self-reactivity triggered by drug-modified HLA-peptide repertoire.
Avidity determines T-cell reactivity in abacavir hypersensitivity.


Preview- Krishi Vigyan Kendra, Begusarai was established by the Indian Council of Agricultural Research in June, 2004 under the administrative control of Rajendra Agricultural University, Pusa, Samastipur; Bihar observing the possibilities and potentialities of growing cereals, pulses, fruits and vegetables as well as medicinal and aromatic plants in the alluvial fertile tracts of Begusarai district. Since then, it has proved to be one of the leading centers for front line extension education in the district mandated to organize vocational trainings in agriculture and allied vocations with emerging advances in agriculture research on regular basis. The Centre is also dedicated to organize and conduct front line demonstrations in consultation with subject matter specialist for testing, refining and documenting region specific and sustainable land use system. The Centre has conducted more than 48 OnFarm Trials since its inception for technology assessment, refinement and validation and documented a number of technologies for the microclimatic situation of Begusarai district of Bihar. The recommendations based on the On Farm Trials are well adopted by the farmers and a number of Front Line Demonstrations have also been conducted for broad basing of the technology. There was an overall increase of 30-60% in yield over Farmers" Practice apart from saving in cost of cultivation and conservation of natural resources. The short and long duration training programmes, both on campus and off campus, was very much effective in employment generation and all round development of the farmers as well as of rural youths. Cultivation of medicinal and aromatic plants, vermicomposting, tie and dye, organic farming, resource conservation technology along with Integrated Farming System and fruit and vegetable preservation were the prime concern during the year that attracted the young generation and a number of rural youths could get their agri-enterprises established through self-employment. Since the district is facing severe drought situation receiving nearly half of the normal rainfall during last fifteen years, the Indian Council of Agricultural Research, then a number of technologies have been devised to fight the challenges of climatic vagaries and the farmers are now able to take satisfactory yield levels even during drought and flood situations. Efforts on natural resource management, introduction of drought and flood tolerant varieties, conservation tillage, staggered rice nurseries and innovative approaches of establishing Custom Hiring Center for assured and timely sowing of crops have tremendous effects on increasing and sustaining crop production. The prevailing Rice-Wheat cropping system are being diversified and intensified to suit the demand of the farmers as well as to the micro-climatic condition and efforts are being made to have food security, nutritional security and above all the economic security of the farming community. This is just a matter of time that we could prove our worth in terms of overall economic growth of the farmers of Saran district and of the country as a whole.


text:
Синдбад-мореход, или Синбад — персонаж арабских сказок.

Экранизации сказочных сюжетов
 1944 — Синдбад-мореход (мультфильм) — рисованный мультфильм студии «Союзмультфильм» (СССР), 1944 год, реж. Валентина и Зинаида Брумберг.
 1958 — Седьмое путешествие Синдбада (фильм) — игровой фильм, 1958 год, США.
 1962 — Синдбад-мореход — японский полнометражный мультфильм
 1963 — Капитан Синдбад (фильм) — игровой фильм, 1963 год, США, ФРГ.
 1973 — Золотое путешествие Синдбада (фильм) — игровой фильм, 1973 год, Великобритания, США.
 1974 — Тысяча и одна ночь (мультфильм) — мультфильм, 1974 год, Чехословакия.
 1977 — Синдбад и глаз тигра (фильм) — игровой фильм, 1977 год, США.
 1978 — Приключения Синдбада (мультфильм, 1978)  — мультфильм (Австралия), первый показ 23 ноября 1979, канал CBS.
 1989 — Синдбад за семью морями (фильм) — игровой фильм, 1989 год, Италия, США.
1992 —  Синдбад (мультфильм) — мультфильм, 1992 год; Япония, США.
 1996 — Приключения Синдбада (сериал) — сериал производства All American Television, Atlantis Films, CanWest Global Communications (Канада, 1996—1998).
 2000 — Синдбад:Завеса туманов (мультфильм) — 2000 год, производство Archer Entertainment Group (США), Improvision Corporation.
 2003 — Синдбад: Легенда семи морей (мультфильм) — компьютерный анимационный фильм киностудии Dreamworks Pictures (США), премьера состоялась 2 июля 2003 года.
 2011 — Синдбад и Минотавр — игровой фильм, 2011 год, Австралия.
 2012 — Синдбад (телесериал) — телесериал на телеканале Sky1 2012 года. Производство компании Impossible Pictures (Великобритания).
2014 — Маги: Приключения Синдбада (аниме-сериал) — ответвление аниме-сериала, выпущенного студией A-1 Pictures (Япония, 2014—2016).
 2016 — Синдбад: Пираты семи штормов, мультфильм, Россия, 2016 год.

Экранизации других сюжетов
 Последнее путешествие Синдбада (сериал) — 2007 год, Россия.
 Возвращение Синдбада (сериал) — 2009 год, Россия
 Странствия Синдбада (сериал) — 2011 год, Россия
 Время Синдбада (сериал) — 2013 год, Россия

Музыкальные произведения
 Синдбад-мореход (альбом) — музыкальный альбом Филиппа Киркорова, 1990 год.
Рем Дигга- Синдбад

Компьютерные игры
 Восьмое путешествие Синдбада (компьютерная игра) — 1998 год, разработчик «Ivory Intellect».

Другие появления персонажа
 Magi — манга, где Синдбад один из главных персонажей — король Синдрии и лидер Альянса Семи Морей.

Персоналии
 Синбад (комик) — американский стендап-комик

Другие значения
 «Синдбад» — московское книжное издательство
 Синдбад — 29-километровый ударный кратер на поверхности луны Сатурна — Энцелада.

См. также
 Синдбадова книга

Примечания


text:
CommercialMalls
239 East Winslow Road, Bloomington, IN 47401, United States of America
1.2K SF
Retail, Office/Showroom,Retail,Shopping
4910 N Lakeview Dr, Bloomington, IN, United States of America
Office, Office/Showroom
2623 North Walnut Street, Bloomington, IN 47404, United States of America
Restaurant, Restaurant/Bar
S Grant St, Bloomington, IN, United States of America
410 West Kirkwood Avenue, Bloomington, IN 47404, United States of America
1K SF
1614 West 3rd Street, Bloomington, IN 47404, United States of America
Office, Office/Showroom,Professional
South Walnut Street, Bloomington, IN 47401, United States of America
W Grimes Ln, Bloomington, IN, United States of America
N Industrial Dr, Bloomington, IN, United States of America
445 South Landmark Avenue, Bloomington, IN 47403, United States of America
611 West 11th Street, Bloomington, IN 47404, United States of America
Bloominglabs, 1840 South Walnut Street, Bloomington, IN 47401, United States of America
Other/Unknown
416 East 4th Street, Bloomington, IN 47408, United States of America
E Hagan St, Bloomington, IN, United States of America
Restaurant,Vacant, Restaurant/Bar
Monroe County Pizza, 3151 West 3rd Street, Bloomington, IN 47404, United States of America
118 South Rogers Street, Bloomington, IN 47404, United States of America
Find spaces


The sister of a Bomber Command Whitley Captain informed me that she was invited to the Battle of Britain Memorial Service in Westminster Abbey on the 10th July 1947 as her brother Alan, a Whitley bomber Captain Flying Officer W. A. Stenhouse had been killed during the Battle of Britain air conflict and she showed me the Order of Service and Memorial Brochure to indicate that she had indeed been invited.
Until that point, I was unaware that Bomber Command Pilots and Aircrew killed during the Battle were recognised in any Battle of Britain Memorial.
Also a 1940 77 Squadron Bomber Pilot informs me that they were also awarded the Defence Medal for defending our shores and the UK during the Battle of Britain whilst on operations and did we also receive the medal.
Last edited by Observer1940; 22nd January 2012 at 09:41.


Police in Southampton are appealing for information after the home of a surgical trainee was broken into and computers with four years' worth of cancer research on them were stolen.
Sometime between 7.30am and 5.30pm on Monday, March 19, burglars broke into the house in Chilworth close, Chilworth and searched the house stealing various items.
Among them were four laptop computers.. One of them a Dell Latitude E5500 contained four years worth of cancer research Dr Bashar Zeidan had been working on. Although the research was backed up on external hard drives these have also been stolen.
Dr Zeidan, a surgical trainee at the University of Southampton, is in the process of finishing his PhD in cancer research. His research aims to detect breast cancer at an earlier stage to ensure a better outcome for the patient.
Officers are now appealing for any information about the whereabouts of the computers or who stole them. They are particularly keen to trace the Dell computer because of its important contents and are also appealing directly to the burglars to hand it back as the information on it is being used to help advance cancer research which could eventually save or prolong the life of thousands of peoples.
Anyone with information about the crime or who knows where the computers may be is asked to call PC Rob Forbes at Eastleigh CID on 101 or call Crimestoppers anonymously on 0800 555 111.


The place was settled in the early 1800s and first called Noble's Corners or Nobleville after the first postmaster, Joseph Noble. In 1855 the name was changed to Maple, likely after the indigenous tree.
One of the earliest Lutheran congregations in Upper Canada was formed in Vaughan T. in 1806 by German-speaking settlers from Pennsylvania.
The present church, which dates from 1860, was the site of the founding of the Canada Synod of the Lutheran Church in 1861.
William Maxwell Aitken was born in Maple in 1879, the third son of Rev. William Aitken and Jean Noble. He became an industrialist, newspaper publisher, and philanthropist.
He was knighted in 1911, created a baronet in 1916.
Have something to say about Maple?