text
stringlengths 1
1.57M
⌀ |
|---|
Barba non facit philosophum
Every once in a while a concept comes along that’s so bad it must be addressed- or at least, countered with something rooted in anything aside from abject pontification. In the interest of full disclosure, I’ve been a registered Libertarian since being eligible to vote- the Patriot Act pushed me in that direction, discovering a whole world of folks who seemed to embrace the philosophy of Locke with the passion of Thoreau and the rejection of the nepotism that comes from the two party snake. A lot of the talking points at least sound good, Survivalism and self-reliance was a long-standing cornerstone, the people seemed at least concerned with preserving and advancing the interests of individual liberty, a personal life philosophy of mine and one that’s becoming ever more difficult to reconcile.
Philosophy keeps being used- as with the classic exchange between Alec Lemas and Fiedler in Le Carre’s The Spy Who Came in from the Cold, one’s personal philosophy is the driving force behind that which we do. Collectively, Marx, drawing from the classical philosophers, refers to this as Praxis in The German Ideology– action we take rooted in reality to further our goal. You may recognize this word from a series of posts from the late great Mike Vanderbough; he was a former adherent of Marxism and as such used their language. Regardless of the emotions this may stir, Marx is the root of the continuum of issues we see today forming the Left, and if any of you took the time to study it beside reading interpretations confirming your own bias you’d better recognize the signs in order to formulate a counter.
Which brings us back to ‘philosophy.’ How do we define libertarian philosophy? Rothbard? Von Mises? Ayn Rand? Ron Paul? Is it a study political economy being the amalgamation of capitalist distribution of resources with the logical social conclusion of Marxism, that being an abstract society without definition? Certainly it cannot be the Marxist-rooted Anarchism furthered by Chomsky as some so haplessly claim; or is it? Is it to be simply dismissed as ‘No More Government Interference!’ with little to no direction or path, allowing an ‘anything goes’ atmosphere absent moral standards? Certainly the adherents of the more vocal ‘libertarian’ groups feel so. Rather, could it be rooted in Max Weber, in his dissertations derived from Calvinism and the justification of Capitalism? That Liberty defined, being the right to accumulate wealth and develop according to one’s will and in line with God the Almighty was an underlying current of Weber borrowed from Wesley and uniquely American in continual reference to Franklin. But we are rarely subject to this definition, save the cries of restoring that which was too flawed to stand in its genesis, hence a branched model separated only in theory alone. But this implied religiosity cannot be, among the Libertarians who wish to disprove Durkheim’s Anomie theory in vain, failing to recognize the means of both Mechanical and Organic Solidarity and what role religion plays in social cohesion. Religion is but a sinful word among many in the ‘libertarian’ movement. Ask them, you’ll see. Quickly do they forsake Christianity for the moral equivalence argument of the Left as the roots of the Left were, after all, the originators of the denial of the existence of God. Amid these factors, Libertarianism then defined by its adherents, appears to simply be an idea in search of philosophy defined quite plainly by whomever is writing about it, theoretical grounding be damned.
Libertarianism thus is one logical framework of Hegel. It is largely from Hegel the ideology of Revolution is rooted. The battle of the individual against the divine rule of Kings, the questioning of all that is the status quo among the classes and the masses, the rooting of the Enlightenment and the tree from which its Revolutionary branches sprung. The Master-Slave dialectic is that from which the Conflict Paradigm of Marx arose. Simplistic cries of “WE ARE THE 99 PERCENT!” and “BLACK LIVES MATTER”, as with the repetitive phrases of Orwell’s Boxer the Workhorse, embody this process entirely- us at the bottom versus them at the top- and the police in this paradigm serve the only purpose of protecting that top percent in the tradition of the modern Praetorian. Perhaps this is true, perhaps not, defined alone by the paradigm of the observer. But how does this paradigm work when applied to libertaianism? Dwell on that as you read certain contemporary would-be “philosophers.” Libertarianism at its root appears to diverge from Marxism in its philosophical sense upon the idea of absolute right to property alone- rejection of any authority aside from self-rule, however defining this through Capitalist terms rather than that of Community Property, thus maintaining the social goals of Marx forgetting somehow that he was an acting economist criticizing the economic structure of royalty in the development of the industrial revolution. With that, it fails to address several very poignant issues rather simply leaving morality and standards to the social constructionism popular with those concerned with breaking a society.
Libertarianism is thus a movement in search of coherent philosophy, while Marxism and its decedents are a philosophy perpetually creating a movement.
Why do I submit to you this philosophical-based essay? It is not solely to rebuke Libertarianism as an institution, albeit a minor one. I do however wish to raise points nearly never made, as it is critical to understand where the root of your movement lay should you wish to attach yourself to it. If not you are no better than those you rebuke, collectively dismissed as useful idiots. Further, you must know where the ideas of your movement originate in order to keep it grounded, to keep it from becoming co-opted and to ouster those engaged in undermining it, in order to allow it to manifest in the world you want to live. Further still, a movement with no philosophy is no movement at all. Which one of the options explored here have gained more ground in time? Thus enters politics.
The current election for the future of the nation is indeed disturbing- but which one has not? Early on the Libertarian candidate showed promise- and subsequently fell apart, first by picking the worst possible running mate in terms of personal liberty and second becoming the worst possible candidate to take seriously. I ask of the ‘Libertarian philosophers’, if you were so truly concerned with the direction of things, not simply talking as Marx pointed out of Hegelians in The German Ideology, why have you not lobbied Johnson’s staff to make him into a better candidate and a viable option? Why have you not, with your numerous readers and established name within the Libertarian movement, openly campaigned on his behalf in anything resembling an effective model? Take the recent essay by well known pontificate Claire Wolfe; in it, she justifies support for the Democratic Socialist candidate by continuing the facade of faux-resistance by the Republicans elected to the House and Senate. For what reason have you not made the Libertarian candidate stronger? You certainly could, surely, and be taken seriously by your name recognition alone. As of this writing you have not. Because you know, as do I, he’s nothing more than a spoiler by disenfranchised Republicans rehashing old talking points from the Left sans-effective social action. But the cries of ‘Free State Project!’, ‘rallies!’,’Restore the Constitution!’, and the most illogical of them all, ‘armed nonviolence’ (what’s the point? The right to arms demands assurance of violence on its behalf or its no right at all). Nothing changes because the Left understood long ago it was much easier to play the long game and create the change you wish to see from inside a party already existing. The government did not grow because it is a living entity, it grew because people elected those who enabled it to happen. Those people are not your people, you are not theirs and they want you gone in the name of progress. They’ve done so coupled with a monopoly on the power structure rendered in the University System. The Right attempted to mirror this from the bottom and was shut down by the power structure of both parties with the greatest weapon in America- the IRS, which leads to the conclusion that the entirety of the structure wants a sole state under the facade of opposition. They’re not there quite yet, but close. The Left perpetually advances while the genuine Right, clinging to whatever status quo may remain, rudderless amid faux-philosophy, attempts in vain to halt the Marxist advance. Thus, the ballot box has indeed failed.
Thus, when I read the self-labeled ‘Freedomista’; itself a label attempting to infer analog to Marxist Guerrillas who actually have at a minimum took up arms for a cause; advocating for a Democratic Socialist candidate as our best option coupled with a futile use of chance obstructionism I find revolting. It is not only a contradiction, but with a jaundiced eye coupled with actual serious training in higher education, a near-surrogate level rendering of her garments. Is it the words the Republican candidate used eleven years ago which disturbed you so? The Republican is a boor. Why do you care among an ‘anything goes’ social system to which you adhere? So was Kennedy, behind the scenes, so was Clinton, very openly, and likely so were a good measure of the others. With all of the emotion, venom and illogic of a Social Justice Warrior you lash out against the best option we have, short of replacing bullets for ballots, as our feminist-turned-liberty philosopher decides our best path forward is the sure fire bet to irreversible destruction through complete socialist control of the Judicial System. The colors ring true. But this matters not to the ‘freedomista’ who’s revolution has still yet to manifest. What’s keeping you my dear?
Don’t worry, we’ll wait whilst cries of ‘revolution starts at home!‘ are chanted by those who’ve championed such drivel. It’s false and we all know it. A better outcome would result from aiding the best option, our side winning even if its not ideal, forcing the Left to overplay its hand in the streets in the coming insurrection thus winning the opinion of majority populace through their savagery. The stilted media would further be hung by the noose they’ve tied for themselves through their own propaganda. Instead you offer at best maintaining a status quo which has only moved rapidly Left, all legally I may add, in quick fashion brilliantly painting the Right as everything they say we are, destroying any chance for winning the people. The lone instance of the Right taking kinetic action ended in further fragmentation and government empowerment from its lack of preparation or realization of mass base. This from a government, may I remind you, without the aforementioned complete control of the Judicial Branch.
Some will simply at this point revert to the intellectual cop-out, there’s no voting our way out of this, that may be true, but absolutely will be true post-2016. No solution ever follows such statements. Associated is cries of a rigged game all along, which can neither be proved nor disproved, thus should be squelched if real results are desired. A Solution? Work harder now to do all you can. You do vote- if for this once and once alone. This also means one doesn’t dismiss all options until there is no option, but commit to the first option (ballots) while preparing for the next (bullets). Organize within your communities. Gain stature and build social capital. We are dangerously close to replacing Bullets for Ballots, an outcome as one who’s seen what that looks like no one should be hoping for, but without the first there may be little chance of success from the second. Revolution likely will not turn out the way you wish. And with a Democratic Socialist victory, only the voices allowed to remain will remain, crushing any meaningful resistance before it forms, save for those who’ve followed advice of a very few.
Dwell on that one.
Until that time, coming sooner rather than later, I challenge the reader to at least forsake the laity faux-philosophy that merely makes one feel better about the world prevalent in the ‘liberty movement.’ It’s all been covered long ago by people further down the road than we, with a better snapshot of what social upheaval looks like from the ground level than the ‘philosophers’ who keep telling us, minus any real experience. With that, certain voices should not only be hereby rejected entirely, but exposed exactly for the surrogates they are- may you never forget for whom side they advocate.
I leave you with a quote from a man whom everyone concerned should become familiar with, if not already:
Politics is a strong and slow boring of hard boards. It takes both passion and perspective. Certainly all historical experience confirms the truth – that man would not have attained the possible unless time and again he had reached out for the impossible. But to do that a man must be a leader, and not only a leader but a hero as well, in a very sober sense of the word. And even those who are neither leaders nor heroes must arm themselves with that steadfastness of heart which can brave even the crumbling of all hopes. This is necessary right now, or else men will not be able to attain even that which is possible today. |
[Clinical significance of survivin and caspase-3 expression in diffuse large B-cell lymphoma].
To investigate the expression of survivin and caspase-3, and its correlation with prognosis in diffuse large B-cell lymphoma (DLBCL). From 1997 to 2000, 94 DLBCL patients were studied on the expression of survivin and caspase-3 detected by immunohistochemical stain. The relationship between the expression of surviving and caspase-3 and prognosis were analyzed by SPSS 10.0. The positive expression rate of survivin and caspase-3 was 68.1% and 76.6%, respectively. The expression of survivin and caspase-3 were significantly correlated with the "international prognostic index" (IPI) (P < 0.05). Patients with positive expression of survivin and caspase-3 were found to have higer replase risk, and patients with positive survivin expression had poorer overall 5-year survival than those with negative expression (31.3% vs 64.0%, P < 0.05). Positive survivin expression was found to be an independent poor prognostic index for DLBCL by Cox regression model. Survivin and caspase-3 are useful in therapeutic and prognostic assessment. Poor prognostic patients can be screened out in the early treatment period using expression of survivin and caspase-3 combined with IPI, which may help to improve the outcome of diffuse large B-cell lymphoma. |
Tag: astrologer Ahmedabad
There are several astrologers and people who are practicing the astrologer practices in India but a very few of them have achieved the perfection in the field of astrology. Though, every astrologer stats that he provides overall astrological solutions to his clients but the reality is many of them fake the words and they mislead the people. Therefore, it is very important for you all that if you are facing any astrological issues you must take the help of stupendous astrologer in Ahmedabad who is world famous for his services and is having ample quality experience in the field.
The renowned astrologer is having required qualifications and degrees in the field of astrology and apart from this he is practicing the classical methods of astrology for more than past 3 decades. And in this time span he has handled various kinds of astrological issues and problems. And he is known for his success stories for the problems faced by his clients once in their lives. There are certain areas in which you can always get the most desired results for your astrological issues.
Get My Love Back
Today, most of the youngsters and the adults are facing love related issues in their lives. And because of different types of misunderstandings and problems people lose their love partners. But the world famous astrologer can help you out in all the way possible to get your love back in life. You are required to have great faith in his practices and he will surely get you your love partner back.
Vashikaran Specialist
If you have lost your love partner because of some issues, if your love life is not going on track, if your partner is not reacting towards you, or if you want to take revenge from your enemy then you must approach the world class vashikaran specialist in your town and you can get your issues fixed as quick as you want them to be. The astrologer is well known for his vashikaran practices and 100 percent result performance. By vashikaran he will get you, your love partner back in your life. If you want to get married with your desired life partner then he can help you to get your love partner.
Love Marriage Specialist
Most of the people from different areas are facing this problem of love marriage. The main cause behind it are inter-caste relationship, different religion issues, class and status issues, misunderstanding between the love partners, family issues, effects of bad spells etc. All these love marriage related problems can be well handled and resolved with the help of most famous love marriage specialist astrologer in the city.
Business Solutions
If your business is not running successfully, if you are planning to open a new business, if you are planning to expend your existing business, and if you feel that your ways are blocked due to some astrological issues. Then you can straight away meet the world famous astrologer for business solutions in Ahmedabad. He will provide you the right solution related with vastu shastra; he will help you to reduce the astrological effect from your life and business.
Conclusion:
The astrologer is well versed and strongly equipped with the classical methods and techniques of astrology and he practices all these methods by implementing the latest technology and gadgets in his practices. You can get the best solutions for all your astrological problems from the marvelous astrologer in your town.
Ahmedabad is the largest city of the Gujarat state in India. It is situated in the North-West region of the country. Ahmedabad is well known for its trade and business. Ahmedabad covers the large share of land in Gujarat. People of this state and in the city of Ahmedabad our traditional and they are religious too. They follow and believe the astrologer strongly. Because of the competition these days it is very difficult to find genuine astrologer services in India. But you can meet a meritorious astrologer in Ahmedabad for all your astrological problems.
Everyone is facing one or the other astrological problems in their lives and they keep trying to find the suitable solution for their problem but hardly some people get the right professional to resolve their issues. But if you are facing any love issues, career oriented issues, education problems, after marriage issues, business problems, social image problems, black magic effect and bad spell problems etc. Then you can get all your answers in Ahmedabad itself from the great astrologer in the town.
What Makes an Astrologer in Ahmedabad?
The astrologer is famous worldwide because of his expertise in the field of astrology. He is the most qualified professional and not only this but he is having the relevant quality experience of over three decades as a successful astrologer catering to the national and international clientage and their different types of astrological problems. He is always referred by the old clients for his extraordinary services in the field of astrology. The astrologer has maintained his knowledge and has upgraded his techniques according to the current scenario and the technological advancement in the global market. Therefore, he is well configured with the latest technology and the classical methods of astrology.
Characteristics of Astrologer
An astrologer is a strong bridge between the stars, planets and the human lives on earth.
Astrologer is an optimistic personality who transfers the same vibes in his clients while giving them the solutions.
An astrologer is a well qualified degree holder in the astrology field.
Astrologer also practices psychology during his treatment process starting from the first day with his client.
An astrologer is always upgraded with the technology and he knows how to fusion it with the classical techniques for astrology.
Astrologer works for the betterment of the society as he resolves all the extreme issues of the human beings.
An astrologer practices hypnotism to overcome the mental issues of the patient.
Astrologer provides the best possible solutions against the effects of black magic and bad spells.
An astrologer puts his all efforts to empathies with his client.
Astrologer believes in providing the solutions rather in failures.
An astrologer works as a master key for all the astrological issues and queries.
Conclusion:
Astrologer provides you the best possible solutions for your issues related with astrology. He is the one who can tell you about your recent future events and he can study your horoscope. So if you are looking for a fix of your problems in life-related with astrology then you can approach the meritorious astrologer in Ahmedabad and you can get the positive results within 24 hours of time.
India is the country of devotees, religious people, people who have faith in the presence of almighty. And we all believe that somehow, for all our problems and issues there is some powerful solution lies in the hands of astrologers. Astrologers are the professionals who are capable of resolving all our problems little or gigantic ones. If you once trust on the wisdom of the astrologer then you can get your solutions. For your every problem you can get best astrologer services in Ahmadabad. It is really important to understand that an astrologer is a person who has studied and practiced the astrology thoroughly. And on the basis of certain ancient principles and methods they provide you the key for your problems in life.
Because of the technological enhancements now you can avail all these astrological services on your telephones or on your e-mails too. Ahmadabad is a big city of India which is famous for its businesses and the businessmen who are well versed in their domains. They also believe in the destiny, luck and astrology.
There are certain areas where you strongly need the help of astrologer if one of these issues is there in your life.
If you are not able to focus in your education
If your career is not coming on the track
If you are having issues from the family
If your relationship is messed up with your spouse
If you want to have the desired love partner
If you are not succeeding in anything
If your health is not getting stable even after medications
All issues related to you and your family will be resolved with the guaranteed solutions. All you need to do is to have faith and you need to approach the astrologer once. Ahmadabad is a place where you can find the best astrologer and the quick fix to your problems. People not only from India but from all over the world visit to the astrologers in Ahmadabad for their different issues and they have got positive results from the consultation of the astrologer. So, you can very well understand that these are the professionals, strongly equipped with the skills and the equipments.
The most important and amazing fact of the astrologer is that he will not discriminate among the poor or rich, great caste or lower cast, public image or a layman. His religion is humanity and he will serve you without biasness.
Conclusion
As a human being, you will face a number of problems and you will witness the failures, bad times, rejections, you will be hopeless. But, if you have a strong belief in the powers of the universe, then you will find the solutions for your problems. You just need to push yourself further and ask for your solutions from the astrologer. The best astrologer services are available in Ahmadabad to Call us +91-9099444435 or mail me astronkbaba@gmail.com. You can meet the astrologer in person or you can share your issues on phone too. The astrologer has all the keys for all your trouble locks.
Tips: Manglik Dosh Nivaran
Astrologer Narayan Kalyan Ji According to the prevalent definition of Manglik Dosh in Indian Astrology, it is said that if Mars is placed in any of the houses 1,2,4,7,8 or 12, in a Horoscope where the rising sign or the Ascendant is taken as the first house, Manglik Dosh is said to be formed in that horoscope. |
Q:
Prove Fibonacci sequence mod 10 is periodic
The proof I saw uses the pigeonhole principle. They list the first $101$ terms beginning with $1,1,2,3,5,...$ and then group them in pairs, $(1,1),(1,2),(2,3),...$, and this gives us $100$ pairs. Now, since the pair $(0,0)$ can't occur, we must have a pair that repeats, and a pair occurring again, will lead to the same sequence.
My question
Why is it that in the $100$ pairs, there are only $100$ possible choices of pairs? and getting rid of $(0,0)$ implies that there are only $99$ left to choose from?
Thanks in advance
A:
If we are taking the Fibonacci sequence modulo $10$, then the only possible values the sequence can take are $0$ through $9$. You cannot pick a number that lies outside of this range, so there are only $100$ choices for pairs. How would you possibly pick something that is not a part of these $100$ pairs?
You are correct in that getting rid of $(0,0)$ implies there are only $99$ pairs left to choose from. This doesn't change the logic of the proof, it only makes sure that we don't end up with a degenerate case.
|
This article analyzed the total factor productivity Bio Economy for generation of electricity from plants using biomass sugarcane bagasse as a renewable resource and petroleum. The data envelopment Analysis (DEA), and the Malmquist index were used to measure total factor productivity of power generation utilities connected to the national grid of Nicaragua. The results obtained by comparing sugar mills connected to the SIN was that Monte Rosa has a higher rate of increase in productivity due to the change of total factor productivity and when comparing thermal plants that employ oil in power generation the more efficient were ALBANISA, GECSA and TIPITAPA POWER; but, when comparing thermal plants and some using renewable energy Ingenio San Antonio y ALBANISA were more efficient. |
Single incision endoscopic surgery for lumbar hernia.
Single Incision Endoscopic Surgery (SIES) has emerged as a less invasive surgery among laparoscopic surgeries, and this approach for incisional hernia was reported recently. This is the first report of SIES for an incisional lumbar hernia. A 66-year-old Japanese woman was referred to our institution because of a left flank hernia that developed after left iliac crest bone harvesting. A 20-mm incision was created on the left side of the umbilicus and all three trocars (12, 5, and 5 mm) were inserted into the incision. The hernial defect was 14 × 9 cm and was repaired with intraperitoneal onlay mesh and a prosthetic graft. The postoperative course was uneventful. SIES for lumbar hernia offers a safe and effective outcome equivalent compared to laparoscopic surgery. In addition, SIES is less invasive and has a cosmetic benefit. |
Q:
Searching Lotus notes inbox with Perl
I'm trying to search through my inbox to find specific email's but there every time I try and run this script $search is uninitialized/undefined. Is there a problem with the syntax?
use Win32::OLE;
use Win32::OLE::TypeInfo;
#Create a new NotesSession, which is basically like a new Lotus Notes instance
my $Notes = Win32::OLE->new('Notes.NotesSession') or die "Could not open Lotus Notes";
#Prints the current user of Lotus Notes
print "The current user is $Notes->{UserName}.\\n";
#Gets the stuff in the listed Database
my $Database = $Notes->GetDatabase('Server', 'mail.nsf');
# Open the mail
$Database->OpenMail;
# Create a new Document, ie email
my $Document = $Database->CreateDocument;
# Send the email to someone
$Document->{SendTo} = ;
# CC the email to someone
$Document->{SendCc} = ;
# Subject of the email
$Document->{Subject} = 'Test';
my $date = $Notes->CreateDateTime("Today");
my $today = $date->DateOnly;
my $search = $Database->Search("@Tripwire",$today,5);
print $search->Count;
Thanks
A:
"@Tripwire" should be: A Notes @function formula that defines the selection criteria. This means that it needs to be a similar string as in a view selection formula. Like Sendto="@TripWire"
|
SGDK 1.51 (April 2020)
----------------------
COMPILER
* APPACK
- fixed build for 32 and 64 bit linux (thanks doragasu)
* LZ4W
- minor fix
* RESCOMP
- added new sprite optimization options to SPRITE resource (see rescomp.txt for details)
- minor tweak on binary export order (can save some bytes with LZ4W compression)
- fixed resource duplication bug
* XGMTOOL
- fixed VGM loop
LIBRARY
* fixed corrupted library binaries which were displaying a blank screen on some MD models
* MEMORY
- fixed a minor in memory packing operation
- added MEM_pack() here and there to avoid memory fragmentation
* VDP
- fixed getAdjustedVCounterInternal(..) which could return value > 255 in some rare situation
- moved VDP DMA busy checking on reset (better to do it before accessing VDP)
- VDP_setPlaneSize(..):
- added constraint on plane size
- fixed maps start address calculation (when VRAM setup is asked)
- minor change in VDP_drawImageEx(..) to do setTileMap(..) operation using CPU (DMA is actually slower here)
* added SYS_showFrameLoad() / SYS_hideFrameLoad() methods to monitor CPU frame load.
* always load font using CPU in reset process (safer)
* fixed String unit build when ENABLE_NEWLIB set (thanks doragasu)
* improved documentation in Joy unit (thanks Chilly Willy) and VDP (regarding DMA QUEUE usage specifically)
SAMPLE
* reduced memory usage on sample which use Bitmap mode by reducing DMA allocated memory
* SPRITE
- added SYS_showFrameLoad() showcase
SGDK 1.5 (April 2020)
---------------------
COMPILER
* RESCOMP
- added ALIGN directive (read rescomp.txt for more information about it)
- added UNGROUP directive (read rescomp.txt for more information about it)
- added 'compression' and 'far' field to BIN resource
- replaced Map structure export by TileMap
- minor optimization in building IMAGE tilemap
plain tiles are now ignored (taken from system tiles) when using a base tile index offset for tilemap (mapbase parameter in IMAGE resource)
- more flexible resource compilation
- ignore palette and priority for transparent pixel
- sprite can have their palette not starting at index 0
- reorganized resource data export order for better LZ4W compression and bank switch support
- added support for 1bpp and 2bpp indexed color images
- faster LZ4W tool call (embeded in rescomp now)
- preserve resource order for better BIN data compression with LZ4W
- more constrained sprite cutting process depending chosen optimization strategy
- minor fix to allow using bit 7 (color index >= 128) in IMAGE resource as priority bit in tilemap
- simplified / fixed binary compression block with alignment
- fixed a bug on possible duplicated resource export
- fixed Circle collision type export
- now return -1 as exit code on error
- replaced FileWriter by StringBuffer (faster and safer)
- minor changes and improvements to rescomp.txt file
* XGMTOOL
- fixed a small bug during sample conversion processing
* XGMROMBUILDER
- updated to last XGMTool and XGM driver version
* LZ4W
- fixed LZ4W compression which could failed in very are case
* BINTOS
- fixed data section (it was .text instead of .rodata)
* MAKEFILE
- updated 'release' target to generate symbol.txt file (always interesting to have)
- show more warnings
* forced no inlining of memset / memcpy methods to fix LTO agressive optimization issue
LIBRARY
* SYS
- added bank switch support using SSF2 mapper (allow ROM > 4MB)
- use ENABLE_BANK_SWITCH flag in config.h file to enable bank siwtch support in SGDK
- added FAR(..) directive to access a resource through bank switch if required
- added SYS_getBank(..) / SYS_setBank(..) methods
- moved RAM initialization to sys.c unit and added support for bank crossing (more control on it)
- minors changes to reset methods (simpler)
- added ROM and RAM constants (yeah, why not ^^)
* SPRITE
- added sprite frame change event callback (using SPR_setFrameChangeCallback(..) method)
- added SPR_loadAllFrames(..) to (pre)load all frames data of a SpriteDefinition to VRAM
- removed unpack buffer (replaced by DMA buffer and new DMA_QUEUE_COPY method)
- fixed a small issue with delayed update
- fixed a bug on SPR_setDefinition(..) (can display glitches as some sprites weren't always properly hidden)
- fixed internal sprite link (could occasionaly let some phantom and glitched sprites visible)
- added out of range index detection for animation and frame (debug build only)
* DMA
- added new DMA buffer for easier and better DMA queue management
- added 'bufferSize' parameter to DMA_initEx(..) function
- added DMA_setBufferSize(..) and DMA_setBufferSizeToDefault() functions to set the temporary DMA buffer size
- added new DMA_QUEUE_COPY transfer method (TransferMethod enum) to copy data to a temporary buffer before transfer actually occurs
- added DMA_allocateAndQueueDma(..) function which return a temporary buffer and queue a DMA transfer from it
- added DMA_allocateTemp(..) and DMA_releaseTemp(..) methods to allocate memory from DMA temporary buffer (use that safely)
- added DMA_copyAndQueueDma(..) function which copy data to transfer to a temporary buffer and queue the DMA transfer
- added a new generic DMA_transfer(..) function
- added DMA_doCPUCopy(..) function to do a CPU copy to VRAM/CRAM/VSRAM
- added DMA_getMaxQueueSize() and DMA_setMaxQueueSize() to get and set the queue size.
- passed the DMA queue flush loop in assembly for better control (and also faster operation as GCC was dumb about it)
- safer DMA operation on DMA_doDMA(..)
- added DMA_initEx(..) and simplified DMA_init()
- added new DMA_DISABLED flag in config.h to completely disable DMA support in SGDK (for debug purpose)
- fix for HALT_Z80_ON_DMA (stupid typo)
* VDP
- many refactoring (see refactoring section at bottom)
- TILE_USERMAXINDEX now take allocated VRAM for sprite engine in account !
- added TILE_SPRITEINDEX constant to get base tile index for the Sprite Engine
- added tilemap row update methods
- VDP_setTileMapDataRow(..) / VDP_setTileMapDataRowEx(..)
- VDP_setTileMapRow(..) / VDP_setTileMapRowEx(..)
- added tilemap column update methods
- VDP_setTileMapDataColumnFast(..) / VDP_setTileMapDataColumn(..) / VDP_setTileMapDataColumnEx(..)
- VDP_setTileMapColumn(..) / VDP_setTileMapColumnEx(..)
- added TransferMethod parameter to many tilemap set methods
- added tilemap wrapping support to VDP_setTileMap(..) and VDP_setTileMapEx(..) methods.
- added setupVram parameter to VDP_setPlaneSize(..) function
- removed vdpSpriteCacheQueue table (replaced by new DMA_QUEUE_COPY)
- re-introduced VDP_loadTileData(..) method in vdp_tile.c unit (no more assembly code for this one)
- moved font loading in VDP_resetScreen() method (fix)
* PALETTE
- fixed palette fading so it correctly trigger during vblank (avoid CRAM dot)
- fixed minor issue in palette fading (sometime not properly doing last fade step)
* MEMORY
- fixed MEM_getLargestFreeBlock(..) method
- added MEM_pack() method to help reducing memory fragmentation
- removed MEM_init() access as it's not safe to call it externally
- increased stack size to 0xA00
* MATHS
- fixed getLog2Int(..) method
- replaced sin tabs to use FIX32/FIX16 (thanks to FireRat for the generator)
* TYPES
- added new rorxx(..) / rolxx(..) functions which are correctly turned into ROR / ROL instruction when optimization are enabled
* Z80
- fixed Z80 enable restoration on DMA
* general cleanup and refactoring
SAMPLE
* Updated for SGDK 1.5 changes
* BENCHMARK
- added memory information at startup
- some changes to adapt to last SGDK
* SPRITE
- updated resources to use large backgrounds
- updated to support long scrolling > 512 px (vertical and horizontal) !
- as collision is not implemented, added physic settings using START button so we can play with vertical scrolling too
- enemies sprites frames preloaded and animated using new Sprite engine features
Showcase of SPR_loadAllFrames(..) and SPR_setFrameChangeCallback(..) methods
* XGMPlayer
- updated for easier integration in XGM ROM Builder tool
* added notes and tutorial references to README.txt
REFACTORING
* TILE_USERMAXINDEX now take allocated VRAM for sprite engine in account !
* _voidCallback --> VoidCallback
* _joyEventCallback --> JoyEventCallback
* PLAN_A --> BG_A
* PLAN_B --> BG_B
* PLAN_WINDOW --> WINDOW
* VDP_PLAN_A --> VDP_BG_A
* VDP_PLAN_B --> VDP_BG_B
* VDP_PLAN_WINDOW --> VDP_WINDOW
* all references to 'Plan' keyword --> 'Plane'
- VDPPlan --> VDPPlane
- VDP_clearPlan --> VDP_clearPlane
- VDP_getTextPlan --> VDP_getTextPlane
- VDP_setTextPlan --> VDP_setTextPlane
- VDP_setAPlanAddress --> VDP_setBGAAddress
- VDP_setBPlanAddress --> VDP_setBGBAddress
- VDP_setPlanSize --> VDP_setPlaneSize
* all references to 'Map' --> 'TileMap'
- Map --> TileMap
- unpackMap --> unpackTileMap
- allocateMap --> allocateTileMap
- VDP_setMap --> VDP_setTileMap
- VDP_setMapEx --> VDP_setTileMapEx
SGDK 1.41 (September 2019)
--------------------------
COMPILER
* RESCOMP
- added new sprite optimization options to SPRITE resource (see rescomp.txt for details)
- minor tweak on binary export order (can save some bytes with LZ4W compression)
- fixed resource duplication bug
* XGMTOOL
- fixed VGM loop
LIBRARY
* SYS
- Safer SYS_setInterruptMaskLevel() so interrupt mask is not lost after SYS_enablesInts() call
- fixed/updated SGDK logo display code
- renamed getFPS() / getFPS_f() to SYS_getFPS() / SYS_getFPSAsFloat()
* DMA
- fixed possible DMA failure on some Megadrive when Z80 access 68K BUS at same time we trigger DMA
- minor fix on autoInc restoration after DMA_flushQueue()
* VDP
- tweaked default VRAM configuration so window can be freely used anywhere.
- added VDP_getAdjustedVCounter() method to have a consistent [0..255] V-Counter (avoiding rollback issue)
- tweaked up VDP_resetScreen() method
- added VDP_setHVLatching() and VDP_setDMAEnabled() methods
* PALETTE
- fixed VDP_getPaletteColors() and VDP_getPalette(..) methods (regression)
- fixed a bug with all palette fading methods (regression)
- renamed vdp_pal unit to pal unit (so all palette methods are now called PAL_xxx)
* JOY
- added JOY_reset() method to reset controller detection without clearing JOY state change event callback
- safer JOY_setSupport(..) / gun controller implementation
- more permissive mouse id detection in mouse pooling code
- fixed an issue where an EA 4-way multitap could be incorrectly detected
* TIMER
- safer waitSubTick(..) implementation during VInt.
- fixed getSubTick() method to take care of HV counter latching when light guns are used.
* RESOURCE
- added 2 alternate SGDK logo (free feel to use it)
- minor change on library resources name
- fixed version and added alias for old resource names
* added ENABLE_NEWLIB define in config.h file for those who want to use newlib within SGDK (you need to build it by yourself)
* changed 'u16' to 'bool' where it makes sense to use 'bool' (internally they are the same type, it's just for readability).
* minors tweaks, changes and fixes here and there
SAMPLE
* XGMPlayer
- updated to make it work with last SGDK (sprite engine difference mainly)
* SOUND
- reintroduced cry SFX test for XGM driver
SGDK 1.4 (May 2019)
-------------------
COMPILER
* RESCOMP
- rewrote from scratch in java for easier evolution and easy multi OS support.
- added smart sprite cutting (detect empty space in sprite)
- many changes on SPRITE resource, don't forget to read the rescomp.txt file to see changes about this resource.
- can now disable map optimization for IMAGE resources (see rescomp.txt for more information)
* LZ4W
- added code sources (java)
- fixed compression using previous data block in ROM (updated packer to version 1.4)
* BINTOS
- fixed a stupid bug on path.
* added XGM ROM builder tool sources.
* removed RESCOMP (C version), WAVTORAW, TFMCOM and Z80DASM tools.
* added Visual Studio template.
LIBRARY
* SYS
- added SYS_setVIntAligned(..) method to force V-Int callback to align process on VBlank.
IMPORTANT: by default now SGDK *does* align the V-Int processing to VBlank so you need to disable it if you don't want it !
- added SYS_getCPULoad() to return CPU load estimation.
- added SYS_resetMissedFrames() / SYS_getMissedFrames() methods.
* DMA
- simplified DMA over capacity strategy
- minor change in debug log message
* SPRITE
- renamed SPR_init(..) to SPR_initEx(..) so now SPR_init() doesn't require any parameters by default.
- removed 'maxSprite' parameter from Sprite Engine initialization (alays use max available).
- added delayed frame update support.
- added SPR_FLAG_DISABLE_DELAYED_FRAME_UPDATE flag to disable the delayed frame update (when we are running out of DMA capacity).
- added SPR_setDelayedFrameUpdate() to change the delayed frame update state for a sprite.
- added SPR_FLAG_INSERT_HEAD flag to allow adding new sprite in first position (instead of last position by default)
- added SPR_defragVRAM() method to force VRAM defragmentation
- added SPR_addSpriteSafe(..) and SPR_addSpriteExSafe(..) methods (automatically do VRAM defrag if needed)
- fixed a bug where the last VDP sprite attribute weren't always correctly updated with visibility set to AUTO_SLOW.
- fixed a bug a sprite couldn't be allocated.
- fixed sprite visibility state when the number of used sprite changed.
- many changes to sprite structures (better handling of flip info, better ROM usage...)
* VDP
- added VDP_showCPULoad() method to display CPU load
- added VDP_waitVInt() method to wait until next VInt to happen.
- removed 'waitvsync' parameter for VDP_initFading(..) and VDP_doStepFading(..) methods (we always want VSync here)
- simplified / tweaked macros for VDP control writes
* VRAM
- added VRAM_getAllocated(..) and VRAM_getLargestFreeBlock(..) methods
* TYPE
- added bool type
- replaced u16 by bool where it needs to be
* MATHS
- updated fix32Mul() and fix32Div() definition (again, trying to find the best compromize)
- added new missing structures as Vect2D_f32, Mat2D_f32, Vect3D_xx...
- added f16 and f32 as shorcut of fix16 and fix32 types.
- added short typedefs (V2u16 = Vect2D_u16, V2f32 = Vect2D_f32, M2f16 = Mat2D_f16, M3f32 = Mat3D_f32)
* PALETTE
- removed index field from Palette structure
* JOY
- added checking for mouse / multipad read operation to avoid timeout operation when mouse or multipad is not present.
* Z80
- added volatile access for safety
* TIMER
- improved waitMs(..) method to be more accurate on small wait.
- tweaked getSubTick() method (need testing, possible regression)
* STRING
- fixed and optimized uintToStr() method
* TOOL
- memory allocation methods for unpacking now always use deep allocation regardless of the compression used (simpler and less bug prone)
- fixed LZ4W decompression using previous data block
* fixed variable initialization (last byte was not always properly initialized)
* added HALT_Z80_ON_IO define (config.h) to force Z80 halt on IO port access.
* new awesome SGDK logo (Thanks a tons to Lizardrive for making it !)
* removed useless sound drivers (MVS, TFM and VGM)
* removed old TILE_CACHE unit (replaced by VRAM unit)
* removed useless zlib
* many refactoring (sorry for that, you will need to update your old code)
* many tweaks / cleanup
SAMPLE
* updated all samples to take care of last changes made in SGDK
* BENCHMARK
- tweaked big sprite test to disable the delayed sprite update (new sprite engine feature)
- fixed sheet size (new rescomp don't allow it)
SGDK 1.34 (January 2018)
------------------------
LIBRARY
* DMA
- added DMA queue support for all (or almost all) methods supporting DMA operation
* SPRITE
- fixed timing issue when changing FRAME or ANIMATION manually.
- fixed sprite sorting when multiple depth were modified in a single SPR_update(..).
- safer sprite allocation / release.
* MEMORY
- added MEM_getLargestFreeBlock() to get the largest available block of memory.
* improved LZ4W compression (better compression rate, faster compression...)
* minors changes on method updating tilemap through X,Y position (safer)
* some cleanup
SAMPLE
* reworked benchmark sample to avoid out of memory error (^^)
SGDK 1.33 (November 2017)
-------------------------
LIBRARY
* DMA
- added HALT_Z80_ON_DMA flag in config.h to enable Z80 halt on DMA (avoid corruptions or sound issues on Tectoy MD).
- deprecated 'vdp_dma' unit now forward calls to 'dma' unit.
- added wait DMA checking (DMA fill or DMA copy operation) before doing a DMA operation.
* SPRITE
- simplified sprite sorting (always enabled, just need to use SPR_setDepth(..) method if needed)
- fixed a regression which was causing 1 frame latency in sprite update.
SAMPLE
* minor change to sound sample
SGDK 1.32 (October 2017)
------------------------
COMPILER
* added VS project for easier compilation with Visual Studio (thanks to lab313)
LIBRARY
* TIMER:
- fixed getSubTick() method (no more possible rollback)
- minor fix in getFPS() and getFPS_f() methods
* VDP:
- tweaked default VRAM memory layout
* BITMAP:
- changed get/setPixelXXX(..) methods so they now work on single pixel (not anymore doubled X pixel resolution)
- changed drawLine(..) method so it now work on single pixel (not anymore doubled X pixel resolution).
WARNING: drawLine(..) is not anymore doing clipping, use BMP_clipLine(..) first for that.
- added get/setPixelXXXFast(..) methods for fast get/set pixel operation (no clipping check)
* SOUND:
- fixed auto PCM selection when playing sample with driver 2ADPCM and 4PCM.
- fixed default tempo for PAL system with XGM driver
* SPRITE:
WARNING: you now require to set the sprite depth to use depth sorting (not anymore using the sprite Y position).
- replaced SPR_FLAG_AUTO_YSORTING by SPR_FLAG_AUTO_DEPTH_SORTING
- replaced SPR_setYSorting(..) method by SPR_setDepthSorting(..) / SPR_setZSorting(..)
- replaced SPR_sortOnYPos() by SPR_sortOnDepth()
- added void SPR_setDepth(..) / SPR_setZ(..) methods to set sprite depth
- fixed VDP_updateSprites() with DMA queue operation (prevent sprite table modifications before DMA occurs).
* STRING:
- added int16ToStr(..) and uint16ToStr(..) methods (faster than intToStr(..) or uintToStr(..) for 16 bit integer, thanks to clbr)
- optimized intToStr(..) and uintToStr(..) methods (thanks to clbr for that)
SAMPLE
* added XGM Player sample :)
* Bench:
- added some pixels / line draw tests
* Donuts:
- updated for new depth sorting refactoring
SGDK 1.31 (July 2017)
---------------------
DOCUMENTATION
* minor fix and updated to last version
COMPILER
* fixed debug build in 'build_lib' batch
LIBRARY
* JOY:
- fixed joy state variables declaration to avoid issues when GCC -O3 optimization level is used.
* SPRITE:
- added ALWAYS_ON_TOP flag to keep a sprite above others sprites whatever is sorting order.
- minor fix on sprite sort
SGDK 1.3 (June 2017)
--------------------
DOCUMENTATION
* updated to last version
COMPILER
* Updated to GCC 6.3 (thanks a tons to Gligli for that !)
- many bugs fix and new features compared to old GCC 3.4.6
- much better assembly code generation :)
- added LTO (Linker Time Optimization) support
* Modified makefile to enable LTO and improve optimization level.
* Rescomp:
- updated to handle structure changes in the Sprite Engine.
LIBRARY
* DMA:
- minor optimization to DMA_queue(..) method (thanks to HpMan)
* Memory:
- default stack size increased to 0x800 bytes (GCC 6.3 requires more stack memory :p)
* Sprite Engine:
- added automatic Y sorting (per sprite)
- added SPR_sort(..) for generic sorting
- added SPR_sortOnY(..) for generic sorting
- by default now sprite visibility is set to always ON (faster than automatic visibility)
- updated 'Collision' structure (hierarchical structure)
- some changes to internal structures to provide better performance
* VDP BG/Tile:
- fixed a minor bug in VDP_setTileMapDataEx(..) and VDP_setTileMapDataRectEx(..) methods (thanks to Alekmaul for reporting it)
* minors fixes...
SAMPLE
* Bench:
- fixed math tests for GCC 6.3
SGDK 1.22a (September 2016)
---------------------------
LIBRARY
* VDP: reintroduced the 16 plain system tiles.
SGDK 1.22 (September 2016)
--------------------------
DOCUMENTATION
* minors improvements and fixes
COMPILER
* Rescomp: fixed a minor issue in sprite resource
* XGMTool:
- added duration information to XD3 tag
- improved loop
* added the XGM ROM builder tool.
* removed GenRes from makefile
LIBRARY
* Sprite Engine:
- fixed sprite attribut update for non visible sprite
- fixed sprite list update in certain condition
* Sound:
- moved XGM driver method in a specific unit (xgm.c)
- added XGM_getElapsed(..) method to retrieve elapsed XGM music playing time (in number of frame)
- added XGM_setLoopNumber(..) to set the wanted number of loop in XGM music play.
- added interrupt protection for Z80 access
* Maths:
- reverted fix32Mul() and fix32Div() to previous version to avoid cumulative error
- added getApproximatedLog2(..) method for fast Log2 calculation (approximated)
- added getLog2Int(..) method for integer Log2 calculation
* Misc:
- moved QSort methods to tools
- added generic qsort with custom comparator callback
* VDP: more flexible VRAM tilemap configuration (window plan don't have to be first map).
* Bitmap mode: can now set bitmap mode in window plan
* changed to MIT license
* refactoring
SAMPLE
* Bench: added sprite donut animation test.
SGDK 1.21 (May 2016)
--------------------
LIBRARY
* SPRITE: fixed a bug causing corrupted sprite after SPR_release(..) operation
* TOOLS: reintroduced zlib_unpack(..) method (accidentally removed from header)
SAMPLE
* Bench:
- fixed a bug causing address error on real hardware during 'Sprite test'.
- added 2 tests in 'BG test'
SGDK 1.2 (May 2016)
-------------------
DOCUMENTATION
* several update and fixes here and there (some tags were not correctly recognized in later doxygen version).
COMPILER
* Rescomp: updated to version 1.5 (with updated documentation)
- updated SPRITE resource compilation to the new SGDK Sprite structures.
- fixed minor issue on IMAGE resource packing.
- now using constants for sound driver (less confusing, got annoying bug because of that).
- changed header 'define' name generation to avoid conflict between 2 identical named file.
- fixed a bug in tilemap optimization for flipped tiles.
- removed all packers not anymore used in SGDK.
- minor change to XGM resource to support extra parameter
- fixed a minor bug in sprite structure definition
* XGMTool: updated to version 1.64
- major structure changes for faster conversion / optimization operations
- improved VGM to XGM conversion.
- added options to disable some PCM auto processing
- new options available to handle specific case and improve conversion process
- added GD3 tag support.
- better handling of PAL/NTSC timing
- fixed pal information lost during XGC conversion.
- more accurate loop position
- fixed a minor issue in offset calculation.
- fixed VGM loop information export (when using VGM optimization)
* WavToRaw:
- fix 64-bit issues, it is still not endian safe.
- check for read errors.
* Appack: minor fix for silent parameter.
* Added new custom LZ4W packer (require Java to be installed).
* Removed GenRes tool (not anymore used and can confuse with rescomp).
* added GDB tool (not yet really used yet)
* Separated 'debug' and 'release' library build for easier profile switch.
LIBRARY
* BITMAP:
- allow to change the plan used for bitmap rendering
- added buffer preservation option (severe impact on performance)
- fixed minors issues on reset/initialization process
* DMA: added new DMA queue system in 'dma' unit, you can consider 'vdp_dma' unit as deprecated (still provided for backward compatibility).
- we can now limit the max transfer capabilities in a single frame with DMA_setMaxTransferSize(..)
- can now define the DMA queue size with DMA_init(..) method.
- added DMA_setIgnoreOverCapacity(..) to change DMA strategy when reaching max capacity.
* GRAPHIC:
- added news methods for allocation and compression stuff (see TOOLS section)
- added dynamic VRAM allocation ('vram' unit which replace 'tilecache' unit)
* PALETTE:
- fixed RGB24_TO_VDPCOLOR so it does what it says.
- better palette fading using rounding.
- fixed issue using sync fading locking interrupts (can cause XGM music lag).
* MATHS:
- added abs(..) method.
- fixed fix32ToRoundedInt() and fix32Round() defines (added parenthesis around)
- replaced distance_approx(..) by getApproximatedDistance(..)
- changed fix32 div/mul calculation strategy for better value preservation
* MEMORY:
- added MEM_getAllocated() to return current dynamically allocated memory.
- added MEM_dump() to dump in Gend KMod console the memory allocation table
* SOUND:
- renamed Z80_DRIVER_4PCM_ENV --> Z80_DRIVER_4PCM
* SPRITE: complete rewrite of sprite engine !
- many changes including the API.
- should be faster but will be more optimized in future.
* STRING:
- added isdigit(c), strnlen(..) and the very useful sprintf(..) ma
- added strncpy(..) method.
- replaced strreplace(..) --> strreplacechar(..)
- fixed fix32ToStr(..) and fix16ToStr(..) methods
* SYSTEM:
- tried to more more compatible with default GCC stdint.h definitions
- added SYS_setVIntPreCallback(..) so you can have your method called at VInt before any internal SGDK stuff are proceed.
- added SYS_isNTSC() and SYS_isPAL() methods for easy system determination.
- minor fix on SP register initialization (preserve value set in vector table)
- added SYS_hardReset() to force hard reset.
* TOOLS:
- added new LZ4W compression (very fast unpacking but average compression level)
- removed RLE, RLE_MAP and UFTC compression (LZ4W performs better in almost all cases).
- removed UnpackEx(..) method (useless now).
- added setRandomSeed(u16 seed) to initialize randomizer.
* VDP:
- renamed WPLAN / WINDOW / VDP_WINDOW --> VDP_PLAN_WINDOW
- renamed APLAN --> VDP_PLAN_A
- renamed BPLAN --> VDP_PLAN_B
- renamed SLIST / VDP_SPRITE_LIST --> VDP_SPRITE_TABLE
- renamed HSCRL / VDP_SCROLL_H --> VDP_HSCROLL_TABLE
- added planWidth / planHeight to replace VDP_getPlanWidth() / VDP_getPlanHeigth() for faster internal SGDK calculations.
- added windowWidth / windowHeight for faster internal SGDK calculations.
- added VDP_setWindowHPos(..) and VDP_setWindowVPos(..) methods to set window positions.
- fixed a bug with VDP_setBPlanAddress(..) method.
* VDP BG/TILE:
- replaced VDP_PLAN_A / VDP_PLAN_B constants by PLAN_A / PLAN_B in some methods.
- some methods now support PLAN_WINDOW parameter.
- added VDP_clearTextAreaBG(..), VDP_clearTextLineBG(..), VDP_clearTextArea(..) methods.
- modified VDP_drawTextBG(..) method.
- others minors changes.
* VDP SPRITE: major rewrite of 'vdp_sprite' unit (require project modifications) !
- replaced SpriteDef structure by VDPSprite structure (fit better hardware structure).
- added dynamic allocation of hardware sprite:
VDP_allocateSprites(..), VDP_releaseSprites(..), VDP_getAvailableSprites()
- VDP_updateSprites(..) can now use DMA queue.
- many others changes.
* XGM driver:
- better handling of main BUS contention with DMA
- added methods to improve BUS contention when using PSG sound in music.
- fixed PCM play status when PCM is used from XGM music.
- minor fix in driver code for better music frame sync.
- better pause/resume support.
- music sync is now handled on 68000 side for more flexibility (adjustable tempo).
* Z80:
- modified writeYM macros
* memory usage optimizations.
SAMPLE:
* Bench: added new sample for general test and benchmarking.
* Sound:
- minors changes about Z80 load information for XGM driver.
* Sprite:
- added basic enemies (no collision yet)
- added basic SFX
- updated to last SGDK
- some refactoring
SGDK 1.12 (March 2015)
----------------------
COMPILER
* XGMTool:
- minors changes and fixes.
LIBRARY
* SPRITE:
- added VDP_resetSpritesDirect() method.
* SOUND:
- minor fix to XGM driver (PCM in music was wrong in some case).
SGDK 1.11 (December 2014)
-------------------------
* CONTROLLER:
- fixed small issue in joystick code (Chilly Willy).
* SOUND:
- added Z80 CPU load information in XGM driver (experimental).
* Fixed small issue in joystick code (Chilly Willy).
SGDK 1.10 (December 2014)
-------------------------
COMPILER
* XGMTool:
- removed DAC enabled command (automatically handle by the XGM driver).
- added DAC enabled state (XGM driver uses it when no PCM are playing).
- now uses the VGM 1.60 'stream id' information to allow multi PCM channel for XGM conversion.
Note that each channel has its own priority as VGM music does not contains PCM priority information.
LIBRARY
* VDP:
- VDP_fade(..) method now automatically disables interrupts if needed.
* SPRITE:
- minor optimization in the Sprite Engine to quickly discard disabled sprites (visibility forced to off).
* SOUND:
- added automatic DAC enabled control (XGM driver).
- fixed issue with music pause operation on real hardware (XGM driver).
- minor tweak to reduce a bit the size of the Z80 drivers.
- removed Z80_DRIVER_4PCM which is useless (use Z80_DRIVER_4PCM_ENV driver instead).
* CONTROLLER:
- added Sega Phaser support (Chilly Willy).
* SYSTEM:
- disable library debug info.
* SAMPLE:
- updated 'Joy' sample to add Phaser test (Chilly Willy).
- updated 'Sound' sample to remove Z80_DRIVER_4PCM test and add an example of the MVS driver PCM SFX.
SGDK 1.01 (November 2014)
-------------------------
COMPILER
* fixed bugs in XGMTool.
* removed linear interpolation when converting WAV file.
* others minors changes.
SGDK 1.00 (November 2014)
-------------------------
COMPILER
* Rescomp:
- added support to XGM resource in rescomp.
* added xgmtool to convert VGM into XGM and compile XGM file.
* removed Genitile tool sources.
* updated wavtoraw to support sample interpolation.
LIBRARY
* VDP:
- added VDP_setScanMode(u16 mode) method to change the interlaced mode.
- added VDP_interruptFade() method to interrupt async palette fading.
* SPRITE:
- fixed a bug with SPR_init(..) method when using same definition, sometime timer could be not reseted and then animation is not working anymore.
- fixed declaration of VDP_setSprite(..) / VDP_setSpriteDirect(..) / VDP_setSpritePosition(..) methods.
* SOUND:
- Z80 memory is cleared before loading a custom driver.
- added Z80_read(..) and Z80_write(..) methods for simple Z80 RAM read/write operations.
- added XGM driver methods:
u8 SND_isPlaying_XGM();
void SND_startPlay_XGM(const u8 *song);
void SND_stopPlay_XGM();
void SND_resumePlay_XGM();
u8 SND_isPlayingPCM_XGM(const u16 channel_mask);
void SND_setPCM_XGM(const u8 id, const u8 *sample, const u32 len);
void SND_setPCMFast_XGM(const u8 id, const u8 *sample, const u32 len);
void SND_startPlayPCM_XGM(const u8 id, const u8 priority, const u16 channel);
void SND_stopPlayPCM_XGM(const u16 channel);
* MATH:
- minor fix in min/max defines.
* CONTROLLER:
- fixed declaration of JOY_readJoypadX/Y(..) methods (they should return s16 and not u16)
* SYSTEM:
- sega.s and rom_head.c files are now copied into the 'src/boot' project folder so they can easily be customized per project.
* SAMPLE:
- modified sound sample to add XGM driver example.
* some fixes in the doxygen documentation.
* others changes and improvements.
SGDK 0.96d (june 2014)
----------------------
LIBRARY
* removed direct VRam Map data unpacking as it was buggy.
SGDK 0.96c (june 2014)
----------------------
COMPILER
* Rescomp:
- fixed some issues on compression.
- now accept string to define which compression to use (AUTO, APLIB, RLE) in resource definition.
LIBRARY
* minors changes to Doxygen documentation.
SGDK 0.96 (may 2014)
--------------------
COMPILER
* Rescomp:
- improved BMP image support.
- byte data are now output in word format to avoid the GCC bug (compilation with "-g" flag fails when byte data is encountered).
- fixed issue on empty sprite animation detection.
- fixed path separator issue on old windows system.
- fixed compilation issues on unix system.
* Makefile:
- Added "release" and "debug" target to makefile (default is "release").
"debug" target allow you to use GDB interactive debugger through emulator supporting it.
* added appack tool sources code (compatibility for linux system).
* some cleanup in bintos tool (removed the useless sizealign command done by sizebnd tool).
LIBRARY
* VDP:
- fixed palette fading methods where the last frame colors weren't always correct.
- VDP_drawImage(..) and VDP_drawBitmap(..) now use dynamic VRAM tile index so they does not erase anymore the previous drawn image.
'curTileInd' variable which contains the VRAM tile index where next tile will be uploaded is public.
* TILE:
- fixed somes bugs in the tile cache engine.
- removed the MEM_free(..) call from the VInt callback (tile cache engine).
So we don't need anymore to disable interrupts at each memory allocation operation for safety ;)
* SPRITE:
- fixed somes bugs in the sprite engine.
- added SPR_setAlwaysVisible(..) and SPR_setNeverVisible(..) to force (not) visibility on sprite (sprite engine)
* BITMAP:
- minor performance improvement on the BMP_drawPolygon(..) method.
* SOUND:
- fixed YM2612 write methods (can have issue on MD2 system).
* DMA:
- fixed VRam Copy DMA.
* MATH:
- fixed 2D projection calculation in M3D_project_xxx(..) methods.
Now the camera distance is correctly taken in account for the final projection (adding a minor impact on performance).
* SYSTEM:
- fixed soft reset issues.
* TIMER:
- fixed a minor issue with getTime(..) method.
- waitSubTick(..) is now more accurate when called from V-Interrupt code.
* SAMPLE:
- minors changes and improvements on the Sonic Sprite sample.
- minors changes to 3D cube flat sample.
* DEBUG:
- added some KDebug log methods (KLog, KLog_Uxx, KLog_Sxx...)
* added strcmp(..) method.
* others changes and improvements.
SGDK 0.95 (feb 2014)
--------------------
COMPILER
* Major change on resource compilation:
A new resource compiler tool (rescomp) is used to compile all resource files.
It support many type of resources as BMP, PNG, WAV, PCM, VGM, TFM..
Read the rescomp.txt file to have more informations about it and look in the 'sound' and 'sprite' sample example.
You can also convert your old project by using the "rescomp -convert" command on the project folder to convert.
- added appack tool.
- minor fix in wavtoraw tool.
LIBRARY
* added GFX compression support (see tools.h file for doxygen documentation).
* VDP:
- added VDP_getBackgroundColor() and VDP_setBackgroundColor(..) methods.
- added VDP_get/setTextPlan(), VDP_get/setTextPalette() and VDP_get/setTextPriority() methods to change text drawing properties.
- added VDP_drawBitmap(..) and VDP_drawBitmapEx(..) methods to draw Bitmap resource.
- added VDP_drawImage(..) and VDP_drawImageEx(..) methods to draw Image resources.
- added VDP_loadTileSet(..) method to load TileSet resource.
- added VDP_setMap(..) and VDP_setMapEx(..) methods to load Map resources.
- lot of refactoring in the setTileMap methods...
- some tweaks.
* TILE:
- added new tile cache engine for easier tile allocation in VRAM.
See the tile_cache.h file for doxygen documentation.
* SPRITE:
- added sprite engine for easier sprite manipulation.
See the sprite_eng.h file for doxygen documentation and the included "sprite" sample for an example.
* SOUND:
- added TFC_isPlaying() command for the 68k TFM driver.
- fixed issue with consecutive play command on TFM Z80 driver.
- Improved VGM driver (thanks to kubilus1 and sigflup).
You can now pause, resume music and even better play PCM SFX !
- now clear Z80 memory on driver loading to avoid any problems with var initialization.
* DMA:
- minor change to VDP_doDMAEx(..) method, be careful if you use this method, the last parameter changed.
* JOY:
- added JOY_waitPressTime() and JOY_waitPressBtnTime() methods.
- JOY_waitPressBtn() and JOY_waitPress() now return button pressed info.
* MEMORY:
- fixed a minor buf with dynamic memory allocation.
* SYSTEM:
- added SYS_disableInts() and SYS_enableInts() methods.
- added SYS_isInInterrupt() to detect if we are in an interrupt callback.
- added SYS_getAndSetInterruptMaskLevel(..) method to "atomically" get and set interrupt mask level.
- added SYS_die(..) for fatal error handling.
* library font is now included as an image.
* added some logs for easier debugging (KDebug message).
* many others smalls improvements.
* lot of refactoring.
SGDK 0.94 (feb 2013):
---------------------
* Major rewrite of the Bitmap engine:
- Fixed 256x160 resolution.
- Removed all specifics flags as it now always use deferred flip operation with extended blank.
- Simpler and easier to use.
- Better performance (20 FPS in NTSC, 25 FPS in PAL).
- Backface culling now directly handled in the BMP_drawPolygon(..) method.
- Removed useless FF BMP engine (too complex, incomplete..)
- Many others changes you will discover :)
* Added "Bitmap" structure for better bitmap handling.
SGDK automatically convert 16 colors bitmap images to "Bitmap".
* Major rewrite of Maths3D engine:
- Added many 3D related structures (as matrix, transform..).
- More flexibility.
- Improved performance (not much).
* added DMA capability to VDP_setHorizontalScrollxxx(..) / VDP_setVerticalScrollTile(..) functions.
* Added VDP_doDMAEx(..) so we can specify if we modify the VRam step.
* Refactored palette functions.
* Fixed QSort function.
* Removed useless VRAM table (eat rom space for minor speed boost).
* Minors fixes/tweaks in memset and memcpy functions.
* Updated WavToRaw tool (now support any output rate).
* Added Genitile 1.7 sources.
* Minors tweaks on makefile.
* Fixed a minor issue in rom_head (Thanks Chilly Willy).
* Updated demo samples.
* Others minors changes or improvements. |
/**
* Aptana Studio
* Copyright (c) 2005-2013 by Appcelerator, Inc. All Rights Reserved.
* Licensed under the terms of the Eclipse Public License (EPL).
* Please see the license-epl.html included with this distribution for details.
* Any modifications to this file must keep this entire header intact.
*/
package com.aptana.editor.epl;
import org.eclipse.core.runtime.Platform;
import org.eclipse.swt.widgets.Display;
import org.eclipse.ui.plugin.AbstractUIPlugin;
import org.osgi.framework.BundleContext;
import com.aptana.editor.decorator.ProblemMarkerManager;
/**
* The activator class controls the plug-in life cycle
*/
public class EditorEplPlugin extends AbstractUIPlugin
{
// The plug-in ID
public static final String PLUGIN_ID = "com.aptana.editor.epl"; //$NON-NLS-1$
public static final String DEBUG_SCOPE = PLUGIN_ID + "/debug"; //$NON-NLS-1$
public static final boolean DEBUG = Boolean.valueOf(Platform.getDebugOption(DEBUG_SCOPE)).booleanValue();
// The shared instance
private static EditorEplPlugin plugin;
private ProblemMarkerManager fProblemMarkerManager;
/**
* The constructor
*/
public EditorEplPlugin()
{
}
/*
* (non-Javadoc)
* @see org.eclipse.ui.plugin.AbstractUIPlugin#start(org.osgi.framework.BundleContext)
*/
public void start(BundleContext context) throws Exception
{
super.start(context);
plugin = this;
}
/*
* (non-Javadoc)
* @see org.eclipse.ui.plugin.AbstractUIPlugin#stop(org.osgi.framework.BundleContext)
*/
public void stop(BundleContext context) throws Exception
{
plugin = null;
fProblemMarkerManager = null;
super.stop(context);
}
/**
* Returns the shared instance
*
* @return the shared instance
*/
public static EditorEplPlugin getDefault()
{
return plugin;
}
/**
* Returns the standard display to be used. The method first checks, if the thread calling this method has an
* associated display. If so, this display is returned. Otherwise the method returns the default display.
*
* @return returns the standard display to be used
*/
public static Display getStandardDisplay()
{
Display display;
display = Display.getCurrent();
if (display == null)
{
display = Display.getDefault();
}
return display;
}
/**
* Returns a {@link ProblemMarkerManager}
*
* @return {@link ProblemMarkerManager}
*/
public synchronized ProblemMarkerManager getProblemMarkerManager()
{
if (fProblemMarkerManager == null)
{
fProblemMarkerManager = new ProblemMarkerManager();
}
return fProblemMarkerManager;
}
}
|
World’s Richest 80 People Own Same Amount as World’s Bottom 50%
Oxfam’s recent report, “WEALTH: HAVING IT ALL AND WANTING MORE” contains shocking figures that the press haven’t sufficiently publicized; so, the findings and the reliability of their sources will be discussed here. The results will then be related to the central political debate now going on in the U.S. Presidential contests for 2016, which is about equality and inequality.
First, the findings:
1. The richest 80 individuals own as much as do all of the poorest half of humanity.
2. During 2009-2014, the wealth of the 80 richest people doubled, yet the wealth of the bottom 50% declined slightly.
The Forbes list is one of two such lists, the other being Bloomberg. The two are generally in rather close agreement, but sometimes disagree enormously. For example, as of 8 May 2015, Bloomberg shows Sweden’s Ingvar Kamprad, the owner of Ikea, as #8 owning $43.1B, but Forbes shows him as #497 owning $3.5B.
Furthermore, Newsweek on March 2nd headlined “Why Putin Isn’t on ‘Forbes’ Billionaires List,” and reported that, “Forbes excludes members of royal families and ‘dictators who derive their fortunes entirely as a result of their position of power.’ Although it details this caveat, the magazine offered limited insight into the exact reason Putin was left off. When asked about Putin, a spokeswoman for Forbes told Newsweek: ‘Vladimir Putin is not on the list because we have not been able to verify his ownership of assets worth $1 billion or more’ and cited the methodology. The spokeswoman and [Assistant Managing Editor Kerry] Dolan did not comment directly as to whether the magazine considered Putin a dictator, and thus exempted him from the list by this classification. A reporter who worked on the list did not reply to a request for comment.” So: royals, and “dictators,” are both left off the list. Also: Dolan said that the magazine attempts to obtain the cooperation of listees but that “some cooperate; others don’t.”
Forbesitself says that, “We do not include royal family members or dictators who derive their fortunes entirely as a result of their position of power, nor do we include royalty who, often with large families, control the riches in trust for their nation. This means the wealthy royal families of the United Arab Emirates, Saudi Arabia and other Gulf countries are not eligible for our global wealth ranking. (These monarchs, like Khalifa bin Zayed Al-Nahyan and Saudi King Abdullah bin Abdul Aziz Al Saud, land on our list of The World’s Most Powerful People.)”
Consequently, the Forbes ranking is quite unreliable; and, on top of that, it is methodologically opaque. Leaving royalty off of their list is automatically excluding the royalty in England, Saudi Arabia, and other countries, where those people might well be the richest ones in their nation, if not the richest people in the entire world.
The Forbes ranking is thus untrustworthy, because it automatically excludes entire groups of people which might include many who are wealthier than any who are on their list. However, all that this means is that many people might exist who are even wealthier than the ones that show up as being among the top 80 on the Forbes list. Consequently, the Forbes list systematically under-states the wealth of the people who are actually the world’s 80 richest. The richest 80 could conceivably even be an entirely different list. Therefore, perhaps the richest 80 own far more than do the poor half of Mankind. But they almost certainly don’t own less than do the poor half of Mankind. In any case, they own at least as much as do the lower half.
The source on the global wealth-distribution:
The source that’s used to calculate the amount of personal wealth in the entire world and its nation-by-nation distribution, Credit Suisse, is overwhelmingly regarded as the most thorough that exists on this subject. Its research-team was selected by Anthony Shorrocks, who had long headed the UN’s World Institute for Development Economic Research, which is the leading research institute on global wealth-distribution.
However, yet again, the available data exclude a lot at the very top. For example, since the Saudi and other royals and dictators are disappeared from even the pretense of being calculated for possible inclusion into world’s-richest lists, the wealth-distributions for many Arabic and other totalitarian countries — and for constitutional monarchies such as in Norway, Netherlands, UK, Morocco, and Jordan — are necessarily based on much guesswork. Consequently, global wealth-inequality is being systematically underestimated, even in the best available source. Yet, even so, what can be publicly determined about global wealth-inequality is staggering:
The Credit Suisse Global Wealth Databook 2014 presents on its page 98, a global wealth pyramid, which indicates that the world’s richest 0.7% (35 million people) own $115.9 trillion, while the poorest 99.3% (4,665 million people) own $147.3 trillion. It also shows that the richest 8.6% own $224.5T (trillion), while the poorest 91.4% own only $38.7T. (Or, in other words: the richest 8.6% own 5.8 times as much as do the poorest 91.4%.)
Consequently, if the transfer of wealth from the many to the few is to continue, then the main way for that to happen will need to be by the super-rich receiving their added wealth from the lesser-rich, because the percentage of wealth that exists amongst the non-rich — the lower 91.4% — is only 17% of the globe’s total wealth, which isn’t much; and, even if all of that were to go to the richest 8.6%, it still would increase their current $224.5T to $263.2T, a 17% rise. However, from 2009 to now, the wealth of the richest 80 humans has actually more than doubled; so, even a 17% rise would be far less than the 80 richest are accustomed to — especially over such a multi-year time-period as was 2009-2014. Those 80 people would then be feeling shortchanged.
This is why the richest 80 people will need to be getting their increases, in the future, mainly from the richest 8.6%. Wall Street and other major financial centers are perhaps in the best position to achieve that.
The Credit Suisse Global Wealth Databook 2014 presents, on page 124, its categorization of countries according to equality-inequality, and they apply for this purpose a methodology that minimizes the distortive influences such as have been mentioned here. Here is their resultant listing:
As is clear there, the United States is listed in the highest-inequality category; and, so, no reasonable question exists that inequality is even more extreme here than it is in most of the world’s countries.
On May 4th, Gallup headlined “Americans Continue to Say U.S. Wealth Distribution Is Unfair,” and reported that, in response to the question, “Do you feel that the distribution of money and wealth in this country today is fair?” 63% say no, and in 1985 it was 60% saying no to that question. The highest percentage saying no was 68% right before the 2008 crash, and the lowest was 58% immediately after that crash. By 56% to 34%, Republicans right now are saying that the wealth-distribution is fair. By 86% to 12%, Democrats say that it’s not. (Among the overall population, 63% say it’s unfair, and 31% say it’s fair. That’s a two-to-one margin.) The poorer a person was in Gallup’s study, the likelier he or she was to say it’s “unfair.” The richer he was, the likelier to say “fair.” In other words: only at the very financial top is the belief commonly held that the existing wealth-distribution is “fair.” However, Republicans, of any amount of wealth, think that it’s “fair”: virtually all Republicans agree with the very rich about the fairness of the wealth-distribution, and virtually all non-Republicans don’t agree with that. (The only problem for non-Republicans is how to solve it.)
The only U.S. Presidential candidate who focuses, and stands clearly, on the side of this issue that says it’s “unfair” (which, as was just pointed out, Gallup finds to be by two-to-one, the norm) is Bernie Sanders, who is running in the Democratic Party. Unlike Obama and the Clintons, he acknowledges that it’s the basic problem, and that shunting it off onto “equality of economic opportunity” is essentially fraudulent. All of the other candidates are raising their campaign-funds from the top 1% of America’s wealth-pyramid, who are the very people the likeliest to believe that the present wealth-distribution is fair. Those candidates are raising their campaign-funds from the few people who own almost everything that there is to own, and these are also the people who have the most to lose. Senator Sanders is raising his campaign-funds from the many people who own almost nothing. While other candidates need to serve the rich, Sanders needs to run an authentically grass-roots campaign, which can defeat far-better-financed opponents, or he otherwise stands no real chance of winning.
This situation is called ‘democracy’ in the United States, but other terms are used for it in other countries. The only scientific study that has been done of the question of whether the U.S. is a democracy has found that it definitely is not. In order to make it one, profound change would be required. However, America’s richest need to convince America’s public that the nation already is a democracy, because, otherwise, America’s public won’t continue to accept rule by the super-rich — the people who finance almost all major politicians and who benefit from the current dictatorship. And that would cause the public to vote against any candidate who is receiving most of his financial support from the super-rich, which is almost all candidates. So: the only possible way to overcome any such tendency of the public to vote against the interests of the rich is to distract the public from that entire issue, onto personalities and other such distractions.
Consequently, it is to be expected that, in the 2016 contests, the best-financed candidates will be promoted by advertisements and issues that distract and deceive, instead of inform or educate, the public. That will be a contest between well-financed lies, and poorly financed truths. Perhaps by Election Day, the poorly financed truths will have been totally drowned-out. That way would lead to hellish future for the United States.
The 2016 contests will be of major historical importance: if the movement into democracy doesn’t win in 2016, then its likelihood of succeeding in the future will be virtually nil (since the current direction is toward increased dictatorship by the super-rich). The 2016 elections will be do-or-die for future democracy in the U.S. If for no other reason than this, the 2016 Presidential contests will be hugely important. If the poor come out in record numbers in the Democratic primaries and then, if Sanders wins the nomination, in the final election, then economic inequality in the U.S. will be reduced and equality of economic opportunity in the U.S. will increase, and so the future for the United States will be improvement. Otherwise, America’s future will be grim, no matter how well America’s top 0.1% will be living.
America has a huge problem; and, if it’s ignored in 2016, as it has been ignored ever since Ronald Reagan won the White House in 1980, then America will, virtually certainly, spiral down into hell.
The problem is real; it has to be grappled-with, now, or else. It’s now, or it’s never. That’s the 2016 choice, for Americans — and, then, perhaps, for the rest of the world, and for all of the human future. That’s what is at stake, in the 2016 U.S. elections. The data make this clear.
Nice, Eric; thank you. The parasitic forces at work will continue until stopped by lawful arrests for obvious crimes in market rigging, fraud (such as calling what we use for money as “money” rather than debt, and telling us increasing debt is “good” for us), unlawful Wars of Aggression all based on lies, and complicit corporate media to “cover” these crimes.
konst
I think that’s only on paper. Meaning much of that wealth was created ex nihilo and then used as if that debt was real money which it isn’t. In an honest money situation that “wealth” will disappear. What will those “elites” do to prevent that?
Bob
The world’s wealthiest people never appear on any list. When’s the last time you saw a Rothschild or Queen Elizabeth on a list? The Forbes list is a joke. It’s more of an advertisement as opposed to anything with meaning.
jadan
Agreed that the 2016 contest is pivotal for the resurrection of a suppressed democratic polity, as the 2000 contest was for locking the US into a fascist paradigm, the “war on terror”. Unfortunately, the populist democratic movement ( that hasn’t taken shape yet!) is built around the rhetoric of just one US leader, Bernie Sanders. Admirers of Elizabeth Warren are part of this constituency. Sanders surely anticipates a groundswell if he believes he can actually win. If he does not ignite public opinion, the light may go out entirely. The elite that owns everything is not democratic. It is a revivified aristocracy that went underground in the late 18th Century and emerged again in the late 19th Century with the image of John D Rockefeller handing out dimes to the wretched masses who believed in the “equality of opportunity”, and still do to this day! Fools!
FAIR USE NOTICE: This site contains copyrighted material the use of which has not always been specifically authorized by the copyright owner. We are making such material available in our efforts to advance understanding of political, economic, scientific, and educational issues. We believe this constitutes a 'fair use' of any such copyrighted material as provided for in section 107 of the US Copyright Law. In accordance with Title 17 U.S.C. Section 107, the material on this site is distributed without profit to those who have expressed a prior interest in receiving the included information for research and educational purposes. For more information go to: |
91 F.3d 149
NOTICE: Eighth Circuit Rule 28A(k) governs citation of unpublished opinions and provides that they are not precedent and generally should not be cited unless relevant to establishing the doctrines of res judicata, collateral estoppel, the law of the case, or if the opinion has persuasive value on a material issue and no published opinion would serve as well.James Edward WRIGHT, Jr., Appellant/Cross-Appellee,v.CALION LUMBER COMPANY, Appellee/Cross-Appellant.
Nos. 95-3596, 95-3722.
United States Court of Appeals, Eighth Circuit.
Submitted: July 8, 1996Filed: July 9, 1996
Before BEAM, LOKEN, and MORRIS SHEPPARD ARNOLD, Circuit Judges.
PER CURIAM.
1
James Edward Wright, Jr., an African-American, sued his former employer, Calion Lumber Company, alleging that Calion discriminated against him on the basis of his race by subjecting him to adverse employment conditions after learning that Wright was married to a Caucasian woman. Following a three-day trial, an eight-member jury delivered a verdict in favor of Calion, and the district court1 entered judgment dismissing the case. Wright appeals, and we affirm.
2
Wright's first argument--that his appointed attorney rendered inadequate representation--does not entitle him to relief in this appeal. See Glick v. Henderson, 855 F.2d 536, 541 (8th Cir.1988) (litigant in civil proceeding has no constitutional or statutory right to appointment and effective assistance of attorney).
3
Wright next argues that only one of the jurors was a member of a minority group. Significantly, Wright does not argue that the jury venire panel was compiled in an unconstitutional or illegal manner, or that Calion exercised peremptory challenges to strike jurors from the panel on the basis of their race. Cf. Edmonson v. Leesville Concrete Co., Inc., 500 U.S. 614, 616, 628-31 (1991); Floyd v. Garrison, 996 F.2d 947, 949 (8th Cir.1993). This claim also fails.
4
Finally, Wright complains that all of the witnesses testified he was the victim of discrimination, the witnesses for Calion were biased, and the jury ignored testimony that his supervisor used the word "nigger" on the job site. However, this is not a sufficient basis for overturning an adverse jury verdict.
5
Accordingly, we affirm. We also dismiss Calion's cross-appeal at its request.
1
The HONORABLE WILLIAM R. WILSON, JR., United States District Judge for the Eastern District of Arkansas
|
/*!
* jQuery UI CSS Framework 1.11.2
* http://jqueryui.com
*
* Copyright 2014 jQuery Foundation and other contributors
* Released under the MIT license.
* http://jquery.org/license
*
* http://api.jqueryui.com/category/theming/
*
* To view and modify this theme, visit http://jqueryui.com/themeroller/?ffDefault=Verdana%2CArial%2Csans-serif&fwDefault=normal&fsDefault=1.1em&cornerRadius=4px&bgColorHeader=cccccc&bgTextureHeader=highlight_soft&bgImgOpacityHeader=75&borderColorHeader=aaaaaa&fcHeader=222222&iconColorHeader=222222&bgColorContent=ffffff&bgTextureContent=flat&bgImgOpacityContent=75&borderColorContent=aaaaaa&fcContent=222222&iconColorContent=222222&bgColorDefault=e6e6e6&bgTextureDefault=glass&bgImgOpacityDefault=75&borderColorDefault=d3d3d3&fcDefault=555555&iconColorDefault=888888&bgColorHover=dadada&bgTextureHover=glass&bgImgOpacityHover=75&borderColorHover=999999&fcHover=212121&iconColorHover=454545&bgColorActive=ffffff&bgTextureActive=glass&bgImgOpacityActive=65&borderColorActive=aaaaaa&fcActive=212121&iconColorActive=454545&bgColorHighlight=fbf9ee&bgTextureHighlight=glass&bgImgOpacityHighlight=55&borderColorHighlight=fcefa1&fcHighlight=363636&iconColorHighlight=2e83ff&bgColorError=fef1ec&bgTextureError=glass&bgImgOpacityError=95&borderColorError=cd0a0a&fcError=cd0a0a&iconColorError=cd0a0a&bgColorOverlay=aaaaaa&bgTextureOverlay=flat&bgImgOpacityOverlay=0&opacityOverlay=30&bgColorShadow=aaaaaa&bgTextureShadow=flat&bgImgOpacityShadow=0&opacityShadow=30&thicknessShadow=8px&offsetTopShadow=-8px&offsetLeftShadow=-8px&cornerRadiusShadow=8px
*/
/* Component containers
----------------------------------*/
.ui-widget {
font-family: Verdana,Arial,sans-serif;
font-size: 1.1em;
}
.ui-widget .ui-widget {
font-size: 1em;
}
.ui-widget input,
.ui-widget select,
.ui-widget textarea,
.ui-widget button {
font-family: Verdana,Arial,sans-serif;
font-size: 1em;
}
.ui-widget-content {
border: 1px solid #aaaaaa;
background: #ffffff url("images/ui-bg_flat_75_ffffff_40x100.png") 50% 50% repeat-x;
color: #222222;
}
.ui-widget-content a {
color: #222222;
}
.ui-widget-header {
border: 1px solid #aaaaaa;
background: #cccccc url("images/ui-bg_highlight-soft_75_cccccc_1x100.png") 50% 50% repeat-x;
color: #222222;
font-weight: bold;
}
.ui-widget-header a {
color: #222222;
}
/* Interaction states
----------------------------------*/
.ui-state-default,
.ui-widget-content .`default,
.ui-widget-header .ui-state-default {
border: 1px solid #d3d3d3;
background: #e6e6e6 url("images/ui-bg_glass_75_e6e6e6_1x400.png") 50% 50% repeat-x;
font-weight: normal;
color: #555555;
}
.ui-state-default a,
.ui-state-default a:link,
.ui-state-default a:visited {
color: #555555;
text-decoration: none;
}
.ui-state-hover,
.ui-widget-content .ui-state-hover,
.ui-widget-header .ui-state-hover,
.ui-state-focus,
.ui-widget-content .ui-state-focus,
.ui-widget-header .ui-state-focus {
border: 1px solid #999999;
background: #dadada url("images/ui-bg_glass_75_dadada_1x400.png") 50% 50% repeat-x;
font-weight: normal;
color: #212121;
}
.ui-state-hover a,
.ui-state-hover a:hover,
.ui-state-hover a:link,
.ui-state-hover a:visited,
.ui-state-focus a,
.ui-state-focus a:hover,
.ui-state-focus a:link,
.ui-state-focus a:visited {
color: #212121;
text-decoration: none;
}
.ui-state-active,
.ui-widget-content .ui-state-active,
.ui-widget-header .ui-state-active {
border: 1px solid #aaaaaa;
background: #ffffff url("images/ui-bg_glass_65_ffffff_1x400.png") 50% 50% repeat-x;
font-weight: normal;
color: #212121;
}
.ui-state-active a,
.ui-state-active a:link,
.ui-state-active a:visited {
color: #212121;
text-decoration: none;
}
/* Interaction Cues
----------------------------------*/
.ui-state-highlight,
.ui-widget-content .ui-state-highlight,
.ui-widget-header .ui-state-highlight {
border: 1px solid #fcefa1;
background: #fbf9ee url("images/ui-bg_glass_55_fbf9ee_1x400.png") 50% 50% repeat-x;
color: #363636;
}
.ui-state-highlight a,
.ui-widget-content .ui-state-highlight a,
.ui-widget-header .ui-state-highlight a {
color: #363636;
}
.ui-state-error,
.ui-widget-content .ui-state-error,
.ui-widget-header .ui-state-error {
border: 1px solid #cd0a0a;
background: #fef1ec url("images/ui-bg_glass_95_fef1ec_1x400.png") 50% 50% repeat-x;
color: #cd0a0a;
}
.ui-state-error a,
.ui-widget-content .ui-state-error a,
.ui-widget-header .ui-state-error a {
color: #cd0a0a;
}
.ui-state-error-text,
.ui-widget-content .ui-state-error-text,
.ui-widget-header .ui-state-error-text {
color: #cd0a0a;
}
.ui-priority-primary,
.ui-widget-content .ui-priority-primary,
.ui-widget-header .ui-priority-primary {
font-weight: bold;
}
.ui-priority-secondary,
.ui-widget-content .ui-priority-secondary,
.ui-widget-header .ui-priority-secondary {
opacity: .7;
filter:Alpha(Opacity=70); /* support: IE8 */
font-weight: normal;
}
.ui-state-disabled,
.ui-widget-content .ui-state-disabled,
.ui-widget-header .ui-state-disabled {
opacity: .35;
filter:Alpha(Opacity=35); /* support: IE8 */
background-image: none;
}
.ui-state-disabled .ui-icon {
filter:Alpha(Opacity=35); /* support: IE8 - See #6059 */
}
/* Icons
----------------------------------*/
/* states and images */
.ui-icon {
width: 16px;
height: 16px;
}
.ui-icon,
.ui-widget-content .ui-icon {
background-image: url("images/ui-icons_222222_256x240.png");
}
.ui-widget-header .ui-icon {
background-image: url("images/ui-icons_222222_256x240.png");
}
.ui-state-default .ui-icon {
background-image: url("images/ui-icons_888888_256x240.png");
}
.ui-state-hover .ui-icon,
.ui-state-focus .ui-icon {
background-image: url("images/ui-icons_454545_256x240.png");
}
.ui-state-active .ui-icon {
background-image: url("images/ui-icons_454545_256x240.png");
}
.ui-state-highlight .ui-icon {
background-image: url("images/ui-icons_2e83ff_256x240.png");
}
.ui-state-error .ui-icon,
.ui-state-error-text .ui-icon {
background-image: url("images/ui-icons_cd0a0a_256x240.png");
}
.ui-state-fail-text .ui-icon {
background-image: url("images/ui-icons_cd0a0a_256x240.png");
}
.ui-state-pass-text .ui-icon {
background-image: url("images/ui-icons_8DC262_256x240.png");
}
/* positioning */
.ui-icon-blank { background-position: 16px 16px; }
.ui-icon-carat-1-n { background-position: 0 0; }
.ui-icon-carat-1-ne { background-position: -16px 0; }
.ui-icon-carat-1-e { background-position: -32px 0; }
.ui-icon-carat-1-se { background-position: -48px 0; }
.ui-icon-carat-1-s { background-position: -64px 0; }
.ui-icon-carat-1-sw { background-position: -80px 0; }
.ui-icon-carat-1-w { background-position: -96px 0; }
.ui-icon-carat-1-nw { background-position: -112px 0; }
.ui-icon-carat-2-n-s { background-position: -128px 0; }
.ui-icon-carat-2-e-w { background-position: -144px 0; }
.ui-icon-triangle-1-n { background-position: 0 -16px; }
.ui-icon-triangle-1-ne { background-position: -16px -16px; }
.ui-icon-triangle-1-e { background-position: -32px -16px; }
.ui-icon-triangle-1-se { background-position: -48px -16px; }
.ui-icon-triangle-1-s { background-position: -64px -16px; }
.ui-icon-triangle-1-sw { background-position: -80px -16px; }
.ui-icon-triangle-1-w { background-position: -96px -16px; }
.ui-icon-triangle-1-nw { background-position: -112px -16px; }
.ui-icon-triangle-2-n-s { background-position: -128px -16px; }
.ui-icon-triangle-2-e-w { background-position: -144px -16px; }
.ui-icon-arrow-1-n { background-position: 0 -32px; }
.ui-icon-arrow-1-ne { background-position: -16px -32px; }
.ui-icon-arrow-1-e { background-position: -32px -32px; }
.ui-icon-arrow-1-se { background-position: -48px -32px; }
.ui-icon-arrow-1-s { background-position: -64px -32px; }
.ui-icon-arrow-1-sw { background-position: -80px -32px; }
.ui-icon-arrow-1-w { background-position: -96px -32px; }
.ui-icon-arrow-1-nw { background-position: -112px -32px; }
.ui-icon-arrow-2-n-s { background-position: -128px -32px; }
.ui-icon-arrow-2-ne-sw { background-position: -144px -32px; }
.ui-icon-arrow-2-e-w { background-position: -160px -32px; }
.ui-icon-arrow-2-se-nw { background-position: -176px -32px; }
.ui-icon-arrowstop-1-n { background-position: -192px -32px; }
.ui-icon-arrowstop-1-e { background-position: -208px -32px; }
.ui-icon-arrowstop-1-s { background-position: -224px -32px; }
.ui-icon-arrowstop-1-w { background-position: -240px -32px; }
.ui-icon-arrowthick-1-n { background-position: 0 -48px; }
.ui-icon-arrowthick-1-ne { background-position: -16px -48px; }
.ui-icon-arrowthick-1-e { background-position: -32px -48px; }
.ui-icon-arrowthick-1-se { background-position: -48px -48px; }
.ui-icon-arrowthick-1-s { background-position: -64px -48px; }
.ui-icon-arrowthick-1-sw { background-position: -80px -48px; }
.ui-icon-arrowthick-1-w { background-position: -96px -48px; }
.ui-icon-arrowthick-1-nw { background-position: -112px -48px; }
.ui-icon-arrowthick-2-n-s { background-position: -128px -48px; }
.ui-icon-arrowthick-2-ne-sw { background-position: -144px -48px; }
.ui-icon-arrowthick-2-e-w { background-position: -160px -48px; }
.ui-icon-arrowthick-2-se-nw { background-position: -176px -48px; }
.ui-icon-arrowthickstop-1-n { background-position: -192px -48px; }
.ui-icon-arrowthickstop-1-e { background-position: -208px -48px; }
.ui-icon-arrowthickstop-1-s { background-position: -224px -48px; }
.ui-icon-arrowthickstop-1-w { background-position: -240px -48px; }
.ui-icon-arrowreturnthick-1-w { background-position: 0 -64px; }
.ui-icon-arrowreturnthick-1-n { background-position: -16px -64px; }
.ui-icon-arrowreturnthick-1-e { background-position: -32px -64px; }
.ui-icon-arrowreturnthick-1-s { background-position: -48px -64px; }
.ui-icon-arrowreturn-1-w { background-position: -64px -64px; }
.ui-icon-arrowreturn-1-n { background-position: -80px -64px; }
.ui-icon-arrowreturn-1-e { background-position: -96px -64px; }
.ui-icon-arrowreturn-1-s { background-position: -112px -64px; }
.ui-icon-arrowrefresh-1-w { background-position: -128px -64px; }
.ui-icon-arrowrefresh-1-n { background-position: -144px -64px; }
.ui-icon-arrowrefresh-1-e { background-position: -160px -64px; }
.ui-icon-arrowrefresh-1-s { background-position: -176px -64px; }
.ui-icon-arrow-4 { background-position: 0 -80px; }
.ui-icon-arrow-4-diag { background-position: -16px -80px; }
.ui-icon-extlink { background-position: -32px -80px; }
.ui-icon-newwin { background-position: -48px -80px; }
.ui-icon-refresh { background-position: -64px -80px; }
.ui-icon-shuffle { background-position: -80px -80px; }
.ui-icon-transfer-e-w { background-position: -96px -80px; }
.ui-icon-transferthick-e-w { background-position: -112px -80px; }
.ui-icon-folder-collapsed { background-position: 0 -96px; }
.ui-icon-folder-open { background-position: -16px -96px; }
.ui-icon-document { background-position: -32px -96px; }
.ui-icon-document-b { background-position: -48px -96px; }
.ui-icon-note { background-position: -64px -96px; }
.ui-icon-mail-closed { background-position: -80px -96px; }
.ui-icon-mail-open { background-position: -96px -96px; }
.ui-icon-suitcase { background-position: -112px -96px; }
.ui-icon-comment { background-position: -128px -96px; }
.ui-icon-person { background-position: -144px -96px; }
.ui-icon-print { background-position: -160px -96px; }
.ui-icon-trash { background-position: -176px -96px; }
.ui-icon-locked { background-position: -192px -96px; }
.ui-icon-unlocked { background-position: -208px -96px; }
.ui-icon-bookmark { background-position: -224px -96px; }
.ui-icon-tag { background-position: -240px -96px; }
.ui-icon-home { background-position: 0 -112px; }
.ui-icon-flag { background-position: -16px -112px; }
.ui-icon-calendar { background-position: -32px -112px; }
.ui-icon-cart { background-position: -48px -112px; }
.ui-icon-pencil { background-position: -64px -112px; }
.ui-icon-clock { background-position: -80px -112px; }
.ui-icon-disk { background-position: -96px -112px; }
.ui-icon-calculator { background-position: -112px -112px; }
.ui-icon-zoomin { background-position: -128px -112px; }
.ui-icon-zoomout { background-position: -144px -112px; }
.ui-icon-search { background-position: -160px -112px; }
.ui-icon-wrench { background-position: -176px -112px; }
.ui-icon-gear { background-position: -192px -112px; }
.ui-icon-heart { background-position: -208px -112px; }
.ui-icon-star { background-position: -224px -112px; }
.ui-icon-link { background-position: -240px -112px; }
.ui-icon-cancel { background-position: 0 -128px; }
.ui-icon-plus { background-position: -16px -128px; }
.ui-icon-plusthick { background-position: -32px -128px; }
.ui-icon-minus { background-position: -48px -128px; }
.ui-icon-minusthick { background-position: -64px -128px; }
.ui-icon-close { background-position: -80px -128px; }
.ui-icon-closethick { background-position: -96px -128px; }
.ui-icon-key { background-position: -112px -128px; }
.ui-icon-lightbulb { background-position: -128px -128px; }
.ui-icon-scissors { background-position: -144px -128px; }
.ui-icon-clipboard { background-position: -160px -128px; }
.ui-icon-copy { background-position: -176px -128px; }
.ui-icon-contact { background-position: -192px -128px; }
.ui-icon-image { background-position: -208px -128px; }
.ui-icon-video { background-position: -224px -128px; }
.ui-icon-script { background-position: -240px -128px; }
.ui-icon-alert { background-position: 0 -144px; } /* Yello Error Icon*/
.ui-icon-info { background-position: -16px -144px; } /*Blue Info Icon*/
.ui-icon-notice { background-position: -32px -144px; }
.ui-icon-help { background-position: -48px -144px; }
.ui-icon-check { background-position: -64px -144px; }
.ui-icon-bullet { background-position: -80px -144px; }
.ui-icon-radio-on { background-position: -96px -144px; }
.ui-icon-radio-off { background-position: -112px -144px; }
.ui-icon-pin-w { background-position: -128px -144px; }
.ui-icon-pin-s { background-position: -144px -144px; }
.ui-icon-play { background-position: 0 -160px; }
.ui-icon-pause { background-position: -16px -160px; }
.ui-icon-seek-next { background-position: -32px -160px; }
.ui-icon-seek-prev { background-position: -48px -160px; }
.ui-icon-seek-end { background-position: -64px -160px; }
.ui-icon-seek-start { background-position: -80px -160px; }
/* ui-icon-seek-first is deprecated, use ui-icon-seek-start instead */
.ui-icon-seek-first { background-position: -80px -160px; }
.ui-icon-stop { background-position: -96px -160px; }
.ui-icon-eject { background-position: -112px -160px; }
.ui-icon-volume-off { background-position: -128px -160px; }
.ui-icon-volume-on { background-position: -144px -160px; }
.ui-icon-power { background-position: 0 -176px; }
.ui-icon-signal-diag { background-position: -16px -176px; }
.ui-icon-signal { background-position: -32px -176px; }
.ui-icon-battery-0 { background-position: -48px -176px; }
.ui-icon-battery-1 { background-position: -64px -176px; }
.ui-icon-battery-2 { background-position: -80px -176px; }
.ui-icon-battery-3 { background-position: -96px -176px; }
.ui-icon-circle-plus { background-position: 0 -192px; }
.ui-icon-circle-minus { background-position: -16px -192px; }
.ui-icon-circle-close { background-position: -32px -192px; } /*Fail Icon*/
.ui-icon-circle-triangle-e { background-position: -48px -192px; }
.ui-icon-circle-triangle-s { background-position: -64px -192px; }
.ui-icon-circle-triangle-w { background-position: -80px -192px; }
.ui-icon-circle-triangle-n { background-position: -96px -192px; }
.ui-icon-circle-arrow-e { background-position: -112px -192px; }
.ui-icon-circle-arrow-s { background-position: -128px -192px; }
.ui-icon-circle-arrow-w { background-position: -144px -192px; }
.ui-icon-circle-arrow-n { background-position: -160px -192px; }
.ui-icon-circle-zoomin { background-position: -176px -192px; }
.ui-icon-circle-zoomout { background-position: -192px -192px; }
.ui-icon-circle-check { background-position: -208px -192px; }/* Pass Icon */
.ui-icon-circlesmall-plus { background-position: 0 -208px; }
.ui-icon-circlesmall-minus { background-position: -16px -208px; }
.ui-icon-circlesmall-close { background-position: -32px -208px; }
.ui-icon-squaresmall-plus { background-position: -48px -208px; }
.ui-icon-squaresmall-minus { background-position: -64px -208px; }
.ui-icon-squaresmall-close { background-position: -80px -208px; }
.ui-icon-grip-dotted-vertical { background-position: 0 -224px; }
.ui-icon-grip-dotted-horizontal { background-position: -16px -224px; }
.ui-icon-grip-solid-vertical { background-position: -32px -224px; }
.ui-icon-grip-solid-horizontal { background-position: -48px -224px; }
.ui-icon-gripsmall-diagonal-se { background-position: -64px -224px; }
.ui-icon-grip-diagonal-se { background-position: -80px -224px; }
/* Misc visuals
----------------------------------*/
/* Corner radius */
.ui-corner-all,
.ui-corner-top,
.ui-corner-left,
.ui-corner-tl {
border-top-left-radius: 4px;
}
.ui-corner-all,
.ui-corner-top,
.ui-corner-right,
.ui-corner-tr {
border-top-right-radius: 4px;
}
.ui-corner-all,
.ui-corner-bottom,
.ui-corner-left,
.ui-corner-bl {
border-bottom-left-radius: 4px;
}
.ui-corner-all,
.ui-corner-bottom,
.ui-corner-right,
.ui-corner-br {
border-bottom-right-radius: 4px;
}
/* Overlays */
.ui-widget-overlay {
background: #aaaaaa url("images/ui-bg_flat_0_aaaaaa_40x100.png") 50% 50% repeat-x;
opacity: .3;
filter: Alpha(Opacity=30); /* support: IE8 */
}
.ui-widget-shadow {
margin: -8px 0 0 -8px;
padding: 8px;
background: #aaaaaa url("images/ui-bg_flat_0_aaaaaa_40x100.png") 50% 50% repeat-x;
opacity: .3;
filter: Alpha(Opacity=30); /* support: IE8 */
border-radius: 8px;
}
|
Haemophilus influenzae is an important cause of human disease, producing both localized respiratory tract and systemic (bacteremic) infections. The initial step in the pathogenesis of disease due to this organism involves colonization of the upper respiratory tract. Despite the essential role of colonization, the determinants of this process remain poorly defined. We have developed an in vitro model for studying interactions between H. influenzae and human epithelial cells. In this model H. influenzae demonstrates efficient attachment and appreciable cell entry, properties that are likely to be important in colonization. The objective of this proposal is to define the bacterial and host cell factors involved in H. influenzae attachment and cell entry. Initially the genetic elements required for in vitro attachment and cell entry will be isolated. An attachment-deficient mutant and a recombinant strain endowed with the capacity for cell entry, both of which have already been isolated, will facilitate these efforts. Subsequently the attachment and cell entry proteins will be purified and their expression will be characterized. Following purification of these proteins, their affinity for epithelial cell surface molecules will be examined and these putative receptors will be isolated and characterized. Finally, to confirm a role for the attachment and cell entry proteins in natural colonization, H. influenzae mutants deficient in attachment and cell entry will be constructed and examined in an animal colonization model. From a practical perspective, results from these studies may form the basis for a novel approach to the universal prevention of H. influenzae disease. Perhaps more importantly, they may provide general insights into the nature of the host-microbial relationship. |
iPad Air: Thinner, faster and the best tablet in the market
iPad Air: Thinner, faster and the best tablet in the market
If you have been able to resist the temptation to indulge in recent launches, including Apple iPhones, Nokia tablets, or Google's Nexus phones, then you could probably end the year by buying the newest iPad.
Labelled iPad Air, this tablet commands your attention. Why, you wonder, when dozens of other tablets are available at much lower prices?
For starters, in 2013, Apple sold 150 million iPhones and 71 million iPads, commanding 81 per cent of the global tablet market. Plus, the Apple App Store has 475,000 apps for the iPad.
iPad Air: Thinner, faster and the best tablet in the market
Much is being made about iPad Air being the lightest full-sized tablet. Weight is an important feature to consider when investing in a handheld device. The biggest convenience can be single-handed usage of the device.
Last year's iPad 4 weighed a bit more than half the weight of a MacBook Air and the iPad Air is quite a bit less than half the weight of a MacBook Air.
iPad Air: Thinner, faster and the best tablet in the market
This makes the iPad Air a good replacement for a laptop when travelling. And the tablet is more powerful, thanks to the new 64-bit Apple A7 chip and the M7 motion co-processor, much like the new iPhone 5s.
And the chip is not a drain on the battery. The battery can last for more than a day.
iPad Air: Thinner, faster and the best tablet in the market
There's also the new Nokia Lumia 2520. Running on the Windows 8.1 OS, Nokia sweetens the deal with a 6.7-megapixel main camera capable of 1,080p full HD videos, good low-light photography and a secondary camera with video conferencing abilities.
Galaxy Note will also sport an eight-megapixel rear camera and two-megapixel front one. |
Guilla Aims Straight For Outer Space On Children of the Sun
More often than not, Houston rappers are only too happy to wear their local influences on their sleeves: a drip of Lil’ Keke here, a drab of Scarface over there and, if they’re doing it right, a fine dusting of Pimp C sprinkled over the top. And Guilla is no different, even if he sounds nothing like your average “Houston rapper.” It’s just that his influences stretch a litter farther than the usual Southside suspects.
Like, all the way to NASA.
“I’ve been a sci-fi fan my whole life, and I’ve always been into space,” says the producer and MC, who saw plenty of planet Earth traveling from place to place growing up as the son of a military man. “I’m into metaphysics and esoteric thought and all that, so I wanted to drop a project that incorporated all that stuff.”
This week, that project left the launch pad. Guilla’s new album, Children of the Sun, is a love letter to the far-out imagination and heart imbued in spacey flicks like The Fifth Element — his number-one favorite. Even before you hit play, just the song titles alone, like “Super Novas,” “Saturn” and (duh) “Outer Space” let you know where you’re headed: a wider universe beyond the Rap, Trap, and Drums that defined Guilla’s last full-length effort.
The artist says that Children of the Sun was inspired in part by the steep trajectory of his career over the past couple of years, which has seen him rubbing elbows of late with some of the brightest stars in Houston’s broader constellation of musical talent.
“Before, I was hanging around a lot of rappers,” Guilla says. “You kind of learn to rap your ass off on everything that way. But then, I started hanging around a lot more songwriters and musicians, like Fat Tony, Kam Franklin, iLL-Faded, Catch Fever — a lot of actual musicians throughout the city. Over the last year and a half, I feel like they’ve influenced my direction more than anything else.”
To be sure, Children of the Sun is a very personal project for Guilla; he wrote and produced the whole record himself. But the fingerprints of some of those folks he mentions are all over it, too. The ladies of “soul folk” trio Say Girl Say brighten up the hook on “Super Novas,” while the Suffers’ Kam Franklin smooths out the frenetic drums of “Cosmic Heartbeat.” Houston Grand Opera soprano Alicia Gianni lends an ethereal glow to the lyrical “Death of Tomoe.”
Basically, every tune on Children of the Sun sounds like it belongs to a different genre of music. And that’s exactly what Guilla was going for.
“There are different influences throughout the whole project,” he says. “I have a Spanish guitar on one song. I have a breakbeat song on there; I have a trap track on there. It’s not about the genre, it’s about the feel. It’s about the vibe that you’re in my head, that you’re in outer space.”
While the eclectic nature of Children of the Sun may make it seem as though Guilla is branching out a bit from his musical roots, it would be more apt to say that he’s exploring his deepest roots more fully. The MC grew up in a very musical household: his father was a DJ; his mother is an opera singer. He was exposed to a great breadth of sounds during his formative years. Much of what stuck involved the juxtaposition of modern beats and production work with more traditional — even ancient — musical modes.
“My dad had this Pure Moods CD when I was a kid,” Guilla says. “It was like New Age music, but it had bad-ass beats behind it. I remember as a kid being obsessed with that, wondering, ‘What the hell is this? Why is some Indian dude chanting Native American chants with a cool beat behind it? This is fire!’ I remember having that CD on repeat as a kid, and then eventually getting all of them.”
Bjork soon become another musical touchstone, not to mention the alien opera scene in The Fifth Element. Even as his appreciation for dope beats and slick rhymes deepened, Guilla remained attracted to the fearlessly sublime strangeness of those sonic expressions that touched him as a child.
“Musicians, and not just in hip-hop, will corner themselves to a little market, a little niche,” he says. “If they go outside of that, they think that they’re doing something corny, or think, ‘Oh, I’ve got to do something that everyone else is doing.’ They’re afraid to even go with their gut feeling. My approach—not that there’s a right or wrong, because it’s all philosophical—is just to go with what feels good.
“I hope that there’s a clear, distinct message in the project that it’s ok to have free thought,” he adds. “It’s OK to use your creativity.”
Guilla gives fans their first taste of Children of the Sun this Saturday at his record release show at Raven Tower. Bizzythowed, Kyle Hubbard, Mojave Red, iLL-Faded and Mark Drew will appear in support. Doors open at 6 p.m. Free. |
Date & Time
Location
Admission
Contact
Description
An "illuminating and thoughtful overview of the evolution of accessible design in the U.S. between the end of WWII...Williamson skillfully connects design concepts to changing social narratives; this work should reward readers interested in either topic." –Publishers Weekly
Bess Williamson will discuss "Accessible America: A History of Disability and Design." She will be joined in conversation by Matthew Borus. A Q&A and signing will follow the discussion.
At the Co-op
About the book: "Accessible America" provides an extraordinary look at everyday design, marrying accessibility with aesthetic, to provide an insight into a world in which we are all active participants, but often passive onlookers. Richly detailed, with stories of politics and innovation, Bess Williamson takes us through this important history, showing how American ideas of individualism and rights came to shape the material world, often with unexpected consequences.
About the author: Bess Williamson is a historian of twentieth and twenty-first century design and material culture with a particular interest in the effects of disability rights and other social movements on design culture. She is Associate Professor of Design History at the School of the Art Institute of Chicago.
About the Interlocutor: Matthew Borus is a community organizer and doctoral student in social welfare at the University of Chicago. His work explores disability rights and activism in the 20th and 21st centuries. |
Assessing the potential impact of water-based drill cuttings on deep-water calcareous red algae using species specific impact categories and measured oceanographic and discharge data.
The potential impact of drill cuttings on the two deep water calcareous red algae Mesophyllum engelhartii and Lithothamnion sp. from the Peregrino oil field was assessed. Dispersion modelling of drill cuttings was performed for a two year period using measured oceanographic and discharge data with 24 h resolution. The model was also used to assess the impact on the two algae species using four species specific impact categories: No, minor, medium and severe impact. The corresponding intervals for photosynthetic efficiency (ΦPSIImax) and sediment coverage were obtained from exposure-response relationship for photosynthetic efficiency as function of sediment coverage for the two algae species. The temporal resolution enabled more accurate model predictions as short-term changes in discharges and environmental conditions could be detected. The assessment shows that there is a patchy risk for severe impact on the calcareous algae stretching across the transitional zone and into the calcareous algae bed at Peregrino. |
10 x=320:y=200
20 color=TEST(x,y)
30 PRINT "Pen color at"; x; y; "is"; color
|
_________________________March 10, 2018 – Experiencing God’s Peace
Author: CWC Team
These people can help you live more simply, shake off insecurities, and be a better mother to your kids. When I was suffering from postpartum depression, I sought solace in the Christian mystics as a way to find language for my own intense emotions. I live in an intentional community on a farm […] |
#!/usr/bin/env sh
cd /opt/bullet
./App_ExampleBrowser
|
Main Navigation
The Genius of Ancient Man: Don Landis on RSR
Your browser does not support playing audio, please use the download link
* Real Science Radio Interviews Bible College President: Bob Enyart of Real Science Radio interviews Don Landis on his book The Genius of Ancient Man which contrasts the evolutionary paradigm of grunting cavemen with the actual widespread historical, anthropological, and archaeological evidence of a brilliant and sophisticated ancient human civilization.
* The Argument is Genius: Don Landis, college president and chairman of the board for Answers in Genesis, celebrates with his new book the brilliance and astute astronomical insights of ancient civilizations. "All over the world there are similar findings of world travel, advanced astronomy… ancient man had the advanced knowledge of astronomical movements, including the process of precession …found everywhere," Landis writes. For example, Roman sailors used an Antikythera mechanism with dozens of gears to track the Sun, Moon and planets.
* What's the Point? Darwinism implies that anciently men were less intelligent than today. Creationism informs millions that they were more brilliant than we are. As always, the evidence supports creation.
* SHOW UPDATES: (Updated Aug. 24, 2017)
- ANCIENT "CAVEMAN" ANIMATION: Really! Allegedly 30,000-year old cave drawings depict a series of animal-movement animations that would be surreal to ancient visitors seeing the cave by torchlight. See this in the Spring 2015 issue of Creation magazine and in journal Antiquity, and at discover.com!
* 2400 B.C. Sumerian Calligraphy: Early writing, as on the Barton Cylinder describing the Sumerian creation myth, was not merely functional but "a beautiful example of Early Dynastic calligraphy" from 4,400 years ago.
* 2000 B.C. Period Of Mercury's Orbit Known: A paper published in the Quarterly Journal of the Royal Astronomical Society argues from evidence that astronomers in India obtained the period of Mercury in the 3rd millennium B.C.
* Babylon Beat Pythagoras by a Thousand Years: Consistent with the increasingly acknowledged genius of ancient man, consider from the University of St. Andrews in the UK that a thousand years before Pythagoras, the Babylonians knew the "Pythagorean" Theorem.
* Babylonian Trigonometry Beat the Greeks by 1500 Years: As referenced in Science, the prestigious journal Historia Mathematicareports that, "The Babylonians discovered exact sexagesimal trigonometry at least 1500 years before the ancient Greeks discovered trigonometry." See also rsr.org/60, rsr.org/360, and 360dayyear.com.
* Calculus and Brilliance in Babylon: The city of Babel was built by Noah's great-grandson Nimrod in what today is southern Iraq. Eventually, one of the earliest identifiable people groups, the Sumerians, occupied this region of the Middle East. Their land and culture was later absorbed into the Babylonian Empire. (The initial Babylonian Empire flourished in the second millennium B.C. a thousand years before Nebuchadnezzar and the other kings of the later revived Neo-Babylonian Empire.) A 2016 paper in the journal Science, Ancient Babylonian astronomers calculated Jupiter’s position from the area under a time-velocity graph, describes the Neo-Babylonian use of a rudimentary calculus a millennium and a half before such calculations were thought to previously have been discovered. Commenting on the paper, Caltech's Noel Swerdlow said of the Babylonians, "They were very, very smart, and the more we learn of what they did, the more impressive, the more remarkable it becomes." And New York University's Alexander Jones added that their work, "testifies to the revolutionary brilliance of the unknown Mesopotamian scholars who constructed Babylonian mathematical astronomy."
- HUMAN IQ DROPPING: A Trends in Genetics paper by a Stanford professor of pathology and developmental biology, Dr. Gerald Crabtree, online at cell.com, titled Our Fragile Intellect, indicates that human intelligence is not evolving but devolving. From "new developments in genetics, anthropology, and neurobiology" Crabtree concludes that "if an average citizen from Athens of 1000 BC were to appear suddenly among us, he or she would be among the brightest and most intellectually alive of our colleagues and companions..." Crabtree discusses known mechanisms for our intellectual de-evolution but then suggests unknown mechanisms and unsubstantiated assumption to explain the original evolution of man's intelligence. For example, a supposed increase in the size of our brain somehow enabled us to think complex thoughts. (Brain size can be seen to be relatively unrelated to IQ, as comparing the college football team's front line to the Asian women in the physics department, and as in the case of an undetected brain tumor that limited a child's developing brain to a small fraction of its normal size, yet without a noticeable decrease in IQ. Consider also the monarch butterfly's pinhead-sized brain that, in a feat of amazing complexity, can navigate from Maine to Mexico.)
- HUMAN IQ HIGHER IN NEANDERTHALS: As we've reported at rsr.org/neanderthal, these Ice Age people were not another species but they are human beings (Homo sapiens), as confirmed by analysis of their speech apparatus, that they took aspirin and Penicillin, and that their sequenced genome shows that the Neanderthal were genetically closer to you, the reader, than a chimp is to another chimp. Further, as we reported in 2014, creationist work "suggests that today's Homo sapiensage much more quickly than did human beings from a few millennia ago." Three years later, in September 2017, the journal Science reported that while today spinal "bones tend to fuse by the time children reach the age of six", for a 7-year-old Neanderthal, "the small bones forming the boy's backbone were not fused." And by the time a modern child's brain reaches "95% the size of an adult's", unlike fast growing ape brains, the Neanderthal's brain has only reached "87.5% of the size of an average adult Neanderthal". While creationists expect this, to evolutionists like the team lead Antonio Rosas, "It was a surprise." Why a surprise? Partly because their evolutionary worldview misdirects them into assuming that Neanderthals were closer to an ape-like ancestor than we are. Ape brains mature quickly. Consider that our children need us parents for many years, which is one of the blessings God gave to us. In fact, the human body is the slowest of all organisms to mature. (A woman doesn't fully physically mature at the end of puberty but when she has given birth to her first child.) So, as reported by the BBC on this 2017 discovery, "The finding raises the intriguing possibility that the Neanderthals' slightly slower brain development meant that their brains might have been more advanced than ours."
* Ancient Armenian Astronomy: Boston University's astronomy professor Gerald Hawkins, perhaps the world's leading expert on archaeoastronomy, positively reviewed the work of Paris Herouni on the still partially standing Carahunge Monument. Herouni, a member of the Armenian National Academy of Sciences argues on pages 33-49 of his 2004 Armenians and Old Armenia that the creators of the scores of large astronomy stones were able to determine:
- the spherical shape of the Earth
- the inclination of the Earth's axis
- their latitude on the Earth
- the size of the Earth
- the precise moment of noon
- the precession of the equinoxes.
Herouni, an accomplished scientist in radar, radiophysics, radioastronomy, and antenna metrology with hundreds of published papers, estimated the accuracy that ancient Armenians could obtain with their astronomical stones for such measurements, including for example knowing during the spring equinox the moment of noon to within two seconds. And regarding latitude, Herouni reported (p. 49) that in the third millennium BC, the ancient Armenians knew their 40 degree north latitude to within half a degree.
* Prof. Hawkins to Herouni on his Carahunge Work: "I am most impressed with the careful work you have done, and hope that the result will ultimately get recorded in the literature. The menhir-lined Avenue [menhir refers to tall, upright stones erected in ancient times] leading from the stone circle is similar to the Avenue at Stonehenge, and the Avenue at Callanish. The former points to the midsummer sunrise, and the latter to the extreme point of the setting of the moon. Both date to the third millennium BC. At Carahunge the arrangement is similar. The Avenue from the stone circle points to the extreme northerly rising of the moon in the third millennium BC. As [with] Stonehenge and Callanish, the Avenue is the most distinctive architectural feature of the monument." May 18, 1999, published by permission.
* Stonehenge & Carahunge: Dr. Paris Herouni argues that like other "henges" in Europe, the meaning of both monuments is "Speaking Stones", with the Armenian car meaning stone, and hunge (hunch) meaning sound, echo, or voice. If so, as there is no English word henge, Prof. Herouni has solved the mystery of the meaning of the name Stonehenge, with a linguistic connection that reinforces the intuitive meaning, that these stones speak of the nature of the cosmos.
* Arman, Armen, Armenia, Yan, Aryan, and Caucasian: Herouni points out that Ar, the main god of ancient Armenia, the sun god, is the primary Armenian root and is the prefix to fully three percent of Armenian words, and that Arman means man of the sun, Armen means men of the sun, and Armenia (with the ia suffix in the ancient language) meaning land of the Sun. Regarding the term Aryan, Herouni goes back further than the traditional etymology (Sanskrit/Iran), to suggest the derivation of Ar and yan. Yan, also ian, is the typical suffix for Armenian names such as Petrosian, Galoyan, Vartanian. Thus Aryan would mean "from the Sun land", referring to those descended physically or even culturally from Armenia. Caucasians is a more recent term and not used technically today for whites, adopted to refer to those originating from the Caucasus Mountains. (The Major Caucasus Mountains run just north of Armenia and the Lesser Caucasus Mountains run through Armenia.) Finally, there is much more to Armenia's role in the development of civilization than scholarship has recognized. And with the mountains of Ararat in Armenia's backyard, don't expect a forthright investigation of the matter. So, while Paris Herouni is an old-earth secularist, Real Science Radio highly recommends his book, Armenians and Old Armenia!
* Incidentally, Armenian Translation Helps Save Ancient Chronologies: The Story of the Armenian Translation of the Eusebius' Chronological Tables provides a glimpse into one of the ways in which ancient history has been preserved.
* On the Muslim Genocide of 1.5 Million Christian Armenians: Hear Bob Enyart's broadcasts for the anniversary of the 20th-century Turkish atrocity here and here.
* 1800-Year-Old Roman Dodecahedron: According to Wikipedia, "A Roman dodecahedron is a small hollow object made of bronze or stone, with a dodecahedral shape: twelve flat pentagonal faces, each face having a circular hole of varying diameter in the middle, the holes connecting to the hollow center. Roman dodecahedra date from the 2nd or 3rd centuries CE. ... Smaller dodecahedra with the same features (holes and knobs) and made from gold have been found in South-East Asia..."
* Oh Yeah, And How Do You Depict Thought? Artists can find abstractions, like say predestination (about which the Jerusalem Post illustrated an article with our BEL artwork), challenging to depict. Yet from nearly 4000 years ago, back in the time of Israel's patriarchs and before their sojourn in Egypt, men crafted artwork to depict intangibles, including that of thoughtfulness.
* Scholar Emmeline Mary Plunket, 1893: "We should also be led to think of the common ancestors of the civilized races not as ignorant barbarians, but rather as men graced with high intellectual gifts—men whose teachings have been handed down through all the ages to this present day, and of whose imaginings the Zodiac remains as the most ancient monument of the work of intelligent man." Reprinted in 1903, pp. 42-43, in her Ancient Calendars and Constellations. And regarding the ancient world's brilliant calendars, see 360dayyear.com.
* And finally, it's even the dogs: From Science: "humans mastered the art of training and controlling dogs thousands of years earlier than previously thought." |
Columbia Flooring provides one of the largest collections of red oak variations on the market. North American oak and white oak are also available, along with pecan, cherry and maple. Columbia offers both solid and engineered constructions, with all engineered varieties designed for locking, no-glue installation.
Columbia Wilson Maple Collection
Information about Columbia Hardwood Product Lines
*The red sale price listed is the final price after mail in rebate plus additional rebate bonus if order is paid by check. Certain minimum purchase and maximum rebate applies. Rebates provided by FastFloors.com. Please see rebate terms and conditions for full details. Any Pallet or Truckload orders were discounted for check payment and must be paid by check. If paid by credit card, the price is 3% greater and will be adjusted after purchase. |
import {isIdentifierStart, isIdentifierChar} from "./identifier"
import {types as tt, keywords as keywordTypes} from "./tokentype"
import {Parser} from "./state"
import {SourceLocation} from "./locutil"
import {lineBreak, lineBreakG, isNewLine, nonASCIIwhitespace} from "./whitespace"
// Object type used to represent tokens. Note that normally, tokens
// simply exist as properties on the parser object. This is only
// used for the onToken callback and the external tokenizer.
export class Token {
constructor(p) {
this.type = p.type
this.value = p.value
this.start = p.start
this.end = p.end
if (p.options.locations)
this.loc = new SourceLocation(p, p.startLoc, p.endLoc)
if (p.options.ranges)
this.range = [p.start, p.end]
}
}
// ## Tokenizer
const pp = Parser.prototype
// Are we running under Rhino?
const isRhino = typeof Packages == "object" && Object.prototype.toString.call(Packages) == "[object JavaPackage]"
// Move to the next token
pp.next = function() {
if (this.options.onToken)
this.options.onToken(new Token(this))
this.lastTokEnd = this.end
this.lastTokStart = this.start
this.lastTokEndLoc = this.endLoc
this.lastTokStartLoc = this.startLoc
this.nextToken()
}
pp.getToken = function() {
this.next()
return new Token(this)
}
// If we're in an ES6 environment, make parsers iterable
if (typeof Symbol !== "undefined")
pp[Symbol.iterator] = function () {
let self = this
return {next: function () {
let token = self.getToken()
return {
done: token.type === tt.eof,
value: token
}
}}
}
// Toggle strict mode. Re-reads the next number or string to please
// pedantic tests (`"use strict"; 010;` should fail).
pp.setStrict = function(strict) {
this.strict = strict
if (this.type !== tt.num && this.type !== tt.string) return
this.pos = this.start
if (this.options.locations) {
while (this.pos < this.lineStart) {
this.lineStart = this.input.lastIndexOf("\\n", this.lineStart - 2) + 1
--this.curLine
}
}
this.nextToken()
}
pp.curContext = function() {
return this.context[this.context.length - 1]
}
// Read a single token, updating the parser object's token-related
// properties.
pp.nextToken = function() {
let curContext = this.curContext()
if (!curContext || !curContext.preserveSpace) this.skipSpace()
this.start = this.pos
if (this.options.locations) this.startLoc = this.curPosition()
if (this.pos >= this.input.length) return this.finishToken(tt.eof)
if (curContext.override) return curContext.override(this)
else this.readToken(this.fullCharCodeAtPos())
}
pp.readToken = function(code) {
// Identifier or keyword. '\\uXXXX' sequences are allowed in
// identifiers, so '\\' also dispatches to that.
if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)
return this.readWord()
return this.getTokenFromCode(code)
}
pp.fullCharCodeAtPos = function() {
let code = this.input.charCodeAt(this.pos)
if (code <= 0xd7ff || code >= 0xe000) return code
let next = this.input.charCodeAt(this.pos + 1)
return (code << 10) + next - 0x35fdc00
}
pp.skipBlockComment = function() {
let startLoc = this.options.onComment && this.curPosition()
let start = this.pos, end = this.input.indexOf("*/", this.pos += 2)
if (end === -1) this.raise(this.pos - 2, "Unterminated comment")
this.pos = end + 2
if (this.options.locations) {
lineBreakG.lastIndex = start
let match
while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {
++this.curLine
this.lineStart = match.index + match[0].length
}
}
if (this.options.onComment)
this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
startLoc, this.curPosition())
}
pp.skipLineComment = function(startSkip) {
let start = this.pos
let startLoc = this.options.onComment && this.curPosition()
let ch = this.input.charCodeAt(this.pos+=startSkip)
while (this.pos < this.input.length && ch !== 10 && ch !== 13 && ch !== 8232 && ch !== 8233) {
++this.pos
ch = this.input.charCodeAt(this.pos)
}
if (this.options.onComment)
this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
startLoc, this.curPosition())
}
// Called at the start of the parse and after every token. Skips
// whitespace and comments, and.
pp.skipSpace = function() {
loop: while (this.pos < this.input.length) {
let ch = this.input.charCodeAt(this.pos)
switch (ch) {
case 32: case 160: // ' '
++this.pos
break
case 13:
if (this.input.charCodeAt(this.pos + 1) === 10) {
++this.pos
}
case 10: case 8232: case 8233:
++this.pos
if (this.options.locations) {
++this.curLine
this.lineStart = this.pos
}
break
case 47: // '/'
switch (this.input.charCodeAt(this.pos + 1)) {
case 42: // '*'
this.skipBlockComment()
break
case 47:
this.skipLineComment(2)
break
default:
break loop
}
break
default:
if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
++this.pos
} else {
break loop
}
}
}
}
// Called at the end of every token. Sets `end`, `val`, and
// maintains `context` and `exprAllowed`, and skips the space after
// the token, so that the next one's `start` will point at the
// right position.
pp.finishToken = function(type, val) {
this.end = this.pos
if (this.options.locations) this.endLoc = this.curPosition()
let prevType = this.type
this.type = type
this.value = val
this.updateContext(prevType)
}
// ### Token reading
// This is the function that is called to fetch the next token. It
// is somewhat obscure, because it works in character codes rather
// than characters, and because operator parsing has been inlined
// into it.
//
// All in the name of speed.
//
pp.readToken_dot = function() {
let next = this.input.charCodeAt(this.pos + 1)
if (next >= 48 && next <= 57) return this.readNumber(true)
let next2 = this.input.charCodeAt(this.pos + 2)
if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
this.pos += 3
return this.finishToken(tt.ellipsis)
} else {
++this.pos
return this.finishToken(tt.dot)
}
}
pp.readToken_slash = function() { // '/'
let next = this.input.charCodeAt(this.pos + 1)
if (this.exprAllowed) {++this.pos; return this.readRegexp();}
if (next === 61) return this.finishOp(tt.assign, 2)
return this.finishOp(tt.slash, 1)
}
pp.readToken_mult_modulo = function(code) { // '%*'
let next = this.input.charCodeAt(this.pos + 1)
if (next === 61) return this.finishOp(tt.assign, 2)
return this.finishOp(code === 42 ? tt.star : tt.modulo, 1)
}
pp.readToken_pipe_amp = function(code) { // '|&'
let next = this.input.charCodeAt(this.pos + 1)
if (next === code) return this.finishOp(code === 124 ? tt.logicalOR : tt.logicalAND, 2)
if (next === 61) return this.finishOp(tt.assign, 2)
return this.finishOp(code === 124 ? tt.bitwiseOR : tt.bitwiseAND, 1)
}
pp.readToken_caret = function() { // '^'
let next = this.input.charCodeAt(this.pos + 1)
if (next === 61) return this.finishOp(tt.assign, 2)
return this.finishOp(tt.bitwiseXOR, 1)
}
pp.readToken_plus_min = function(code) { // '+-'
let next = this.input.charCodeAt(this.pos + 1)
if (next === code) {
if (next == 45 && this.input.charCodeAt(this.pos + 2) == 62 &&
lineBreak.test(this.input.slice(this.lastTokEnd, this.pos))) {
// A `-->` line comment
this.skipLineComment(3)
this.skipSpace()
return this.nextToken()
}
return this.finishOp(tt.incDec, 2)
}
if (next === 61) return this.finishOp(tt.assign, 2)
return this.finishOp(tt.plusMin, 1)
}
pp.readToken_lt_gt = function(code) { // '<>'
let next = this.input.charCodeAt(this.pos + 1)
let size = 1
if (next === code) {
size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2
if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(tt.assign, size + 1)
return this.finishOp(tt.bitShift, size)
}
if (next == 33 && code == 60 && this.input.charCodeAt(this.pos + 2) == 45 &&
this.input.charCodeAt(this.pos + 3) == 45) {
if (this.inModule) this.unexpected()
// `<!--`, an XML-style comment that should be interpreted as a line comment
this.skipLineComment(4)
this.skipSpace()
return this.nextToken()
}
if (next === 61)
size = this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2
return this.finishOp(tt.relational, size)
}
pp.readToken_eq_excl = function(code) { // '=!'
let next = this.input.charCodeAt(this.pos + 1)
if (next === 61) return this.finishOp(tt.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2)
if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
this.pos += 2
return this.finishToken(tt.arrow)
}
return this.finishOp(code === 61 ? tt.eq : tt.prefix, 1)
}
pp.getTokenFromCode = function(code) {
switch (code) {
// The interpretation of a dot depends on whether it is followed
// by a digit or another two dots.
case 46: // '.'
return this.readToken_dot()
// Punctuation tokens.
case 40: ++this.pos; return this.finishToken(tt.parenL)
case 41: ++this.pos; return this.finishToken(tt.parenR)
case 59: ++this.pos; return this.finishToken(tt.semi)
case 44: ++this.pos; return this.finishToken(tt.comma)
case 91: ++this.pos; return this.finishToken(tt.bracketL)
case 93: ++this.pos; return this.finishToken(tt.bracketR)
case 123: ++this.pos; return this.finishToken(tt.braceL)
case 125: ++this.pos; return this.finishToken(tt.braceR)
case 58: ++this.pos; return this.finishToken(tt.colon)
case 63: ++this.pos; return this.finishToken(tt.question)
case 96: // '`'
if (this.options.ecmaVersion < 6) break
++this.pos
return this.finishToken(tt.backQuote)
case 48: // '0'
let next = this.input.charCodeAt(this.pos + 1)
if (next === 120 || next === 88) return this.readRadixNumber(16); // '0x', '0X' - hex number
if (this.options.ecmaVersion >= 6) {
if (next === 111 || next === 79) return this.readRadixNumber(8); // '0o', '0O' - octal number
if (next === 98 || next === 66) return this.readRadixNumber(2); // '0b', '0B' - binary number
}
// Anything else beginning with a digit is an integer, octal
// number, or float.
case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
return this.readNumber(false)
// Quotes produce strings.
case 34: case 39: // '"', "'"
return this.readString(code)
// Operators are parsed inline in tiny state machines. '=' (61) is
// often referred to. `finishOp` simply skips the amount of
// characters it is given as second argument, and returns a token
// of the type given by its first argument.
case 47: // '/'
return this.readToken_slash()
case 37: case 42: // '%*'
return this.readToken_mult_modulo(code)
case 124: case 38: // '|&'
return this.readToken_pipe_amp(code)
case 94: // '^'
return this.readToken_caret()
case 43: case 45: // '+-'
return this.readToken_plus_min(code)
case 60: case 62: // '<>'
return this.readToken_lt_gt(code)
case 61: case 33: // '=!'
return this.readToken_eq_excl(code)
case 126: // '~'
return this.finishOp(tt.prefix, 1)
}
this.raise(this.pos, "Unexpected character '" + codePointToString(code) + "'")
}
pp.finishOp = function(type, size) {
let str = this.input.slice(this.pos, this.pos + size)
this.pos += size
return this.finishToken(type, str)
}
// Parse a regular expression. Some context-awareness is necessary,
// since a '/' inside a '[]' set does not end the expression.
function tryCreateRegexp(src, flags, throwErrorAt, parser) {
try {
return new RegExp(src, flags);
} catch (e) {
if (throwErrorAt !== undefined) {
if (e instanceof SyntaxError) parser.raise(throwErrorAt, "Error parsing regular expression: " + e.message)
throw e
}
}
}
var regexpUnicodeSupport = !!tryCreateRegexp("\\uffff", "u");
pp.readRegexp = function() {
let escaped, inClass, start = this.pos
for (;;) {
if (this.pos >= this.input.length) this.raise(start, "Unterminated regular expression")
let ch = this.input.charAt(this.pos)
if (lineBreak.test(ch)) this.raise(start, "Unterminated regular expression")
if (!escaped) {
if (ch === "[") inClass = true
else if (ch === "]" && inClass) inClass = false
else if (ch === "/" && !inClass) break
escaped = ch === "\\\\"
} else escaped = false
++this.pos
}
let content = this.input.slice(start, this.pos)
++this.pos
// Need to use `readWord1` because '\\uXXXX' sequences are allowed
// here (don't ask).
let mods = this.readWord1()
let tmp = content
if (mods) {
let validFlags = /^[gim]*$/
if (this.options.ecmaVersion >= 6) validFlags = /^[gimuy]*$/
if (!validFlags.test(mods)) this.raise(start, "Invalid regular expression flag")
if (mods.indexOf('u') >= 0 && !regexpUnicodeSupport) {
// Replace each astral symbol and every Unicode escape sequence that
// possibly represents an astral symbol or a paired surrogate with a
// single ASCII symbol to avoid throwing on regular expressions that
// are only valid in combination with the `/u` flag.
// Note: replacing with the ASCII symbol `x` might cause false
// negatives in unlikely scenarios. For example, `[\\u{61}-b]` is a
// perfectly valid pattern that is equivalent to `[a-b]`, but it would
// be replaced by `[x-b]` which throws an error.
tmp = tmp.replace(/\\\\u\\{([0-9a-fA-F]+)\\}/g, (_match, code, offset) => {
code = Number("0x" + code)
if (code > 0x10FFFF) this.raise(start + offset + 3, "Code point out of bounds")
return "x"
});
tmp = tmp.replace(/\\\\u([a-fA-F0-9]{4})|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/g, "x")
}
}
// Detect invalid regular expressions.
let value = null
// Rhino's regular expression parser is flaky and throws uncatchable exceptions,
// so don't do detection if we are running under Rhino
if (!isRhino) {
tryCreateRegexp(tmp, undefined, start, this);
// Get a regular expression object for this pattern-flag pair, or `null` in
// case the current environment doesn't support the flags it uses.
value = tryCreateRegexp(content, mods)
}
return this.finishToken(tt.regexp, {pattern: content, flags: mods, value: value})
}
// Read an integer in the given radix. Return null if zero digits
// were read, the integer value otherwise. When `len` is given, this
// will return `null` unless the integer has exactly `len` digits.
pp.readInt = function(radix, len) {
let start = this.pos, total = 0
for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {
let code = this.input.charCodeAt(this.pos), val
if (code >= 97) val = code - 97 + 10; // a
else if (code >= 65) val = code - 65 + 10; // A
else if (code >= 48 && code <= 57) val = code - 48; // 0-9
else val = Infinity
if (val >= radix) break
++this.pos
total = total * radix + val
}
if (this.pos === start || len != null && this.pos - start !== len) return null
return total
}
pp.readRadixNumber = function(radix) {
this.pos += 2; // 0x
let val = this.readInt(radix)
if (val == null) this.raise(this.start + 2, "Expected number in radix " + radix)
if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, "Identifier directly after number")
return this.finishToken(tt.num, val)
}
// Read an integer, octal integer, or floating-point number.
pp.readNumber = function(startsWithDot) {
let start = this.pos, isFloat = false, octal = this.input.charCodeAt(this.pos) === 48
if (!startsWithDot && this.readInt(10) === null) this.raise(start, "Invalid number")
let next = this.input.charCodeAt(this.pos)
if (next === 46) { // '.'
++this.pos
this.readInt(10)
isFloat = true
next = this.input.charCodeAt(this.pos)
}
if (next === 69 || next === 101) { // 'eE'
next = this.input.charCodeAt(++this.pos)
if (next === 43 || next === 45) ++this.pos; // '+-'
if (this.readInt(10) === null) this.raise(start, "Invalid number")
isFloat = true
}
if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, "Identifier directly after number")
let str = this.input.slice(start, this.pos), val
if (isFloat) val = parseFloat(str)
else if (!octal || str.length === 1) val = parseInt(str, 10)
else if (/[89]/.test(str) || this.strict) this.raise(start, "Invalid number")
else val = parseInt(str, 8)
return this.finishToken(tt.num, val)
}
// Read a string value, interpreting backslash-escapes.
pp.readCodePoint = function() {
let ch = this.input.charCodeAt(this.pos), code
if (ch === 123) {
if (this.options.ecmaVersion < 6) this.unexpected()
let codePos = ++this.pos
code = this.readHexChar(this.input.indexOf('}', this.pos) - this.pos)
++this.pos
if (code > 0x10FFFF) this.raise(codePos, "Code point out of bounds")
} else {
code = this.readHexChar(4)
}
return code
}
function codePointToString(code) {
// UTF-16 Decoding
if (code <= 0xFFFF) return String.fromCharCode(code)
code -= 0x10000
return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
}
pp.readString = function(quote) {
let out = "", chunkStart = ++this.pos
for (;;) {
if (this.pos >= this.input.length) this.raise(this.start, "Unterminated string constant")
let ch = this.input.charCodeAt(this.pos)
if (ch === quote) break
if (ch === 92) { // '\\'
out += this.input.slice(chunkStart, this.pos)
out += this.readEscapedChar(false)
chunkStart = this.pos
} else {
if (isNewLine(ch)) this.raise(this.start, "Unterminated string constant")
++this.pos
}
}
out += this.input.slice(chunkStart, this.pos++)
return this.finishToken(tt.string, out)
}
// Reads template string tokens.
pp.readTmplToken = function() {
let out = "", chunkStart = this.pos
for (;;) {
if (this.pos >= this.input.length) this.raise(this.start, "Unterminated template")
let ch = this.input.charCodeAt(this.pos)
if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
if (this.pos === this.start && this.type === tt.template) {
if (ch === 36) {
this.pos += 2
return this.finishToken(tt.dollarBraceL)
} else {
++this.pos
return this.finishToken(tt.backQuote)
}
}
out += this.input.slice(chunkStart, this.pos)
return this.finishToken(tt.template, out)
}
if (ch === 92) { // '\\'
out += this.input.slice(chunkStart, this.pos)
out += this.readEscapedChar(true)
chunkStart = this.pos
} else if (isNewLine(ch)) {
out += this.input.slice(chunkStart, this.pos)
++this.pos
switch (ch) {
case 13:
if (this.input.charCodeAt(this.pos) === 10) ++this.pos;
case 10:
out += "\\n";
break;
default:
out += String.fromCharCode(ch);
break;
}
if (this.options.locations) {
++this.curLine
this.lineStart = this.pos
}
chunkStart = this.pos
} else {
++this.pos
}
}
}
// Used to read escaped characters
pp.readEscapedChar = function(inTemplate) {
let ch = this.input.charCodeAt(++this.pos)
++this.pos
switch (ch) {
case 110: return "\\n"; // 'n' -> '\\n'
case 114: return "\\r"; // 'r' -> '\\r'
case 120: return String.fromCharCode(this.readHexChar(2)); // 'x'
case 117: return codePointToString(this.readCodePoint()); // 'u'
case 116: return "\\t"; // 't' -> '\\t'
case 98: return "\\b"; // 'b' -> '\\b'
case 118: return "\\u000b"; // 'v' -> '\\u000b'
case 102: return "\\f"; // 'f' -> '\\f'
case 13: if (this.input.charCodeAt(this.pos) === 10) ++this.pos; // '\\r\\n'
case 10: // ' \\n'
if (this.options.locations) { this.lineStart = this.pos; ++this.curLine }
return ""
default:
if (ch >= 48 && ch <= 55) {
let octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0]
let octal = parseInt(octalStr, 8)
if (octal > 255) {
octalStr = octalStr.slice(0, -1)
octal = parseInt(octalStr, 8)
}
if (octalStr !== "0" && (this.strict || inTemplate)) {
this.raise(this.pos - 2, "Octal literal in strict mode")
}
this.pos += octalStr.length - 1
return String.fromCharCode(octal)
}
return String.fromCharCode(ch)
}
}
// Used to read character escape sequences ('\\x', '\\u', '\\U').
pp.readHexChar = function(len) {
let codePos = this.pos
let n = this.readInt(16, len)
if (n === null) this.raise(codePos, "Bad character escape sequence")
return n
}
// Read an identifier, and return it as a string. Sets `this.containsEsc`
// to whether the word contained a '\\u' escape.
//
// Incrementally adds only escaped chars, adding other chunks as-is
// as a micro-optimization.
pp.readWord1 = function() {
this.containsEsc = false
let word = "", first = true, chunkStart = this.pos
let astral = this.options.ecmaVersion >= 6
while (this.pos < this.input.length) {
let ch = this.fullCharCodeAtPos()
if (isIdentifierChar(ch, astral)) {
this.pos += ch <= 0xffff ? 1 : 2
} else if (ch === 92) { // "\\"
this.containsEsc = true
word += this.input.slice(chunkStart, this.pos)
let escStart = this.pos
if (this.input.charCodeAt(++this.pos) != 117) // "u"
this.raise(this.pos, "Expecting Unicode escape sequence \\\\uXXXX")
++this.pos
let esc = this.readCodePoint()
if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
this.raise(escStart, "Invalid Unicode escape")
word += codePointToString(esc)
chunkStart = this.pos
} else {
break
}
first = false
}
return word + this.input.slice(chunkStart, this.pos)
}
// Read an identifier or keyword token. Will check for reserved
// words when necessary.
pp.readWord = function() {
let word = this.readWord1()
let type = tt.name
if ((this.options.ecmaVersion >= 6 || !this.containsEsc) && this.keywords.test(word))
type = keywordTypes[word]
return this.finishToken(type, word)
}
|
The Marine Corps’ top general has condemned a web video appearing to show Marines in Afghanistan urinating on dead Taliban fighters, and called for criminal and internal probes into what has quickly mushroomed into an international incident that threatens to undermine the U.S war effort.
“The behavior depicted in the video is wholly inconsistent with the high standards of conduct and warrior ethos that we have demonstrated throughout our history,” Gen. Jim Amos, the Marine Corps commandant, said in a statement issued Thursday morning. “Accordingly, late yesterday I requested that the Naval Criminal Investigative Service pull together a team of their very best agents and immediately assign them responsibility to thoroughly investigate every aspect of the filmed event.”
Click to expand...
I clearly just don't understand what ******* would do this to begin with, much less film it and release it to the world. I hope that the CMC smokes these guys to extent that he can do so, because frankly - the entire country is gravely injured with this kind of nonsense.
Unfortunately, these guys do not understand how difficult it has made the jobs of the other service members over there. They cannot do enought guard duty, peel enough potatos, etc. to make take the burden they created off their fellow Marines.
Unfortunately, these guys do not understand how difficult it has made the jobs of the other service members over there. They cannot do enought guard duty, peel enough potatos, etc. to make take the burden they created off their fellow Marines.
Click to expand...
If I were these idiots, I don't believe that I would count on getting the company grade punishment that you are describing- and they shouldn't. This is a big deal.
So do quite a few others in their chain of command. A see a rather large number of individuals besides these idiots having to explain these horrendous actions, and how they let this situation happen under their watch.
These idiots will be going to jail. Their chain of command will be joining the unemployment lines....
So do quite a few others in their chain of command. A see a rather large number of individuals besides these idiots having to explain these horrendous actions, and how they let this situation happen under their watch.
These idiots will be going to jail. Their chain of command will be joining the unemployment lines....
Click to expand...
For sure, but I'm curious how high up actual charges are going to go. I'm assuming (emphasis on assuming) that all of their NCOs (squad leader, platoon sergeant, etc) are going to feel some pain, as well as their platoon commander and company commander.
Is this something that would go up to Batt commander plus?
I'm legit curious, we sorta kinda not really covered this stuff in Law class but it seemed like in our case studies (Haditha, Abu Gharaib, etc) officers and SNCOs only really entered the (legal) equation if it was proved that they were there and condoned the action, covered it up, or fostered a command environment where it was considered acceptable.
They will be prosecuted and rightfully so. It was a stupid thing to do and especially in the INTERNET age. Just because someone is not signatory to the Geneva Convention doesn't make it right for their side. Haven't seen a lot of these spots: |
Blues GM: Alex Pietrangelo will be a Blue; hopes to reach deal soon
Nazem Kadri and Cody Franson aren't the only restricted free agents remaining without contracts, there are a couple of other guys across the league as well. Including star St. Louis Blues defenseman Alex Pietrangelo.
On Wednesday Blues GM Doug Armstrong took the time to update the media on the negotiations with Pietrangelo and as of now it doesn't sound like anything is imminent. Armstrong didn't want to delve too much into dollar figures or contract lengths that are on the table, but he did want to make one thing clear; Pietrangelo isn't going to play for anybody but the Blues.
When restricted free agents remain unsigned as long as Pietrangelo has, the offer sheet question always arises. There aren't a whole lot of teams with the ability to throw out offer sheets this summer but even if they were, Armstrong said he's prepared for it. In other words, don't even waste your time with an offer sheet other GMs.
What he's also prepared for is if Pietrangelo's contract dispute takes longer to figure out. Armstrong said that he's discussed inviting some UFA defensemen into camp should Pietrangelo not be signed soon and right now there are a few options out there, but you know it would be on the cheap if they signed anybody, they must keep room for a new deal with Pietrangelo.
Still, Armstrong is hopeful that his young defenseman will have a new deal before camp opens, even if it doesn't seem all that promising at the moment. I'm sure Ken Hitchcock feels the same as Armstrong on that front as Pietrangelo has quickly developed into one of the best defensemen in the game, a borderline Norris candidate in the past two seasons.
This past season he had five goals and 19 assists while averaging 25 minutes a night; 25 tough minutes as Pietrangelo saw a lot of the opponents' top players (per Hockey Abstract).
While Armstrong didn't give any update on specifics, Bob McKenzie of TSN reported where he thinks the negotiations are right now.
Petro/STL would like 8 yr max term but question is where between $6M and $7M per yr it settles. Karlsson at $6.5M (x7), Doughty at $7M (x8).
It's very likely going to be a long and lucrative deal, right now it's just a matter of how long and how lucrative. And of course when it will actually be signed.
"This isn't a one-way street on either side," Armstrong said, noting dialogue is constant. "Both sides want to do something that they're comfortable with. Probably both sides will wind up doing something that they're a little uncomfortable with, but we've made it very clear since the summer that Alex will be a St. Louis Blue when he plays hockey again." |
// ***************************************************************************
// *
// * Copyright (C) 2013 International Business Machines
// * Corporation and others. All Rights Reserved.
// * Tool: org.unicode.cldr.icu.NewLdml2IcuConverter
// * Source File: <path>/common/main/ebu.xml
// *
// ***************************************************************************
/**
* ICU <specials> source: <path>/xml/main/ebu.xml
*/
ebu{
Countries{
AD{"Andora"}
AE{"Falme za Kiarabu"}
AF{"Afuganistani"}
AG{"Antigua na Barbuda"}
AI{"Anguilla"}
AL{"Albania"}
AM{"Armenia"}
AN{"Antili za Uholanzi"}
AO{"Angola"}
AR{"Ajentina"}
AS{"Samoa ya Marekani"}
AT{"Austria"}
AU{"Australia"}
AW{"Aruba"}
AZ{"Azabajani"}
BA{"Bosnia na Hezegovina"}
BB{"Babadosi"}
BD{"Bangladeshi"}
BE{"Ubelgiji"}
BF{"Bukinafaso"}
BG{"Bulgaria"}
BH{"Bahareni"}
BI{"Burundi"}
BJ{"Benini"}
BM{"Bermuda"}
BN{"Brunei"}
BO{"Bolivia"}
BR{"Brazili"}
BS{"Bahama"}
BT{"Butani"}
BW{"Botswana"}
BY{"Belarusi"}
BZ{"Belize"}
CA{"Kanada"}
CD{"Jamhuri ya Kidemokrasia ya Kongo"}
CF{"Jamhuri ya Afrika ya Kati"}
CG{"Kongo"}
CH{"Uswisi"}
CI{"Kodivaa"}
CK{"Visiwa vya Cook"}
CL{"Chile"}
CM{"Kameruni"}
CN{"China"}
CO{"Kolombia"}
CR{"Kostarika"}
CU{"Kuba"}
CV{"Kepuvede"}
CY{"Kuprosi"}
CZ{"Jamhuri ya Cheki"}
DE{"Ujerumani"}
DJ{"Jibuti"}
DK{"Denmaki"}
DM{"Dominika"}
DO{"Jamhuri ya Dominika"}
DZ{"Aljeria"}
EC{"Ekwado"}
EE{"Estonia"}
EG{"Misri"}
ER{"Eritrea"}
ES{"Hispania"}
ET{"Uhabeshi"}
FI{"Ufini"}
FJ{"Fiji"}
FK{"Visiwa vya Falkland"}
FM{"Mikronesia"}
FR{"Ufaransa"}
GA{"Gaboni"}
GB{"Uingereza"}
GD{"Grenada"}
GE{"Jojia"}
GF{"Gwiyana ya Ufaransa"}
GH{"Ghana"}
GI{"Jibralta"}
GL{"Grinlandi"}
GM{"Gambia"}
GN{"Gine"}
GP{"Gwadelupe"}
GQ{"Ginekweta"}
GR{"Ugiriki"}
GT{"Gwatemala"}
GU{"Gwam"}
GW{"Ginebisau"}
GY{"Guyana"}
HN{"Hondurasi"}
HR{"Korasia"}
HT{"Haiti"}
HU{"Hungaria"}
ID{"Indonesia"}
IE{"Ayalandi"}
IL{"Israeli"}
IN{"India"}
IO{"Eneo la Uingereza katika Bahari Hindi"}
IQ{"Iraki"}
IR{"Uajemi"}
IS{"Aislandi"}
IT{"Italia"}
JM{"Jamaika"}
JO{"Yordani"}
JP{"Japani"}
KE{"Kenya"}
KG{"Kirigizistani"}
KH{"Kambodia"}
KI{"Kiribati"}
KM{"Komoro"}
KN{"Santakitzi na Nevis"}
KP{"Korea Kaskazini"}
KR{"Korea Kusini"}
KW{"Kuwaiti"}
KY{"Visiwa vya Kayman"}
KZ{"Kazakistani"}
LA{"Laosi"}
LB{"Lebanoni"}
LC{"Santalusia"}
LI{"Lishenteni"}
LK{"Sirilanka"}
LR{"Liberia"}
LS{"Lesoto"}
LT{"Litwania"}
LU{"Lasembagi"}
LV{"Lativia"}
LY{"Libya"}
MA{"Moroko"}
MC{"Monako"}
MD{"Moldova"}
MG{"Bukini"}
MH{"Visiwa vya Marshal"}
MK{"Masedonia"}
ML{"Mali"}
MM{"Myama"}
MN{"Mongolia"}
MP{"Visiwa vya Mariana vya Kaskazini"}
MQ{"Martiniki"}
MR{"Moritania"}
MS{"Montserrati"}
MT{"Malta"}
MU{"Morisi"}
MV{"Modivu"}
MW{"Malawi"}
MX{"Meksiko"}
MY{"Malesia"}
MZ{"Msumbiji"}
NA{"Namibia"}
NC{"Nyukaledonia"}
NE{"Nijeri"}
NF{"Kisiwa cha Norfok"}
NG{"Nijeria"}
NI{"Nikaragwa"}
NL{"Uholanzi"}
NO{"Norwe"}
NP{"Nepali"}
NR{"Nauru"}
NU{"Niue"}
NZ{"Nyuzilandi"}
OM{"Omani"}
PA{"Panama"}
PE{"Peru"}
PF{"Polinesia ya Ufaransa"}
PG{"Papua"}
PH{"Filipino"}
PK{"Pakistani"}
PL{"Polandi"}
PM{"Santapieri na Mikeloni"}
PN{"Pitkairni"}
PR{"Pwetoriko"}
PS{"Ukingo wa Magharibi na Ukanda wa Gaza wa Palestina"}
PT{"Ureno"}
PW{"Palau"}
PY{"Paragwai"}
QA{"Katari"}
RE{"Riyunioni"}
RO{"Romania"}
RU{"Urusi"}
RW{"Rwanda"}
SA{"Saudi"}
SB{"Visiwa vya Solomon"}
SC{"Shelisheli"}
SD{"Sudani"}
SE{"Uswidi"}
SG{"Singapoo"}
SH{"Santahelena"}
SI{"Slovenia"}
SK{"Slovakia"}
SL{"Siera Leoni"}
SM{"Samarino"}
SN{"Senegali"}
SO{"Somalia"}
SR{"Surinamu"}
ST{"Sao Tome na Principe"}
SV{"Elsavado"}
SY{"Siria"}
SZ{"Uswazi"}
TC{"Visiwa vya Turki na Kaiko"}
TD{"Chadi"}
TG{"Togo"}
TH{"Tailandi"}
TJ{"Tajikistani"}
TK{"Tokelau"}
TL{"Timori ya Mashariki"}
TM{"Turukimenistani"}
TN{"Tunisia"}
TO{"Tonga"}
TR{"Uturuki"}
TT{"Trinidad na Tobago"}
TV{"Tuvalu"}
TW{"Taiwani"}
TZ{"Tanzania"}
UA{"Ukraini"}
UG{"Uganda"}
US{"Marekani"}
UY{"Urugwai"}
UZ{"Uzibekistani"}
VA{"Vatikani"}
VC{"Santavisenti na Grenadini"}
VE{"Venezuela"}
VG{"Visiwa vya Virgin vya Uingereza"}
VI{"Visiwa vya Virgin vya Marekani"}
VN{"Vietinamu"}
VU{"Vanuatu"}
WF{"Walis na Futuna"}
WS{"Samoa"}
YE{"Yemeni"}
YT{"Mayotte"}
ZA{"Afrika Kusini"}
ZM{"Zambia"}
ZW{"Zimbabwe"}
}
Version{"2.0.82.45"}
}
|
Posts Tagged 'Cortex HDTT-5000'
Headlining the revolutionary HD Series of digital music controllers, Cortex, a part of GCI Technologies, is proud to announce the unveiling of the DJ industrys first standard sized tabletop Professional USB-compatible Digital Music Turntable, the HDTT-5000.
Follow us on Twitter
Advertising
Gearjunkies is a website dedicated to Gear enthusiasts, people who love to play with gear for electronic music production and DJ-ing. The idea for Gearjunkies was born in 2002 by a group of three gear enthusiasts, and in 2003 we went online. Ever since we are working on the website to create a humongous online information archive for everybody to use and to share. Read more... |
Rape Myth Acceptance Among Lesbian, Gay, Bisexual, and Mostly Heterosexual College Students.
Although there is a wealth of existing research on various correlates and patterns of rape myth acceptance (RMA), including how RMA relates to homophobia (i.e., antigay and antilesbian perspectives) and negativity toward lesbian, gay, and bisexual (LGB) men and women rape victims, no research to date has specifically focused on RMA among LGB and "mostly heterosexual" men and women. The current study examines how gender, sexual identity, personal experiences with rape (i.e., knowing/being a survivor), feminist identity, patriarchal gender norms, attitudes toward lesbian, gay, bisexual, and transgender (LGBT) people, and the interactions among these relate to LGB college students' ( n = 389; 24% gay/lesbian, 19% bisexual, 57% mostly heterosexual) RMA using the Illinois Rape Myth Acceptance Scale-Short Form. Findings show that being a woman, being LGB, identifying as a feminist, and knowing/being a survivor are all negatively related to RMA, whereas patriarchal gender norms are positively related to RMA. Attitudes toward LGBT people had differing effects whereby attitudes toward gay men were unassociated with RMA, attitudes toward lesbian women and trans men were negatively associated with RMA, and attitudes toward bisexual men and women and trans women differed depending on the comparison reference group (exclusive heterosexuals, n = 1,551, mostly heterosexuals, n = 222). Furthermore, the interacting effects of these identities, experiences, and perspectives also revealed significant findings that add complexity to these relationships. Overall, this research seeks to fill the gaps in the literature, expand our knowledge about rape myths, and contribute to new lines of inquiry that focus on LGB people's perspectives to work toward a deeper understanding of rape myths, so that ultimately, these damaging perspectives can be dispelled. |
SkinBright Cream: The Best Product For Underarm Whitening
6,823
Share
Skinbright Cream – Underarm Whitening
Underarm Whitening Cream For Dark Armpits
Seldom you would find a skin brightening cream which can work for both men and women. The general consensus is that when it comes to skin brightening creams, they are only needed by women. This, however, is not true at all.
The cream which we would be speaking about today Skinbright cream is geared towards both men and women. However, before buying any cosmetics, you should find out as much information about it as possible.
We would be going into some of the positive details of Skinbright skinbrightener cream which are important for you to know before buying it.
Solves a wide variety of problems:
When you hear the term skin whitening cream, you might be thinking about lightening your skin tone. However, skin lightening means different things for different people. Many times, the skin tone is not the problem, but other skin conditions.
Skinbright cream helps you in solving problems like:
The problems which we mentioned above, can be a hindrance in brightening your skin. This cream is a one stop solution for treating your skin problems.
Anti-Aging properties:
When you come across a skin whitening cream, you would not associate anti-aging with it. However, Skinbright is much more versatile than other skin whitening creams. It has 2 main ingredients which provide you with much younger skin. These 2 ingredients are:
-Vitamin A Palmitate -Allantoin
Even dermatologists all over the world would recommend products containing these 2 ingredients for anti-aging properties.
Instead of using a separate skin brightening cream and anti-aging cream, with Skinbright, you would get the properties of both included in a single cream.
With Skinbright, you would not only be whitening your skin but also help it get younger, thereby completely rejuvenating your skin.
Can be used for delicate skin:
The Skinbright cream is not just limited to facial usage. It can be used in other parts of the body and provides you with excellent whitening results. When you are looking for a solution for How to whiten underarms fast, Skinbright is one of the best options you have due to its versatility.
Skinbright not only makes the delicate areas like underarms white, but it also maintains the softness of the skin because of the absence of any harsh ingredients in the cream. It can also be used for your hands and legs.
So, if you are looking for a skin whitening cream which actually works and provides you with added features like anti-aging then Skinbright cream is the perfect solution for you.
Best Armpits Whitening Cream
Epibright Underarm Whitening Cream
Uneven skin tone can cause major embarrassment, whether it is because of hyperpigmentation, acne scars or birthmarks, it can affect one’s confidence.
Although skin whitening creams have a certain reputation among people due to some side effects, they are an effective solution for underarm whitening. Since finding the perfect underarm whitening cream can be quite a challenge, this is where Epibright comes in.
What Is Epibright Underarm Whitening Cream?
Epibright is a bleaching cream that treats all types of hyperpigmentation, including scars, age spots, melasma and general uneven skin tone. For the best underarm whitening cream, Epibright will be the ideal choice.
Unlike other bleaching agents Epibright contains no mercury or hydroquinone. It is an everyday cream that aids in reducing the natural pigment of the skin. The cream can be used on extremely dark areas -such as underarms- or just faintly darker areas that require whitening.
Epibright offers its users a long lasting, efficient outcome. The most interesting part is it does not block the skin pores and can be used by persons with all skin types.
How Does Epibright Work?
This amazing cream utilizes natural ingredients that aid in blocking the production of melanin in the skin –which is responsible for dark spots.
It does not matter the reason for the dark spots, whether it is too much exposure to the sun, melasma, birth control pills or any additional reason, Epibright will correct the skin discoloration and give a more even skin tone.
For the best results, the Epibright cream should be applied directly to the affected area at least two times in a day.
It is possible to see the results within a fortnight, but to eliminate all the dark spots. The user should use the cream for some months.
What Is The Secret Behind Epibright Underarm Whitening Cream?
The ingredients used in manufacturing Epibright are the secret behind its effectiveness. There are a variety of ingredients, but the main are Alpha-Arbutin and Kojic Acid.
The Alpha-Arbutin – It is an ingredient that is dissolvable in water and is used for skin lightening. The best thing about it is, it suits all skin types.
Due to its benefits, Alpha-Arbutin is used in most of the skin care products. It is incorporated with beneficial ingredients like Kojic Acid to produce excellent results to the users.
Kojic acid- It is an ingredient used mainly to eliminate pigmentation problems.
This ingredient plays an essential role in getting rid of pigmentation since it slows down the production of melanin hence lightening the skin.
Other ingredients are the lemon -a natural bleaching agent, mulberry and lactic extracts which have significant benefits to the skin.
Pros
– All skin types can use it
– It is the safest underarm whitening cream on the market today
– Manufactured using outstanding ingredients
– Has no mercury and hydroquinone, which studies indicate can cause severe side effects.
– Has no bad smell
– It is packed in an airless dispenser, which ensures the Epibright ingredients are not contaminated by air.
Meladerm Review
For many, armpit is a tickle spot. For some, an erogenous zone. However, there are some for whom it’s a source of embarrassment. Having dark underarms can become a root cause of embarrassment for any individual. The only way to get rid of this unease is by getting rid of dark underarms. Meladerm advanced skin lightener is an all-natural and powerful product, which is increasingly becoming popular in the market for its high-effectiveness in underarm whitening.
What are the causes of dark underarms?
Darkening of underarm occurs in both men and women, but it’s far more common in women. There are a number of reasons for this condition, and experimenting with medicines to treat underarm darkening without understanding the causes can be counterproductive and sometimes dangerous.
Primary causes of underarms darkening are:
1. Acanthosis Nigricans: In this condition the affected area feels velvety and changes its color to brown or dark gray. It affects the part of body with folds, which includes underarms. Acanthosis nigricans can affect individuals with insulin disorders, hypothyroidism, and to people using oral contraceptives or cholesterol medications containing nicotinic acid.
2. Hyperpigmentation: Excessive underarm darkening occurs when the adrenal glands fail to produce sufficient amounts of critical hormones. This condition is a key symptom of Addison disease, and may also occur during pregnancy due to hormonal changes that increases the production of melanin in the body, and melanin makes your skin look darker.
3. Antiperspirant and deodorant usage: Certain ingredients of these products react with your skin, which then causes discoloration. Many people claim to get dark underarms by regularly using antiperspirant and deodorant.
4. Shaving: Shaving cuts the hair just below the skin surface. If the color of your hair is darker than your skin, it may look like your skin has a dark stain.
How to get rid of dark underarms with home remedies
Dark underarms can be one of the biggest turn offs. Fortunately, there are various home remedies to reduce darkening of your underarm. Some prominent home remedies are:
1. Over-the-Counter Meladerm Cream – The reviews of this cream confirm that it’s highly effective in treating dark underarms. It has a history of satisfied customers that goes back more than a decade. The natural ingredients of this cream work softly on your skin to offer remarkable and long lasting results.
2. Cucumbers – Cucumber is widely known for its soothing properties. However, it can also be used as a natural bleaching agent for underarm whitening. Due to its soothing properties it doesn’t cause any irritation or itching, even when applied for long durations.
3. Potato – Potato is well-known for its bleaching properties, and is highly suitable for individuals with sensitive skin. Due to its mild acids it doesn’t irritate the skin like lemon and provides lightened skin under your arms.
4. Lemon – Lemon is a good natural bleach for your body. The acidic properties of lemon helps in lightening the skin of your dark underarm. Lemon also has anti-septic and anti-bacterial properties, which makes it an excellent natural cleanser.
5. White baking soda – Baking soda can be an excellent scrub for underarm whitening. Apart from reducing the negative effects of deodorants and antiperspirants on your skin, it can also prevent body odor.
Benefits of Meladerm advanced skin lightener cream
Despite many other skin lightening products, Meladerm is gaining immense popularity among consumers due to various reasons that make this cream truly unique. The packaging of this cream harnesses the true power of its active ingredients by preserving them from light and air, which reduces the chances of early deterioration of substances like Kojic Acid. Use of vacuum desiccators enhances the shelf life of this product.
The liposomes and carriers used as the base ingredients ensure that all active ingredients are absorbed deeply into the skin. Additionally, the use of highly effective preservatives and moisturizers make sure that skin irritation remains minimum. Therefore, this combination of high quality actives with special base ingredients dramatically improves the effectiveness of this product.
These qualities makes Meladerm advanced skin lightener a perfect product for underarm whitening, even if you have a highly sensitive skin. Also, you lose dark underarms, but not at the expense of your skin texture as your skin remains nice and smooth.
Know the ingredients of Meladerm cream
The main active ingredients in Meladerm cream are:
1. Alpha Arbutin – It’s a well-known skin lightening ingredient.2. Kojic Acid – Traditionally this product has been widely used in Asia, and modern research suggests that it is useful in treating bad skin pigmentation and age spots.3. Tego Cosmo C – This amino acid has the ability to enhance your skin tone.4. Gigawhite – This plant extract is believed to be a natural and safe substitute for hydroquinone.
Meladerm also contains many other natural extracts and ingredients, such as Niacinamide (Vitamin B3), licorice extract, bearberry extract and mulberry extract. All these ingredients are completely natural and no harsh chemicals have been used in this product.
Does Meladerm cream work?
Meladerm advanced skin lightener cream delivers all that it promises. It’s meant to work by brightening the complexion of your skin, by minimizing the appearance of sun damage and other visible hyperpigmentation. This is a gradual process that can take over one or two months depending on the darkness of your underarm skin, but most users start witnessing an even complexion over this period of time.
Although the company claims that you should expect seeing positive results within two weeks, the actual time may differ depending upon your skin condition. However, to get complete and long lasting results you need to use this cream regularly and according to the direction for approximately two to three months.
Are there any side effects?
All the ingredients used in this cream are natural ingredients. Therefore, despite giving fast and convincing results there are no side effects of using this cream. This feature alone makes Meladerm the best available option on the market for underarm whitening.
How much does it cost, and where to buy?
Depending on its size the cost of this product is anywhere between $39 and $80. There are many knock-offs of this product available on the internet, which makes it safer to buy this product from its official website only. This is the only way to make sure that you will get authentic product and true value for your money.
Underarm Whitening – Conclusion
Many people inquire about how to get rid of dark underarms because they are confused by various underarm whitening products. However, Meladerm is the only product in this category that provides a rare combination of a decade long trust and of the most advanced skin whitening system. By combining its unique formula with high-end packaging technology this product makes sure that you will get maximum value for your money.
Why Lumious Skin Underarm Lightener Is Exactly What You Need
Underarm Skin Lightener
Dark underarms can be a nuisance to live with and finding a skin lightening product that actually works is usually an uphill task. Of course there are numerous such products that provide almost immediate results, however, it comes at a price too heavy for the skin to bear. Therefore, to save you from the hectic process of research, we have recommended a tested and proven product:
Luminous Skin Underarm Lightening & Brightening (Hydroquinone-free)
How it works
The colour of the underarms is usually determined by the rate of melanin production in the body. The higher the rate, the darker the armpits will be. This serum works to reduce this rate leading to lighter skin.
It takes about two months to work but most of the time you can notice the difference in just mere of days of usage.
Why Luminous Underarm Lightener Stands Out From The Rest?
It is all natural unlike most underarm skin lightening products that incorporate the relatively unsafe chemical compound hydroquinone, this serum is made purely from what nature has to offer and is as a result safe for continuous long term use.
It leaves the skin smoother and softer than ever before while maintaining the consistency of skin tone making for a younger and more vibrant look. It’s also gentle on the skin, and while using it you can almost feel the lotion caressing the very fibre of your being.
Luminous is suitable for virtually any skin type; it works wonders on ordinary and sensitive skin alike. Furthermore, it is also tested and tried going by the full marks it got from satisfied customers across credible platforms like Amazon. It truly does work!
Furthermore, nowadays you have to dig deep into your pocket to get a good underarm lightener as such is the cost of beauty. However, this serum drives a good bargain at just $25 a bottle. It surely doesn’t get any better than that.
Verdict
The fact that this product has garnered an impressive four out of five stars rating on Amazon attests to the prowess of the serum. Give it a try today and no longer will you be afraid of pulling on that swimsuit to look for the beach or backyard. |
Detecting the dynamic linkage between landscape characteristics and water quality in a subtropical coastal watershed, Southeast China.
Geospatial analysis and statistical analysis are coupled in this study to determine the dynamic linkage between landscape characteristics and water quality for the years 1996, 2002, and 2007 in a subtropical coastal watershed of Southeast China. The landscape characteristics include Percent of Built (%BL), Percent of Agriculture, Percent of Natural, Patch Density and Shannon's Diversity Index (SHDI), with water quality expressed in terms of COD(Mn) and NH(4)(+)-N. The %BL was consistently positively correlated with NH(4)(+)-N and COD(Mn) at time three points. SHDI is significantly positively correlated with COD(Mn) in 2002. The relationship between NH(4)(+)-N, COD(Mn) and landscape variables in the wet precipitation year 2007 is stronger, with R(2) = 0.892, than that in the dry precipitation years 1996 and 2002, which had R(2) values of 0.712 and 0.455, respectively. Two empirical regression models constructed in this study proved more suitable for predicting COD(Mn) than for predicting NH(4)(+)-N concentration in the unmonitored watersheds that do not have wastewater treatment plants. The calibrated regression equations have a better predictive ability over space within the wet precipitation year of 2007 than over time during the dry precipitation years from 1996 to 2002. Results show clearly that climatic variability influences the linkage of water quality-landscape characteristics and the fit of empirical regression models. |
Q:
My vba IE scraper program won't click the go button for some reason
so I'm trying to learn how to interact with html using vba and I'm using this code:
Sub IEScraper()
Dim ie As InternetExplorer
Dim link As HTMLLinkElement
Set ie = New InternetExplorer
ie.Visible = True
ie.navigate ("duckduckgo.com")
Do While ie.Busy = True Or ie.READYSTATE <> 4
DoEvents
Loop
ie.document.getElementById("search_form_input_homepage").Value = _
Sheets(1).Range("A1").Value
ie.document.getElementById("search_form_input_homepage").Click
End Sub
It works up until the click line, where the page just won't click. No error pops up and the code ends but the button won't be clicked. Is there something I'm doing wrong?
A:
try
ie.document.getElementById("search_button_homepage").Click
|
This invention relates to a novel class of cephalosporins and analogues thereof and the pharmaceutically acceptable salt, ester, and amide derivatives thereof which bear in the 3-position of the 6-membered ring a substituted thio substituent. These compounds are useful as antibiotics. This invention also relates to processes for preparing such compounds; pharmaceutical compositions comprising such compounds; and methods of treatment comprising administering such compounds and compositions when an antibiotic effect is indicated.
The novel class of cephalosporins and analogues thereof to which this invention relates may be generically represented by the following structural formula: ##STR1## wherein THE DOTTED LINE INDICATES PROVISION FOR BOTH .DELTA..sup.2 AND .DELTA..sup.3 EMBODIMENTS;
A is S, O, SO, CH.sub.2, or NR.sup.7, (R.sup.7 is selected from the group consisting of hydrogen, alkyl, formyl, acyl, thioacyl, alkylsulfonyl, and aryl sulfonyl); PA1 R.sup.1 and R.sup.2 are independently selected from the group consisting of hydrogen or an acyl group. The term acyl is by definition those acyl radicals conventionally known in the cephalosporin and penicillin art and includes thio analogues thereof wherein the carbonyl oxygen is replaced by sulphur and diacyl radicals wherein R.sup.1 and R.sup.2 are joined together. PA1 R.sup.3 is selected from the group consisting of hydrogen, alkoxy, alkylthio, halogen such as fluoro and bromo; PA1 R.sup.5 is selected from the group consisting of hydrogen; substituted and unsubstituted: alkyl; aryl, aralkyl, heteroaryl and heteroaralkyl wherein the heterocyclic moiety comprises 4-6 ring atoms and the hetero atom (or atoms) is O, N or S; wherein the ring or chain substituent is selected from: amino, carboxy, hydroxy alkoxy, carbalkoxy, lower alkyl, heteroaryl, and substituted amino such as mono- and di-alkylamino, acylamino; examples of such substituents, R.sup.5 are: .beta.-aminoethyl, .beta.-hydroxyethyl, phenyl, substituted phenyl, benzyl, phenethyl and the like; and PA1 R.sup.6 is selected from the group consisting of PO(OH).sub.2, SO.sub.2 (OH), SO.sub.2 NH.sub.2 and derivatives thereof and COXR.sup.8 wherein X is oxygen or sulphur and R.sup.8, is inter alia, representatively selected from the group consisting of trialkylsilyl, and the pharmaceutically acceptable salt, ester and amide moieties known in the antibiotic bicyclic .beta.-lactam art such as sodium, potassium, pivaloyloxymethyl, and the like. PA1 A is selected from S, CH.sub.2, SO, and O; PA1 R.sup.3 is selected from hydrogen, methoxyl, and lower alkyl thio. PA1 R.sup.5 is hydrogen formyl or --(CH.sub.2).sub.n --Y wherein Y is hydrogen, hydroxyl, halo, mercapto, acyloxy, acylthio, substituted hydroxy, substituted mercapto, a quaternary ammonium group, azido, amino, carboxy and carbalkoxy, or an N-substituted amino group; and PA1 n is an integer from 1 to 6 and preferably 1 to 3. PA1 R.sup.1, r.sup.2 and R.sup.6 are as previously defined; PA1 R.sup.3 is selected from the group consisting of H, OCH.sub.3 and lower alkylthio having from 1 to 6 carbon atoms; PA1 R.sup.5 is selected from the group consisting of hydrogen, lower alkyl having 1 to 6 carbon atoms, substituted phenyl, N-methyltetrazolyl, amino alkyl such as .beta.-aminoethyl, .beta.-dimethylaminoethyl, .beta.-thioethyl, .beta.-hydroxyethyl, .beta.-carboxyethyl, and 2-methyl-1,3,4-thiadiazolyl-5yl.
There is a continuing need for new antibiotics. For, unfortunately, there is no static effectiveness of a given antibiotic because continued wide scale usage of any such antibiotic selectively gives rise to strains of pathogens which are resistant to the exploited antibiotic. In addition, the known antibiotics suffer from the disadvantage that they are effective only against certain types of microorganisms. Accordingly, the search for new antibiotics has continued.
Unexpectedly, it has been discovered that the compounds of the present invention are broad spectrum antibiotics; which are useful in animal and human therapy and in inanimate systems. It will be recognized from the above generic representation (I) that the principal novel feature of the compounds of the present invention is the substituent at the 3-position, a substituted thio radical. It will also be noted, except where expressly stated, that the balance of the cephalosporin or cephalosporin-like structure (I) is well-known in the relevant art.
Thus, it is an object of the present invention to provide a novel class of antibiotics which includes, inter alia, species having the basic nuclear structure of the cephalosporins but which are characterized by having a substituted thio radical at the three-position. These antibiotics are active against a broad range of pathogens, which representatively include gram positive bacteria such as Staphylococcus aureus, Streptococcus pyogenes, and gram negative bacteria such as E. coli and Salmonella typhimurium, Proteus mirabilis, and Proteus morganii. Further objects of this invention are to provide chemical processes for the preparation of such antibiotics; intermediates useful in preparing such antibiotics; pharmaceutical compositions comprising such antibiotics; and to provide methods of treatment comprising administering such antibiotics and compositions when an antibiotic effect is indicated. |
Q:
What happens when new ClassName() is called..?
I know that in simple words an Object is created. But i will better make it clear it with a scenario,
class A {
public A(String path){
}
}
class AB extends A{
public AB(String path){
super(path);
}
}
class B{
public void foo(){
AB a = new AB("myPath");
// now will constructor of class AB will run on another instance of
// AB or is there any other way "a" constructed.
}
}
I'm asking this because if constructor runs on another instance (in this case AB), then who will give it the String path required (and after all no default constructor is allowed here.)
A:
There is no "another instance" in this code; there's just the one.
new AB("myPath") calls public AB(String path) which in turn calls public A(String path), all on the same instance.
An instance of AB is-an instance of A, which in turn is-an instance of Object.
|
Investment Thesis for a University Incubator - paulorlando
http://startupsunplugged.com/startup-programs/investment-thesis-university-incubator/
======
j4pe
What's the level of demand for spots in the incubator? It seems that a
university-specific community would be small enough that optimizing for just
one of the factors mentioned (teams, for instance) is enough to winnow the
applicant pool to a reasonable size, if applied stringently enough. It's only
when you get up to a YC level of demand where you need additional judgement
criteria.
Or maybe the USC community is just huge?
~~~
paulorlando
The USC community is big, but of course smaller than what other non-university
programs can take (the world). It's not really a problem of winnowing the
applicant pool, it's more of a problem of creating something that makes sense
for the participants. One piece of that is not only looking at tech
businesses. While YC and other accelerators have to think of financial
returns, a university program that is not taking equity can think of other
benefits.
|
Chris Pratt
In Universal’s upcoming 3-D adventure “Jurassic World,” the globe’s most unique theme park has added some exciting new attractions, including a shark-munching mosasaur and a pack of trained velociraptors. But one favorite, fearsome dinosaur will make an appearance too. “The T. Rex in this movie is the same T. Rex from ‘Jurassic Park,’” said director Colin Trevorrow, who also co-wrote the much-hyped fourth film inspired by the work of author Michael Crichton. “She’s been on the island for 22 years. She’s still alive. She’s a little older, and she’s angry.” FULL COVERAGE: Summer Movie Sneaks More than two decades after Steven Spielberg’s “Jurassic Park” wowed moviegoers with its groundbreaking depictions of prehistoric animals, Trevorrow’s “Jurassic World,” set to open June 12, is aspiring to instill the same sense of wonder by paying homage to the beloved 1993 adventure but also offering […]
In a new trailer for “Jurassic World,” the fates of 20,000 trapped tourists rest in the claws of Chris Pratt’s pack of trained velociraptors. The much anticipated fourth installment in the “Jurassic Park” franchise, inspired by the work of author Michael Crichton, introduces a new dino-foe in the Indominus rex, a genetically modified predator that out-sizes a Tyrannosaurus rex and out-smarts a velociraptor. Also, she ate her sibling. “Every time we’ve unveiled a new attraction, attendance has spiked,” the park’s asset manager Claire (Bryce Dallas Howard) says in the trailer. “Corporate felt that genetic modification would up the wow factor.” “They’re dinosaurs,” responds trainer Owen (Pratt). “Wow enough.” As in the other “Jurassic Park” films, the vicious attraction gets out of hand, and the mega-beast escapes, claws out her tracking implant and begins killing for sport, leaving a bloody trail […]
The dinosaurs are ready to roam the big screen once more. The new trailer for “Jurassic World” arrived Tuesday, offering the first detailed glimpse of the anticipated fourth film in the franchise inspired by the work of author Michael Crichton. Set for release June 12, the movie stars newly minted action hero Chris Pratt, who is called upon to help protect visitors to the world’s grandest theme park from a new, genetically modified dinosaur. “Jurassic World” is directed by Colin Trevorrow, who earned acclaim with his earlier indie entry “Safety Not Guaranteed”; Trevorrow cowrote the script for the upcoming film with his earlier collaborator Derek Connolly, who also is credited as a screenwriter on another planned summer 2015 release, “Monster Trucks.” “Jurassic Park” director Steven Spielberg serves as an executive producer on the new movie, which also stars Bryce Dallas […]
Is Marvel so successful that it can do no wrong in the eyes of moviegoers? Maybe, according to “Saturday Night Live.” In the show’s premiere this weekend, “Guardians of the Galaxy” star Chris Pratt joined the “SNL” cast in a satirical trailer poking fun at Marvel’s ever-expanding roster of superhero films and their apparent box-office invincibility. The faux trailer begins with images from “Guardians,” which has earned some $644 million at the worldwide box office, and a voice-over explaining that, after the success of a film based on “a super-obscure comic book” and the hype surrounding the studio’s eagerly anticipated “Ant-Man” (“It’s about a guy who talks to ants. What? Yeah!”), Marvel doesn’t need comic books anymore. “We made a superhero team by pointing at a bunch of random words in the dictionary,” the trailer deadpans, introducing “Creatures of the […]
Want to know what it would be like to take a ride in Peter Quill’s spaceship, the Milano? Well now you can, courtesy of a new clip that sees “Guardians of the Galaxy” star Chris Pratt offer a guided tour of the vessel, which of course is piloted by his Marvel alter ego, the troublemaker better known to some corners of the universe as Star-Lord. With its wild menagerie of creatures and interstellar locales, “Guardians” dazzled moviegoers in its opening weekend, raking in more than $94 million at the box office to become the latest in a string of outsized hits for Marvel Studios. Directed by James Gunn and rooted in a 2008 comic book series written by Dan Abnett and Andy Lanning, the $170-million film is the first installment in a new franchise; “Guardians 2” is set to arrive […]
About midway through Marvel’s new interstellar adventure “Guardians of the Galaxy,” David Bowie’s “Moonage Daydream” plays over a shot of a ramshackle spaceship traveling toward a mining colony called Knowhere. The planet is actually the severed head of a fallen titan (or deity) where workers of alien races, some with candy-colored skin, collect valuable bone and fluid to ship to the outer reaches of the cosmos. The sequence could have been cribbed from the imagination of surrealist trickster Alejandro Jodorowsky, perhaps as part of his unrealized cinematic adaptation of Frank Herbert’s sci-fi novel “Dune.” Yet it’s far from the only over-the-top landscape in the film, which arrives in theaters Friday as Marvel’s riskiest venture. Based on a fairly obscure comics series, “Guardians of the Galaxy” is the first major studio film to be directed by James Gunn, a subversive stalwart […]
The Marvel Cinematic Universe is continuing to expand. The blockbuster comic book movie studio announced on its website late Friday release dates for five upcoming films, though the specific titles were not identified. According to Marvel.com, new movies will open on July 28 and November 3, 2017; July 6 and November 2, 2018; and May 3, 2019. Up next for Marvel, of course, will be “Guardians of the Galaxy,” James Gunn’s wild cosmic adventure. Due to arrive in theaters Aug. 1, “Guardians” follows Pratt’s roguish antihero, who’s on the run from a villain known as Ronan the Accuser (Lee Pace) after coming into possession of a mysterious orb. Before long, Quill is allied with a rogues’ gallery that includes Bradley’s gun-toting critter, Saldana’s green alien assassin, Bautista’s vengeful bruiser, and Diesel’s tree-like humanoid. In addition to the five guardians who […]
“Guardians of the Galaxy” has released two new character posters, featuring John C. Reilly as Nova Corpsman Rhomann Dey and Glenn Close as intergalactic police chief Nova Prime. Hero Complex readers can check out the new images at right and below. Marvel previously unveiled similar posters of the five Guardians — Star-Lord/Peter Quill (Chris Pratt), Gamora (Zoe Saldana), Drax the Destroyer (Dave Bautista) and the duo of Rocket Raccoon (voiced by Bradley Cooper) and Groot (voiced by Vin Diesel). View the earlier character posters by clicking the links below. Star-Lord | Gamora | Rocket and Groot | Drax Due to arrive in theaters Aug. 1, “Guardians” follows Pratt’s roguish antihero, who’s on the run from a villain known as Ronan the Accuser (Lee Pace) after coming into possession of a mysterious orb. Before long, Quill is allied with a rogues’ […]
Marvel has released a special extended look at “Guardians of the Galaxy,” due in theaters Aug. 1, and it’s the most ‘tude that Rocket the talking raccoon has displayed yet — which is saying something for this wiseguy. Voiced by Bradley Cooper, the sarcastic member of the oddball band of fighters led by Peter Quill (Chris Pratt), laughs uproariously at his leader’s lack of a distinct plan. Apparently, Rocket, an organized type, wants more than roughly 12% of a battle strategy figured out. Watch the video here: Like many of the trailers before it, this new spot is soundtracked by the Runaways’ “Cherry Bomb,” adding to the impressive roster of songs that the “Guardians” trailers have employed, including Blue Swede’s version of “Hooked on a Feeling” and Norman Greenbaum’s sublime “Spirit in the Sky.” All the tracks, supposedly part of a mix tape Quill made […]
So why does Peter Quill want to save the galaxy so much anyway? “Because I’m one of the idiots who lives in it!” he declares to Rocket Raccoon’s surly grilling in the most recent look at Marvel’s upcoming “Guardians of the Galaxy.” The latest of several trailers that Marvel has released in the run-up to the film’s Aug. 1 release, the sneak-peek ran during this week’s World Cup action. Check it out below. Besides Quill (a.k.a. Star-Lord) clearing up his motivations for his quest in typical wise-cracking fashion, the spot is also soundtracked by the Runaways’ “Cherry Bomb,” adding to the impressive roster of songs that the “Guardians” trailers have employed, including Blue Swede’s version of “Hooked on a Feeling” and Norman Greenbaum’s sublime “Spirit in the Sky.” “Guardians” follows Quill, played by Chris Pratt, who’s on the run from […] |
442 B.R. 97 (2010)
In re Louis J. DOMIANO, Jr., Debra Domiano a/k/a Ann D. Domiano, Debtors.
Fidelity Deposit & Discount Bank, Movant
v.
Louis J. Domiano, Jr., Debra Domiano a/k/a Ann D. Domiano, Respondents.
No. 5-08-bk-51563 RNO.
United States Bankruptcy Court, M.D. Pennsylvania.
December 28, 2010.
*100 Ronald V. Santora, Bresset and Santora, Forty Fort, PA, Stephen G. Bresset, Bresset & Santora, LLC, Honesdale, PA, for Debtor.
Anne K. Fiorenza, U.S. Department of Justice, Office of the United States Trustee, *101 Harrisburg, PA, for Asst. U.S. Trustee.
Opinion[1]
ROBERT N. OPEL, II, Bankruptcy Judge.
This is an individual Chapter 11 proceeding filed by a husband and wife. Two Motions filed by a secured creditor are presently pending. First, a Motion to Convert to Chapter 7 and second, a Motion for Accounting regarding some of the secured creditor's collateral.
For the reasons stated herein, I will convert this matter to a case under Chapter 7 of the Bankruptcy Code. Further, I will dismiss the Motion for Accounting, without prejudice to the secured creditor seeking subsequent relief from the Chapter 7 trustee or another authorized representative of the bankruptcy estate.
I. Jurisdiction
This Court has jurisdiction over this core proceeding pursuant to 28 U.S.C. §§ 1334 and 157(b)(2)(A).
II. Background
This Chapter 11 proceeding was commenced by a voluntary petition filed on June 2, 2008, by Louis J. Domiano, Jr. ("L. Domiano") and his wife, Debra Domiano, a/k/a, Ann D. Domiano ("D. Domiano"). L. Domiano and D. Domiano are sometimes hereinafter jointly referred to as the "Debtors".
On November 8, 2010, several Motions were filed by Fidelity Deposit & Discount Bank ("Fidelity Bank") against the Debtors. First, at Docket No. 468, a motion docketed as Second Motion to Convert Case to Chapter 7 or For Appointment of a Chapter 11 Receiver ("Conversion Motion"). Second, at Docket No. 469, a motion docketed as Fourth Motion for Contempt Citation and Damages and to Compel Auctioning of Remaining Vehicles and Accounting of Proceeds ("Contempt Motion"). Third, at Docket No. 470, a motion docketed as Motion to Compel Accounting or Production of All 51 Vehicles Secured to Fidelity Deposit & Discount Bank, or For Criminal Referral if All 51 Vehicles are Not Accounted For ("Accounting Motion"). Community Bank & Trust Company joined in the Conversion Motion at Docket No. 486. PNC Bank, Successor to National City Bank, joined in the joined Conversion Motion at Docket No. 493.
A hearing was commenced on all three Motions on December 8, 2010. By agreement of the parties, there was a consolidated record concerning all three Motions. During the presentation of its case, Fidelity Bank withdrew, without objection, the Contempt Motion. Testimony was completed on Friday, December 10, 2010, and I took under advisement the Conversion Motion and the Accounting Motion. The Debtors filed a Memorandum of Law on December 7, 2010, to Docket No. 494. Fidelity Bank filed its Reply Brief on December 15, 2010, to Docket No. 501. The Debtors filed a Supplemental Memorandum of Law on December 16, 2010, to Docket No. 503. Fidelity Bank filed its Brief in Reply to Debtors' Supplemental Memorandum on December 22, 2010, to Docket No. 510.
It is noted that at the time of the June, 2008, Chapter 11 filing, the Debtors had two principal business sources of income. First, their individual ownership of three commercial real properties and rental income derived therefrom. Also, L. Domiano *102 is the sole shareholder of a corporation, 1950 Wyoming Avenue Associates, Inc., which corporation is the title owner of a commercial property in Exeter, Pennsylvania. The corporation, 1950 Wyoming Avenue Associates, Inc., is the Chapter 11 debtor in two open cases filed in this Court to Case Nos. 5-08-bk-51652-RNO and 5-10-bk-04788-RNO. The Debtors' secondary primary source of business income at the time of the filing was rentals received from certain motor vehicles.
Two witnesses testified during the consolidated hearing on the Conversion Motion and the Accounting Motion. L. Domiano testified as of cross examination as part of Fidelity Bank's case. Fidelity Bank also offered testimony by Robert Siarniak, Assistant Vice President and Collections Officer, whose general duties include overseeing various aspects of bank loans in collection. L. Domiano also testified as part of the Debtors' case in chief. No expert testimony was offered either by Fidelity Bank or the Debtors. Fidelity Bank offered twenty-five exhibits into evidence; twenty-one of those exhibits were admitted into evidence. The Debtors marked two exhibits for identification but did not move for the admission of either exhibit into evidence.
On December 8, 2010, the Debtors filed a Motion to Dismiss the subject Chapter 11; the Motion will be noticed to creditors pursuant to Federal Rule of Bankruptcy Procedure 2002.
III. Discussion
A. Defenses of Estoppel, Waiver, Collateral Estoppel and Res Judicata
The Debtors maintain that the Conversion Motion and the Accounting Motion are precluded as a matter of law. They filed a Memorandum of Law on December 7, 2010, to that effect. The Debtors orally moved to dismiss the two Motions at the close of Fidelity Bank's case.
Page 10 of the Debtors' pre-hearing Memorandum of Law argues that prior stipulations between Fidelity Bank and the Debtors preclude the subject action. The Debtors cite Taylor v. Sturgell, 553 U.S. 880, 128 S.Ct. 2161, 171 L.Ed.2d 155 (2008) in support of their position. The Taylor case primarily addresses non-party claim preclusionthe Supreme Court of the United States considered the "virtual representation" doctrine as adopted by several circuits. The doctrine holds that non-parties can be bound by a judgment, even though they were not parties to the prior litigation. In Taylor, the D.C. Circuit Court held that the appellant was bound by a judgment because his interests had been adequately represented by a party to the proceeding which resulted in the judgment. The Supreme Court found that the necessary predicates to apply the doctrine of "virtual representation" had not been met and, therefore, vacated the judgment of the United States Court of Appeals for the District of Columbia and remanded.
There is general language in Taylor which militates against the Debtors' arguments for claim or issue preclusion herein. The Supreme Court noted:
The preclusive effect of a judgment is defined by claim preclusion and issue preclusion, which are collectively referred to as "res judicata". Under the doctrine of claim preclusion, a final judgment forecloses "successive litigation of the very same claim, whether or not relitigation of the claim raises the same issues as the earlier suit." New Hampshire v. Maine, 532 U.S. 742, 748, 121 S.Ct. 1808, 149 L.Ed.2d 968 (2001). Issue preclusion, in contrast, bars "successive litigation of an issue of fact or law actually litigated and resolved in a valid *103 court determination essential to the prior judgment," even if the issue recurs in the context of a different claim. Id., at 748-749, 532 U.S. 742, 121 S.Ct. 1808, 149 L.Ed.2d 968. By "preclud[ing] parties from contesting matters that they have had a full and fair opportunity to litigate," these two doctrines protect against "the expense and vexation attending multiple lawsuits, conserv[e] judicial resources, and foste[r] reliance on judicial action by minimizing the possibility of inconsistent decisions." Montana v. United States, 440 U.S. 147, 153-154, 99 S.Ct. 970, 59 L.Ed.2d 210 (1979).
Taylor v. Sturgell, 553 U.S. 880, 892, 128 S.Ct. 2161, 2171, 171 L.Ed.2d 155 (U.S. 2008). There is nothing in this record which evidences a final judgment between Fidelity Bank and the Debtors concerning either the Conversion Motion or the Accounting Motion. Similarly, In re Deangelis, 2010 WL 1509111 (Bankr.M.D.Pa. 2010), cited at page 11 in the Debtors' Memorandum, is inapposite. In Deangelis, the Bankruptcy Court found that a prior default judgment did not support the application of collateral estoppel because the matter had not been actually litigated.
Page 11 of the Debtors' Memorandum invoked the Rooker Feldman doctrine. That doctrine holds that no inferior federal courts, including a bankruptcy court, should consider a federal claim which is inextricably intertwined with the final judgment of a state court. In re Knapper, 407 F.3d 573, 581 (3d Cir.2005). I consider this argument to have been abandoned since no evidence was presented concerning the existence of a state court judgment between the Debtors and Fidelity Bank regarding the subject matter of these proceedings.
The crux of the Debtors' preclusion and waiver arguments relate to a stipulation entered into between the Debtors and Fidelity Bank. The stipulation, which bears signatures dated December 6, 2009, was approved by Court Order of May 20, 2010, at Docket No. 428 ("Settlement Stipulation").
I believe the language of the Settlement Stipulation shows that it was intended to settle one pending matter between the Debtors and Fidelity Bank.
To interpret the Settlement Stipulation, I generally consider principles of contract law. The Pennsylvania courts have set forth several canons of contract construction. In Bobali Corp. v. Tampa Co., 235 Pa.Super. 1, 5-6, 340 A.2d 485, 488 (Pa.Super.1975), the court noted:
In construing the terms of a contract we are guided by well-defined and fundamental canons of construction. Our Supreme Court has adopted the following principles:
`. . . `The cardinal rule in the interpretation of contracts is to ascertain the intention of the parties and to give effect to that intention if it can be done consistently with legal principles.' (Citations omitted.) `Contracts must receive a reasonable interpretation, according to the intention of the parties at the time of executing them, if that intention can be ascertained from the language. (Citing cases.)'' Percy A. Brown & Co. v. Raub, 357 Pa. 271 at 287, 54 A.2d 35, 43 (1947) (internal citations omitted).
Also see Unit Vending Corp. v. Lacas, 410 Pa. 614, 190 A.2d 298 (1963). Moreover, in ascertaining intent effect must be given to all the provisions of the written contract. Robert F. Felte, Inc. v. White, 451 Pa. 137, 302 A.2d 347 (1973). `In a written contract the intent of the parties is the writing itself and when the words are clear and unambiguous the intent is to be determined only *104 from the express language of the agreement.' R.F. Felte, Inc. v. White, supra at 143, 302 A.2d at 351; East Crossroads Center, Inc. v. Mellon-Stuart Co., 416 Pa. 229, 205 A.2d 865 (1965). A corollary rule is that `(t)he parties (have) the right to make their own contract, and it is not the function of this Court to rewrite it, or to give it a construction in conflict with the accepted and plain meaning of the language used.' Hagarty v. Wm. Akers, Jr., Co., Inc., 342 Pa. 236 at 239, 20 A.2d 317, 319 (1941); R.F. Felte, Inc. v. White, supra. (Emphasis added).
Generally, a settlement agreement is a contract and is subject to the rules of contract interpretation. Pennwalt Corp. v. Plough, Inc., 676 F.2d 77, 79 (3d Cir.1982); In re Cendant Corp. Prides Litigation, 233 F.3d 188, 193 (3d Cir.2000) (basic contract principles apply to settlement agreements).
The Settlement Stipulation was introduced into evidence as Fidelity Exhibit 4. Page 4 of the Settlement Stipulation specifically references a Motion to Compel Auctioning of Vehicles or For Allowance of Administrative Claim and for Third Contempt of Court Citation ("Motion for Auction"). The final wherefore on page 5 of the Settlement Stipulation provides:
The Debtors and the Bank ("Parties") desire to amicably settle the Motion for Auction, under and in accordance with the following terms: . . .
Paragraph 6 of the Settlement Stipulation provides that in the event the stipulation was approved, Fidelity Bank would withdraw its Motion for Auction and would not renew prosecution of the Motion ". . . unless there is an uncured default of this Stipulation as set forth below."
I find that the language of the Settlement Stipulation manifests an intention by the parties to resolve one aspect of their ongoing differences. Specifically, the Settlement Stipulation resolved the Motion for Auction. I recognize that the Settlement Stipulation is one of two stipulations which have been entered into between the Debtors and Fidelity Bank. In any event, I conclude that the Settlement Stipulation did not preclude Fidelity Bank from bringing either the Conversion Motion or the Accounting Motion. The Debtors' Motion to Dismiss the Conversion Motion is denied.
B. Conversion Motion
11 U.S.C. § 1112(b)(1)[2]:
Except as provided in paragraph (2) of this subsection, subsection (c) of this section, and section 1104(a)(3), on request of a party in interest, and after notice and a hearing, absent unusual circumstances specifically identified by the court that establish that the requested conversion or dismissal is not in the best interests of creditors and the estate, the court shall convert a case under this chapter to a case under chapter 7 or dismiss a case under this chapter, whichever is in the best interests of creditors and the estate, if the movant establishes cause.
The language in the statute was amended by Congress in 2005 as part of the Bankruptcy Abuse Prevention and Consumer Protection Act of 2005, Pub. L. No. 109-8, 119 Stat. 23 (2005) ("BAPCPA"). The amended statutory language limits the court's discretion to refuse to dismiss or convert a Chapter 11 case once *105 "cause" has been shown. In re Broad Creek Edgewater, LP, 371 B.R. 752, 759 (Bankr.D.S.C.2007); In re Gateway Access Solutions, Inc., 374 B.R. 556, 560 (Bankr. M.D.Pa.2007).
Section 1112(b) lists sixteen illustrative examples of what constitutes "cause" for conversion or dismissal of a Chapter 11 proceeding. The statutory examples of cause are illustrative and non-exclusive. In re 3 Ram, Inc., 343 B.R. 113, 118 (Bankr.E.D.Pa.2006); In re Ramreddy, Inc., 440 B.R. 103, 2009 WL 3763988, *5 (Bankr.E.D.Pa.2009); In re BH S & B Holdings, LLC, 439 B.R. 342, 346 (Bankr.S.D.N.Y.2010).
C. The Movant Has Established Cause for Conversion
1. Gross Mismanagement of the Estate
A debtor-in-possession is vested with significant powers under the provisions of the Bankruptcy Code. Powers such asthe automatic stay, the exclusive right to propose a plan and the discharge of debts. In re SGL Carbon Corp., 200 F.3d 154, 165 (3d Cir.1999). As is often the case, those powers come with concomitant responsibilities. Significantly, a debtor-in-possession owes a fiduciary duty to its creditors. In re G-I Holdings, Inc., 385 F.3d 313, 319 (3d Cir.2004). Further, a debtor-in-possession has a duty to keep the court and its creditors informed about the status and condition of its business. Petit v. New England Mortg. Services, Inc., 182 B.R. 64, 69 (D.Me.1995); In re Gateway Access Solutions, Inc., supra at 565.
A review of the Monthly Operating Reports ("MORs") filed during the pendency of this case raises serious concerns about whether the Debtors have met their fiduciary responsibilities.
It has been noted that:
[Monthly operating reports] are the life blood of Chapter 11, enabling creditors to keep tabs on the debtor's post-petition operations.
In re Kholyavka, 2008 WL 3887653, *4 (Bankr.E.D.Pa.2008). Monthly operating reports are in a format designed to allow the U.S. Trustee and creditors to monitor business operations during Chapter 11 and to avoid continued business operations that generate losses and administrative insolvency. In re Javier Estrada, Inc., 2010 WL 817406, *2 (Bankr.S.D.Tex.2010).
At the time the hearing record was closed, the Debtors had filed MORs through October, 2010. My review of the filed MORs raises concern that the reports have been completed in a cursory, if not casual, fashion.
Failure of a debtor to properly report income and expenses constitutes evidence of "gross mismanagement" under § 1112(b)(4)(B). In re Halal 4 U LLC, 2010 WL 3810860, *4 (Bankr.S.D.N.Y. 2010). Gross mismanagement is an enumerated cause for conversion or dismissal of a Chapter 11 proceeding. Gateway Access Solutions, Inc., 374 B.R. 556, 566 (Bankr.M.D.Pa.2007).
The MORs filed in this case generally contain some handwritten entries and are signed by the Debtors. Significant portions of the MORs, such as the pages headed Status of Postpetition Taxes and Statement of Operations, were typically left blank.
It is noteworthy that the Debtors have not employed an accountant in this Chapter 11 proceeding. Attached to each MOR reviewed is what appears to be a printout of activity on a Wachovia Bank checking account. L. Domiano testified that this *106 account "encompassed multiple businesses". Hr'g Tr. 25, Dec. 9, 2010. He also testified that he had one business bank account and one personal bank account. Hr'g Tr. 26, Dec. 9, 2010.
The U.S. Trustee is charged to ensure that required MORs are timely and properly filed. 28 U.S.C. § 586(a)(3)(D); In re Mullock, 404 B.R. 800, 809 (Bankr. E.D.Pa.2009) (the form and content of the monthly operating reports are controlled by the U.S. Trustee).
L. Domiano testified that he had discussed the Debtors' filed MORs with a Mr. Bender, an employee of the District's U.S. Trustee's Office. L. Domiano indicated that early on in the Chapter 11 case, Mr. Bender had noted some deficiencies on the MORs; L. Domiano implied that these deficiencies had subsequently been corrected. No one from the U.S. Trustee's Office testified during the consolidated hearing.
I note that Docket No. 97 is a Motion to Dismiss filed by the U.S. Trustee on September 9, 2008. The Motion alleged that the Debtors had failed to timely file certain MORs and had failed to provide a specimen check for a new Debtor-in-Possession operating account. The U.S. Trustee's Motion to Dismiss was settled and on October 31, 2008, an Order was entered requiring the Debtors to file revised and compliant MORs within fifteen days. The Order further provided that if the revised MORs were not filed as required, upon certification of default, the Chapter 11 proceeding would be dismissed. A review of the docket does not show any subsequent filings by the U.S. Trustee concerning the Debtors' MORs.
I find that the MORs have been completed in such a summary fashion that creditors are left to guess as to much of the Debtors' operations and financial results. What are the sources of the deposits into the Wachovia account? Are each of the Debtors' various businesses earning a monthly net profit or loss? The MORs have not been completed in a fashion consistent with the Debtors' fiduciary duties.
L. Domiano admitted that in August, 2010, he took the loan value on some personal insurance policies and deposited the funds into the account of the Debtor-in-Possession, 1950 Wyoming Avenue Associates, Inc. He offered as an explanation: "So, it was deposited because the only checking account that I used is 1950 Wyoming Avenue." Hr'g Tr. 16, Dec. 9, 2010.
There is no evidence that the Debtors or 1950 Wyoming Avenue Associates, Inc. sought bankruptcy court approval for this transaction. I find this to be evidence of gross mismanagement.
It is also troubling that many of the MORs include a Schedule of Cash Receipts and Disbursementswith a handwritten subheading "1950 Wyoming Ave. Associates, Inc.". There are handwritten figures which apparently show certain items of income and expense for 1950 Wyoming Avenue Associates, Inc.a corporate Debtor-in-Possession in two other bankruptcy cases. However, another page in the same MORs headed Schedule of Cash Receipts and Disbursements bears the Debtors' typed names and was routinely filed in blank. Neither receipts nor disbursements are reported on that page for the Debtors. I find there is no obvious way for a creditor to discern from the MORs what amount of monthly net income the Debtors are ostensibly earning and reporting.
The September, 2010, MOR contains a page headed "Domiano CheckbookSeptember 2010". The entries for September 7, 2010, include "Misc. Deposit $300.00" and "Misc. Withdrawal $300.00"; no further information is provided.
An MOR filed by 1950 Wyoming Avenue Associates, Inc., in Case No. 5-10-bk-04788-RNO, *107 was admitted into evidence. A page headed "Check Disbursements August 2010" shows an August 23, 2010, cashier's check for $13,700.00 in legal fees to Bresset & Santora. Attorneys Bresset and Santora represent the Debtors in their individual Chapter 11. I find that this payment evidences a disregard for corporate and bankruptcy requirements and is additional evidence of gross mismanagement. The blurring of the financial lines between 1950 Wyoming Avenue Associates, Inc. and the Debtors' personal finances is particularly disturbing because of the fiduciary responsibilities of each of the respective Debtors-in-Possession.
The Debtors' MOR for July, 2010, includes a page headed "Domiano CheckbookJuly 2010". It includes a payment of $1,500.00 to Frank Santomauro, Esquire. Mr. Santomauro is counsel for Debtor-in-Possession, 1950 Wyoming Avenue Associates, Inc., in Case No. 5-10-bk-04788-RNO. L. Domiano testified that Attorney Santomauro ". . . had taken care of something personally for myself and Mrs. Domiano." Hr'g Tr. 52, Dec. 9, 2010. The docket in the Debtors' case does not reflect court approval of the payment of any professional fees to Attorney Santomauro. Section 330 generally requires court approval before the payment of such compensation. I find this payment to be further evidence of gross mismanagement.
Cause has been shown to convert this case due to gross mismanagement of the estate.
D. The Debtors Have Not Met Their Burden to Identify "Unusual Circumstances" Such That It Would Be in the Best Interests of Creditors Not to Convert the Case From Chapter 11
Section 1112(b) utilizes a burden shifting approach in Chapter 11 cases where conversion or dismissal has been requested. Fidelity Bank has shown cause for conversion or dismissal. The burden now shifts to the Debtors to show "unusual circumstances" that establish such relief is not in the best interests of creditors and the estate. § 1112(b)(2); DCNC North Carolina I, L.L.C. v. Wachovia Bank, N.A., 2009 WL 3209728, *4 (E.D.Pa.2009); In re Ramreddy, Inc., 440 B.R. 103, 108 (Bankr.E.D.Pa.2009).
Generally, unusual circumstances require a showing that there is a reasonable likelihood that a Chapter 11 plan will be confirmed within a reasonable period of time. In re Prisco Properties, LLC, 2010 WL 4412095, *5 (Bankr.D.N.J.2010); In re 15375 Memorial Corp., 2008 WL 2698678, *1 (D.Del.2007); In re KC's Pub, LLC, 428 B.R. 612, 615 (Bankr.M.D.Pa.2010).
As noted above, the Debtors have not yet filed a plan or disclosure statementmore than two and one half years into the case. L. Domiano testified that he had reviewed a draft disclosure statement and plan. Hr'g Tr. 32, Dec. 10, 2010. No draft documents were offered into evidence. L. Domiano testified that creditors would fair better under the draft plan than through a conversion and Chapter 7 liquidation. Hr'g Tr. 32, Dec. 10, 2010. Again, no appraisals, valuations, projections, claim estimates, or other evidence was offered to support L. Domiano's opinion. This lack of evidentiary support, coupled with L. Domiano's self interest, lend little credence to his opinion.
L. Domiano based much of his hopes for a successful reorganization on two potentialities. First, a litigation effort in state court. Second, a possible sale of the commercial real property owned by 1950 Wyoming Avenue Associates, Inc. I will address these matters in turn.
*108 L. Domiano gave brief and rather cryptic testimony regarding a contingent claim which the Debtors purportedly have in some unspecified state court litigation. Schedule B.21 lists "Contingent claim from settlement proceeds (terms under seal by Order of Court)". Schedule B indicates that the claim is held by the Debtors jointly and the value is scheduled as "unknown".
At the hearing, L. Domiano testified that:
The contingency has become a reality in the last 30 days. So, it is no longer a contingency, it now becomes part of my plan when I receive the
Hr'g Tr. 15, Dec. 10, 2010.
Each time counsel for Fidelity Bank sought to interrogate L. Domiano about the particulars of the contingent litigation claim, objections were interposed. Debtors' counsel maintained that the records in the state court litigation were sealed. No documentary evidence concerning the contingent litigation claim was offeredno pleading, no docket, not even an order sealing the record. No particulars were offered concerning the amount of any potential recovery by the Debtors on this claim. I cannot find that the bare existence of an unspecified contingent litigation claim provides a basis for the Debtors to show "unusual circumstances" pursuant to § 1112(b)(2). A debtor's mere hope of prevailing on potential litigation claims is not a sufficient basis to defeat a showing of cause to convert. In re BH S & B Holdings, LLC, 439 B.R. 342, 350 (Bankr.S.D.N.Y.2010); In re FRGR Managing Member, LLC, 419 B.R. 576, 583 (Bankr.S.D.N.Y.2009).
L. Domiano also based much of his hope for a reorganization upon the sale of the property owned by 1950 Wyoming Avenue Associates, Inc. He maintained that the approval of the development of a Walmart store for an adjacent property increased the value of the corporate property. Again, no appraisals or expert testimony were offered into evidence. L. Domiano testified that the sole piece of real estate owned by 1950 Wyoming Avenue Associates, Inc. has been listed for sale on two occasions for a total of approximately six months. No listing agreement was offered nor did any realtor testify. The confirmed plan in the corporate case filed to 5-08-bk-51652-RNO generally provides for the sale or refinancing of the corporate property within one year; the amended plan was confirmed on June 10, 2009. It should be noted that 1950 Wyoming Avenue Associates, Inc. filed another Chapter 11 proceeding on June 9, 2010 to Case No. 5-10-bk-4788-RNO. The corporate Debtor entered into a stipulation in that case with the first mortgagee, Community Bank and Trust Company, at Docket No. 59. In that stipulation, the mortgagee agreed, subject to certain terms, to forbear exercising its rights and remedies under its mortgage until August 5, 2011. No written purchase offers or agreements of sale covering the property owned by 1950 Wyoming Avenue Associates, Inc. were offered into evidence.
Further, even if a buyer for the 1950 Wyoming Avenue Associates, Inc. property were found, what would it mean to the success of this case? What amount would a sale likely bring? What amounts would be needed to satisfy corporate obligations, including, without limitation, any liens or tax obligations? What amount, if any, would the Debtors likely net from a sale of the corporate real estate? The Court is left to guess as to the answer to these important questions. Again, no expert testimony, projections, or other documentary evidence was offered by the Debtors.
The likelihood of a successful reorganization within a reasonable period *109 of time must be shown to be more than a debtor's hopes or best case scenario. In re Wahlie, 417 B.R. 8, 12 (Bankr.N.D.Oh. 2009) (courts require a debtor to do more than manifest unsubstantiated hopes for a successful reorganization). A court is obligated to carefully scrutinize a plan to determine whether it offers a reasonable prospect of success and is workable. In re Prisco Properties, LLC, 2010 WL 4412095, *6 (Bankr.D.N.J.2010). Further, the Debtors' December 8, 2010, voluntary motion to dismiss belies L. Domiano's stated belief in the likelihood of a successful reorganization.
I conclude that the Debtors have not met their burden to show unusual circumstances why the Chapter 11 case should not be dismissed or converted.
E. The Case Should Be Converted Rather Than Dismissed
I have found that Fidelity Bank has established cause under § 1112(b)(1). Further, I have found that the Debtors have not established unusual circumstances under § 1112(b)(2).
The Bankruptcy Code next tasks me to either:
. . . convert a case under this chapter to a case under chapter 7 or dismiss a case under this chapter, whichever is in the best interests of creditors and the estate,
. . .
Section 1112(b)(1) (emphasis added).
The bankruptcy court may use its discretion in deciding whether dismissal or conversion is appropriate given the circumstances of the case. In re Kholyavka, 2008 WL 3887653, *5 (Bankr.E.D.Pa.2008); In re Johnson, 2008 WL 696917, *7 (Bankr.E.D.Pa.2008).
I recognize that the extent of the Debtors' real property assets have diminished during the pendency of this Chapter 11. There may not, in fact, be any equity for liquidation and distribution to unsecured creditors. However, the lack of credible valuation testimony, coupled with the Debtors' incomplete financial reporting, leave many unanswered questions as to the results of a hypothetical liquidation. Further, based upon the record presented, I cannot evaluate the Debtors' contingent litigation claim. These factors favor conversion and the appointment of a Chapter 7 trustee. A trustee can expeditiously evaluate the estate, liquidate any non-exempt and unencumbered assets and, hopefully, make a distribution to creditors. I find that allowing for the potential realization of a distribution is in the best interests of creditors.
A second factor counsels conversion rather than dismissal in this case. I need not repeat the noted deficiencies in and questions raised by the Debtors' MORs and their mismanagement. I believe the Debtors' conduct, pre- and post-petition, should be reviewed by a disinterested professional. I find that such a review by a Chapter 7 bankruptcy trustee is in the best interests of creditors.
Schedule F filed herein includes unsecured non-priority claims totaling $482,805.09. Schedule E includes unsecured priority claims totaling $95,989.48. Significant Chapter 11 administrative expense claims have been incurred during the pendency of this case. The Chapter 11 administrative claims will be subordinate to Chapter 7 administrative claims if the case is converted to Chapter 7. § 726(b). The significant amount of the unsecured claims also favors conversion over dismissal.
I will order conversion of this case to a case under Chapter 7 of the Bankruptcy Code.
*110 The Conversion Motion alternatively requests the appointment of a receiver. There is, of course, no provision for the appointment of a receiver in Chapter 11. The Court may appoint a Chapter 11 trustee or examiner pursuant to the provisions of § 1104. I will dismiss as moot the portion of the Conversion Motion which sought the appointment of a receiver.
F. Accounting Motion
The Accounting Motion is a renewed effort by Fidelity Bank to obtain information concerning fifty-one vehicles which were part of the collateral for the Bank's loans to the Debtors. L. Domiano testified that approximately thirty of the vehicles were sold during these proceedings. There was conflicting testimony regarding whether or not Fidelity Bank had consented to all of the vehicle sales.
I employ the doctrine of judicial restraint in considering the Accounting Motion. The "cardinal principle of judicial restraint" is that "if it is not necessary to decide more, it is necessary not to decide more." PDK Laboratories, Inc. v. U.S. D.E.A., 362 F.3d 786, 799 (C.A.D.C.2004) (Roberts, J., concurring in part and concurring in judgment); Morse v. Frederick, 551 U.S. 393, 127 S.Ct. 2618, 2641-42, 168 L.Ed.2d 290 (U.S.2007) (Justice Alito concurrence).
Principles of judicial restraint dictate that if resolution of an issue effectively disposes of a case, we should resolve the case on that basis without reaching any other issues that might be presented. Manning v. Upjohn Co., 862 F.2d 545, 547 (5th Cir.1989).
Under § 521(a)(4), the Debtors are required to surrender their books and records to the Chapter 7 bankruptcy trustee. Fidelity Bank may be able to obtain the information it seeks from the trustee, either voluntarily or by subsequent motion. I find that it is not necessary to decide the Accounting Motion at this stage and will dismiss it, without prejudice to Fidelity Bank's right to seek similar relief from the Chapter 7 trustee or any other authorized representative of the bankruptcy estate.
IV. Conclusion
An Order will be entered consistent with this Opinion denying the Debtors' Motion to Dismiss the Conversion Motion, granting Fidelity Bank's Conversion Motion and dismissing the Accounting Motion without prejudice.
NOTES
[1] Drafted with the assistance of Ryan B. White, Esquire, Law Clerk.
[2] Unless otherwise noted, all future statutory references are to the Bankruptcy Code, 11 U.S.C. § 101, et seq., as amended by the Bankruptcy Abuse Prevention and Consumer Protection Act of 2005, Pub.L. No. 109-8, 119 Stat. 37 ("BAPCPA").
|
This invention relates to polyetherimides. More particularly, it relates to polyetherimides having extremely good resistance to high temperatures.
Polyetherimides are well known commercially available polymers having advantageous properties including thermal oxidative resistance, good mechanical strength, excellent electrical properties and good chemical resistance. Commercially available polyetherimides include those of the type which may be prepared by the reaction of such aromatic amines as m- and p-phenylenediamine with bis(ether anhydrides) such as 2,2-bis[4-(3,4-dicarboxyphenoxy)phenyl]propane dianhydride, hereinafter sometimes designated "BPADA" for brevity. Their temperature stability is high, as shown by a glass transition temperature in the range of 215-220.degree. C.
It is of interest, however, to prepare polyetherimides having still better resistance to high temperatures. Glass transition temperatures above 250.degree. C. would be especially desirable. |
GO! D-Backs! Woot!
It’s up to Hill in Game 3 with season on life support after Lilly implodes
By Paul Sullivan
Tribune staff reporter
2:02 AM CDT, October 5, 2007
PHOENIX
Piniella was the manager of that Mariners team that came back off the mat in ’95, so at least he knows first-hand that it can be done.
“Look, we’re going home, we’ve got our home fans, and we’ve got a chance to get it back here with a couple of wins,” Piniella said.
Can the Cubs pull off a miracle, or will their season come to an end this weekend at Wrigley Field?
“We’re more than [capable] of taking three games from any team in baseball,” Mark DeRosa said. “I don’t want to say it’s time to push the panic button, because it’s not. But we need to play perfect baseball.”
Rich Hill will face Livan Hernandez in Game 3 on Saturday as the Cubs try to stave off a sweep and take it to Game 4, where Zambrano would pitch on three days’ rest.
Lilly took the ball for Game 2, knowing the fate of the Cubs’ season could very well be in his hands. But the veteran left-hander allowed six runs on seven hits and four walks in only 3 1/3 innings, leaving with the Cubs trailing 6-2.
“This is something I’m going to have a hard time with,” Lilly said. “I certainly want to get another opportunity like this and try to redeem myself and help us. Tonight was a night I didn’t do us much good in a big game. You look over the season, and I could care less how many games I’ve won. Once you get in the postseason, this is what it’s all about. It’s not going to be easy to swallow.”
The D’backs led 8-2 in the sixth when Daryle Ward’s pinch-hit, two-run double off ex-Cub Juan Cruz made it a four-run game, but the Cubs’ offense was otherwise lifeless. Their top three stars, Alfonso Soriano, Derrek Lee and Aramis Ramirez, are a combined 4-for-27 with no RBIs.
“I know myself I have to step up,” Lee said. “It’s obvious. I haven’t hit. I need to help my team. My job is to drive in runs and get on base.”
Doug Davis allowed four runs on five hits over 5 2/3 innings for the D’backs, leaving with an 8-2 lead and notching the win. Lilly didn’t fare nearly as well, and it was evident at the outset.
Lilly walked two batters in the first inning, getting off on the wrong foot, but managed to strand a pair of runners by striking out Mark Reynolds. But after Geovany Soto’s home run off Doug Davis gave the Cubs a 2-0 lead in the second, Lilly blew a gasket in the bottom of the inning.
With runners on second and third and two outs, Lilly grooved a 3-2 pitch to Chris Young, then slammed his glove to the ground in disgust as Young launched a three-run, 421-foot home run to deep left field, giving the D’backs a 3-2 lead.
“I’ve never seen a pitcher throw a glove like that on the mound,” Piniella said.
Lilly was upset with the fastball he threw, which was high and right in Young’s power zone.
“I’ve got zero excuses,” Lilly said. “I guess if I really wanted to find some excuses I could come up with some. But that’s not going to get me anywhere.”
The debacle continued when Soriano misjudged a catchable ball at the wall later in the inning to give Eric Byrnes an RBI triple.
“I missed the ball because I got very close to the wall,” Soriano said. “It was too high. I didn’t know it was going to hit that high. I did the best I can to catch that ball.”
By the time Lilly got out of the inning, he’d already thrown 58 pitches, and his stuff was obviously not up to snuff. Kevin Hart finally was called upon in the fourth after Lilly gave up a two-run triple to Drew.
As the Cubs took the field in the bottom of the fifth inning of Game 2, former Cubs first baseman Mark Grace, now an analyst on D’backs radio broadcasts, blasted the Cubs for having “bad body language” and for hanging their heads.
“They’re looking at their toes instead of being on their toes,” Grace told his radio audience.
Lee said Grace’s comment was simply wrong.
“I didn’t see that,” he said. “It always seems when you don’t score runs, people say you’re dead or whatever. But we were in it. We were very in it. We never stopped trying. It just didn’t work out. So it’s easy to start saying we weren’t in it because we weren’t scoring runs.”
Now Piniella will be under the spotlight this weekend with the Cubs coming home after letting the D’backs get the upper hand. His moves will be talked about all winter if the Cubs go down in three games.
“I’ve had bad games as a manager,” he said. “But I’ve been doing this a hell of a long time, so I’ve had a lot more good games than bad games.”
Share this!
Like this:
LikeLoading...
Published by cypheroftyr
Hello everyone...
I'm just me. Nothing too interesting here. I dig everything pretty much except country music, and stupid, ignorant, whiny, prejudiced people.
I'm a long time gamer, fangirl, fan ficcer and spawn point of the #INeedDiverseGames hashtag on twitter, Wiscon attendee, part of the #FeministDeck created by the lovely KivaBay
I've had a lot of bad shit happen to me. Sometimes I will post about it, other times I may vent about things for no real reason other than to get it off my chest. Remember, my blog, my rules.
So, if you have nothing constructive to say in response to a post... are only going to argue with no real point, or feel what I say is offensive, lewd, crass or otherwise conflicts with your personal beliefs, then feel free to leave. If you followed me in some errant belief I am here to be your one black friend, or your unpaid, unwilling teacher in how to be a better person, leave now.
I don't abide hate following, I am not your ONE TRUE SOURCE for all things racial, fandom, gaming, etc. Don't quote me and go well my black friend said it as a get out of fuckery free card.
You've been given fair warning, so if you can behave like an adult pull up a chair and hangout. Otherwise, find the nearest exit and have a good day.
View all posts by cypheroftyr |
Anthony Smith (Australian footballer)
Anthony Smith (born 12 April 1951) is a former Australian rules footballer who played for the Richmond Football Club in the Victorian Football League (VFL).
Notes
External links
Category:Living people
Category:1951 births
Category:Australian rules footballers from Victoria (Australia)
Category:Richmond Football Club players |
Q:
More efficient way to get used linux ports
I need a small daemon that monitors open tcp ports currently connected to an Ubuntu Server v14. The idea is that there are many scripts running at a time which need this info in as close to real time as possible and I don't want them all using resources to do the same thing. What I have to get this so far is this:
netstat -ln | grep LISTEN | grep tcp6 | awk {print $4} | cut -c 4-
My idea is to have this run in a background daemon and update some file which can be read. How can I make this more efficient & relatively simply. Any script or compiled language that sits on Ubuntu Server 14 is fine. I don't need info on how to make a daemon just how to extract the ports.
A:
All that you need is in one file, you don't need to execute netstat:
$ cat /proc/net/tcp
sl local_address rem_address st tx_queue rx_queue tr tm->when retrnsmt uid timeout inode
0: 00000000:0016 00000000:0000 0A 00000000:00000000 00:00000000 00000000 0 0 5434440 1 0000000000000000 100 0 0 10 0
1: 0100007F:0277 00000000:0000 0A 00000000:00000000 00:00000000 00000000 0 0 151286810 1 0000000000000000 100 0 0 10 0
...
The addresses and ports are in hex. The listening ports are those where rem_address is all zeros.
If all your processes are in the same language, a common function to look at port bindings, would be cheap to run. (Rather than the complication of an intermediate file.)
|
Syntactic delay and pragmatic deviance in the language of fragile X males.
The expressive language of 19 fragile X [fra(X)] males with chronological ages between 5 and 36 years and Vineland Adaptive Behavior Scores between 21 and 79 was examined for syntactic as well as pragmatic proficiency. The production of deviant repetitive language was observed with this group, corroborating the results of an earlier study with a smaller sample of fra(X) males. In contrast, when 2 syntax scores, mean length of utterance (MLU), and Index of Productive Syntax (IPSyn) were derived from naturalistic language observations, the relation of complexity to length was observed to be very similar to the known relationship of these 2 facets of syntactic ability in normal preschoolers. These results, and the absence of correlations between syntactic scores and proportions of deviant repetitive language are consistent with the notion that the syntactic development of fra(X) males is typically delayed rather than deviant. For effective assessment and remediation of communicative problems associated with the syndrome to be developed, it is argued, language must be considered as a combination of competencies rather than as a unitary skill. |
Carpooling Service Expands Across Europe - prostoalex
http://www.wsj.com/articles/carpooling-service-expands-across-europe-1419538372
======
personlurking
Pretty good service. I very recently took it.
3 pax @ $30 (€25) each for a 5.5h trip, or 250 mi (400km). On top of it, the
driver paid for gas and tolls using an alt route to save money and time. Tolls
and gas = $67 (€54). The main route would have cost him $90 (€75), meaning the
cost to the pax.
It's great if there's not a lot of "bla-bla-bla" always going on (which
happened once, as a driver wouldn't stop talking). Another complaint (on the
driver's side) is that the company has started to request commission in some
countries, and this is causing some drivers to seek out alternative service.
~~~
AndrewDucker
Pax?
~~~
personlurking
sorry, force of habit. In the transport industry 'pax' is shorthand for
'passengers'.
------
lleims
Blablacar's growth in Europe has been incredible to watch. Hard work pays off:
they started building the service in 2006.
It's become the main transportation service for most of my friends (tech savvy
or not) when traveling from one city to another within Spain. It's crossed the
'mainstream' line.
A lot of young people think first about Blablacar, then flying, taking the
train, etc.
~~~
personlurking
I heard the bus services are lowering their fares in response to Blabla,
though AVE (et al) are still expensive.
|
The present invention relates to a spinal fixation device for spinal fusion and particularly relates to a uni-directional anterior cervical spinal fixation plate device for progressively maintaining a bone graft between adjacent vertebrae under compression.
Spinal plates have been developed for stabilization of the spine upon spinal fusion. Conventional anterior cervical spinal fixation plates typically comprise a unitary plate having a pair of bone screw openings at each of its opposite ends. The plate has sufficient length to span an excavated bone graft-receiving site in the vertebral column and in which site a bone graft is located for fusion to adjacent vertebrae. These prior anterior cervical fixation plates fix the adjacent vertebrae on opposite sides of the bone graft-receiving site relative to one another. It will be appreciated, however, that with both ends of the unitary plate secured by screws to the adjacent vertebrae, advantageous and beneficial compression of the bone graft between the adjacent vertebrae and during the fusion process cannot be obtained. While it has been recognized that compression of a bone graft is desirable over time as the graft fuses to the vertebrae, the nature of these unitary anterior cervical spinal plates fixed at opposite ends to the adjacent vertebrae precludes compression of the bone graft beyond any initial compression during the surgical procedure. Consequently, there has developed a need for a spinal fixation device in which the bone graft can be progressively compressed between adjacent vertebrae over time. |
HIPAA / Privacy Statement
HIPAACaribou Systems, Inc. is committed to the awareness, training and education of its workforce regarding the privacy and security of protected health record information.
PRIVACY POLICYCaribou Systems is committed to protecting the privacy of our users’ personal information. To better protect your privacy, we have instituted the security and privacy practices outlined in this policy. We provide this notice explaining our information practices and the choices you can make about the way your information is used.
Information Caribou Systems collects and how it is usedIf you choose, you can visit Caribou Systems without providing us with any information about yourself. To help you identify when you are on Caribou Systems’ website, we place our logo in the upper left corner to indicate that you are within Caribou Systems.
Caribou Systems collects both personally identifiable and non-personally identifiable information from users of its website.
Personally Identifiable InformationWhen you correspond with Caribou Systems through the use of forms, we require you to give us contact information (such as your name, title, company name, phone number and email address). Caribou Systems does not sell or release this information in any way to third parties, and we will protect this information from unauthorized disclosure or access.
We may use the customer contact information we collect to send you information about our company, newsletters, promotional materials or other information. We may also use the information we collect, in combination with outside records, to notify you about important changes to the website, new Caribou Systems services and products, or information we think you’ll find valuable.
Non-personally Identifiable InformationWe may collect certain non-personally identifiable information about you when you visit our site, such as the type of browser you are using, the type of operating system you are using, the referring site from which you came, or the domain name of your Internet service provider. We use the non-personally identifiable information that we collect in the aggregate to improve the design and content of our site. We also use this information to analyze site usage.
Disclosure of information to outside partiesCaribou Systems may be obligated to disclose personally identifiable information to law enforcement or agencies, even though such agencies may not comply with the terms of our privacy policy. Caribou Systems will disclose information to such agencies in response to legal process or when we believe in good faith that the law requires it, for example, in response to a court order, subpoena, or a law enforcement agency’s request.
Information partners may collectOur site may contain links to other websites whose information practices may be different than ours. You should consult the other sites’ privacy policies, as we have no control over information that you may submit or that third parties collect on those sites. Also, our providing a link to sites not maintained by Caribou Systems does not imply endorsement of the linked site(s) by Caribou Systems, Inc.
Use of cookiesThe Caribou Systems website uses cookies, a technology that stores small pieces of information on your hard drive, to personalize content during your visit. Each time your browser visits a website, the site sends all cookies relevant to that website; cookies are used to maintain a session between you and the Web server.
Changes to privacy policyIf we materially change our privacy policy, we will post changes on this page so that you are always aware of what information we collect, how we use it, and under what circumstances we disclose it. |
Q:
Jenkins Pipeline job can't find script due to @tmp path being created
I am writing a pipeline job that will call another script to execute. The Jenkinsfile and script exist in the same directory and yet the job fails to find the script to run.
This is the relevant bit of script;
stage ('Update') {
try {
dir('jenkins/pipeline/update-jenkins-plugins-ppln') {
sh 'ls -l'
sh 'update-plugins.sh'
}
}
which returns the following error;
[update-jenkins-plugins-ppln] Running shell script
+ ls -l
total 8
-rw-r--r-- 1 jenkins jenkins 2441 Dec 20 09:34 Jenkinsfile
-rwxr-xr-x 1 jenkins jenkins 506 Dec 19 14:06 update-plugins.sh
[Pipeline] sh
[update-jenkins-plugins-ppln] Running shell script
+ update-plugins.sh
/var/lib/jenkins/workspace/update-jenkins-plugins-ppln/jenkins/pipeline/update-jenkins-plugins-ppln@tmp/durable-11cefdd0/script.sh: 2: /var/lib/jenkins/workspace/update-jenkins-plugins-ppln/jenkins/pipeline/update-jenkins-plugins-ppln@tmp/durable-11cefdd0/script.sh: update-plugins.sh: not found
As you can see, the pathing I'm using is correct because according to the ls the file I need update-plugins.sh is in the directory I've pathed to. For some reason though, when actually searching for the script Jenkins is adding @tmp/durable-8d48734f/script.sh onto the path.
Various troubleshooting:
I read that you have to checkout the branch again even if you're already checking it out to get the Jenkinsfile, so I am.
I have ssh'd into the Jenkins box to check and yes, the script is there.
Why is Jenkins adding the @tmp bit, and is there a way to prevent this behavior?
A:
I guess your pwd is not in PATH so you have to call it like this: sh './update-plugins.sh'
A:
Have you tried using the jenkins workspace environment variable WORKSPACE (absolute path of the workspace)? With that your line would look something like this:
sh '${WORKSPACE}/jenkins/pipeline/update-jenkins-plugins-ppln/update-plugins.sh'
|
The Pythons Autobiography by The Pythons
The Pythons Autobiography by The Pythons is the official autobiography of the Monty Python team, released in 2003. It covers the whole of Python history, from their childhoods all the way through to the 30th anniversary celebrations in 1999.
The book was edited by Bob McCabe from interviews held with John Cleese, Terry Gilliam, Eric Idle, Terry Jones and Michael Palin. Interspersed with these are archive interviews with Graham Chapman as well as new contributions from Chapman’s partner David Sherlock, his brother John, and sister-in-law Pam. The book also features excerpts from the personal diaries of Terry Jones and Michael Palin, alongside many previously unseen photographs from the team’s personal archives.
Originally released as a large format hardback, in the style of The Beatles Anthology book, it was later issued as a smaller paperback version. A 2-CD set of interviews recorded for the book was released simultaneously.
Contents
In Which The Pythons Meet The PythonsTerry Jones slags off the othersMichael Palin blows the gaff on the PythonsEric Idle bares his soul about the restJohn Cleese talks about himself in relation to the othersGraham Chapman speaks from beyond the voidTerry Gilliam pisses on the Pythons
In Which We Are BornEric IdleMichael PalinJohn CleeseTerry JonesGraham ChapmanTerry Gilliam
In Which We Pretend To Grow UpUniversitiesLife before the Circus
’It’s…’Monty Python’s Flying CircusAnd Now For Something Completely DifferentThe giant has been stung
In Which We All Become StarletsMonty Python and the Holy GrailLife of BrianThe Bowl of Life
The Meaning Of Death
…And Beyond
Credits
Writers - Graham Chapman, John Cleese, Terry Gilliam, Eric Idle, Terry Jones, Michael Palin
Contributing writers - David Sherlock, John Chapman, Pam Chapman
Editor - Bob McCabe
Designer - Harry Green
References
Category:Monty Python literature
Category:Autobiographies
Category:2003 non-fiction books |
nothing wrong with working hard, that's what this country is supposed to based on.....secondly, it's real tough to pick a career right out of school. I am 30 years old and currently working as a school teacher with two degrees, but I also own two different companies. So I have 3 full time jobs, and before I did this, I worked in the construction industry, labor industry, landscaping.....you name it, I've done it. My plan A was to become a pilot...I did that but hated flying airplanes, then plan b was college, then plan c was to teach but I ended up on plan Z then came back to plan D just to start a plan A5 and end up at 30 years old on plan F10...so my point is that things are gonna change and change often. It's best to get him the skills he can easily transfer to any industry or any type of work. Learning a trade is pretty easy, so is going to school. The best thing to do is teach him how to handle every different situation, how to solve REAL problems and how to adapt. You said he's already got a work ethic and that's great. Make sure to promote him to TRY any of his ideas, even if he fails at it. He WILL be successful if he's willing to work hard and TRY things that others aren't willing to do, like start a landscaping company, or go to college/trade school, or both...The military could also be an option. I was never in but I see the value in learning a skill and discipline from the military. I also thought the Coast Guard sounded like a cool job.
I am 20 years old going to college full time as well as running my landscape business full time as well for the most part. Its hell in a handbag in the spring and fall when were slammed. However, ive managed to realize if you have the drive along with good gear and guys that are reliable it is possible. Currently my company services around 175 customers give or take and this year we should add many more. They key is time management and know how. People think im crazy when i tell them i go to a respected college full time, own my own company, have a gf who is very understanding, and play on 4 ice hockey teams. Its possible. I enjoy being my own boss and take pride in being able to control my life completely. This season will be our 3rd year of official business. I am completely debt free and making more money than many of my professors in the process. If your son has any questions feel free to have him pm me and check out my company thread.
Barrett I'd hate to see your dayplanner, LOL I wish I had that much drive when I was 20, but then again I was 23 and training new recruits to go over to the gulf and fight, the military can add a whole new dimension to your life, it's not a bad route either.They can pay for college also, they paid for my degree.
jason, i have class either first in the morning or in the night at the college, not online. I do not only mow and blow. My company does all aspects of landscape maintenance, planting, and minor design work. Thanks for the criticism.
i'm confused. how do you go to college full time and mow full time? you are at school all day so you can't be out mowing. what do you do mow at night with lights on? lol
oh i forget kids don't even go to school these days. they just do it online at home. i didn't have that option growing up lol.
Click to expand...
mama says, if you ain't got nuttin nice to say, then don't say it at all.....I give the kid props for going to college and OWNING and RUNNING his own successful company. Not only is he doing it, he had the balls to give it a try. Compare him to 95% of his classmates that go to class, come home and drink and smoke reefer the rest of the day....It's hard to argue with success.
Thanks for the compliment MJ. I still have time to be social and party with my buddies but in the spring especially it gets put on the back burner. If anyone doubts the scope of my company check out my business thread on here or my facebook page. My company is called Young Entrepreneur Landscaping LLC. On here its misspelled so its probably best to go through my profile to it.
spring time is the busy time for most, bet that's fun with finals week to boot eh? My busy time is the fall, which for me is a *****. I'm a school teacher full time (cept summers of course) and the fall killed me with all the clean ups after school. not to mention it gets dark earlier then too. I gotta give you props tho, I'm sure it sucks now but hard work always pays off, even in our current economy with our current president. you can do anything shitty for a few years, just keep looking ahead to the future |
loan reserve
With the recent Financial Accounting Standards Board vote to proceed and the final Accounting Standards Update now published, the Current Expected Credit Loss (CECL) standards remain top of mind for the C-suite in financial institutions. Now is the time to begin the steps for developing a data preparation plan for CECL.
With the recent Financial Accounting Standards Board vote to proceed and the final Accounting Standards Update now published, the Current Expected Credit Loss (CECL) standards remain top of mind for the C-suite in financial institutions. Even though the official adoption deadline has been pushed back to after December 2019, financial institutions should take actions today to help prepare for the new rules. Data is a great place to start.
"
The Impact of CECL and Financial Institution Readiness
When it comes to CECL compliance, top financial consultants agree that extensive amounts of historical data, including different lengths of portfolio histories, will be needed. In addition, this research reveals that a majority of financial institutions do not understand how their risk management methodology needs to change. Nor do they comprehend the impacts of the changes that will need to be made to calculate Allowance for Loan and Lease Losses (ALLL).
This represents a significant opportunity for top-tier consultancies to provide valuable thought leadership and guidance now, before financial institutions find themselves scrambling to meet the new standard. Learn more in our survey results."
With the Financial Accounting Standards Board (FASB) Current Expected Credit Loss (CECL) impairment standard and Allowance for Loan and Lease Losses (ALLL) finalized, preparation and interpretation has begun. Having the right tools to help gather and organize the historical data, create pools and calculate loss rates is critical. In this webinar, we’ll walk through Prologue™ Credit Loss Manager from Fiserv and how it will help you be prepared for CECL. |
Distribution of tritium-labelled 8-methoxypsoralen in the rat, studied by whole body autoradiography.
The distribution of 3H-8-methoxypsoralen has been studied in rats by whole body autoradiography. The highest organ concentration were seen 1 hour after dosing. The most pronounced accumulation was found centriblobular in the liver, corticomedullary in the kidneys, and in the cortex of the adrenals. The concentrations in these organs were approximately six times higher than in the blood. Other organs showed concentrations similar to blood levels. Illumination with UVA (10 J/cm2) increased the concentrations in the subcutis. |
Q:
How to read number of lines in Fortran 90 from a text file?
How to read number of lines present in a text file.
My text file seems to be like:
1
2
3
.
.
.
n
A:
nlines = 0
OPEN (1, file = 'file.txt')
DO
READ (1,*, END=10)
nlines = nlines + 1
END DO
10 CLOSE (1)
print*, nlines
end
P.S. I totally disagree that this question "seems unclear and shows no effort". Man, you just don't know what you're saying. This question is firstly absolutely clear and secondly it does not have to "show any effort" - that's a stupid requirement in this case, because it is a common practice to ask "how to do A in a language B" - with no efforts required.
OR:
nlines = 0
OPEN (1, file = 'file.txt')
DO
READ(1,*,iostat=io)
IF (io/=0) EXIT
nlines = nlines + 1
END DO
CLOSE (1)
print*, nlines
|
Identification and characterization of unknown degradation impurities in beclomethasone dipropionate cream formulation using HPLC, ESI-MS and NMR.
The present study focuses on identifying the degradation profile and pathways of unknown impurities from beclomethasone dipropionate (BDP) topical cream formulation reported under accelerated stability conditions. Six degradation impurities were observed during the accelerated stability testing of BDP topical cream formulation, and these thermally labile degradation impurities were primarily identified using a simple, effective and mass compatible isocratic reversed-phase high-performance liquid chromatography with ultraviolet detection method. The degradation impurities found in this sample were of very low concentration levels, thus the concentration of these impurities in the sample was enriched by mimicking the thermal degradation conditions to structurally elucidate the unknown impurities. These BDP thermal degradation impurities were isolated using preparative liquid chromatography and followed by pre-concentration using rota-vapour. Further, the collected thermal degradation impurities were characterized using ESI-MS, and the major impurity was identified using 1H and C13 NMR spectroscopy, and DEPT technique. Plausible degradation pathway and mechanism of each impurity from BDP has been proposed based on the obtained mass and NMR spectral data. Thus, the present method is simple and suitable to be applied towards BDP assay in various formulations, and also to investigate the thermal stability and degradation kinetics of the final drug product. |
Hollow Sections from India
Riding on unfathomable volumes of industrial expertise, we are offering an excellent range of Square Hollow Section Pipe. Being a quality-oriented organization, we assure our clients that this hollow section is the best in quality. Our experts only utilize fine quality raw material, while manufacturing the entire...more...
Hollow Sections offered by Piyush Steel are widely used for industrial sheds, towers, furniture manufacturing and bus body structure. These Hollow Sections are known for their superior durability, high tensile strength and corrosion resistant features. The inner and outer sections of these Hollow Sections have...more...
We offer high quality Hollow Section (RHS & CHS), which are manufactured, strictly as per the industry set norms.We manufacture a wide range of Stainless Steel Rectangular Hollow Sections which finds their usage in many engineering industries.more...
We offer a wide range of Steel Hollow Sections ( SHS )which are available in various sizes, dimensions, shapes, etc with value added Services. our products cater to the varied industrial requirements of our clients. We also offer customization exactly as per client's requirement. Our materials of product...more...
We manufacture a wide range of Stainless Steel Rectangular Hollow Sections which finds their usage in many engineering industries. We develop these sections by finest quality raw materials and sophisticated machinery. They are widely appreciated for high tensile strength, corrosion resistance and durability. Our...more...
Being a reckoned name in the industry, we have introduced Square Hollow Pipes, under our product gamut. Manufactured in accordance with the approved industry norms at our vendor workplace, offered range is imparted with high strength and anti-corrosive nature. Prices offered are reasonable and the delivery is...more...
We are instrumental in offering premium quality range of Pipe Sections that are highly demanded by pharmaceutical and chemical industries. These pipe section are designed to perform flawlessly during whole life span. Our team of skilled professionals fabricate these pipe section as per the industrial laid norms...more...
Galvanised Hollow Section (RHS & CHS) We offer a wide range of Steel Hollow Sections in Square and Rectangular shape. We can manufacture all the sizes and thickness as per customer requirement. We can give you the Hollow Section in both Galvanised and Black finish.more...
Rectangular Hollow Section Pipes offered by us are known for their superior durability, high tensile strength and corrosion resistant features. The inner and outer sections of these tubes have anti rust coating to provide protection against corrosion and increase the durability. Furthermore, we offer these pipes to the clients at cost effective rates.more...
Hollow structural sections, hollow tubular sections, steel hollow structural sections are a type of metal profile with a hollow tubular cross section. HSS is only composed of structural steel per code. During the manufacturing process flat steel plate is gradually changed in shape to become round where the edges...more...
Backed by the support of credible vendors, we are able to come up with Square Hollow Section. Patrons are augmenting the demand of provided square hollow section as these are in-tandem, with universally accepted quality standard. With an aim to ensure the same, our vendors manufacture this square hollow section...more...
We manufacture a wide range of high quality galvanized Zed section. These Zed section are fabricated from high grade materials and are available at competitive prices. We offers customized and highly durable Z-Section for our customers.more...
We are engaged in providing Round Hollow Sections Pipes, which come with anti rust coating in both inner and outer part. This helps the pipes to sustain against corrosion. Our hollow sections are widely used in water supply chemical, fertilizers and oil industries. Moreover, we are capable of providing our Round Hollow Sections to the clients in required quantity within the set time frame.more...
We are one of the leading organizations engaged in offering a wide range of Hollow Sections. These products are manufactured] at par with the international standards of quality. Our products are available at market leading prices and can also be customized as per the specifications mentioned by the valuable patrons. Their varied features are as follows:* Excellent finish* Precision engineered * Robust constructionmore...
Catering to the vast market for a wide range of Stainless Steel Hollow Sections. Customers can avail these products from us in the shape of rectangular/round/oval/square and other profiles sections as per their needs. All our products have anti-rust oil coatings that enhance their life. Moreover, clients can buy all or hollows by paying through varied simple modes.Attributes:* High tensile strength* Resistance against abrasion* Robust constructionmore...
We offer our clients with Square and Rectangular Steel Hollow Sections which are fabricated using hot rolled steel pipes. These sections are easily trimmed for the usage in various industrial applications. The entire range is appreciated among clients for high strength, and long functional life. These sections are available in sizes up to 200 x 300 x 12.5 mm and in the specifications of IS: 4923, ASTM A 500 & EN 10219.more...
We are involved in offering Structural Hollow Sections that are available in varying specifications regarding size, dimension and material grade. These tubes are constructed using finest grades of stainless steel, duplex steel, alloy steel, nickel alloy and copper alloy. Provided at leading industry prices.more...
We manufacture & export Hollow Section as per customer's requirement & specification. The hollow sections are specifically designed to suit the requirements of the automobile industry. These sections ensure that anti-corrosion medium reaches all the areas & also works efficiently in obtaining rigidity in a...more...
Being one of the most trusted traders and suppliers in the industry we are known for supplying high quality range of industrial products like square hollow section. These squares we offered are widely applicable in various industries like power and engineering for various applications. We do not compromise with...more...
With thorough understanding of the relevant industry, we are offering a wide range of Rectangular Hollow Sections. These hollow sections are generally used at construction sites for making structures. Designed with perfection, these hollow sections are manufactured with the use of well tested raw material and...more... |
Q:
Military ranks in CthulhuTech
I am a bit confused about the command structure of CthulhuTech. What rank is appropriate for starting players who are NEG military members ? Does this depend on Profession, and if so, soes the Engel Project have its own rank structure ?
I understand that I can just make up all the answers by GM fiat, but I don't want to do so if there's an official or semi-official guide.
A:
The following three professions has a starting character be in the military:
Soldier (Authority 1, Duty 2 for military; p.77)
Mecha Pilot (Authority 3, Duty 2; p.75)
Engel Pilot (Authority 3, Duty 3; p.73)
Authority has four ranks (p.94):
1: Low-ranking non-commissioned officer
2: High-ranking non-commissioned officer
3: Low-ranking commissioned officer or warrant officer
4: High-ranking commissioned officer
But what is the difference between low-ranking and high ranking? There are seven non-commissioned ranks in both the Army and Navy. The highest of these, SM of the Army and MCPO of the Navy are unique to the United States military of today. Going by that logic there's only one of each, making it not likely that a starting character starts out as the most senior enlisted soldier/seaman of the NEG military. This means that we have six ranks left, which splits into half nicely for three low-ranking non-commissioned officers:
E-4: Corporal/Leading Seaman
E-5: Sergeant/Petty Officer
E-6: Staff Sergeant/Senior Petty Officer
And three high ones:
E-7: First Sergeant/Chief Petty Officer
E-8: Color Sergeant/Senior Chief Petty Officer
E-9: Sergeant Major/Master Chief Petty Officer
As you can see both of these have a "central" rank on their own, meaning that Sergeant/Petty Officer and Color Sergeant/Senior Petty Officer is a fine middle point for Authority 1 and 2. Now, the issue is when you have several people of the same rank running around: multiple Sergeants (Authority 1) can work together in a platoon, but in such an organization they all command men themselves. As such, making them rank lower and have one be the E-5 rank officer works on a squad level. When you want to differentiate between the bunch you to establish a leader can either up the Authority quality by one point, or go for something like the Commendation Quality (p.94) and move the character up one rank.
Now, with the Mecha and Engel pilots it's a bit more complex. Commissioned officer ranks go from O-1 all the way up to O-10, at hich point you are a Field Marshal or an Admiral. If we split this one in half as well a low-ranking commissioned officer would be anything from O-1 to O-5:
O-1: Second Lieutenant/Midshipman
O-2: First Lieutenant/Sub Lieutenant
O-3: Captain/Lieutenant
O-4: Major/Lieutenant Colonel
O-5: Lieutenant Colonel/Commander
So what O-rank would a Mecha or Engel pilot have? Mecha pilots are compared to "the fighter jocks of old" (p.75). The New Earth Government does not employ an air force as such; instead the navy is a bunch of flying ships. If we go by the same organization size as the modern air force however, a Flight Lieutenant (O-3) commands the smallest possible organizational size of the air force: a Wing of 3-6 craft. This would make an ideal organizational size for a party of players, meaning that them ranking below the O-3 leader of their unit would work fine.
Engel Pilots meanwhile are rare and require specific training, an implant and an unshakable will. This does not make them warrant officers though. In the real world skills in engineering, ordnance, intelligence, supply and so on are specialties for a Warrant Officer. Ergo, being able to maintain the alien cyborg deathbot would qualify one for being a warrant officer, but piloting one would not because that's not what warrant officers do. What Engel pilots are however is a bunch of highly qualified pilots who deal with dangerous and complex biomechanical horrors on a daily basis yet operate in a way similar to Mecha Pilots, which would in my eyes allow them to qualify for a higher rank. And the higher paygrade would be offset by A: the rarity of such pilots and something as simple like that is a simple sacrifice and B: the high turnover means that you won't have to pay this higher paygrade for very long. It's cynical, but not inaccurate. As such, I'd make regular Engel Pilots O-3 and leaders one rank higher.
Summary:
Soldier: E-5 for the squad leader, E-4 for the rest.
Mecha Pilot: O-3 for the wing leader, O-2 for the rest.
Engel Pilot: O-4 for the wing leader, O-3 for the rest.
The leader can be either one of the players or an NPC: this depends on if you can get players to go along with one being in charge or if they want more freedom.
|
from unittest import TestCase
from mock import Mock
from qrl.core.MessageRequest import MessageRequest
class TestMessageRequest(TestCase):
def setUp(self):
self.mr = MessageRequest()
self.test_data = {
"camel": "animal",
"bitcoin": "cryptocoin"
}
def test_validate(self):
# MessageRequest.validate() simply make sure self.params and an arg are the same dict.
# MessageRequest.params is None
result = self.mr.validate(self.test_data)
self.assertFalse(result)
# MessageRequest.params is the same as the argument
self.mr.params = self.test_data
result = self.mr.validate(self.test_data)
self.assertTrue(result)
# MessageRequest.params is missing a key compared to the argument
self.mr.params = {"bitcoin": "cryptocoin"}
result = self.mr.validate(self.test_data)
self.assertTrue(result)
self.mr.params = self.test_data
# the argument is missing a key that MessageRequest.params has
result = self.mr.validate({})
self.assertFalse(result)
# the argument has different data from MessageRequest.params
result = self.mr.validate({"camel": "cryptocoin", "bitcoin": "animal"})
self.assertFalse(result)
def test_add_peer(self):
msg_type = Mock(name='mock Message Type')
peer = Mock(name='mock P2PProtocol')
self.mr.add_peer(msg_type, peer, params=self.test_data)
self.assertEqual(self.mr.params, self.test_data)
self.assertEqual(self.mr.msg_type, msg_type)
self.assertEqual(self.mr.peers_connection_list, [peer])
|
\\[section\\] \\[Theorem\\][Proposition]{} \\[Theorem\\][Remark]{} \\[Theorem\\][Lemma]{} \\[Theorem\\][Corollary]{} \\[Theorem\\][Definition]{} \\[Theorem\\][Example]{}
[^1]\\
BORIS S. MORDUKHOVICH [^2] and T. T. A. NGHIA[^3]\\
[**Dedicated to Jon Borwein in honor of his 60th birthday**]{}\\
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain infinitely many of equality and inequality constraints with arbitrary (may not be compact) index sets. These problems reduce to semi-infinite programs in the case of finite-dimensional spaces of decision variables. We extend the classical Mangasarian-Fromovitz and Farkas-Minkowski constraint qualifications to such infinite and semi-infinite programs. The new qualification conditions are used for efficient computing the appropriate normal cones to sets of feasible solutions for these programs by employing advanced tools of variational analysis and generalized differentiation. In the further development we derive first-order necessary optimality conditions for infinite and semi-infinite programs, which are new in both finite-dimensional and infinite-dimensional settings.
Introduction
============
The paper mainly deals with constrained optimization problems formulated as follows: $$\\begin{aligned}
\\label{1.1}
\\left\\{\\begin{array}{ll}
\\mbox{minimize }\\;f(x)\\;\\mbox{ subject to}\\\\
g_t(x)\\leq 0\\;\\mbox{ with }\\;\\;t\\in T\\;\\mbox{ and }\\;h(x)=0,
\\end{array}\\right.\\end{aligned}$$ where $f:X\\to \\Bar\\R:=(-\\infty,\\infty]$ and $g_t:X\\to \\Bar \\R$ as $t\\in T$ are extended-real-valued functions defined on Banach space $X$, and where $h:X\\to Y$ is a mapping between Banach spaces. An important feature of problem (\\[1.1\\]) is that the index set $T$ is [*arbitrary*]{}, i.e., may be infinite and also noncompact. When the spaces $X$ and $Y$ are finite-dimensional, the constraint system in (\\[1.1\\]) can be formed by finitely many equalities and infinite inequalities. These optimization problems belong to the well-recognized area of [*semi-infinite programming*]{} (SIP); see, e.g., the books [@GL; @GL1] and the references therein. When the dimension of the decision space $X$ as well as the cardinality of $T$ are infinite, problem belongs to the so-called [*infinite programming*]{}; cf. the terminology in [@an; @DGLS] for linear and convex problems of this type. We also refer the reader to more recent developments [@CLMP1; @CLMP2; @DMN1; @DMN2; @FLN; @LNP] concerning linear and convex problems of infinite programming with inequality constraints.
To the best of our knowledge, this paper is the first one in the literature to address [*nonlinear*]{} and [*nonconvex*]{} problems of infinite programming. Our primary goal in what follows is to find verifiable [*constraint qualifications*]{} that allow us to establish efficient [*necessary optimality conditions*]{} for local optimal solutions to nonconvex infinite programs of type under certain differentiability assumptions on the constraint (while not on the cost) functions. In this way we obtain a number of results, which are new not only for infinite programs, but also for SIP problems with noncompact (e.g., countable) index sets.
It has been well recognized in semi-infinite programming that the [*Extended Mangasarian-Fromovitz Constraint Qualification*]{} (EMFCQ), first introduced in [@JTW], is particularly useful when the index set $T$ is a compact subset of a finite-dimensional space and when $g(x,t):=g_t(x)\\in\\mathcal{C}(T)$ for each $x\\in
X$; see, e.g., [@BS; @CHY; @jrs; @HK; @KH; @LS; @S; @st; @zy] for various applications of the EMFCQ in semi-infinite programming. Without the compactness of the index set $T$ and the continuity of the inequality constraint function $g(x,t)$ with respect to the index variable $t$, problem (\\[1.1\\]) changes dramatically and–as shown below–does not allow us to employ the EMFCQ condition anymore. That motivates us to seek for new qualification conditions, which are more appropriate in applications to infinite programs as well as to SIP problems with noncompact index sets and infinite collections of inequality constraints defined by discontinuous functions.
In this paper we introduce two new qualification conditions, which allow us to deal with infinite and semi-infinite programs of type without the convexity/linearity and compactness assumptions discussed above. The first condition, called the [*Perturbed Mangasarian-Fromovitz Constraint Qualification*]{} (PMFCQ), turns out to be an appropriate counterpart of the EMFCQ condition for infinite and semi-infinite programs with noncompact index sets $T$ and discontinuous functions $g(x,\\cdot)$. The second condition, called the [*Nonlinear Farkas-Minkowski Constraint Qualification*]{} (NFMCQ), is a new qualification condition of the [*closedness*]{} type, which is generally independent of both EMFCQ and PMFCQ conditions even for countable inequality constraints in finite dimensions.
Our approach is based on advanced tools of variational analysis and generalized differentiation that can be found in [@M1; @M2]. Considerably new ingredients of this approach relate to computing appropriate [*normal cones*]{} to the set of [*feasible solutions*]{} for the infinite/semi-infinite program given by $$\\label{1.2}
\\O:=\\big\\{x\\in X\\big|\\;h(x)=0,\\;g_t(x)\\le 0\\;\\mbox{ as }\\;t\\in
T\\big\\}.$$
Since the feasible solution set $\\O$ is generally nonconvex, we need to use some normal cone constructions for nonconvex sets. In this paper we focus on the so-called [*Fréchet/regular normal cone*]{} and the [*basic/limiting normal cone*]{} introduced by Mordukhovich; see [@M1] with the references and commentaries therein. Developing general principles of variational analysis, we employ this approach to derive several necessary optimality conditions for the class of nonlinear infinite programs under consideration.
The rest of the paper is organized as follows. In Section 2 we present basic definitions as well as some preliminaries from variational analysis and generalized differentiation widely used in this paper. Section 3 is mainly devoted to the study of the new PMFCQ and NFMCQ conditions for infinite programs in Banach spaces. Relationships between the new qualification conditions and other well-recognized constraint qualifications for SIP and infinite programs are discussed here.
In Section 4, we provide exact computations for the Fréchet and limiting normal cones to the feasible set of under the PMFCQ and NFMCQ conditions. This part plays a crucial role for the subsequent results of the paper. Following this way, Section 5 concerns the derivation of necessary optimality conditions for local minimizers of the infinite and semi-infinite programs under consideration.
Our notation and terminology are basically standard and conventional in the area of variational analysis and generalized differentials.; see, e.g., [@M1; @rw]. As usual, $\\|\\cdot\\|$ stands for the norm of Banach space $X$ and $\\la\\cdot,\\cdot\\ra$ signifies for the canonical pairing between $X$ and its topological dual $X^*$ with the symbol $\\st{w^*}\\to$ indicating the convergence in the weak$^*$ topology of $X^*$ and the symbol $\\cl$ standing for the weak$^*$ topological closure of a set. For any $x\\in X$ and $r>0$, denote by $\\B_r(x)$ the closed ball centered at $x$ with radius $r$ while $\\B_X$ stands for the closed unit ball in $X$.
Given a set $\\O\\subset X$, the notation $\\co\\O$ signifies the convex hull of $\\O$ while that of $\\cone\\O$ stands for the [*convex conic hull*]{} of $\\O$, i.e., for the convex cone generated by $\\O\\cup\\{0\\}$. Depending on the context, the symbols $x\\st{\\O}{\\to}\\ox$ and $x\\st{\\ph}{\\to}\\ox$ mean that $x\\to\\ox$ with $x\\in\\O$ and $x\\to\\ox$ with $\\ph(x)\\to\\ph(\\ox)$ respectively. Given finally a set-valued mapping $F\\colon X\\tto X^*$ between $X$ and $X^*$, recall that the symbol $$\\begin{aligned}
\\label{1.4}
{\\mathop{{\\rm Lim}\\,{\\rm sup}}}_{x\\rightarrow \\ox} F(x):=\\Big\\{x^*\\in
X^*\\Big|\\;\\exists\\,x_n\\to\\ox,\\;\\exists\\,
x^*_n\\xrightarrow{w^*}x^*\\;\\mbox{ with }\\;x^*_n\\in F(x_n),\\quad
n\\in\\IN\\Big\\}\\end{aligned}$$ stands for the [*sequential Painlevé-Kuratowski outer/upper limit*]{} of $F$ as $x\\to\\ox$ with respect to the norm topology of $X$ and the weak$^*$ topology of $X^*$, where $\\IN:=\\{1,2,\\ldots\\}$.
Preliminaries from Generalized Differentiation
==============================================
In this preliminary section we briefly review some constructions of generalized differentiation used in what follows; see [@BZ; @M1; @rw; @sc] for more details and related material. Throughout this paper, unless otherwise stated, all the spaces under consideration are Banach.
Given an extended-real-valued function $\\ph\\colon
X\\to\\oR:=(-\\infty,\\infty]$, we always assume that it is proper, i.e., $\\ph\\not\\equiv\\infty$. The notation $$\\begin{aligned}
\\dom\\ph:=\\big\\{x\\in X\\big|\\;\\ph(x)<\\infty\\big\\}\\;\\mbox{ and }\\;\\epi\\ph:=
\\big\\{(x,r)\\in X\\times\\R\\big|\\;r\\ge\\ph(x)\\big\\}\\end{aligned}$$ are used for the domain and the epigraph of $\\ph$, respectively,
Define the [*analytic $\\ve$-subdifferential*]{} of $\\ph$ at $\\ox\\in\\dom\\ph$ by $$\\begin{aligned}
\\label{2.1}
\\Hat\\partial_\\ve\\ph(\\ox):=\\Big\\{x^*\\in
X^*\\Big|\\;\\liminf_{x\\to\\ox}\\frac {\\ph(x)-\\ph(\\ox)-\\la
x^*,x-\\ox\\ra}{\\|x-\\ox\\|}\\ge-\\ve\\Big\\},\\quad\\ve\\ge 0\\end{aligned}$$ and let $\\Hat\\partial_\\ve\\ph(\\ox):=\\emp$ for $\\ox\\notin\\dom\\ph$. If $\\ve=0$, the construction $\\Hat\\partial
\\ph(\\ox):=\\Hat\\partial_0\\ph(\\ox)$ in (\\[2.1\\]) is known as the [*Fréchet*]{} or [*regular subdifferential*]{} of $\\ph$ at $\\ox$; it reduces in the convex case to the classical subdifferential of convex analysis. The sequential regularization of defined via the outer limit by $$\\begin{aligned}
\\label{2.2}
\\partial\\ph(\\ox):={\\mathop{{\\rm Lim}\\,{\\rm sup}}}_\\substack{x\\st{\\ph}{\\to}\\ox}{\\ve\\dn 0}\\Hat\\partial_\\ve\\ph(x),\\end{aligned}$$ is known as the [*limiting*]{}, or [*basic*]{}, or [*Mordukhovich subdifferential*]{} of $\\ph$ at $\\ox\\in\\dom\\ph$. It can be equivalently described with $\\ve=0$ in (\\[2.2\\]) if $\\ph$ is lower semicontinuous (l.s.c.) around $\\ox$ and if $X$ is an Asplund space, i.e., each of its separable subspace has a separable dual (in particular, any reflexive space is Asplund; see, e.g., [@BZ; @M1] for more details and references). We have $\\partial\\ph(\\ox)\\ne\\emp$ for every locally Lipschitzian function on an Asplund space.
A complementary construction to , known as the [*singular*]{} or [*horizontal subdifferential*]{} of $\\ph$ at $\\ox$, is defined by $$\\begin{aligned}
\\label{2.3}
\\partial^\\infty\\ph(\\ox):={\\mathop{{\\rm Lim}\\,{\\rm sup}}}_\\substack{x\\st{\\ph}{\\to}\\ox}{\\lm,\\ve\\dn
0}\\lm\\Hat\\partial_\\ve\\ph(x),\\end{aligned}$$ where we can equivalently put $\\ve=0$ if $\\ph$ is l.s.c. around $\\ox$ and $X$ is Asplund. Note that $\\partial^\\infty\\ph(\\ox)=\\{0\\}$ if $\\ph$ is locally Lipschitzian around $\\ox$. The converse implication also holds provided that $\\ph$ is l.s.c. around $\\ox$, that $X$ is Asplund, and that $\\ph$ satisfies the so-called “sequential normal epi-compactness” property at $\\ox$ (see below), which is always the case when $X$ is finite-dimensional.
Given a set $\\O\\subset X$ with its indicator function $\\dd(\\cdot;\\O)$ defined by $\\delta(x;\\O):=0$ for $x\\in\\O$ and by $\\delta(x;\\O):=\\infty$ otherwise, we construct the [*Fréchet/regular normal cone*]{} and [*limiting/basic/Mordukhovich normal cone*]{} to $\\O$ at $\\ox\\in\\O$ by, respectively, $$\\label{2.4}
\\Hat N(\\ox;\\O):=\\Hat\\partial\\delta(\\ox;\\O)\\quad\\textrm{and}\\quad
N(\\ox;\\O):=\\partial\\delta(\\ox;\\O)$$ via the corresponding subdifferential of the indicator function. If follows from (\\[2.4\\]) that $\\Hat N(\\ox;\\O)\\subset N(\\ox;
\\O)$. A set $\\O$ is [*normally regular*]{} at $\\ox$ if $\\Hat
N(\\ox;\\O)= N(\\ox;\\O)$; the latter is the case of convex and some other “nice" sets.
Recall further that $\\O$ is [*sequentially normally compact*]{} (SNC) at $\\ox\\in\\O$ if for any sequences $\\ve_n\\dn 0$, $x_n\\st{\\O}\\to\\ox$, and $x^*_n\\in\\Hat N_{\\ve_n}(x_n;\\O):=\\Hat \\partial_{\\ve_n} \\delta(\\ox;\\O)$ we have $$\\begin{aligned}
\\big[x^*_n\\st{w^*}\\to 0\\big]\\Longrightarrow\\big[\\|x^*_n\\|\\to
0\\big]\\;\\mbox{ as }\\;n\\to\\infty,\\end{aligned}$$ where $\\ve_n$ can be omitted if $\\O$ is locally closed around $\\ox$ and the space $X$ is Asplund. A function $\\varphi:X\\to
\\Bar\\R$ is [*sequentially normally epi-compact*]{} (SNEC) at a point $\\ox\\in \\dom \\varphi$ if its epigraph is SNC at $(\\ox,\\varphi(\\ox))$. Besides the finite dimensionality, the latter properties hold under certain Lipschitzian behavior; see, e.g., [@M1 Subsections 1.1.4 and 1.2.5].
Having an arbitrary (possibly infinite and noncompact) index set $T$ as in , we consider the product space of multipliers $\\R^T:=\\{\\lm=(\\lm_t)|\\;t\\in T\\}$ with $\\lm_t\\in\\R$ for $t\\in T$ and denote by $\\Tilde\\R^T$ the collection of $\\lm\\in\\R^T$ such that $\\lm_t\\ne 0$ for finitely many $t\\in T$. The [*positive cone*]{} in $\\Tilde\\R^T$ is defined by $$\\begin{aligned}
\\label{2.6}
\\tR:=\\big\\{\\lm\\in\\Tilde\\R^T\\big|\\;\\lm_t\\ge 0\\;\\mbox{ for all }\\;t\\in
T\\big\\}.\\end{aligned}$$
Qualification Conditions for Infinite Constraint Systems
========================================================
This section is devoted to studying the set of [*feasible solutions*]{} to the original optimization problem defined by the infinite constraint systems of inequalities and equalities $$\\begin{aligned}
\\label{3.1}
\\left\\{\\begin{array}{ll}
g_t(x)\\le 0,\\;\\;t\\in T,\\\\
h(x)=0,
\\end{array}\\right.\\end{aligned}$$ where $T$ is an arbitrary index set, and where the functions $g_t:X\\to\\Bar\\R$, $t\\in T$, and the mapping $h:X\\to Y$ are differentiable but may not be linear and/or convex. As in (\\[1.2\\]), the set of feasible solutions to , i.e., those $x\\in X$ satisfying , is denoted by $\\O$.
Our [*standing assumptions*]{} throughout the paper (unless otherwise stated) are as follows:\\
.
Recall that a mapping $h\\colon X\\to Y$ is [*strictly differentiable*]{} at $\\ox$ with the (strict) derivative $\\nabla
h(\\ox)\\colon X\\to Y$ if $$\\lim_{x,x'\\to\\ox}\\frac{h(x)-h(x')-\\nabla
h(\\ox)(x-x')}{\\|x-x'\\|}=0.$$ The latter holds automatically when $h$ is continuously differentiable around $\\ox$.
In addition to the standing assumptions (SA), we often impose some stronger requirements on the inequality constraint functions $g_t$ that postulate a certain uniformity of their behavior with respect to the index parameter $t\\in T$. We say that the functions $\\{g_t\\}_{t\\in T}$ are [*uniformly Fréchet differentiable*]{} at $\\ox$ if $$\\begin{aligned}
\\label{3.3}
s(\\eta):=\\sup_{t\\in T}\\sup_\\substack{x\\in\\B_{\\eta}(\\ox)}{x\\ne
\\ox}\\frac{|g_t(x)-g_t(\\ox)-\\la\\nabla
g_t(\\ox),x-\\ox\\ra|}{\\|x-\\ox\\|}\\to 0\\;\\mbox{ as }\\;\\eta\\dn 0.\\end{aligned}$$ Similarly, the functions $\\{g_t\\}_{t\\in T}$ are [*uniformly strictly differentiable*]{} at $\\ox$ if condition (\\[3.3\\]) above is replaced by a stronger one: $$\\begin{aligned}
\\label{3.4}
r(\\eta):=\\sup_{t\\in T}\\sup_\\substack{x,x'\\in\\B_{\\eta}(\\ox)}{x\\ne
x'}\\frac{|g_t(x)-g_t(x')-\\la\\nabla
g_t(\\ox),x-x'\\ra|}{\\|x-x'\\|}\\to 0\\;\\mbox{ as }\\;\\eta\\dn 0,\\end{aligned}$$ which clearly implies the strict differentiability of each function $g_t$, $t\\in T$, at $\\ox$.
Let us present some sufficient conditions ensuring the fulfillment of all the assumptions formulated above for infinite families of inequality constraint functions.
\\[p3\\] [**(compact index sets).**]{} Let $T$ be a compact metric space, let the functions $g_t$ in be Fréchet differentiable around $\\ox$ for each $t\\in T$, and let the mapping $(x,t)\\in X\\times T\\mapsto\\nabla g_t(x)\\in X^*$ be continuous on $\\B_\\eta(\\ox)\\times T$ for some $\\eta>0$. Then the standing assumptions [(SA)]{} as well as [(\\[3.3\\])]{} and [(\\[3.4\\])]{} are satisfied.
[**Proof.**]{} It is easy to see that our standing assumptions (SA) hold, since $\\|\\nabla g_t(\\ox)\\|$ is assumed to be continuous on the compact space $T$ being hence bounded. It suffices to prove that (\\[3.4\\]) holds, which surely implies .
Arguing by contradiction, suppose that (\\[3.4\\]) fails. Then there are $\\ve>0$, sequences $\\{t_n\\}\\subset T$, $\\{\\eta_n\\}\\dn
0$, and $\\{x_n\\}$, $\\{x^\\prime_n\\}\\subset\\B_{\\eta_n}(\\ox)$ such that $$\\label{3.5}
\\frac{|g_{t_n}(x_n)-g_{t_n}(x'_n)-\\la \\nabla
g_{t_n}(\\ox),x_n-x'_n\\ra|}{\\|x_n-x'_n\\|}\\ge
\\ve-\\frac{1}{n}\\;\\mbox{ for all large}\\;n\\in\\IN.$$ Since $T$ is a compact metric space, there is a subsequence of $\\{t_n\\}$ converging (without relabeling) to some $\\bar t\\in T$. Applying the classical Mean Value Theorem to (\\[3.5\\]), we find $\\theta_n\\in[x_n,x^\\prime_n]:=\\co\\{x_n,x^\\prime_n\\}$ such that $$\\begin{aligned}
\\frac{\\ve}{2}&<&\\frac{|\\la \\nabla
g_{t_n}(\\theta_n),x_n-x'_n\\ra-\\la
\\nabla g_{t_n}(\\ox),x_n-x'_n\\ra|}{\\|x_n-x'_n\\|}\\le\\|\\nabla g_{t_n}(\\theta_n)-\\nabla g_{t_n}(\\ox)\\|\\\\
&<&\\|\\nabla g_{t_n}(\\theta_n)-\\nabla g_{\\bar t}(\\ox)\\|+\\|\\nabla g_{\\bar t}(\\ox)-\\nabla g_{t_n}(\\ox)\\|\\end{aligned}$$ for all large $n\\in\\IN$. This contradicts the continuity of the mapping $(x,t)\\in X\\times T\\mapsto \\nabla g_t(x)$ on $\\B_\\eta(\\ox)\\times T$ and thus completes the proof of the proposition. $\\h$
Next we recall a well-recognized constraint qualification condition, which is often used in problems of nonlinear and nonconvex semi-infinite programming.
\\[cd1\\] [**(Extended Mangasarian-Fromovitz Constraint Qualification).**]{} The infinite system [(\\[3.1\\])]{} satisfies the [Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ)]{} at $\\ox\\in
\\O$ if the derivative operator $\\nabla h(\\ox)\\colon X\\to Y$ is surjective and if there is $\\Tilde x\\in X$ such that $\\nabla
h(\\ox)\\tilde x=0$ and that $$\\begin{aligned}
\\label{3.6}
\\la\\nabla g_t(\\ox),\\tilde x\\ra<0\\;\\mbox{ for all }\\;t\\in
T(\\ox):=\\big\\{t\\in T\\big|\\;g_t(\\ox)=0\\big\\}.\\end{aligned}$$
It is clear that in the case of a finite index set $T$ and a finite-dimensional space $Y$ in the EMFCQ condition reduced to the classical Mangasarian-Fromovitz Constraint Qualification (MFCQ) in nonlinear programming. In the case of SIP problems the EMFCQ was first introduced in [@JTW] and then extensively studied and applied in semi-infinite frameworks with $X=\\R^m$ and $Y=\\R^n$; see, e.g., [@HK; @KH; @LS; @Sh], where the reader can find its relationships with other constraint qualifications for SIP problems.
To the best of our knowledge, the vast majority of nonconvex semi-infinite programs are usually considered with the general assumptions that the index set $T$ is compact, the functions $g_t$ are continuously differentiable, and the mapping $(x,t)\\mapsto
\\nabla g_t(x)$ is continuous on $X\\times T$. Under these assumptions and the EMFCQ formulated above, several authors derive the Karush-Kuhn-Tucker (KKT) necessary optimality conditions of the following type: If $\\ox$ is an optimal solution to (\\[1.1\\]) with $f\\in{\\cal C}^1$ and $h=(h_1, h_2,\\ldots,h_n)$, then there are $\\lm\\in\\tR$ from (\\[2.6\\]) and $\\mu\\in \\R^n$ such that $$\\begin{aligned}
\\label{kkt}
0=\\nabla f(\\ox)+\\sum_{t\\in T(\\ox)}\\lm_t\\nabla
g_t(\\ox)+\\sum_{j=1}^n \\mu_j\\nabla h_j(\\ox).\\end{aligned}$$
We are not familiar with any results in the literature on nonconvex infinite programming that apply to problems with noncompact index sets $T$. The following example shows that the KKT optimality conditions in form may fail for nonconvex SIP with countable constraints even under the fulfillment of the EMFCQ.
\\[ex1\\] [**(violation of KKT for nonconvex SIP with countable sets under EMFCQ).**]{} [Consider problem (\\[1.1\\]) with countable inequality constraints given by $$\\begin{aligned}
\\label{3.7}
\\left\\{\\begin{array}{ll}
\\mbox{minimize }\\;(x_1+1)^2+x_2\\;\\mbox{ subject to}\\\\
x_1+1\\le 0\\;\\mbox{ and }\\;\\disp\\frac{1}{3n}x_1^3-x_2\\le
0\\;\\mbox{ for all }\\;n\\in\\IN\\setminus\\{1\\}\\;\\mbox{ with }\\;
(x_1,x_2)\\in\\R^2.
\\end{array}\\right.\\end{aligned}$$ Let $X:=\\R^2$, $Y:=\\{0\\}$, $f(x_1,x_2):=(x_1+1)^2+x_2$, $T:=\\IN$, $g_1(x_1,x_2):=x_1+1$, and $g_n(x_1,x_2):=\\disp\\frac{1}{3n}x^3_1-x_2$ for all $n\\in
\\IN\\setminus\\{1\\}$. Observe that $\\ox:=(-1,0)$ is a global minimizer for problem (\\[3.7\\]) and that $T(\\ox)=\\{1\\}$ for the active index set in . It is easy to check that the EMFCQ holds at $\\ox$ while there is no Lagrange multiplier $\\lm\\in\\R_+$ satisfying the KKT optimality condition at $\\ox$. Indeed, we have $\\la \\nabla g_1(\\ox),\\;(-1,0)\\ra=-1<0$, and the following equation does not admit any solution for $\\lm\\ge
0$: $$(0,0)=\\nabla f(\\ox)+\\lm\\nabla g_1(\\ox)=(0,1)+(\\lm,0).$$]{}
Now we introduce a new extension of the MFCQ condition to the infinite programs under consideration, which plays a crucial role throughout the paper.
\\[cd2\\] [**(Perturbed Mangasarian-Fromovitz Constraint Qualification).**]{} We say that the infinite system [(\\[3.1\\])]{} satisfies the [Perturbed Mangasarian-Fromovitz Constraint Qualification (PMFCQ)]{} at $\\ox\\in\\O$ if the derivative operator $\\nabla h(\\ox)\\colon X\\to Y$ is surjective and if there is $\\tilde x\\in X$ such that $\\nabla h(\\ox)\\tilde x=0$ and that $$\\begin{aligned}
\\label{3.8}
\\inf_{\\ve>0}\\sup_{t\\in T_\\ve(\\ox)}\\la \\nabla g_t(\\ox),\\tilde
x\\ra<0\\;\\mbox{ with }\\;T_\\ve(\\ox):=\\big\\{t\\in T\\big|\\;g_t(\\ox)\\ge
-\\ve\\big\\}.\\end{aligned}$$
In contrast to the EMFCQ, the active index set in (\\[3.8\\]) is [*perturbed*]{} by a small $\\ve>0$. Since $T(\\ox)\\subset
T_\\ve(\\ox)$ for all $\\ve>0$, the PMFCQ is stronger than the EMFCQ. However, as shown in Section 4 and Section 5, the new condition is much more appropriate for applications to semi-infinite and infinite programs with general (including compact) index sets than the EMFCQ.
The following proposition reveals some assumptions on the initial data of ensuring the equivalence between the PMFCQ and EMFCQ.
\\[p4\\] [**(PMFCQ from EMFCQ).**]{} Let $T$ be a compact metric space, and let $\\ox\\in\\O$ in . Assume that the function $t\\in T\\mapsto g_t(\\ox)$ is upper semicontinuous $($u.s.c.$)$ on $T$, that the derivative mapping $\\nabla
h(\\ox)\\colon X\\to Y$ is surjective, and that there is $\\tilde x\\in
X$ with the following properties: $\\nabla h(\\ox)\\tilde x=0$, the function $t\\in T\\mapsto\\la\\nabla g_t(\\ox),\\tilde x\\ra$ is u.s.c., and $\\la\\nabla g_t(\\ox),\\tilde x\\ra<0$ for all $t\\in T(\\ox)$. Then the PMFCQ condition holds at $\\ox$, being thus equivalent to the EMFCQ condition at this point.
[**Proof.**]{} Arguing by contradiction, suppose that the PMFCQ fails at $\\ox$. Then it follows from (\\[3.8\\]) that there exist sequences $\\{\\ve_n\\}\\dn 0$ and $\\{t_n\\}\\subset T$ such that $t_n\\in T_{\\ve_n}(\\ox)$ and $$\\begin{aligned}
\\la\\nabla g_{t_n}(\\ox),\\tilde x\\ra\\ge-\\frac{1}{n}\\;\\mbox{ for all
}\\;n\\in\\IN.\\end{aligned}$$ Since $T$ is a compact metric space, we find a subsequence of $\\{t_n\\}$ (no relabeling), which converges to some $\\bar t\\in T$. Observe from the continuity assumptions made imply that $$\\begin{aligned}
g_{\\bar
t}(\\ox)\\ge\\limsup_{n\\to\\infty}g_{t_n}(\\ox)\\ge\\limsup_{n\\to\\infty}-\\ve_n=0\\;\\mbox{
and}\\\\ \\la \\nabla g_{\\bar t}(\\ox),\\tilde x\\ra\\ge\\limsup_{n\\to\\infty}
\\la\\nabla g_{t_n}(\\ox),\\tilde x\\ra\\ge
\\limsup_{n\\to\\infty}-\\frac{1}{n}=0.\\end{aligned}$$ Thus we have that $\\bar t\\in T(\\ox)$ and $\\la\\nabla g_{\\bar
t}(\\ox),\\tilde x\\ra\\ge 0$, which is a contradiction that completes the proof of the proposition. $\\h$
The following example shows that the EMFCQ does not imply the PMFCQ (while not ensuring in this case the validity of the required necessary optimality conditions as will be seen in Sections 4 and 5) even for simple frameworks of nonconvex semi-infinite programs with [*compact*]{} index sets.
\\[exa1\\] [**(EMFCQ does not imply PMFCQ for semi-infinite programs with compact index sets).**]{} [Let $X=\\R^2$ and $T=[0,1]$ in with $h=0$ and $$\\begin{aligned}
g_0(x):=x_1+1\\le 0,\\quad g_t(x):=tx_1-x^3_2\\le 0\\;\\mbox{ for
}\\;t\\in T\\setminus\\{0\\}.\\end{aligned}$$ It is easy to check that the functions $g_t$, $t\\in T$, satisfy our standing assumptions and that they are strictly uniformly differentiable at the feasible point $\\ox=(-1,0)$. Observe furthermore that $T(\\ox)=\\{0\\}$, that $T_\\ve(\\ox)=[0,\\ve]$ for all $\\ve\\in(0,1)$, and that the EMFCQ holds at $\\ox$. However, for any $d=(d_1,d_2)\\in \\R^2$ we have $$\\begin{aligned}
\\disp\\inf_{\\ve>0}\\sup_{t\\in T_{\\ve(\\ox)}}\\la\\nabla
g_t(\\ox),d\\ra&=&\\inf_{\\ve>0}
\\sup\\Big\\{\\la \\nabla g_0(\\ox),d\\ra,\\sup\\big\\{\\la\\nabla g_t(\\ox),d\\ra\\big|\\;t\\in(0,\\ve]\\big\\}\\Big\\}\\\\
&=&\\inf_{\\ve>0}\\sup\\Big\\{d_1,\\sup\\{td_1\\big|\\;t\\in
(0,\\ve]\\}\\Big\\}\\ge 0,\\end{aligned}$$ which shows that the PMFCQ does not satisfy at $\\ox$. Note that the u.s.c. assumption with respect of $t$ in Propositions \\[p4\\] does not hold in this example.]{}
It is well known in the classical nonlinear programming (when the index set $T$ in is finite), that the MFCQ condition is equivalent to the Slater condition provided that all the functions $g_t$ are convex and differentiable and that $h$ is a linear operator. The next proposition shows that a similar equivalence holds in the semi-infinite and infinite programming frameworks with replacing the MFCQ by our new PMFCQ condition and replacing the Slater by its strong counterpart well recognized in the SIP community; see, e.g., [@GL] and [@CLMP1] for more references and discussions.
\\[ss\\] [**(equivalence between PMFCQ and SSC for differentiable convex systems).**]{} Assume that in all the functions $g_t$, $t\\in T$, are convex and uniformly Fréchet differentiable at $\\ox$ and that $h=A$ is a surjective continuous linear operator. Then the PMFCQ condition is equivalent to the following strong Slater condition $($SSC$)$: there is $\\hat
x\\in X$ such that $A\\hat x=0$ and $$\\begin{aligned}
\\label{3.9}
\\sup_{t\\in T} g_t(\\hat x)<0.\\end{aligned}$$
[**Proof.**]{} Suppose first that the SSC holds at $\\ox$, i.e., there are $\\hat x\\in X$ and $\\delta>0$ such that $A\\hat x=0$ and $g_t(\\hat x)<-2\\delta$ for all $t\\in T$. By the assumptions made this implies that for each $\\ve\\in (0,\\delta)$ and $t\\in
T_\\ve(\\ox)$ we have $$\\la\\nabla g_t(\\ox),\\hat x-\\ox\\ra\\le g_t(\\hat x)-g_t(\\ox)\\le-2\\delta+\\ve\\le-\\delta.$$ Define further $\\tilde x:=\\hat x-\\ox$ and get $A\\tilde x=A\\hat
x-A\\ox=0$ with $\\la\\nabla g_t(\\ox),\\tilde x\\ra\\le-\\delta$ for all $t\\in T_\\ve(\\ox)$ and $\\ve\\in(0,\\delta)$. This clearly implies the PMFCQ condition at $\\ox$.
Conversely, assume that the PMFCQ condition holds at $\\ox$. Then there are $\\ve,\\eta>0$ and $\\Tilde x\\in X$ such that $\\la\\nabla
g_t(\\ox),\\Tilde x\\ra\\le-\\eta$ for all $t\\in T_\\ve(\\ox)$ and that $A\\Tilde x=0$. It follows from the assumed uniform Fréchet differentiability of $g_t$ at $\\ox$ that for each $\\lm>0$ we have $$\\label{t}
g_t(\\ox+\\lm\\Tilde x)\\le g_t(\\ox)+\\lm\\la\\nabla g_t(\\ox),\\Tilde
x\\ra+\\lm\\|\\Tilde x\\|s\\big(\\lm\\|\\Tilde x\\|\\big),$$ which readily implies that $g_t(\\ox+\\lm\\Tilde
x)\\le\\lm\\big(-\\eta+\\|\\Tilde x\\|s(\\lm\\|\\Tilde x\\|)\\big)$ for all $t\\in T_\\ve(\\ox)$. For $t\\notin T_\\ve(\\ox)$ we observe from that $$g_t(\\ox+\\lm\\Tilde x)\\le-\\ve+\\lm\\sup_{\\tau\\in T}\\|\\nabla
g_\\tau(\\ox)\\|\\cdot\\|\\Tilde x\\|+\\lm \\|\\Tilde x\\|s\\big(\\lm\\|\\Tilde x\\|\\big),$$ which gives, combining with the above, that $$\\sup_{t\\in T} g_t(\\ox+\\lm\\Tilde x)\\le\\max\\big\\{\\lm\\big(-\\eta+\\|\\Tilde x\\|s(\\lm\\|\\Tilde x\\|)\\big),-\\ve+\\lm\\|\\Tilde x\\|\\big(\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(\\ox)\\|+s(\\lm\\|\\Tilde x\\|)\\big)\\big\\}.$$ The latter implies the existence of $\\lm_0>0$ sufficiently small such that $\\sup_{t\\in T}g_t(\\Hat x)<0$ with $\\Hat
x:=\\ox+\\lm_0\\Tilde x$. Furthermore, it is easy to see that $A\\Hat
x=A\\ox+\\lm_0 A\\Tilde x=0$. This concludes that the SSC holds at $\\Hat x$ and thus completes the proof of the proposition. $\\h$
Next we introduce another qualification condition of the [*closedness/Farkas-Minkowski type*]{} for infinite inequality constraints in .
\\[cd3\\] [**(Nonlinear Farkas-Minkowski Constraint Qualification).**]{} We say that system [(\\[3.1\\])]{} with $h(x)=0$ satisfies the [Nonlinear Farkas-Minkowski constraint qualification (NFMCQ)]{} at $\\ox$ if the set $$\\begin{aligned}
\\label{fm}
\\cone\\big\\{\\big(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big)\\big|\\;t\\in T\\big\\}\\end{aligned}$$ is weak$^*$ closed in the product space $X^*\\times\\R$.
In the linear case of $g_t(x)=\\la a^*_t,x\\ra-b_t$ for some $(a^*_t,b_t)\\in X^*\\times \\R$, $t\\in T$, the NFMCQ condition above reduces to the classical Farkas-Minkowski qualification condition meaning that the set $\\cone\\{(a^*_t,b_t)|\\; t\\in T\\}$ is weak$^*$ closed in $X^*\\times\\R$. It is well recognized that the latter condition plays an important role in linear semi-infinite and infinite optimization; see, e.g., [@BGW; @CLMP2; @DGL; @DMN1; @DMN2; @GL] for more details and references. Observe that the NFMCQ condition can be represented in the following equivalent form: the set $$\\begin{aligned}
\\cone\\big\\{\\big(\\nabla g_t(\\ox),g_t(\\ox)\\big)\\big|\\;t\\in
T\\big\\}\\;\\mbox{ is weak$^*$ closed in $X^*\\times \\R$}.\\end{aligned}$$
Let us compare the new NFMCQ condition with the other qualification conditions discussed in this section in the case of infinite inequality constraints.
\\[sfm\\] [**(sufficient conditions for NFMCQ).**]{} Consider the constraint inequality system with $h=0$ therein. Then the NFMCQ condition is satisfied at $\\ox\\in\\O$ in each of the following settings:
[**(i)**]{} The index $T$ is finite and the MFCQ condition holds at $\\ox$.
[**(ii)**]{} $\\dim X<\\infty$, the set $\\{(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox))|\\;t\\in T\\}$ is compact, and the PMFCQ condition holds at $\\ox$.
[**(iii)**]{} The index $T$ is a compact metric space, $\\dim
X<\\infty$, the mappings $t\\in T\\mapsto g_t(\\ox)$ and $t\\in
T\\mapsto\\nabla g_t(\\ox)$ are continuous, and the EMFCQ condition holds at $\\ox$.
[**Proof.**]{} Define $\\tilde g_t(x):=\\la \\nabla
g_t(\\ox),x-\\ox\\ra+g_t(\\ox)$ for all $x\\in X$. To justify (i), suppose that $T$ is finite and that the MFCQ condition holds at $\\ox$ for the inequality system in (\\[3.1\\]). It is clear that $\\tilde g_t$ also satisfy the MFCQ at $\\ox$. Since the functions $\\tilde g_t$ are linear, we observe from Proposition \\[ss\\] that there is $\\hat x\\in X$ such that $\\tilde g_t(\\hat x)=\\la \\nabla
g_t(\\ox),\\hat x-\\ox\\ra+g_t(\\ox)< 0$ for all $t\\in T$. Thus it follows from [@DMN1 Proposition 6.1] that the NFMCQ condition holds.
Next we consider case (ii) with $X=\\R^d$ therein. Suppose that the PMFCQ condition holds at $\\ox$ and that the set $\\{(\\nabla
g_t(\\ox),\\la \\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))|\\;t\\in T\\}$ is compact in $\\R^d\\times\\R$. Noting that the functions $\\tilde g_t$ also satisfy the PMFCQ at $\\ox$, we apply Proposition \\[ss\\] to these functions and find $\\hat x\\in X$ such that $\\nabla
h(\\ox)\\hat x=0$ and that $$\\begin{aligned}
\\label{3.11}
\\sup_{t\\in T} \\tilde g_t(\\hat x)=\\sup_{t\\in T} \\la \\nabla g_t(\\ox),
\\hat x-\\ox\\ra+g_t(\\ox)<0.\\end{aligned}$$ Let us check that $(0,0)\\not \\in \\co\\{(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox))|\\; t\\in T\\}$. Indeed, otherwise ensures the existence of $\\lm\\in\\tR$ with $\\sum_{t\\in T}\\lm_t=1$ such that $$\\begin{aligned}
(0,0)=\\sum_{t\\in T}\\lm_t\\big(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big).\\end{aligned}$$ Combining the latter with (\\[3.11\\]) gives us that $$0=\\sum_{t\\in T}\\lm_t\\la\\nabla g_t(\\ox),\\hat x\\ra-\\sum_{t\\in
T}\\lm_t\\big(\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big)=\\sum_{t\\in
T}\\lm_t\\tilde g_t(\\hat x)\\le\\sup_{t\\in T}\\tilde g_t(\\hat x)<0,$$ which is a contradiction. Hence employing [@HL Theorem 1.4.7] in this setting, we have that the conic hull $\\cone\\{(\\nabla
g_t(\\ox),\\la \\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))|\\;t\\in T\\}$ is closed in $\\R^{d+1}$. This fully justifies (ii). Observing finally that (iii) follows from (ii) and Proposition \\[p4\\], we complete the proof of the proposition. $\\h$
To conclude this section, let us show that the NFMCQ and PMFCQ conditions are independent for infinite inequality systems in finite dimensions.
\\[exa2\\] [**(independence of NFMCQ and PMFCQ).**]{}
It is easy to check that for the constraint inequality system from Example \\[exa1\\] the NFMCQ is satisfied at $\\ox=(-1,0)$, since the corresponding conic hull $$\\begin{aligned}
\\cone\\big\\{(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox))\\big|\\;t\\in
T\\big\\}&=&\\cone\\Big((1,0,-1)\\cup
\\{(t,0,0)\\big|t\\in(0,1]\\}\\Big)\\\\
&=&\\big\\{x\\in\\R^3\\big|\\;x_1+x_3\\ge 0,\\;x_1\\ge 0\\ge
x_3,\\;x_2=0\\big\\}\\end{aligned}$$ is closed in $\\R^3$. On the other hand, Example \\[exa1\\] demonstrates that the PMFCQ does not hold for this system at $\\ox$.
To show that the NFMCQ does not generally follow from the PMFCQ (and even from the EMFCQ), consider the countable system of inequality constraints in $\\R^2$ discussed in Example \\[ex1\\]. When $\\ox=(-1,0)$, we get $T_\\ve(\\ox)=\\{n\\in
\\IN\\setminus\\{1\\}|\\;n\\le \\frac{1}{\\ve}\\}\\cup\\{1\\}$ for the the perturbed active index set in . It shows that the PMFCQ (and hence the EMFCQ) hold at $\\ox$. On the other hand, the conic hull $$\\begin{aligned}
\\mbox{cone}\\big\\{(\\nabla g_t(\\ox),\\la\\nabla
g_t(\\ox),\\ox\\ra-g_t(\\ox))\\big|\\;t\\in
T\\big\\}=\\mbox{cone}\\Big[(1,0,-1)\\cup\\Big\\{\\Big(\\frac{1}{n},-1,
\\frac{-2}{3n}\\Big)\\Big|\\;n\\in\\IN\\setminus\\{1\\}\\Big\\}\\Big]\\end{aligned}$$ is not closed in $\\R^3$, i.e., the NFMCQ condition is not satisfies at $\\ox$.
Normal Cones to Feasible Sets of Infinite Constraints
=====================================================
This section is devoted to computing both normal cones to the feasible solution sets for the class of nonconvex semi-infinite/infinite programs under consideration in the paper. These calculus results are certainly of independent interest while they play a crucial role in deriving necessary optimality conditions for in Section 5.
The first main theorem gives precise calculations of both Fréchet and limiting normal cones to the set $\\O$ of feasible solutions in under the new Perturbed Mangasarian-Fromovitz Constraint Qualification of Definition \\[cd2\\]. Preliminary we present a known result from functional analysis whose simple proof is given for the reader’s convenience.
\\[cr\\] [**(weak$^*$ closed images of adjoint operators).**]{} Let $A:X\\to Y$ be a surjective continuous linear operator. Then the image of its adjoint operator $A^*(Y^*)$ is a weak$^*$ closed subspace of $X^*$.
[**Proof.**]{} Define $C:=A^*(Y^*)\\subset X^*$ and pick any $n\\in\\IN$. We claim that the set $A_n:=C\\cap n\\B_{X^*}$ is weak$^*$ closed in $X^*$. Considering a net $\\{x^*_\\nu\\}_{\\nu\\in\\N}\\subset A_n$ weak$^*$ converging to $x^*\\in X^*$ and taking into account that the ball $\\B_{X^*}$ is weak$^*$ compact in $X^*$, we get $x^*\\in n\\B_{X^*}$. By construction there is a net $\\{y^*_\\nu\\}_{\\nu\\in \\N}\\subset Y^*$ satisfying $x^*_\\nu=A^*y^*_\\nu$ whenever $\\nu\\in\\N$. It follows from the surjectivity of $A$ that $$\\|x^*_\\nu\\|=\\|A^*y^*_\\nu\\|\\ge\\kappa\\|y^*_\\nu\\|\\;\\mbox{ for all }\\;\\nu\\in\\N,$$ where $\\kappa:=\\inf\\{\\|A^*y^*\\|\\;\\mbox{over}\\;\\|y^*\\|=1\\}\\in(0,\\infty)$; see, e.g., [@M1 Lemma 1.18]. Hence $\\|y^*_\\nu\\|\\le n\\kappa^{-1}$ for all $\\nu\\in\\N$. By passing to a subnet, suppose that $y^*_\\nu$ weak$^*$ converges to some $y^*\\in Y^*$ for which $x^*=A^*y^*\\in A_n$. Thus we have that the set $A_n=C\\cap n\\B_{X^*}$ is weak$^*$ closed for all $n\\in\\IN$. The classical Banach-Dieudonné-Krein-Šmulian theorem yields therefore that the set $C$ is weak$^*$ closed in $X^*$. $\\h$
Now we are ready to establish the main result of this section.
\\[thm41\\] [**(Fréchet and limiting normals to infinite constraint systems).**]{} Let $\\ox\\in\\O$ for the set of feasible solutions to the infinite system satisfying the PMFCQ at $\\ox$. Assume in addition that the inequality constraint functions $g_t$, $t\\in T$, are uniformly Fréchet differentiable at $\\ox$. Then the Fréchet normal cone to $\\O$ at $\\ox$ is computed by $$\\begin{aligned}
\\label{4.1}
\\Hat N(\\ox;\\O)=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla
g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*).\\end{aligned}$$ If furthermore the functions $g_t$, $t\\in T$, are uniformly strictly differentiable at $\\ox$, then the limiting normal cone to $\\O$ at $\\ox$ is also computed by $$\\begin{aligned}
\\label{4.2}
N(\\ox;\\O)=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla
g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*),\\end{aligned}$$ and thus the set $\\O$ of feasible solutions is normally regular at $\\ox$.
[**Proof.**]{} First we justify under the assumptions made. It follows from the PMFCQ and the uniform Fréchet differentiability of $g_t$ at $\\ox$ that there are $\\tilde\\ve>0$, $\\delta>0$, and $\\tilde x\\in X$ such that $\\nabla h(\\ox)\\tilde
x=0$ and $$\\begin{aligned}
\\label{4.3}
\\disp\\sup_{t\\in T_\\ve(\\ox)}\\la \\nabla g_t(\\ox),\\tilde
x\\ra<-\\delta\\quad {\\rm for\\ all}\\ \\ve\\leq \\tilde\\ve.\\end{aligned}$$ Let us prove the inclusion “$\\supset$” in (\\[4.1\\]). To proceed, fix any $\\ve\\in(0,\\tilde \\ve)$ and pick an arbitrary element $x^*$ belonging to the right-hand side of (\\[4.1\\]). Then there exist a net $(\\lm_\\nu)_{\\nu\\in \\N}\\subset\\tR$ and a dual element $y^*\\in Y^*$ satisfying $$\\begin{aligned}
\\label{4.4}
x^*=w^*-\\lim_\\nu\\sum_{t\\in T_\\ve(\\ox)} \\lm_{t\\nu}\\nabla g_t(\\ox)+\\nabla h(\\ox)^*y^*.\\end{aligned}$$ Combining the latter with (\\[4.3\\]) gives us $$\\begin{aligned}
\\begin{array}{ll}\\label{4.5}
\\la x^*,\\tilde x\\ra&=\\disp\\lim_\\nu\\sum_{t\\in
T_\\ve(\\ox)}\\lm_{t\\nu}\\la \\nabla g_t(\\ox),
\\tilde x\\ra+\\la\\nabla h(\\ox)^*y^*,\\tilde x\\ra\\\\
&\\disp\\le\\liminf_\\nu\\sum_{t\\in T_\\ve(\\ox)} \\lm_{t\\nu}(-\\delta)+\\la
y^*,\\nabla h(\\ox)\\tilde x\\ra= -\\delta\\limsup_\\nu\\sum_{t\\in
T_\\ve(\\ox)}\\lm_{t\\nu}.
\\end{array}\\end{aligned}$$ It follows further that for each $\\eta>0$ and $x\\in\\O\\cap
\\B_\\eta(\\ox)$ we have $$\\begin{aligned}
\\la x^*,x-\\ox\\ra&=& \\lim_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\la
\\nabla g_t(\\ox),x-\\ox\\ra+\\la\\nabla h(\\ox)^*y^*,x-\\ox\\ra\\\\
&\\le&\\limsup_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\Big(
g_t(x)-g_t(\\ox)+\\|x-\\ox\\|s(\\eta)\\Big)+
\\la y^*,\\nabla h(\\ox)(x-\\ox)\\ra\\\\
&\\le&\\limsup_\\nu\\sum_{t\\in T_\\ve(\\ox)}
\\lm_{t\\nu}\\Big(\\ve+\\|x-\\ox\\|s(\\eta)\\Big)+ \\|y^*\\|\\Big
(\\|h(x)-h(\\ox)\\|+o(\\|x-\\ox\\|)\\Big)\\\\
&\\le&\\Big(\\ve+\\|x-\\ox\\|s(\\eta)\\Big)\\limsup_\\nu\\sum_{t\\in
T_\\ve(\\ox)}\\lm_{t\\nu}+\\|y^*\\|o(\\|x-\\ox\\|).\\end{aligned}$$ Taking now the estimate (\\[4.5\\]) into account implies that $$\\begin{aligned}
\\la x^*,x-\\ox\\ra\\le-\\frac{\\la x^*,\\tilde
x\\ra}{\\delta}\\Big(\\ve+\\|x-\\ox\\|s(\\eta)\\Big)+o(\\|x-\\ox\\|)\\|y^*\\|,\\end{aligned}$$ which yields in turn by $\\ve\\dn 0$ that $$\\begin{aligned}
\\la x^*,x-\\ox\\ra\\le-\\frac{\\la x^*,\\tilde
x\\ra}{\\delta}\\|x-\\ox\\|s(\\eta)+o(\\|x-\\ox\\|)\\|y^*\\|.\\end{aligned}$$ Since $s(\\eta)\\dn 0$ as $\\eta\\dn 0$, it follows from the latter inequality that $$\\begin{aligned}
\\disp\\limsup_{x\\st{\\O}\\to\\ox}\\frac{\\la x^*,
x-\\ox\\ra}{\\|x-\\ox\\|}\\le 0,\\end{aligned}$$ which means that $x^*\\in\\Hat N(\\ox;\\O)$ and thus justifies the inclusion “$\\supset$” in (\\[4.1\\]).
Next we prove the inclusion “$\\subset$” in (\\[4.2\\]) under the assumption that $g_t$ are uniformly strictly differentiable at $\\ox$. This immediately implies the inclusion “$\\subset$” in (\\[4.1\\]) under the latter assumption, while we note that similar arguments justify the inclusion “$\\subset$” in (\\[4.1\\]) under merely the uniform Fréchet differentiability of $g_t$ at $\\ox$.
To proceed with proving the inclusion “$\\subset$” in (\\[4.2\\]), define the set $$\\label{A}
A_\\ve:=\\cl{\\rm cone}\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in
T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*)\\;\\mbox{ for }\\;\\ve>0.$$ Arguing by contradiction, pick an arbitrary element $x^*\\in N(\\ox;\\O)\\setminus\\{0\\}$ and suppose that $
x^*\\notin A_\\ve$ for some $\\ve\\in(0,\\tilde\\ve)$. We first claim that the set $A_\\ve$ is weak$^*$ closed in $X^*$ for all $\\ve\\leq \\tilde\\ve$. To justify, take an arbitrary net $(u_\\nu^*)_{\\nu\\in \\N}\\subset A_\\ve$ weak$^*$ converging to some $u^*\\in X^*$. Hence there are nets $(\\lm_\\nu)_{\\nu\\in \\N}\\subset \\tR$, $(y^*_\\nu)_{\\nu\\in \\N} \\subset Y^*$ such that $$u^*_\\nu=\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\nabla g_t(\\ox)+\\nabla h(\\ox)^*y^*_\\nu\\quad \\st{w^*}\\to u^*.$$ Similarly to the proof of (\\[4.5\\]) we derive the inequality $$\\begin{aligned}
\\la u^*,\\tilde x\\ra\\leq-\\delta\\limsup_\\nu\\sum_{t\\in T_\\ve(\\ox)} \\lm_{t\\nu}.\\end{aligned}$$ Moreover, we have $$\\|u^*_\\nu-\\nabla h(\\ox)^*y^*_\\nu\\|=\\|\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\nabla g_t(\\ox)\\|\\leq \\sup_{\\tau\\in T_\\ve(\\ox)}\\|\\nabla g_\\tau(\\ox)\\|\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}.$$ It follows from two inequalities above that the net $\\{u^*_\\nu-\\nabla h(\\ox)^*y^*_\\nu\\}_{\\nu\\in \\N}$ is bounded in $X^*$. By the classical Alaoglu-Bourbaki theorem, there is a subnet of $\\{u^*_\\nu-\\nabla h(\\ox)^*y^*_\\nu\\}$ (without relabeling) weak$^*$ converging to some $v^*\\in \\cl{\\rm cone}\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in
T_\\ve(\\ox)\\big\\}$. Thus the net $\\{\\nabla h(\\ox)^*y^*_\\nu\\}$ weak$^*$ converges to $u^*-v^*$. Due to Lemma \\[cr\\], there is $y^*\\in Y^*$ such that $u^*-v^*=\\nabla h(\\ox)^*y^*$. This implies that $u^*=v^*+\\nabla h(\\ox)^*y^*\\in A_\\ve$ and ensures that $A_\\ve$ is weak$^*$ closed in $X^*$. Since $x^*\\notin A_\\ve$, we conclude from the classical separation theorem that there are $x_0\\in X$ and $c>0$ satisfying $$\\begin{aligned}
\\label{4.6}
\\la x^*,x_0\\ra\\ge 2c>0\\ge\\la\\nabla g_t(\\ox),x_0\\ra+\\la\\nabla h(\\ox)^*y^*,x_0\\ra=\\la\\nabla g_t(\\ox),x_0\\ra+\\la y^*,\\nabla h(\\ox)x_0\\ra\\end{aligned}$$ for all $t\\in T_\\ve(\\ox)$ and $y^*\\in Y^*$; hence $\\nabla h(\\ox)x_0=0$. Define further $$\\disp\\hat x:=x_0+\\frac{c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}
\\tilde x$$ and observe that $\\nabla h(\\ox)\\hat x=0$. Moreover, it follows from (\\[4.6\\]) and the PMFCQ that $$\\begin{aligned}
\\label{4.7}
\\la x^*,\\hat x\\ra=\\disp\\la x^*,x_0+\\frac{c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}\\tilde x\\ra\\ge 2c+\\frac{c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}\\la x^*,
\\tilde x\\ra\\ge 2c-c=c\\;\\mbox{ and}\\end{aligned}$$ $$\\begin{aligned}
\\label{4.8}
\\la\\nabla g_t(\\ox),\\hat x\\ra=\\disp\\la\\nabla g_t(\\ox),x_0\\ra+\\frac{c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}\\la\\nabla g_t(\\ox),
\\tilde x\\ra\\le-\\disp\\frac{\\delta c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}=-\\tilde \\delta\\end{aligned}$$ for all $t\\in T_\\ve(\\ox)$ with $\\tilde\\delta:=\\disp\\frac{\\delta c}{\\|x^*\\|\\cdot\\|\\tilde x\\|}>0$. Observing that $\\hat x\\ne 0$ by (\\[4.8\\]), suppose without loss of generality that $\\|\\hat x\\|=1$. Furthermore, we get from definition of the limiting normal cone that there are sequences $\\ve_n\\dn 0$, $\\eta_n\\dn 0$, $x_n\\st{\\O}\\to \\ox$, and $x^*_n\\st{w^*}\\to x^*$ as $n\\to\\infty$ with $$\\begin{aligned}
\\label{4.9}
\\la x^*_n,x-x_n\\ra\\le\\ve_n\\|x-x_n\\|\\;\\mbox{ for all }\\;x\\in\\B_{\\eta_n}(x_n)\\cap\\O,\\quad n\\in\\IN.\\end{aligned}$$ Since the mapping $h$ is strictly differentiable at $\\ox$ with the surjective derivative $\\nabla h(\\ox)$, it follows from the Lyusternik-Graves theorem (see, e.g., [@M1 Theorem 1.57]) that $h$ is [*metrically regular*]{} around $\\ox$, i.e., there are neighborhoods $U$ of $\\ox$ and $V$ of $0=h(\\ox)$ and a constant $\\mu>0$ such that $$\\label{mr}
{\\rm dist}\\big(x; h^{-1}(y)\\big)\\le\\mu\\|y-h(x)\\|\\;\\mbox{ for any }\\;x\\in U\\;\\mbox{ and }\\;y\\in V.$$ Since $h(x_n)=0$ and $\\nabla h(\\ox)\\hat x=0$, we have $$\\begin{aligned}
\\|h(x_n+t\\hat x)\\|=\\|h(x_n+t\\hat x)-h(x_n)-\\nabla h(\\ox)(t\\hat x)\\|=o(t)\\;\\mbox{ for each small }\\ t>0.\\end{aligned}$$ Thus the metric regularity (\\[mr\\]) implies that for any small $t>0$ there is $ x_t\\in h^{-1}(0)$ with $\\|x_n+t\\hat x-x_t\\|=o(t)$ when $x_n\\in U$. This allows us to find $\\tilde\\eta_n<\\eta_n$ and $\\tilde x_n:=x_{\\tilde\\eta_n}\\in h^{-1}(0)$ satisfying $\\tilde\\eta_n+o(\\tilde \\eta_n)\\le\\eta_n$ and $\\|x_n+\\tilde\\eta_n\\hat x-\\tilde x_n\\|=o(\\tilde\\eta_n)$. Note that $$\\|x_n-\\tilde x_n\\|\\le\\tilde\\eta_n\\|\\hat x\\|+\\|x_n+\\tilde\\eta_n\\hat x-\\tilde x_n\\|=\\tilde\\eta_n+o(\\tilde\\eta_n)\\le\\eta_n,$$ i.e., $\\tilde x_n\\in\\B_{\\eta_n}(x_n)$. Observe further that $$\\|x_n-\\tilde x_n\\|\\ge\\tilde\\eta_n\\|\\hat x\\|-\\|x_n+\\tilde\\eta_n\\hat x-\\tilde x_n\\|=\\tilde\\eta_n-o(\\tilde\\eta_n).$$ By the classical uniform boundedness principle there is a constant $M$ such that $M>\\|x^*_n\\|$ for all $n\\in\\IN$ due to $x_n^*\\st{w^*}\\to x^*$ as $n\\to\\infty$. It follows from (\\[4.7\\]) that $\\la x^*_n,\\hat x\\ra>0$ for $n\\in\\IN$ sufficiently large. Then we have $$\\begin{aligned}
\\disp\\frac{\\la x^*_n,\\tilde x_n-x_n\\ra}{\\|\\tilde x_n-x_n\\|}&=&\\disp\\frac{\\la x^*_n,\\tilde x_n-\\tilde\\eta_n\\hat x-x_n\\ra}{\\|\\tilde x_n-x_n\\|}
+\\frac{\\la x^*_n,\\tilde\\eta_n \\hat x\\ra}{\\|\\tilde x_n-x_n\\|}\\\\
&\\ge&\\disp-M\\frac{\\|\\tilde x_n-\\tilde\\eta_n\\hat x-x_n\\|}{\\|\\tilde x_n-x_n\\|}+\\tilde\\eta_n\\frac{\\la x^*_n,\\hat x\\ra}{\\|\\tilde x_n-x_n\\|}\\\\
&\\ge&\\disp-M\\frac{o(\\tilde\\eta_n)}{\\tilde\\eta_n-o(\\tilde\\eta_n)}+\\frac{\\tilde\\eta_n}{\\tilde\\eta_n+o(\\tilde\\eta_n)}\\la x_n^*,\\hat x\\ra.\\end{aligned}$$ Since $o(\\tilde\\eta_n)/\\tilde\\eta_n\\to 0$ when $n\\to\\infty$, the latter inequalities yield that $$\\begin{aligned}
\\liminf_{n\\to\\infty}\\disp\\frac{\\la x^*_n,\\tilde x_n-x_n\\ra}{\\|\\tilde x_n-x_n\\|}\\ge\\la x^*,\\hat x\\ra.\\end{aligned}$$ Combining this with (\\[4.7\\]) and (\\[4.9\\]) gives us that $\\tilde x_n\\notin\\O$ for all large $n\\in\\IN$.
Now define $u_n:=x_n+\\tilde\\eta_n\\hat x-\\tilde x_n$ and get $\\|u_n\\|=o(\\tilde\\eta_n)$ and $\\|\\tilde x_n+u_n-x_n\\|=\\tilde\\eta_n$ by the arguments above. It follows from our standing assumptions (SA), condition (\\[3.4\\]), and inequality (\\[4.8\\]) that for each $t\\in T_\\ve(\\ox)$ we have $$\\begin{aligned}
-\\disp\\tilde \\delta&\\geq&\\disp\\frac{\\la\\nabla g_t(\\ox),\\tilde\\eta_n\\hat x\\ra}{\\tilde\\eta_n}=\\disp\\frac{\\la\\nabla g_t(\\ox),\\tilde x_n+u_n-x_n\\ra}{\\|\\tilde x_n+u_n-x_n\\|}=\\disp\\frac{\\la \\nabla g_t(\\ox),\\tilde x_n-x_n\\ra}{\\|\\tilde x_n+u_n-x_n\\|}
+\\disp\\frac{\\la\\nabla g_t(\\ox),u_n\\ra}{\\|\\tilde x_n+u_n-x_n\\|}\\\\
&\\ge&\\disp\\frac{\\la\\nabla g_t(\\ox),\\tilde x_n-x_n\\ra}{\\|\\tilde x_n-x_n\\|}\\frac{\\|\\tilde x_n-x_n\\|}{\\|\\tilde x_n+u_n-x_n\\|}+\\disp
\\frac{\\la\\nabla g_t(\\ox),u_n\\ra}{\\|\\tilde x_n+u_n-x_n\\|}\\\\
&\\ge&\\disp\\Big(\\frac{g_t(\\tilde x_n)-g_t(x_n)}{\\|\\tilde x_n-x_n\\|}-r(\\hat\\eta_n)\\Big)\\frac{\\|\\tilde x_n-x_n\\|}{\\|\\tilde x_n+u_n-x_n\\|}
-\\sup_{\\tau\\in T_\\ve(\\ox)}\\|\\nabla g_\\tau(\\ox)\\|\\frac{o(\\tilde\\eta_n)}{\\tilde\\eta_n}\\\\
&\\geq& \\disp \\Big(\\frac{g_t(\\tilde x_n)}{\\|\\tilde x_n-x_n\\|}-r(\\hat \\eta_n)\\Big)\\frac{\\|\\tilde x_n-x_n\\|}{\\|\\tilde x_n+u_n-x_n\\|}- \\sup_{\\tau\\in T}\\|\\nabla g_\\tau(\\ox)\\|\\frac{o(\\tilde\\eta_n)}{\\tilde\\eta_n},\\end{aligned}$$ where $\\hat\\eta_n:=\\max\\{\\|x_n-\\ox\\|$ and $\\|\\tilde x_n-\\ox\\|\\}\\to 0$ as $n\\to\\infty$. Note that $$\\begin{aligned}
\\frac{\\tilde\\eta_n-o(\\tilde\\eta_n)}{\\tilde\\eta_n}\\le\\frac{\\|\\tilde x_n-x_n\\|}{\\|\\tilde x_n+u_n-x_n\\|}\\le\\frac{\\tilde\\eta_n+o(\\tilde \\eta_n)}{\\tilde\\eta_n},\\end{aligned}$$ which implies that $\\disp\\frac{\\|\\tilde x_n-x_n\\|}{\\|\\tilde x_n+u_n-x_n\\|}\\to 1$ as $n\\to\\infty$. Furthermore, since $r(\\hat\\eta_n)\\to 0$ and $\\disp \\frac{o(\\tilde \\eta_n)}{\\tilde\\eta_n}\\to 0$ as $n\\to \\infty$, we have ${g_t(\\tilde x_n)}\\le-\\disp\\frac{\\tilde\\delta}{2}\\|\\tilde x_n-x_n\\|\\le 0$ for each $t\\in T_\\ve(\\ox)$ when $n\\in\\IN$ is sufficiently large. Indeed, assuming otherwise that $t\\notin T_\\ve(\\ox)$ gives us $$\\begin{aligned}
g_t(\\tilde x_n)&\\le&g_t(\\ox)+\\la\\nabla g_t(\\ox),x_n-\\ox\\ra+\\|x_n-\\ox\\|r(\\hat\\eta_n)\\\\
&\\le&-\\ve+\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(\\ox)\\|\\hat\\eta_n+\\hat\\eta_n r(\\hat\\eta_n)\\le 0\\;\\mbox{ for all large }\\;n\\in\\IN.\\end{aligned}$$ Thus $g_t(\\tilde x_n)\\le 0$ for all $t\\in T$ and also $h(\\tilde x_n)=0$ when $n\\in\\IN$ is sufficiently large, i.e., $\\tilde x_n\\in\\O$, a contradiction. Hence we conclude that $N(\\ox;\\O)\\subset A_\\ve$ for all $\\ve\\in(0,\\tilde\\ve)$, which implies the inclusion “$\\subset$” in (\\[4.2\\]) and completes the proof of the theorem. $\\h$
Let us show now that the PMFCQ condition is essential for the validity of both normal cone representations in and ; moreover, this condition cannot be replaced by its weaker EMFCQ version.
\\[exa3\\] [**(violation of the normal cone representations with no PMFCQ).**]{} [Consider the infinite inequality system in $\\R^2$ given in Example \\[exa1\\]. It is shown therein that the EMFCQ holds at $\\ox=(-1,0)$ while the PMFCQ does not. It is easy to check that in this case $\\Hat N(\\ox;\\O)=N(\\ox;\\O)=\\R_+\\times\\R_-$ while $${\\rm cl}\\;{\\rm cone}\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}={\\rm cl}\\;{\\rm cone}\\big\\{(1,0)\\cup\\{(t,0)|\\;t\\in(0,\\ve)\\big\\}\\subset\\R_+\\times\\{0\\}.$$ i.e., the inclusions “$\\subset$" in and are violated.]{}
The next example shows that the perturbed active index set $T_\\ve(\\ox)$ cannot be replaced by its unperturbed counterpart $T(\\ox)$ in the normal cone representations and .
\\[ex3\\] [**(perturbation of the active index set is essential for the normal cone representations).**]{} [Let us reconsider the nonlinear infinite system in problem (\\[3.7\\]): $$\\begin{aligned}
\\left\\{\\begin{array}{ll}
g_1(x)=x_1+1\\le 0,\\\\
g_n(x)=\\disp\\frac{1}{3n}x^3_1-x_2\\le 0,\\;\\;n\\in \\IN\\setminus\\{1\\},
\\end{array}\\right.\\end{aligned}$$ where $x=(x_1,x_2)\\in\\R^2$ and $T:=\\IN$. It is easy to check this inequality system satisfies our standing assumptions and that the functions $g_t$ are uniformly strictly differentiable at $\\ox=(-1,0)$. Observe further that $\\O=\\{(x_1,x_2)\\in \\R^2|\\;x_1\\le-1,
\\;x_2\\ge 0\\}$ and hence $N(\\ox;\\O)=\\R_+\\times\\R_-$. As shown above, both PMFCQ and EMFCQ conditions hold at $\\ox$. However, we have $T(\\ox)=\\{1\\}$ and $$N(\\ox;\\O)\\not=\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}=\\cone\\big\\{\\nabla g_1(\\ox)\\big\\}=\\cone\\{(1,0)\\}=\\R_+\\times \\{0\\},$$ which shows the violation of the unperturbed counterparts of and . Observe that $$\\begin{aligned}
\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}&=&\\cone\\Big\\{(1,0)\\cup\\big\\{\\big(\\frac{1}{n},-1\\big)\\big|\\; n\\in\\IN\\setminus\\{1\\},\\;n
\\ge\\frac{1}{\\ve}\\Big\\}\\\\
&=&\\big\\{(x_1,x_2)\\in\\R^2\\big|\\;x_1\\ge 0,\\;x_2<0\\big\\},\\end{aligned}$$ which is not a closed subset. On the other hand, we have $$N(\\ox;\\O)=\\bigcap_{\\ve>0}{\\rm cl}\\;\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\},$$ which illustrates the validity of the normal cone representations in Theorem \\[thm41\\].]{}
Now we derive several consequences of Theorem \\[thm41\\], which are of their independent interest. The first one concerns the case when the $\\{\\nabla g_t(\\ox)|\\;t\\in T\\}$ may not be bounded in $X^*$ as in our standing assumptions. It follows that the latter case can be reduced to the basic case of Theorem \\[thm41\\] with some modifications.
\\[mc\\] [**(normal cone representation for infinite systems with unbounded gradients).**]{} Considering the constraint system , assume the following:
[**(a)**]{} The functions
$g_t$, $t\\in T$, are Fréchet differentiable at the point $\\ox$ with $\\|\\nabla g_t(\\ox)\\|>0$ for all $t\\in T$ and the mapping $h$ is strictly differentiable at $\\ox$.
[**(b)**]{} We have that $\\disp\\lim_{\\eta\\dn0}\\tilde r(\\eta)=0$, where $\\tilde r(\\eta)$ is defined by $$\\begin{aligned}
\\label{r1}
\\tilde r(\\eta):=\\sup_{t\\in T}\\sup_\\substack{x,x^\\prime\\in\\B_{\\eta}(\\ox)}{x\\ne x'}\\frac{|g_t(x)-g_t(x^\\prime)-\\la\\nabla g_t(\\ox),x-x'\\ra|}{\\|\\nabla g_t(\\ox)\\|\\cdot\\|x-x'\\|}\\;\\mbox{ for all }\\;\\eta>0.\\end{aligned}$$
[**(c)**]{} The operator $\\nabla h(\\ox)\\colon X\\to Y$ is surjective and for some $\\ve>0$ there are $\\tilde x\\in X$ and $\\sigma>0$ such that $\\nabla h(\\ox)\\tilde x=0$ and that $$\\begin{aligned}
\\label{4.11}
\\la\\nabla g_t(\\ox),\\tilde x+x\\ra\\le 0\\;\\mbox{ whenever }\\;\\|x\\|\\le\\sigma\\end{aligned}$$ for each $t\\in\\Tilde T_\\ve(\\ox):=\\{t\\in T|\\ g_t(\\ox)\\ge-\\ve\\|\\nabla g_t(\\ox)\\|\\}$. Then the limiting normal cone to $\\O$ at $\\ox$ is computed by formula .
[**Proof.**]{} Define $\\tilde g_t(x):=g_t(x)\\|\\nabla g_t(\\ox)\\|^{-1}$ for all $x\\in X$ and $t\\in T$ and observe that the feasible set $\\O$ from admits the representation $$\\O=\\big\\{x\\in X\\big|\\;\\tilde g_t(x)\\le 0,\\;h(x)=0\\big\\}.$$ Replacing $g_t$ by $\\tilde g_t$ in Theorem \\[thm41\\], we have that the functions $\\{\\tilde g_t\\}$ and $h$ satisfy the standing assumptions (SA) as well as condition (\\[3.4\\]) with the function instead of $r(\\eta)$. Furthermore, it follows from (\\[4.11\\]) that for some $\\ve>0$ there are $\\tilde x\\in X$ and $\\sigma>0$ satisfying $\\nabla h(\\ox)\\tilde x=0$ and such that $$\\begin{aligned}
\\la\\nabla\\tilde g_t(\\ox),\\tilde x\\ra\\le-\\sup_{x\\in\\B_\\sigma(\\ox)}\\la\\nabla\\tilde g_t(\\ox),x\\ra=-\\sigma\\|\\nabla\\tilde g_t(\\ox)\\|\\;\\mbox{ whenever }\\; t\\in \\Tilde T_\\ve(\\ox),\\end{aligned}$$ which turns into $\\la\\nabla\\tilde g_t(\\ox),\\tilde x\\ra\\le-\\sigma$ for all $t\\in\\Tilde T_\\ve(\\ox)=\\{t\\in T|\\;\\tilde g_t(\\ox)\\ge-\\ve\\}$. Hence the PMFCQ condition holds for the functions $\\tilde g_t$ and $h$ at $\\ox$. It follows from Theorem \\[thm41\\] that $$\\begin{aligned}
\\begin{array}{ll}
N(\\ox;\\O)&=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla \\tilde g_t(\\ox)\\big|\\; t\\in\\Tilde T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*)\\\\
&=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\,\\|\\nabla g_t(\\ox)\\|^{-1}\\big|\\;t\\in \\Tilde T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*)\\\\
&=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in\\Tilde T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*),
\\end{array}\\end{aligned}$$ which gives and completes the proof of the corollary. $\\h$
Now we compare the result of Corollary \\[mc\\] with the recent one obtained in [@S Theorem 3.1 and Corollary 4.1] for inequality constraint systems, i.e., with $h=0$ in . The latter result is given by the inclusion form $$\\begin{aligned}
N(\\ox;\\O)\\subset\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}\\end{aligned}$$ in the case of $\\|\\nabla g_t(\\ox)\\|=1$ for all $t\\in T$ under the Fréchet differentiability of $g_t$ [*around*]{} $\\ox$ (in (as) we need it merely [*at*]{} $\\ox$) and the replacement of (b) of Corollary \\[mc\\] by the following [*equicontinuity*]{} requirement on $g_t$ at $\\ox$: for each $\\gamma>0$ there is $\\eta>0$ such that $$\\begin{aligned}
\\label{4.12}
\\|\\nabla g_t(x)-\\nabla g_t(\\ox)\\|\\le\\gamma\\;\\mbox{ for all }\\;x\\in\\B_\\eta(\\ox),\\;t\\in T.\\end{aligned}$$ Let us check that the latter assumption together with the Fréchet differentiability of $g_t$ around $\\ox$ imply (b) in Corollary \\[mc\\]. Indeed, suppose that (\\[4.12\\]) holds and then pick any $x,x^\\prime\\in\\B_\\eta(\\ox)$. Employing the classical Mean Value Theorem, find $\\hat x\\in [x,x^\\prime]\\subset\\B_\\eta(\\ox)$ such that $g_t(x)-g_t(x^\\prime)=\\la\\nabla g_t(\\hat x),x-x^\\prime\\ra$. This gives $$\\begin{aligned}
\\disp\\frac{|g_t(x)-g_t(x')-\\la\\nabla g_t(\\ox),x-x'\\ra|}{\\|\\nabla g_t(\\ox)\\|\\cdot\\|x-x'\\|}&=&\\disp\\frac{|\\la\\nabla g_t(\\hat x),x-x^\\prime\\ra-\\la\\nabla g_t(\\ox),x-x'\\ra|}{\\|x-x'\\|}\\\\
&\\le&\\disp\\frac{|\\la\\nabla g_t(\\hat x)-\\nabla g_t(\\ox),x-x^\\prime\\ra|}{\\|x-x'\\|}\\\\
&\\le&\\disp \\|\\nabla g_t(\\hat x)-\\nabla g_t(\\ox)\\|\\le\\gamma\\end{aligned}$$ and yields $\\disp\\lim_{\\eta\\dn 0}\\tilde r(\\eta)\\le\\gamma$ for all $\\gamma>0$, which ensures the validity of (b) in Corollary \\[mc\\].
The next consequence of Theorem \\[thm41\\] concerns problems of semi-infinite programming and presents sufficient conditions for the fulfillment of simplified representations of the normal cones to feasible constraints with no closure operations in and and with the replacement of the perturbed index set $T_\\ve(\\ox)$ by that of active constraints $T(\\ox)$.
\\[si\\] [**(normal cones for semi-infinite constraints).**]{} Let $X$ and $Y$ be finite-dimensional spaces with $\\dim Y<\\dim X$. Assume that $T$ is a compact metric space, that the function $t\\in T\\mapsto g_t(\\ox)$ is u.s.c., and the mapping $t\\in T\\mapsto\\nabla g_t(\\ox)$ is continuous. Suppose further that system [(\\[3.1\\])]{} satisfies the PMFCQ at $\\ox$. Then we have $$\\begin{aligned}
\\label{4.13}
\\Tilde N(\\ox;\\O)=\\disp\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*),\\end{aligned}$$ where $\\Tilde N(\\ox;\\O)=\\Hat N(\\ox;\\O)$ when the functions $g_t$ are uniformly Fréchet differentiable at $\\ox$ and $\\Tilde N(\\ox;\\O)= N(\\ox;\\O)$ when $g_t$ are uniformly strictly differentiable at $\\ox$.\\
In particular, if we assume in addition that both $t\\in T\\mapsto g_t(\\ox)$ and $(x,t)\\in X\\times T\\mapsto\\nabla g_t(x)$ are continuous, then we also have [(\\[4.13\\])]{} for $\\Tilde N(\\ox;\\O)= N(\\ox;\\O)$ provided that merely the EMFCQ condition holds at $\\ox$.
[**Proof.**]{} Let $X=\\R^d$ for some $d\\in\\IN$. It follows from Proposition \\[p3\\] that $g_t$, $t\\in T$, and $h$ satisfy our standing assumptions $(SA)$. Since system (\\[3.1\\]) satisfies the PMFCQ at $\\ox$, there are $\\tilde\\ve>0$, $\\delta>0$, and $\\tilde x\\in X$ such that $\\la\\nabla g_t(\\ox),\\tilde x\\ra<-\\delta$ for all $t\\in T_\\ve(\\ox)$ and $\\ve\\in (0,\\tilde \\ve)$. Observe that the perturbed active index set $T_\\ve(\\ox)$ is compact in $T$ for all $\\ve>0$ due to the u.s.c. assumption on $t\\in T\\mapsto g_t(\\ox)$. It follows from the continuity of $t\\in T\\mapsto\\nabla g_t (\\ox)$ that $\\{\\nabla g_t(\\ox)|\\; t\\in T_\\ve(\\ox)\\}$ is a compact subset of $\\R^d$.
We now claim that $0\\notin\\co\\{\\nabla g_t(\\ox)|\\;t\\in T_\\ve(\\ox)\\}$. Indeed, it follows for any $\\lm\\in\\Tilde \\R_+^{T_\\ve(\\ox)}$ with $\\sum_{t\\in T_\\ve(\\ox)}\\lm_t=1$ that $$\\begin{aligned}
\\sum_{t\\in T_\\ve(\\ox)}\\lm_t\\la\\nabla g_t(\\ox),\\tilde x\\ra\\le-\\sum_{t\\in T_\\ve(\\ox)}\\lm_t\\delta=-\\delta<0,\\end{aligned}$$ which yields that $0\\ne\\sum_{t\\in T_\\ve(\\ox)}\\lm_t\\nabla g_t(\\ox)$, i.e., $0\\notin\\co\\{\\nabla g_t(\\ox)|\\;t\\in T_\\ve(\\ox)\\}$.
Hence it follows from [@HL Proposition 1.4.7] that the conic hull cone$\\{\\nabla g_t(\\ox)|\\;t\\in T_\\ve(\\ox)\\}$ is closed in $\\R^d$. Combining this with Theorem \\[thm41\\], it suffices to show that $$\\begin{aligned}
\\label{4.14}
\\bigcap_{\\ve>0}\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}=\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}.\\end{aligned}$$ Observe that the inclusion “$\\supset$” in (\\[4.14\\]) is obvious due to $T(\\ox)\\subset T_\\ve(\\ox)$ as $\\ve>0$. To justify the converse inclusion, pick an arbitrary element $x^*$ from the set on the left-hand side of (\\[4.14\\]). By the classical Carathéodory theorem, for all large $n\\in\\IN$ we find $\\lm_n\\in \\R^{d+1}_+$ and $$\\nabla g_{t_{n_1}}(\\ox),\\ldots,\\nabla g_{t_{n_{d+1}}}(\\ox)\\in\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_{\\frac{1}{n}}(\\ox)\\big\\}\\subset\\R^d$$ satisfying the relationship $$\\begin{aligned}
\\label{4.15}
x^*=\\sum_{k=1}^{d+1}\\lm_{n_k}\\nabla g_{t_{n_k}}(\\ox),\\end{aligned}$$ which implies in turn that $$\\begin{aligned}
\\la x^*,\\tilde x\\ra=\\sum_{k=1}^{d+1}\\lm_{n_k}\\la\\nabla g_{t_{n_k}}(\\ox),\\tilde x\\ra\\le-\\sum_{k=1}^{d+1}\\lm_{n_k}\\delta.\\end{aligned}$$ Hence the sequence $\\{\\lm_n\\}$ is bounded in $\\R^{d+1}$, and so is $$\\big\\{\\lm_n\\times(\\nabla g_{t_{n_1}}(\\ox),\\ldots,\\nabla g_{t_{n_{d+1}}})\\big\\}\\subset\\R^{d+1}\\times\\R^{d(d+1)}.$$ By the classical Bolzano-Weierstrass theorem and the compactness of $T$, we assume without loss of generality that the sequence $\\{t_{n_k}\\}$ converges to some $\\bar t_k\\in T$ for each $1\\le k\\le d+1$ and that $\\{\\lm_n\\}$ converges to some $\\bar\\lm\\in \\R^{d+1}$ as $n\\to \\infty$. Note that $0\\ge g_{t_{n_k}}(\\ox)\\geq -\\frac{1}{n}$ for all $n\\in\\IN$ sufficiently large, which gives us $$0\\ge g_{\\bar t_k}(\\ox)\\ge\\disp \\limsup_{n\\to\\infty}g_{t_{n_k}}(\\ox)\\ge\\limsup_{n\\to\\infty}-\\frac{1}{n}=0$$ for all $1\\le k\\le d+1$. Combining the latter with (\\[4.15\\]) ensures that $$\\begin{aligned}
x^*=\\sum_{k=1}^{d+1}\\bar\\lm_{k}\\nabla g_{\\bar t_k}(\\ox)\\in\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\},\\end{aligned}$$ which yields the inclusion “$\\subset$” in (\\[4.14\\]). Thus we arrive at formula $(\\ref{4.13})$.
The second part of the corollary follows from the first part, Proposition \\[p3\\], and Proposition \\[p4\\]. This completes the proof of the claimed result. $\\h$
The results obtained in Corollary \\[si\\] can be compared with [@CHY Theorem 3.4], where “$\\subset$” in (\\[4.13\\]) was obtained for $h=0$ under the following conditions: $T$ is scattered compact (meaning that every subset $S\\subset T$ has an isolated point), $g_t$ are Fréchet differentiable for all $t\\in T$, the mappings $(x,t)\\in X\\times T\\mapsto g_t(x)$ and $(x,t)\\in X\\times T\\mapsto\\nabla g_t(x)$ are continuous, and the EMFCQ condition holds at $\\ox$. We can see that these assumptions are significantly stronger than those Corollary \\[si\\]. Note, in particular, that the scattering compactness requirement on the index set $T$ is not different in applications from $T$ being finite.
The next question we address in this section is about the possibility to obtain normal cone representations of the “unperturbed" type as in Corollary \\[si\\] while in infinite programming settings with no finite dimensionality, compactness, and continuity assumptions made above. The following theorem shows that this can be done when the PMFCQ is accompanied by the NFMCQ condition of Definition \\[cd3\\].
\\[thm42\\] [**(unperturbed representations of normal cones for infinite constraint systems).**]{} Let the functions $g_t$, $t\\in T$, be uniformly Fréchet differentiable at $\\ox$, and let that system [(\\[3.1\\])]{} satisfy the PMFCQ and NFMCQ conditions at $\\ox$. Then $$\\begin{aligned}
\\label{4.16}
\\Hat N(\\ox;\\O)= \\disp\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*).\\end{aligned}$$ If in addition the functions $g_t$, $t\\in T$, are uniformly strictly differentiable at $\\ox$, then $$\\begin{aligned}
\\label{4.17}
N(\\ox;\\O)=\\disp\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*).\\end{aligned}$$
[**Proof.**]{} First we claim that the set $\\disp\\bigcap_{\\ve>0}\\cl\\cone\\{\\nabla g_t(\\ox)|\\; t\\in T_\\ve(\\ox)\\}$ belongs to the set $$\\begin{aligned}
\\label{4.18}
\\Big\\{x^*\\in X^*\\Big|\\;(x^*,\\la x^*,\\ox\\ra)\\in\\cl\\cone\\big\\{(\\nabla g_t(\\ox),\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))\\big|\\; t\\in T\\big\\}\\Big\\}.\\end{aligned}$$ Indeed, it follows from the PMFCQ for (\\[3.1\\]) at $\\ox$ that $\\nabla h(\\ox)$ is surjective and there are $\\tilde \\ve>0$, $\\delta>0$, and $\\tilde x\\in X$ such that $\\nabla h(\\ox)\\tilde x=0$ and that $\\la\\nabla g_t(\\ox),\\tilde x\\ra<-\\delta$ for all $\\ve\\le\\tilde\\ve$ and $t\\in T_\\ve(\\ox)$. To justify the claimed inclusion to (\\[4.18\\]), pick an arbitrary element $x^*\\in\\disp\\bigcap_{\\ve>0}\\cl\\cone\\{\\nabla g_t(\\ox)|\\;t\\in T_\\ve(\\ox)\\}$ and for any $\\ve\\in (0,\\tilde\\ve)$ find a net $(\\lm_\\nu)_{\\nu\\in\\N}\\subset\\tR$ with $$\\begin{aligned}
\\label{4.19}
x^*=w^*-\\lim_\\nu\\disp\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\nabla g_t(\\ox).\\end{aligned}$$ This implies the relationships $$\\begin{aligned}
\\label{4.20}
\\la x^*,\\tilde x\\ra=\\lim_\\nu\\disp\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\la \\nabla g_t(\\ox),\\tilde x\\ra\\le-\\delta\\limsup_\\nu\\disp\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\;\\mbox{ and}\\end{aligned}$$ $$\\begin{aligned}
\\begin{array}{ll}
\\la x^*,\\ox\\ra=\\disp\\lim_\\nu\\disp\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\la\\nabla g_t(\\ox),\\ox\\ra=\\lim_\\nu\\disp\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}(\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox)+g_t(\\ox)).
\\end{array}\\end{aligned}$$ The later equality together with (\\[4.20\\]) give us that $$\\begin{aligned}
0\\ge\\la x^*,\\ox\\ra-\\limsup_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}(\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))\\ge\\liminf_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu} g_t(\\ox)\\ge\\disp\\frac{\\ve}{\\delta}\\la x^*,\\tilde x\\ra.\\end{aligned}$$ By passing to a subnet and combining this with (\\[4.19\\]), we get $$(x^*,\\la x^*,\\ox\\ra)\\in\\cl\\cone\\big\\{(\\nabla g_t(\\ox),\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))\\big|\\;t\\in T\\big\\}+\\{0\\}\\times\\disp[\\frac{\\ve}{\\delta}\\la x^*,\\tilde x\\ra,0]$$ for all $\\ve\\in(0,\\tilde \\ve)$, which implies that $x^*$ belongs to the set in (\\[4.18\\]) by taking $\\ve\\dn 0$.
Involving further the NFMCQ condition, we claim the equality $$\\begin{aligned}
\\label{4.21}
\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}=\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}.\\end{aligned}$$ The inclusion “$\\supset$” in is obvious since $T(\\ox)\\subset T_\\ve(\\ox)$ for all $\\ve>0$. To justify the converse inclusion, pick any $x^*$ belonging to the left-hand side of (\\[4.21\\]). By the NFMCQ condition, it follows from (\\[4.18\\]) that there is $\\lm\\in\\tR$ such that $$\\begin{aligned}
\\label{4.22}
(x^*,\\la x^*,\\ox\\ra)=\\sum_{t\\in T}\\lm_t\\big(\\nabla g_t(\\ox),\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big),\\end{aligned}$$ which readily yields the equalities $$\\begin{aligned}
0=\\sum_{t\\in T}\\lm_t\\la\\nabla g_t(\\ox),\\ox\\ra-\\sum_{t\\in T}\\lm_t\\big(\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big)=\\sum_{t\\in T}\\lm_t g_t(\\ox).\\end{aligned}$$ Since $g_t(\\ox)\\le 0$, we get $\\lm_tg_t(\\ox)=0$ for all $t\\in T$. Combining this with (\\[4.22\\]) gives us $$\\begin{aligned}
x^*\\in\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\},\\end{aligned}$$ which implies the inclusion “$\\subset$” in (\\[4.21\\]). To complete the proof of the theorem, we combine the obtained equality with finally Theorem \\[thm41\\]. $\\h$
Observe from Proposition \\[fm\\] that formula (\\[4.16\\]) holds under our standing assumptions (SA) and the MFCQ condition at $\\ox$ when $T$ is a finite index set. Furthermore, the formula for the limiting normal cones (\\[4.17\\]) is also satisfied if all the functions $g_t$ are strictly differentiable at $\\ox$. It follows from Proposition \\[fm\\] that Corollary \\[si\\] can be derived from a semi-infinite version of Theorem \\[thm42\\] in addition to the assumptions of this corollary we suppose that the function $t\\in T\\mapsto g_t(\\ox)$ is continuous in $T$.
The next example shows that the PMFCQ condition cannot be replaced by the EMFCQ one in Theorem \\[thm42\\] to ensure the unperturbed normal cone representations and in the presence of the NFMCQ.
\\[ex4\\][**(EMFCQ combined with NFMCQ does not ensure the unperturbed normal cone representations).**]{} [We revisit the semi-infinite inequality constraint system in Example \\[ex1\\]. It is shown there that this system satisfied the EMFCQ but not PMFCQ at $\\ox=(-1,0)$. It is easy to check that the set $$\\begin{aligned}
\\cone\\big\\{\\big(\\nabla g_t(\\ox),\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox)\\big)\\big|\\;t\\in T\\big\\}&=&\\cone\\big((1,0,-1)\\cup\\{(t,0,0)\\big|t\\in (0,1]\\}\\big)\\\\
&=&\\big\\{x\\in\\R^3\\big|\\;x_1+x_3\\ge 0,\\;x_1\\ge 0\\ge x_3,\\;x_2=0\\big\\}\\end{aligned}$$ is closed in $\\R^3$, i.e., the NFMCQ condition holds at $\\ox$. Observe however that both representations (\\[4.16\\]) and (\\[4.17\\]) are not satisfied for this system since we have $$\\begin{aligned}
\\Hat N(\\ox;\\O)=N(\\ox;\\O)\\not=\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}=\\cone\\{(1,0)\\}=\\R_+\\times\\{0\\}.\\end{aligned}$$]{}
Now we present a consequence of Theorem \\[thm42\\] with the corresponding discussions.
\\[cv\\] [**(normal cone for infinite convex systems).**]{} Assume that all the functions $g_t$, $t\\in T$, in are convex and uniformly Fréchet differentiable and that $h=A$ is a surjective continuous linear operator. Suppose further that system [(\\[3.1\\])]{} satisfies the PMFCQ $($equivalently the SSC$)$ at $\\ox\\in\\O$. Then the normal cone to $\\O$ at $\\ox$ in sense of convex analysis is computed by $$\\begin{aligned}
N(\\ox;\\O)=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+A^*(Y^*).\\end{aligned}$$ If in addition the NFMCQ holds at $\\ox$, then we have $$\\begin{aligned}
\\label{cnm}
N(\\ox;\\O)=\\disp\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}+A^*(Y^*).\\end{aligned}$$
[**Proof.**]{} It follows directly from Proposition \\[ss\\] and Theorem \\[thm42\\]. $\\h$
For $h=0$ in the equality in (\\[cnm\\]) can be deduced from [@DMN2 Corollary 3.6] under another [*Farkas-Minkowski Constraint Qualification*]{} (FMCQ) defined as follows:
[**(FMCQ)**]{} [*The conic hull [cone]{}$\\{\\epi g_t^*|\\; t\\in T\\}$ is weak$^*$ closed in $X^*\\times\\R$ under the additional assumption that the functions $g_t$ are l.s.c., where $$\\ph^*(x^*):=\\sup\\big\\{\\la x^*,x\\ra-\\ph(x)\\big|\\;x\\in X\\big\\},\\quad x^*\\in X^*,$$ stands for the Fenchel conjugate of a convex function.*]{}
It is worth noting that the above FMCQ condition is a [*global*]{} property, and hence formula (\\[cnm\\]) holds at every $\\ox\\in\\O$. By the contrary, our new NFMCQ condition (\\[fm\\]) is constructed at a fixed point $\\ox\\in\\O$. The next example shows that the combination of the PMFCQ (or the SSC) and the NFMCQ conditions for infinite convex inequality systems is not stronger than the FMCQ one.
\\[ex5\\] [**(PMFCQ combined with NFMCQ does not imply FMCQ for convex inequality systems).**]{} [Define a function $g_t:\\R^2\\to\\R$ by $g_t(x_1,x_2):=tx_1^2-x_2$ for all $(x_1,x_2)\\in\\R^2$ and $t\\in T:=(0,1)$, and let $\\ox=(0,0)\\in\\R^2$. It is easy to see that all the functions $g_t$, $t\\in T$, are convex and differentiable and that the standing assumptions are satisfied. For each $t\\in T$ we have $$g_t^*(a_1,a_2)=\\sup_{(x_1,x_2)\\in\\R^2}\\left\\{a_1x_1+a_2x_2-tx_1^2+x_2\\right\\}=\\left\\{
\\begin{array}{ll}
\\disp\\frac{a_1^2}{4t} &\\mbox{if $a_2=-1$},\\\\
\\infty &\\mbox{otherwise}.
\\end{array}
\\right.$$ This implies that $\\epi g_t^*=\\{(a,-1,\\frac{a^2}{4t}+r)|\\;a\\in \\R,\\;r\\ge 0\\}$, which yields in turn that $$C:=\\cone\\big\\{\\epi g_t^*\\big|\\;t\\in T\\big\\}=\\cone\\Big\\{(a,-1,\\frac{a^2}{4}+r)\\Big|\\;a\\in \\R,\\;r\\ge 0\\Big\\}.$$ The latter set is not closed in $\\R^3$ since $\\{0\\}\\times\\{0\\}\\times\\R_+\\not\\subset C$ while $\\{0\\}\\times\\{0\\}\\times \\R_+\\subset{\\rm cl}C$. Moreover, we see that $\\nabla g_t(\\ox)=(0,-1)$ for all $t\\in T$, and then the PMFCQ is satisfied. Furthermore, it follows that the set $$\\cone\\big\\{(\\nabla g_t(\\ox),\\la\\nabla g_t(\\ox),\\ox\\ra-g_t(\\ox))\\big|\\;t\\in T\\big\\}=\\cone\\{(0,-1, 0)\\}=\\{0\\}\\times\\R_-\\times\\{0\\}$$ is closed in $\\R^3$. Hence the PMFCQ and NFMCQ conditions hold but the FMCQ does not.]{}
Finally in this section, we give specifications of obtained normal cone representations in the case linear infinite systems.
\\[clm\\] [**(normal cone representations for linear infinite constraint systems).**]{} Consider the constraint system with $g_t(x)=\\la a^*_t,x\\ra-b_t$ for all $t\\in T$, and let $h=A:X\\to Y$. Assume that $A$ is a surjective continuous linear operator and that the coefficient set $\\{a^*_t|\\;t\\in T\\}$ is bounded in $X^*$. If the SSC condition holds at $\\ox$, then $$\\begin{aligned}
N(\\ox;\\O)=\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{a^*_t\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+A^*(Y^*)\\end{aligned}$$ for the feasible set $\\O:=\\{x\\in X|\\;Ax=0,\\;\\la a^*_t,x\\ra-b_t\\le 0,\\;t\\in T\\}$. On the other hand, assuming the weak$^*$ closedness of $\\cone\\{(a^*_t, b_t)|\\;t\\in T\\}$ in $X^*\\times\\R$ and that $h=0$ gives us $$\\begin{aligned}
N(\\ox;\\O)=\\disp\\cone\\big\\{a^*_t\\big|\\;t\\in T(\\ox)\\big\\}.\\end{aligned}$$
[**Proof.**]{} The first statement is a specification of Corollary \\[cv\\]. The second one follows from the proofs given in [@CLMP1 Proposition 3.1] and [@CLMP2 Theorem 3.2] by using the classical Farkas Lemma for linear infinite systems. $\\h$
Optimality Conditions in Nonlinear Infinite Programming
=======================================================
In this section we employ general principles in optimization and the calculus results on computing the normal cones to the infinite constraint sets in Section 4 to deriving necessary optimality conditions for problems of infinite and semi-infinite programming. We confine ourselves to optimality conditions of the “lower" subdifferential type conventional in minimization. Condition of the other (“upper" or superdifferential) type can be derived from the calculus results of Section 4 using an approach developed in [@M1 Chapter 5]; see also the recent paper [@CLMP2] for the implementation of the latter approach in the case of semi-infinite and infinite programs with linear constraints.
Our first theorem in this section concerns infinite programs of type in arbitrary Banach spaces involving Fréchet differentiable cost functions.
\\[thm43\\] [**(necessary optimality conditions for differentiable infinite programs in general Banach spaces).**]{} Let $\\ox$ be a local minimizer of the infinite program [(\\[1.1\\])]{} under the PMFCQ condition imposed on the constraints at $\\ox$. Suppose further that the inequality constraint functions $g_t$, $t\\in T$, are uniformly Fréchet differentiable at $\\ox$ and the cost function $f$ is Fréchet differentiable at this point. Then we have the inclusion $$\\begin{aligned}
\\label{5.1}
0\\in\\nabla f(\\ox)+\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*).\\end{aligned}$$ If in addition the NFMCQ holds at $\\ox$, then there exist multipliers $\\lm\\in\\tR$ and $y^*\\in Y^*$ satisfying the differential KKT condition $$\\begin{aligned}
\\label{5.2}
0=\\nabla f(\\ox)+\\disp\\sum_{t\\in T(\\ox)}\\lm_t\\nabla g_t(\\ox)+\\nabla h(\\ox)^*y^*.\\end{aligned}$$
[**Proof.**]{} It is clear that $\\ox$ is a local optimal solution to the following unconstrained optimization problem with the [*infinite penalty*]{}: $$\\begin{aligned}
\\label{5.3}
\\mbox{minimize }\\;f(x)+\\delta(x;\\O),\\end{aligned}$$ where $\\O$ is the feasible constraint set . Applying the generalized Fermat rule to the latter problem (see, e.g., [@M1 Proposition 1.114]), we have $$\\begin{aligned}
\\label{5.4}
0\\in\\Hat\\partial\\big(f+\\delta(\\cdot;\\O)\\big)(\\ox).\\end{aligned}$$ Since $f$ is Fréchet differentiable at $\\ox$, it follows from the sum rule of [@M1 Theorem 1.107 ] applied to and from the first relationship in (\\[2.4\\]) that $$\\label{5.4a}
0\\in\\nabla f(\\ox)+\\Hat\\partial\\delta(\\ox;\\O)(\\ox)=\\nabla f(\\ox)+\\Hat N(\\ox;\\O).$$ Now using the Fréchet normal cone representation of Theorem \\[thm41\\] in , we arrive at (\\[5.1\\]). The second part (\\[5.2\\]) of this theorem readily follows from Theorem \\[thm42\\]. $\\h$
The next theorem establishes necessary conditions for local minimizers of infinite programs (\\[1.1\\]) with general nonsmooth cost functions in the framework of Asplund spaces.
\\[thm44\\] [**(necessary optimality conditions for nonconvex infinite programs defined on Asplund spaces, I).**]{} Let $\\ox$ be a local minimizer of problem [(\\[1.1\\])]{}, where the domain space $X$ is Asplund while the image space $Y$ is arbitrary Banach. Suppose that the constraint functions $g_t$, $t\\in T$, are uniformly strictly differentiable at $\\ox$, that the cost function $f$ is l.s.c. around $\\ox$ and SNEC at this point, and that the qualification condition $$\\begin{aligned}
\\label{5.5}
\\partial^\\infty f(\\ox)\\cap\\Big[-\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}-\\nabla h(\\ox)^*(Y^*)\\Big]=\\{0\\}\\end{aligned}$$ is fulfilled; the latter two assumptions are automatic when $f$ is locally Lipschitzian around $\\ox$. If the PMFCQ condition holds at $\\ox$, then $$\\begin{aligned}
\\label{5.6}
0\\in\\partial f(\\ox)+\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+\\nabla h(\\ox)^*(Y^*).\\end{aligned}$$ If in addition we assume that the NFMCQ holds at $\\ox$ and replace by $$\\begin{aligned}
\\label{5.5a}
\\partial^\\infty f(\\ox)\\cap\\Big[-\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T(\\ox)\\big\\}-\\nabla h(\\ox)^*(Y^*)\\Big]=\\{0\\},\\end{aligned}$$ then there exist multipliers $\\lm\\in\\tR$ and $y^*\\in Y^*$ such that the following subdifferential KKT condition is satisfied: $$\\begin{aligned}
\\label{5.6a}
0\\in\\partial f(\\ox)+\\disp\\sum_{t\\in T(\\ox)}\\lm_t\\nabla g_t(\\ox)+\\nabla h(\\ox)^*y^*.\\end{aligned}$$
[**Proof.**]{} Observe first that the feasible set $\\O$ is locally closed around $\\ox$. Indeed, it follows from (\\[3.4\\]) that there are $\\gg>0$ and $\\eta>0$ sufficiently small such that $$\\begin{aligned}
\\|h(x)-h(x^\\prime)\\|\\le(\\|\\nabla h(\\ox)\\|+\\gg)\\|x-x^\\prime\\|\\;\\mbox{ and }\\;\\|g_t(x)-g_t(x^\\prime)\\|\\le\\sup_{\\tau\\in T}(\\|\\nabla g_\\tau(\\ox)\\|+\\gg)\\|x-x^\\prime\\|\\end{aligned}$$ for all $x,x^\\prime\\in\\B_\\eta(\\ox)$ and $t\\in T$. Picking any sequence $\\{x_n\\}\\subset\\O\\cap\\B_\\eta(\\ox)$ converging to some $x_0$ as $n\\to\\infty$, we have $$\\begin{aligned}
\\|h(x_0)\\|\\le(\\|\\nabla h(\\ox)\\|+\\gg)\\|x_n-x_0\\|\\;\\mbox{ and }\\;g_t(x_0)\\le\\sup_{\\tau\\in T}(\\|\\nabla g_\\tau(\\ox)\\|+\\gg)\\|x_n-x_0\\|+g_t(x_n)\\end{aligned}$$ for each $t\\in T$ and $n\\in\\IN$. By passing to the limit as $n\\to\\infty$, the latter yields that $h(x_0)=0$ and $g_t(x_0)\\le 0$ for all $t\\in T$, i.e., $x_0\\in\\O\\cap\\B_\\eta(\\ox)$, which justifies the local closedness of the feasible set $\\O$ around $\\ox$.
Employing now the generalized Fermat rule to the solution $\\ox$ of with the closed set $\\O$ and using [@M1 Theorem 3.36] on the sum rule for basic/limiting subgradients in Asplund spaces when $f$ is SNEC at $\\ox$ yield that $$\\label{sr}
0\\in\\partial\\big(f+\\delta(\\cdot;\\O)\\big)(\\ox)\\subset\\partial f(\\ox)+\\partial\\delta(\\ox;\\O)=\\partial f(\\ox)+N(\\ox;\\O)$$ provided that $\\partial^\\infty f(\\ox)\\cap\\big(-N(\\ox;\\O)\\big)=\\{0\\}$. We apply further to both latter conditions the limiting normal cone representation of Theorem \\[thm41\\]. This gives us the optimality condition under the fulfillment of and the PMFCQ at $\\ox$. Applying finally Theorem \\[thm42\\] instead of Theorem \\[thm41\\] in the setting above, we arrive at the KKT condition under the assumed NFMCQ at $\\ox$ and , which completes the proof of the theorem. $\\h$
An important ingredient in the proof of Theorem \\[thm44\\] is applying the subdifferential sum rule from [@M1 Theorem 3.36 ] to the sum $f+\\dd(\\cdot;\\O)$, which requires that either $f$ is SNEC at $\\ox$ or $\\O$ is SNC at this point. While the first possibility was used above, now we are going to explore the second alternative. The next proposition presents verifiable conditions ensuring the SNC property of the feasible set $\\O$ at $\\ox$.
\\[asp\\] [**(SNC property of feasible sets in infinite programming).**]{} Let $X$ be an Asplund space, and let $\\dim Y<\\infty$ in the framework of . Assume that all the functions $g_t$, $t\\in T$, are Fréchet differentiable around some $\\ox\\in\\O$ and that the corresponding derivative family $\\{\\nabla g_t\\}_{t\\in T}$ is equicontinuous around this point, i.e., there exists $\\ve>0$ such that for each $x\\in\\B_\\ve(\\ox)$ and each $\\gg>0$ there is $0<\\tilde\\ve<\\ve$ with the property $$\\begin{aligned}
\\label{5.7}
\\|\\nabla g_t(x^\\prime)-\\nabla g_t(x)\\|\\le\\gg\\;\\mbox{ whenever }\\;x^\\prime\\in\\B_{\\tilde\\ve}(x)\\cap \\O\\;\\mbox{ and }\\;t\\in T.\\end{aligned}$$ Then the feasible set $\\O$ in is locally closed around $\\ox$ and SNC at this point provided that the PMFCQ condition holds at $\\ox$.
[**Proof.**]{} Consider first the set $\\O_1:=\\{x\\in X|\\;g_t(x)\\le 0,\\;t\\in T\\}$. By using arguments similar to the proof of Theorem \\[thm44\\], we justify the local closedness of $\\O_1$ around $\\ox$. Now let us prove that $\\O_1$ is SNC at this point. To proceed, pick any sequence $(x_n,x^*_n)\\in\\O_1\\times X^*$, $n\\in\\IN$, satisfying $$\\begin{aligned}
x_n\\st{\\O_1}\\to\\ox,\\;x^*_n\\in\\Hat N(x_n;\\O_1)\\;\\mbox{ and }\\;x^*_n\\st{w^*}\\to 0\\;\\mbox{ as }\\;n\\to\\infty.\\end{aligned}$$ Taking into account, we see that the functions $g_t$, $t\\in T$ satisfy the standing assumptions (SA) at $x_n$ for all $n\\in\\IN$ sufficiently large. Moreover, the proof showing that assumption (\\[3.4\\]) holds at $x_n$ follows from the discussions right after Corollary \\[mc\\]. Since the PMFCQ condition holds at $\\ox$, there exist $\\delta>0$, $\\ve>0$, and $\\tilde x\\in X$ such that $\\la\\nabla g_t(\\ox),\\tilde x\\ra\\le-2\\delta$ for all $t\\in T_{2\\ve}(\\ox)$. Observe that $T_\\ve(x_n)\\subset T_{2\\ve}(\\ox)$ for all large $n\\in\\IN$. Indeed, whenever $t\\in T_\\ve(x_k)$ we have $$\\begin{aligned}
0\\ge g_t(\\ox)&\\ge& g_t( x_n)-\\la \\nabla g_t(\\ox),x_n-\\ox\\ra-\\|x_n-\\ox\\|s(\\|x_k-\\ox\\|)\\\\
&\\ge&-\\ve-\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(\\ox)\\|\\cdot\\|x_n-\\ox\\|-\\|\\tilde x_n-\\ox\\|s(\\|x_n-\\ox\\|)\\ge-2\\ve\\end{aligned}$$ for all large $n\\in\\IN$, where $s(\\cdot)$ is defined in . Further, it follows from (\\[5.7\\]) that $$\\begin{aligned}
\\la\\nabla g_t( x_n),\\tilde x\\ra\\le\\la\\nabla g_t(\\ox),\\tilde x\\ra+\\|\\nabla g_t( x_n)-\\nabla g_t(\\ox)\\|\\cdot\\|\\tilde x\\|\\le-2\\delta+\\|\\nabla g_t( x_n)-\\nabla g_t(\\ox)\\|\\cdot\\|\\tilde x\\|\\le-\\delta\\end{aligned}$$ when $n\\in\\IN$ is sufficiently large. Hence we suppose without loss of generality that $$\\begin{aligned}
\\label{5.8}
T_\\ve(x_n)\\subset T_{2\\ve}(\\ox)\\;\\mbox{ and }\\;\\sup_{t\\in T_\\ve( x_n)}\\la\\nabla g_t(x_n),\\tilde x\\ra\\le-\\delta\\;\\mbox{ whenever }\\;n\\in\\IN.\\end{aligned}$$ Applying now Theorem \\[thm41\\] in this setting, we have that for each $n\\in\\IN$ there exists a net $\\{\\lm_{n_\\nu}\\}_{\\nu\\in\\N}\\subset\\Tilde \\R_+^{T_\\ve( x_n)}$ such that $$\\begin{aligned}
x^*_n=w^*-\\lim_\\nu\\sum_{t\\in T_\\ve(x_n)}\\lm_{tn_\\nu}\\nabla g_t(x_n).\\end{aligned}$$ Combining this with (\\[5.8\\]) yields that $$\\begin{aligned}
\\la x^*_n,\\tilde x\\ra=\\lim_\\nu\\sum_{t\\in T_\\ve(x_n)}\\lm_{tn_\\nu}\\la\\nabla g_t(x_n),\\tilde x\\ra\\le-\\delta\\liminf_\\nu\\sum_{t\\in T_\\ve( x_n)}\\lm_{tn_\\nu}.\\end{aligned}$$ Furthermore, for each $x\\in X$ we get the relationships $$\\begin{aligned}
\\la x^*_n,x\\ra&=&\\liminf_\\nu\\sum_{t\\in T_\\ve( x_k)}\\lm_{tn_\\nu}\\la\\nabla g_t(x_n),x\\ra\\le\\liminf_\\nu\\sum_{t\\in T_\\ve(x_n)}\\lm_{tn_\\nu}\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(x_n)\\|\\cdot\\|x\\|\\\\
&\\le&-\\frac{\\la x^*_n,\\tilde x\\ra}{\\delta}\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(x_n)\\|\\cdot\\|x\\|,\\end{aligned}$$ which imply that $\\|x^*_n\\|\\le-\\frac{\\la x^*_n,\\tilde x\\ra}{\\delta}\\sup_{\\tau\\in T}\\|\\nabla g_\\tau(x_n)\\|$ for all $n\\in\\IN$. Since $x^*_n\\st{w^*}\\to 0$, it follows from the latter that $\\|x^*_n\\|\\to 0$ as $n\\to\\infty$ and thus the set $\\O_1$ is SNC at $\\ox$.
Consider now the set $\\O_2:=\\{x\\in X|\\;h(x)=0\\}$, which is obviously closed around $\\ox$. It follows from [@M1 Theorem 1.22] and finite dimensionality of $Y$ that $\\O_2$ is SNC at $\\ox$. Moreover, we get from [@M1 Theorem 1.17] that $N(\\ox;\\O_2)=\\nabla h(\\ox)^*(Y^*)$. Thus for any $x^*\\in N(\\ox;\\O_1)\\cap(-N(\\ox;\\O_2))$ there is $y^*\\in Y^*$ such that $x^*+\\nabla h(\\ox)^*y^*=0$, and then $$\\la x^*,\\tilde x\\ra=-\\la\\nabla h(\\ox)^*y^*,\\tilde x\\ra=-\\la y^*,\\nabla h(\\ox)\\tilde x\\ra=0.$$ Since $x^*\\in N(\\ox;\\O_1)$, we find by Theorem \\[thm41\\] such a net $\\{\\lm_\\nu\\}_{\\nu\\in\\N}\\in\\tR$ that $$\\begin{aligned}
x^*=w^*-\\lim_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\nabla g_t(\\ox),\\end{aligned}$$ which yields in turn that $$\\begin{aligned}
0=\\la x^*,\\tilde x\\ra=\\lim_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\la \\nabla g_t(\\ox),\\tilde x\\ra\\le-2\\delta\\liminf_{\\nu}\\sum_{t\\in T_\\ve(\\ox)} \\lm_{t\\nu}.\\end{aligned}$$ This ensures the relationships $$\\la x^*,x\\ra=\\liminf_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\la\\nabla g_t(\\ox),x\\ra\\le\\liminf_\\nu\\sum_{t\\in T_\\ve(\\ox)}\\lm_{t\\nu}\\sup_{\\tau\\in T}\\|\\la \\nabla g_\\tau(\\ox)\\|\\|x\\|=0$$ for all $x\\in X$. Hence we have $x^*=0$, and so $N(\\ox;\\O_1)\\cap(-N(\\ox;\\O_2))=\\{0\\}$. It finally follows from [@M1 Corollary 3.81] that the intersection $\\O=\\O_1\\cap\\O_2$ is SNC at $\\ox$, which thus completes the proof of the proposition. $\\h$
Observe that the assumption $\\dim Y<\\infty $ is essential in Proposition \\[asp\\]. To illustrate this, consider a particular case of when $T=\\emp$. It follows from [@M1 Theorem 1.22] that the inverse image $\\O=h^{-1}(0)$ is SNC at $\\ox\\in\\O$ if and only if the set $\\{0\\}$ is SNC at $0\\in Y$. Since $N(0;\\{0\\})=Y^*$, the latter holds if and only if the weak$^*$ topology in $Y^*$ agrees with the norm topology in $Y^*$, which is only the case of $\\dim Y<\\infty$ by the classical Josefson-Nissenzweig theorem from theory of Banach spaces.
Now we are ready to derive an aforementioned alternative counterpart of Theorem \\[thm44\\].
\\[thm45\\] [**(necessary optimality conditions for nonconvex infinite programs defined on Asplund spaces, II).**]{} Let $\\ox$ be a local minimizer of infinite program [(\\[3.1\\])]{} under the assumptions of Proposition [\\[asp\\]]{}. Suppose also that $f$ is l.s.c. around $\\ox$ and that the qualification condition is satisfied. Then we have the optimality condition . If in addition we assume that the NFMCQ holds at $\\ox$ and replace by , then there exist multipliers $\\lm\\in\\tR$ and $y^*\\in Y^*$ such that the subdifferential KKT condition .
[**Proof.**]{} It is similar to the proof of Theorem \\[thm44\\] with applying Proposition \\[asp\\] on the SNC and closedness property of $\\O$ in the sum rule of [@M1 Theorem 3.36]. $\\h$
The next result provides necessary and sufficient optimality conditions for convex problems of infinite programming in general Banach spaces.
\\[conv1\\] [**(necessary and optimality conditions for convex infinite programs).**]{} Let both spaces $X$ and $Y$ be Banach. Assume that all the functions $g_t$, $t\\in T$, are convex and uniformly Fréchet differentiable and that $h=A$ is a surjective continuous linear operator. Suppose further that the cost function $f$ is convex and continuous at some point in $\\O$. If the PMFCQ condition $($equivalently the SSC condition) holds at $\\ox$, then $\\ox$ is a global minimizer of problem if and only if $$\\begin{aligned}
0\\in\\partial f(\\ox)+\\disp\\bigcap_{\\ve>0}\\cl\\cone\\big\\{\\nabla g_t(\\ox)\\big|\\;t\\in T_\\ve(\\ox)\\big\\}+A^*(Y^*).\\end{aligned}$$ If in addition the NFMCQ condition holds, then $\\ox$ is a global minimizer of problem if and only if there exist $\\lm\\in \\tR$ and $y^*\\in Y^*$ such that $$\\begin{aligned}
\\label{5.9}
0\\in\\partial f(\\ox)+\\disp\\sum_{t\\in T(\\ox)}\\lm_t\\nabla g_t(\\ox)+A^*y^*.\\end{aligned}$$
[**Proof.**]{} Observe that $\\ox$ is a global minimizer of problem (\\[1.1\\]) if and only if it is a global minimizer of the convex unconstrained problem (\\[5.3\\]), which is equivalent to the fact that $$\\begin{aligned}
0\\in\\partial\\big(f+\\delta(\\cdot;\\O)\\big)(\\ox).\\end{aligned}$$ Applying the convex subdifferential sum rule to the latter inclusion, we conclude that $\\ox$ is a global minimizer of problem (\\[1.1\\]) if and only if $$\\begin{aligned}
0\\in\\partial f(\\ox)+\\partial\\delta(\\ox;\\O)=\\partial f(\\ox)+N(\\ox;\\O).\\end{aligned}$$ The rest of the proof follows from Corollary \\[cv\\]. $\\h$
Note that some versions of necessary optimality condition of the KKT type were derived in [@CLMP2 Theorems 3.1 and 3.2] for infinite problems with linear constraints but possibly nonconvex cost functions under the SSC and the linear counterpart of the FMCQ; see Example \\[ex5\\] and the corresponding discussions above.
Observe also that the results of Theorem \\[thm45\\] and Theorem \\[conv1\\] are formulated with no change in the case of semi-infinite programs, while in Theorem \\[thm43\\] we just drop the SNEC assumption on $f$, which holds automatically when $X$ is finite-dimensional.
In conclusion we present a consequence of our results for the classical framework of semi-infinite programming while involving nonsmooth cost functions.
\\[cor6\\] [**(necessary optimality conditions for semi-infinite programs with compact index sets).**]{} Let $\\ox$ be a local minimizer of program [(\\[1.1\\])]{}, where both spaces $X$ and $Y$ are finite-dimensional with $\\dim Y<\\dim X$. Assume that the index set $T$ in is a compact metric space, that the mappings $(x,t):X\\times T\\mapsto g_t(x)$ and $(x,t):X\\times T\\mapsto\\nabla g_t(x)$ are continuous, and that the cost function $f$ is l.s.c. around $\\ox$ with the fulfillment of . If in addition the EMFCQ holds at $\\ox$, then there exist multipliers $\\lm\\in\\tR$ and $y^*\\in Y^*$ satisfying the subdifferential KKT condition .
[**Proof.**]{} By Proposition \\[sfm\\] we have that the NFMCQ condition holds at $\\ox$ under the assumptions made. Then this corollary follows directly from Theorem \\[thm44\\]. $\\h$
When $f$ is smooth around $\\ox$, assumption holds automatically while reduced to the differential KKT condition . Then Corollary \\[cor6\\] reduces to a well-known result in semi-infinite programming that can be found, e.g., in [@HK Theorem 3.3] and [@LS Theorem 2].
[99]{}
Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces. Wiley, Chicherster (1987)
Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)
Borwein, J.M., Zhu, Q.J.: Techniques of Variational Analysis. Springer, New York (2005)
Boţ, R.I., Grad, S.-M., Wanka, G.: On strong total Lagrange duality for convex optimization problems, J. Math. Anal. Appl. [**337**]{}, 1315–1325 (2008)
Cánovas, M.J., López, M.A., Mordukhovich, B.S., Parra J.: Variational analysis in semi-infinite and infinite programming, I: Stability of linear inequality systems of feasible solutions. SIAM J. Optim. [**20**]{}, 1504–1526 (2009)
Cánovas, M.J., López, M.A., Mordukhovich, B.S., Parra J.: Variational analysis in semi-infinite and infinite programming, II: Necessary optimality conditions. SIAM J. Optim. [**20**]{}, 2788–2806 (2010)
Chuong, T.D., Huy, N.Q., Yao, J.C.: Subdifferentials of marginal functions in semi-infinite programming. SIAM J. Optim., [**20**]{}, 1462–1477 (2009)
Dinh, N.; Goberna, M. A.; López, M. A.: From linear to convex systems: Consistency, Farkas’ lemma and applications. J. Convex Anal. [**13**]{}, 113–133 (2006)
Dinh, N., Goberna, M.A., López, M.A., Son, T.Q.: New Farkas-type results with applications to convex nfinite programming. ESAIM: Control Optim. Cal. Var. [**13**]{}, 580–597 (2007)
Dinh, N., Mordukhovich, B.S., Nghia, T.T.A.: Qualification and optimality conditions for DC programs with infinite programs. Acta Math. Vietnamica [**34**]{}, 125–155 (2009)
Dinh, N., Mordukhovich, B.S., Nghia, T.T.A.: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math. Program. [**123**]{}, 101–138 (2010)
Fang, D. H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. [**20**]{}, 1311–1332 (2009)
Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)
Goberna, M.A., López, M.A. (eds.): Semi-Infinite Programming: Recent Advances. Kluwer, Dordrecht (2001)
Hettich, R., Kortanek, K.O.: Semi-infinite programming: Theory, methods and applications. SIAM Review [**35**]{}, 380–429 (1993)
Hiriart-Urruty, J.B., Lemaréchal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2001)
Jongen, H.Th., J.-J. Rückmann, J.-J., Stein, O.:, Generalized semi-infinite programming: A first-order optimality conditions and examples, Math. Program., [bf 83]{}, 145–158 (1998)
Jongen, H.Th., Twilt, F., Weber, G.W.: Semi-infinite optimization: Structure and stability of the feasible set. J. Optim. Theory Appl. [**72**]{}, 529–552 (1992)
Klatte, D., Henrion, R.: Regularity and stability in nonlinear semi-infinite optimization, in Semi-Infinite Programming, Reemstsen R. and Ruckmann, J.J., eds., pp. 69–102. Kluwer, Dordrecht (1998)
Li, C., Ng, K.F., Pong, T.K.: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. [**19**]{}, 163–187 (2008)
López, M., Still, G.: Semi-infinite programming. Europ. J. Oper. Res. [**180**]{}, 491–518 (2007)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory. Springer, Berlin (2006)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, II: Applications. Springer, Berlin (2006)
Rockafellar, R.T., Wets, R. J-B.: Variational Analysis, Springer, Berlin (1998)
Schirotzek, W.: Nonsmooth Analysis, Springer, Berlin (2007)
Seidman, T.I.: Normal cones to infinite intersections, Nonlinear Anal. [**72**]{}, 3911–3917 (2010)
Shapiro, A.: Semi-infinite programming: Duality, discretization and optimality conditions. Optimization [**58**]{}, 133–161 (2009)
Stein, O.: Bilevel Strategies in Semi-Infinite Programming. Kluwer, Boston, Massachusetts (2003)
Zheng, X.Y., Yang, X.Q.: Lagrange multipliers in nonsmooth semi-infinite optimization, Math. Oper. Res., [**32**]{}, 168–181 (2007)
[^1]: Research was partially supported by the USA National Science Foundation under grants DMS-0603846 and DMS-1007132 and by the Australian Research Council under grant DP-12092508.
[^2]: Department of Mathematics, Wayne State University, Detroit, Michigan 48202; email: boris@math.wayne.edu.
[^3]: Department of Mathematics, Wayne State University, Detroit, Michigan 48202; email: ttannghia@gmail.com.
|
Medieval Times was chosen from entries received from hundreds of leading Atlanta marketing departments and organizations, this year joining companies including IBM, DataDirect and the marketing firms behind Chick-fil-A, Georgia Lottery and Equifax in this esteemed group of marketing leaders.
This is the first marketing-specific distinction that the dinner attraction has received.
When asked about her process for developing creative, profitable marketing solutions, Stroup said, "The most successful marketing ideas are those that address a need or solve a problem for a specific audience. In order to drive results, you must first put yourself in the mindset of the person you are trying to reach and determine a strategy that tackles the prospect's challenges." |
/*
Simple DirectMedia Layer
Copyright (C) 1997-2014 Sam Lantinga <slouken@libsdl.org>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
/**
* \\file close_code.h
*
* This file reverses the effects of begin_code.h and should be included
* after you finish any function and structure declarations in your headers
*/
#undef _begin_code_h
/* Reset structure packing at previous byte alignment */
#if defined(_MSC_VER) || defined(__MWERKS__) || defined(__WATCOMC__) || defined(__BORLANDC__)
#ifdef __BORLANDC__
#pragma nopackwarning
#endif
#pragma pack(pop)
#endif /* Compiler needs structure packing set */
|
The present invention relates to vehicle wheel alignment systems, and in particular to an improved non-contact vehicle wheel alignment system utilizing one or more optical imaging sensors to acquire images of a vehicle from which three-dimensional information on one or more current vehicle wheel alignment angles can be obtained.
Various systems have been designed to determine vehicle wheel alignment angles. Originally, vehicle wheel alignment angles were measured directly by alignment angle sensors mounted to the vehicle wheels. For example, U.S. Reissue Pat. No. 33,144 to Hunter et al. and U.S. Pat. No. 4,319,838 to Grosssman et al. each describe vehicle wheel alignment systems which use electro-optical transducers to determine the toe alignment angles of a vehicle. In these systems, six or more electro-optical transducers are carried by support assemblies which are mounted to the vehicle wheels, two on each front wheel, and one on each rear wheel. The '144 Hunter et al. patent and the '838 Grossman et al. patent further describe and illustrate the various wheel alignment angles which can be directly measured using the electro-optical transducers, and how to compute additional angles from these directly measured angles.
In addition to the electro-optical transducers used to measure wheel angles, a gravity-referenced inclinometer, such as shown in U.S. Pat. No. 4,879,670 to Colarelli may also be used. Gravity-referenced inclinometers can be mounted to the vehicle wheels to provide measurements of the wheel camber angle, assuming that the vehicle, while being measured, is resting on a flat and level surface. SAE Publication No. 850219, entitled “Steering Geometry and Caster Measurement” by January, derives and discusses the industry standard procedures and methods by which toe and camber wheel alignment angle transducers are used to determine the caster and steering axis inclination (SAI) angles of the vehicle.
Equipment of this general type, and the use of the apparatus and method set forth above, is well known in the vehicle wheel alignment industry. Such equipment is capable of determining the camber, caster, and toe alignment angles of the wheels of a vehicle relative to one or more appropriate reference axes, and is sufficient to permit proper adjustment of the vehicle wheel alignment so as to reduce tire wear and provide for safe vehicle handling.
An alternative type of vehicle wheel alignment system which has become increasingly popular is what is commonly referred to as an “external reference aligner”. U.S. Pat. Nos. 4,745,469 and 4,899,218, both to Waldecker et al. illustrate how lasers may be used to illuminate the tires of a vehicle with structured light, and cameras used to capture images of the illuminated tires. These patents further describe how “machine vision techniques” are employed to process the obtained images and to determine distances between the cameras and locations on the tire sidewalls, thereby allowing a determination of the locations and orientations of the vehicle wheels in a coordinate system relative to the cameras. Subsequent processing of the determined locations and orientations identifies conventional wheel alignment angles such as toe, camber, and caster for the imaged vehicle wheels.
German Patent No. DE 29 48 573 A1, assigned to Siemens AG, describes the use of cameras to determine the locations and orientations of the wheels of a vehicle. On one side of the vehicle, a single camera is moved to multiple positions to view the vehicle wheels and obtain multiple images of the known ellipse formed by the wheel rim. Alternatively, a single fixed camera is used at each side of the vehicle in conjunction with movable mirrors, or multiple cameras may be used to obtain the multiple images. The system examines the sets of images of the rim ellipses thus viewed for each of the wheels of the vehicle, identifies major and minor ellipse axes, and subsequently determines the locations and orientations of the wheels. Using this determined information, the conventional wheel alignment parameters are identified.
Continued development in the industry of “external reference aligners” is shown in a series of patents related to U.S. Pat. No. 5,675,515 to January, and in a series of patents related to U.S. Pat. No. 5,535,522 to Jackson. These patents describe and disclose various embodiments of “external reference aligners” and vehicle wheel alignment systems in which optical targets of known configurations having contrasting surfaces are mounted to the wheels of a vehicle undergoing alignment. Images of the known optical targets are obtained by one or more camera systems, and processed to determined relative positions, orientations, and rotational axes in three-dimensional space. From the relative positions, orientations, and rotational axes of the targets, corresponding information about the associated vehicle wheels is calculated, and conventional wheel alignment angles identified.
The optical targets of known configurations employed in conventional “external reference aligner” systems typically consist of high contrast geometric shapes such as circles, squares, or triangles. The accuracy of such an optical target is dependent upon how well the high contrast edge of the geometric shapes can be located in the pixellated image produced by the machine vision camera system observing the target. For the best accuracy, the high contrast geometric shapes must be separated from each other on the face of the target by a distance which is sufficient to prevent the apparent fusing of adjacent shapes into a single shape when reduced edge sharpness causes two shapes to bleed into the same image pixel. These factors combine to limit the number of pixels in an image whose values are utilized to calculate the position and orientation of the optical target to a very small portion of the pixels in the image which represent the target. Typically, only a small percentage of the pixels in the image of a target are used to calculate the position and orientation of a high-contrast optical target.
Accordingly, an increase in performance and functionality of external reference vehicle wheel alignment systems would be greatly beneficial. One possibility for increasing performance and functionality would be to provide a target design which provides a high percentage of useful image pixels for purposes of determining target position and orientation. An alternative improvement would be the elimination of the need for costly known optical targets in a system which is capable of determining the position, orientation, and rotational axes of one or more vehicle wheels directly from images obtained by one or more imaging systems configured to observe and track multiple points on a vehicle wheel without the need for highly precise attached optical targets. |
Without identifying his targets specifically, Mr Hockey said that corporations must be prevented from “diverting profits earned in Australia away from Australia to no-tax or low-tax jurisdictions.” Google, Apple and Microsoft all faced court cases in Australia last month to counter accusation of diverting profits.
It now seems that the national government will implement new measures to crackdown on the firms, with legislation expected to be introduced tomorrow. Although it still has to be passed in parliament, if successful the ruling would have huge impact on the tax paid by large companies. It is expected that the legislation would allow Australia to tax companies on profit diverted offshore.
The bill would not come into effect until January 2016, but mirrors a similar proposal in the UK to generate increased tax revenue.
Chancellor George Osborne announced the so-called Google Tax back in March in the final budget before the general election. The proposal would see companies face a diverted profits tax and is expected to raise £3.1 billion over the next five years in conjunction with other tax laws. |
Stereotactic laser-guided approach to distal middle cerebral artery aneurysms.
The Steiner-Lindquist laser intra-operative guidance method is described and its application in the surgical treatment of mycotic aneurysm is presented. Three illustrative cases of distal middle cerebral artery aneurysms are reported. The authors argue that all ruptured mycotic aneurysms should be treated surgically. The laser-guided stereotactic approach is presented as simple, flexible and reliable method to improve safety and accuracy of the operation in these cases. In our experience it compares favorably with previously described stereotactic techniques. |
Pages
Monday, January 20, 2014
Three of my aunts decided to come down to Vegas to have some fun and workout in the sun! We are very excited to see them. One of my aunts mentioned the long drive is going to take away twelve hours of exercise. Soo I was inspired to give them a car workout. As silly as these exercises may seem, they have great benefit and a huge up from just sitting and slouching that entire time.
Repeat these every hour of your next road trip.
Number one rule: the driver cannot participate. Focus on tightening core and sitting with good posture the entire duration of the workouts. Shoot for the entire drive:).
1. Knee highs. Alternate lifting your knees as high as you can. Do this 30 times each leg.
2. Take arms and push back into chair, holding for thirty seconds. Have arms bent at elbows.
3. With elbows bent like chicken wings, lift arms up to shoulder height and down again thirty times.
4. Thirty upward arm punches each arm.
5. Use opposite arm to resist moving arm as you try to pull it into body. Hold thirty seconds.
Thursday, January 2, 2014
Alright ya'all! If you don't feel like you have time to exercise, these will SAVE your life. There are MANY more of these simple ways to add more movement to your life. These area few to spark your creativity and show you just how easy and good it is for you to do something this little everyday. You will be amazed at the benefits you see. Seriously. Just try one!
I LOVE food and exercise logging. Here is a basic format for all you people starting new goals or just continuing good habits!
FOUR reasons I love logging:
1-It helps you realize what you are putting into your body
2- It helps you focus on getting the good stuff in!
3- It helps you see patterns in your exercising (to help your workouts be extra successful)
4- It is encouraging to look back at them and see all of your awesome work!
*I starred my favorite and most important parts of the logging. Don't skip those boxes!!
NAME:
*GOAL:
Date:
*Time:
Type:
Reps:
Weight:
Distance:
Speed:
*How did you feel:
More exercise details (you can add times to when you eat, make sure to put how much of each food)
About Me
I have a Masters of Science degree from Utah State University in Corporate Wellness and a Bachelors of Science degree in Exercise Science. I have exercised my entire life and LOVE IT!
I love educating people on exercise and helping them meet their goals. I have worked with children, cancer, pregnancy
, heart patients, athletes, along with the general population. |
Karima Rhanem
Karima Rhanem (born September 29, 1979) is a communication and social media specialist, researcher on Governance & Public Policy, journalist and a social activist.
Early Life and Education
Rhanem was born in Rabat city, the capital of Morocco. She gained a bachelor's degree in Languages & Communications Studies from the Institute for Leadership and Communication Studies (2000–2003), Master of Arts in Governance and Public policy from Mohammed V University of Rabat (2010–2012) and Master of Arts in Journalism from Paris School of Journalism (2018–2019). She is the president of the International Center for Diplomacy and co-founder and Director of Strategic Studies Research of the African Network of Youth Policy Experts.
Career
In 2012, she was nominated as Good Will Ambassador by Morocco World News newspaper for exceptional dedication to Morocco's public diplomacy and exemplary representation of Morocco abroad. Rhanem was appointed by board members of the Pan African Humanitarian Summits and Awards as Ambassador and Country Director for the 4th edition of the event heard in Morocco with the theme “Africa is My Home: A call for unity and development (2014). In 2018 she was author of the fifth chapter of the Council of Europe publication Perspectives on youth – Young people in a digitalised world.
Award
On September 28, 2019, she received award at the Africa-Europe Youth Leadership Summit in Banjul, Gambia as one of the 30 most influential young leaders in 2019.
References
Category:Moroccan journalists
Category:Mohammed V University alumni
Category:1979 births
Category:Living people |
*Air: Please note that airfares are not included in the prices above. Trafalgar guarantees to quote you the lowest possible airfare available to us on the day that you book.
Room Share: Guaranteed Room Share is not available on this trip.
This trip is operated in conjunction with our sister company and South Pacific Specialists - AAT Kings and Down Under Tours.
All prices are per person, double share.
For the best savings and to avoid disappointment book early.
Trip prices are per person, land only, based on double occupancy and reflect applicable discount. Discounts are subject to availability and may be withdrawn at any time without notice.
Trip prices are correct at the time of the products going live, however are subject to confirmation at the time of booking. All trip information is correct at time of trips going live, however are subject to change - please confirm all details at time of booking.
Twin-share option not available for trips to South America, Costa Rica, Mexico, Alaska, Hawaii or for any holiday & cruise combination, or in Asia and Eastern Mediterranean except Highlights of Turkey (without cruise) & Best of Turkey. It's also not available on Small Group trips. Guided Vacations included in this restriction are Newfoundland and Labrador (DNLA) as well as Panama, the Canal & Beyond (LPAN).
For trips that are part of our Guaranteed Room Share, please note that there is a no smoking policy in all shared rooms. Solo travel is not accepted on guided Family Experiences holidays unless travelling as part of a family group.
*Air: Please note that airfares are not included in the prices above. Trafalgar guarantees to quote you the lowest possible airfare available to us on the day that you book.
Room Share: Guaranteed Room Share is not available on this trip.
This trip is operated in conjunction with our sister company and South Pacific Specialists - AAT Kings and Down Under Tours.
All prices are per person, double share.
For the best savings and to avoid disappointment book early.
Trip prices are per person, land only, based on double occupancy and reflect applicable discount. Discounts are subject to availability and may be withdrawn at any time without notice.
Trip prices are correct at the time of the products going live, however are subject to confirmation at the time of booking. All trip information is correct at time of trips going live, however are subject to change - please confirm all details at time of booking.
Twin-share option not available for trips to South America, Costa Rica, Mexico, Alaska, Hawaii or for any holiday & cruise combination, or in Asia and Eastern Mediterranean except Highlights of Turkey (without cruise) & Best of Turkey. It's also not available on Small Group trips. Guided Vacations included in this restriction are Newfoundland and Labrador (DNLA) as well as Panama, the Canal & Beyond (LPAN).
For trips that are part of our Guaranteed Room Share, please note that there is a no smoking policy in all shared rooms. Solo travel is not accepted on guided Family Experiences holidays unless travelling as part of a family group.
On arrival at Cairns Airport you will be transferred to your hotel in Port Douglas (flights anytime). The remainder of the day is free for you to explore this resort town.
Hotel
QT Port Douglas
Meals
Hotel
QT Port Douglas
Meals
Day 1
Day 2
Great Barrier ReefDay 2 - Great Barrier Reef
Board a wavepiercing catamaran and cruise out to Agincourt Reef at the very edge of Australia's Continental Shelf, to experience first-hand the magic that is the Great Barrier Reef. You can snorkel (equipment provided) or stay dry and explore the stunning reef from the comfort of a semi-submersible craft, just one metre underwater. Watch the fish feeding from the unique underwater viewing platform and observatory. Enjoy a delicious hot and cold tropical buffet lunch before returning to Port Douglas.
Visit the award-winning Tjapukai Aboriginal Cultural Park, where the legends of the Dreamtime are brought to life. Learn about this ancient culture through theatres, stage shows and demonstrations. Later, travel from the lowlands on the Skyrail Rainforest Cableway, which takes you above the canopy of Barron Gorge National Park. On arrival in Kuranda, there is free time to take a stroll through the Kuranda Markets. Board the famous Kuranda Scenic Railway and enjoy a breathtaking trip on one of the world's most scenic rail journeys.
Meals
Buffet Breakfast
Meals
Buffet Breakfast
Day 3
Day 4
Depart Port DouglasDay 4 - Depart Port Douglas
You will be transferred from Port Douglas to Cairns Airport to connect with your onward flight (flights anytime).
Meals
Buffet Breakfast
Meals
Buffet Breakfast
Day 4
Available Departures
Please see http://www.trafalgar.com:80/can/tours/tropical-reef-and-rainforest for the latest discounts & departure information.
The Trafalgar Experience
Simply Authentic
Enjoy
Enjoy the wonder of travel, crisscrossing the globe through the seasons. On effortless adventures in breathtaking new horizons, forge lifelong friendships and memories. Our lovingly crafted itineraries are a fascinating mosaic of cultures, flavours, festivals and local stories. We’re with you all the way, guiding you and ensuring you experience the real thing: the sheer love of travel, entirely hassle-free.
Simply Authentic
Love... Travel
"Is simply the best way to position what our guests love to experience and what we love to deliver" - Gavin Tollman CEO
Simply Authentic
Meet
Meet warm-hearted locals and like-minded travellers. Along your journey of discovery, stop to share stories and flavours with local farmers, chefs and winemakers. Pause to admire the handicrafts and rich traditions of amazing artisans. Explore the essence of Europe through captivating accounts shared by expert historians and savvy local guides.
Simply Authentic
Taste
Travelling with your tastebuds, treating them to new flavours, spices and textures along the way. From the very first breakfast to the last nightcap, travelling through Europe indulges your palate, with every meal an opportunity to discover regional fare. Savour each new flavour, try the local tipple and take home fresh culinary inspiration. Let us share our love for food and hospitality with you.
Simply Authentic
Unwind
Once you've packed your suitcase, we take care of the rest, removing all your concerns so that you can be secure in the knowledge that an award-winning global company with an impeccable reputation has taken care of every little detail. We arrange everything you'll need along your journey - meals, accommodation and travel logistics, because we are with you all the way. Travel the world with peace of mind, knowing you’re in the hands of Trafalgar.
Guest Reviews and Ratings
Service rating : Fun experiences, memorable activities. We were a little unsure about the rainforest trip, being left on our own, but once we started at the indigenous culture center, everything was easy and very enjoyable.Product : Great day snorkeling at the reef. Took the guided tour, and |
Dankuni Junction railway station
Dankuni is a railway junction station on the Howrah-Bardhaman chord and is located in Hooghly district in the Indian state of West Bengal. It is linked with both Howrah and Sealdah.
History
The Howrah–Bardhaman chord, a shorter link to Bardhaman from Howrah than the Howrah–Bardhaman Main Line, was constructed in 1917. In 1932, the Calcutta chord line was built over the Willingdon Bridge joining Dum Dum and Dankuni.
Electrification
Howrah–Bardhaman chord was electrified in 1964–66.
Diesel Loco Component Factory
Trial production has started in the Diesel Component Factory at Dankuni. Built at a cost of Rs. 84.21 crores, it was inaugurated by Mamata Banerjee, Chief Minister of West Bengal on 28 May 2012. The components manufactured are being supplied to Diesel Locomotive Works.
Electric Loco Component Factory
Construction of the Rs. 270.77 crore Electric Loco Component Factory is in progress.
Dankuni Freight Yard
A project is on to remodel the Dankuni Goods Yard and develop it as Dankuni Freight Yard. It will be a multi-purpose freight terminal that would consolidate the entire freight movement in one place. It will ease the load of Howrah, Sealdah, Shalimar and Chitpur yards.
Dedicated Freight Corridor
The 1839 km long eastern dedicated freight corridor has been proposed from Dankuni to Ludhiana.
References
External links
Trains to Howrah
Trains to Sealdah
Category:Railway stations in Hooghly district
Category:Howrah railway division
Category:Kolkata Suburban Railway |
Human papillomavirus (HPV) 6, 11, 16, and 18 prevalence among females in the United States--National Health And Nutrition Examination Survey, 2003-2006: opportunity to measure HPV vaccine impact?
The 2003-2006 National Health and Nutrition Examination Surveys were used to assess human papillomavirus (HPV) types 6, 11, 16, and 18 DNA detection from females aged 14-59 years who self-collected cervicovaginal swab specimens. Prevalence was 8.8% (95% confidence interval [CI], 7.8%-10.0%) and was highest among women aged 20-24 years (18.5%; 95% CI, 14.9%-22.8%). Age group, education, marital status, and sexual behavior were associated with detection. These data provide baseline information before HPV vaccine introduction. Early impact of vaccine in the United States may be determined by a reduction in the prevalence of HPV 6, 11, 16, and 18 infection among young women. |
Odorrana utsunomiyaorum
Odorrana utsunomiyaorum is a species of frog in the family Ranidae. It is endemic to Ryukyu Archipelago, Japan, and is known from the islands of Ishigaki and Iriomote, both in the Yaeyama Group. The specific name utsunomiyaorum honours Taeko and Yasuaki Utsunomiya for their contributions to clarifying the amphibian fauna of the Yaeyama Group.
Description
Adult males measure and adult females in snout–vent length. The body is moderately stout with triangular head. The snout is obtusely pointed in dorsal view but rounded in profile. The tympanum is distinct. The fingers are unwebbed and have small discs. The toes have well-developed webbing and discs that are slightly smaller than the discs of the outer fingers. The dorsolateral fold is weakly developed and supratympanic fold is absent. The dorsum is scattered with numerous tubercles. Dorsal ground colour varies from light brown to greenish brown. The back has some dark blotches. There are dark markings below the canthus, around the tympanum, and along the dorsolateral fold. The limbs have dark, incomplete crossbars. Males have paired subgular vocal sacs.
On both Ishigaki and Iriomote, Odorrana utsunomiyaorum is sympatric with Odorrana supranarina, a "giant" species in relative terms. As O. utsunomiyaorum is a "dwarf" species, it appears that the body sizes of these two species have undergone divergent evolution, perhaps in response to competition.
Habitat and conservation
Odorrana utsunomiyaorum inhabits broad-leaved evergreen forests along mountain streams. Where Odorrana supranarina is present, this species tends to occupy smaller streams. Breeding takes place in late February–April in shallow streams. The eggs are attached to stones under the water.
The species has a small and fragmented range. Habitat loss and degradation caused by deforestation is a major threat. Iriomote is a national park, but improved protection of its forest habitats is still needed. It also suffers from competition with the introduced cane toads (Rhinella marina).
References
utsunomiyaorum
Category:Amphibians of Japan
Category:Endemic fauna of Japan
Category:Amphibians described in 1994
Category:Natural history of the Ryukyu Islands
Category:Taxonomy articles created by Polbot |
ers picked without replacement from {p: 4, n: 1, k: 2, a: 3}.
2/15
What is prob of picking 2 s and 2 i when four letters picked without replacement from isiiiiisissssiisiiss?
132/323
Two letters picked without replacement from {g: 1, j: 11}. Give prob of picking 2 j.
5/6
Four letters picked without replacement from {b: 3, d: 2, z: 3}. What is prob of picking 1 d and 3 b?
1/35
Three letters picked without replacement from {a: 1, s: 4, f: 1, u: 1, t: 6, b: 3}. What is prob of picking 1 a, 1 t, and 1 u?
3/280
Two letters picked without replacement from rnkkkkkhhrrhhnk. What is prob of picking 2 k?
1/7
Calculate prob of picking 3 f and 1 e when four letters picked without replacement from fxtxtftfexff.
2/99
Three letters picked without replacement from {h: 2, j: 3, b: 4}. What is prob of picking 2 b and 1 h?
1/7
Three letters picked without replacement from sgxeqcx. Give prob of picking 1 e, 1 q, and 1 x.
2/35
Four letters picked without replacement from {z: 10}. Give prob of picking 4 z.
1
What is prob of picking 1 o and 2 p when three letters picked without replacement from {r: 1, p: 3, o: 4}?
3/14
Three letters picked without replacement from {e: 6, n: 3, q: 3, r: 3, w: 1}. What is prob of picking 1 n, 1 r, and 1 q?
27/560
Four letters picked without replacement from {j: 2, x: 9}. What is prob of picking 4 x?
21/55
Calculate prob of picking 1 w, 1 p, 1 s, and 1 i when four letters picked without replacement from {s: 5, p: 4, i: 1, a: 3, w: 1}.
20/1001
What is prob of picking 2 o and 2 d when four letters picked without replacement from {o: 3, d: 2}?
3/5
Calculate prob of picking 1 f and 1 h when two letters picked without replacement from ibhhzrf.
2/21
What is prob of picking 4 d when four letters picked without replacement from {d: 4}?
1
What is prob of picking 1 b and 2 f when three letters picked without replacement from {b: 13, f: 5}?
65/408
Two letters picked without replacement from {d: 1, j: 5, f: 3}. What is prob of picking 2 f?
1/12
Two letters picked without replacement from xxurdprddpidxxxpixp. Give prob of picking 1 p and 1 r.
8/171
Two letters picked without replacement from {q: 2, m: 2, h: 4, t: 1, e: 1}. What is prob of picking 1 e and 1 h?
4/45
Calculate prob of picking 2 t and 1 c when three letters picked without replacement from {c: 1, t: 13, u: 3}.
39/340
Two letters picked without replacement from wwbfwbbnwb. Give prob of picking 1 f and 1 n.
1/45
Two letters picked without replacement from oploopo. What is prob of picking 2 o?
2/7
Calculate prob of picking 2 z when two letters picked without replacement from mmhmmezmzmhmhme.
1/105
Calculate prob of picking 2 o and 2 y when four letters picked without replacement from oooqoyjoooqjoqyoyyyj.
24/323
Calculate prob of picking 4 b when four letters picked without replacement from bbbbjbbbjjbbbjbbbbbj.
91/323
What is prob of picking 1 n and 1 t when two letters picked without replacement from {i: 1, n: 1, w: 1, u: 1, t: 1}?
1/10
Calculate prob of picking 1 g and 2 u when three letters picked without replacement from {u: 2, q: 3, r: 3, g: 1, a: 3, w: 3}.
1/455
What is prob of picking 1 r, 1 y, and 1 j when three letters picked without replacement from jirijjy?
3/35
What is prob of picking 1 q and 1 e when two letters picked without replacement from qqsqssseqq?
1/9
Three letters picked without replacement from wwjjjjjwjwjww. What is prob of picking 3 w?
10/143
Two letters picked without replacement from {f: 6, g: 6, o: 7, p: 1}. What is prob of picking 1 g and 1 p?
3/95
Calculate prob of picking 1 a and 1 u when two letters picked without replacement from {u: 1, a: 1, n: 3}.
1/10
Two letters picked without replacement from hhhhhh. What is prob of picking 2 h?
1
Calculate prob of picking 2 q when two letters picked without replacement from {q: 3, r: 1}.
1/2
What is prob of picking 1 o and 1 f when two letters picked without replacement from {o: 2, f: 3, m: 3, z: 1, c: 1}?
2/15
Four letters picked without replacement from ccddlllcdcllllclc. Give prob of picking 1 d, 2 l, and 1 c.
18/85
Four letters picked without replacement from {q: 1, j: 4, b: 9}. What is prob of picking 4 b?
18/143
Three letters picked without replacement from {c: 6, f: 4}. What is prob of picking 2 c and 1 f?
1/2
Three letters picked without replacement from {u: 11, p: 5}. Give prob of picking 2 p and 1 u.
11/56
Calculate prob of picking 3 r when three letters picked without replacement from {v: 2, r: 3}.
1/10
Two letters picked without replacement from dvqdvtzy. What is prob of picking 1 t and 1 z?
1/28
Three letters picked without replacement from {x: 6, y: 4, q: 2}. Give prob of picking 2 q and 1 x.
3/110
Three letters picked without replacement from hnnnsupsnss. What is prob of picking 2 s and 1 p?
2/55
What is prob of picking 1 f and 1 h when two letters picked without replacement from fbffbbbbbfbfhffbf?
1/17
Two letters picked without replacement from oxoxoxeoo. What is prob of picking 1 o and 1 x?
5/12
What is prob of picking 1 y and 1 b when two letters picked without replacement from {x: 1, b: 1, a: 1, e: 1, y: 1}?
1/10
Calculate prob of picking 1 e and 3 o when four letters picked without replacement from kkkozokomekokkook.
1/119
Four letters picked without replacement from nrnrnnnrnnnnnnrnrn. What is prob of picking 3 r and 1 n?
13/306
What is prob of picking 1 f and 1 r when two letters picked without replacement from {f: 1, m: 1, y: 1, i: 1, r: 1}?
1/10
Three letters picked without replacement from {c: 5, e: 8, d: 5}. What is prob of picking 1 c and 2 d?
25/408
Four letters picked without replacement from {d: 10, y: 4}. Give prob of picking 4 d.
30/143
Three letters picked without replacement from cojcccnocoocojjjjjco. Give prob of picking 1 c, 1 n, and 1 o.
7/190
What is prob of picking 1 e and 1 v when two letters picked without replacement from zzefevzfefz?
3/55
Calculate prob of picking 2 c when two letters picked without replacement from {c: 6, g: 6}.
5/22
Two letters picked without replacement from {m: 1, b: 3, o: 2, c: 1}. What is prob of picking 1 o and 1 b?
2/7
Calculate prob of picking 1 a and 1 v when two letters picked without replacement from vaavallaaaalaala.
1/6
What is prob of picking 2 e and 2 r when four letters picked without replacement from eeieieeir?
0
Four letters picked without replacement from ppypq. Give prob of picking 2 q and 2 y.
0
What is prob of picking 1 d and 1 v when two letters picked without replacement from {h: 1, v: 2, d: 1, m: 1}?
1/5
Calculate prob of picking 3 z when three letters picked without replacement from {z: 4}.
1
Two letters picked without replacement from {q: 1, e: 3, o: 9, k: 5}. What is prob of picking 1 o and 1 e?
3/17
Calculate prob of picking 1 r and 1 b when two letters picked without replacement from rbyppyrnnhprpr.
4/91
What is prob of picking 3 h and 1 y when four letters picked without replacement from yyyyhyhhhyhyyyyhhyy?
35/323
Calculate prob of picking 2 a when two letters picked without replacement from kkkkakkakkkkakkkkk.
1/51
Three letters picked without replacement from siiisissiiissmi. What is prob of picking 2 i and 1 m?
4/65
What is prob of picking 2 i and 1 n when three letters picked without replacement from {w: 1, i: 2, a: 3, n: 3, j: 2, q: 4}?
3/455
What is prob of picking 2 h and 1 t when three letters picked without replacement from ttttttthhhthtththth?
84/323
Three letters picked without replacement from {o: 3, y: 11, s: 1, h: 2, i: 1}. Give prob of picking 1 s, 1 o, and 1 h.
1/136
Three letters picked without replacement from feeqveeffffffe. What is prob of picking 1 q, 1 v, and 1 e?
5/364
Calculate prob of picking 1 c and 1 p when two letters picked without replacement from ciccpipipip.
12/55
Three letters picked without replacement from {l: 4, f: 2, i: 3, h: 10}. What is prob of picking 3 i?
1/969
Calculate prob of picking 1 l and 2 z when three letters picked without replacement from ppmpztplpztmppp.
1/455
What is prob of picking 3 e and 1 b when four letters picked without replacement from eeeeeeeeeeeebeeeeee?
4/19
What is prob of picking 1 d, 1 f, and 1 c when three letters picked without replacement from {c: 4, v: 5, f: 4, d: 2}?
32/455
What is prob of picking 2 w and 2 m when four letters picked without replace |
Jerusalem Embraces Immigrants at 'The Event'
Arutz Sheva was on the scene Thursday at The Event in Jerusalem's ICC (International Convention Center) Building, an event aimed at helping the English and French immigrant community overcome the language barrier and better integrate into life in Israel.
Jerusalem Mayor Nir Barkat told Arutz Sheva that the annual event continues to grow remarkably, a process that testifies to the fact that Jerusalem is "starting to have a critical mass of immigrants from French and English speaking countries." |
NGC 3312
NGC 3312 is a large and highly inclined spiral galaxy located about 194 million light-years away in the constellation Hydra. The galaxy was discovered by astronomer John Herschel on March 26, 1835. It was later rediscovered by astronomer Guillaume Bigourdan on February 26, 1887. NGC 3312 was later listed and equated with IC 629 because the two objects share essentially the same celestial coordinates. NGC 3312 is the largest spiral galaxy in the Hydra Cluster and is also classified as a LINER galaxy.
Physical characteristics
NGC 3312 appears to be highly distorted with sharp dust lanes. There are sharp filamentary extensions to the north and an internal ringlike structure in the galaxy. The interstellar matter in the galaxy also appears highly disturbed. These features caused astronomer De Vaucouleurs to suggest that NGC 3312 was distorted by the giant elliptical galaxies NGC 3309 and NGC 3311 which are the dominant ellipticals in the Hydra Cluster. However, NGC 3309 and NGC 3311 are too distant and their relative velocity differences too large for either elliptical to cause the filamentary extensions observed in NGC 3312. It is more likely that NGC 3312 is interacting with the intracluster medium causing ram-pressure stripping which is stripping the interstellar medium of the galaxy. This may have caused the filamentary extensions observed in NGC 3312 as evidenced by the location of the galaxy near near the cluster core.
Star formation
Although NGC 3312's morphological structure resembles that of Anemic galaxies, its mean surface-brightness profile hints that star formation may be quite active. The northwest filamentary extension from NGC 3312 has high surface brightness and has the knotted texture characteristic of active star-forming regions in spiral arms. Also, the internal dust lane of NGC 3312 is ringed with bright condensations.
Radio source
NGC 3312 contains an unresolved strong radio source in its core with a strength of 27 mJy and radio emission in the disk with a strength of 24 mJy mostly being confined to the spiral arms of the galaxy or regions of star formation.
See also
List of NGC objects (3001–4000)
Messier 90
NGC 4921
References
External links
Category:Hydra Cluster
Category:Hydra (constellation)
Category:Peculiar galaxies
Category:LINER galaxies
Category:Spiral galaxies
3312
31513
Category:IC objects
Category:Astronomical objects discovered in 1835
Category:Discoveries by John Herschel |
Kratom Herb Store Cross
USA Shipping takes 5-10 days. Store kratom legal turkey owners can order from our wholesale website by Clicking the wholesale link to the left. Kratom Herb Store Cross copyright 2009-2012 www. All rights reserved. Kratom Leaf is also known as Mitragyna Speciosa which is a tree related to coffee as well as native to the country of Thailand. Originally the Kratom leaves were picked from their tree and chewed. The plant was studied first by Pieter Korthals a Dutch botanist during 1830s.
This is Kratom Herb Store Cross the reason why this is better to be taken through mouth. Another simple yet famous way of using Kratom crushed leaf is brewing this into your tea. You can add Kratom crushed leaf or powder to a pot of water and boil it.
It is not necessary however when great substitutes abound (caff. Victor Pride kratom resin smoke (boldanddetermined. This stuff probably works great no doubt. I worry about the longterm dependency effects. Just googling Kratom red riau kratom review alice withdrawal brings up massive results. So for me I will stay away from this one.
I still have some so I will give it another try with this recipe Sunday. I occasionally used some Kratom extracts from a trusted source it was intense but now this detailed page about tolerance and rotation explains why my recent trial has likely gone flat. ADD and apnea issues.
V contains less of the principle alkaloids. By removing a weaker part of the leaf we greatly increase the kratom withdrawal pain overall alkaloid profile of the finished product. The premium kratom is Kratom Herb Store Cross compressed into 12.
As far as I know Kratom is not illegal in kratom tea capsules Germany but sellers must tell clients that it is not fit for human consumption (legal disclaimer). Thanks for the information on Kratom. States to be honest).
Louisiana also tried this with bill 73. If you live in indiana or your state
You may also place the leaves into the pepper mill. You can also shop for a new one for this purpose for you to avoid confusion with other spices. A blender or a food processor may also do the trick.
Some have solid pain killing effect. It really varies. I Kratom Herb Store Cross suggest people read up on Kratom (from independent sources) but people also need to take it with a kratom 15x dosering grain of salt because most kratom on the market <img Kratom Herb Store Cross src=’https://scontent.cdninstagram.com/hphotos-xaf1/t51.2885-15/e15/11330622_1617897655156998_1198767064_n.jpg’ alt=’Kratom Herb Store Cross’> is LOUSY. Good Kratom however is nothing sort of amazing. It just depends on the source.
If you find that it doesnt get you to the level that you want then you can add more or try a different extract. I would get some enhanced leafweigh it and make it into a tea (it absorbes in your blood fasterrather than eating it. Did enjoy tea made from some extract leaf powder.
You can also shop for a new one for this purpose for you to avoid confusion with other spices. A blender or a food processor may also do the trick. Just ensure that the powder will not stick on the blades. Once done with your Kratom crushed leaf you can use it in various ways. You can eat it as it is but you need to keep in mind that this can have a bitter taste.
Felt disorganized in a way. As if my works quantity went up but the quality went down. I had an overspill accident on my scale one day and used 15 grams. That day I definitely felt high (I assume never been high before). Test bloats I want to be dry as a bone so I dropped the test. I will be August 4th. |
Photo gallery
Visitors' experience
"When I was a child I used to come in camp Mina with my parents. Beautiful beaches, clear sea, hospitable camp staff and reasonable prices are the reasons that I've been coming here for years" - Jan Novak |
Background
==========
Recent reports suggest that within the heterogeneous population that constitutes a melanoma, certain cell types exhibit molecular and functional features similar to stem cells. These melanoma-initiating cells (MICs) have the ability of unlimited self-renewal, multilineage differentiation and the potential to initiate and maintain tumor growth \\[[@B1]\\]. Furthermore, MICs are believed to confer chemoresistance to conventional chemotherapeutic agents and newly developed molecularly-targeted drugs \\[[@B2],[@B3]\\]. Therefore, defining the molecular and biochemical pathways that support MICs is of critical importance for the development of more efficient targeted therapies. We have previously shown that the HEDGEHOG (HH) signaling is required for melanoma growth \\[[@B4]\\] and for survival and expansion of MICs \\[[@B5]\\]. Here we investigate the mechanism by which inhibition of the HH signaling leads to a decrease of MIC stemness, addressing the role of the transcription factor SOX2.
Materials and methods
=====================
MICs were enriched by Fluorescence Activated Cell Sorting using the metabolic marker Aldehyde Dehydrogenase (ALDH) and by establishing melanoma spheres in non-adherent culture conditions from 20 human melanomas. Expression of SOX2 and of HH pathway components was determined by real time PCR and Western blot analysis. Modulation of the HH signaling was performed by stable expression of lentiviral vectors encoding short-interference RNAs specific for SMO or GLI1 (to inhibit HH), and PTCH1 (to activate HH). Functional analysis of SOX2 was performed by stable overexpression and silencing using lentiviral vectors.
Results
=======
We find that the HH signaling regulates the expression of SOX2 and the downstream effectors of the HH signaling, the transcription factors GLI1 and GLI2, bind to *SOX2* promoter in melanoma cells. Functionally, we show that SOX2 is required for HH-induced melanoma cell growth and MIC self-renewal. We present evidence that SOX2 is highly expressed in a population enriched for cancer stem cells in patient-derived melanomas. Knock-down of SOX2 sharply decreases self-renewal of melanoma spheres and of ALDH^high^ melanoma stem cells. Consistently, ectopic expression of SOX2 in melanoma cells is sufficient to enhance stemness *in vitro.* SOX2 silencing also inhibits cell growth and induces apoptosis in melanoma cells. Most importantly, depletion of SOX2 drastically impairs tumorigenicity of ALDH^high^ MICs in orthotopic xenografts.
Conclusion
==========
Our data identify SOX2 as a novel mediator of the HH signaling in melanoma cells and indicate that SOX2 is a critical factor for the survival of MICs. These findings could provide the basis for novel therapeutic strategies based on the inhibition of SOX2 for the treatment of human melanomas.
|
Development of the Music Therapy Assessment Tool for Advanced Huntington's Disease: A Pilot Validation Study.
Case studies of people with Huntington's disease (HD) report that music therapy provides a range of benefits that may improve quality of life; however, no robust music therapy assessment tools exist for this population. Develop and conduct preliminary psychometric testing of a music therapy assessment tool for patients with advanced HD. First, we established content and face validity of the Music Therapy Assessment Tool for Advanced HD (MATA-HD) through focus groups and field testing. Second, we examined psychometric properties of the resulting MATA-HD in terms of its construct validity, internal consistency, and inter-rater and intra-rater reliability over 10 group music therapy sessions with 19 patients. The resulting MATA-HD included a total of 15 items across six subscales (Arousal/Attention, Physical Presentation, Communication, Musical, Cognition, and Psychological/Behavioral). We found good construct validity (r ≥ 0.7) for Mood, Communication Level, Communication Effectiveness, Choice, Social Behavior, Arousal, and Attention items. Cronbach's α of 0.825 indicated good internal consistency across 11 items with a common focus of engagement in therapy. The inter-rater reliability (IRR) Intra-Class Coefficient (ICC) scores averaged 0.65, and a mean intra-rater ICC reliability of 0.68 was obtained. Further training and retesting provided a mean of IRR ICC of 0.7. Preliminary data indicate that the MATA-HD is a promising tool for measuring patient responses to music therapy interventions across psychological, physical, social, and communication domains of functioning in patients with advanced HD. |
Dionysius Koolen
Dionysius Adrianus Petrus Norbertus Koolen (21 January 1871 – 24 March 1945) was a Dutch politician of the defunct Roman Catholic State Party (RKSP), later formed to the Catholic People's Party (KVP) now merged into the Christian Democratic Appeal (CDA).
He was a member of the General League of Roman Catholic Caucuses and its continuation, the Roman Catholic State Party. He was a member of the House of Representatives of the Netherlands from 1905 until 1925, when he became minister of Labour, Trade and Industry, which was a single ministry at the time. He was speaker of the House of Representatives of the Netherlands in the period from 14 October 1920 to 5 August 1925. After being a minister he became a member of the Council of State.
Decorations
References
External links
Official
Mr.Dr. D.A.P.N. Koolen Parlement & Politiek
Category:1871 births
Category:1945 deaths
Category:Commanders of the Order of the Netherlands Lion
Category:Dutch academic administrators
Category:Dutch judges
Category:Dutch jurists
Category:Dutch prosecutors
Category:Dutch Roman Catholics
Category:Knights Grand Cross of the Order of St Gregory the Great
Category:Members of the Council of State (Netherlands)
Category:Members of the House of Representatives (Netherlands)
Category:Ministers of Economic Affairs of the Netherlands
Category:Ministers of Social Affairs of the Netherlands
Category:People from Rijswijk
Category:People from Utrecht (city)
Category:People from Voorschoten
Category:Speakers of the House of Representatives (Netherlands)
Category:Utrecht University alumni
Category:19th-century Dutch civil servants
Category:19th-century Dutch educators
Category:19th-century Dutch lawyers
Category:20th-century Dutch civil servants
Category:20th-century Dutch educators
Category:20th-century Dutch lawyers
Category:20th-century Dutch politicians |
Q:
Integrate an Android app (.apk) into an existing Android project
Here's the use case:
A friend and I are building an Android app and along with it want to integrate a game. The core of the app has been built in Eclipse but we are looking into building the game with an app building tool like Google AppInventer (http://appinventor.googlelabs.com/about/) or Corona (http://www.anscamobile.com/corona/). We'd like the existing app we've built to have a button like "Play Game" which will launch the game we build using one of these utilities.
However when I messed around with Google App Inventor I noticed that I could only export the project as a .apk, which are binary files. Ideally, I'd build the app in AppInventor, export the source code and add the package to our existing project in Eclipse. Well, it's not that easy since we only have access to a .apk file. So my question is can this be done? How?
Some have suggested using an apk decompiler, but would this even be worth it? Are there any good apk decompilers that will give us access to some source code (java files, xml files, resources) without too big of a headache? Is there another tool out there that can export source code? Any other way to integrate 2 separate .apks?
Or will we need to build 2 separate apps? :(
A:
A project written in App Inventor cannot be exported into Eclipse.
The created .apk file is not a binary file. It is a ZIP archive of several files and folders, but none of them is java code.
What can be done to combine an App Inventor app with an app created with Android SDK is to make use of the ActivityStarter component inside App Inventor. Details on that are here:
http://appinventor.googlelabs.com/learn/reference/other/activitystarter.html
Finally, keep in mind that App Inventor apps cannot be uploaded directly to the Market. However, some users have created a process that allows to do that, it is called Marketizer.
If you spend some time reading posts from this forum: programming-with-app-inventor (it is a Google Groups forum), you might get even better ideas.
|
Jayalalithaa’s niece launches MGR Amma forum
An AIADMK supporter at a function organised on the occasion of J. Jayalalithaa’s 69th birth anniversary at R.K. Nagar in Chennai on Friday. All three factions of the AIADMK headed by V.K. Sasikala, O. Panneerselvam and Deepa Jayakumar celebrated the occasion by distributing freebies across the state. (Photo: PTI)
Chennai: Late J. Jayalalithaa’s niece Deepa Jayakumar launched a new political forum while rival factions in ruling AIADMK provided welfare assistance across Tamil Nadu the late Chief Minister’s 69th birth anniversary on Friday in an escalating fight for her legacy.
As a war of words broke out, the state government led by Chief Minister Edappadi K. Palanisami, his predecessor and dissident leader O. Pannee-rselvam and AIADMK, observed the birth anniversary of the Jayalalithaa in different ways including holding of medical camps and planting of saplings.
Addressing a crowded press conference at her home, Deepa declared that her political journey had “begun” and unveiled a flag depicting the images of Jayalalithaa and M.G. Ramachandran which she said was a flag of the Forum named as ‘MGR AMMA Deepa Forum’.
Responding to a query, Deepa said the people desired that she contest from RK Nagar constituency that fell vacant following the demise of the late AIADMK supremo.
Deepa said she has been receiving several requests to enter politics and Friday’s announcement was to respect their wishes.
Deepa, who will be the treasurer of the Forum, said her next course of action would be decided in due course and she would reveal it at the “appropriate time”.
Meanwhile, in a veiled attack on Panneerselvam, AIADMK general secretary V.K. Sasikala, who is lodged in a Bengaluru prison, said, “When enemies and traitors wanted to defeat the party and the government, Amma’s soul guided us and has put up the AIADMK government in the seat of power.”
“Let us vow to protect the party, and work for the people,” she said in her letter published in Friday’s edition of party mouthpiece.
Panneerselvam hit out at Sasikala and her family without naming her for trying to take over the party against Amma’s (Jayalalithaa) wishes.
“Dharma Yudham will continue (to retrieve the party and government),” he said and reiterated his demand for a judicial inquiry into the circumstances surrounding the death of Jayalalithaa.
Paying floral tributes to Jayalalithaa, Panneersel-vam gave away welfare assistance to the people at Tondiarpet in North Chennai. Palanisami planted a sapling at the Omandurar Government Estate here marking the launch of a drive to plant 69-lakh saplings. |
Private benefits of control
Private benefits of control is a technical term used by corporate lawyers and economists. It refers to the economic gain from exerting influence on a company by large shareholders at the expense of small shareholders.
Types
There are two different types of private benefits of control from company value perspective: Benefits which reduce the value of company and which do not so. An example was given by Barclay and Holderness, in comparison to benefits that accrue to all shareholders by raising the productivity of the company.
Protection
In order to prevent the impact on the small shareholders from the realization of these benefits of large shareholders, there is usually a Mandatory Offer policy in transaction area for protection of the small shareholders from kinds of value-destroying transactions.
See also
Corporate governance
Control premium
Mandatory Offer
Notes
References
MJ Barclay and CG Holderness, 'Private Benefits of Control in Public Corporations' (1989) 25 Journal of Financial Economics 371
Category:Shareholders |
Q:
Is it a requirement to add NOT NULL when defining a column with IDENTITY(1, 1) key word?
The way I understand it, IDENTITY (1, 1) means that we won't provide any data for that column. Sql Server will, adding each time 1 to the value of the previously created row.
why not this
CREATE TABLE MyTable
(
MyTableID INT IDENTITY(1, 1) PRIMARY KEY
)
but rather this
CREATE TABLE MyTable
(
MyTableID INT NOT NULL IDENTITY(1, 1) PRIMARY KEY
)
Why should I add NOT NULL on the definition of such a column? Is that implies that Sql Server could generate NULL values??
Thanks for helping
A:
It's optional in this case.
Irrespective of the setting of ANSI_NULL_DFLT_ON / ANSI_NULL_DFLT_OFF the column that will be added will not be NULL-able.
You would get an error if you were to try and explicitly set an IDENTITY column (or one participating in a primary key constraint) to allow NULL.
|
This book review was taken from the Shivian Times. It was written by Cornelius Underwood
Rabriah 19th 1885
For the Next Killer Who Dies is the memoir of KLA terrorist Kingsley Montivelo. What could be an interesting retrospective inside the mind of a Killer, is, instead, a melodramatic and inaccurate bit of propaganda. It disrespects our great nation by attempting to justify tragic events in Shivian history such as the Archive Bombings and the Calais Prison Riot. Still, it isn’t a complete waste of your time. There are some adequate bits of writing, commendable even, despite that it is an over ripe book of errors.
From start to finish the story goes out of the way to cast Shivian police officers in a bad light. Executions, torture, stalking those of the female persuasion, beatings and uncharacteristic bigotry. In addition, there are inaccurate details of the police being far too militaristic. For instance, the “Armored Squad,” featured is somewhat of an anachronism because the police were not so advanced until much later then the time the book is set. There are repetitive and severe moments of stark violence to secure that the Killer’s are not villains themselves, but victims of fascistic, uniformed police officers. The scene when Kingsley, during a midday stroll, watches two thieves brutally murdered before his eyes, such a thing wasn’t done. An agent of the law never over-extended his use of force, not even to Killers, unless justifiably needed. I wouldn’t go as far to say that there weren’t incidents. Killers are well known to appear threatening, given they have claws, scales and a general likeness to the Stone Dragons, I think there’s room for some leniency.
Most of the organization of the KLA is made up of young adults, suggesting their parents had no qualm of setting their futures with self-sacrificing notions, filling their ranks with innocent children unprepared for maiming and killing citizens. There is a relevant and psychological toll for all the characters resulting in unrestrained temperaments and thoughts of inadequacy. One tragedy after another builds the book up to be far too depressing for modern readers. This theme of fruitlessness in the book is somewhat contradictory to the overall message; for it is presumed that if the Killers would want to gain sympathy wouldn’t they always show that their cause is just? One such character is Asia Cavanaugh, following in her father’s footsteps, an old surly criminal proudly wearing his prison bar code along his chest. What message has she for the more susceptible minds in our society? There are startlingly too few characters of the opposite sex. The only one morally decisive character would be Aimee Cranston, carrying out peaceful protests and doing her ilk proud.
Overall, parents should refrain their children from picking it up. It potentially could run a risk of corrupting our youth with dreams of theatric romance fueled by an angry disposition to the law. |
Q:
Лагает пользовательский интерфейс
Никак не могу найти нужной мне информации:
есть приложение на android, - на activity размещено много элементов ImageView. Как можно добиться использования меньшей памяти приложением, при большом количестве картинок (формат png)?
A:
Попробуйте их отображать через библиотеку Glide. Так же может помочь уменьшение размеров картинок + разбиаение их на размеры под разные плотности экранов. Так на мальних плотностях будут использоваться маленькие картинки и памяти они будут меньше отъедать
|
Q:
chosen jquery plugin for multiselect list not showing value in edited form
I m using chosen jquery plugin for multiselect list.my problem is it is not showing selected value in edited form.
my controler code is
ArrayList selectedrole = new ArrayList();
foreach (var role in employee.CompanyRoles)
{
selectedrole.Add(role.CompanyRoleId.ToString());
}
[ViewBag.CompanyRoleId = new SelectList(CompanyRole, "CompanyRoleId", "RoleName", selectedrole);]
my view code
<div class="editor-label">
Role
</div>
<div class="editor-field">
@Html.ListBox("emprole", ViewBag.CompanyRoleId as MultiSelectList , new
{
@class = "chzn-select",
data_placeholder = "Choose Role...",
style="width:350px;"
})
</div>
and my script
$(".chzn-select").chosen({ allow_single_deselect: true });
can any body tell me what i m doing wrong it is not showing selected value when form is displaying in edited mode.
A:
In the code below selectedrole is expected to be of the same type as the objects in CompanyRoles. It also only allows one item to be selected.
ViewBag.CompanyRoleId = new SelectList(CompanyRoles, "CompanyRoleId", "RoleName", selectedrole);
You need to use MultiSelectList instead.
ViewBag.CompanyRoleId = new MultiSelectList(CompanyRoles, "CompanyRoleId", "RoleName", employee.CompanyRoles.ToList());
|
Anti-retinal S-antigen antibodies in human sera: a comparison of reactivity in ELISA with human or bovine S-antigen.
Various studies have demonstrated anti-retinal S-antigen (S-ag) antibodies in uveitis sera in assays using bovine S-ag. Because of its molecular similarity and cross-reactivity with human S-ag, reactions with bovine S-ag have been considered a reliable indication of anti-S-ag autoimmunity. To test this assumption, the cross-reactivity of purified human and bovine S-ags was quantitated by ELISA titration of various anti-human and anti-bovine S-ag immune reagents raised in mice, rats and rabbits. Anti-human S-ag reagents appeared to be largely cross-reactive with bovine S-ag, whereas anti-bovine S-ag reagents were 6-10 times less reactive with the cross-reacting human S-ag than with bovine S-ag, thus showing a predominant role of species-specific epitopes on bovine S-ag. Furthermore, a large number of human control and uveitis sera was tested in ELISA with both human S-ag- and bovine S-ag-coated microwells. Both the numbers of positive sera and the levels of anti-S-ag antibodies in the two tests significantly correlated, but many exceptions were found, and the predictive value of reactions with bovine S-ag for the presence and levels of anti-S-ag autoantibodies was low. For individual human sera, assessment of anti-S-ag autoantibodies requires the use of human S-ag in immunoassays. |
Q:
aerogear - how to send a push notification to one user
I have a client-server service. The client runs on apache cordova and the server is java based. I need to add push notifications to it and I thought about using aerogear. I read the tutorials and successfully sent a push notification from the cordova app.
I want to be able to send a push notification to just one of the clients. Can this be done using aerogear?
Thanks.
A:
Currently the only way to do it would be to add some "criteria" to the message you are sending that targets a specific installation.
So during the registration of your device with the Unified Push Server, you can add an alias to the push config, the device token would probably be best:
var pushConfig = {
pushServerURL: "<pushServerURL e.g http(s)//host:port/context >",
alias: "<alias e.g. a username or an email address optional>",
android: {
...
},
ios: {
...
}
};
Then when you send your message, you can add that "alias" as a "criteria".
edit: i've created this JIRA, https://issues.jboss.org/browse/AGPUSH-1117 , to track this
|
Q:
Use cached data on an action filter, to avoid another execution of an action
I would like to do the following (i will split in two points):
Before execution of the action, if the viewmodel is in cache then return the view and the viewmodel without execute the action.
If is not in the cache, continue with the execution of the action, and reach the OnActionExecuted to put the viewmodel in cache.
How could i return the view and the viewmodel without execute the action (first point)?
This is the code. My doubt indicated with ???????:
public override void OnActionExecuting(ActionExecutingContext filterContext)
{
//IF the viewmodel exists dont execute the action again
if (filterContext.HttpContext.Cache["viewmodel"]!=null)
{
filterContext.Result=???????
}
base.OnActionExecuting(filterContext);
}
public override void OnActionExecuted(ActionExecutedContext filterContext)
{
//Cast de model
ContentDetailVM model = (ContentDetailVM)filterContext.Controller.ViewData.Model;
filterContext.HttpContext.Cache.Insert("viewmodel", model);
//we're asking for a close section
if (model.CurrentSection.HideAccess == true)
{
//pass to the client some flag in order to show the div
filterContext.Controller.ViewData["showoverlaylayer"]=true;
}
base.OnActionExecuted(filterContext);
}
Thanks a lot in advance.
Best Regards.
Jose.
A:
public override void OnActionExecuting(ActionExecutingContext filterContext)
{
var model = filterContext.HttpContext.Cache["viewmodel"];
if (model != null)
{
var result = new ViewResult();
result.ViewData.Model = model;
filterContext.Result = result;
}
}
|
// Copyright 2017 The Abseil Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Functions for directly invoking mmap() via syscall, avoiding the case where
// mmap() has been locally overridden.
#ifndef ABSL_BASE_INTERNAL_DIRECT_MMAP_H_
#define ABSL_BASE_INTERNAL_DIRECT_MMAP_H_
#include "absl/base/config.h"
#if ABSL_HAVE_MMAP
#include <sys/mman.h>
#ifdef __linux__
#include <sys/types.h>
#ifdef __BIONIC__
#include <sys/syscall.h>
#else
#include <syscall.h>
#endif
#include <linux/unistd.h>
#include <unistd.h>
#include <cerrno>
#include <cstdarg>
#include <cstdint>
#ifdef __mips__
// Include definitions of the ABI currently in use.
#ifdef __BIONIC__
// Android doesn't have sgidefs.h, but does have asm/sgidefs.h, which has the
// definitions we need.
#include <asm/sgidefs.h>
#else
#include <sgidefs.h>
#endif // __BIONIC__
#endif // __mips__
// SYS_mmap and SYS_munmap are not defined in Android.
#ifdef __BIONIC__
extern "C" void* __mmap2(void*, size_t, int, int, int, size_t);
#if defined(__NR_mmap) && !defined(SYS_mmap)
#define SYS_mmap __NR_mmap
#endif
#ifndef SYS_munmap
#define SYS_munmap __NR_munmap
#endif
#endif // __BIONIC__
namespace absl {
ABSL_NAMESPACE_BEGIN
namespace base_internal {
// Platform specific logic extracted from
// https://chromium.googlesource.com/linux-syscall-support/+/master/linux_syscall_support.h
inline void* DirectMmap(void* start, size_t length, int prot, int flags, int fd,
off64_t offset) noexcept {
#if defined(__i386__) || defined(__ARM_ARCH_3__) || defined(__ARM_EABI__) || \\
(defined(__mips__) && _MIPS_SIM == _MIPS_SIM_ABI32) || \\
(defined(__PPC__) && !defined(__PPC64__)) || \\
(defined(__s390__) && !defined(__s390x__))
// On these architectures, implement mmap with mmap2.
static int pagesize = 0;
if (pagesize == 0) {
#if defined(__wasm__) || defined(__asmjs__)
pagesize = getpagesize();
#else
pagesize = sysconf(_SC_PAGESIZE);
#endif
}
if (offset < 0 || offset % pagesize != 0) {
errno = EINVAL;
return MAP_FAILED;
}
#ifdef __BIONIC__
// SYS_mmap2 has problems on Android API level <= 16.
// Workaround by invoking __mmap2() instead.
return __mmap2(start, length, prot, flags, fd, offset / pagesize);
#else
return reinterpret_cast<void*>(
syscall(SYS_mmap2, start, length, prot, flags, fd,
static_cast<off_t>(offset / pagesize)));
#endif
#elif defined(__s390x__)
// On s390x, mmap() arguments are passed in memory.
unsigned long buf[6] = {reinterpret_cast<unsigned long>(start), // NOLINT
static_cast<unsigned long>(length), // NOLINT
static_cast<unsigned long>(prot), // NOLINT
static_cast<unsigned long>(flags), // NOLINT
static_cast<unsigned long>(fd), // NOLINT
static_cast<unsigned long>(offset)}; // NOLINT
return reinterpret_cast<void*>(syscall(SYS_mmap, buf));
#elif defined(__x86_64__)
// The x32 ABI has 32 bit longs, but the syscall interface is 64 bit.
// We need to explicitly cast to an unsigned 64 bit type to avoid implicit
// sign extension. We can't cast pointers directly because those are
// 32 bits, and gcc will dump ugly warnings about casting from a pointer
// to an integer of a different size. We also need to make sure __off64_t
// isn't truncated to 32-bits under x32.
#define MMAP_SYSCALL_ARG(x) ((uint64_t)(uintptr_t)(x))
return reinterpret_cast<void*>(
syscall(SYS_mmap, MMAP_SYSCALL_ARG(start), MMAP_SYSCALL_ARG(length),
MMAP_SYSCALL_ARG(prot), MMAP_SYSCALL_ARG(flags),
MMAP_SYSCALL_ARG(fd), static_cast<uint64_t>(offset)));
#undef MMAP_SYSCALL_ARG
#else // Remaining 64-bit aritectures.
static_assert(sizeof(unsigned long) == 8, "Platform is not 64-bit");
return reinterpret_cast<void*>(
syscall(SYS_mmap, start, length, prot, flags, fd, offset));
#endif
}
inline int DirectMunmap(void* start, size_t length) {
return static_cast<int>(syscall(SYS_munmap, start, length));
}
} // namespace base_internal
ABSL_NAMESPACE_END
} // namespace absl
#else // !__linux__
// For non-linux platforms where we have mmap, just dispatch directly to the
// actual mmap()/munmap() methods.
namespace absl {
ABSL_NAMESPACE_BEGIN
namespace base_internal {
inline void* DirectMmap(void* start, size_t length, int prot, int flags, int fd,
off_t offset) {
return mmap(start, length, prot, flags, fd, offset);
}
inline int DirectMunmap(void* start, size_t length) {
return munmap(start, length);
}
} // namespace base_internal
ABSL_NAMESPACE_END
} // namespace absl
#endif // __linux__
#endif // ABSL_HAVE_MMAP
#endif // ABSL_BASE_INTERNAL_DIRECT_MMAP_H_
|
Number 9 Star Birthday Toothpick Candles 3ct
Plastic & Wax Candles | SKU: 97090
Price:
$3.99
Celebrate your special occasion with Number 9 Star Birthday Toothpick Candles! These star-shaped candles come in bright colors and feature attached plastic picks. The largest star has a number 9 printed on it — perfect for a 9th birthday or anniversary. Use these star candles in cakes, cupcakes, and more! |
Parliament
I've spend most of afternoon watching the Parliament channel and riveting watching it it. Obviously the opposition parties are having a go at the Tories after the Supreme Court found against them regarding proroguing Parliament . The Tories are standing firm that they believed their actions at the time were legal!
What is almost unheard of is that the Tories are demanding loud that the country needs a GE while the opposition are stepping back from offering one. It is almost certain that within next month or so Boris will face a vote of confidence. With his back to the wall I would not be surprised if Boris forces the issue and brings about a vote of confidence himself to deliberately lose thus bringing down the government and forcing a GE. The opposition are so divided that they would not be able to form an administration.
Corbyn was very bullish at his party conference yesterday saying that Labour would be the next government. I don't have his confidence and think perhaps the Lib Dems could run them close as the main future opposition party.
What is it about abuse and death threats sent to women MPs parroting the language first coined by the Prime Minister which you find so amusing and worthy of snide sarcasm?
Multiple MPs begged him to stop using the terms Surrender Bill and traitors as these are two terms most used by those sending abuse and death threats on line - Johnson just dismisses it and carried on. It seems like you are doing the same - do you have a problem with women?
This is nothing about being anti-Conservative or anti-Brexit. Here is the Spectator’s take, written by their assistant editor:
So it is nothing to do with Brexit or which Party you support (I am Conservative until this summer) it is whether you are happy for the Prime Minister to use language which contributes to (note: contributes to, not causes) the online hate sent to women MPs, or do you also think misogynistic abuse is something to dismiss and laugh off?
And it is no surprise that Domestic Violence Bill which was due to be voted on in the Commons before the prorogation isn’t making a re-appearance. The only items on the agenda today in the Commons is a vote on whether to have a recess before the Conservative conference and a general debate about democracy. It would be the perfect time to vote on the Domestic Violence Bill; but then a Prime Minister who dismisses tearful women MPs and laughs off the murder of a woman MP to appeal to a certain segment of the electorate it is no surprise he doesn’t want MPs to pass the Domestic Violence Bill.
michael, your attempt at humour is nothing of the sort. Please refrain from this kind of posting. To others, please report such behaviour, but don't give it credence by quoting and dissecting it. Thank you.
The Old TomCat wrote:What is almost unheard of is that the Tories are demanding loud that the country needs a GE while the opposition are stepping back from offering one.
A General Election is not the proper way to resolve Brexit. A General Election is a vote about running the country for the next 5 years. Health, Education, Defence, and so on. Most of the woes of this country are nothing to do with the EU and absolutely would not be solved by Brexit.
To try and bully opposition parties into having a General Election about Brexit is a nasty, low tactic. I suppose we shouldn't be surprised that Dominic Cummings is trying that course of action.
The Old TomCat wrote:What is almost unheard of is that the Tories are demanding loud that the country needs a GE while the opposition are stepping back from offering one.
A General Election is not the proper way to resolve Brexit. A General Election is a vote about running the country for the next 5 years. Health, Education, Defence, and so on. Most of the woes of this country are nothing to do with the EU and absolutely would not be solved by Brexit.
To try and bully opposition parties into having a General Election about Brexit is a nasty, low tactic. I suppose we shouldn't be surprised that Dominic Cummings is trying that course of action.
To be fair TOF if I were the PM and believed there to be a good majority among the electorate for my flagship policy which was being blocked by a Parliament elected several years prior, then I would likely push for a GE too.
The scary thing is BoJo might be right about the electorate i.e. that following a GE he could form a majority government bent on making us all poorer (and not just financially).
I think most thought Boris would be contrite at the session yesterday but he was far from it and was actually baiting the opposition parties. Perversely he is getting more support from the public both in opinion polls and messages to his MPs despite losing on every issue since becoming PM. The Tories have the scent of the oppositions blood and that was evident when Boris called upon the opposition to have a GE - the Tory ranks supported him to the rafters in a manner never previously seen in the House of Commons. What was unusual last evening is that throughout there was clapping, hitherto verboten in the House.
The reason for Boris's increase of support is self-evident: the public [both Brexiteers and Remainers] are sick to the back teeth of Brexit and want it done and dusted. People are fed up that Parliament knows what it does NOT want but not what it does want. Boris has shown leadership trying take the UK out of the EU. The public are prepared to overlook his failings [and Boris has more than one] knowing he has a Brexit end-plan. For same reason I suspect the LibDems support will significantly increase as a 100% Remain party.
Having another Referendum is a non-starter; that would be a betrayal of the 17.4 million who voted OUT and were told it would be a one-off. But I accept having a Brexit CE is not really in best long term interest of country. There are many MPs whose constituencies voted OUT or Remain but must tow the party line, whether it conflicts with the MPs own constituents. Many good MPs could therefore be voted out of Parliament which would be sad for the country. But having a Brexit CE would confirm or refute the Referendum result. It the Tories win, we're out and if the LibDems win, UK remains in the EU. Simple.
unfortunately the tactic of putting the people against parliament and grinding many of the public into 'submission' -and we just don't care now -seems to be having some success .
whilst i seek a second referendum based on fact and truth , can you trust the british public who voted for boaty mcboatface and jedward to vote on anything ?
unfortunately whilst i anticipate that ultimately the country will sadly leave the EU with a deal based on T Mays deal ,do people realise that even so, there are at least another 2 years of this whilst the detail of the detail of the deal is sorted/negotiated ,argued and debated ,and that any deal is an interim deal to be worked on until final and conclusive leave date proposed for 2021.Can't we just stay in .
Last edited by michael on Thu Sep 26, 2019 2:04 pm, edited 1 time in total.
The Old TomCat wrote:I think most thought Boris would be contrite at the session yesterday but he was far from it and was actually baiting the opposition parties. Perversely he is getting more support from the public both in opinion polls and messages to his MPs despite losing on every issue since becoming PM. The Tories have the scent of the oppositions blood and that was evident when Boris called upon the opposition to have a GE - the Tory ranks supported him to the rafters in a manner never previously seen in the House of Commons. What was unusual last evening is that throughout there was clapping, hitherto verboten in the House.
The reason for Boris's increase of support is self-evident: the public [both Brexiteers and Remainers] are sick to the back teeth of Brexit and want it done and dusted. People are fed up that Parliament knows what it does NOT want but not what it does want. Boris has shown leadership trying take the UK out of the EU. The public are prepared to overlook his failings [and Boris has more than one] knowing he has a Brexit end-plan. For same reason I suspect the LibDems support will significantly increase as a 100% Remain party.
Having another Referendum is a non-starter; that would be a betrayal of the 17.4 million who voted OUT and were told it would be a one-off. But I accept having a Brexit CE is not really in best long term interest of country. There are many MPs whose constituencies voted OUT or Remain but must tow the party line, whether it conflicts with the MPs own constituents. Many good MPs could therefore be voted out of Parliament which would be sad for the country. But having a Brexit CE would confirm or refute the Referendum result. It the Tories win, we're out and if the LibDems win, UK remains in the EU. Simple.
Apart from the current Conservatives say they don’t want No Deal, that they want a deal, but haven’t yet proposed a deal.
Johnson voted against leaving the EU three times this year in January and March. Hardly leadership! He told May what he didn’t want in March and six months later still hasn’t said what he does want.
A general election will be another hung parliament. Just more can kicking. The choices after will remain the same as they are now: no deal, deal or revoke.
So, Old Tom Cat if you are so sure the majority want to leave with No Deal why not have another referendum on it? After all, the make up of the electorate has changed. Anyone now aged 18-20 had no vote in 2016 but they will be allowed to vote in the General Election - why not cut to the chase and allow them a vote along with everyone else on whether to leave?
Eco-Exile wrote:So, Old Tom Cat if you are so sure the majority want to leave with No Deal why not have another referendum on it? After all, the make up of the electorate has changed. Anyone now aged 18-20 had no vote in 2016 but they will be allowed to vote in the General Election - why not cut to the chase and allow them a vote along with everyone else on whether to leave?
Nobody born this century has been able to vote about Brexit: the vast majority of them will be alive in 2100, as long as we continue to strive to sort out climate change.
A second referendum giving everyone the opportunity to vote on the proposed deal ( if one ever gets agreed) is the right way forward in my opinion.
By the way my credentials are:
.I was against joining the 'Common Market' in my youth and was a member of the organisation that canvassed not to join. In hindsight I see my views were very influenced by my biased education which had convinced me we could exist and prosper alone.
. Although the EU has its problems I believed we are far better inside than contemplating leaving. I was firmly remain in the referendum.
. If a second vote comes to pass, I will look at the terms of the proposed deal, listen to the arguments on both sides and then make a decision.
Although I am still 'remain' we have to find some middle ground, or this country will be divided for years to come.
Eco-Exile wrote:So, Old Tom Cat if you are so sure the majority want to leave with No Deal why not have another referendum on it? After all, the make up of the electorate has changed. Anyone now aged 18-20 had no vote in 2016 but they will be allowed to vote in the General Election - why not cut to the chase and allow them a vote along with everyone else on whether to leave?
Already answered all your points:# Referendum was a one-off# Voters may or may not want No Deal but they want the Brexit debacle ended.
ps to Pitchfork# A GE will bring to end the Brexit debate, one way or another. That is why country desperately needs a GE.
Who is online
About FGR
We’re a club that looks to the future, but our identity is forged from a rich 128-year history. Founded in 1889, we’re one of the oldest football clubs in the world.
In 2017, we were promoted to the Football League for the first time in our history – which means we can spread our sustainability message to an even bigger audience. FIFA recently described us as the greenest football club in the world. That’s quite an accolade, and it shows how we’ve been able to bring together football and environmental consciousness at the highest levels of the game. |
The present invention relates to a semiconductor device and its manufacturing technique. In particular, it relates to a technique effective to be applied to a semiconductor device in which semiconductor chips arranged side by side are electrically coupled via a wire.
Japanese Patent Laid-open No. 2004-356382 (Patent Document 1) describes a semiconductor device in which two semiconductor chips arranged adjacent to each other, in a planar manner, over one die pad are electrically coupled via a wire.
Also, Japanese Patent Laid-open No. 2011-124487 (Patent document 2) describes a semiconductor device in which two semiconductor chips arranged adjacent to each other, in a planar manner, over a wiring substrate are electrically coupled via a wire.
[Patent Document 1]
Japanese Patent Laid-open No. 2004-356382
[Patent Document 2]
Japanese Patent Laid-open No. 2011-124487 |
Comparison of antibiotic susceptibility in viridans group streptococci in low and high antibiotic-prescribing General Practices.
Antibiotic resistance has become a global public health issue. Most antibiotics are prescribed in the community, although there is less stewardship of such agents in the community compared to secondary and tertiary care. Few studies have attempted to examine the prescribing practices in General Practice and its impact on antibiotic resistance and, therefore, a study was performed in order to compare antibiotic susceptibilities of commensal viridans group streptococci (VGS) obtained from patient cohorts in General Practices (GP), who were high and low prescribers of oral antibiotics. Sixty-five patients (<1 month-81 years; 77% female: 23% male) were enrolled onto the study, and viridans group streptococci (n = 5/patient) were collected from each patient's nasal passages and oropharynx region and tested for antibiotic susceptibility against (i) tetracyclines (doxycycline); (ii) macrolides (erythromycin); (iii) β-lactams (penicillin G); and (iv) fluoroquinolones (ofloxacin & levofloxacin). There were no significant differences in MICs between high and low GP prescribers with doxycycline (P = 0·094), erythromycin (P = 0·122), ofloxacin (P = 0·193) and levofloxacin (P = 0·058). However, there was a significant difference between high and low GP practices with regard to penicillin G (P = 0·031). This finding is important as the β-lactams are the most commonly prescribed oral antibiotic in the community. This study demonstrates that high prescribing practices may lead to an altered (higher) level of resistance to these agents in the commensal VGS population, which may be important as reservoirs of antibiotic resistance determinants in subsequent horizontal gene transfer events, particularly with newly colonizing pathogens, including pneumococci. Primary care physicians should be aware that increased prescribing of antibiotics may led to increased level of penicillin resistance. |
Georg Friedrich Strass
Georg Friedrich Strass (; 29 May 1701, Wolfisheim near Strasbourg - 22 December 1773) was an Alsatian jeweler and inventor of imitation gemstones. He is best known as the inventor of the rhinestone, called strass in many European languages, from a particular type of crystal he found in the river Rhine.
He used mixtures of bismuth and thallium to improve the refractive quality of his imitations, and altered their colors with metal salts. The imitations were, in his view, so similar to real gems that he invented the concept of the "simulated gemstone" to describe them. He considerably improved his gems' brilliance by gluing metal foil behind them. This foil was later replaced with a vapor-deposited mirror coating.
Strass opened his own business in 1730, and devoted himself wholly to the development of imitation diamonds. Due to his great achievements, he was awarded the title "King's Jeweler" in 1734.
He was a partner in the jewellery business of Madame Prévot. He continued improving his artificial gemstones during this time. His work was in great demand at the court of King Louis XV of France, and he controlled a large market for artificial gems.
Wealthy through his businesses, he was able to retire comfortably at age 52.
Category:1701 births
Category:1773 deaths
Category:People from Wolfisheim
Category:French jewellers
Category:German jewellers
Category:18th-century French businesspeople
Category:18th-century Austrian businesspeople
Category:Alsatian-German people
Category:Glass artists
Category:History of glass
Category:Glass applications |
Latest News
SPORTS NETWORK
Jul 5, 2012
, Last Updated: 12:31 PM ET
LONDON - American great Serena Williams powered her way into a seventh Wimbledon final, while Poland's Agnieszka Radwanska reached her first-ever Grand Slam championship match in Thursday's women's semifinal action at The Championships.
In a battle of former world No. 1s, a sixth-seeded Williams beat second-seeded Victoria Azarenka 6-3, 7-6 (8-6), while the first semi of the day saw the third-seeded Radwanska roll past eighth-seeded German Angelique Kerber 6-3, 6-4 on Centre Court at the storied All England Club.
Radwanska is the first Polish Grand Slam finalist in 73 years, or since Jadwiga Jedrzejowska lost in the women's title match at the French Championships in 1939. She can become the No. 1 player in the world with a victory over Williams in two days.
Williams landed in her 18th major final (13-4) by getting past a quality opponent in Azarenka, who held the top-ranking for a majority of this year after capturing her first Grand Slam title at the Australian Open in January.
Azarenka would have returned to No. 1 with a victory on Thursday, but that didn't happen.
Williams cruised in the opening set behind an unstoppable service game, as she simply overpowered her Belarusian counterpart.
Azarenka tried to fight her way back into the match in the second, as she played much better tennis en route to a tiebreak.
She somehow managed to break Williams to level the second set at 3-all, and the two players stayed on serve over the next six games on their way to the breaker.
In the extra session, Azarenka dumped a forehand into the net to cap a fierce rally and give Williams her first match point, at 6-5. The American failed to convert when she sent a forehand lob long on tennis' most-famous court.
Azarenka then netted a backhand to give Williams a second match point, which she converted with a women's Wimbledon-record 24th ace on a sunny day in the London suburb.
Williams moved on in 1 hour, 36 minutes, as she unleashed 23 more aces than Azarenka, who settled for just one break on Day 10. Williams tallied two breaks in victory and a whopping 31 more winners (45-14).
The veteran Williams is now 8-1 lifetime against Azarenka. The American bested the Belarusian in a Wimbledon quarterfinal three years ago and also topped her on some blue clay in Madrid earlier this season.
The 22-year-old Azarenka was appearing in her second straight Wimbledon (0-2) and third career Grand Slam semifinal (1-2).
Williams improved to 7-1 in her Wimbledon semis.
Meanwhile, playing in her first-ever Grand Slam semifinal, Radwanska prevailed in 70 minutes as she broke an unfocused Kerber three times on as many break-point chances, compared to only one break in three opportunities for the German. Kerber also tallied eight more unforced errors than her Polish counterpart (14-6).
Radwanska broke for a 5-3 lead in the first set thanks to a pair of crucial backhand errors from Kerber, and the determined Pole would close out the stanza with a big ace.
In the second set, a series of Kerber errors led to a Radwanska break in the fifth game. And Kerber's last chance came when she had a break point, down 2-3, but she was unable to convert and Radwanska would serve out the match four games later.
Radwanska is now 3-2 lifetime against the lefthander Kerber, who upset the Pole in the second round at last year's U.S. Open.
"I'm so happy, it's amazing. I played very good today," Radwanska said. "It's always tough against Angie. We are very good friends, but of course on court we were both fighting for the final.
"I think we were both a bit nervous in the beginning, your hand is shaking a bit, but after a couple of games I relaxed.
"This is what I dreamed of since I was a kid. Everyone wants to reach a Grand Slam final. It is the best two weeks of my career."
The 24-year-old Kerber was appearing in her first Wimbledon and second career Grand Slam semifinal (0-2). She reached the final four at last year's U.S. Open.
Williams is seeking the 42nd overall title of her brilliant career, including a third this season. She's already titled in Charleston and Madrid in 2012.
The 30-year-old Williams and her older sister Venus have combined to win nine of the last 12 Wimbledon titles. Serena will go for number five on Saturday.
Last year's U.S. Open runner-up Williams is 4-2 in her previous Wimbledon finals, as she titled back-to-back here in 2002 and 2003 and 2009 and 2010.
The 23-year-old Krakow native Radwanska, a junior Wimbledon champ back in 2005, will appear in her 13th career WTA final, seeking an 11th title. She's 3-0 in her 2012 title tilts.
Serena is 2-0 lifetime against Radwanska, including a Wimbledon quarterfinal victory four years ago. |
C C P
C C P Alliance
Vanguard has been successfully deployed on September 29 during an regular downtime.
Vanguard delivers a new set of changes on sovereignty capture mechanics, the highly anticipated Multi-Buy option, new graphical timers, battlecruiser rebalancing, enhanced visuals for stations and ships and much more. The full details of all changes and improvements are available in the Vanguard patch notes.
Please post general feedback and discussions in this thread.
Report issues with the release on the PC in the Vanguard issues thread. For Mac users, there is, as always, a thread on the Macintosh forums for discussion of this release here.
Xiong Offices
Thank you so extremely much to CCP karkur and her team for multi-buy. The "number of orders" box was a pleasant surprise to see, as it got rid of the only complaint I had about multi-buy. All-together, this new feature is an immense quality-of-life improvement for me, and will halve the daily time I spend wrangling with the Eve interface, instead of playing.
Sanctuary of Shadows
Dock Workers
The self-ship bracket needs to be a different color, or at least show corp/ alliance/ fleet status. Right now when I'm zoomed out I see a neutral ship on grid with me and I freak out since local should be blue and overview shows nothing. If it was the blue NPC color but hollow that would work.
I N E X T R E M I S
Tactical Narcotics Team
The self-ship bracket needs to be a different color, or at least show corp/ alliance/ fleet status. Right now when I'm zoomed out I see a neutral ship on grid with me and I freak out since local should be blue and overview shows nothing. If it was the blue NPC color but hollow that would work.
+1
own ship icon should be different colour. blue/green. i zoomed out and thought there was a neut next to me!!
"Probe Scanning MapExploring the universe and discovering the unknown is a huge part of the EVE experience for many intrepid pilots. The scanning window now includes its own instance of the star map, supporting Probe scanning to make scanning for new adventures easier. Of course you're on your own when you get there!" |
Sex differences in the relationships between parasympathetic activity and pain modulation.
Higher parasympathetic activity is related to lower pain perception in healthy subjects and pain patients. We aimed to examine whether this relationship depends on sex, in healthy subjects. Parasympathetic activity was assessed using time- and frequency-domain heart rate variability indices and deep breathing ratio. Pain perception parameters, consisting of heat pain thresholds and pain ratings of supra-thresholds stimuli, as well as pain modulation parameters of mechanical temporal summation, pain adaptation, offset analgesia and conditioned pain modulation (CPM) response were examined. Forty healthy subjects were examined (20 men). Women demonstrated higher parasympathetic activity compared to men (high frequency power of 0.55±0.2 and 0.40±0.2, respectively, p=0.02) and less pain reduction in the offset analgesia paradigm (-35.4±29.1 and -55.0±31.2, respectively, p=0.046). Separate slopes models analyses revealed sex differences such that a significant negative correlation was observed between higher rMSSD (the root mean square of successive differences) and higher pain adaptation in men (r=-0.649, p=0.003) but not in women (r=0.382, p=0.106). Similarly, a significant negative correlation was found between higher rMSSD and higher efficiency of the CPM response in men (r=-0.510, p=0.026) but not in women (r=0.406, p=0.085). Sex hormones levels, psychological factors or baseline autonomic activity can be possible explanations for these sex differences. Future autonomic interventions destined to change pain modulation should consider sex as an important intervening factor. |
Q:
Don't stop rake task if raise an error
I have simple rake file.
It imports data from the .xls file to the database.
But some of the data is invalid. Then data is invalid rake stop excecuting script.
But I wan to just skip this row and try with the next.
Part of my code:
data.each do |row|
username = row[0].slice!(0..2) + row[1].slice!(0..2) + rand(100).to_s
username.downcase
password = "pass1234"
User.create!(
email: row[2].downcase,
username: username,
first_name: row[0],
last_name: row[1],
expiration_date: row[3],
password: password,
password_confirmation: password)
p 'done'
end
The error is about the validation, eg.:
rake aborted!
ActiveRecord::RecordInvalid: Validation failed: Expiration date must be after 2015-10-27
Script is stopped and valid records are not added.
A:
Wrap it in a begin/rescue block.
data.each do |row|
begin
username = row[0].slice!(0..2) + row[1].slice!(0..2) + rand(100).to_s
username.downcase
password = "pass1234"
User.create!(
email: row[2].downcase,
username: username,
first_name: row[0],
last_name: row[1],
expiration_date: row[3],
password: password,
password_confirmation: password)
p 'done'
rescue => e
# log exception or ignore it.
end
end
Note that this works because the default rescue is for StandardError. Since ActiveRecord::RecordInvalid < StandardError. It will be 'catched'.
You could rescue the specific error first if you only want to do something with those specific errors.
(For reference also see the API: http://ruby-doc.org/core-2.2.0/Exception.html)
|
Infection with human herpesvirus 6 after kidney-pancreas transplant.
We describe the first known case of symptomatic infection resulting from human herpesvirus-6 (HHV-6) in simultaneous pancreas-kidney transplant recipients. The role of HHV-6 in solid-organ transplant recipients is not well defined. In hematopoietic stem cell transplantation (SCT) HHV-6 may cause fever, rash, myelosuppression, interstitial pneumonitis, and encephalitis. |
Q:
Manipulate or edit System.out (java)
Is this possible to do in Java, like using System.out.println(...) and then somehow edit the text that was written?
For example, I have a basic application doing some tasks, and I want to keep the user updated, like showing the percentage before until it's done.
So it would show something like this in the System.out stream when the task starts
Doing x task ... 0%
Then update the % shown when progresses are being made. Whenever the task is done, change it to say "Done!" instead of showing 100% or some random percentage.
Sorry if this is a bad and hard to understand question, I really have no idea how to put it and English is not my native language. Feel free to edit the question to make it more clear
A:
Don't use println; use print instead and add \\r at the end of the line. For example,
System.out.print("Doing x task... " + percentDone + "%\\r");
System.out.flush();
The \\r (carriage return) character returns the "insertion point" back to the start of the current line, without advancing to the next one. When you print text after that, it will overwrite the existing line.
When using print it becomes essential to flush the output stream manually. Otherwise you won't receive any output until the internal buffer is filled.
Note that this trick does not work in Eclipse, NetBeans and most other IDEs' Console output because they do not interpret the special control characters like \\r or \\b. You must use it from the command line.
A:
If you want to overwrite text you have already written, you can use control characters like \\b or \\r or cursor movements. The problem is that different consoles such as IDE behave differently, so there is no standard way to do this.
If you want to edit output as it goes out...
You can do this by writing your own PrintStream and using
System.setOut(myPrintStream);
However, it would be easier to edit the original code, even if you have to decompile it first.
|
The objectives of these studies are to define which subcellular constituents of animal and human granulocytes possess biologically active substances affecting blood coagulation, to determine if subcellular fractions of macrophages have these same biological activities, and to examine the influence of endotoxin and certain drugs on the procoagulant activity of leukocytes. Blood leukocytes will be isolated by dextran sedimentation and differential centrifugation on ficoll-hypaque gradients. Lysosomes will be obtained from disrupted cells by differential centrifugation and separated into distinct populations on linear sucrose density gradients; these will be monitored by light and electronmicroscopy. Soluble extracts of lysosomes will be separated by column chromatography, electrofocusing and gel electrophoresis into purified fractions for characterization and biological testing. |
Coroner’s officials have released the name of an 18-month-old El Monte girl killed over the weekend when a pickup truck slammed into a bus stop she was sitting on with her grandmother and 12-year-old uncle.
Hade Sandoval died at a hospital following Saturday’s 2 p.m. crash at Valley Boulevard and Mountain View Road, coroner’s officials said Wednesday.
Her grandmother, 36, suffered critical injuries in the crash, and her uncle was hospitalized in stable condition, El Monte police said.
The three family members were sitting on a bus bench when a 59-year-old El Monte man tried to park his pickup truck behind them in the parking lot of a pharmacy, investigators said.
For reasons that remain under investigation, the pickup truck lurched forward, hopping over a curb and dirt embankment before striking the bus bench and coming to rest against a telephone pole, police said.
PASADENA
Man wounded in Tuesday night shooting
Pasadena police searched three apartment complexes for a suspect who shot and wounded a man Tuesday night.
The shooting was reported at 7:20 p.m. in the 1700 block of Fair Oaks Avenue.
A man in his 30s was sitting in a car or was next to a parked car when another man walked up to him and fired two to three rounds, according to Lt. Pete Hettema. After the shooting, Hettema said the victim ran northbound trying to get away while the suspect fled southbound.
The wounded man was taken to a hospital. Police said his wounds weren’t life-threatening.
The suspect was only described as a thin black man in his 20s.
EL MONTE
Man jailed on drug, gun allegations after chase
Deputies arrested a Covina man Wednesday after he brandished gun, threw a bag of drugs into a drainage ditch and led deputies on a chase from El Monte to San Dimas, authorities said.
The incident began about 10:40 a.m. when a gang enforcement deputy spotted Lopez brandish a handgun in the area of Maxson and Ferris roads in El Monte, the lieutenant said. The deputy tried to stop Lopez, initiating a chase, Godfrey said.
Both a deputy and witnesses spotted Lopez throw something from his car into a ditch at the outset of the pursuit, officials said. When deputies retrieved the item, they discovered it was about an ounce and a half of what appeared to be methamphetamine.
The chase continued east on the 10 Freeway until Lopez ultimately pulled over and surrendered about 15 minutes later after exiting the freeway at Holt Avenue in San Dimas, Godfrey said. |
Q:
Displacement current - how to think of it
What is a good way to think of the displacement current? Maxwell imagined it as being movements in the aether, small changed of electric field producing magnetic field. I don't even understand that definition-assuming there is aether. (On the topic of which, has aether actually been disproved? I read that even with the Michelson-Morley experiment the aether wasn't disproved.)
A:
Maxwell's equations in a vacuum have induction terms. (1) There is a term saying that a time-varying magnetic field produces an electric field. (2) There is a term saying that a time-varying electric field produces a magnetic field.
Among people who insist on giving hard-to-remember names to all the terms in Maxwell's equations, #2 is called the displacement current. The name is a bad one, because it's not a current, i.e., it has nothing to do with the motion of charged, material particles. The only reason it has the misleading name is that it adds to the current term, and Maxwell, who made up the name, wasn't sure what its ultimate origin was.
The importance of term #2 is mainly that it allows the existence of electromagnetic waves. In an electromagnetic wave, the changing E field induces the B field, and the changing B field induces the E field.
There are elementary reasons that term #2 has to exist. For example, suppose you have a circular, flat Amperian surface $S_1$ and you shoot a single charged particle perpendicularly through its center. In this situation, Maxwell's equations without term #2 predict that the magnetic field at the edge of the surface will be zero, then infinite for an instant, and then zero again after that. But if we construct a similar Amperian surface $S_2$ with the same boundary but an interior surface that is bowed out rather than flat, we get a prediction that the infinite field occurs at a different time. This proves that we can't get away with leaving Maxwell's equations in a form with all the terms except term #2.
The deeper reason for term #2 is that it's required by relativity. Only with term #2 do Maxwell's equations have a form that is the same in all frames of reference.
A:
Contra Ben Crowell's answer, I'll argue that "displacement current" is a fine name, because Maxwell's equations treat the rate of change of electric flux density (the "displacement current") exactly the same as a charge current. When you hear the term, you know exactly what's being discussed, and even how it fits into the equations.
Without the displacement current, Maxwell's equations are inconsistent. The standard example involves a circuit with current flowing through a wire to charge a capacitor. (See the Wikipedia article for displacement current for a figure of this geometry.)
The task is to calculate the line integral of magnetic field around a loop surrounding the wire. By Stokes' theorem, one converts this line integral to a surface integral of $\\boldsymbol{\\nabla \\times B}$ over a surface whose boundary is the loop. By Maxwell, this quantity is:
$$\\boldsymbol{\\nabla \\times B = J + J_d}$$
where $\\boldsymbol{J}$ is the usual charge current density and $\\boldsymbol{J_d} = \\partial \\boldsymbol{D} / \\partial t$ is the displacement current density.
Of course, many different surfaces have the loop as a boundary:
If the particular surface chosen is intersected by the circuit's wire, its integrated current density (the wire current) gives a non-zero (and correct) answer for the surface (and therefore the line) integral.
But what if the surface passes through the interior of the capacitor, where there is no charge current density ($\\boldsymbol{J}=0$)? The value of the line integral should be the same, no matter what surface is chosen to span it and apply Stokes' theorem. Displacement current to the rescue... When the rate of change of the capacitor electric field is determined and its surface integral calculated, the displacement current turns out to exactly equal the wire current, giving the same result for the $\\boldsymbol{B}$ line integral.
|
/*
* Copyright (c) 2001-2004 Caucho Technology, Inc. All rights reserved.
*
* The Apache Software License, Version 1.1
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution, if
* any, must include the following acknowlegement:
* "This product includes software developed by the
* Caucho Technology (http://www.caucho.com/)."
* Alternately, this acknowlegement may appear in the software itself,
* if and wherever such third-party acknowlegements normally appear.
*
* 4. The names "Hessian", "Resin", and "Caucho" must not be used to
* endorse or promote products derived from this software without prior
* written permission. For written permission, please contact
* info@caucho.com.
*
* 5. Products derived from this software may not be called "Resin"
* nor may "Resin" appear in their names without prior written
* permission of Caucho Technology.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL CAUCHO TECHNOLOGY OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
* OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* @author Scott Ferguson
*/
package com.caucho.hessian.io;
import java.io.IOException;
import java.lang.reflect.Method;
/**
* Deserializing an enum valued object
*/
public class EnumDeserializer extends AbstractDeserializer {
private Class _enumType;
private Method _valueOf;
public EnumDeserializer(Class cl)
{
// hessian/33b[34], hessian/3bb[78]
if (cl.isEnum())
_enumType = cl;
else if (cl.getSuperclass().isEnum())
_enumType = cl.getSuperclass();
else
throw new RuntimeException("Class " + cl.getName() + " is not an enum");
try {
_valueOf = _enumType.getMethod("valueOf",
new Class[] { Class.class, String.class });
} catch (Exception e) {
throw new RuntimeException(e);
}
}
public Class getType()
{
return _enumType;
}
public Object readMap(AbstractHessianInput in)
throws IOException
{
String name = null;
while (! in.isEnd()) {
String key = in.readString();
if (key.equals("name"))
name = in.readString();
else
in.readObject();
}
in.readMapEnd();
Object obj = create(name);
in.addRef(obj);
return obj;
}
@Override
public Object readObject(AbstractHessianInput in, Object []fields)
throws IOException
{
String []fieldNames = (String []) fields;
String name = null;
for (int i = 0; i < fieldNames.length; i++) {
if ("name".equals(fieldNames[i]))
name = in.readString();
else
in.readObject();
}
Object obj = create(name);
in.addRef(obj);
return obj;
}
private Object create(String name)
throws IOException
{
if (name == null)
throw new IOException(_enumType.getName() + " expects name.");
try {
return _valueOf.invoke(null, _enumType, name);
} catch (Exception e) {
throw new IOExceptionWrapper(e);
}
}
}
|