text:
Community News (All Districts)
Dunsden
Developer appeals
A DEVELOPER has lodged an appeal after plans for 245 homes on the edge of Emmer Green were refused.
Gladman Homes wants to build on three fields between Peppard Road and Kiln Road, in the parish of Eye & Dunsden.
South Oxfordshire District Council's planning committee refused planning permission, saying the site was not in its local plan and the scheme would detract from the rural setting.
More than 300 residents, seven parish councils and two MPs opposed the plans.
The company says the location for the development is sustainable and that the estate would boost the district council's housing supply.
A statement of case for the appeal says: "It is clear there are very significant material considerations which outweigh the statutory presumption in favour of the development plan.
"It is therefore concuded that planning permission should be granted."
The appeal will be heard at a planning inquiry for which a venue and date have not yet been chosen.


Tip 1: Where will the liposuction procedure be applied?
The specific area where the liposuction procedure shall be applied is vital especially to the cost of the liposuction procedure. For that reason, it's just necessary that you determine exactly the specific area of concern.
Looking for the cheapest liposuction procedure isn't the way to go – and such is true in whatever medical procedure. Trust and quality aren't cheap. Deal with reputed and expert cosmetic surgeons in order to ensure the safety and effectiveness of your liposuction procedure.
It's also necessary that you tell your cosmetic surgeon all past medical operations you've undergone, injuries you've suffered – basically, your entire medical history.
Asking questions with regards to the liposuction procedure and its effects are imperative. Don't hesitate to ask questions to your cosmetic surgeon. It's important that you understand clearly what you are to undergo.
Having healthy diet several weeks before the days of your liposuction go a long way on instilling safety and effectiveness with your liposuction procedure.
Being early on the day of your liposuction is also recommended. By arriving early, you become more accustomed to the environment and you'll feel more relaxed and less tense.
After your liposuction procedure, you should not self-medicate. Avoid taking any medication or painkiller that is not prescribed your cosmetic surgeon.
Engaging in heavy work during the first week of your recovery stage can be detrimental to the full success of your liposuction procedure. As much as possible, refrain from doing heavy work and make sure to have enough bed rest.
It's also ideal to have someone to help you during your recovery stage. You can perhaps hire a private nurse or a close relative who can help you with house chores.
It's also essential that you consult your doctor regularly especially during the stage of recovery. As mentioned above, don't self-medicate.


text:
Q: Converting CSV data format First time question here..
I have 100's of CSV files I need to convert using whatever means you think necessary.
The format is an ever-accumulating value e.g.
01/01/2012,96,1000,1100,1150,1200,1400,1450,......
02/01/2012,96,1900,2050,2060,......

But I need this in a single value format, so I need the difference between each value e.g.
01/01/2012,96,100,50,50,200,50......
02/01/2012,96,150,10,......

96 is the no. of values in each row.
Thats the 1st part, the next is to ignore any row which doesn't have 96 values,
so:
01/01/2012,1024,96,96.7,96.5,96.3,.....

would be ignored.
I'm very new to writing scripts/macros so baby steps please!

A: UNTESTED. I suggest:
Import a .csv to Excel.
Turn on Macro recorder.
Text to Columns with , as delimiter.
Filter column containing 96 to select any value other than 96 and delete those rows.
Add a row for the differences.
Concatenate the results of 96 columns with the likes of =A2&","&B2&","….
Adjust code to suit.

redpajama_set_name: RedPajamaStackExchange


text:
Megaselia shabestarensis — вид мелких мух-горбаток рода  из подсемейства Metopininae (двукрылые горбатки). Эндемик Ирана.

Распространение
Центральная Азия, Иран (провинция Восточный Азербайджан,  Shabestar city—Shanejan region, 38°13.85' N, 45°42.93' E, высота 1664 м).

Описание
Мелкие мухи длиной около 1 мм. Длина крыльев от 0,9 до 1,6 мм. Лоб без микротрихий (кроме его краёв). Щека с 4 щетинками. Ноги желтовато-коричневые. Грудь коричневая с 3 нотоплевральными щетинками, без расщелины перед ними; мезоплевра без волосков. Брюшко серовато-коричневое, с мелкими волосками на 5-6 вентритах. Вид был впервые описан в 2019 году иранскими энтомологами Р. Н. Хамени с коллегами (Khameneh R. N., S. Khaghaninia, N. Maleki-Ravasan; University of Tabriz, Тебриз, Иран) и британским диптерологом Генри Диснеем (R. Henry L. Disney; Department of Zoology, Кембриджский университет, Кембридж, Великобритания). Видовое название дано по имени места обнаружения (Shabestar).

См. также
 Megaselia evogliensis
 Megaselia zonuzensis

Примечания

Литература
 Disney R.H.L. 1989: Scuttle Flies — Diptera, Phoridae Genus Megaselia. Handbooks for Identification of British Insects, 10 (8): 1-155.
 Disney R.H.L. 1994: Scuttle flies: The Phoridae. Chapman & Hall. London, xii + 467 pp. https://dx.doi.org/10.1007/978-94-011-1288-8

Ссылки
 BioLib Taxon profile — genus Megaselia Rondani, 1856
 Phorid catalog (online data for phorid flies). Entomology Section, Natural History Museum of Los Angeles County
Megaselia
Насекомые Азии
Эндемики Ирана
Животные, описанные в 2019 году

redpajama_set_name: RedPajamaWikipedia


Sunday Service: Regularly at 10:30 A.M. February thru August 2019. All are welcome!
Holy Communion: is regularly offered on the 2nd and 4th Sundays of the month.
Mary-Martha Guild: No longer meeting.
Facebook: Please go to the congregation's Facebook page and "like" it and hopefully you will get regular news that way.


text:
The Bandim Health Project: Development research gives significant results
Peter Aaby (middle) with two of the Bandim Health Project's PhD researchers; Hanifi Manzoor (left) and Paul Welaga (right) who defended their doctoral theses at Staten's Serum Institute in January 2018.
Anthropologist, Dr Peter Aaby is credited for the discovery of non-specific effects of vaccines.Since the 1980s, he and the Bandim Health Project in Guinea-Bissau have received a total of 50 million Kroner from the Ministry of Foreign Affairs of Denmark to development research with the last grant now dispersed by Danida Fellowship Centre.
By Vibeke Quaade
If there is a giant in the story of Denmark's development research, it must be Peter Aaby. For almost 40 years, he has run the Bandim Health Project, a health and demographic surveillance system site that he established in Guinea-Bissau in 1978. He is credited for the discovery of non-specific effects of vaccines, leading the World Health Organization, WHO, to change its measles vaccine programme in the early 1990s.
He is also controversial, but that is to anticipate the story he tells me when he and I meet one late afternoon in January at Statens Serum Institut in Copenhagen.
The story begins in 1978 when Peter Aaby was a young anthropologist doing research in Guinea-Bissau. The child mortality rate in Guinea-Bissau was extremely high. About half of the newborn babies died within the first five years of life.
At the time, it was widely believed that the high child mortality rate was due to malnutrition. Together with a team of three other researchers, Peter Aaby was assigned to investigate the correlation between malnutrition and child mortality and how the nutritional situation could be improved.
To our great surprise, we found very little severe malnutrition in Guinea-Bissau when the work started. However, while the research team was in Guinea-Bissau a severe measles epidemic broke out.
Watch the video interview with Peter Aaby here:
Theory of non-specific effects of vaccines
The team now discovered that instead of a correlation between malnutrition and child mortality, there was a connection between the children's mortality risk and the intensity of their exposure to the illness.
This was about six or seven years before the global vaccination schemes sponsored by UNICEF came into place in the mid-eighties, so most of the children in Guinea-Bissau were not vaccinated against measles. Based on their new findings, the team carried out a general measles vaccination programme in their study area in Guinea-Bissau. This led the team to new research discoveries.
What happened was that once we started vaccinating against measles, the general child mortality dropped by 60 pct. It made us understand that not only did the new vaccination scheme prevent measles infection, but it also had other preventive effects, says Peter Aaby.
He speaks quickly, eager to explain the origin of his discovery of the non-specific effects of vaccines. In a few hours, he is off to Copenhagen Airport to catch the night flight to Guinea-Bissau. He has travelled this route hundreds of times since he first started to examine the measles vaccination's unexpected side effects.
The Bandim Health Project helped to develop local, individual and institutional capacity through both training and partnerships. One success story is the establishment of the National Institute of Public Health. The Bandim Health Project also trained the project's current Director of Research, Dr Amabelia Rodrigues. She was the first person in the country, and the first woman, to receive a PhD degree in health.
Breakthrough in WHO
Peter Aaby's research was controversial then, and still is today.
The standard assumption at the time was a one-to-one link between vaccines and the disease that the particular vaccine would prevent. Our research questioned the one-to-one link because our data showed that the vaccine not only prevented measles, but also made other changes in the immune system, says Peter Aaby.
Further trials were conducted in several countries, all with the same result. There were unexplained side effects of measles vaccinations. Hardly anyone in the global health system took any notice. It did not discourage the Bandim team from pursuing their research and insisting that the existing vaccination system was based on a wrong assumption.
By the end of 1989, WHO introduced a new measles vaccine. Again, Peter Aaby and his team raised objections. Their studies showed that this particular vaccine was associated with a two-fold increase in mortality among girls.
We alerted WHO about our observations in 1990. In 1991, the experts dismissed them, but then, in 1992, US researchers working in Haiti confirmed that the girls who had received the new measles vaccine had indeed a higher mortality rate than the boys, he says.
The result was that WHO withdrew the vaccine. Had it not been withdrawn, it could have led to at least ½ million additional female deaths per year in Africa alone.
A man on a mission
Since then, Peter Aaby and the Bandim Health Project have documented non-specific effects in several trials of measles vaccine, BCG, oral polio vaccine, DTP vaccine and smallpox vaccine conducted in various countries in Africa and Asia and in Denmark.
Peter Aaby is controversial, but he is also highly respected. In 2009, he was named the fifth most influential person in Denmark in the fight against global poverty by Udvikling (Development), a magazine published by the Ministry of Foreign Affairs of Denmark.
Nonetheless, the Bandim Project's findings have not brought about fundamental change in global disease prevention policy. The current policies do not take into account the fact that once you boost the immune system with a vaccine against one illness it may have other positive or negative side effects.
According to Peter Aaby, global policy continues to follow the thinking that he and his team already pointed out as being inadequate three decades ago. He sees this as a blind spot in the system, so he continues with his work.
You can say I am a man on a mission, he says.
He fears what may happen when global vaccination against eradicated diseases stops, as was the case when smallpox had been eradicated.
Polio may be eradicated already this year and measles within the next 10 years. If we stop vaccination, it may have very negative effects on morbidity in low-income countries
Research into the unknown
Our time is almost up. Peter Aaby has to go home and pack his bags and head off to the airport. Controversial or not, since the 1980s he and the Bandim project have received a total of 50 million Danish Kroner for development research from the Ministry of Foreign Affairs. I ask him if the Danish state's investment has paid off.
I think it pays off to invest in development research as long as the supported research programmeisn't designed to find what you think you should find, but rather to examine all the things you do not understand, he says and adds,
To examine the unknown is what research is all about.
Nine hundred scientific papers have been published and 63 researchers have received a doctoral degree or a PhD degree. Additionally, 13 Guineans have received a master's degree from an overseas university as a result of the The Bandim Health Project, and some 45 Scandinavian PhD students have been associated with the Project to date. More than 150 local assistants, nurses, doctors and supervisors work for the Bandim Health Project, making it one of Guinea-Bissau's biggest employers. The Bandim Health Project is associated with University of Southern Denmark and the Statens Serum Institut in Copenhagen where it has a small department.

redpajama_set_name: RedPajamaCommonCrawl


text:
New food hall set to open near Cineworld Boldon aimed at better serving 'millennial and younger customers'
Time for a four-day working week? Here's what South Tyneside shoppers said
How Greggs' vegan sausage rolls and steak bakes have continued to boost bakery chain's profits
High street baker Greggs is set to post its latest set of stellar results as it continues to ride high on the back of the success of its vegan range.
By Poppy Kennedy
Monday, 2nd March 2020, 7:48 am
Updated Monday, 2nd March 2020, 1:18 pm
Shares in the North East-based retailer were a whisker away from an all-time high last week before market fears pressed down on the company, during one of the FTSE's worst weeks since the financial crash.
Nevertheless, the past 18 months has seen a run of success for the business, with its shares doubling in value over the period despite wider uncertainty in the retail sector.
Declining high street footfall and sky-high business rates have continued to weigh on UK retailers over the past year.
Greggs is set to deliver higher profits and soaring sales for 2019 when it announces its results on Tuesday, March 3.
Last month, it said it expected to post 13.5% sales growth for the year to December 2019, accelerating from an already strong 7.2% growth in the previous year.
While this figure has been significantly boosted by the company's continued expansion - which saw it increase its portfolio by 97 stores during the year - it was primarily driven by higher takings per store.
Greggs said it saw like-for-like sales shoot up by 9.2%, from 2.9% like-for-like growth in the previous year.
Customers increasingly visited stores for its traditional ranges but the company has also grown its customer base through the introduction of new products.
Its vegan sausage rolls have seen sales continue to surge, leading the firm to recently launch its first vegan steak bake and vegan doughnut to continue to capitalise on this growing segment of the market.
Greggs has previously said it will continue to evolve its range to embrace a broader variety of dietary choices, fulfilling the need of modern customers whose demands are not always satisfied by fast food retailers.
The bakery chain's success has not just benefited its City investors - staff will also get a major windfall as a result.
In January, the company said each employee would receive around £300 as part of a £7 million payment shared across all staff to mark the "phenomenal year".
Dickinson's Real Deal antiques dealer opens vintage and reclaimed goods store Laurie's in Boldon - this is what to expect
Dogger Bank team gearing up South Tyneside firms for wind farm jobs boost
Chiefs claim 'buzz returning' to South Shields town centre as football increases after events and initiatives
Support Local: More South Tyneside businesses to try out in 2022 - as nominated by Gazette readers


text:
Max Aeschlimann (* 1904; † 1971) war ein Schweizer Erfinder und Unternehmer.

Leben

Max Aeschlimann wuchs in einer kinderreichen Handwerkerfamilie in Bern auf. Er machte eine Lehre als Feinmechaniker in der Eidgenössischen Waffenfabrik in Bern. Im Jahr 1929 eröffnete er eine Vertretung für Tornado-Schreibmaschinen. In diese Zeit fällt seine erste Erfindung, der Telefonkabel-Aufroller Telemax.

Max Aeschlimann übergab 1933 das Schreibmaschinengeschäft seinem älteren Bruder, vertrieb den Telemax und übernahm die Schweizer Vertretung der schwedischen Glühbirnenmarke Luma.

Im Jahr 1938 patentierte Aeschlimann das Fahrrad-Reinigungsmittel Velopurol mit dazugehörender Zerstäuberdose. Diese wurde an die Fahrradpumpe angeschlossen und ermöglichte es, auch unzugängliche Stellen zu behandeln. Velopurol wurde während des Zweiten Weltkriegs von der Schweizer Armee an die Fahrradtruppen ausgegeben und ist noch heute, allerdings in eine Spraydose abgefüllt, erhältlich.

Weitere Erfindungen waren der Autoscheibenreiniger Vitralux und die Maxram-Abstandshalter für Moniereisen.

Max Aeschlimann war verheiratet und Vater zweier Söhne (Hans-Ulrich, * 1933 und Peter, * 1939). Er zog sich 1967 nach einem Herzinfarkt aus dem Erwerbsleben zurück. Das von ihm gegründete Geschäft wurde von seinen Söhnen weitergeführt und bestand bis 1997.

Der Maxram-Korkenzieher

In den Jahren 1957/58 meldete Aeschlimann seine berühmteste Erfindung zum Patent an, den Maxram-Korkenzieher, der sich durch eine Doppelspirale mit Schneidkanten auszeichnet. Im Verlauf von achtzehn Jahren, bis zum Ablauf des Patentschutzes im Jahr 1975, wurden zweieinhalb Millionen solche Korkenzieher verkauft. In Deutschland übernahm das Ed. Wüsthof Dreizackwerk in Solingen den Vertrieb.

Hergestellt wurde der Maxram-Korkenzieher von der Firma PB Baumann in Wasen im Emmental, einer bekannten Herstellerin von Schraubenziehern.

Weblinks

 Schweizer Patent 369377, für den Maxram-Korkenzieher

Erfinder
Unternehmer (20. Jahrhundert)
Schweizer
Geboren 1904
Gestorben 1971
Mann


3.3.2 — An Application may not itself install or launch other executable code by any means, including without limitation through the use of a plug-in architecture, calling other frameworks, other APIs or otherwise. No interpreted code may be downloaded or used in an Application except for code that is interpreted and run by Apple's Documented APIs and built-in interpreter(s).
SDL and scripting code have always been verboten on the iPhone.
You can't use dynamic libraries on the iPhone. All code has to either be in Apple's frameworks, or statically linked inside your executable. No dylibs. No scripting. SDL is LGPL licensed, which requires linking against a dylib. If you're using SDL on the iPhone, You're Doing It Wrongâ"¢.
2) Use Xcode and other Apple devtools. Use C, C++, or Obj-C. Use Apple's frameworks exclusively.
If you were using Unity, or MonoTouch, or planning to use Flash, or whatever, you weren't doing one of the above.
EDIT: Really, in my mind this is similar to the early days of Mac OS X. Apple kept saying, "You should really be using Xcode and Cocoa for OS X apps." A lot of people kept on with Carbon and CodeWarrior (*cough* Adobe) or other older technologies, and later got screwed. (Intel transition, 64-bit, etc). If you're not using an Apple-graced technology, and you don't own or have access to the code, you're setting yourself up for heartache later.
Bachus Wrote: You can't use dynamic libraries on the iPhone. All code has to either be in Apple's frameworks, or statically linked inside your executable. No dylibs. No scripting. SDL is LGPL licensed, which requires linking against a dylib. If you're using SDL on the iPhone, You're Doing It Wrongâ"¢.
Well, you can buy a commercial SDL license and statically link - but SDL doesn't make much sense (or actually make things any easier) on iPhone OS IMHO.
The 3.3.2 clause is another PITA for game developers - most engines/middleware are driven by interpreted scripts or dlls. I can understand why they wouldn't want unverified downloaded code executed, but I don't see how executing external code bundled with your app is any different than executing static code in your app. If it's vetted code it's vetted code - who cares how it's loaded?
So how did Unity get around 3.3.2? (That's been around for ever).
AnotherJake Wrote: To me, and many others, it looks like Apple has very little interest in the quality of apps on the iPhone or whether anyone is successful or not. Instead, it looks like all they want are as many apps as they can and to see tens of thousands of developers clamoring to be on iPhone. I think it's ridiculously stupid for them to present that attitude. Why crap on the developers? Why not actually take care of the developers instead? Why not treat them with a little respect? Would that really hurt them somehow?
But if they did want as many apps as possible, why ban third party software?
It can not be to make the apps better, it will most certainly make them worse. What they will do is to get rid of interesting, complex apps, the ones that need third party libraries.
I guess the goal is to have as many unique apps as possible. And the ban against thrid party software is most likely legalese fluff that makes it possible for Apple to kick out any significant technology they like, which means Flash. But it also means that investments in producing third party tools for the iPhone are not likely to be made. Apple's signals is that they will stop them, so if you make something that gets big, your only chance is that Apple buys it.
This whole mess is pretty depressing. I hope Apple makes some official clarification, giving us a clear bordeline between allowed and disallowed that doesn't ban all common programming practices.
Frank C. Wrote: The 3.3.2 clause is another PITA for game developers - most engines/middleware are driven by interpreted scripts or dlls.
Interpreted scripts are of course bad. Performance eaters and thereby battery eaters. But can't they then ban that, explicitly?
Skorche Wrote: The problem is that Apple is holding all the secret keys to make the best software. You can't use the APIs that they are allowed to use. You can't make software that fills a similar role to Apple's (if they decide that they don't want the competition). Implementing functionality similar to their apps (even at a superficial level) has lead to rejections as well.
Absolutely. How many improvements to, say, the Finder are rooted in an innovation pioneered by a third party dev? Many.
What if there was no other email apps on the Mac? Just because I'm happy enough with Mail.app doesn't mean we shouldn't have Eudora, Exchange, etc.
Skorche Wrote: At the same time they let so much shovelware on the iPhone that it's ridiculous. Bad terrible UIs diligently written in XCode with Cocoa, buggy apps that crash constantly, programs rife with memory leaks, etc.
What if Apple could advertise "Our apps go through a 30-point approval process to ensure your time is not wasted." Like a car checkup to make sure the car runs well, this would be an app checkup to make sure the app is good. The main issue with that? Apple would need to publish guidelines on exactly what it is they test, and eventually the shovelware artists would figure out a way around it... but with common sense, Apple could just revise and publish new approval processes.
funkboy Wrote: Absolutely. How many improvements to, say, the Finder are rooted in an innovation pioneered by a third party dev? Many.
And there are many that havn't made it to the Finder yet, despite huge advantages. Default Folder X is my favourite. Ever since its predecessor "Click! There it is!", I have felt limited on any Mac without it. But if Apple had stopped that possibility, I would still have to mess with the ineffective built-in system.
You sure have a point. An official guideline on what the accept or not, right? It could make it easier to foresee the outcome, whether you are welcome or not, and decide that before you go into expensive polishing stages.
They should totally ignore what tools you use. None of their business. Just inspect the result. If it uses too much CPU for what it is doing, or if it is plain ugly (e.g. uses a foreign widget set), reject on that, but not on what language or libraries it uses.
Ingemar Wrote: But if they did want as many apps as possible, why ban third party software?
That's a good question, and definitely pokes a hole in my theory. Still, why do they then allow the massive amount of shovelware? This situation is really hard to comprehend.
Ingemar Wrote: This whole mess is pretty depressing.
Also, I think we've all been wondering why they haven't published an official document on their review process since the beginning. It would speed up the approval process for everyone because there'd be less rejections/resubmissions.
Personally, I've never had a rejection out of the many submissions we've done (heck I even got IAP through on the first try), but I still wish they had the guidelines so there would be less rejections/resubmissions plugging things up and slowing me down too.
Finally, I'm thinking about starting a Keith Olbermann-style counter of how many days the iPad has been out and still not allowing browsing for other apps than what's hot, like the number of days since mission accomplished in Iraq.
It was written by Arnold Kim (presumably the same fellow from TouchArcade), so perhaps there is at least a shred of truth to it.
Frank C. Wrote: Well, you can buy a commercial SDL license and statically link - but SDL doesn't make much sense (or actually make things any easier) on iPhone OS IMHO.
You know SDL might not be banned but the way some people are discussing it it might just prompt apple to include it in the ban.
api's but this 3.3.2 clause seems like a knee jerk reaction aimed at flash which could have a ripple effect.
This stuff about cross compilers producing inferior code is garbage, Back in the day when I was in engineering schools, we use to write our c and pascal compilers (yes I wrote compilers they are not some mystical beast like a unicorn) then compile the compiler code with the new compile which produced tighter optimized code. We also used to build intermediate little "Control" languages and interpreters into our code.
Todays systems with all their complexity are more vulnerable than ever to hackers, why , because so many programmers only know how to program at a high level that they don't know how to guard against old school programmers who are going to come in thru a very low level back door. I might spot it but I promise you 70% of the coders out there won't.
SDL for iphone is not and never will be a compatibility layer, for safety any reference to that terminology should be removed. The licensed version of sdl is just a statically linked library of c and c++ code.
Any so called compatibility level is simply achieved by a jump table that translates sdl methods to iphone api methods. if Steve jobs considers that a violation of 3.3.2 then opengl itself is guilty too.
3.3.2 is clearly aimed at tools such as montouch, freepascal and adobe cs which interpret foreign code such as actionscript or c# into objective-c compilable code. clearly that should be the demarcation if there should be one at all.
SDL on the iphone works because it is a layer between sdl and open gl, it is almost a one to one, sdl commands map to opengl commands or a set of sdl commands, you can get the exact same effect building your own methods, its just someone already took the time to do it for you.
SDL's 1.3 implementation of open gl is so "Soft" in fact it makes it a pain to create anything resembling an iphone applications. understand I am not criticizing sdl and the overall package is much better than the "subset" intended for iphone and most importantly with abiet some extra work you can move games and other applications from other platforms WHICH DOES make it a powerful class library .
But the way sdl creates its windows and eagl views in code makes it harder to add common iphone ui elements like nib files and subviews. It can be done, but I am finding to my dismay it can't be done in a generic way, every app requires the code to tailored in a slightly different manner.
Trying to write portable code on the iphone platform is an observitiy, Maybe 3.3.1 is Apples's unique way of admitting they designed a system that is hostile to portable code, building apps on the iphone is all about customizing view controllers and stacking views and subviews, you can do all that in code but than you have to go out of your way to mirror all the hidden initialization you get from using IB.
Running sdl in the manner prescribed by the documentation would definitely feed an Apple argument to ban it, it uses no nib files (which isn't exactly that bad, Erica Sadun wrote an entire iphone "cookbook" full of examples that only use a main.m without any nibs. But nibs do help in loading and unloading view controllers which you will find is true when you try to convert an sdl program to use splitview controllers on the ipad. Like me you are going to have to reintroduce the mainWindow.xib at startup otherwise you might get the splitview to show with some trickery but you won't get the popoverview to work correctly.
treating sdl as just another statically linked library will probably be ok. Thats my opinion but if its wrong then virtually EVERY statically linked library could be at risk which I don't think Apple intends to do.
Apple has always had access to the source, but based on my experience with similar work situations it doesn't seem feasible they have the reviewer staff to go through every line of code. My guess is they just use the static analyser tools UNLESS they suspect from the behavior of the app that somebody is doing something weird.
Otherwise there would not be so many apps in the apps store that obj load the core surface private framework. Any apps that does on Device video encoding (not decoding) or video sharing ie. ivideocamera etc uses that api.
An app that uses absolutely no UIkit components could fall under that suspicion category.
Sadly I myself have come up with a contingency plan for my own apps, mind you it would set my development cycle back a month or two but I could save my apps.
I have analysed the sdl methods I used, those could be fairly easily duplicated as in app classes, again SDL is just a class lib of methods written in C and C++ which could easily be duplicated locally.(C++ is officially ok) That would save my particular apps would others be able to adapt that strategy I am not sure. technically renaming the static library and the main methods would have similar effect, that is how absurd this who 3.3.2 business is.
SDL is about as vanilla as it comes to using approved api's, I have more fear of other libraries I have used such as 320 than sdl, it doesn't seem to use any private api's anywhere.
I know I've been rambling on but this whole business is going to be confusing until Apple clarifies its vague language, which I suspect they will, when that happens I think it will be clear sdl will be ok but freepascal, monotouch etc are clearly out. Which I think shows they are being childish . Also arguments about those cross-compilers producing terrible code are just plain stupid.
michelleC Wrote: Also arguments about those cross-compilers producing terrible code are just plain stupid.
I think we all agree about that -- although it is still certainly possible to screw that up too. I don't even understand why they'd complain about interpreted code. I can make really fast interpreted code and make a better app at the same time. If their problem is really all about Flash, I wish they'd find a better way to fend it off, rather than this sleazy, crippling, back-door legal fungus.
Ingemar Wrote: An official guideline on what the accept or not, right? It could make it easier to foresee the outcome, whether you are welcome or not, and decide that before you go into expensive polishing stages.
Absolutely. Published guidelines is the #1 improvement for a good developer experience. Even if they change every month, fine, but at least let us know what will be judged.
Why Apple hasn't done this yet is because of the uproar it would likely cause once they wanted to start changing the guidelines. However, if they just start changing them a few times at the beginning, we'll all get used to it (though still complain), and they can get almost the same ability to change their mind (yes explicit apps, wait no explicit apps but bikini apps, okay no bikini apps, okay maybe a separate part of the store for them, etc.).
Is it irony or is it karma to see this conversation happening?
What I mean is, how many iDevgames have occurred where we argued over the "must only be Xcode" rule and its associated evils?
Anyhow Steve's point of diluting the value of iThing exclusivity by having apps that run on any device has some point. A game/software made in Flash can be run in a web browser, there is no point in getting an iThing to use it. Make something for Windows and the thing can run on 100% of the world's computers, by 100% of the world's software pirates.
Steve's point about people like Adobe controlling the platform has a point as well.
Imagine the situation where 60,000 apps are made in Flash.
Apple makes massive changes and improvements to the iPhone OS and something breaks in 30,000 of these Apps. Adobe is slow to respond, but people don't blame Adobe, they blame Apple. Just like the idiots in last month's Mac world blaming Snow Leopard for breaking their Appletalk network (good gravy!) and their ten year old printer drivers.
Since Apple is technically selling both the device and the software, they are stuck with the "I want my money back" complaints, while Adobe gets to spend their resources updating their Windows based software.
The thing to consider here is that change is coming to the devices and the SDK.
Consider iPhone OS 4.0 to be at the toddler stage that Mac OS 4.0 was in 1987.
Apple is planning ahead, while the SDL people and the Flash people can't possible know what Apple knows.
Things made those other tools/methods will break.
Apple is heading off the day where 65,000 apps stop working because they are made in some archaic tool and abandoned by their developer.
igame3d Wrote: Apple is heading off the day where 65,000 apps stop working because they are made in some archaic tool and abandoned by their developer.
But when Apple makes 65000 apps stop working, because they introduce some bug in the OS, what is the difference? Apple doesn't have a good track record in this respect.
All Apple needs to do to make those middleware layers safe is to cooperate a little bit with the developers of those layers.
Ingemar Wrote: But when Apple makes 65000 apps stop working, because they introduce some bug in the OS, what is the difference? Apple doesn't have a good track record in this respect.
They've figured out a way around this though. All they had to do was make it so that customers couldn't browse for any game except for the 40 or so that they wanted the customer to see. That way if the other 64960 stopped working, nobody would notice. Genius!
SDL is a statically compiled c and c++ library pretending to be some kind of compatibility layer.
Flash CS like montouch takes a non iphone native languate like c# or actioncode and produces object code. Or pcode which can be compiled by the gcc compiler.
Apple may have some point in fearing this.
Comparing sdl and flash/monothouch are like comparing apples to oranges.
The former is not covered under 3.3.2 because it is just a collection of class libs, it if it does somehow get banned it will be by perception alone by reviewers who don't know anything about code compilers.
Also it will set a dangerous presidence for any 3rd party library.
If I include a jumptable to allow my library more compatibility with other platforms does that make it a banned framework, give me a break.
igame3d Wrote: Is it irony or is it karma to see this conversation happening?


It is 10:30 p.m. on a Thursday night and all Joshua Bell, a junior biochemistry major, can think about is heading to Late Night at True Grits for a cheeseburger and fries. For many students on campus, Late Night at True Grit's is both a convenient meal option and a time to meet up with friends. The program, which offers an expansive menu from 9 p.m. until 2 a.m. Monday through Friday at True Grit's, is one of the only places to get hot food after 7:30 p.m. on campus.
As beloved as Late Night is to many a beleaguered student, many students feel that the program could better serve their needs. Moaz Hassanin, a junior chemistry major, feels that "late night could be open at, like, 8 p.m.," because 8 p.m. is the time at which the late night meal period begins. Currently, the only dining options available at 8 p.m. are Salsarita's and the True Grit's Outtakes which primarily sells prepackaged foods.
Some students feel that while the food at Late Night is good, the hours of operation are lacking. "I wish they were open on more weekends," said Lisa Hong, a junior biochemistry major. She added, "It would be nice to have another option besides D. Hall and Salsarita's on the weekends." The lack of weekend hours has been a constant complaint from students who live on campus. In response, the Late Night program has been expanded to be open one weekend a month. But not everyone feels that it is enough.
"It's like the campus keeps forgetting people live here on the weekends too," Johnson said. UMBC has often been considered a commuter school and the lack of weekend dining options plays no small role in this perception. Many students have raised the point that the limited dining options on the weekends are part of the reason they do not stay on campus. Perhaps by expanding the Late Night program, UMBC could give students a reason to stay the weekend by giving them more of what they already want: a time to catch up with friends while eating chicken tenders.


Swiss football was not regarded too highly by most Celtic fans, although a glance at the side which they put out showed that it would contain 2 Germans, 1 Italian and 7 Swiss internationals. And they were also managed by a very well-known name in Laszlo Kubala.
Kubala's time in football was a remarkable one. Born in Hungary, he played for several different teams in Hungary, Czechoslovakia, Spain and Switzerland, picking up 28 caps (3 for Hungary, 6 for Czechoslovakia, 19 for Spain) before moving into management, having spells with Barcelona (1961-63) and Espanyol (1963-66) before joining Zurich in the summer of 1966.
As you might imagine, the press gave the match great coverage not only in the days leading up to it but also on the day itself. One surprising fact that came to light on the day of the game was that Kubala – and his management team – had made no effort to have Celtic watched beforehand.
Celtic: Simpson, Gemmell, O'Neill, Murdoch, McNeill, Clark, Johnstone, McBride, Chalmers, Auld, Hughes.
Zurich: Iten, Munsch, Leimgruber, Steirli, Neumann, Brodmann, Kuhn, Martinelli, Bani, Meyer, Kunzl.
The Swiss side came out charged up and played a very physical game, seemingly determined to knock our guys off their stride, with Jinky a particular target. For most of the first half, it seemed that every Swiss player was camped in his own half to stop Celtic.
The relentless attacks did lead to some chances but surprisingly, Joe, of all people, missed two of the best ones, much to the amazement – and disappointment, judging by the groans – of the 50,000 crowd.
There was controversy right on the final whistle. A header from Joe was seemingly net-bound when the referee, Mr Hansen from Denmark, blew the whistle for full-time.
And, just to rub salt into raw wounds, the Swiss side accused Celtic of being over-physical!
The previous evening Rangers had drawn 1-1 with Glentoran in Belfast in the Cup-Winners' Cup. In the same competition, Everton had drawn 0-0 in their first –round first leg tie in Denmark against Aalborg.
In the European Cup, Liverpool had a 2-0 win over Petrolul Ploesti of Rumania in their first-round first leg tie at Anfield; while in the Fairs Cup, Burnley beat Stuttgart 2-0 at Turf Moor in a first round second leg encounter, going through 3-1 on aggregate.
Lanarkshire detectives raced to a public park this afternoon after a man and a woman were found dead from shotgun wounds.
The double-shooting horror was discovered in Garrowhill Park by a man out walking his dog. Near the couple, believed to be in their early 30s, a 12-bore shotgun was found.
A senior police officer at the scene said "It is too early to make a statement but at the moment we are treating this as a case of murder and suicide".
A Glasgow hotel has banned the Walker Brothers from staying the night – because of 'the trouble their fans cause other guests'. The group is due to play a one-night stand at the Odeon Theatre on Wednesday.
This was claimed today by the pop group's manager who said that their booking at the Royal Scot Hotel had been cancelled.
The 'invasion' of the Falkland Islands is over. The 20 Argentine nationalists who hi-jacked a plane in a bid to take over the islands have surrendered!
They are now under guard at Port Stanley after being persuaded by a Roman Catholic priest to give in. London missionary Father Rodolfo Roch talked the 19 men and the gang's blonde leader – Maria Verrier – of the 'Condor' group into giving themselves up late last night.


text:
2021 Nissan Navara NP300 Review
Nissan is a leader in selling mid-size trucks worldwide. In North America, we find Frontier. In other markets, there are several names for the pickup. Some of them are Datsun, Fiera, Skystar, and the most popular is Navara. And what is the 2021 Nissan Navara NP300? The NP300 is an old nameplate for some countries, which was later replaced. Still, the truck is still in production in a few South American countries, such as Chile and Venezuela.
The 2021 Nissan Navara NP300 is mechanically and cosmetically the same as the standard Navara. However, due to laws and regulations, it carries a different name. Still, buyers can count on the performance and the durability of the truck whose platform is used by some other leading carmakers. The same architecture underpins Patrol SUV and Mercedes X-Class pickup. When the German luxury manufacturer decides to team up with Nissan, you can be sure their product is one of the best you can find.
2021 Nissan Navara NP300 Specs
The most recent generation of the truck dates back from 2014. Then, the company put the codename D23 on this series, which replaced NP300. Other changes included updates under the hood. Now, there are three engines available for the pickup. For the 2021 Nissan Navara NP300, the only choice is a 2.5-liter turbodiesel. This oil-burner is good for 130 horsepower (98 kW) and 305 Nm (225 lb-ft) of torque. A diesel engine is more efficient than the petrol unit available for the rest of the world. However, its emissions need improvements. Currently, the truck is rated 211 g/km of CO2. The maximum towing capacity of the 2021 Nissan NP300 is 1450 kg (3,200 pounds). The engine is mated to a manual transmission, that sends power either to one or both axles.
The company might make another diesel unit available for the 2021 Nissan Navara NP300. That is a 2.3-liter turbo-four. It is an engine for more serious working, with 140 kW and 450 Nm of torque. However, it is still not possible to get the NP300 with this powerplant, which became the part of the lineup when the latest generation debuted. Towing capacity numbers are the best indicator of what you get with extra power. The engine boosts the capacity to 3,500 kg, or 7,700 pounds.
A couple of gasoline engines are also part of the Navara/Frontier lineup, but not the NP300. A 2.5-liter four-cylinder petrol mill was economical and can meet the requirements of demanding markets, especially these with strict emission policies. However, the towing capacity is not near the oil-burners. But, the US version of the truck recently got an update. The Frontier has a new engine – a 3.8-liter V6. It is more efficient than its predecessor, a huge 4.0-liter displacement. It would be cool to see the 3.8-l in other markets as well. However, diesels are more popular where the 2021 Nissan NP300 is going to make the appearance.
2021 Nissan Navara NP300 Release Date, Changes
The new 2021 Nissan Navara NP300 is not out yet. The company will probably bring the same truck to the market, so there is no rush for the launch. The COVID-19 hit the automotive industry and spoiled plans. The Japanese manufacturer wanted to launch the new generation in 2021, but it seems the release date is postponed. Since the redesigned pickup is coming in 2022, there is no sense updating the current edition. Fans will definitely skip the 2021 YM and wait for the new one for the purchase.
Categories Nissan
Toyota Land Cruiser Namib Edition Truck
2021 Holden Colorado is a Perfect Ute for Australian Deserts


text:
At the closure of the last Miart edition and after the Art Super Collectors Guide dedicated to the most interesting galleries and worth collecting artists, Art Super features three interviews with the most compelling figures of contemporary art and design, plus a special focus on the relationship between Miart, Contemporary Art and its sponsors.
On Tuesday April, 24th 2018
Inteview with Elsa Ravazzolo, Director of the brasilian contemporary art gallery A Gentil Carioca
This year Miart has seen the presence of section Generations by Lorenzo Benedetti, Curator for Contemporary Art of the Kunstmuseum St. Gallen.
He invited two galleries with the aim to build a dialogue between two artists from two different generations in the same stand, collaborating on a single exhibition project. Art Super decided to dedicate to A Gentil Carioca and the artist Jarbas Lopes the best position in our collector's guide. We have talked to Elsa Ravazzolo, the gallery's director, discussing not just the Miart project, but also their achievements and changes in near future.
On Wednesday April, 25th 2018
Inteview with Diego Sileo, Curator of PAC Padiglione d'Arte Contemporanea
Until May, 20th PAC, Padiglione d'Arte Contemporanea in Milan presents the solo show of Teresa Margolles, a Mexican artist living and working between Mexico City and Madrid. Particularly prone to crude realism, her works bear witness to the complexities of contemporary society, weakened by an alarming violence that is tearing the world, and especially Mexico, into pieces. In a brief but intense dialogue with the curator of PAC, Diego Sileo, we want to investigate with a profound sight the work of Teresa Margolles, the relationship between her works and the public and the connection with the curator personality.
On Thursday April, 26th 2018
Inteview with Piergiorgio Robino , Founder of Studio Nucleo
Italian furniture brand Driade has worked for its 50th anniversary with Studio Nucleo to transform some of its most iconic pieces into 3D-printed versions fit for future life on the moon . Piergiorgio Robino with Studio Nucleo reinterpreted four of Driade's bestselling designs by Naoto Fukasawa, Philippe Starck and Italian artist and furniture designer Enzo Mari, asking him what will outdoor design look like on the moon.


Fuel prices register marginal cut across India: Check rates here. Petrol prices were slashed by Rs 0.14 in Delhi and Mumbai.
Reduction in prices of fuel on Tuesday brought citizens much-needed relief from skyrocketing fares. Notably, petrol prices were slashed by Rs 0.14 in Delhi and Mumbai. A reduction was also witnessed in diesel prices by Rs 0.9 and Rs 0.10 respectively.
After the reduction, petrol is being sold at Rs 78.42 per litre in Delhi and Rs 83.92 per litre in Mumbai. Diesel is being retailed at Rs 73.07 per litre and Rs 76.57 per litre in Delhi and Mumbai respectively.
In the two other metro cities, almost the same cut was seen. The prices of petrol and diesel in Kolkata were Rs 80.47 and Rs 75.02, respectively. In Chennai, the prices were pegged at Rs 81.61 and Rs 77.34, respectively.


I've *nearly* finished Nevil and Cletus.
Nevil the Pointless Non-forking Server.. well, what can I say. Cletus the Non-forking Chatroom would be a pretty good base for anyone wanting to write a perl-based talker/mud.
I *really* need to get out more.
And I've now been here for 2 weeks. That's scary.


text:
Then Herod, when he saw that he was mocked of the wise men, was exceeding wroth, and sent forth, and slew all the children that were in Bethlehem, and in all the coasts thereof, from two years old and under, according to the time which he had diligently...
A Summary of Christian Faith and Practice Confirmed by References to the ... - Pagina 202
door E. J. Burrow - 1822
A view of the rise and fall of the kingdoms of Judah and Israel
William Stevens (biographer.) - 1833
...from two years old and under, according to the tim.e which he had diligently enquired of them. Then was fulfilled that which was spoken by Jeremy the...heard, lamentation, and weeping and great mourning, Rachael weeping for her children and would not be comforted, because they are not.* The period, however,...
An exposition of the Gospels of st. Matthew and st. Mark, and of some other ...
Richard Watson - 1833
...accomplishment of it, in order to explain in 4 ST. MATTHEW. all the children that were in Bethlehem, and in all d reasoning in their hearts, 7 b Why doth this man...blasphemies ? who can forgive sins but God only ? 8 And imm 17 Then was fulfilled that which was spoken by d Jeremy the prophet, saying, d Jer. xxxi. 15. what...
The New Testament of Our Lord and Saviour Jesus Christ. Tr. Out of the Latin ...
1833 - 344 pagina's
...exceeding angry ; and sending, killed all the men-children that were in Bethlehem, and in all the borders thereof, from two years old and under, according to...which he had diligently inquired of the• wise men. 17 Then was fulfilled that which was spoken by Jeremias the prophet, saying : 18 A voice in Kama was...
Getting to Know Jesus the Messiah
Gene Lapansie - 2004 - 248 pagina's
...was exceeding angry, and sent forth, and killed all the children that were in Bethlehem, and in all the coasts thereof, from two years old and under,...wise men. Then was fulfilled that which was spoken by Jeremiah (31:15) the Prophet, saying, In Ramah was there a voice heard, lamentation, and weeping,...
Three Western Narratives
Washington Irving - 2004 - 998 pagina's
...pouring forth their wailings for the dead, call to mind the beautiful and affecting passage of Scripture, "In Rama was there a voice heard, lamentation, and...children, and would not be comforted, because they are not." Chapter XXII Wilderness of the Far West — Great American desert — Parched seasons — Black...
Larry G. Hogestyn - 2004 - 184 pagina's
...wise men." Mt 2:17: "Then was fulfilled that which was spoken by Jeremy the prophet, saying," Mt 2:18: "In Rama was there a voice heard, lamentation, and...children, and would not be comforted, because they are not." Mt 2:19: H But when Herod was dead, behold, an angel of the Lord appeareth in a dream to Joseph...
The Millennial Chronologically Dated New Testament of Jesus the Christ
Walter Curtis Lichfield - 2004 - 636 pagina's
...enquired of the wise men. 17. Then was fulfilled that which was spoken by Jeremy the prophet, saying, 18. In Rama was there a voice heard, lamentation, and...children, and would not be comforted, because they are not. 19. But when Herod was dead, behold, an angel of the Lord appeareth in a dream to Joseph in Egypt,...
What the Bible Says About the Collapse of the Universe: Book Ii: The ..., Boek 2
Stanley Lotegeluaki - 2004 - 664 pagina's
...men, was exceeding wroth, and sent forth, and slew all the children that were in Bethlehem, and in all the coasts thereof, from two years old and under,...which he had diligently inquired of the wise men. 17. Then was fulfilled that which was spoken by Jeremy the prophet, saying, 18. In Rama was there a...
The Myth of the Birth of the Hero: A Psychological Exploration of Myth
Otto Rank - 2004 - 149 pagina's
...men, was exceeding wroth, and sent forth, and slew all the children that were in Bethlehem, and in all the coasts thereof, from two years old and under,...which he had diligently inquired of the wise men.... But when Herod was dead, behold, an angel of the Lord appeareth in a dream to Joseph in Egypt, saying:...
Women, Submission and Witchcraft
Maro - 2004 - 128 pagina's
...men, was exceeding wroth, and sent forth, and slew all the children that were in Bethlehem, and in all the coasts thereof, from two years old and under,...which he had diligently inquired of the wise men. Mathew 12:29 29 Or else how can one enter into a strong man's house, and spoil his goods, except he...


Here are some these general criteria, and why they are important to the admission committee.
The admission committee at a top B-school does not merely look for a person's profile for what they have achieved, but also the level of maturity and professionalism that they display in their application. Are you impatient and short tempered? Sure, these might be qualities you've seen in on-screen managers, but the admission committee might look upon this as a sign of immaturity. These are displayed in the essay and interview components of the application process.
Albeit not the most pressing criteria, a fair share of the 'smarts' is an essential quality to possess while applying to a b-school. After all, the admissions committee must also determine if you would really be able to perform under the high-pressure environment that would often be simulated in terms of assignments, projects and coursework. Your past academic performance and standardized test scores are generally used as indicators of these in tandem with the other activities you have included in your resume and essays.
Merely having ambition may not help you make the cut of the top list of candidates by the admission committee at a top b-school. You ambition needs to be supplemented by potential – a greater likelihood of future success and the drive to attain that ensures that all the stakeholders behind your admittance at a B-school are satiated. The top organization gets a potential talent and the alumni network gets another accomplished high-quality addition.
Sure, thinkers run the world. But where future leaders and managers are created, action is the name of the game. It is not only important that there be ideas, but a drive to work on them, and not merely allow them to incubate for years on an end. An aspirant greatly amplifies their chances in the eyes of the admission committee if they know how to weigh the risks, when to take that leap of faith and work towards making mere blueprints real products and services. This is most prominently displayed in initiatives you've taken up and your community involvement.
We get it – your domain is technical and your interests similar. However, the admission committee at a top b-school will most definitely look at your ability to communicate clearly and effectively. Don't get us wrong; you do not have to be the next Ernest Hemmingway, but it is imperative to be proficient at putting your point across.
Although you do not need to be the next Euclid, a b-school admission committee will look at your quantitative skills. In fact, most b-schools will also have candidates take a mathematics preparation component before the course starts. This skill is important to have at a quotidian level and is seen in your GMAT scores and any past experience you have in a field that requires these skills.
We hope that this blog serves as a resource to increase your knowledge base and puts you one step closer to a top B-school. If you're looking for help with your MBA application, we can help you.


Technology is rapidly advancing, changing how people recreate, communicate, and travel. Automobile crashes are the fourth leading cause of death for people between the ages of 35 and 44(1). In rural areas, the number of annual fatalities is disproportionately higher than in urban areas. Rural road safety is critical for both rural and urban residents, because even as people move to more urbanized areas, they are still drawn to rural areas for vacations and recreation. As a result, intelligent transportation systems can help to address safety and localized congestion that is experienced in a rural context, particularly in areas where traditionally expensive infrastructure modifications are not feasible due to fiscal constraints.
In 1997, the original Rural Intelligent Transportation System Toolkit was developed by Science Applications International Corporation, Western Transportation Institute, Transcore, and Castle Rock Consultants as a resource for state and local transportation agencies. As technologies have advanced, new ITS tools have been introduced and others have been revised or retired.
ITS Toolkit Primer – The Primer provides more information about the background of the toolkit, the intended audience, and how to utilize the toolkit to it's fullest extent.
ITS Toolkit Summary Table – This table provides a "snapshot" view of the available tools.
ITS Toolkit Acronym List – This resource defines all of the acronyms, that can be found throughout the fact sheets, in one easy to find location.
Embedded Links and References Supplement – This supplemental document provides the long form of the hyperlinks used in the individual fact sheets, as well as, the references sited in the implementation and cost sections.
Tools that focus on reducing crash frequency and severity.
Tools that facilitate the identification of congestion and the management of traffic.
Tools that facilitate operations, enhance maintenance, or extend the longevity of the transportation assets.
Tools that support, facilitate and expedite emergency response efforts.
Tools that monitor weather conditions on the transportation network and mitigate weather related impacts.
Tools that expand, enhance, and coordinate public transportation.
Tools that expand or enhance dissemination about travel conditions and tourism opportunities in the surrounding region.


The repeal of Waterford Michigan's long-standing breed ban will be heard for the first time during their June 10th township meeting.
The leg work of the repeal is being headed up by O.D.O.G.S, Oakland County Dog Ownership Group and Specialists. The group was founded by Mary Dunham after her dog was determined by Waterford officials to be a targeted dog. A DNA test was conducted after the township demanded it. The test determined that the dog, Keane, had no DNA from any targeted breed, and was mostly a lab.
O.D.O.G.S drafted a responsible pet ownership ordinance that would take the place of the current breed discriminatory law and has been working for some months now to educate the community about what a repeal would mean for everyone and to address concerns. The proposal was submitted on January 7th and officials have been taking their time reviewing all the information submitted to them.
This definition, with the inclusion of the language about technical deficiencies, casts such a wide net that virtually every short-haired dog becomes a target.
The ordinance is an interesting study because they include the reasons for passing it. Two particularly interesting pieces are found in Section 3-078 item (g)"4. The pit bull terriers' massive canine jaws can crush a victim with up to two thousand (2,000) pounds of pressure per square inch, three (3) times that of a German shepherd or doberman pinscher, making the pit bull's jaws the strongest of any animal, per pound.
Thanks to Dr. Brady Barr, we now know that the bite force of a "pit bull" is weaker than other breeds of dogs and other studies have shown that jaw strength is directly related to the size of the dog's head, the larger the head, the stronger the jaw. Section (5) is an amazing example of urban legend in action within the law.
Waterford is utilizing the materials from the UKC to visually make the determination a dog is banned. The UKC has publicly and repeatedly announced that the use of their standards and literature to enforce a breed discriminatory law is a violation of their copyright and an abuse of the material.
There is really not much of anything else regarding dangerous dogs in the code of ordinances. They have 2 classifications of nuisance dogs but none for a potentially dangerous or dangerous dog. Dogs that bark excessively and dogs that "habitually attack other domestic animals" are the same by classification.
Waterford's current laws are the perfect example of a complete failure to address the issues that cause dangerous dogs in any meaningful fashion, while allowing people to have the feeling they are protected. The thinness of the law should be extremely concerning to all residents. The responsible pet ownership proposal will cover the gaping holes in the current law and protect all members of the community.
The proposal can be viewed here.
Waterford residents: Please attend the meeting to urge officials to help make the community safer by enacting the proposal and repealing the ban. The information the ban was relying on is outdated and the current law insufficient to affect community safety. A change is needed and now is that opportunity for change.
This entry was posted in Proposal to Repeal and tagged meeting, pit bull, waterford MI bsl, waterford michigan breed specific legisation. Bookmark the permalink.


Crest Dutch Machinery is a very well experienced independent, international operating company, founded in 2005 by six former Sallmetall and Crest Engineering employees.
The employees of Crest have more than 30 years experience in foil processing solutions and workflow automatisation based on Laminating, Positioning and Cutting Technology in the sign-, traffic sign-, converting- and industrial market (film processing industries).
The ultimate goal of Crest is to realise effective, simple and pragmatic solutions. Crest likes to be challenged to find creative and effective solutions to meet the customers' needs. The compact organisation, the high knowledge-level and the multi-disciplinary working methods result in a surprisingly short development time; from rough idea to proto-type usually takes only a few months. The world-wide customers are often positively surprised not only by the solutions and short development-times but also by the range of possibilities Crest comes up with.
Flexibility and multi-disciplinary are strengths of Crest Dutch Machinery; based on the principles of modular designs, machines can easily be adapted to tailor-made requests. Because of the 100% in-house design, engineering and assembly of the machines, Crest is very flexible in adapting machines and tools to customers needs.
For instance, critical parts like cores of the rollers are manufactured internally and on the electric department the boards are programmed and installed by own employees.
Having all the disciplines in house ensures the highest quality!
Crest is not only a manufacturer of machines, but also provides excellent service by own Service Engineers. Because of the in-house facilities, spare-parts can be supplied promptly.


text:
Q: Python. DFS graph traversal, correct output? I'm currently getting to grips with graph traversal in Python.
Given the following graph:

Implemented using this dictionary:

graph = {'0': set(['1', '2', '3']),
         '1': set(['0','2']),
         '2': set(['0','1','4']),
         '3': set(['0']),
         '4': set(['2'])}

Am I correct in thinking a depth first search traversal beginning from node 0 should return [0,1,2,4,3]?
My dfs function returns [0,3,1,2,4] and so I am wondering if I have something wrong in my implementation:
def dfs(graph, node,visited=None):
    if visited is None:
        visited=set()

    if node not in visited:
        print (node,end=' ')
        visited.add(node)

        for neighbour in graph[node]:
            dfs(graph,neighbour,visited=visited)

dfs(graph,'0')

Help and advice appreciated.

A: No you aren't.
You would be right to say that traversal order COULD be [0,1,2,4,3]. Not that it should.
The only thing you know about traversal order is that you explore, among everything explorable, first the descendant of the last explored node.
But among those, nothing tells you any order.
And the implementation you've chosen make that extra clear, since set in python don't have a specific order (but even if you'd chosen list instead of set, and written an implementation that, among the child of the most recently explored nodes, explores the first child of the list, leading indeed to [0,1,2,4,3], that would be just your implementation, not a rule about DFS. Nothing says that you should favor one child against another; or, to be more accurate, since you have to choose one, nothing says in which order. That is totally implementation dependent).
So from your graph, starting from 0, a DFS traversal order could be any of
0,1,2,4,3
0,2,1,4,3
0,2,4,1,3
0,3,1,2,4
0,3,2,1,4
0,3,2,4,1

(Plus those I may have forgotten)

A: Never mind.
I realise my error was due to how I had initiated the graph. I mistakenly passed in sets. Using the following seems to produce the expected results:
graph = {'0': ['1', '2', '3'],
         '1': ['0','2'],
         '2': ['0','1','4'],
         '3': ['0'],
         '4': ['2']}

dfs(graph, '0')


Located at 118 S. Hazelwood, the Rocky Ridge Garden was previously the location of a boarded home. Following the house's demolition, the lot was transformed by the neighbors and has become a source of pride in Rocky Ridge.
Boarded and uncared for, a hole in the roof was an indicator of the conditions inside.
A Rocky Ridge Neighbor mows the overgrown lawn of 118 S. Hazelwood.
…has gone a long way.


text:
layout: post
title: "Carrot Halwa"
modified:
category: "Big-Boys-Curry-Book"
excerpt: "This is a lightweight version of a very popular Indian desert, which can be very"
tags: ["almond","basmati","bay","butter","cardomoms","cashew","chicken","cinnamon","cloves","cumin","ghee","lamb","mace","nuts","pepper","rice","saffron","turmeric"]
image:
  feature: the-matrix-slim.jpg
date: 2011-09-13T12:57:15+00:00
comments: true
redirect_from:
  - /bbcb/recipe/Carrot+Halwa.html
  - /bbcbrecipe/Carrot+Halwa.html
redirect_to: http://bbcb.co.uk/carrot-halwa
---

Like fishermen the world over, the work never stops

This is a lightweight version of a very popular Indian desert, which can be very rich otherwise (and too rich for most western palates).  The unusual use of carrots may appear strange at first, but their natural sweetness is the reason why they appear in western deserts, the most obvious example that comes to mind being carrot cake!  This recipe is sufficient for 8 people and is often served with an icecream.

## Ingredients

100g butter ghee

25g raisins

25g cashew nut

2 large fresh carrots, grated with the large grater

200ml (1 cup) milk

150g grated jaggery or sugar

1 cardomon, powdered and husk removed

## Method

Heat 2 tbspn of ghee and gently stir-fry cashew and raisins until cashews are golden.

Remove, drain and set aside.

Heat 50g ghee in wok and stir-fry carrot for 5 minutes.

Add milk and simmer until well reduced, 10-15 minutes.

Add jaggery (or sugar) and remaining ghee and cook for another 5 minutes until mixture is softened.  remove from heat.

Add raisins and cashews, stir to combine.  Serve hot or cold.

Back to recipe index

redpajama_set_name: RedPajamaGithub


text:
\section{Introduction}

In wireless mesh network (WMN), the utilization of available resource, i.e., relay node and spectrum, and the cost of routing, i.e., consumption of the network, can be substantially improved and reduced, respectively, through cooperation. That is, multiple service providers (SPs) may form a coalition to pool their resources to serve all their subscribed customers together, which leads to higher satisfied service~\cite{Lin10}.

Coalition of WMN benefits SPs in the following two ways. First, SPs coalition may substantially lead to higher revenue. In some WMNs, relay nodes (e.g., access points and routers) are deployed dispersedly. For each SP, if there is no cooperation, the limited number of nodes and their dispersive locations largely confine the link capacity that can be provided for flow transmission. Cooperation among SPs could increase the number of available relay nodes for each SP which in turn improves available link capacity. Accordingly, a larger amount of flow rate requirement can be satisfied by efficiently utilization of resources in the WMN, which leads to higher aggregated revenue. Second, SPs coalition may lead to lower network cost. A cost (e.g., due to the usage of energy and spectrum) incurs when a node transmits or relays traffic flow. Under non-cooperation, an SP can only use its own relay nodes for flow transmission which largely constrains the routing. SPs cooperation could increase the number of multi-hop routes which in turn provides more options of packet forwarding for flows. If the optimal route from source to destination node under cooperation involves less relay nodes than under non-cooperation, the cost for flow transmission is reduced.

Fig. \ref{example} shows an example of two SPs cooperation. The dashed circle line represents the transmission range of the source node S$1$. Due to the limited transmission range of each node, when there is no cooperation, the three-hop route represented as the semi-dashed arrow lines is the only route available for SP$1$ to transmit flow from source node S$1$ to destination node D$1$. This route incurs the cost of three nodes for transmission. Cooperation between the two SPs can reduce the cost as only two nodes are used for the transmission of this flow with the route represented as the solid arrow lines. Similarly, this is also the case with SP$2$ for flow transmission from S$2$ to D$2$. Besides, under cooperation, multiple routes can be utilized together to support a higher rate requirement that a single route cannot satisfy, which leads to better service for customers and higher revenue for SPs.

\begin{figure}[t]
\centering
\includegraphics[width=0.5\textwidth]{example_four.eps}
\caption{An example of SPs cooperation in WMN.} \label{example}
\end{figure}

Although SPs coalition brings obvious benefits, a major challenge arise in the formation of coalition.
How the aggregated payoff (i.e., revenue) shall be allocated to each SP so that the coalition of them can be stabilized (i.e., none of them has incentive to leave). In this paper, we first model the SPs cooperation as a coalitional game with transferable utility~\cite{Driessen10}. An optimization problem based on linear programming game is formulated. Then, to address the aforementioned problem, we focus on the investigation of payoff allocation solutions which always lead to cooperation among SPs.

The importances of payoff allocation solution in WMN which motivate our study are $1$) from an individual point of view, it is efficient to let each SP in the service coalition achieve a fair sharing according to some common recognized principles; $2$) from a social point of view, it encourages formation of service coalition which provides improved network service for customers; and $3$) from a commercial point of view, it helps each SP to form the stable coalition which helps each one to gain. The analysis of cooperation behavior and payoff allocation solutions are useful for SPs in WMN especially from the economic perspective.

\begin{comment}
The rest of the paper is organized as follows. The related works of allocation problems in communication systems based on cooperative game theory are reviewed in the next section. Section III presents the network model and assumptions. Then, we adopt coalitional game theory to formulate the optimization problem of cooperation among SPs in WMN in Section IV. The solution concepts for stable aggregated payoff allocation are investigated in section V. Section VI shows the performance evaluation results. And finally, we summarize the paper and discuss the future work in section VI.
\end{comment}

\section{Related Works}
Recently, many research interests have been focused on the allocation problem of joint resource sharing in WMN~\cite{Guha07}.
Coalitional game theoretical framework, which is also adopted in this paper, was widely used to model the network cooperation. The existing approaches are mainly based on the concept of Shapley value~\cite{Shapley53}.~\cite{Richard10} presented a clean-state Shapley payoff allocation solution, under which Internet service providers have incentive to reach an equilibrium that maximizes both individual profit and the system's social welfare by performing globally optimal routing decisions. In~\cite{Maac}, with a similar system model to that in~\cite{Richard10}, the Shapley value solution was used under structured topologies, and a dynamic programming procedure to calculate the Shapley value solution was developed for general topologies. Similarly, profit sharing scheme based on Shapley value was also exploited in~\cite{Le08} for radio access in cooperative networks,~\cite{Pan09} for spectrum auction in wireless network, and~\cite{Niyato06} for heterogeneous wireless assess in 4G networks.

\section{Network Model and Assumptions}

\subsection{Wireless Mesh Network Model}
We consider a WMN consisting of nodes belonging to multiple SPs. Let $\mathcal{M}=\{ 1, 2,\ldots,M\}$ denote the set of SPs, $\mathcal{N}^{(m)}=\{ 1, 2,\ldots,N_{m}\}$ the set of nodes of SP$m$, and $N_{m}$ the total number of nodes belonging to SP$m$, $m \in \mathcal{M}$. In the SPs coalition, each node $i \in \mathcal{N}^{(m)}$ not only needs to support internal flow transmission demand, but also serves as a relay node for other cooperative SPs. In a WMN, multi-hop relaying is usually used to route flow session from source node to destination node. For optimality, we assume that each flow session can be split for multi-path routing.
Let $b_{ij}$ denote the frequency band assigned to link $(i, j)$, and $W(b_{ij})$ denote the bandwidth of frequency band $b_{ij}$.
Let $\mathcal{T}_{i}$ denote the set of nodes that are within the transmission range of node $i $.
$\mathcal{B}=\bigcup_{i \in \mathcal{N}, j \in \mathcal{T}_{i}} \{ b_{ij} \}$ represents the set of all assigned frequency bands in the network. We assume that each SP owns sufficient frequency bands and each link $(i, j)$ between two nodes $i $ and $j \in \mathcal{T}_{i}$ is allocated with one frequency band at the initial stage of WMN. To avoid channel interference, there is no reuse of the same band within the interference range of the nodes in WMN.

Let $f_{(i, j)}(l^{(m)})$ denote the data rate on link $(i, j)$ attributed to a flow session $l^{(m)}$, and $\mathcal{L}^{(m)}$ denote the set of flow sessions of SP$m$. Since, in WMN, a flow session from a source node may traverse through multiple relay nodes to reach its destination node, we consider the following two cases.

1) Let $s(l^{(m)})$ and $d(l^{(m)})$ denote the source node and the destination nodes of flow $l^{(m)}$, respectively, and $\mathcal{I}^{(m)}$ and $\mathcal{D}^{(m)}$ the set of source nodes and the set of destination nodes of flow sessions owned by SP$m$, respectively. If node $i$ is the source or destination nodes of flow session $l^{(m)}$, i.e., $i=s(l^{(m)})$ or $i=d(l^{(m)})$, then
\begin{eqnarray}
\sum_{j \in \mathcal{T}_{i}} f_{(i, j)}(l^{(m)})=r(l^{(m)}) \label{source} \hspace{2mm} \text{or} \\
 \sum_{p \in \mathcal{T}_{i}} f_{(p, i)}(l^{(m)})=r(l^{(m)}), \label{destination}
\end{eqnarray}
where $r(l^{(m)})$ is the aggregated rate of flow session $l^{(m)}$.

2) If node $i$ is an intermediate relay node of flow session $l^{(m)}$, i.e., $i \neq s(l^{(m)})$ and $i \neq d(l^{(m)})$, then
\begin{eqnarray}
\sum^{j \neq s(l^{(m)})}_{j \in \mathcal{T}_{i}} f_{(i, j)}(l^{(m)})=\sum^{p \neq d(l^{(m)})}_{p \in \mathcal{T}_{i}} f_{(p, i)}(l^{(m)}). \label{intermediate}
\end{eqnarray}
It is clear that if (\ref{source}) and (\ref{intermediate}) hold, then (\ref{destination}) must be satisfied. Therefore, it is sufficient to have only (\ref{source}) and (\ref{intermediate}) in the formulation.

Let $c_{ij}$ denote the capacity of link $(i ,j)$. The aggregated data rate on each link $(i,j)$ cannot exceed the link's capacity. Thus, we have the following constraint,
\begin{eqnarray}
\label{rate} \sum^{i \neq d(l^{(m)}), j \neq s(l^{(m)})}_{l^{(m)}\in \mathcal{L}^{(m)}}f_{(i, j)}(l^{(m)}) \leq c_{ij}.
\end{eqnarray}

Let $f^{\star}_{(i, j)}(l^{(m)})$ denote the maximal rate that a flow session $l^{(m)}$ can achieve on link $(i, j)$, confined by (\ref{source}), (\ref{intermediate}) and (\ref{rate}), and $F^{\star}(l^{(m)})$ denote the maximal aggregated rate of a flow session $l^{(m)}$. We have $F^{\star}(l^{(m)})= \sum^{i = s(l^{(m)})}_{j \in \mathcal{T}_{i}} f^{\star}_{(i, j)}(l^{(m)})$. The aggregated rate of flow session $l^{(m)} \in \mathcal{L}^{(m)}$ is constrained by
\begin{eqnarray}
r(l^{(m)})= \left\{
\begin{array}{rcl}
R(l^{(m)}) , & & { R(l^{(m)})  \leq F^{\star}(l^{(m)}) }, \\
 F^{\star}(l^{(m)}) , & & \text{otherwise},
\end{array} \right. \end{eqnarray}
where $R(l^{(m)})$ is the transmission rate requirement of $l^{(m)}$.

\section{Optimization Formation of SPs Coalition in WMN}
\begin{figure*}
\normalsize
\begin{eqnarray}
 \max_{f_{(i, j)}(l^{(m)})}: & \quad v(\mathcal{S})=\sum_{m \in \mathcal{S} }\sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum^{i = s(l^{(m)})}_{j \in \mathcal{T}_{i}} f_{(i, j)}(l^{(m)}) P - \sum_{m \in \mathcal{S}} \sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum_{(i, j) \in \Pi(l^{(m)}) } f_{(i, j)}(l^{(m)}) C \label{lpg} \\
\mbox{s.t.}: \hspace{5mm} & \sum_{j \in \mathcal{T}_{i}} f_{(i, j)}(l^{(m)})- r(l^{(m)})=0, \hspace{5mm} ( i \in \mathcal{I}^{(m)} , l^{(m)} \in \mathcal{L}^{(m)}, m \in \mathcal{S}), \label{one} \\%
& \sum_{m \in \mathcal{S}} \sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum^{ j \neq s(l^{(m)})}_{j \in \mathcal{T}_{i}} f_{(i, j)}(l^{(m)}) - \sum_{m \in \mathcal{S}} \sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum^{ p \neq d(l^{(m)})}_{p \in \mathcal{T}_{i}}f_{(p, i)}(l^{(m)}) = 0, \nonumber \\
&(i \in \mathcal{N}^{(m)} \setminus \{\{\mathcal{I}^{(m)}\} \cup \{ \mathcal{D}^{(m)} \}\} ), \label{two} \\
& f_{(i, j)}(l^{(m)}) \geq 0, P > 0, C>0, \hspace{5mm} (l^{(m)} \in \mathcal{L}^{(m)}, i \in \mathcal{N}^{(m)}, m \in \mathcal{S}, i \neq d(l^{(m)}), j \in \mathcal{T}_{i}, j \neq s(l^{(m)}) ). \label{three}
\end{eqnarray}
\vspace{1pt} \hrulefill
\end{figure*}

In this section, we develop a linear programming model for the payoff optimization problem of cooperative SPs in WMN.
Coalition game with transferable utility~\cite{Driessen10}, which allows side payment among SPs, is adopted to model the SPs cooperation.

\begin{comment}
\newtheorem{definition}{Definition}
\begin{definition}
A coalitional game with transferable utility in characteristic form is defined by a pair $(\mathcal{M}$, $v(\cdot))$ where $\mathcal{M}$ is the set of players and $v(\cdot)$ is a mapping that associates a real number $v(\mathcal{S})$ with every nonempty subset $\mathcal{S}$ of $\mathcal{M}$. For each coalition $\mathcal{S}$, $v(\mathcal{S})$ is the maximum aggregated payoff available for division in any arbitrary way among the members of $\mathcal{S}$.
\end{definition}
\end{comment}

From a global perspective, we wish that, through SPs cooperation, all the flows would choose feasible routings that maximize the aggregated payoff of the entire network. This SPs coalitional game in characteristic form is $(\mathcal{M},v(\mathcal{S}))$ for $\mathcal{S} \subseteq \mathcal{M}$. This SPs coalitional game in characteristic form is $(\mathcal{M},v(\mathcal{S}))$ for $\mathcal{S} \subseteq \mathcal{M}$, where $\mathcal{M}$ is the set of players and $v(\mathcal{S})$ is the maximum aggregated payoff available for division in any arbitrary way among the members of $\mathcal{S}$.
Let $P$ denote the normalized revenue per unit data rate provided, and $C$ denote the normalized cost per unit data rate transmitted by source node or forwarded by relay node due to energy consumption and spectrum usage. Usually, for the commercial reason, it is common to assume $P >> C$. The optimization problem for SPs coalition is to maximize their aggregated payoff, i.e., revenue collected for providing service subtracts the cost of using network nodes. Putting all the constraints for routing aforementioned in Section III, we can formulate the payoff optimization of coalition $\mathcal{S}$ as the linear programming problem defined in (\ref{lpg}), subjected to (\ref{one}) (\ref{two}) and (\ref{three}), where $\Pi(l^{(m)})$ is the set of links that are in use for the transmission of flow session $l^{(m)}$.

The optimization problem (\ref{lpg}) provides the maximum aggregated payoff of SPs in a coalition $\mathcal{S}$.
It is straightforward to show that, for any disjoint coalition $\mathcal{S} \subseteq \mathcal{M}$ and $ \mathcal{T} \subseteq \mathcal{M}$, $v(\mathcal{M}) \geq v(\mathcal{S}) + v(\mathcal{T})$. In other words, the coalitional game is \emph{super-additive}. That is, the grand coalition of all SPs attains the maximum possible aggregated payoff.

\newtheorem{definition}{Definition}
\begin{definition}
A coalitional game $(\mathcal{M}$, $v(\cdot))$ is called a linear programming game if there exists an $m \times p$ matrix $A$, an $m \times r$ matrix $H$, and vectors $g(\mathcal{S})\in \mathbb{R}^{p}$ and $t(\mathcal{S})\in \mathbb{R}^{r}$ for all $\mathcal{S} \in 2^{\mathcal{M}} \setminus \{\phi \}$, where $\{\phi\}$ represents empty set, such that for the optimization problem,
\begin{align}
v(\mathcal{S}): & \max_q \quad c \cdot q \nonumber \\
\mbox{s.t.} \hspace{3mm}
& qA \leq g, \quad  qH=t, q \geq 0. \nonumber
\end{align}
 $v(\mathcal{S}) = v_{p}(A,H,g(\mathcal{S}),t(\mathcal{S}),c)$ holds.
\end{definition}

It is obvious that  (\ref{lpg}) satisfies all the requirements of Definition 2. Thus, (\ref{lpg}) is a linear programming game.

\begin{comment}
\newtheorem{theorem}{Theorem}
\begin{theorem}
The game defined in (\ref{lpg}) is a linear programming game.
\end{theorem}

\begin{proof}
It is obvious that the game defined in (\ref{lpg}) satisfies all the requirements of Definition 2.
\end{proof}
\end{comment}

\section{Payoff Allocation Solution}
In this section, the concept of stability in coalitional game is introduced. We then introduce two solution approaches of payoff allocation in the coalitional game theory based on the concepts of \emph{dual payoff} and \emph{Shapley value}.

\subsection{Core of Coalitional Game}

How to divide the aggregated payoff among the cooperative players in coalitional game is the key for a stable coalition. According to~\cite{Driessen10}, \emph{core} is the set of feasible payoff vectors for players in the grand coalition that none of player has incentive to leave, which is analogous to the idea behind a \emph{Nash equilibrium} of a non-cooperative game.
\begin{comment}
\begin{definition}
A real valued vector $\textbf{x}=(x_{i}, i\in\mathcal{N})$ is said to be an imputation if $\sum_{i\in\mathcal{N}}x_{i} = v(\mathcal{N})$ and $x_{i} \geq v(\{i\})$ for all $i \in \mathcal{N}$. For any coalition $\mathcal{S} \subseteq \mathcal{N}$, we let $x(\mathcal{S})=\sum_{i \in \mathcal{S}} x_{i}$. The core of the coalitional game with transferable payoff $(\mathcal{N}, v(\cdot))$ is the set of all imputations \textbf{x} for which $x(\mathcal{S}) \geq v(\mathcal{S})$ for all $\mathcal{S} \subseteq \mathcal{N}$. In other words, the core can be represented as follows:
\begin{eqnarray}
\mathcal{C}= \{ x \in \mathbb{R}^{\mathcal{N}} | x(\mathcal{N}) =v(\mathcal{N}), x(\mathcal{S}) \geq v(\mathcal{S}), \forall \mathcal{S} \subseteq \mathcal{N} \}. \nonumber
\end{eqnarray}
\end{definition}
\end{comment}
\begin{definition}
A real valued vector $\textbf{x}=(x_{i}, i\in\mathcal{M})$ is said to be an imputation if $\sum_{i\in\mathcal{M}}x_{i} = v(\mathcal{M})$ and $x_{i} \geq v(\{i\})$, $\forall i \in \mathcal{M}$.
The core of the coalitional game with transferable payoff $(\mathcal{M}, v(\cdot))$ is the set of all imputations \textbf{x} for which $\sum_{i \in \mathcal{S}} x_{i} \geq v(\mathcal{S})$, $\forall \mathcal{S} \subseteq \mathcal{M}$. In other words, the core can be represented as follows:
\begin{eqnarray}
\mathcal{C}= \{ x \in \mathbb{R}^{\mathcal{M}} |\sum_{i \in \mathcal{M}} x_{i} =v(\mathcal{M}), \sum_{i \in \mathcal{S}} x_{i} \geq v(\mathcal{S}), \forall \mathcal{S} \subseteq \mathcal{M} \}. \nonumber
\end{eqnarray}
\end{definition}

In the proposed SPs coalitional game, any reasonable bases for allocating the aggregated payoff need to be imperative to motivate the SPs to join the grand coalition which maximizes the aggregated payoff. In other words, any set of allocated payoffs to the SPs should lie in the core of the game.
Since the SPs coalitional game defined in (\ref{lpg}) is super-additive, the core always exists~\cite{Driessen10}. The core may not be a unique imputation and the set of imputations in the core may be quite large for a coalitional game that is super-additive. Any imputation in the core is stable; however, this imputation is only desirable if it is obtained according to some principles that can guarantee fairness and uniqueness.
In the following, we address the fair payoff allocation problem in SPs coalitional game by adopting two well-known concepts from cooperative game theory, i.e., the dual payoff and Shapley value solutions.

\subsection{Dual Payoff Solution}

To every linear programming problem, there is a dual problem that is intimately connected to the original one.
The dual optimal solutions for the optimization problem of linear programming game can be obtained by solving the dual problem of deterministic equivalent linear programming of payoff allocation~\cite{Driessen10}. A linear programming game and its dual problem are equivalent in some sense, e.g., the cores of a game and its dual are the same. The dual problem of SPs coalitional game defined by (\ref{lpg}) can be expressed as (\ref{dual}),
where $y_{i}$, $z_{i}$, $e_{(i, j)}(l^{(m)})$ are the dual variables corresponding to the constraints (\ref{one}), (\ref{two}), and (\ref{three}), respectively.

\begin{figure*}
\normalsize
\begin{eqnarray}
   \min_{y_{i}, z_{i}, e_{(i, j)}(l^{(m)})}: & \quad \sum_{m\in \mathcal{M}} \sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum_{(i, j) \in \Pi(l^{(m)})} e_{(i, j)}(l^{(m)}) \cdot r(l^{(m)}) -  \sum_{m\in \mathcal{M}} \sum_{i \in \mathcal{I}^{(m)}} y_{i} \cdot r(l^{(m)})
\label{dual} \\
\mbox{s.t.}: \hspace{5mm} &  e_{(i, j)}(l^{(m)}) + z_{i} + y_{i} = C-P, \hspace{5mm} (i \in \mathcal{I}^{(m)}, j \in \mathcal{T}_{i} ),\nonumber \\
& e_{(i, j)}(l^{(m)}) + z_{i} = C, \hspace{5mm} (i \in \mathcal{N}^{(m)} \setminus \{ \mathcal{I}^{(m)} \} ),\nonumber \\
& e_{(i, j)}(l^{(m)}) - z_{i} = C, \hspace{5mm} (i \in \mathcal{N}^{(m)} \setminus \{ \mathcal{D}^{(m)} \} ),\nonumber \\
& e_{(i, j)}(l^{(m)}) \geq 0, z_{i} \in \mathbb{R}, y_{i} \in \mathbb{R}, \hspace{5mm} (i \in \mathcal{N}^{(m)}, j \in \mathcal{T}_{i}, l^{(m)} \in \mathcal{L}^{(m)}, m \in \mathcal{M} ) . \nonumber
\end{eqnarray}
\vspace{1pt} \hrulefill
\end{figure*}

The payoff allocation of SP$m$ in the grand coalition can be expressed as follows:
\begin{eqnarray}
\mu_{m}(v(\mathcal{M}))= \sum_{l^{(m)} \in \mathcal{L}^{(m)}} \sum_{(i, j) \in \Pi(l^{(m)})} e_{(i, j)}(l^{(m)}) f_{(i, j)}(l^{(m)}) \nonumber \\
-  \sum_{i \in \mathcal{I}^{(m)}} y_{i} \cdot r(l^{(m)}) .
\end{eqnarray}

The \emph{dual payoff} is the payoff vectors $\{ \mu_{1}(v(\mathcal{M})), \ldots,$ $ \mu_{m}(v(\mathcal{M})) \}$ generated by the solution of dual problem. Two important properties of dual payoff solution, making it suitable for payoff allocation in SPs coalitional game, are the efficiency and rationality. For efficiency, the sum of the allocated payoffs of all SPs equals to the maximum aggregated payoff, i.e., $\sum_{m \in \mathcal{M}} \mu_{m}(v(\mathcal{M})) = v(\mathcal{M})$. For rationality, the allocated payoffs of all SPs must be more than or equal to those of sub-coalitions, i.e., $\sum_{m \in \mathcal{S}} \mu_{m}(v(\mathcal{M})) \geq v(\mathcal{S}), \forall \mathcal{S} \subseteq \mathcal{M} $.

\subsection{Shapley Value Solution}

\begin{definition}
 The marginal contribution of player $m$ to a set
$\mathcal{S} \subseteq \mathcal{M} \setminus \{m\}$ is defined as follows:
\begin{eqnarray}
\triangle_{m} (v(\cdot), \mathcal{S}) = v(\mathcal{S} \cup \{m\})-v(\mathcal{S}).
\label{mc}
\end{eqnarray}
\end{definition}

Shapley value, first introduced in~\cite{Shapley53}, is a unique value based on the marginal contribution of each player to the coalition.

\begin{definition}
The Shapley value is obtained from
\begin{eqnarray}
\varphi_{m}(v(\mathcal{M}))=\sum_{\mathcal{S} \subseteq \mathcal{M} \setminus \{ m \}}\frac{|\mathcal{S}|!(|\mathcal{M}|-|\mathcal{S}|-1)!}{|\mathcal{M}|!} \triangle_{m}(v(\cdot), \mathcal{S}) .
\label{sv}
\end{eqnarray}
\end{definition}

The Shapley value is suitable for payoff allocation in SPs coalitional game due to the efficiency and individual fairness. The efficiency, as aforementioned, is the sum of the allocated payoffs for all SPs equals to the maximum aggregated payoff, i.e., $\sum_{m \in \mathcal{M}}\varphi_{m}(v(\mathcal{M}))=v(\mathcal{M})$. For individual fairness, Shapley value guarantees the allocated payoff of each SP to be more than or equal to the value of the individual SP, i.e., $\varphi_{m}(v(\mathcal{M})) \geq v(\{m\})$, for all $m \in \mathcal{M}$. Other properties of Shapley value, i.e., symmetry, uniqueness, dummy, strong monotonicity, and the details can be found in~\cite{winter02}.

In the SPs coalitional game, the Shapley value of each SP can be derived from the combination of (\ref{lpg}), (\ref{mc}) and (\ref{sv}).

\begin{figure*}
\vspace{-5mm}
 \graphfile*[30]{SP1.eps}[Flow Sessions of SP$1$]
 \graphfile*[30]{SP2.eps}[Flow Sessions of SP$2$] \\
 \graphfile*[30]{SP3.eps}[Flow Sessions of SP$3$]
 \graphfile*[30]{tri1.eps}[Flow Sessions of Three-SP Coalition]
 \caption{Network topology and flow sessions of three-SP coalition } \label{Network_topology}
\end{figure*}

\begin{comment}
\subsection{Coalition Formation of SPs Coalitional Game under Coalition Cost}
We have shown that the SPs coalitional game defined in (\ref{lpg}) is super-additive. In particular, the grand coalition is always the optimal one. However, in practice the cooperation among SPs to pool resource can incur cost (e.g., communication and processing overhead). In this case, the grand coalition may not always yield the optimal payoff. Let the set $\omega=\{\mathcal{S}_{1}, \ldots, \mathcal{S}_{l} \}$ define the coalition structure which partitions the set $\mathcal{M}$ of SPs. That is, $\forall k, \mathcal{S}_{k} \subseteq \mathcal{M}$ are disjoint coalitions such that $\cup^{l}_{k=1}\mathcal{S}_{k}=\mathcal{M}$.
Let $C^{co}_{m}(\mathcal{\omega})$ denote the coalition cost that SP$m$ needs to afford under coalition structure $\omega$.
 The allocated payoff of SP$m$ with coalition structure $\omega$ under dual payoff solution and Shapley value solution can be obtained respectively from
\begin{eqnarray}
\phi^{\mu}_{m}(\omega)=\mu_{m}(v(\omega))-C^{co}_{m}(\omega) \hspace{2mm} \label{co_dual} \text{and } \\
\phi^{\varphi}_{m}(\omega)=\varphi_{m}(v(\omega))-C^{co}_{m}(\omega) \label{co_sv}
\end{eqnarray}
where $m \in \mathcal{M}$. Let $v(\omega)$ denote the aggregated payoff under coalition structure $\omega$, i.e., $v(\omega)=\sum_{m \in \mathcal{M}} \phi^{\mu}_{m}(\omega)$ or $v(\omega)=\sum_{m \in \mathcal{M}} \phi^{\varphi}_{m}(\omega)$ for dual payoff and Shapley value solution, respectively. Due to this coalition cost, it may not be worth for an SP to join a coalition if there is no gain in its payoff defined in (\ref{co_dual}) and (\ref{co_sv}), for dual payoff and Shapley value solution, respectively.
\end{comment}

\begin{table}
\centering
\caption{Profile of flow sessions in three-SP network.} \label{Session}
\begin{tabular}{|c|c|c|c|}
\hline
Session & Source & Destination & Rate Req. (Kbps) \\ \hline
\hline
$l^{1}_{1}$ & $n_{1}(5)$ & $n_{1}(2)$ & $33$ \\
$l^{1}_{2}$ & $n_{1}(20)$ & $n_{1}(1)$ & $42$ \\
$l^{1}_{3}$ & $n_{1}(19)$ & $n_{1}(8)$ & $55$ \\
$l^{2}_{1}$ & $n_{2}(16)$ & $n_{2}(6)$ & $71$ \\
$l^{2}_{2}$ & $n_{2}(13)$ & $n_{2}(9)$ & $48$ \\
$l^{2}_{3}$ & $n_{2}(19)$ & $n_{2}(8)$ & $53$ \\
$l^{3}_{1}$ & $n_{3}(19)$ & $n_{3}(12)$ & $41$ \\
$l^{3}_{2}$ & $n_{3}(10)$ & $n_{3}(11)$ & $37$ \\
$l^{3}_{3}$ & $n_{3}(18)$ & $n_{3}(16)$ & $64$ \\
\hline
\end{tabular}
\end{table}

\section{Numerical Results}

In this section, we present the numerical results of the two aforementioned payoff allocation solutions. The fairness and stability of the solutions are demonstrated by comparison in numerical simulations.

\subsection{Simulation Setting}
We consider a WMN consisting of three SPs, i.e., $\mathcal{M}=\{$SP$1$, SP$2$, SP$3\}$. Each SP has $20$ nodes randomly locate in a $600m \times 600m$ area. The bandwidth of each frequency band is set to be $W(b_{ij}) = 200$KHz ,  $\forall  b_{ij} \in \mathcal{B} $. The transmission range of each node is set to be $150m$. As for channel quality,
we consider power propagation gain $g_{ij}=62.5 \cdot d^{-4}_{ij}$ like adopted in \cite{hou08}, where $d_{ij}$ is the length of link $(i, j)$. The capacity of each link is calculated according to Shannon Theorem.

For each SP, there are $3$ internal flow sessions. For each flow session, the source node and destination node are randomly selected and the rate requirement is randomly generated within $[20,80]$ Kbps. We assume that each SP charges its customers for flow service at the same price level and the service fee for providing a unit flow rate (i.e., 1 Kbps) is $10$. The cost for each node to transmit or forward is $1$ \emph{per} unit flow rate. Given all the network and flow session profiles in the entire network, the aggregated revenue is a constant. However, the coalition provides more flexible routing options which could reduce the cost and thus enhance payoff objective function (\ref{lpg}).

\subsection{Three-SP Coalition}

This section considers the case of three SPs forming coalition. The deployment of the nodes and flow sessions of each SP are given in Fig.~\ref{Network_topology}(a), (b), and (c) while the flow sessions under cooperation are shown in Fig.~\ref{Network_topology}(d). Table \ref{Session} gives the details of the flow session profiles in the three-SP network.
Since the number of SPs in WMN is three, the core can be presented by \emph{barycentric coordinates} as shown in Fig. \ref{Barycentric}. The shadow area represents the unstable imputations with which the grand coalition would not be formed. With this representation, the relationship of core, dual payoff, and Shapley value is straightforward. As observed, dual payoff and Shapley value both locate in the core area which means they provide payoff allocations that stabilize the grand coalition.

Table \ref{cc0} shows the results from two payoff allocation solutions under different coalition structures. For three-SP network, there are five possible coalition structures denoted by $\omega_{1}-\omega_{5}$. As expected, the grand coalition, represented as $\omega_{5}$,
maximizes the aggregated payoff, and it is the only stable coalition structure under which each SP gains a higher payoff than that under any other coalition structures.

\begin{figure}[t]
\centering
\includegraphics[width=0.50\textwidth]{tri.eps}
\caption{Barycentric coordinates of the core, dual payoff and Shapley value for the numerical example.} \label{Barycentric}
\end{figure}

\begin{table*}[ht]
\centering
\caption{\footnotesize Payoff Matrix for Three-SP Coalitional Game Without Coalition Cost, } \label{cc0}
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline
Coalition Structure & $\mu_{1}(v(\mathcal{M}))$ & $\mu_{2}(v(\mathcal{M}))$ & $\mu_{3}(v(\mathcal{M}))$ & $\varphi_{1}(v(\mathcal{M}))$ & $\varphi_{2}(v(\mathcal{M}))$ & $\varphi_{3}(v(\mathcal{M}))$ & $v(\mathcal{M})$ \\ \hline
\hline
$\omega_{1}=\{\{$SP$1\},\{$SP$2\}, \{$SP$3\}\}$ & $767$ & $1101$ & $976$ & $767$ & $1101$ & $976$ & $2844$ \\
$\omega_{2}= \{\{$SP$1$, SP$2\}, \{$SP$3\}\}$  & $800$ & $1101$ & $976$ & $783.5$ & $1117.5$ & $976$ & $2877$ \\
$\omega_{3}=\{\{$SP$1\}, \{$SP$2$, SP$3\}\}$ & $767$ & $1149$ & $1058$ & $767$ & $1166$ & $1041$ & $2974$ \\
$\omega_{4}=\{\{$SP$1$, SP$3\}, \{$SP$2\}\}$ & $822$ & $1101$ & $1013$ & $813$ & $1101$ & $1022$ & $2936$ \\
$\omega_{5}=\{\{$SP$1$, SP$2$, SP$3\}\}$ & $855$ & $1149$ & $1058$ & $817\frac{1}{6}$ & $1170\frac{1}{6}$ & $1074\frac{2}{3}$ & $ 3062$  \\
\hline
\end{tabular}
\end{table*}

Taking a close look at the results in Table \ref{cc0}, it can be found that dual payoff solution allocates aggregated payoff to each SP with an amount corresponding to the revenue minus the cost of using the relay nodes. For example, the total flow rate requirement of SP$1$ is $33+42+55=130$Kbps. As this rate requirement can be satisfied, a revenue of $1300$ shall be collected according to the first term of (\ref{lpg}). From Fig. \ref{Network_topology}(d) we can observe that the number of nodes involved in the transmission of flow sessions $l^{1}_{1}$, $l^{1}_{2}$ and $l^{1}_{3}$ are $3$, $3$ and $4$, respectively. The cost calculated according to the second term of (\ref{lpg}) is $33\times 3 + 42\times 3 +55 \times 4 = 445$. The allocated revenue subtracting the cost gives $855$ which equals to the payoff of SP$1$ under dual payoff solution. This is also the case with SP$2$ and SP$3$.
It is because the dual payoff solution allocates payoff based on the amount of occupied resource, i.e., utilizing nodes in this SPs coalitional game. If an SP uses links supported by other SP's nodes, the cost of those nodes are transferred from latter to former accordingly. However, there is no such relationship in Shapley value solution. As described in Section V, Shapley value solution allocates aggregated payoff according to the marginal contribution of each SP. That is, if a node of an SP is used by another SP, the payoff generated is shared between the two SP according to (\ref{sv}). Each solution provides the most fair solution based on its allocation principle and both solutions are stable in this SPs coalitional game.

\section{Conclusion}
In this paper, we have modeled the payoff optimization problem of SPs cooperation as a coalitional game with transferable utility, specifically, a linear programming game.
Based on the concepts of dual payoff and Shapley value, we have obtained the stable solutions for the formulated linear programming game under general network topology.
For the future work, the distributed algorithm of payoff allocation solution with coalition formation of SPs will be developed.

redpajama_set_name: RedPajamaArXiv