text
stringlengths 1
3.78M
| meta
dict |
|---|---|
Q:
How to decide how backward-compatible my new Mac OS X application should be?
I'm currently contemplating writing an OS X version of my Windows software. My Windows application still supports Windows XP, and I know that if I drop support for it now, our customers will cry bloody murder.
I'm new to OS X development, and as I learn the technology, APIs, etc., I realized that if I'm going to provide comparable level of backward compatibility (e.g. down to OS X 10.5), I would not be able to use many things that look very useful and relevant in my case (ARC, XPC communications, many others). This is quite different from Windows, in my opinion, where there are very little changed between Windows XP and Windows 7 from desktop application developer's standpoint.
So, on one hand, it seems like a complete waste to stick to 2007 or 2009-level API in 2012. On the other hand, according to NetMarketShare report and Stat Owl report Mac OS X 10.5 and 10.6 market share is still 11% and 35%-40% respectively. However, I'm not sure if these older OS users are my target audience (buyers of software utilities) if they didn't bother to upgrade their OS...
My question: Are there any other reasons I should take into account when deciding if I target 10.5 or 10.6 or 10.7 for a new application?
A:
You'll probably find that the majority of people that did not upgrade, are also not installing new applications and only use the ones they already have.
Depending on what your application is going to do, it may even be much more difficult to develop it to support older systems and at the same time work on newer systems according to the newer system conventions. If you already had an application developed for the older system things would be somewhat different as you would just upgrade it dropping support for the older system and letting people that did not upgrade use the older version. But if you start from scratch, depending on what your application is going to do, I wouldn't be too much surprised if it turned out that it would be easier to write two different applications and that the one for the old system took longer to write than the one for the new system.
I'd say targeting 10.4 Tiger is a total nonsense. Supporting 10.7 Lion is probably almost a must. Since you are writing a new application, people with 10.8 Mountain Lion will expect full support for Mountain Lion paradigms (not having it would cast a very bad shadow on your app even in the eyes of those that did not upgrade).
So 10.8 and 10.7 support having on both the native feeling of the platform is your first priority. That may already give you some headache. How back to go really depends on how long you think it'll take you to develop the application and what features your application will have. If you are going to integrate with iCloud to support inter-machine synchronization and maybe also integration with iPhone/iPad, you probably should forget anything below 10.7 or do a different application altogether for those systems. On the other hand if your application does not have data, has no reason to integrate across the different systems owned by the same user (or does it in a proprietary way), is not going to use any of the new APIs or any of the APIs that have changed, then maybe support for 10.6 Snow Leopard and 10.5 Leopard could be added without too much trouble.
But before you even think of supporting earlier than 10.7 systems, you should absolutely verify that there is a real demand for it. Do not just look at the % of still alive machines with those systems. You should verify that those users actually are still buying new applications (which, IMHO is unlikely).
|
{
"pile_set_name": "StackExchange"
}
|
Time use of stroke patients in an intensive rehabilitation unit: a comparison between a Belgian and a Swiss setting.
Functional improvement after stroke has been related to the intensity of treatment. The present study was set up to observe how stroke patients spend their time in a rehabilitation unit. Behavioural mapping was performed throughout a full working day in a Belgian and Swiss stroke unit. Patients were most frequently involved in therapeutic activities, 28% of the day in Belgium and 45% in Switzerland. Physiotherapy accounted for the majority of the therapy time. The Belgian patients spent 27% of the day in their own room and Swiss patients 49% of the day. The most striking finding was that the Swiss patients spent nearly 1.5 hours per day more in therapy. Differences between the two settings could only partially be explained by more favourable patient-staff ratios in the Swiss setting. Autonomous practice, group therapy sessions and family involvement have to also be considered.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Clipperton Fracture Zone
The Clipperton Fracture Zone, also known as the Clarion-Clipperton Zone, is a geological submarine fracture zone of the Pacific Ocean, with a length of around 4500 miles (7240 km). The zone spans approximately . It is one of the five major lineations of the northern Pacific floor, south of the Clarion Fracture Zone, discovered by the Scripps Institution of Oceanography in 1950. The fracture, an unusually mountainous topographical feature, begins east-northeast of the Line Islands and ends in the Middle America Trench off the coast of Central America. It roughly forms a line on the same latitude as Kiribati and Clipperton Island.
In 2016, the seafloor in the Clipperton Fracture Zone – an area being targeted for deep-sea mining – was found to contain an abundance and diversity of life, with more than half of the species collected being new to science. The zone is sometimes referred to as the Clarion-Clipperton Fracture Zone (CCFZ), with reference to Clarion Island at the northern edge of the zone.
Geography
The fracture can be divided into four distinct parts:
- The first, 127°–113° W, is a broad, low welt of some 900 miles, with a central trough 10 to 30 miles wide;
- the second, 113°-107° W, is a volcano enriched ridge, 60 miles wide and 330 miles long;
- the third, 107°-101° W, is a low welt with a central trough 1,200–2,400 feet deep which transects the Albatross Plateau; and
- the fourth, 101°-96° W, contains the Tehuantepec Ridge which extends 400 miles northeast to the continental margin.
The Nova-Canton Trough is often seen as an extension of the fracture.
Deep sea mining
The zone, which is administered by the International Seabed Authority, contains nodules made up of various rare-earth elements. The zone has been divided into 16 mining claims spanning approximately . Further nine areas, each covering , have been set aside for conservation. The International Seabed Authority estimates that the total amount of nodules in the Clarion Clipperton Zone exceeds 21 billions of tons (Bt), containing about 5.95 Bt of manganese, 0.27 Bt of nickel, 0.23 Bt of copper and 0.05 Bt of cobalt.
References
Category:Fracture zones
Category:Pacific Ocean
|
{
"pile_set_name": "Wikipedia (en)"
}
|
High frequency of virulence genes among Escherichia coli with the blaCTX-M genotype from diarrheic piglets in China.
The purpose of this study was to characterize the virulence potential and determine the molecular epidemiology of extended-spectrum β-lactamases (ESBLs) in CTX-M-producing Escherichia coli isolated from piglets with diarrhea in China. A total of 62 E. coli isolates were obtained among which 49 and 13 were collected from diarrheic and healthy piglets, respectively. Cefotaxime resistant strains were screened for the presence of ESBL, adhesin and exotoxin genes as well as for their biofilm-forming ability. Characterization of blaCTX-M plasmids was determined by conjugation along with the determination of genetic relatedness and plasmid replicon type. CTX-M producers were found in 36 isolates with 6 different subtypes: blaCTX-M-14,27,65 from CTX-M-9G (n=27) and blaCTX-M-55, 15,79 from CTX-M-1G (n=22). This also included 13 isolates that carried two different CTX-M genes. Thirty of 36 CTX-M producers and 12 of 13 multiple CTX-M alleles were confirmed from diarrheic piglets. The presence of the iron regulatory gene irp2 as well as EAST1 was found in 83.3% (25/30) of CTX-M-producing isolates from diarrheic piglets and these were significantly better biofilm formers. PFGE profiles of CTX-M-positive isolates indicated the spread of multidrug resistance was primarily horizontal and spread via transferable plasmids. Most blaCTX-M-9G genes (10/17) were located on the IncFIB type plasmid with sizes of 40-145 kb, while the blaCTX-M-1G (11/16) genes were located on the ∼ 100 kb IncN-type plasmid. Together, our findings demonstrate that CTX-M ESBL-producing E. coli from diarrheic piglets were associated with serious multidrug resistance, increased biofilm-forming ability and the irp2 gene of HPI. Our findings highlight the need to urgent control the spread of resistant strains through food chain.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Ontario's Liberal government will introduce legislation tomorrow to implement a provincewide ban on the cosmetic use of pesticides, keeping one of their key election promises from last year.
Premier Dalton McGuinty promised the pesticide ban during last fall's election campaign after intensive lobbying from environmental activists and health professionals.
McGuinty and Environment Minister John Gerretsen will visit a private home in Toronto tomorrow – Earth Day – to announce the ban on the cosmetic use of pesticides on lawns.
Gerretsen was reluctant to reveal any details today, but said members of the public who visited the ministry's website overwhelmingly supported the ban.
"We always said it was a priority when we came out with our platform last year, and it's had tremendous support around the province from what we've received as far as the environmental registry is concerned," Gerretsen said. "Ninety per cent of the people that responded to it responded in a favourable way."
The provincewide ban is aimed at replacing a patchwork of local pesticide bylaws, but Ontario farmers will be exempt. There's no word yet if the province also plans to exempt golf courses from the ban.
The Conservatives and New Democrats said today they would likely support the legislation, but they first want to make sure the ban will actually help the environment and isn't just a public relations move by the Liberal government.
"I think our inclination is to probably support it, but at the same time we want to hear from the folks who are experts in this area, and whether they think it's all politics or whether there is going to be some meaningful benefit to the environment," said Opposition Leader Bob Runciman.
"We've seen a lot of initiatives from this government that don't have a lot of substance but look good and tend to make headlines, and this is maybe another one."
NDP environmental critic Peter Tabuns said he wants a ban that includes real penalties for people who continue to use pesticides for cosmetic purposes.
"If they bring forward legislation that has teeth in it, that's useful, then obviously we're going to be inclined to support it," Tabuns said. "But we don't know what they're bringing forward. We don't know if it's going to be useful or just simply fluff."
The Ontario College of Family Physicians has said the long-term effects of exposure to pesticides can be devastating, especially to pregnant women and children, leading to learning disabilities, birth defects and miscarriages.
The Canadian Cancer Society, the David Suzuki Foundation, Environmental Defence and the Ontario Medical Association have all urged Ontario to follow Quebec's lead and pass the ban on pesticides.
|
{
"pile_set_name": "OpenWebText2"
}
|
76 reviews:
4.6 ) $36 .15 Free Shipping to Germany working... stock Temporarily sold out format model Adept, 3000mAh, Black Adept, 3000mAh, Forest Camo Adept, 3000mAh, Ocean Adept, 3000mAh, Purple Adept, 3000mAh, Sky Adept, 3000mAh, White AMVS(4ml), 3000mAh, Black AMVS(4ml), 3000mAh, Green Cool Fire 1 E-Cig, Silver Cool Fire II E-Cig, Army Green Cool Fire II E-Cig, Black Endura T18, 1000mAh, Black Endura T18, 1000mAh, Cyan Endura T18, 1000mAh, Pink Endura T18, 1000mAh, Silver Endura T18Ⅱ Mini, 1000mAh, Black Endura T18Ⅱ Mini, 1000mAh, Blue Endura T18Ⅱ Mini, 1000mAh, Coral Pink Endura T18Ⅱ Mini, 1000mAh, Green Endura T18Ⅱ Mini, 1000mAh, Purple Endura T18Ⅱ Mini, 1000mAh, Stainless Steel Endura T18E, 1000mAh, Aquamarine (EU) Endura T18E, 1000mAh, Black (EU) Endura T18E, 1000mAh, Pink (EU) Endura T18E, 1000mAh, Silver (EU) Endura T18II, 1300mAh, Black Endura T18II, 1300mAh, Blue Endura T18II, 1300mAh, Coffee Endura T18II, 1300mAh, Purple Endura T18II, 1300mAh, Rainbow Endura T18II, 1300mAh, Silver Endura T20, 1000mAh, w/ Prism T20, Black Endura T20, 1000mAh, w/ Prism T20, Blue Endura T20, 1000mAh, w/ Prism T20, Red Endura T20, 1000mAh, w/ Prism T20, Silver Endura T20, 1500mAh, w/ Prism T20, Black Endura T20, 1500mAh, w/ Prism T20, Blue Endura T20, 1500mAh, w/ Prism T20, Red Endura T20, 1500mAh, w/ Prism T20, Silver Endura T20-S Complete, 1500mAh, Black Endura T20-S Complete, 1500mAh, Blue Endura T20-S Complete, 1500mAh, Grey Endura T20-S Complete, 1500mAh, Purple Endura T20-S Complete, 1500mAh, Red Endura T20-S Complete, 1500mAh, SS Color Endura T22, 2000mAh, w/ Prism T22, Black Endura T22, 2000mAh, w/ Prism T22, Blue Endura T22, 2000mAh, w/ Prism T22, Silver EZ.WATT, 1500mAh, Black EZ.WATT, 1500mAh, Black + Red EZ.WATT, 1500mAh, Blue EZ.WATT, 1500mAh, Grey EZ.WATT, 1500mAh, Purple EZ.WATT, 1500mAh, Red GO S, 1500mAh, Black GO S, 1500mAh, Gunmetal GO S, 1500mAh, Light Blue GO S, 1500mAh, Pink GO S, 1500mAh, Stainless Steel Gomax Tube, 3000mAh, Black Gomax Tube, 3000mAh, Blue Gomax Tube, 3000mAh, Green Gomax Tube, 3000mAh, Pink Gomax Tube, 3000mAh, Yellow Jacket iTaste 134 E-Cig, Black iTaste 134 E-Cig, Stainless Steel iTaste 134 Mini E-Cig, Black iTaste 134 Mini E-Cig, Silver iTaste CLK! E-Cig, 800mAh, Black iTaste CLK! E-Cig, 800mAh, Silver iTaste DRV E-Cig, 2600mAh, Black iTaste EP E-Cig, 700mAh, Black iTaste EP E-Cig, 700mAh, Blue iTaste EP E-Cig, 700mAh, Purple iTaste EP E-Cig, 700mAh, Red iTaste EP E-Cig, 700mAh, Silver iTaste EP E-Cig, 700mAh, White iTaste EZ.TC, 1500mAh, w/ iClear 20D, Black iTaste EZ.TC, 1500mAh, w/ iClear 20D, Blue iTaste EZ.TC, 1500mAh, w/ iClear 20D, Gold iTaste EZ.TC, 1500mAh, w/ iClear 20D, Green iTaste EZ.TC, 1500mAh, w/ iClear 20D, Purple iTaste EZ.TC, 1500mAh, w/ iClear 20D, Red iTaste EZ.TC, 1500mAh, w/ iClear 20D, Silver iTaste MVP E-Cig, Black(w/CE5) iTaste MVP V1.0 E-Cig, Blue iTaste MVP V1.0 E-Cig, Silver iTaste MVP, 2600mAh, w/ iClear 16, Black iTaste MVP, 2600mAh, w/ iClear 16, Blue iTaste MVP, 2600mAh, w/ iClear 16, Silver iTaste MVP, 2600mAh, w/ iClear 30, Black iTaste MVP, 2600mAh, w/ iClear 30, Silver iTaste MVP, 2600mAh, w/ iClear30, Blue iTaste SVD E-Cig iTaste VV V3.0 E-Cig, 800mAh, Black (7-in-1) iTaste VV V3.0 E-Cig, 800mAh, White (7-in-1) iTaste VV, w/ CE4, Black (6-in-1) iTaste VV, w/ CE4, White (10-in-1) iTaste VV, w/ CE4, White (6-in-1) JEM / Goby (Goby Version), 1000mAh, Black JEM / Goby (Goby Version), 1000mAh, Blue JEM / Goby (Goby Version), 1000mAh, Grey JEM / Goby (Goby Version), 1000mAh, Purple JEM / Goby (Goby Version), 1000mAh, Red JEM / Goby (JEM Version), 1000mAh, Black JEM / Goby (JEM Version), 1000mAh, Blue JEM / Goby (JEM Version), 1000mAh, Grey JEM / Goby (JEM Version), 1000mAh, Purple JEM / Goby (JEM Version), 1000mAh, Red JEM Pen, 1000mAh, Black JEM Pen, 1000mAh, Blue JEM Pen, 1000mAh, Cosmos JEM Pen, 1000mAh, Pink JEM Pen, 1000mAh, Stainless Steel JEM Pen, 1000mAh, White Plexar 100W, w/ Plexus, Army Green (Standard) Plexar 100W, w/ Plexus, Black (Standard) Plexar 100W, w/ Plexus, Grey (Standard) Plexar 100W, w/ Plexus, White (Standard) Pocketbox, 1200mAh, Black Pocketbox, 1200mAh, Blue Pocketbox, 1200mAh, White Pocketmod, 2000mAh, Black Pocketmod, 2000mAh, Blue Pocketmod, 2000mAh, Grey Pocketmod, 2000mAh, Purple Pocketmod, 2000mAh, Red RipTide Crios(2ml), 3000mAh, Black RipTide Crios(2ml), 3000mAh, Blue RipTide Crios(2ml), 3000mAh, Green RipTide Crios(2ml), 3000mAh, Purple RipTide Crios(2ml), 3000mAh, Red RipTide Crios(2ml), 3000mAh, Yellow RipTide Crios(4ml), 3000mAh, Black RipTide Crios(4ml), 3000mAh, Blue RipTide Crios(4ml), 3000mAh, Green RipTide Crios(4ml), 3000mAh, Purple RipTide Crios(4ml), 3000mAh, Red RipTide Crios(4ml), 3000mAh, Yellow VTR E-Cig, Army Green VTR E-Cig, Grey Zlide Tube, 3000mAh, Black Zlide Tube, 3000mAh, Blue Zlide Tube, 3000mAh, Forest Camo Zlide Tube, 3000mAh, Pink Zlide Tube, 3000mAh, Spiral Zlide Tube, 3000mAh, Stainless Steel quantity get an alert when it's back change display currency Note: FastTech prices are charged in USD. These other currencies are displayed for your reference only. Age confirmation: By adding this item to your shopping cart, you confirm that you have reached the age of majority in your country of residence. Wishlist Report Errors Price Match Report Errors FastTech strives to display the most accurate information on product pages. If you know or suspect something is wrong, please let us know so it can be fixed. Please describe what is wrong: Cancel Price Match Competitor's price or packaged deal: Competitor's product page URL: Other comments: Cancel Subscribe to Product Be the first to know when the product's price or stock status change. Your e-mail address: Cancel Thank you We have received the information you submitted. Close Bulk Pricing
3 ~ 4 ~ 4 5 + $35.30 $34.99 looking for more?
|
{
"pile_set_name": "OpenWebText2"
}
|
Analysis of Cubicle 7’s Doctor Who – Adventures in Time and Space continues with the first supplement released in PDF format and soon to be in print, Aliens and Creatures. The first review can be seen by clicking HERE, I recommend it as a start to get a baseline of how I feel about the system before you dig into this one.
Effectively creating a monstrous compendium of Who villains, this expansion set seeks to add to the already considerable list in the core game. As with the base set, the creatures and artwork are designed to recreate what are primarily the 9th and 10th Doctors’ list of antagonists.
The product I reviewed is a collection of PDFs, which the publisher breaks down as the following:
138 page rulebook detailing many of the creatures faced in the Doctor’s adventures, including the Cybermen, Cult of Skaro, Davros, the Weeping Angels and the Hath, additional rules for creating your own creatures both as enemies or as playable characters, and a system for creating new worlds for your adventures to take place on
32 page Adventure book, featuring a whole new ready-to-play adventure and many ideas for additional stories
New gadget cards
Additional Story Point Counters
Detailed Creature Cards for easy reference
The Rulebook
Of that, it is clear that the obvious value is in the first bullet item, which is what the product is made for. Science Fiction has played host to some bizarre rogues galleries, but Doctor Who has claimed many of the best (and worst) of them. While I do appreciate the high quality images and design used in this particular booklet, I wish we could have seen some older creatures to make the book stand apart from its Game Master’s Guide equivalent section. Instead, we actually end up with a few reprints of species we have already seen put into stats coupled with one or in some cases several individual specimens or characters taken directly from the show. This happens to be one of the down points for established properties translating to role playing games. When I write a story to run for my group, or play in one, I want something fresh that feels as if the entire group created it. Often, I feel as if these books are written to give me the tools to play an existing episode of the television show, but little else.
I can’t say that more Doctor Who isn’t a good thing; plenty of the new aliens that were not in the original set will arrive at my table to challenge or interact with my players. Also, because the system is so simple I can foresee plenty of renaming to make my own necessary characters. I may never have a need for the Catkind named Thomas Kinkade Brannigan from the episode Gridlock, but if I did want to have a Catkind Pilot named Boots Zephyr who flies the Indomitable Hindenburg III in the year 29Apple4134, the former’s stats would substitute well.
Finally, the rulebook features a slew of new special abilities and gadgets throughout that would be very handy to the game master who is building his own allies or monsters.
The Adventures
I was pleased to see that this set included two new adventures and a handful of plot hooks, much like the base game. This time around we are treated to a story featuring false god aliens and a far future run-in with a Torchwood facility. Both are fun premises, but to save any potential spoilers I’ll leave it simply that I enjoyed reading through these stories more than I had the plot lines from the base set’s adventures. Somehow these simply felt more like a proper Doctor Who story.
The Rest
What we are left with after is an unfortunate portion to rule on when reviewing a PDF. More tokens, gadget cards, and Creature Card GM aides are great when you get to pop them out of their perforated sheet, but much less so in printing and cutting. Luckily, the PDF comes at a discounted value, so if you decide that these features are not “must-have” components, you can reasonably choose to save yourself the worry. However, as someone who loves goodies, I did feel like I was missing out a bit.
Final Verdict
In the end, I can’t say this book is necessary to enjoy what stands alone as a solidly fun and well written RPG, but it has its merits. If you are the sort of game master that disagrees with what I mentioned earlier regarding recreating episodes of the show or simply don’t want to take the time to create new adventures because of a busy schedule, the pair of adventures and pre-worked stats of so many creatures should make this a worthy buy. Otherwise, you might skip it. If you don’t, I might just recommend that you wait for the print edition to make full use of everything offered.
I'm a wild haired demi-viking living on the East Coast United States. I've run games in countless systems and tanked more game nights than I've ever run successfully, but hopefully I learned a lot in the process and I'd like to pass that on. Follow me on Twitter.
I’ll begin by saying that if you are unaware of the glory that is the British Science Fiction hit, Doctor Who, you have almost 50 years of television to catch up on. However, thankfully, Cubicle 7 wrote this game to cover a relatively small but very pertinent portion of the Doctor’s grand history. Though it makes reference to the series as a whole, we really are just concerned with “new Who”, starting in 2005 with Christopher Eccleston playing the 9th Doctor, and his regenerated replacement David Tennant, playing the 10th Doctor until 2009. So that’s not too much for you to catch up on, and I recommend you get started.
Initial Impressions
What stands out immediately about this product has already been said in countless reviews, but for the fact that it is such a strong feature, I’ll repeat it here; this system comes in a beautiful full color package that jumps out to sell the game immediately.
What isn’t said, however, is a lot about how to run the game system itself. I’ve been browsing quite a bit, and everyone wants to talk about how simple this system is, but nobody is actually getting into the grit of the rules at all, so when I got into my box set of Doctor Who – Adventures in Time and Space I was a little disappointed to find my expectations weren’t really met. But then I learned that isn’t entirely a bad thing.
So how does one play a Time Lord?
The core rule does seem to be presented as simple as everyone says it is. You take your base Attribute, add a Skill, roll 2d6, and compare the totaled result to a predetermined difficulty. This sounds easy as a Jelly Baby, but unfortunately that rule of thumb gets muddled pretty quickly. Sometimes you add Attribute + Attribute, other times you might even justify Skill + Skill, and rarely is it entirely clear exactly which Skills you should be using. Everything is open to this sort of negotiation between game master and player.
This wasn’t the only rule that didn’t turn out as straightforward as I was led to believe. Nearly every character feature, called a Trait, is designed in such a way that seems very open for interpretation. Situational modifiers are a common theme in RPGs, but this game depends on them to an extreme. This isn’t to say I don’t like it, but it takes some creativity to play it out. Having Traits that do not define the character but are effectively loose descriptors does draw them into focus during role play, which is nice.
After you have figured what numbers to add together, you are going to roll the dice and the game master will compare that totaled result to his difficulty target much like any other game, but this is not a binary pass/fail test. Instead, you are given a track ranging from three options for failure, and three for success. I love this idea, but it can mean a lot of work at the table. Each result requires a level of interpretation and possibly a new story element to be added. If you succeed particularly well, you may achieve results above and beyond the attempt, but if you fail miserably not only does the threat stand, but something dramatically worse can happen. Sorry Doctor, you TRIED to disable the Dalekanium bomb, but Davros planned ahead and put a feedback loop in to fry your Sonic Screwdriver for good! Well, that would probably be a pretty serious failure, but you get the idea.
Lastly, you have the player’s means to change the game and break the rules, Story Points. Not a new concept, but something I’ve always been fond of, is giving some control back to the players. Gaming is an effort in collaborative fantasy, so I love these. Players start with a set pool, reduced if they have special characteristics or gadgets that require them, and they can spend one or more points at critical times in the game to ignore damage or find that piece of crystal that is “just what they need” to restore power to the Ood Sphere’s generator before everyone freezes to death. Whatever it takes, their value is an agreement between player and Game Master.
Win the War by Not Fighting
It is no secret to watchers of the show that the Doctor hates guns. Many, many, many role players consider table-top gaming to be the sort of thing that revolves around slaying hordes of monsters, but this simply isn’t one of those types of games. Combat can be incredibly lethal in this game, but at the start of every round, before anything else happens, you have a chance to stop the fight entirely. Players can try to make dice rolls (and some role play) to use the raw force of their presence to prevent a fight from ever happening. This fits perfectly with the Doctor’s use of bravado and intimidation, as well as his occasional plea of, “Wait, wait, wait, wait!” to buy some time.
But Don’t Forget the Extras
To review this product properly you cannot ignore all of its features. Boxed sets are making a comeback and this is how to do it right. The full Game Master’s Guide gives a detailed and robust layout of the system and the trimmed down Player’s Guide has everything the rest of the group might need. They can be a little repetitive internally and as a pair, but both are well written over all.
Some other items include
Full color blank character sheets (Who writes on these though? You don’t want to ruin the ones that came with the box! Or is that just me?)
A very nice stack of filled out full color character sheets including major characters from the 2005-2009 run of the show, as well as some generic archetype sheets that have basic information filled out ready to be fleshed into actual characters by a willing player (or Game Master in a pinch for an NPC).
Six clear d6 with blue pips, very stylish looking.
Punch-Out item cards for some gadgets that have featured in the show, and some blanks, to be handed out to players.
Punch-Out tokens to track Story Points.
A couple of fleshed out adventures that could almost turn into a review of their own, and a bunch of hooks to create your own adventures. I found the hooks to be far better written than the actual adventures, but there are some neat ideas to be found in both.
The Game Master’s Guide features pretty strong gallery of Doctor Who enemies, and is well laid out.
Afterword
For all of its simplicities, the game is not one that simple to run, but that isn’t to say you can’t have a blast with it. If you are a Doctor Who fan, this is great to have just to flip through. If everyone in the group at your game table are fans, then this is a must buy. I have never once run a game where players took on the roles of established characters before, but somehow a time and space traveling alien who is the last of his species forced me to. I gave each my group the option of running a cannon character or an original, and not one went for the original. All of them are Doctor Who fans, and there’s just no way you can give up the opportunity to gallivant from world to world as the Doctor or make borderline inappropriate comments as Captain Jack Harkness with a disabling wink and a smile. If you know the source material, it’s just too much fun. If you aren’t a fan though, there is still some value here. Cubicle 7 built a very good system for non-violent play. If you are looking to introduce gaming to a younger audience or even one that is simply not at aggressive, this rules set could easily be adapted to any setting.
Have You Played?
If any of you out there are running it, I’d love to hear how you’ve gotten around the frustrations I’ve experienced. I’ve got a campaign running now, so any advice would be great.
Coming Soon!
As a follow-up to this post, I’ll be doing a slightly shorter review of Aliens and Creatures, the second product in this line that includes more monsters, gadgets, and adventures for Doctor Who – Adventures in Time and Space.
I'm a wild haired demi-viking living on the East Coast United States. I've run games in countless systems and tanked more game nights than I've ever run successfully, but hopefully I learned a lot in the process and I'd like to pass that on. Follow me on Twitter.
In the world of fantasy literature, well escape fiction anyway, there seems to be two schools of thought. On one end of the spectrum we have the Hero’s journey. A weaving story telling the rags to riches tale of a young hero and his band of stalwart companions. At the other, much more epic end, we have the deliciously machiavellian maneuverings of a grand army and all of the battles that result. One of these things tabletop fantasy has traditionally done very well. The other, not so much. I am speaking, of course, of warfare. Usually when a game goes this way we have to hack something together to make it work. Most of the time it ends up cumbersome. Well, Cubicle 7 and Adamant Entertainment reckon they have a solution in their latest product, Warpath.
The Product
I got my hands on the PDF version of the book. It’s 65 pages long in black and white and has a torn page background which looks a bit odd without color. To be honest, it’s pretty standard fair. We’ve got a mix of art, most of it is medium to high quality, but the variety in art styles prevents it from feeling particularly cohesive. The book also begins with several pages of fiction. I’ll be honest. I didn’t do more than skim it. I don’t mind little pieces of flash fiction in my RPG books, but I don’t want more than a few paragraphs at a time. It seemed well enough written but not so good that I actually felt the need to read it.
The book’s layout is done well. It is presented in a logical order and has a table of contents if you need to track down a particular section quickly. I was a little disappointed that they didn’t include internal links in the PDF, but the presence of an actual sample scenario more than made up for that.
The System/Rules
Warpath is a supplement for the Pathfinder Role Playing Game and makes ample reference to the core PFRPG rules. Even so, I don’t see any reason why you couldn’t use it with D&D 3.5. The only problem with that might be the lack of CMD or CMB in 3.5, which could potentially make things very annoying.
The basics of the system have players dividing their armies into units and representing those units on index cards (Hereon called recipe cards because I like food more than work.). On these cards you will lay out all of the stats for the unit. For the most part these are ripped directly out of regular PFRPG combat rules, although there are a few additions such as Unit Power and Unit Mass. You also draw an arrow so that you know which way the unit is facing.
Actual combat works the same way as in Pathfinder with a few differences. Positioning becomes very important, as do formations and overall tactics. Luckily this is all covered in detail in the book. The actual flow of combat is changed a bit as well. Commanders (that’s the players) roll initiative at the beginning and then move their units around. When a player attacks things are resolved in a specific order. First ranged attacks and then melee attacks. After each attack the overall unit stats are altered to reflect losses.
The presence of battlefield commanders can improve unit odds and also offer a nice target for the enemy. If all the commanders are killed/captured then the army is routed. Speaking of routing, that seems to be what you want to aim for. You can rout individual units (make them run away). If you can do it they suffer so many penalties that you can easily finish them off. Don’t think it is all just lining up in a field and running into each other though. Tactics and positioning are important in this game and the section covering siege warfare looks very promising.
There are a few other good bits and pieces in here, such as mass use of magic and a section on running a city. Both of which would be useful if you are playing through a military campaign. I also enjoyed the section on ransoming nobles. Of all the little extras, I’d say the quick battle resolution is probably the most useful. This little section offers up a few tables that a GM can use to determine the outcome of a pitched battle as well as the number of losses on each side. I expect this would see a lot of usage from me as I’d probably gloss over all but the most important battles.
How it Plays
I sat down with a friend and we used the point buy rules to build a couple of armies to bash each other with. This was actually much quicker to set up than your standard game of Warhammer. After you factor out all the furious scribbling on recipe cards that is. If we had already prepared units it would have been a matter of just a few minutes. The point buy rules are great. They are based strictly off of the CR of the base creature and a quick little formula involving HD and number of troops. It’s easier than that last sentence would have you believe. Easy enough for me to have an army of lizardmen face off against some goblins.
Things proceeded pretty much as you would suspect. We maneuvered our cards around for a bit and then the horde of goblins enveloped my lizardmen and the battle devolved into what I shall fondly refer to as mud-slinging. The superior goblin numbers gave my opponent a distinct advantage in flanking and other position related maneuvers. The lizardmen were taken out, but not without making a valiantly spartan attempt at holding off the horde.
In practice the battle wasn’t really anymore cumbersome than ordinary pathfinder combat. It was slower. Much slower. I can’t really blame the game for that though. Both of us spent far too much time staring at the table and trying to come up with the best plan. I can imagine this becoming even more involved when you have 5 players sitting at a table all with different opinions on what troops should be doing. I’d suggest an egg timer or something to help prevent this. I’d also recommend that you have a couple calculators as it is pretty easy to mess up troop recalculations after every attack.
If you’ve ever played a tabletop war game like Warhammer or Warmachine you’ll have a pretty good idea of what to expect, only with a distinctly D&D/PF feel to the rules. They even acknowledge this with a section on using point buy army creation if you want to play it as a traditional war game.
Verdict
Despite Warpath’s striking similarities to standard Pathfinder combat, I still found it enjoyable. This might have something to do with the shear numbers of characters involved in each fight. One thing I did have trouble with was shaking the feeling that I was just playing standard combat and was just calling each mini 200 of whatever it was. There are enough additional rules and little changes that make this not exactly the case, but it definitely sits back there nagging at you. Mind you, they advertise it as a Pathfinder supplement and not a standalone game, so it fits into PFRPG nicely.
I can see myself using this as a cheap war game when I get the hankering for one. I got out of the warhammer game a long time ago and I’m in no rush to get back into it, but I still enjoy the odd afternoon of pushing troops around. As far as seeing use in an actual role playing campaign? I’m not so sure. I might use the quick resolution rules once and a while and if my players ever end up in control of an army it might see some use. I can’t really see myself dropping it into a preexisting game. I think if I wanted to use this it would be if I wanted to do a Game of Thrones style campaign where troops, politics, and city management were the main focus.
At $10 and for the PDF I’d recommend it if you like wargames or are planning a game heavily focused on large scale military campaigning. If you don’t think you will be seeing many armies clash at your game table then you are probably better off home brewing up something a bit less comprehensive. The hard copy, at $18, is a solid skip if you ask me. There are only a few pages that you actually need for reference and you can print those. As an ex-wargamer I like the product, but it certainly isn’t for everyone.
|
{
"pile_set_name": "Pile-CC"
}
|
Product Information
A technical midlayer designed to insulate and breathe during cold, high-output days up in the mountains, out on the slopes or on the trails, the Men's Descender Vest provides essential core warmth without inhibiting movement. It's made with our 240gm textured terry corespun fabric, which features merino wool fibers wrapped around a nylon core, for increased durability and strength while retaining next-to-skin softness. The Descender Vest is quick-drying and the right choice for effective layering. It features a high-loft brushed back with heat-trapping channels to help regulate your temperature during technical high-exertion pursuits like skiing, climbing or running in cold conditions. Lighter-weight side panels help manage moisture and dump excess heat when you're moving fast, and the zippered chest pocket with media cord port keeps your music flowing or stashes small essentials.
|
{
"pile_set_name": "Pile-CC"
}
|
Nucleus-specific effects of meal duration on daily profiles of Period1 and Period2 protein expression in rats housed under restricted feeding.
Restricted feeding (RF) schedules provide a cycle of fasting and feeding each day and induce circadian rhythms in food-anticipatory activity. In addition, daily rhythms in the expression of circadian clock genes, such as rhythms in Period1 (PER1) or Period2 (PER2), are also shifted in many brain areas that are important for the regulation of motivation and emotion. In order to differentiate brain areas that respond to the time of food presentation from areas that are sensitive to the degree of restriction, the present study compared RF schedules that provided rats with either a 2 h-meal (2hRF) or a 6 h-meal (6hRF) each day. As expected, 2hRF was associated with less food-consumption, more weight-loss, and more food-anticipatory running-wheel activity than 6hRF. In association with these metabolic and behavioral differences, the daily pattern of PER1 and PER2 expression in the dorsomedial hypothalamic nucleus (DMH), which has been proposed to be integral to the generation and/or maintenance of food-anticipatory activities, peaked earlier in the 2hRF group and later in the 6hRF group. Because both RF groups exhibited approximately synchronous food-anticipatory activity, but phase shifted rhythms of PER1 and PER2 expression in the DMH, it suggests that the phase of food-anticipatory activity is not directly regulated by this brain area. Next, daily rhythms of PER2 expression in the limbic forebrain responded to each RF schedule in a nucleus-specific manner. In some brain areas, the amplitude of the PER2 rhythm was differentially adjusted in response to 2hRF and 6hRF, while other areas, responded similarly to both RF schedules. These findings demonstrate that daily rhythms of clock gene expression can be modulated by the motivational state of the animal, as influenced by meal duration, weight loss and food-consumption.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Tag: Kiosk Bill Jam
Bill jams are commonplace when your kiosk accepts cash payments. No matter how advanced the bill acceptor, there’s always that guy that inserts a bill covered in mud, or something worse, and gums up the device.
Since you’re reading this article you’re probably wanting to add support for accepting payments from an MEI bill acceptor into your kiosk application. If this is the case then we think you’ll be pleasantly surprised just how easy this is to accomplish when you use the KioskSimple API. One of the main draws of KioskSimple is just how simple we make it to integrate with popular kiosk payment devices like MEI bill acceptors. KioskSimple currently supports the MEI AE and SC series bill acceptors along with the MEI BNR (Bulk Note Recycler). Continue reading “Integrating MEI Bill Acceptors Into Your Kiosk Application”
|
{
"pile_set_name": "Pile-CC"
}
|
Redox-Regulated, Targeted Affinity Isolation of NADH-Dependent Protein Interactions with the Branched Chain Aminotransferase Proteins.
Isolation and identification of protein targets for redox-active proteins is challenging. The human branched chain aminotransferase (hBCAT) proteins are redox active transaminases that can be regulated through oxidation, S-nitrosation and S-glutathionylation. This metabolic protein was shown to associate with the E1 decarboxylase component of the branched-chain α-keto acid dehydrogenase complex in a NADH-dependent manner, where mutation of the CXXC center was shown to prevent complex formation. To determine if the redox state of the CXXC motif can influence other NADH-dependent protein-protein interactions, proteins were extracted from neuronal cells treated under reduced and oxidized conditions and then isolated using targeted affinity chromatography, resolved using 2D electrophoresis. Select proteins spots were excised and identified using a quadrupole time of flight mass spectrometer (Thermo) with a precursor tolerance of 10 ppm and subsequently analyzed using Proteome Discoverer 2.1 with Swiss-Prot human DB. Mass tolerances for precursor/product were set to 10 ppm/0.6 Da and data were filtered by peptide confidence with PD2.1. It was determined that the protein profile considerably altered in both number and abundance dependent on the redox state of the cell and also on the availability of the redox active thiol groups. The biological relevance of the newly identified partners was determined using DAVID, the bioinformatics database, which indicated that proteins important to cytoskeletal function, protein transport, protein synthesis, chaperone activity, and cell signaling.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
Display Ajax response in HTML
I'm calling a PHP file, and it's returning the response when I view it in Firebug. However, it's not displaying on my page. I'm not sure if the success is actually firing, because I can't even run an alert, but it is working because the PHP code is firing and returning what it's supposed to.
<script type="text/javascript" src="//code.jquery.com/jquery-1.10.2.min.js"></script>
<script>
$.ajax({
type: "GET",
url: 'https://www.example.com',
dataType: 'jsonp',
contentType: "text/html",
crossDomain:'true',
success: function (data) {
$(".result").html(data);
}
});
</script>
<div class="result"></div>
A:
You need to make the ajax call on load or document ready. The div may not exist at the time of response (page is interpreted top down).
|
{
"pile_set_name": "StackExchange"
}
|
<div>
<div metal:define-macro="test1">
t1.v1:<span metal:define-slot="val1">test1: val1 should go here</span>
</div>
<div metal:define-macro="test2">
t2.v1:<span metal:define-slot="val1">test2: val1 should go here</span>
t2.v2:<span metal:define-slot="val2">test2 OK: unfilled val2</span>
</div>
<div metal:use-macro="test1">
<div metal:fill-slot="val2">test1: unused invalid val2</div>
<div metal:fill-slot="val1" tal:omit-tag="">
<div metal:use-macro="test2">
<span metal:fill-slot="val1">OK: filled from test2/val1</span>
</div>
</div>
</div>
</div>
|
{
"pile_set_name": "Github"
}
|
/*
* This file is subject to the terms and conditions of the GNU General Public
* License. See the file "COPYING" in the main directory of this archive
* for more details.
*
* Copyright (C) 2003 Ladislav Michl
* Copyright (C) 2004 Ralf Baechle
*/
#ifndef __ASM_MACH_IP32_MANGLE_PORT_H
#define __ASM_MACH_IP32_MANGLE_PORT_H
#define __swizzle_addr_b(port) ((port) ^ 3)
#define __swizzle_addr_w(port) ((port) ^ 2)
#define __swizzle_addr_l(port) (port)
#define __swizzle_addr_q(port) (port)
# define ioswabb(a, x) (x)
# define __mem_ioswabb(a, x) (x)
# define ioswabw(a, x) (x)
# define __mem_ioswabw(a, x) cpu_to_le16(x)
# define ioswabl(a, x) (x)
# define __mem_ioswabl(a, x) cpu_to_le32(x)
# define ioswabq(a, x) (x)
# define __mem_ioswabq(a, x) cpu_to_le32(x)
#endif /* __ASM_MACH_IP32_MANGLE_PORT_H */
|
{
"pile_set_name": "Github"
}
|
# Copyright 2016 The TensorFlow Authors. All Rights Reserved.
#
# 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
#
# http://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.
# ==============================================================================
"""Tests for nets.inception_v1."""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import numpy as np
import tensorflow as tf
from nets import inception
slim = tf.contrib.slim
class InceptionV3Test(tf.test.TestCase):
def testBuildClassificationNetwork(self):
batch_size = 5
height, width = 299, 299
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
logits, end_points = inception.inception_v3(inputs, num_classes)
self.assertTrue(logits.op.name.startswith('InceptionV3/Logits'))
self.assertListEqual(logits.get_shape().as_list(),
[batch_size, num_classes])
self.assertTrue('Predictions' in end_points)
self.assertListEqual(end_points['Predictions'].get_shape().as_list(),
[batch_size, num_classes])
def testBuildBaseNetwork(self):
batch_size = 5
height, width = 299, 299
inputs = tf.random_uniform((batch_size, height, width, 3))
final_endpoint, end_points = inception.inception_v3_base(inputs)
self.assertTrue(final_endpoint.op.name.startswith(
'InceptionV3/Mixed_7c'))
self.assertListEqual(final_endpoint.get_shape().as_list(),
[batch_size, 8, 8, 2048])
expected_endpoints = ['Conv2d_1a_3x3', 'Conv2d_2a_3x3', 'Conv2d_2b_3x3',
'MaxPool_3a_3x3', 'Conv2d_3b_1x1', 'Conv2d_4a_3x3',
'MaxPool_5a_3x3', 'Mixed_5b', 'Mixed_5c', 'Mixed_5d',
'Mixed_6a', 'Mixed_6b', 'Mixed_6c', 'Mixed_6d',
'Mixed_6e', 'Mixed_7a', 'Mixed_7b', 'Mixed_7c']
self.assertItemsEqual(end_points.keys(), expected_endpoints)
def testBuildOnlyUptoFinalEndpoint(self):
batch_size = 5
height, width = 299, 299
endpoints = ['Conv2d_1a_3x3', 'Conv2d_2a_3x3', 'Conv2d_2b_3x3',
'MaxPool_3a_3x3', 'Conv2d_3b_1x1', 'Conv2d_4a_3x3',
'MaxPool_5a_3x3', 'Mixed_5b', 'Mixed_5c', 'Mixed_5d',
'Mixed_6a', 'Mixed_6b', 'Mixed_6c', 'Mixed_6d',
'Mixed_6e', 'Mixed_7a', 'Mixed_7b', 'Mixed_7c']
for index, endpoint in enumerate(endpoints):
with tf.Graph().as_default():
inputs = tf.random_uniform((batch_size, height, width, 3))
out_tensor, end_points = inception.inception_v3_base(
inputs, final_endpoint=endpoint)
self.assertTrue(out_tensor.op.name.startswith(
'InceptionV3/' + endpoint))
self.assertItemsEqual(endpoints[:index+1], end_points)
def testBuildAndCheckAllEndPointsUptoMixed7c(self):
batch_size = 5
height, width = 299, 299
inputs = tf.random_uniform((batch_size, height, width, 3))
_, end_points = inception.inception_v3_base(
inputs, final_endpoint='Mixed_7c')
endpoints_shapes = {'Conv2d_1a_3x3': [batch_size, 149, 149, 32],
'Conv2d_2a_3x3': [batch_size, 147, 147, 32],
'Conv2d_2b_3x3': [batch_size, 147, 147, 64],
'MaxPool_3a_3x3': [batch_size, 73, 73, 64],
'Conv2d_3b_1x1': [batch_size, 73, 73, 80],
'Conv2d_4a_3x3': [batch_size, 71, 71, 192],
'MaxPool_5a_3x3': [batch_size, 35, 35, 192],
'Mixed_5b': [batch_size, 35, 35, 256],
'Mixed_5c': [batch_size, 35, 35, 288],
'Mixed_5d': [batch_size, 35, 35, 288],
'Mixed_6a': [batch_size, 17, 17, 768],
'Mixed_6b': [batch_size, 17, 17, 768],
'Mixed_6c': [batch_size, 17, 17, 768],
'Mixed_6d': [batch_size, 17, 17, 768],
'Mixed_6e': [batch_size, 17, 17, 768],
'Mixed_7a': [batch_size, 8, 8, 1280],
'Mixed_7b': [batch_size, 8, 8, 2048],
'Mixed_7c': [batch_size, 8, 8, 2048]}
self.assertItemsEqual(endpoints_shapes.keys(), end_points.keys())
for endpoint_name in endpoints_shapes:
expected_shape = endpoints_shapes[endpoint_name]
self.assertTrue(endpoint_name in end_points)
self.assertListEqual(end_points[endpoint_name].get_shape().as_list(),
expected_shape)
def testModelHasExpectedNumberOfParameters(self):
batch_size = 5
height, width = 299, 299
inputs = tf.random_uniform((batch_size, height, width, 3))
with slim.arg_scope(inception.inception_v3_arg_scope()):
inception.inception_v3_base(inputs)
total_params, _ = slim.model_analyzer.analyze_vars(
slim.get_model_variables())
self.assertAlmostEqual(21802784, total_params)
def testBuildEndPoints(self):
batch_size = 5
height, width = 299, 299
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
_, end_points = inception.inception_v3(inputs, num_classes)
self.assertTrue('Logits' in end_points)
logits = end_points['Logits']
self.assertListEqual(logits.get_shape().as_list(),
[batch_size, num_classes])
self.assertTrue('AuxLogits' in end_points)
aux_logits = end_points['AuxLogits']
self.assertListEqual(aux_logits.get_shape().as_list(),
[batch_size, num_classes])
self.assertTrue('Mixed_7c' in end_points)
pre_pool = end_points['Mixed_7c']
self.assertListEqual(pre_pool.get_shape().as_list(),
[batch_size, 8, 8, 2048])
self.assertTrue('PreLogits' in end_points)
pre_logits = end_points['PreLogits']
self.assertListEqual(pre_logits.get_shape().as_list(),
[batch_size, 1, 1, 2048])
def testBuildEndPointsWithDepthMultiplierLessThanOne(self):
batch_size = 5
height, width = 299, 299
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
_, end_points = inception.inception_v3(inputs, num_classes)
endpoint_keys = [key for key in end_points.keys()
if key.startswith('Mixed') or key.startswith('Conv')]
_, end_points_with_multiplier = inception.inception_v3(
inputs, num_classes, scope='depth_multiplied_net',
depth_multiplier=0.5)
for key in endpoint_keys:
original_depth = end_points[key].get_shape().as_list()[3]
new_depth = end_points_with_multiplier[key].get_shape().as_list()[3]
self.assertEqual(0.5 * original_depth, new_depth)
def testBuildEndPointsWithDepthMultiplierGreaterThanOne(self):
batch_size = 5
height, width = 299, 299
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
_, end_points = inception.inception_v3(inputs, num_classes)
endpoint_keys = [key for key in end_points.keys()
if key.startswith('Mixed') or key.startswith('Conv')]
_, end_points_with_multiplier = inception.inception_v3(
inputs, num_classes, scope='depth_multiplied_net',
depth_multiplier=2.0)
for key in endpoint_keys:
original_depth = end_points[key].get_shape().as_list()[3]
new_depth = end_points_with_multiplier[key].get_shape().as_list()[3]
self.assertEqual(2.0 * original_depth, new_depth)
def testRaiseValueErrorWithInvalidDepthMultiplier(self):
batch_size = 5
height, width = 299, 299
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
with self.assertRaises(ValueError):
_ = inception.inception_v3(inputs, num_classes, depth_multiplier=-0.1)
with self.assertRaises(ValueError):
_ = inception.inception_v3(inputs, num_classes, depth_multiplier=0.0)
def testHalfSizeImages(self):
batch_size = 5
height, width = 150, 150
num_classes = 1000
inputs = tf.random_uniform((batch_size, height, width, 3))
logits, end_points = inception.inception_v3(inputs, num_classes)
self.assertTrue(logits.op.name.startswith('InceptionV3/Logits'))
self.assertListEqual(logits.get_shape().as_list(),
[batch_size, num_classes])
pre_pool = end_points['Mixed_7c']
self.assertListEqual(pre_pool.get_shape().as_list(),
[batch_size, 3, 3, 2048])
def testUnknownImageShape(self):
tf.reset_default_graph()
batch_size = 2
height, width = 299, 299
num_classes = 1000
input_np = np.random.uniform(0, 1, (batch_size, height, width, 3))
with self.test_session() as sess:
inputs = tf.placeholder(tf.float32, shape=(batch_size, None, None, 3))
logits, end_points = inception.inception_v3(inputs, num_classes)
self.assertListEqual(logits.get_shape().as_list(),
[batch_size, num_classes])
pre_pool = end_points['Mixed_7c']
feed_dict = {inputs: input_np}
tf.global_variables_initializer().run()
pre_pool_out = sess.run(pre_pool, feed_dict=feed_dict)
self.assertListEqual(list(pre_pool_out.shape), [batch_size, 8, 8, 2048])
def testUnknowBatchSize(self):
batch_size = 1
height, width = 299, 299
num_classes = 1000
inputs = tf.placeholder(tf.float32, (None, height, width, 3))
logits, _ = inception.inception_v3(inputs, num_classes)
self.assertTrue(logits.op.name.startswith('InceptionV3/Logits'))
self.assertListEqual(logits.get_shape().as_list(),
[None, num_classes])
images = tf.random_uniform((batch_size, height, width, 3))
with self.test_session() as sess:
sess.run(tf.global_variables_initializer())
output = sess.run(logits, {inputs: images.eval()})
self.assertEquals(output.shape, (batch_size, num_classes))
def testEvaluation(self):
batch_size = 2
height, width = 299, 299
num_classes = 1000
eval_inputs = tf.random_uniform((batch_size, height, width, 3))
logits, _ = inception.inception_v3(eval_inputs, num_classes,
is_training=False)
predictions = tf.argmax(logits, 1)
with self.test_session() as sess:
sess.run(tf.global_variables_initializer())
output = sess.run(predictions)
self.assertEquals(output.shape, (batch_size,))
def testTrainEvalWithReuse(self):
train_batch_size = 5
eval_batch_size = 2
height, width = 150, 150
num_classes = 1000
train_inputs = tf.random_uniform((train_batch_size, height, width, 3))
inception.inception_v3(train_inputs, num_classes)
eval_inputs = tf.random_uniform((eval_batch_size, height, width, 3))
logits, _ = inception.inception_v3(eval_inputs, num_classes,
is_training=False, reuse=True)
predictions = tf.argmax(logits, 1)
with self.test_session() as sess:
sess.run(tf.global_variables_initializer())
output = sess.run(predictions)
self.assertEquals(output.shape, (eval_batch_size,))
def testLogitsNotSqueezed(self):
num_classes = 25
images = tf.random_uniform([1, 299, 299, 3])
logits, _ = inception.inception_v3(images,
num_classes=num_classes,
spatial_squeeze=False)
with self.test_session() as sess:
tf.global_variables_initializer().run()
logits_out = sess.run(logits)
self.assertListEqual(list(logits_out.shape), [1, 1, 1, num_classes])
if __name__ == '__main__':
tf.test.main()
|
{
"pile_set_name": "Github"
}
|
Day: June 8, 2017
PUEBLA CITY – María Lorena Ramírez, a native Rarámuri woman from Mexico, has not only managed to finish a 50 km Cerro Rojo Ultramarathon, in Puebla, central Mexico, but actually won it without any professional […]
|
{
"pile_set_name": "Pile-CC"
}
|
Kolwiny
Kolwiny () is a village in the administrative district of Gmina Barciany, within Kętrzyn County, Warmian-Masurian Voivodeship, in northern Poland, close to the border with the Kaliningrad Oblast of Russia. It lies approximately west of Barciany, north-west of Kętrzyn, and north-east of the regional capital Olsztyn.
Before 1945 the area was part of Germany (East Prussia).
References
Kolwiny
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Q:
What results from the reaction of 5-bromopentan-1-ol and NaOH?
In our chemistry class, we noted three molecules that result from the reaction:
pentane-(1,5)-diol
This one is simple to understand, simply a nucleophilic substitution between $\ce{Br^-}$ and $\ce{OH^-}$.
(1,5)-epoxypentane
This is the main result, resulting from the intramolecular esterification of the two $\ce{OH^-}$ groups of the previous molecule. This is wrong, please see the explanation
by ringo
4-penten-1-ol
This one, I don't understand. How is this a possible result? Could anyone help me understand? Thank you for your time.
A:
The three reactions are:
An $\mathrm{S_N2}$:
Deprotonation followed by an intramolecular Williamson ether synthesis ($\mathrm{S_N2}$):
An $\mathrm{E2}$:
|
{
"pile_set_name": "StackExchange"
}
|
Now adored, this original wax version of Edgar Degas ’ Little Dancer Aged Fourteen was reviled by most critics when it was shown at the 1881 impressionist exhibition in Paris. Art critic Elie de Mont was flabbergasted: “I don’t ask that art should always be elegant, but I don’t believe that its role is to champion the cause of ugliness.” The diminutive figure, the only sculpture Degas exhibited publicly, was described variously as “repulsive,” “vicious,” and “a threat to society.” Modeled in colored wax and adorned with real hair and a fabric costume, Little Dancer decisively broke with 19th-century academic practice by introducing unusual mixed materials and frankly representing a provocative modern subject; Degas added to the controversy by exhibiting it like an anthropological specimen in a glass vitrine.
Degas’ uncannily realistic depiction of an “opera rat,” as young dancers with the Paris Opera ballet were known, was a deeply unsettling challenge both to academic tradition and to French bourgeois society. It forced viewers to confront the seamy side of the ballet, the cultural institution at the center of metropolitan life. The rats, including the model for this figure, mostly came from working-class families and were popularly understood to be vulnerable to moral corruption at the hands of well-off suitors. Degas visualized this potential link with vice by flattening the model’s facial features, exaggerating the low forehead, and making the jaw protrude, adjustments that conformed to popular scientific notions that linked physiognomy and degeneracy. His novel use of unorthodox materials—hair, silk hair ribbon, linen bodice, muslin tutu, and satin slippers—underscored his determination to make naturalism rather than idealization the standard for modern sculptural practice.
Little Dancer is an unflinching look at a troubling working-class subject, but it is also endowed with humanity. Poised between girl and woman, the bony figure of model Marie van Goethem, her body shaped by endless practice, is simultaneously vulnerable and proud. Her stance atop a wooden base reminiscent of a rehearsal floor is casual by ballet standards, but far from relaxed. The right foot is placed far forward and turned out 90 degrees. Her arms are stretched uncomfortably behind her back, the fingers of both hands intertwined. With her shoulders back and her head held high and slightly upturned, her posture is erect and dignified, even haughty, a bearing emphasized in ballet training, but here particularly poignant.
Degas never exhibited the sculpture again, and Little Dancer was largely forgotten until it was rediscovered, together with dozens of other wax sculptures, in the artist’s studio after his death in 1917. Most of these original sculptures are now in the National Gallery of Art’s collection, while bronze casts made from these wax originals after Degas’ death can be found around the world.
|
{
"pile_set_name": "OpenWebText2"
}
|
/*
* Copyright 2010-2013 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file 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.
*/
package com.amazonaws.geo.model;
import java.util.ArrayList;
import java.util.List;
import com.amazonaws.geo.GeoDataManagerConfiguration;
import com.amazonaws.geo.s2.internal.S2Manager;
public class GeohashRange {
private long rangeMin;
private long rangeMax;
public GeohashRange(long range1, long range2) {
this.rangeMin = Math.min(range1, range2);
this.rangeMax = Math.max(range1, range2);
}
public boolean tryMerge(GeohashRange range) {
if (range.getRangeMin() - this.rangeMax <= GeoDataManagerConfiguration.MERGE_THRESHOLD
&& range.getRangeMin() - this.rangeMax > 0) {
this.rangeMax = range.getRangeMax();
return true;
}
if (this.rangeMin - range.getRangeMax() <= GeoDataManagerConfiguration.MERGE_THRESHOLD
&& this.rangeMin - range.getRangeMax() > 0) {
this.rangeMin = range.getRangeMin();
return true;
}
return false;
}
/*
* Try to split the range to multiple ranges based on the hash key.
*
* e.g., for the following range:
*
* min: 123456789
* max: 125678912
*
* when the hash key length is 3, we want to split the range to:
*
* 1
* min: 123456789
* max: 123999999
*
* 2
* min: 124000000
* max: 124999999
*
* 3
* min: 125000000
* max: 125678912
*
* For this range:
*
* min: -125678912
* max: -123456789
*
* we want:
*
* 1
* min: -125678912
* max: -125000000
*
* 2
* min: -124999999
* max: -124000000
*
* 3
* min: -123999999
* max: -123456789
*/
public List<GeohashRange> trySplit(int hashKeyLength) {
List<GeohashRange> result = new ArrayList<GeohashRange>();
long minHashKey = S2Manager.generateHashKey(rangeMin, hashKeyLength);
long maxHashKey = S2Manager.generateHashKey(rangeMax, hashKeyLength);
long denominator = (long) Math.pow(10, String.valueOf(rangeMin).length() - String.valueOf(minHashKey).length());
if (minHashKey == maxHashKey) {
result.add(this);
} else {
for (long l = minHashKey; l <= maxHashKey; l++) {
if (l > 0) {
result.add(new GeohashRange(l == minHashKey ? rangeMin : l * denominator,
l == maxHashKey ? rangeMax : (l + 1) * denominator - 1));
} else {
result.add(new GeohashRange(l == minHashKey ? rangeMin : (l - 1) * denominator + 1,
l == maxHashKey ? rangeMax : l * denominator));
}
}
}
return result;
}
public long getRangeMin() {
return rangeMin;
}
public void setRangeMin(long rangeMin) {
this.rangeMin = rangeMin;
}
public long getRangeMax() {
return rangeMax;
}
public void setRangeMax(long rangeMax) {
this.rangeMax = rangeMax;
}
}
|
{
"pile_set_name": "Github"
}
|
Schools
At the heart of HVAC systems in today’s schools, you’ll find a Copeland Scroll™ compressor. Schools are continuously looking at ways to reduce costs and the Copeland Scroll compressor is designed to provide high-efficiency cooling to help schools keep their HVAC operating costs down. The award-winning Copeland Scroll Digital™ compressor provides even better comfort by precisely controlling temperature and humidity to match varying load conditions found in many classrooms today.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
How can i write Routes dynamically to routes.ini file?
I need to Add Routes to my routes.ini file dynamically.Below is my code.
$appConfigPath = APPLICATION_PATH . '/configs/routes.ini';
$appConfig = new Zend_Config_Ini($appConfigPath, null, array('skipExtends' => true,'allowModifications' => true));
$controller = "foo"; $routeName = "bar"; $action = "tar";
$appConfig->production->routes->$routeName->type = "Zend_Controller_Router_Route";
$appConfig->production->routes->$routeName->route = $routeName;
$appConfig->production->routes->$routeName->defaults->controller = $controller;
$appConfig->production->routes->$routeName->defaults->action = $action;
$appConfig->production->routes->$routeName->reverse = $routeName;
$writer = new Zend_Config_Writer_Ini();
$writer->setConfig($appConfig)->setFilename($appConfigPath)->write();
But this is giving me
Notice: Indirect modification of overloaded property Zend_Config::$bar has no effect in D:\projects\...
Strict Standards: Creating default object from empty value in D:\projects\...
My file is modified but not Added New Changes :(
A:
I dont think its a good idea, if you want to have dynamic routes use Zend_Controller_Router_Route with dynamic parts.
|
{
"pile_set_name": "StackExchange"
}
|
Separation of salvianic acid A from the fermentation broth of engineered Escherichia coli using macroporous resins.
Salvianic acid A (also known as danshensu) is a plant-derived polyphenolic acid, and has a variety of physiological and pharmacological activities. Our laboratory previously constructed an unprecedented artificial biosynthetic pathway in Escherichia coli and established the fermentation process to produce salvianic acid A. Here, we developed an efficient method for separating salvianic acid A from the fermentation broth of engineered Escherichia coli by macroporous resins. Among ten tested macroporous resins, the static and dynamic adsorption/desorption experiments demonstrated that X5 resin was the best to separate salvianic acid A from fermentation broth. Other parameters during static and dynamic procedures were also investigated. Under the optimum separation conditions, the average adsorption capacity of SAA were 10.66±0.54 mg/g dry resin and the desorption ratio was 85.6±4.1%. The purity and recovery yield of salvianic acid A in the final dry product were 90.2±1.5 and 81.5±2.3%, respectively. The results show that adsorption separation with macroporous resin X5 was an efficient method to prepare salvianic acid A from fermentation broth. This work will benefit the development and application of plant-derived salvianic acid A and its derivatives.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
{
"translatorID": "54ac4ec1-9d07-45d3-9d96-48bed3411fb6",
"label": "National Library of Australia (new catalog)",
"creator": "Philipp Zumstein",
"target": "^https?://catalogue\\.nla\\.gov\\.au",
"minVersion": "3.0",
"maxVersion": "",
"priority": 100,
"inRepository": true,
"translatorType": 4,
"browserSupport": "gcsibv",
"lastUpdated": "2018-01-30 09:40:11"
}
/*
***** BEGIN LICENSE BLOCK *****
Copyright © 2018 Philipp Zumstein
This file is part of Zotero.
Zotero is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Zotero is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Zotero. If not, see <http://www.gnu.org/licenses/>.
***** END LICENSE BLOCK *****
*/
// attr()/text() v2
function attr(docOrElem,selector,attr,index){var elem=index?docOrElem.querySelectorAll(selector).item(index):docOrElem.querySelector(selector);return elem?elem.getAttribute(attr):null;}function text(docOrElem,selector,index){var elem=index?docOrElem.querySelectorAll(selector).item(index):docOrElem.querySelector(selector);return elem?elem.textContent:null;}
function detectWeb(doc, url) {
if (url.match("/Record/[0-9]+")) {
var format = doc.getElementById("myformat").textContent;
return computeFormat(format);
} else if (url.includes("/Search/Home") && doc.getElementById("resultItemLine1")) {
return "multiple";
}
}
// map the nla formats to zotero formats
function computeFormat(format){
// clean up whitespace and remove commas from items with multiple formats
format = Zotero.Utilities.trimInternal(format.replace(',', ''));
if (format == "Audio") return "audioRecording";
if (format == "Book") return "book";
if (format == "Journal/Newspaper") return "journalArticle";
if (format == "Manuscript") return "manuscript";
if (format == "Map") return "map";
if (format == "Music") return "audioRecording";
if (format == "Online") return "webpage";
if (format == "Picture") return "artwork";
if (format == "Video") return "videoRecording";
// default
return "book";
}
function getSearchResults(doc, checkOnly) {
var items = {};
var found = false;
var rows = doc.querySelectorAll('.resultitem a.title');
for (let i=0; i<rows.length; i++) {
let href = rows[i].href;
if (!/\/Record\/\d+/.test(href)) continue;
let title = ZU.trimInternal(rows[i].textContent);
if (!href || !title) continue;
if (checkOnly) return true;
found = true;
items[href] = title;
}
return found ? items : false;
}
function doWeb(doc, url) {
if (detectWeb(doc, url) == "multiple") {
Zotero.selectItems(getSearchResults(doc, false), function (items) {
if (!items) {
return true;
}
processUrls(Object.keys(items));
});
} else {
processUrls([url]);
}
}
function processUrls(urls) {
for (let i=0; i<urls.length; i++) {
var bibid = urls[i].match(/\/Record\/(\d+)\b/);
if (bibid) {
var marcUrl = "/Record/" + bibid[1] + "/Export?style=marc";
ZU.doGet(marcUrl, scrapeMarc);
}
}
}
function scrapeMarc(text) {
var translator = Zotero.loadTranslator("import");
translator.setTranslator("a6ee60df-1ddc-4aae-bb25-45e0537be973");
translator.setString(text);
translator.translate();
}
/** BEGIN TEST CASES **/
var testCases = [
{
"type": "web",
"url": "https://catalogue.nla.gov.au/Record/773336?lookfor=labor&offset=10&max=65985",
"items": [
{
"itemType": "book",
"title": "Labor: readings on major issues",
"creators": [
{
"firstName": "Richard Allen",
"lastName": "Lester",
"creatorType": "author"
}
],
"date": "1967",
"callNumber": "331.082",
"libraryCatalog": "National Library of Australia (new catalog)",
"place": "New York",
"publisher": "Random House",
"shortTitle": "Labor",
"attachments": [],
"tags": [
{
"tag": "Labor unions"
},
{
"tag": "United States"
},
{
"tag": "United States"
},
{
"tag": "Working class"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "http://catalogue.nla.gov.au/Search/Home?lookfor=labor&type=all&limit%5B%5D=&submit=Find&filter[]=language:%22eng%22",
"items": "multiple"
}
]
/** END TEST CASES **/
|
{
"pile_set_name": "Github"
}
|
After watching the video for How To Build a Mash Tun on the AHA website, I thought wow that looks easy and I could build it myself for half the price my local homebrew supplier is selling them. So I went out and bought all the supplies. Things went well until I got to the assembly of the in-line valve. I used a food grade silicone sealant to adhere the mini keg bung into the slot where the drainage spout previously was. But on both occasions, one I placed even a small amount of pressure on the keg bung the sealant would give and the seal would break. This allowed the keg bung to just fall out of the hole. The only thing that is different from my build and the build in the video is that my cooler's drain spout was in the back of the cooler and not off to the side. Does anyone have a suggestion as to what I may be doing wrong or how to make the seal more durable so that I can happily get this contraption pieced together without losing my mind ? Any help is appreciated!
Let me say how super cool it is that you post a question on a forum and get a response thrown in there from the president himself. I appreciate all the help guys. I think I am going to go with the more sturdy method of getting the custom fittings from bargainfittings.com. Here is the type of cooler I am using. Says its so insulated that it will hold ice for 5 days in 90 degree weather.
FWIW, I found that a bulkhead and ball valve didn't work as well for me as the down and dirty method.
+1, I am going on three years with my cooler with some vinyl tubing forced through the drain hole. didn't take the cooler apart at all. I don't even have the fancy valve like Denny has. I just stick the open end under the handle and let gravity be my valve.
I used an assembly like Gary posted and it works well. After 4 years I'm starting to see a couple of drips but other than that no issues.
I tried using a cooler like you posted a picture for but couldn't figure out a good way to make all the corners inside to be sure I wasn't leaving a lot of wort behind.
It may work great for you. I admit I'm really paranoid, over think everything and doubt every design I've ever created. On the other side of that, everything I've ever built works.
I'm sure it will work for you too.
Paul
** edited spelling of cooler. Yes I'm OCD and have a beer named after ODC that I cleared with a friend who has a son who is OCD just to make sure he wouldn't be offended by a beer name that makes fun of being OCD. God, need I need a drink. Or maybe I've had enough. Who the H#!! knows.
i tried to modify the whole on my igloo to use a bottling spigot. i screwed up the plastic a bit and ended up having to put a big rubber gasket with a big metal washer on it. it drips about 10-15 drops over the coarse of the mash.
I used an assembly like Gary posted and it works well. After 4 years I'm starting to see a couple of drips but other than that no issues.
I tried using a cooler like you posted a picture for but couldn't figure out a good way to make all the corners inside to be sure I wasn't leaving a lot of wort behind.
It may work great for you. I admit I'm really paranoid, over think everything and doubt every design I've ever created. On the other side of that, everything I've ever built works.
I'm sure it will work for you too.
Paul
** edited spelling of cooler. Yes I'm OCD and have a beer named after ODC that I cleared with a friend who has a son who is OCD just to make sure he wouldn't be offended by a beer name that makes fun of being OCD. God, need I need a drink. Or maybe I've had enough. Who the H#!! knows.
Funny stuff ! I put a big o-ring between the washer on the inside of the bulkhead and the cooler wall, then sealed around the washer thoroughly with the food grade sealant and it doesn't leak a drop. I just had a wild hair when I bought a bigger Coleman Extreme to pull the spout and build up. Works great though.
+1, I am going on three years with my cooler with some vinyl tubing forced through the drain hole. didn't take the cooler apart at all. I don't even have the fancy valve like Denny has. I just stick the open end under the handle and let gravity be my valve.
(Let Gravity Be Your Valve Baby)
I thought I was weird because that is what I was doing & hadn't heard of anyone else doing it. It drips a little for me but not enough to worry about.
+1, I am going on three years with my cooler with some vinyl tubing forced through the drain hole. didn't take the cooler apart at all. I don't even have the fancy valve like Denny has. I just stick the open end under the handle and let gravity be my valve.
(Let Gravity Be Your Valve Baby)
I thought I was weird because that is what I was doing & hadn't heard of anyone else doing it. It drips a little for me but not enough to worry about.
I'm not sure that the fact that I do something you do means you are not weird. I'm not saying you ARE weird, just that similarity to me does not convey a sense of normality.
|
{
"pile_set_name": "Pile-CC"
}
|
After Putin Visit, Tillerson Snubbed Top EU Official
Trans-Atlantic relations hit new lows after President Donald Trump’s gaffe-filled visit to Europe last week. But behind closed doors, the tensions started well before then and included a high-profile slight of a senior European Union official.
Secretary of State Rex Tillerson’s office declined a call with the EU’s foreign-policy chief, Federica Mogherini, after his visit to Russia in April, according to multiple sources close to the incident. The sources told Foreign Policy that Tillerson’s office rejected Mogherini’s request for a call and instead kicked it down to a lower-level State Department official. That move infuriated her and came against the backdrop of an already strained U.S.-EU relationship under Trump, whose scandal-plagued White House is still reeling from investigations into the president’s campaign ties to the Kremlin.
Mogherini’s staff made the request to Tillerson’s office after a widely scrutinized visit to Moscow on April 11-12 to meet with Russian President Vladimir Putin and Foreign Minister Sergei Lavrov and before her meeting with Lavrov in Moscow on April 24. Allies were eager for a brief out of the meeting directly from Tillerson, but he was unavailable to fulfill the request from Mogherini, multiple sources tell FP.
“It really pissed her off,” one source said.
“This is like a total screw-up,” another source close to the EU foreign-policy chief told FP. “This is not the way you treat Mogherini.”
Tillerson’s office instead offered her a meeting with Brian Hook, the State Department’s director of policy planning, sources say. Hook wields significant influence in Tillerson’s State Department, but he is several rungs lower on the hierarchy than the secretary of state.
Mogherini declined the offer.
When approached for comment, another EU official, who asked not to be identified, said that Mogherini was never formally refused a call from Tillerson. “We never had to suffer from a denial from the U.S. side for a call with the secretary of state,” the official said. “[Mogherini] had several phone conversations with the secretary on different issues.”
The official said Mogherini and Hook never spoke. “There is therefore no incident,” the official added.
Tillerson’s advisor, R.C. Hammond, didn’t deny the incident but told FP that the “the most efficient accommodation under the circumstances was available to her” at the time.
A State Department representative pointed to the regular contact Tillerson and Mogherini have had in the recent past, including their participation in the U.S.-EU leaders meeting during Trump’s visit to Brussels on May 25 and several meetings between Mogherini and Vice President Mike Pence in recent months. “Our ongoing, high-level engagement underscores the commitment of the United States to the trans-Atlantic relationship,” the representative said.
Officials and former officials briefed on the incident say it could have been a simple scheduling issue — perhaps Mogherini’s team didn’t give the State Department enough notice. But it’s the sort of miscommunication that has become all too common in Tillerson’s understaffed State Department. (Tillerson also snubbed the head of the African Union in a scheduling snafu last month.)
Though months into the new administration, the Trump White House hasn’t appointed officials to critical middle-management posts that oversee day-to-day relations with Europe, including the assistant secretary of state for Europe, ambassador to NATO, and ambassador to the EU.
That vacuum can cause routine diplomatic contacts like phone calls and debriefings with top allied officials to fall through. “There is a pattern here of not being able to run the logistics of sorting out meetings,” the source close to Mogherini said. “They don’t have anyone in the administration to pick these things up.”
The gaffe came as the Trump administration butts diplomatic heads with Europe over issues such as trade and defense spending. “This administration has a very skeptical view about multilateral institutions like the EU,” said Anthony Gardner, who until January was U.S. ambassador to the EU. He cited Trump’s coterie of euroskeptic advisors and friends, including strategist Stephen Bannon and Brexit architect Nigel Farage.
But given the turmoil in the administration, erratic messaging, and unfilled administration vacancies, European officials aren’t even sure what explains these types of snubs.
“Europeans are wondering, surely this isn’t a direct hit against us, is it? Does it highlight their understaffing, their incompetence … or is it intentional?” one former senior U.S. official familiar with the incident told FP.
Former officials say missteps are common in the early months of a new administration — as are tensions between a new administration and its EU allies (even under former President Barack Obama). But Trump has taken a decidedly combative tone toward the EU, such as using Twitter to spark a public spat over trade with Germany, the EU’s most influential member. German center-left chancellor candidate Martin Schulz lashed back, calling Trump on Tuesday “the destroyer of all Western values.”
Last week, Trump undertook a trip to Europe rife with tensions, including an awkward and widely criticized visit to NATO and a meeting with top EU officials in which European Council President Donald Tusk took the unusual step of publicly conceding he couldn’t find common ground with Trump on Russia.
Current and former officials who spoke to FP say that regardless of how the Trump administration views the EU, Mogherini could be a valuable ally in Brussels if it treats her as an equal. “I think she is one of the most effective members of the [EU Commission] team,” Gardner said.
Many officials laud Mogherini for her accomplishments on issues such as the Iran deal and penning the EU’s first-ever global strategy.
“I saw her a lot up-close quite a bit. She was always prepared. She certainly enjoyed the confidence and respect of Secretary [John] Kerry,” Gardner told FP, referring to the former secretary of state. Kerry worked hand-in-hand with Mogherini on issues such as the Iran deal, climate change, and terrorism.
Given the array of threats the EU and United States face, it’s an important relationship. “On almost every threat, closer U.S.-EU cooperation would be helpful,” said Jeremy Shapiro, research director at the European Council on Foreign Relations. He said it was difficult to find a coherent EU foreign policy given the 28-country bloc’s varying national priorities, meaning other European leaders may wield more influence than Mogherini.
But experts say keeping regular contact with the EU is a low-cost, high-payoff way for the United States to support the EU’s foreign policy. It’s work that may not make the top headlines but is critical to trans-Atlantic security, such as counterterrorism work in Africa and stabilizing the politically fragile Balkans.
“The United States and Europe have so many common policy topics that they coordinate on, consult on, and work together on,” said Constanze Stelzenmüller of the Brookings Institution.
“This is not trivial. It’s not diplomatic flag-waving,” she said. “This is getting down to business and solving problems.”
Photo credit: ALEXANDER NEMENOV/AFP/Getty Images
|
{
"pile_set_name": "OpenWebText2"
}
|
Field of the Invention
The present invention relates generally to the fields of molecular biology, and more specifically to tau protein, and protease-active fragments and variants thereof. In particular embodiments, truncated tau fragments and tau protease variants are provided that retain substantial serine protease.
Description of Related Art
Alzheimer's Disease
There is a large and rapidly growing unmet need for disease modifying drugs for Alzheimer's disease. Currently more than 30 million people suffer from AD worldwide and this number doubles about every 20 years. In the US, it is estimated that there are 5.4 million AD sufferers. AD affects 1 out of 4 people over age 75 and 1 out of 3 people over 80. Payments for care in 2012 are estimated to exceed $200 billion (2012 Alzheimer's disease Facts and Figures, Alzheimer's Association). Presently, only 5 mildly effective AD symptom-treating drugs exist, but none that treat the underlying neurodegenerative processes. FDA approved medications provide limited symptomatic relief, but do not halt, slow or reverse disease progression. It is estimated that the 2009 market for anti-Alzheimer's drugs was approximately $4.3 billion and is expected to increase to over $14 billion by the end of the decade based on the introduction of disease modifying drugs (DMDs), which are expected to fuel >50% of the market growth.
The symptoms of AD manifest slowly and the first symptom may only be mild forgetfulness. In this stage, individuals may forget recent events, activities, the names of familiar people or things and may not be able to solve simple math problems. As the disease progresses into moderate stages of AD, symptoms are more easily noticed and become serious enough to cause people with AD or their family members to seek medical help. Moderate-stage symptoms of AD include forgetting how to do simple tasks such as grooming, and problems develop with speaking, understanding, reading, or writing. Severe stage AD patients may become anxious or aggressive, may wander away from home and ultimately need total care.
The classical hallmarks of AD are inter-neuronal plaques consisting of precipitates or aggregates of amyloid β protein (Aβ), and intra-neuronal neurofibrillary tangles (NFTs) consisting of precipitates or aggregates of tau protein. The amyloid cascade hypothesis has been widely accepted as the pathological pathway of AD, that Aβ drives AD pathogenesis and secondarily induces the formation of abnormal tau protein. Genetic evidence suggests that that mutations leading to increased accumulation of Aβ aggregates leads to familial AD. However, there are a number of weaknesses in the Aβ cascade hypothesis in that it does not address the importance of other pathways that can cause neurodegeneration (Seabrook et al., 2007). The accumulation and distribution of NFTs in the brains of AD patients is highly correlated with disease progression and can be used to stage AD by post-mortem brain histopathology. A recent study was conducted in which two thousand three hundred and thirty two non-selected brains from 1- to 100-year-old individuals were examined for abnormal tau and for the detection of Aβ. This study showed that AD-related tauopathy begins in the early decades of life in the lower brainstem and before the occurrence of plaques contradicting the amyloid cascade hypothesis (Braak et al., 2011). Furthermore, there have been a number of late stage clinical failures that call into question the understanding of the molecular mechanism of AD pathology (see, e.g., Table 1.).
TABLE 1LATE-STAGE FAILURES OF DRUGS TARGETING AβCompoundMode of ActionCompanyStatusTramiprosateβ-amyloid NeurochemFailed to meet clinical (Alzhemed ™)antagonistendpoint in Phase IIIR-flurbiprofen Reduces levels MyriadFailed to meet clinical (Flurizan ™)of Aβ42Genetics endpoint in Phase IIISemagacestatγ-Secretase Eli LillyFailed to meet clinical (LY450139inhibitorendpoint in Phase IIIdihydrate)BapineuzumabHumanized mAB Wyeth/Elan, Subjects were stratifiedspecific for the Pfizer/J&Jaccording to APOE ends of Aβgenotype in order to meet Phase II endpointCausal Role for Tau in Neurodegenerative Diseases
That tau dysfunction is sufficient for neurodegeneration and dementia, even in the absence of other disease processes comes from direct evidence that mutations in the gene for tau MAPT cause frontotemporal dementia with Parkinsonism (FTDP) linked to chromosome-17 (FTDP-17). The 32 different mutations found in the study of over 100 families can be grouped into categories influencing splicing of the primary transcript and causing changes in amino acid sequence of tau. Most missense mutations are located in the assembly domain and generally reduce the affinity of tau to MTs. Several of these mutations promote aggregation of tau in vitro and in vivo such as P301L and P301S. Mutations in the stem-loop structure at the border of exon 10 and the following intron alter splicing causing aberrations in the ratio of 4R to 3R isoforms demonstrating that maintenance of the proper ratio of tau isoforms is necessary to prevent neurodegeneration and dementia (Goedert and Jakes, 2005). Recent work has shown that tau is a key mediator or enabler of both Aβ- and apoE4-dependent pathogenesis (reviewed in Morris et al., 2011; Huang and Mucke, 2012).
Extracellular Tau in Disease Progression
The role of extracellular tau in neurotoxicity is a relatively new but important concept in the field. There are a number of contributing findings that implicate extracellular tau in AD. Tau pathology spreads contiguously throughout the brain from early to late stage disease suggesting an “infectious” model of disease progression (Schonheit et al., 2004). This notion is supported by a recent report (Frost et al., 2009) that extracellular tau aggregates can propagate tau misfolding from outside to the inside of a cell. Additional backing for this concept comes from a recent report showing that injection of brain extract from a transgenic mouse with aggregated mutant human tau into the brain of transgenic mice with normal human tau transmits tau pathology and induces its spread throughout the brain (Clavaguera et al., 2009). Recently two transgenic models were independently developed that expressed pathological tau P301L in mouse entorhinal cortex (Liu et al., 2012; de Calignon et al., 2012). The published results demonstrated that the pathology spread to adjacent regions of the hippocampus consistent with the model that tau pathology can spread from diseased to healthy neurons. Induction of low levels of pro-aggregation human tau in transgenic mice results in the formation of tau aggregates and tangles composed of both human and normal murine tau (co-aggregation) providing evidence for the “infectious” model by transmission of pathological tau characteristics to normal host tau (Mocanu et al., 2008). A receptor-mediated mechanism for the spread of tau pathology by extracellular tau has been described based on work with cultured neurons (Gomez-Ramos et al., 2006; 2008; 2009). Levels of tau rise in CSF in AD, whereas Aβ levels decrease (Shaw et al., 2009).
Tau Oligomers: A Target for Therapeutic Development
NFTs have been implicated in mediating neurodegeneration in AD and tauopathies as it correlates well with cognitive deficits and neuron loss (Arriagada et al., 1992; Bancher, 1993; Guillozet et al., 2003; Iqbal et al., 2009). However, the study of animal models of tauopathy has shown that memory impairment and neuron loss is dissociated from accumulation of NFT (Brunden et al., 2008). Strong support for this contention came from the analysis of transgenic mice rTg4510 that express tau P301L in the forebrain under control of a tetracycline-regulated promoter. These mice developed memory impairment, neuron loss and NFT when the construct was expressed. However, suppression of expression caused improvement in memory and reduction in neuron loss even as NFTs continued to accumulate clearly demonstrating that pretangle tau species were responsible for the neurodegenerative phenotype (Santacruz et al., 2005). Additionally, there was regional dissociation of neuron loss and NFT pathology (Spires et al., 2006). This mouse model was also used to show that soluble tau, but not tangles, contributed to impairment of hippocampal function (Fox et al., 2011). Transgenic mice expressing a human mutant tau P301S construct prone to aggregation developed hippocampal synapse loss and dysfunction, as well as, microglial activation months before the accumulation of filamentous tau inclusions (Yoshiyama et al., 2007). Similarly, a transgenic mouse model expressing human tau protein with two mutations found in FTDP-17 (P301S and G272V) exhibited axonopathy before tangle formation (Leroy et al., 2007). The triple transgenic AD mouse model accumulating both tau and Aβ pathology was used to study the effects of immuno-reduction of tau and Aβ. Antibodies against both proteins were needed to improve learning and memory behavior in these mice. Soluble tau, but not NFT, was reduced by the treatment (Oddo et al., 2006).
A study of normal and AD CSF specimens using a tau oligomer-specific antibody showed AD-specific accumulation of tau oligomers early in disease (Lasagna-Reeves et al., 2012). Furthermore, tau oligomers caused impairment of memory and induced synaptic and mitochondrial dysfunction in mice (Lasagna-Reeves et al., 2011). However, the mechanism by which tau oligomers cause these neurodegenerative effects has not been established.
Proteases Cutting Tau
Tau cleavage has been shown to play an important role in tau aggregation and neurodegeneration (recently reviewed in Wang et al., 2010; Hanger and Wray, 2010). Tau truncation leads to the formation of aggregation-prone fragments leading to the formation of toxic aggregates and leads to the formation of toxic fragments which do not aggregate. Thus, targeting the proteolysis of tau would be beneficial for the development of therapeutics for AD and related tauopathies. Tau is a substrate for multiple proteases and because of its natively unfolded conformation it is very susceptible to proteolysis. Tau can be cut by trypsin and chymotrypsin in addition to endogenous proteases such as caspases, and calpain and puromycin-sensitive aminopetidase. The protesome, which degrades misfolded proteins, also degrades tau but is inhibited when bound to filaments of tau. There are also unknown proteases that generate fragments of tau early in AD.
The Role of Tau in Alzheimer's Disease
The classical hallmarks of AD are inter-neuronal plaques consisting of precipitates or aggregates of amyloid beta protein (Aβ), and intra-neuronal neurofibrillary tangles (NFTs) of tau protein. Tau protein promotes microtubule assembly and stability and is critical for the function of axons, whereas the normal function of Aβ is not fully understood. The amyloid cascade hypothesis has been widely accepted as the pathological pathway of AD. It holds that the generation of Aβ and accumulation of Aβ aggregates in the brain initiate the disease process. It is supported by genetic evidence that mutations leading to increased accumulation of Aβ aggregates leads to familial AD. However, there are a number of weaknesses in the Aβ cascade hypothesis in that it does not address the importance of other pathways that can cause neurodegeneration (Seabrook et al., 2007). The accumulation and distribution of NFTs in the brains of AD patients is highly correlated with disease progression and can be used to stage AD by post-mortem brain histopathology, whereas there is poor correlation between AD and the accumulation of neuritic plaques composed of β-amyloid. This has been used to challenge the amyloid hypothesis (Josephs et al., 2008). Lackluster results for Aβ-directed therapeutics in late stage clinical trials has increased interest in exploring alternative targets for drug discovery such as tau (Iqbal et al., 2009).
Deficiencies in the Prior Art
Unfortunately, no cure is yet available for AD. Today, medication therapy focuses on controlling the symptoms of AD and its various stages. For example, mild to moderate AD is often treated with cholinesterase inhibitors such as donepezil (ARICEPT®, Eisai Co., Ltd/Pfizer, Inc.), rivastigmine (EXELON®, Novartis AG/Sandoz AG), galantamine (RAZADYNE®, Johnson & Johnson), [and to a lesser extent, tacrine (COGNEX®), Warner-Lambert Co.], while moderate to severe AD is often treated with donepezil (ARICEPT®) or N-methyl D-aspartate antagonists such as memantine (NAMENDA®, Forest Laboratories, Inc.), or a combination thereof. Although these medications may help delay or prevent AD symptoms from becoming worse for a limited period of time, there is no clear evidence that these medications have any effect on the underlying progression of the disease itself.
While extensive research in the past decade has identified possible biomarkers for AD, there is still an urgent need for composition and methods that are specifically useful in diagnosing, treating, preventing, and monitoring the progress of AD in at-risk or affected individuals. New compositions and methods are also needed to serve as drug targets for the identification, synthesis, and/or adaptation of existing chemical compounds for use in the treatment of AD and its symptoms. Furthermore, there is also a need for development of new classes of drugs for treatment of the disease, including, for example, immunotherapeutic agents and next-generation therapeutics.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
[Enterococcal survival in forcemeat preserved in polymer films and in cutlets made from it].
The available data suggest that at 2 degrees and 5 degrees with a 12-day long storage in unpacked and in polymeric film packed forcemeat there occurs no propagation of the enterococci. At 22-24 degrees the multiplication of Str. faecalis var. liquefaciens proceeded similarly both in packed and unpacked forcemeat. When the temperature in the central part of the cutlets prepared from the enterococci-contaminated forcemeat reaches 7-80 degrees the bulk of the Str. faecalis var liquefaciens cells perishes, but even at 80 degrees there survive individual heat-resistant cells.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
to your HTML
Add class="sortable" to any table you'd like to make sortable
Click on the headers to sort
Thanks to many, many people for contributions and suggestions.
Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
This basically means: do what you want with it.
*/
var stIsIE = /*@cc_on!@*/false;
sorttable = {
init: function() {
// quit if this function has already been called
if (arguments.callee.done) return;
// flag this function so we don't do the same thing twice
arguments.callee.done = true;
// kill the timer
if (_timer) clearInterval(_timer);
if (!document.createElement || !document.getElementsByTagName) return;
sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
forEach(document.getElementsByTagName('table'), function(table) {
if (table.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortable(table);
}
});
},
makeSortable: function(table) {
if (table.getElementsByTagName('thead').length == 0) {
// table doesn't have a tHead. Since it should have, create one and
// put the first table row in it.
the = document.createElement('thead');
the.appendChild(table.rows[0]);
table.insertBefore(the,table.firstChild);
}
// Safari doesn't support table.tHead, sigh
if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
if (table.tHead.rows.length != 1) return; // can't cope with two header rows
// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
// "total" rows, for example). This is B&R, since what you're supposed
// to do is put them in a tfoot. So, if there are sortbottom rows,
// for backwards compatibility, move them to tfoot (creating it if needed).
sortbottomrows = [];
for (var i=0; i
Tyler Cowen links to our post looking at the change in the number of people employed at $7.25 in both 2006 and 2010 and asks:
How much is the minimum wage at fault?
Let's see what we can see, shall we? First, let's look at the nominal and inflation-adjusted level of the U.S. federal minimum wage from 2006 through 2010, because that will give us a sense of how steep the minimum wage increases that took place over that time were in real terms:
Now, let's look at the numbers of people earning both the nominal federal minimum wage and the inflation-adjusted equivalent, along with the number of people actually counted by the Bureau of Labor Statistics as earning the nominal federal minimum wage changed for each year from 2006 through 2010.
But wait! Just looking at these figures is ignoring the elephant in the room isn't it? After all, there was an economic recession that, according to the National Bureau of Economic Research, ran from December 2007 through June 2009. And then, the federal minimum wage increases that took place in 2007, 2008 and 2009 actually took place in the month of July in each of those years, so looking at full-year figures like these might not tell the whole story.
But perhaps if we look at the number of employed teens over that time, perhaps we can see something more. After all, in just looking at 2010's data, while teens account for an average of 3.15% of the entire U.S. workforce employed during the year, they never-the-less represent 22.8% of all individuals counted as earning 2010's federal minimum wage of $7.25 or less. And as it happens, those same minimum wage earning teens account for 22.7% of the average number of all the teens who were counted as being employed during that year!
So the employment trend for teens, perhaps more than any other demographic group as they represent more than one-fifth of all minimum wage earners, can help us isolate the effects of changes in the federal minimum wage on the employment situation in the U.S. That's especially true for recent years, given that teens were not employed in any significant numbers in the banking, finance, construction and manufacturing sectors of the economy, which were the hardest hit sectors of the U.S. economy during the recession.
Let's next look at how the average number of employed teens changed from 2006 through 2010, while also tracking how the number of employed teens changed from month-to-month.
For 2006, we see that the teen employment level is fairly flat aside from what we would describe as a typical level of noise in the data, which is what we would expect in a growing economy in the absence of minimum wage increases. We see that compared to 2006, when an average of 6,163,250 teens were employed throughout that year, the number of employed teens has dropped in each year since. We find that the number of employed teens dropped by an average of 236,584 in 2007, the last full year prior to the beginning of the recession, which is remarkable given that the U.S. economy generally grew throughout the year.
We then see the pace of teen job loss accelerate in 2008, with 584,584 fewer teens employed throughout the year as compared to 2006's level, and even more in 2009, as 1,322,334 fewer teens than in 2006 held jobs during that year. We then see the rate of teen job decline begin to decelerate but continue falling into 2010, following the official end of the recession, with now 1,780,000 less teens working in the U.S. workforce than in 2006.
That still leaves out the effect of the recession. Our next chart tracks the month-to-month change in the number of teens since their total employment level peaked in November 2006 as a percentage of that peak employment level, along with the employment trend for those Age 20 and over, as well as all members of the U.S. civilian labor force.
But more than that, we've also identified the period of recession as well as indicating the real GDP growth rate for each quarter from the fourth quarter of 2006 through the fourth quarter of 2010, of which the latter figure may still be revised on 25 March 2011.
But wait, that's not all! We've also indicated important milestones for the most recent series of minimum wage increases, and identified periods of deflation, as determined by the 3-month percent change in the Consumer Price Index for All Urban Consumers for the current series, which can act to effectively increase the relative level of the federal minimum wage, making it a greater burden upon employers.
In other words, it's about as jam-packed with data as we can make it. Here it is:
What we find is that the teen employment level invariably falls in the months following an effective increase in the federal minimum wage, whether driven by the expectation that the minimum wage will soon be increased as employers stop hiring teens (January 2007 to May 2007), to the six month window of time following when a scheduled increased in the minimum wage occurs as employers absorb the impact (July 2007, July 2008 and July 2009) and to when the minimum wage is effectively increased in relative terms due to the effect of deflationary or near-deflationary conditions (October 2008 to June 2009, April 2010 to September 2010).
Finally, we observe that the teen employment level, which is clearly very sensitive to the minimum wage level given the high percentage of teens who earn it, would seem to be only modestly affected by whether or not GDP is generally rising (2007, July 2009 - December 2010) or falling (January 2008 to June 2009), as the state of the U.S. economy would appear to be in the back seat in considering what's driving teen employment levels.
We therefore find that the answer to Tyler's question is "pretty much."
Update 27 March 2011: We updated the second chart in this post to incorporate time-weighted employment numbers - the previous version only showed the equivalent number of jobs in 2006 at the higher minimum wage that applied for the indicated year. The original version of the chart is available here.
Welcome to the blogosphere's toolchest! Here, unlike other blogs dedicated to analyzing current events, we create easy-to-use, simple tools to do the math related to them so you can get in on the action too! If you would like to learn more about these tools, or if you would like to contribute ideas to develop for this blog, please e-mail us at:
Materials on this website are published by Political Calculations to provide visitors with free information and insights regarding the incentives created by the laws and policies described. However, this website is not designed for the purpose of providing legal, medical or financial advice to individuals. Visitors should not rely upon information on this website as a substitute for personal legal, medical or financial advice. While we make every effort to provide accurate website information, laws can change and inaccuracies happen despite our best efforts. If you have an individual problem, you should seek advice from a licensed professional in your state, i.e., by a competent authority with specialized knowledge who can apply it to the particular circumstances of your case.
|
{
"pile_set_name": "Pile-CC"
}
|
Apple does most of its hardware and software development behind closed doors, rarely giving public previews or commenting on rumors before it's ready to make an announcement. Today, the company made one small step in the other direction with the OS X Beta Seed Program, through which anyone with an Apple ID and a Mac can download and run the latest developer build of OS X 10.9.3.
Apple usually only offers these betas to limited test audiences or to registered Apple developers. It costs $99 a year to stay registered as an OS X developer (and another $99 a year if you want to get iOS software, too). Apple wouldn't tell us whether the Beta Seed program would extend to other OS X or iOS updates, or if major software releases like new iOS or OS X versions would also be offered this way, but it seems clear that the company wants to expand its pool of OS X testers beyond its developer audience.
Sign up for the program with your Apple ID and you'll be asked to agree to a non-disclosure agreement similar to the one that (theoretically) keeps developers from writing about or publicizing new fixes and features before they're released. You'll then download and install a small package to enable the beta updates, at which point OS X 10.9.3 and iTunes 11.1.6 builds can be downloaded through Software Update as they normally would.
We highly doubt that this will lead to public versions of early iOS and OS X betas. The 10.9.3 update being offered has already gone through a number of builds issued only to developers, and the one being sent out to the public is likely to be near-final. It's more likely that Apple is just trying to expand its pool of testers and limit the seemingly inevitable problems that small numbers of OS X users have every time they install a new major update. Any kind of public beta program is a departure from Apple's standard policies, but don't expect the company to start developing everything out in the open overnight.
|
{
"pile_set_name": "OpenWebText2"
}
|
List of supermarket chains in Belgium
This is a list of supermarket chains in Belgium. As of 2011, in Belgium three major groups form more than two thirds of the market: Colruyt group 27%, Delhaize 22.5% and Carrefour 22%. Then there are Aldi 11%, Lidl 5.6% and Makro 4.5%.
Current supermarket chains
Defunct supermarket chains
Écomarché (owned by Les Mousquetaires, now rebranded to Intermarché Contact or Intermarché Super)
GB Supermarkets, Taken over by Carrefour. Before that, the stores belonged to the now defunct GIB Group, almost all GB stores were later rebranded to become Carrefour stores:
Maxi GB (now: Carrefour)
Super GB (now: Carrefour Market or Carrefour GB)
GB Express (now: Carrefour Express)
Bigg's Continent (now: Carrefour hypermarkets)
Jawa (was a supermarket chain, all its stores were taken over in 1995 to become Match supermarkets)
Profi (was a discount store owned by Louis Delhaize Group, rebranded to Smatch supermarket)
Unic (rebranded to Super GB and later Carrefour GB.)
References
Belgium
Supermarket
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Introduction {#Sec1}
============
Wood color plays an important role in the commercialization process^[@CR1]^ and is dependent on species, tree genetic resources, drying process and thermal treatments^[@CR2]--[@CR5]^. To improve surface quality and visual characteristics, wood dying has become an important technology to functionalize wood materials. The development of reversible thermochromic materials has received the most attention in recent years^[@CR6]--[@CR10]^. Color changing features can enrich the decorative effect of wood materials and can be used as temperature indicators.
Reversible thermochromic composites, consisting of leuco dye, color developer and organic solvent, are characterized by coloration in the solid state and discoloration in the molten state^[@CR11]^. The color changes due to structural modifications occur with temperature. Fluoran leuco dyes are widely used in fields of engineering drawings, biochemical analysis, light-emitting probes, invoices, and printing inks^[@CR12]--[@CR15]^ and show good sensitivity and thermochromic stability.
The classical example of a suitable dye is the ionochromic crystal violet lactone. Liu *et al*. colored poplar veneer by ultrasonic impregnation using crystal violet lactone, biphenyl A, 1-tetradecanol and sodium thiosulfate. The maximum ΔE of poplar veneer was obtained with the optimum mixing ratio of 1:8:50:1^[@CR16],[@CR17]^. Jiang *et al*. analyzed the relationship between thermochromic properties and solvent melting points, and thermochromic wood with a lower temperature response was obtained with 1-dodecanol^[@CR18]^. Hu *et al*. prepared a photochromic wood material by adding microcapsules into wood fibers and wood coatings, and the wood altered its appearance from a veneer color to a blue color when exposed to sunlight^[@CR19],[@CR20]^. Relevant studies on problems in thermochromic agent preparation, the manufacturing technology and thermochromic performance evaluation are ongoing.
Indeed, high-grade wood products with nature appearance in color and texture are becoming more and more popular, some traditional dyes are sufficiently sensitive to heat but would not currently be acceptable. The dye 2-anilino-6-(dibutylamino)-3-methyl fluoran (ODB-2) is widely used in thermo-paper manufacturing. Previous studies showed that the interaction between solvent, developer and ODB leuco dyes had significant effects on reversible thermochromic performances^[@CR21],[@CR22]^. Yang *et al*. optimized the ratio of thermosensitive black, bisphenol A and hexadecanol for the reversible thermochromic composition as 1:2:50^[@CR23]^. In this paper, thermochromic compounds consisting of ODB-2 dye, bisphenol-A developer and 1-tetradecanol organic solvent were used for veneer impregnation. The effects of synthesis conditions on the thermochromic properties of wood veneers were studied. In addition, fourier transform infrared spectroscopy (FTIR) analyses were applied to investigate the thermochromic mechanism of wood veneer.
Results and Discussion {#Sec2}
======================
Determination of the optimum thermochromic composition formula {#Sec3}
--------------------------------------------------------------
In this study, the orthogonal design was used to optimize thermochromic composition formula to obtain best color change, and ΔE values were calculated to describe the degree of color change. The colorimetric parameters of thermochromic compounds were obtained by measuring the surfaces of glass plates coated with thermochromic compounds. The color parameters of coated glass plates were measured at 0 °C and 70 °C. The total color difference values ΔE of the thermochromic compounds were used to select the optimum processing parameters. The test results are shown in Table [1](#Tab1){ref-type="table"}.Table 1Results and range analysis of thermochromic compound experiments.TestMixing ratio of ODB-2 and bisphenolInteractionMixing ratio of ODB-2 and 1-tetradecanolNullΔE11(1:1)11(1:20)127.3921(1:1)22(1:40)227.6731(1:1)33(1:60)327.0941(1:1)44(1:80)429.6452(1:2)12(1:40)330.5962(1:2)21(1:20)431.9472(1:2)34(1:80)129.1882(1:2)43(1:60)232.3293(1:3)13(1:60)428.80103(1:3)24(1:80)330.59113(1:3)31(1:20)229.03123(1:3)42(1:40)131.33134(1:4)14(1:80)225.32144(1:4)23(1:60)127.86154(1:4)32(1:40)428.62164(1:4)41(1:20)330.84
The color difference value ΔE indicates the color changes of the thermochromic material before and after temperature variation. As shown in Table [1](#Tab1){ref-type="table"}, the ΔE values of different thermochromic compounds ranged from 25.32 to 32.32. The relationships of ΔE and individuals' vision (Table [2](#Tab2){ref-type="table"}) indicate that all thermochromic compounds had good thermochromic performances. As the temperature varied from 0 °C to 70 °C, the color change was obvious and could be easily noticed by vision.Table 2Relationship between ΔE and vision.Color-change value ΔEVision0--0.5Unnoticeable change0.5--1.5Slight change1.5--3.0Appreciable change3.0--6.0Recognizable change6.0--12.0Obvious changeOver 12.0Very obvious change
Range analysis were performed and the results presented in Table [3](#Tab3){ref-type="table"} indicate the average ΔE value of each factor at various levels, the main effect factor on ΔE is the mixing ratio of ODB-2 and bisphenol A, followed by the mixing ratio of ODB-2 and 1-tetradecanol.Table 3Intuitive analysis of test results.IndexMixing ratio of ODB-2 and bisphenolInteractionMixing ratio of ODB-2 and 1-tetradecanolK127.950028.025029.8000K231.007529.515029.5600K329.937528.480029.0175K428.160031.032528.6825Range3.05753.00751.1175RankingMixing ratio of ODB-2 and bisphenol \> Mixing ratio of ODB-2 and 1-tetradecanolK~i~-average values for level i = 1,2,3,4; Range = K~max~-K~min~, larger range value indicating more significant effects.
When the mixing ratio of ODB-2 and bisphenol A increased to 1:2, the ΔE value increased in an obvious manner, it is due to the reaction of ODB-2 and bisphenol A. As an electron donor, increasing the amount of bisphenol A induced more contact with leuco agent ODB-2. When the temperature was varied from 0--70 °C, the leuco effect was enhanced, and the ΔE value increased. As the mix ratio of ODB-2 and bisphenol A increased to 1:3 and 1:4, the ΔE value displayed a decreasing tendency. The excessive bisphenol A was dissolved in 1-tetradecanol and was used to diluted the solution.
The range analysis results of ODB-2 and 1-tetradecanol mixing ratio showed that the ΔE value decreased with the increase in 1-tetradecanol. Rarely, small amounts of 1-tetradecanol can dissolve and disperse ODB-2 and bisphenol A. As the dosage of 1-tetradecanol increases, it can significantly promote the reaction between ODB-2 and bisphenol A. However, the addition of 1-tetradecanol can also dilute the solution, explaining the decrease in the ΔE value.
The corresponding analysis of variance (ANOVA) observed that mixing ratio of ODB-2 and bisphenol act as significant factor for ΔE value (*p* \< 0.05), while the interaction was also significant for ΔE value (Table [4](#Tab4){ref-type="table"}). The optimum ratio of ODB-2 to bisphenol A to 1-tetradecanol was 1:2:60. Figure [1](#Fig1){ref-type="fig"} shows the color changes of the thermochromic compound synthesized under the optimum ratio from 0 °C to 70 °C.Table 4Results of ANOVA.SourceSum of squaresdfMean squareFSig.Mixing ratio of ODB-2 and bisphenol25.78238.5949.0670.012Interaction21.36137.1207.5130.019Mixing ratio of ODB-2 and 1-tetradecanol3.07831.0261.0820.425Error5.68760.948Total55.90715 Figure 1Color changes of the thermochromic compound.
The mechanism of color transition induced by the ODB-bisphenol A interaction is shown in Fig. [2](#Fig2){ref-type="fig"}. In the thermochromic compound system, the color former (ODB-2) is an electron-donating compound, and the color developer (bisphenol-A) acts as a proton donor to induce the colored stated of leuco dye components. When the lactone ring of the color former is closed, the thermochromic compound is in its colorless state. The addition of a proton induces the ring open, leaving the dye is in its color state^[@CR24]^.Figure 2Thermochromic response mechanism of the ODB-bisphenol A system.
Optimum fabrication process for reversible thermochromic wood veneers {#Sec4}
---------------------------------------------------------------------
Based on the optimum thermochromic compound formula, the effects of wood veneer impregnation temperature and time on the ΔE values of thermochromic wood veneers were investigated. Larger ΔE values indicated better thermochromic performance. Range and ANOVA analyses were used to determine the optimum impregnation parameters.
As shown in Table [5](#Tab5){ref-type="table"}, the mean ΔE values of the thermochromic wood veneers ranged from 20.77 to 37.96. All samples showed good thermochromic performances. From the range analysis of the orthogonal experiment (Fig. [3](#Fig3){ref-type="fig"}), the influential degree of the two factors was impregnation temperature \> impregnation time. As the impregnation temperature increased from 45 °C to 65 °C, the ΔE values significantly increased, and the color variations were correlated with the amount of thermochromic compounds in the wood veneers. In the ultrasonic impregnation process, the use of the ultrasonic technique increased the thermochromic compound's vibration displacement, velocity, molecular dispersion and energy^[@CR25]^, thereby increasing the mass transfer of thermochromic compounds impregnated into the wood veneers. Meanwhile, the cavitations generated during ultrasonic impregnation promoted the diffusion of thermochromic compounds into the wood veneers. As Fig. [3](#Fig3){ref-type="fig"} showed that the maximum ΔE values were obtained at the impregnation temperature level of 65 °C.Table 5Results and range analysis of the impregnated process for thermochromic wood veneers.TestImpregnation temperatureInteractionImpregnation timeNullΔEІIIIIIMean11(45 °C)11(0.5 min)120.7723.1322.2622.0521(45 °C)22(1.0 min)220.9324.926.0723.9731(45 °C)33(1.5 min)327.8728.4428.0428.1241(45 °C)44(2.0 min)429.8930.4330.1930.1752(55 °C)12(1.0 min)331.1430.4231.8931.1562(55 °C)21(0.5 min)425.3424.6223.9224.6272(55 °C)34(2.0 min)132.333.2830.7432.1082(55 °C)43(1.5 min)230.0527.9230.0329.3393(65 °C)13(1.5 min)437.9635.9534.2436.05103(65 °C)24(2.0 min)336.7337.6434.4636.28113(65 °C)31(0.5 min)227.4228.8326.1727.47123(65 °C)42(1.0 min)134.8334.5134.2234.52134(75 °C)14(2.0 min)230.9831.4030.4430.94144(75 °C)23(1.5 min)135.8129.8430.4832.04154(75 °C)32(1.0 min)435.2137.5536.236.32164(75 °C)41(0.5 min)333.0830.9533.1232.38 Figure 3Effects of thermochromic wood veneer processing parameters (**A**) impregnation time, (**B**) impregnation temperature) on ΔE values. Values are given as the mean ± s.d.
The impregnation time factor also had a significant effect on the ΔE values of the thermochromic wood veneers. As the impregnation time increased, the ΔE values gradually increased. During the wood impregnation process, the thermochromic compounds adsorbed on the wood surface first and then penetrated into the interior of the wood through the cell cavity and cell gap. As the impregnation time increased, the thermochromic compounds could become fully immersed into the wood veneers, which resulting in increases in the ΔE values.
Within the limits of the experimental conditions, the optimum thermochromic wood veneer can be fabricated by impregnation of the veneer with the thermochromic compounds (with a 1:2:60 ratio of ODB-2 to bisphenol A to 1-tetradecanol) suspension for 2.0 min at 65 °C, since K~i~ was highest at this combinations.
ANOVA was used to evaluate the significance of impregnation processing factors on ΔE values at α = 0.05 level. The results of ANOVA presented in Table [6](#Tab6){ref-type="table"}, indicated that impregnation temperature and time had significant effects on the ΔE values of thermochromic wood veneers.Table 6Analysis of variance test results for the ΔE values of thermochromic wood veneers.SourceSum of squaresdfMean squareFSig.Impregnation temperature436.1203145.37325.5480.000Interaction39.426313.1422.3100.092Impregnation time242.565380.85514.2100.000Error216.223385.690Total934.33547
Properties of thermochromic wood veneers {#Sec5}
----------------------------------------
The colorimetric values of thermochromic wood veneers were measured during heating from 12 °C up to 50 °C and cooling down to 12 °C. The color changes were calculated, and the results are shown in Fig. [4](#Fig4){ref-type="fig"}.Figure 4Color change values of thermochromic wood veneers during the heating (**A**) and cooling (**B**) processes.
The color characteristics of thermochromic compounds depend on temperature and procedure are illustrated in Fig. [5](#Fig5){ref-type="fig"}.Figure 5ΔE values of thermochromic wood veneers during heat and cool processing. T1 and T2 are the initial and final achromatic temperatures, while T4 and T3 are initial and final chromatic temperatures.
T1 and T2 describe the initial and final achromatic temperatures during the decolorization procedure. As the temperature dropped below 28 °C, the color parameters (L, a, b) rarely changed, and the color change value ΔE tended toward stability. Between 28 °C and 38 °C, decolorization occurs. Combined with the results from Fig. [4](#Fig4){ref-type="fig"}, the color parameters (L, a, b) increased significantly. As the temperature rose above 38 °C, the decolorization slowed down. From the literature, it is known that reversible thermochromic change occurs via two competing reactions. At low temperature in a leuco dye--developer--solvent system, the solvent exists in its solid form. As the temperature increases, the solvent melts, and the leuco dye--developer system converts to a colorless state.
During the chromatic procedure, as the temperature increased above 34 °C, the color parameters a and b rarely changed, and the ΔL and ΔE values increased slightly as the temperature ranged from 50--34 °C. T4 and T3 described the initial and final chromatic temperatures during the reverse action. As the temperature ranged between 34--22 °C, the color parameters significantly decreased, the ΔE values increased, and the system regained color. Based on the color change characteristics, it can be deduced that the initial and final chromic temperatures were 34--22 °C during the reverse reaction. A perfect reversible process should return to the same color after cooling. As shown in Fig. [5](#Fig5){ref-type="fig"}, the color hysteresis phenomenon occurred between the heated and cooled states. This phenomenon was also described in previous studies^[@CR26]^.
Stability of the thermochromic properties {#Sec6}
-----------------------------------------
The stability of the thermochromic properties was evaluated according to the changes in colorimetric parameters in heat-cool loops. Figure [6](#Fig6){ref-type="fig"} shows the colorimetric parameter values in 40 heat-cool loops. The ΔLn value is the difference between the initial value L1 and Ln after each loop, indicating Δa, Δb and ΔE.Figure 6Color change curves vs time during cycling between 0 °C and 70 °C.
As shown in Fig. [6](#Fig6){ref-type="fig"}, the Δa and Δb values rarely changed over 40 heat-cool loops. The ΔL (which ranged between −41.87 and −32.28) and ΔE values (which ranged between 34.46 and 43.81) fluctuated slightly during the loops, but the changes were quite small. Therefore, the heat-cool loop had no significant effect on the color stability of the thermochromic wood veneers, and the achromatic and chromatic sensitivities improved after first heat-cool loop.
FTIR analysis of thermochromic compounds and veneers {#Sec7}
----------------------------------------------------
Figures [7](#Fig7){ref-type="fig"} and [8](#Fig8){ref-type="fig"} show the FTIR spectra of the thermochromic compounds and wood veneers. The spectra illustrate the how well thermochromic compounds adhere to wood surfaces.Figure 7FTIR spectra of (**a**) 1-tetradecanol; (**b**) ODB-2; (**c**) bisphenol A; and (**d**) thermochromic compounds. Figure 8FTIR spectra of (**a**) thermochromic veneer and (**b**) control veneer.
The spectra of thermomic compounds and pure compounds are shown in Fig. [7](#Fig7){ref-type="fig"}. The pure 1-tetradecanol exhibits the -OH stretching vibration at 3311 cm^−1^. The peaks at 2915 cm^−1^ and 2848 cm^−1^ belong to the -CH~2~ asymmetric stretching vibration of aliphatic chain. Similarly, the peaks at 729 cm^−1^ and 720 cm^−1^ are associated with -CH~2~ deformation. The strong peak appearing at 1060 cm^−1^ attributed to C-O stretching. The -OH stretching of pure bisphenol A has a maximum at 3320 cm^−1^. The C-C stretching in the aromatic ring of bisphenol A appeared at 1508 cm^−1^. The C-H deformation in aromatic ring is associated with the peak at 824 cm^−1^. The peak at 1217 cm^−1^ appearing in pure bisphenol A is associated with phenol OH deformation and the peak at 1177 cm^−1^ is associated with C-O stretching. ODB-2 dye belongs to a family of lactone compounds, and the typical spectral band appeared at 1740 cm^−1^--1725 cm^−1^ ^[@CR27]^. In the FTIR spectra for pure ODB-2, three typical peaks at 1744 cm^−1^, 1598 cm^−1^ and 1581 cm^−1^ can be detected. The C=O band was noted at 1744 cm^−1^, and the C-C stretching of ODB-2 aromatic rings were represented by peaks at 1598 cm^−1^ and 1518 cm^−1^. In the spectra for the thermochromic compounds, the C=O band at 1744 cm^−1^ disappeared, and a new band appeared at 1462 cm^−1^. This band belongs to the -C-NH~2~ stretching band, confirming the existence of ODB-2 in the ring-open form.
Figure [8](#Fig8){ref-type="fig"} represents the FTIR spectra of a control veneer and a thermochromic wood veneer. The control veneer showed bands at 3320 cm^−1^ (O-H stretching), 2914 cm^−1^ (-CH~2~ stretching), 1362 cm^−1^ (C-H stretching), and 1026 cm^−1^ (C-O stretching), which assigned to the characteristic peaks of cellulosic structure^[@CR28]--[@CR30]^. Compared with control veneer, thermochromic veneer has an obvious intense peaks appearing at 2915 cm^−1^ and 2848 cm^−1^, which attributed to the -CH~2~ stretching vibration of thermochromic compounds. Absorption band at 1730 cm^−1^ is stronger than that of control veneer, which was assigned to C=O stretching vibration of lacton ring in leuco dye. The peak at 1462 cm^−1^ (-C-NH~2~) indicating that the thermochromic compounds entered the interior of the wood veneers and successfully adhering into the wood. The intensity of the C-O stretching peak at 1026 cm^−1^ and the O-H vibration peak at 3320 cm^−1^ both increased, whereas and the wave number at 1241 cm^−1^ decreased, this might be considered as an covalent bond between wood fibers and thermochromic compounds.
Conclusions {#Sec8}
===========
In this paper, a thermochromic wood veneer was fabricated. To achieve maximum ΔE values, the optimum thermochromic wood veneer can be fabricated by impregnating the wood with a suspension of thermochromic compounds (the ratio of ODB-2 to bisphenol A to 1-tetradecanol was 1:2:60) for 2.0 min at 65 °C. FTIR analysis demonstrated that intermolecular forces and covalent bond interaction formed between the thermochromic compounds and the wood. The color changed within a temperature range of 28--38 °C during the heating procedure, and the reverse action occurred within the temperature range of 34--22 °C. Color hysteresis was noted during the heating and cooling loops.
Methods {#Sec9}
=======
Materials {#Sec10}
---------
Juglans mandshurica veneers, 0.17 mm thickness, supplied by Taoshan Corporation (Harbin, China), were used for impregnation. The average moisture content was 7%. ODB-2 (purity 99.9%), bisphenol A (purity 99.9%) and 1-tetradecanol (purity 99.9%) were used for thermochromic compound synthesis and were supplied by Aladdin Chemicals Co., LTD (Shanghai, China).
Experimental design {#Sec11}
-------------------
The orthogonal experimental design method is a highly efficient, fast, and economical experimental design method for evaluating the effects of various factors on material performances^[@CR31]^. In this study, an orthogonal experimental design was adopted to select the optimum thermochromic compound formula and wood veneer impregnation parameters. To explore the optimum thermochromic compound formula, an orthogonal experiment with two factors, each at four levels, was conducted (Table [7](#Tab7){ref-type="table"}).Table 7Factors and levels.**LevelsFactors**A (Mixing ratio of ODB-2 and bisphenol A)B (Mixing ratio of ODB-2 and 1-tetradecanol)11:11:2021:21:4031:31:6041:41:80
Based on the optimum thermochromic compound formula, the effects of impregnation factors on wood veneer coloration were studied, and the various factors and selection levels are shown below (Table [8](#Tab8){ref-type="table"}). Sixteen test sets were performed, with three repetitions for each set.Table 8Factors and levels.LevelsFactorsImpregnation temperature/°CImpregnation time/min1450.52551.03651.54752.0
Fabrication route {#Sec12}
-----------------
Predetermined amounts of ODB-2, bisphenol A and 1-tetradecanol were added to a boiling 4-neck flask and were heated in a 70 °C water bath. The component mixture was stirred with a Teflon paddle at 600 rpm/min for 1 hour. Reversible thermochromic compounds were obtained after natural cooling. The reversible thermochromic wood veneers were prepared by ultrasonic impregnation with a thermochromic compound suspension (Fig. [9](#Fig9){ref-type="fig"}). The wood veneer samples were treated in an ultrasonic bath and were then placed in an oven to dry for 40 min at 40 °C. After drying, the thermochromic veneer samples were conditioned in a consistent cabinet at 50% RH to equilibrium at temperatures set at 0--70 °C.Figure 9Schematic diagram for thermochromic wood veneer fabrication.
Analysis of thermochromic properties {#Sec13}
------------------------------------
In this study, wood color was measured according to the CIElab system. The average color parameters, including L (lightness index), a (red-green index) and b (yellow-blue index) of the wood veneer surface were measured using an NP10QC chroma meter (3NH, Inc., China).
The color difference value ΔE was calculated using the following equation:$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\rm{\Delta }}E=\sqrt{{\rm{\Delta }}{L}^{2}+{\rm{\Delta }}{a}^{2}+{\rm{\Delta }}{b}^{2}}$$\end{document}$$
Fourier transform infrared (FTIR) spectra were recorded using a Nicolette 6700 (Nicolet, USA). The statistical analyses were performed using SPSS statistics 18.0 (IBM Corporation, USA) software. Range and ANOVA analyses were conducted to illustrate the effects of different factors on the color parameters.
Electronic supplementary material
=================================
{#Sec14}
Dataset 1
**Electronic supplementary material**
**Supplementary information** accompanies this paper at 10.1038/s41598-017-17238-9.
**Publisher\'s note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The authors are grateful for the financial support provided by the fundamental research funds for the central universities (2572016EBJ1).
Xiaodong Zhu conceived and designed the experiments; Ningwen Dong performed the experiments; Zhao Li analyzed the data; Xiaodong Zhu and Yu Liu wrote the paper.
Competing Interests {#FPar1}
===================
The authors declare that they have no competing interests.
|
{
"pile_set_name": "PubMed Central"
}
|
This talk tries to give you an overview of all the little parts that together make up a Jupyter-powered application, and how they fit together. Hint: For clickable links, download the PDF file and view locally.
* The Jupyter Project and its building blocks
* Internal magic: protocols, authenticators, spawners, gateways, kernels, …
* Deploying a local data science platform
- Simple host-based deployments
- Running Jupyter on Kubernetes
* Options for publishing notebooks
⏰ Duration: 30-45min + Q&A
PyData Südwest Meetup · April 2019 in Karlsruhe, Germany
⇒ https://www.meetup.com/PyData-Suedwest/events/258321928/
|
{
"pile_set_name": "OpenWebText2"
}
|
(CNN) -- James Mitchell, the stage actor and dancer who was best known for portraying wealthy patriarch Palmer Cortlandt on the soap opera "All My Children" for nearly 30 years, died Friday at age 89.
Mitchell died of pneumonia contracted after a years-long battle with pulmonary disease, according to a statement released by ABC.
His final appearance was January 5 for the show's 40th anniversary episode.
Mitchell had studied drama at Los Angeles City College in California. After receiving a degree, he joined a Los Angeles dance company, where he worked for four years before moving to New York to try starting his own dance company.
As he struggled to make it as a professional dancer, Mitchell appeared in many Broadway productions including "Brigadoon," "Paint Your Wagon" and "Bloomer Girl."
He also taught movement for actors at Juilliard, Yale and Drake University in Iowa.
He took on the role of villainous businessman Cortlandt in 1979. He appeared in more than 300 episodes of the soap opera and was a regular on the show until 2008.
Fans expressed their condolences over Twitter and on "All my Children" message boards Monday morning, remembering Mitchell and his character as feisty and legendary.
He is survived by his partner, Albert Wolsky. Memorial services will be at a later date.
|
{
"pile_set_name": "Pile-CC"
}
|
A 10-year review of quality improvement monitoring in pain management: recommendations for standardized outcome measures.
Quality measurement in health care is complex and in a constant state of evolution. Different approaches are necessary depending on the purpose of the measurement (e.g., accountability, research, improvement). Recent changes in health care accreditation standards are driving increased attention to measurement of the quality of pain management for improvement purposes. The purpose of this article is to determine what indicators are being used for pain quality improvement, compare results across studies, and provide specific recommendations to simplify and standardize future measurement of quality for hospital-based pain management initiatives. Pain management quality improvement monitoring experience and data from 1992 to 2001 were analyzed from 20 studies performed at eight large hospitals in the United States. Hospitals included: the University of Wisconsin Hospital and Clinics, Madison; Texas Medical Center, Houston; McAllen Medical Center, McAllen, TX; San Francisco General Hospital, San Francisco; Rush-Presbyterian-St. Luke's Medical Center and Northwestern Memorial Hospital, Chicago, IL; Memorial Sloan Kettering Cancer Center, New York; and Kaiser Sunnyside Medical Center of Kaiser Permanente Northwest, Clackamas, OR. Analyses of data led to consensus on six quality indicators for hospital-based pain management. These indicators include: the intensity of pain is documented with a numeric or descriptive rating scale; pain intensity is documented at frequent intervals; pain is treated by a route other than intramuscular; pain is treated with regularly administered analgesics, and when possible, a multimodal approach is used; pain is prevented and controlled to a degree that facilitates function and quality of life; and patients are adequately informed and knowledgeable about pain management. Although there are no perfect measures of quality, longitudinal data support the validity of a core set of indicators that could be used to obtain benchmark data for quality improvement in pain management in the hospital setting.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Transplantation of quantum dot-labelled bone marrow-derived stem cells into the vitreous of mice with laser-induced retinal injury: survival, integration and differentiation.
Accidental laser exposure to the eyes may result in serious visual impairment due to retina degeneration. Currently limited treatment is available for laser eye injury. In the current study, we investigated the therapeutic potential of bone marrow-derived stem cells (BMSCs) for laser-induced retinal trauma. Lineage negative bone marrow cells (Lin(-) BMCs) were labelled with quantum dots (Qdots) to track the cells in vivo. Lin(-) BMCs survived well after intravitreal injection. In vivo bromodeoxyuridine (BrdU) labelling showed these cells continued to proliferate and integrate into injured retinas. Furthermore, they expressed markers that distinguished retinal pigment epithelium (RPE), endothelium, pericytes and photoreceptors. Our results suggest that BMSCs participate in the repair of retinal lesions by differentiating into retinal cells. Intravitreal transplantation of BMSCs is a potential treatment for laser-induced retinal trauma.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Structural insights into the mechanisms and specificities of IgG-active endoglycosidases.
The conserved N-glycan on Asn297 of Immunoglobulin G (IgG) has significant impacts on antibody effector functions, and is a frequent target for antibody engineering. Chemoenzymatic synthesis has emerged as a strategy for producing antibodies with homogenous glycosylation and improved effector functions. Central to this strategy is the use of enzymes with activity on the Asn297 glycan. EndoS and EndoS2, produced by Streptococcus pyogenes, are endoglycosidases with remarkable specificity for Asn297 glycosylation, making them ideal tools for chemoenzymatic synthesis. Although both enzymes are specific for IgG, EndoS2 recognizes a wider range of glycans than EndoS. Recent progress has been made in understanding the structural basis for their activities on antibodies. In this review, we examine the molecular mechanism of glycosidic bond cleavage by these enzymes and how specific point mutations convert them into glycosynthases. We also discuss the structural basis for differences in the glycan repertoire that IgG-active endoglycosidases recognize, which focuses on the structure of the loops within the glycoside hydrolase (GH) domain. Finally, we discuss the important contributions of carbohydrate binding modules (CBMs) to endoglycosidase activity, and how CBMs work in concert with GH domains to produce optimal activity on IgG.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
# dorothy [](http://travis-ci.org/#!/daveray/dorothy/builds)
[Hiccup-style](https://github.com/weavejester/hiccup) generation of
[Graphviz](http://www.graphviz.org/) graphs in Clojure and ClojureScript.
*Dorothy is extremely alpha and subject to radical change. [Release Notes Here](https://github.com/daveray/dorothy/wiki)*
## Usage
*Dorothy assumes you have an understanding of Graphviz and DOT. The text below describes the mechanics of Dorothy's DSL, but you'll need to refer to the Graphviz documentation for specifics on node shapes, valid attributes, etc.*
*The Graphviz dot tool executable must be on the system path to render*
Dorothy is on Clojars. In Leiningen:
[dorothy "x.y.z"]
A graph consists of a vector of *statements*. The following sections describe the format for all the types of statements. If you're bored, skip ahead to the "Defining Graphs" section below.
### Node Statement
A *node statement* defines a node in the graph. It can take two forms:
node-id
[node-id]
[node-id { attr map }]
where `node-id` is a string, number or keyword with optional trailing *port* and *compass-point*. Here are some node statement examples:
:node0 ; Define a node called "node0"
:node0:port0 ; Define a node called "node0" with port "port0"
:node0:port0:sw ; Similarly a node with southwest compass point
the node's attr map is a map of attributes for the node. For example,
[:start {:shape :Mdiamond}]
; => start [shape=Mdiamond];
Dorothy will correctly escape and quote node-ids as required by dot.
A node id can also be auto-generated with `(gen-id object)`. For example,
[(gen-id some-object) {:label (.getText some-object)}]
It allows you to use arbitrary objects as nodes.
### Edge Statement
An *edge statement* defines an edge in the graph. It is expressed as a vector with two or more node-ids followed optional attribute map:
[node-id0 node-id1 ... node-idN { attr map }]
; => "node-id0" -> "node-id1" -> ... -> "node-idN" [attrs ...];
In addition to node ids, an edge statement may also contain subgraphs:
[:start (subgraph [... subgraph statements ...])]
For readability, `:>` delimiters may be optionally included in an edge statement:
[:start :> :middle :> :end]
### Graph Attribute Statement
A *graph attribute* statement sets graph-wide attributes. It is expressed as a single map:
{:label "process #1", :style :filled, :color :lightgrey}
; => graph [label="process #1",style=filled,color=lightgrey];
alternatively, this can be expressed with the `(graph-attrs)` function like this:
(graph-attrs {:label "process #1", :style :filled, :color :lightgrey})
; => graph [label="process #1",style=filled,color=lightgrey];
### Node and Edge Attribute Statement
A *node attribute* or *edge attribute* statement sets node or edge attributes respectively for all nodes and edge statements that follow. It is expressed with `(node-attrs)` and `(edge-attrs)` statements:
(node-attrs {:style :filled, :color :white})
; => node [style=filled,color=white];
or:
(edge-attrs {:color :black})
; => edge [color=black];
## Defining Graphs
As mentioned above, a graph consists of a series of statements. These statements are passed to the `graph`, `digraph`, or `subgraph` functions. Each takes an optional set of attributes followed by a vector of statements:
<img src="https://github.com/downloads/daveray/dorothy/dorothy-show2.png" align="right"/>
; From http://www.graphviz.org/content/cluster
(digraph [
(subgraph :cluster_0 [
{:style :filled, :color :lightgrey, :label "process #1"}
(node-attrs {:style :filled, :color :white})
[:a0 :> :a1 :> :a2 :> :a3]])
(subgraph :cluster_1 [
{:color :blue, :label "process #2"}
(node-attrs {:style :filled})
[:b0 :> :b1 :> :b2 :> :b3]])
[:start :a0]
[:start :b0]
[:a1 :b3]
[:b2 :a3]
[:a3 :a0]
[:a3 :end]
[:b3 :end]
[:start {:shape :Mdiamond}]
[:end {:shape :Msquare}]])
Similarly for `(graph)` (undirected graph) and `(subgraph)`. A second form of these functions takes an initial option map, or a string or keyword id for the graph:
(graph :graph-id ...)
; => graph "graph-id" { ... }
(digraph { :id :G :strict? true } ...)
; => strict graph G { ... }
## Generate Graphviz dot format
Given a graph built with the functions described above, use the `(dot)` function to generate Graphviz DOT output.
(require '[dorothy.core :as dot])
(def g (dot/graph [ ... ]))
(dot/dot g)
"graph { ... }"
## Rendering images (ClojureScript)
Dorothy currently doesn't include any facilities for rendering dot-format output to images. However,
you can pull in [viz.cljc](https://github.com/jebberjeb/viz.cljc) or
[viz.js](https://github.com/mdaines/viz.js), both of which will allow you to produce
png, svg, and other image formats from your dorothy-generated dot-formatted graph content.
Wanted: pull requests to implement node equivalents to the rendering functions available for Clojure/JVM
in the `dorothy.jvm` namespace. **link to github issue here**
## Render images via `graphviz` (Clojure/JVM)
Once you have DOT language output, you can render it as an image using the `(render)` function:
(require '[dorothy.jvm :refer (render save! show!)])
; This produces a png as an array of bytes
(render graph {:format :png})
; This produces an SVG string
(render graph {:format :svg})
; A one-liner with a very simple 4 node digraph.
(-> (dot/digraph [ [:a :b :c] [:b :d] ])
dot/dot
(render {:format :svg}))
*The dot tool executable must be on the system path*
other formats include `:pdf`, `:gif`, etc. The result will be either a java byte array, or String depending on whether the format is binary or not. `(render)` returns a string or a byte array depending on whether the output format is binary or not.
Alternatively, use the `(save!)` function to write to a file or output stream.
; A one-liner with a very simple 4 node digraph
(-> (dot/digraph [ [:a :b :c] [:b :d] ])
dot/dot
(save! "out.png" {:format :png}))
Finally, for simple tests, use the `(show!)` function to view the result in a simple Swing viewer:
; This opens a simple Swing viewer with the graph
(show! graph)
; A one-liner with a very simple 4 node digraph
(-> (dot/digraph [ [:a :b :c] [:b :d] ])
dot/dot
show!)
which shows:
<img src="sample.png"/>
## License
Copyright (C) 2011-2017 Dave Ray and contributors
Distributed under the Eclipse Public License, the same as Clojure.
|
{
"pile_set_name": "Github"
}
|
Proportion of extended-spectrum β-lactamase (ESBL)-producing isolates among Enterobacteriaceae in Africa: evaluation of the evidence--systematic review.
Extended-spectrum β-lactamases (ESBLs) have become widespread around the world. We sought to evaluate the proportion of ESBL-producing isolates among Enterobacteriaceae in Africa. A systematic search in the PubMed and Scopus databases was performed in order to identify studies providing the proportion of ESBL-producing isolates among patients either infected or colonized with Enterobacteriaceae. In an effort to incorporate contemporary data, only studies published from 2005 onwards and, among them, only those including isolates that were recovered from 2000 onwards were eligible. Twenty-six studies (409 ,215 isolates) from 13 African countries met the inclusion criteria. The proportion of ESBL-producing isolates among 13 studies reporting on isolates from a urinary source varied from 1.5% to 22.8%. Four other studies evaluated various clinical samples from different hospitals, showing that the proportion varied from 12.8% to 21.1%. Last, the proportions were 0.7%, 14%, 15.2% and 75.8%, respectively, in four studies evaluating patients with bloodstream infection. In particular, the proportion was 0.7% in a study from Malawi where ceftriaxone was the only available cephalosporin and was 75.8% in a study from Egypt that included only patients from intensive care units. In total, the proportion of ESBL-producing isolates was <15% in 16 out of 26 studies. Data originating from a small number of African countries suggest that the proportion of ESBL-producing isolates among Enterobacteriaceae may not be high in Africa, but is certainly not negligible. Further studies are needed from countries where no or limited relevant data are available.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Pages
Tuesday, July 17, 2007
Birthday Wishes
Last week on SCS there was a challenge to use up scraps of paper. I loved this challenge! I have so much nice scrap laying around. Just strips of stuff here and there. Sewing on cards goes wonderfully with a vintage theme so I pulled out this stack of presents that I haven't used in quite a while. Colored with copic markers. The pp is My Mind's Eye (Tres Jolie). The background I used my very handy B-line design polka dot stamp. I inked in craft white then embossed in detail white powder. I dirtied up the edges with some Close to Cocoa Classic ink. The prima I colored with my copic to match my focal image.
Can you see I sewed around the outside of the focal image. You do this all the time in quilting when you want an applique piece to stand out.....so I thought it could work here too.
I got a TON of wonderful stamps from MFT yesterday....I get to play with them but can't show them to you quite yet. I will soon!!!!
|
{
"pile_set_name": "Pile-CC"
}
|
I am working with various season suite owners helping them sublease out their Private Luxury Suites for the 9/4/17 Chick Fil A Kickoff Game between Tennessee Volunteers and the Georgia Tech Yellow Jackets.Copy and paste this link to view the intro video of the new stadium.Intro video to the new stadiumhttp://mercedesbenzstadium.com/fly-through-mercedes-benz-stadium/The new Mercedes Benz Stadium ha
I am working with various season suite owners helping them sublease out their Private Luxury Suites for the 9/4/17 Chick Fil A Kickoff Game between Tennessee Volunteers and the Georgia Tech Yellow Jackets.Copy and paste this link to view the intro video of the new stadium.Intro video to the new stadiumhttp://mercedesbenzstadium.com/fly-through-mercedes-benz-stadium/The new Mercedes Benz Stadium ha
Chromic Con The World\\\'s First Marijuana Comic Book & Fantasy Convention is coming to Las Vegas July 8th at Alexis Park!Chromic Con is one of Colorado\\\'s longest running and most popular cannabis events currently in it\\\'s 4th year and now we are coming to Las Vegas. Bringing fans face to face with their favorite stars of Sci-fi Movies like Star Wars, Batman, Addams Family, Gremlins, and Star
Chromic Con The World\\\'s First Marijuana Comic Book & Fantasy Convention is coming to Las Vegas July 8th at Alexis Park!Chromic Con is one of Colorado\\\'s longest running and most popular cannabis events currently in it\\\'s 4th year and now we are coming to Las Vegas. Bringing fans face to face with their favorite stars of Sci-fi Movies like Star Wars, Batman, Addams Family, Gremlins, and Star
PUBLIC SERVICE ANNOUNCEMENT START: Century 21 GJ Brown is being sued over in New England (for running a fraudulent business venture etc). Recently Michael Brown Gloria Brown Apollo Realogy RefNet & Century 21 LLC International have been sued in a voluminous 720+ Page Complaint with almost 100 Counts for among other charges Breach of Contract affecting the Plaintiffs of that case and the public (CB
Fly Tri - Cities: http://www.flytricities.comThis year is expected to be many days of snow. Alaska has already cancelled flights in and out of Wenatchee because of a little snow on the ground yet it snows in Yakima, Pasco & Spokane but they are still running flights in and out. Plus FedEx is still operating out of Pangborn even though there is a little snow on the ground. And because of the many d
Fly Tri - Cities: http://www.flytricities.comThis year is expected to be many days of snow. Alaska has already cancelled flights in and out of Wenatchee because of a little snow on the ground yet it snows in Yakima, Pasco & Spokane but they are still running flights in and out. Plus FedEx is still operating out of Pangborn even though there is a little snow on the ground. And because of the many d
WWE: Smackdown TicketsTucson ArenaTucson, AZ June 21, 2016 View TicketsUse discount code \\\"Online\\\" at checkout for Savings on all Tickets from this site.atching with the eyes which they possess. The blind card wool with their hands, separating the down from the hairs, with which latter they stuff the couches and sofas; those who are without the use of eyes and hands give the use of their ears
THE GOO GOO DOLLS 2016 TOURThe Goo Goo Dolls, Collective Soul & Tribe Society TicketsKlipsch Amphitheatre At Bayfront ParkMiami, FL Friday9/2/20167:00 PMVIEWTICKETS We have The Goo Goo Dolls concert tickets for all tour dates announced for the 2016 tour.If you are a The Goo Goo Dolls fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(su
V BLINK 182 2016 CONCERT TICKETS SCHEDULEBlink 182, A Day To Remember & All American Rejects TicketsSunlight Supply AmphitheaterRidgefield, WA Tuesday9/20/20167:00 PMVIEWTICKETS We have Blink 182 concert tickets for all tour dates announced for the 2016 Tour.If you are a Blink 182 fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such
COLDPLAY A HEAD FULL OF DREAMS TOUR CONCERT TICKETSColdplay TicketsKFC Yum! CenterLouisville, KY Wednesday7/27/20167:00 PMVIEWTICKETS We have Coldplay concert tickets for all tour dates announced for the 2016 A Head Full Of Dreams.If you are a Coldplay fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row se
BRIT FLOYD 2016 TOUR DATES & TICKETS SCHEDULEBrit Floyd TicketsSacramento Community Center TheaterSacramento, CA Tuesday7/12/20168:00 PMVIEWTICKETS We have Brit Floyd concert tickets for all tour dates announced for the 2016 Brit Floyd The World\\\'s Greatest Pink Floyd Show.If you are a Brit Floyd fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats m
MAKS & VAL LIVE ON TOUR: OUR WAY TICKKETSMaks & Val: Our Way TicketsPalace Theatre ColumbusColumbus, OH Tuesday7/19/20167:30 PMVIEWTICKETS We have Maks & Val: Our Way tickets for all tour dates announced for the 2016.If you are a Maks & Val: Our Way fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row seats
SELENA GOMEZ 2016 REVIVAL WORLD TOUR TICKETSSelena Gomez & DNCE TicketsBOK CenterTulsa, OK Sunday6/19/20167:30 PMVIEWTICKETS We have Selena Gomez concert tickets for all tour dates announced for the 2016 Revival World.If you are a Selena Gomez fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row seats, or V
PAUL MCCARTNEY 2016 ONE ON ONE TOURPaul McCartney TicketsHersheypark StadiumHershey, PA Tuesday7/19/20167:30 PMVIEWTICKETS We have Paul McCartney concert tickets for all tour dates announced for the 2016 One On One.If you are a Paul McCartney fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row seats, or VI
MAKS & VAL LIVE ON TOUR: OUR WAY TICKKETSMaks & Val: Our Way TicketsCount Basie TheatreRed Bank, NJ Thursday6/30/20168:00 PMVIEWTICKETS We have Maks & Val: Our Way tickets for all tour dates announced for the 2016.If you are a Maks & Val: Our Way fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row seats, o
BLINK 182 2016 CONCERT TICKETS SCHEDULEBlink 182 & Hawthorne Heights TicketsBankPlus AmphitheatreSouthaven, MS Thursday6/16/20167:00 PMVIEWTICKETS We have Blink 182 concert tickets for all tour dates announced for the 2016 Tour.If you are a Blink 182 fan you will not want to miss out on the opportunity to attend one of the concerts. The best seats may available(such as Fan Packages, front row seat
|
{
"pile_set_name": "Pile-CC"
}
|
Sophie Scholl’s last words to the chaplain
With regards to Sophie Scholl’s last wishes that in addition to Prof. Muth, I should give her greetings to the friends in Munich as well, I can only assume that these greetings were for the Graf siblings. I cannot name anyone else who could have been part of Scholl siblings’ circle of friends [Note 1].
|
{
"pile_set_name": "Pile-CC"
}
|
LOG IN TO MY ACCOUNT Michigan Chapter Do It Yourself Fundraising The event you requested is not currently published.
|
{
"pile_set_name": "OpenWebText2"
}
|
Hardware: Online Arena
Hardware: Online Arena is an online multiplayer game that focuses on vehicular destruction using varying means such as missiles, lasers and machine guns. The game was released for PlayStation 2 with the launch of online play for the console and was thus arguably the first online game for PS2. The game was not a huge commercial success, selling very little. To boost sales, the game was added onto the network access disk that came with the purchase of the network adaptor and, as a result, the game was one of the three most popular games played online during 2003, having over 200 users on at any one time. GamesMaster Magazine said the game was, "A great indicator of the shape of things to come for PS2 online."
A spin-off game on the PlayStation Portable was released in 2005 under the name Fired Up. A PlayStation 4 game based on the original called Hardware: Rivals was released as a PlayStation Plus exclusive beta on the PlayStation Network on 29 September 2015.
External links
Category:2003 video games
Category:Europe-exclusive video games
Category:Multiplayer and single-player video games
Category:Multiplayer online games
Category:PlayStation 2 games
Category:PlayStation 2-only games
Category:Sony Interactive Entertainment games
Category:Vehicular combat games
Category:Video games developed in the United Kingdom
Category:Video games scored by Alastair Lindsay
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Q:
Hyper -V 2012-R2 Expanding VHDX for VM did not expand the current file size
Hyper-V 2012-R2 with 1 VM (Windows 7). I increased the VM disk size from 60 GB to 80 GB and the operation completed OK. When I click on "Inspect Disk", it says:
Current File Size: 59.97 GB Maximum disk Size: 82 GB
When I go on the VM ->drive C: -> Properties: Capacity 59.8 GB
Why it didn't increase the current file size capacity to 82 GB ?
Notes: The server has only one physical HDD and the VHDX is IDE.
A:
Increasing the vhdx doesn't increase the volume size inside the vm. So when you look at the c: drive size in the vm it will not change.
You need to open disk management and expand the volume to be the size of the vhdx. This won't instantly increase the file size on the host but it will show the extra available free space.
This link explains how to expand the volume in Windows 7 https://technet.microsoft.com/en-us/library/cc771473.aspx#BKMK_CMD
|
{
"pile_set_name": "StackExchange"
}
|
Earlier in the week, based on a handful of rumors and a report from FOX Sports’ Jay Glazer, we suggested the Detroit Lions may be among a dozen different head coaching vacancies in 2018.
Though we’ve yet to reach Black Monday, or even the final game of the season, it already appears that estimate was a bit bloated.
Here is our original list:
Giants
Bears
Colts
Cardinals
Bengals
Buccaneers
Browns
Cowboys
Broncos
Jets
Washington
Titans
But since that article has been published a few things have happened:
Throw in the fact that Browns and Cowboys management have publicly thrown their support behind their current head coaches, and the list of 13 teams may actually turn out to be just 5-7 teams.
If that’s the case, that is actually a perfectly normal number of coaching changes in a year. Take a look at the recent history in NFL coaching changes.
Post-2016 season: 6 coaching changes
2015: 7
2014: 7
2013: 7
2012: 8
Many, myself included, thought that the high amount of coaching turnover could be a reason for the Lions to hold off on firing Jim Caldwell this offseason. With so much competition for the next great head coach, it would be no guarantee that Detroit would get their man, even if their situation appears to be one of the most desirable for a new head coach.
But with a much smaller pool of teams likely looking for a new coaching staff, there’s now one fewer reason for Detroit to keep their head coach around for another year.
|
{
"pile_set_name": "OpenWebText2"
}
|
Human papillomavirus in women with vulvar intraepithelial neoplasia III.
Untreated cases of vulvar intraepithelial neoplasia (VIN) III may progress to invasive vulvar carcinoma. Tissues from 29 New Zealand women with VIN III were examined for the presence of human papillomavirus (HPV) types 6, 11, 16 and 18 by in situ hybridization and polymerase chain reaction. HPV 16, the only HPV type detected in the lesions, was identified in about half the cases. HPV-positive women were younger than HPV-negative women, and their lesions displayed koilocytosis more often. In four of five cases in which there was a progression to invasive cancer, HPV 16 was detected in both the VIN III and invasive cancer tissue.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
// SPDX-License-Identifier: GPL-2.0
/*
* r8a77995 Clock Pulse Generator / Module Standby and Software Reset
*
* Copyright (C) 2017 Glider bvba
*
* Based on r8a7795-cpg-mssr.c
*
* Copyright (C) 2015 Glider bvba
* Copyright (C) 2015 Renesas Electronics Corp.
*/
#include <common.h>
#include <clk-uclass.h>
#include <dm.h>
#include <dt-bindings/clock/r8a77995-cpg-mssr.h>
#include "renesas-cpg-mssr.h"
#include "rcar-gen3-cpg.h"
enum clk_ids {
/* Core Clock Outputs exported to DT */
LAST_DT_CORE_CLK = R8A77995_CLK_CPEX,
/* External Input Clocks */
CLK_EXTAL,
/* Internal Core Clocks */
CLK_MAIN,
CLK_PLL0,
CLK_PLL1,
CLK_PLL3,
CLK_PLL0D2,
CLK_PLL0D3,
CLK_PLL0D5,
CLK_PLL1D2,
CLK_PE,
CLK_S0,
CLK_S1,
CLK_S2,
CLK_S3,
CLK_SDSRC,
CLK_RPCSRC,
CLK_RINT,
CLK_OCO,
/* Module Clocks */
MOD_CLK_BASE
};
static const struct cpg_core_clk r8a77995_core_clks[] = {
/* External Clock Inputs */
DEF_INPUT("extal", CLK_EXTAL),
/* Internal Core Clocks */
DEF_BASE(".main", CLK_MAIN, CLK_TYPE_GEN3_MAIN, CLK_EXTAL),
DEF_BASE(".pll1", CLK_PLL1, CLK_TYPE_GEN3_PLL1, CLK_MAIN),
DEF_BASE(".pll3", CLK_PLL3, CLK_TYPE_GEN3_PLL3, CLK_MAIN),
DEF_FIXED(".pll0", CLK_PLL0, CLK_MAIN, 4, 250),
DEF_FIXED(".pll0d2", CLK_PLL0D2, CLK_PLL0, 2, 1),
DEF_FIXED(".pll0d3", CLK_PLL0D3, CLK_PLL0, 3, 1),
DEF_FIXED(".pll0d5", CLK_PLL0D5, CLK_PLL0, 5, 1),
DEF_FIXED(".pll1d2", CLK_PLL1D2, CLK_PLL1, 2, 1),
DEF_FIXED(".pe", CLK_PE, CLK_PLL0D3, 4, 1),
DEF_FIXED(".s0", CLK_S0, CLK_PLL1, 2, 1),
DEF_FIXED(".s1", CLK_S1, CLK_PLL1, 3, 1),
DEF_FIXED(".s2", CLK_S2, CLK_PLL1, 4, 1),
DEF_FIXED(".s3", CLK_S3, CLK_PLL1, 6, 1),
DEF_FIXED(".sdsrc", CLK_SDSRC, CLK_PLL1, 2, 1),
DEF_FIXED(".rpcsrc", CLK_RPCSRC, CLK_PLL1, 2, 1),
DEF_DIV6_RO(".r", CLK_RINT, CLK_EXTAL, CPG_RCKCR, 32),
DEF_RATE(".oco", CLK_OCO, 8 * 1000 * 1000),
/* Core Clock Outputs */
DEF_FIXED("z2", R8A77995_CLK_Z2, CLK_PLL0D3, 1, 1),
DEF_FIXED("ztr", R8A77995_CLK_ZTR, CLK_PLL1, 6, 1),
DEF_FIXED("zt", R8A77995_CLK_ZT, CLK_PLL1, 4, 1),
DEF_FIXED("zx", R8A77995_CLK_ZX, CLK_PLL1, 3, 1),
DEF_FIXED("s0d1", R8A77995_CLK_S0D1, CLK_S0, 1, 1),
DEF_FIXED("s1d1", R8A77995_CLK_S1D1, CLK_S1, 1, 1),
DEF_FIXED("s1d2", R8A77995_CLK_S1D2, CLK_S1, 2, 1),
DEF_FIXED("s1d4", R8A77995_CLK_S1D4, CLK_S1, 4, 1),
DEF_FIXED("s2d1", R8A77995_CLK_S2D1, CLK_S2, 1, 1),
DEF_FIXED("s2d2", R8A77995_CLK_S2D2, CLK_S2, 2, 1),
DEF_FIXED("s2d4", R8A77995_CLK_S2D4, CLK_S2, 4, 1),
DEF_FIXED("s3d1", R8A77995_CLK_S3D1, CLK_S3, 1, 1),
DEF_FIXED("s3d2", R8A77995_CLK_S3D2, CLK_S3, 2, 1),
DEF_FIXED("s3d4", R8A77995_CLK_S3D4, CLK_S3, 4, 1),
DEF_FIXED("cl", R8A77995_CLK_CL, CLK_PLL1, 48, 1),
DEF_FIXED("cp", R8A77995_CLK_CP, CLK_EXTAL, 2, 1),
DEF_FIXED("cpex", R8A77995_CLK_CPEX, CLK_EXTAL, 4, 1),
DEF_DIV6_RO("osc", R8A77995_CLK_OSC, CLK_EXTAL, CPG_RCKCR, 8),
DEF_GEN3_RPC("rpc", R8A77995_CLK_RPC, CLK_RPCSRC, 0x238),
DEF_GEN3_PE("s1d4c", R8A77995_CLK_S1D4C, CLK_S1, 4, CLK_PE, 2),
DEF_GEN3_PE("s3d1c", R8A77995_CLK_S3D1C, CLK_S3, 1, CLK_PE, 1),
DEF_GEN3_PE("s3d2c", R8A77995_CLK_S3D2C, CLK_S3, 2, CLK_PE, 2),
DEF_GEN3_PE("s3d4c", R8A77995_CLK_S3D4C, CLK_S3, 4, CLK_PE, 4),
DEF_GEN3_SD("sd0", R8A77995_CLK_SD0, CLK_SDSRC, 0x268),
DEF_DIV6P1("canfd", R8A77995_CLK_CANFD, CLK_PLL0D3, 0x244),
DEF_DIV6P1("mso", R8A77995_CLK_MSO, CLK_PLL1D2, 0x014),
DEF_GEN3_RCKSEL("r", R8A77995_CLK_R, CLK_RINT, 1, CLK_OCO, 61 * 4),
};
static const struct mssr_mod_clk r8a77995_mod_clks[] = {
DEF_MOD("scif5", 202, R8A77995_CLK_S3D4C),
DEF_MOD("scif4", 203, R8A77995_CLK_S3D4C),
DEF_MOD("scif3", 204, R8A77995_CLK_S3D4C),
DEF_MOD("scif1", 206, R8A77995_CLK_S3D4C),
DEF_MOD("scif0", 207, R8A77995_CLK_S3D4C),
DEF_MOD("msiof3", 208, R8A77995_CLK_MSO),
DEF_MOD("msiof2", 209, R8A77995_CLK_MSO),
DEF_MOD("msiof1", 210, R8A77995_CLK_MSO),
DEF_MOD("msiof0", 211, R8A77995_CLK_MSO),
DEF_MOD("sys-dmac2", 217, R8A77995_CLK_S3D1),
DEF_MOD("sys-dmac1", 218, R8A77995_CLK_S3D1),
DEF_MOD("sys-dmac0", 219, R8A77995_CLK_S3D1),
DEF_MOD("cmt3", 300, R8A77995_CLK_R),
DEF_MOD("cmt2", 301, R8A77995_CLK_R),
DEF_MOD("cmt1", 302, R8A77995_CLK_R),
DEF_MOD("cmt0", 303, R8A77995_CLK_R),
DEF_MOD("scif2", 310, R8A77995_CLK_S3D4C),
DEF_MOD("emmc0", 312, R8A77995_CLK_SD0),
DEF_MOD("usb-dmac0", 330, R8A77995_CLK_S3D1),
DEF_MOD("usb-dmac1", 331, R8A77995_CLK_S3D1),
DEF_MOD("rwdt", 402, R8A77995_CLK_R),
DEF_MOD("intc-ex", 407, R8A77995_CLK_CP),
DEF_MOD("intc-ap", 408, R8A77995_CLK_S1D2),
DEF_MOD("audmac0", 502, R8A77995_CLK_S3D1),
DEF_MOD("hscif3", 517, R8A77995_CLK_S3D1C),
DEF_MOD("hscif0", 520, R8A77995_CLK_S3D1C),
DEF_MOD("thermal", 522, R8A77995_CLK_CP),
DEF_MOD("pwm", 523, R8A77995_CLK_S3D4C),
DEF_MOD("fcpvd1", 602, R8A77995_CLK_S1D2),
DEF_MOD("fcpvd0", 603, R8A77995_CLK_S1D2),
DEF_MOD("fcpvbs", 607, R8A77995_CLK_S0D1),
DEF_MOD("vspd1", 622, R8A77995_CLK_S1D2),
DEF_MOD("vspd0", 623, R8A77995_CLK_S1D2),
DEF_MOD("vspbs", 627, R8A77995_CLK_S0D1),
DEF_MOD("ehci0", 703, R8A77995_CLK_S3D2),
DEF_MOD("hsusb", 704, R8A77995_CLK_S3D2),
DEF_MOD("du1", 723, R8A77995_CLK_S1D1),
DEF_MOD("du0", 724, R8A77995_CLK_S1D1),
DEF_MOD("lvds", 727, R8A77995_CLK_S2D1),
DEF_MOD("vin4", 807, R8A77995_CLK_S1D2),
DEF_MOD("etheravb", 812, R8A77995_CLK_S3D2),
DEF_MOD("imr0", 823, R8A77995_CLK_S1D2),
DEF_MOD("gpio6", 906, R8A77995_CLK_S3D4),
DEF_MOD("gpio5", 907, R8A77995_CLK_S3D4),
DEF_MOD("gpio4", 908, R8A77995_CLK_S3D4),
DEF_MOD("gpio3", 909, R8A77995_CLK_S3D4),
DEF_MOD("gpio2", 910, R8A77995_CLK_S3D4),
DEF_MOD("gpio1", 911, R8A77995_CLK_S3D4),
DEF_MOD("gpio0", 912, R8A77995_CLK_S3D4),
DEF_MOD("can-fd", 914, R8A77995_CLK_S3D2),
DEF_MOD("can-if1", 915, R8A77995_CLK_S3D4),
DEF_MOD("can-if0", 916, R8A77995_CLK_S3D4),
DEF_MOD("rpc", 917, R8A77995_CLK_RPC),
DEF_MOD("i2c3", 928, R8A77995_CLK_S3D2),
DEF_MOD("i2c2", 929, R8A77995_CLK_S3D2),
DEF_MOD("i2c1", 930, R8A77995_CLK_S3D2),
DEF_MOD("i2c0", 931, R8A77995_CLK_S3D2),
DEF_MOD("ssi-all", 1005, R8A77995_CLK_S3D4),
DEF_MOD("ssi4", 1011, MOD_CLK_ID(1005)),
DEF_MOD("ssi3", 1012, MOD_CLK_ID(1005)),
DEF_MOD("scu-all", 1017, R8A77995_CLK_S3D4),
DEF_MOD("scu-dvc1", 1018, MOD_CLK_ID(1017)),
DEF_MOD("scu-dvc0", 1019, MOD_CLK_ID(1017)),
DEF_MOD("scu-ctu1-mix1", 1020, MOD_CLK_ID(1017)),
DEF_MOD("scu-ctu0-mix0", 1021, MOD_CLK_ID(1017)),
DEF_MOD("scu-src6", 1025, MOD_CLK_ID(1017)),
DEF_MOD("scu-src5", 1026, MOD_CLK_ID(1017)),
};
/*
* CPG Clock Data
*/
/*
* MD19 EXTAL (MHz) PLL0 PLL1 PLL3
*--------------------------------------------------------------------
* 0 48 x 1 x250/4 x100/3 x100/3
* 1 48 x 1 x250/4 x100/3 x58/3
*/
#define CPG_PLL_CONFIG_INDEX(md) (((md) & BIT(19)) >> 19)
static const struct rcar_gen3_cpg_pll_config cpg_pll_configs[2] = {
/* EXTAL div PLL1 mult/div PLL3 mult/div */
{ 1, 100, 3, 100, 3, },
{ 1, 100, 3, 58, 3, },
};
static const struct mstp_stop_table r8a77995_mstp_table[] = {
{ 0x00200000, 0x0, 0x00200000, 0 },
{ 0xFFFFFFFF, 0x0, 0xFFFFFFFF, 0 },
{ 0x340E2FDC, 0x2040, 0x340E2FDC, 0 },
{ 0xFFFFFFDF, 0x400, 0xFFFFFFDF, 0 },
{ 0x80000184, 0x180, 0x80000184, 0 },
{ 0xC3FFFFFF, 0x0, 0xC3FFFFFF, 0 },
{ 0xFFFFFFFF, 0x0, 0xFFFFFFFF, 0 },
{ 0xFFFFFFFF, 0x0, 0xFFFFFFFF, 0 },
{ 0x01F1FFF7, 0x0, 0x01F1FFF7, 0 },
{ 0xFFFFFFFE, 0x0, 0xFFFFFFFE, 0 },
{ 0xFFFEFFE0, 0x0, 0xFFFEFFE0, 0 },
{ 0x000000B7, 0x0, 0x000000B7, 0 },
};
static const void *r8a77995_get_pll_config(const u32 cpg_mode)
{
return &cpg_pll_configs[CPG_PLL_CONFIG_INDEX(cpg_mode)];
}
static const struct cpg_mssr_info r8a77995_cpg_mssr_info = {
.core_clk = r8a77995_core_clks,
.core_clk_size = ARRAY_SIZE(r8a77995_core_clks),
.mod_clk = r8a77995_mod_clks,
.mod_clk_size = ARRAY_SIZE(r8a77995_mod_clks),
.mstp_table = r8a77995_mstp_table,
.mstp_table_size = ARRAY_SIZE(r8a77995_mstp_table),
.reset_node = "renesas,r8a77995-rst",
.mod_clk_base = MOD_CLK_BASE,
.clk_extal_id = CLK_EXTAL,
.clk_extalr_id = ~0,
.get_pll_config = r8a77995_get_pll_config,
};
static const struct udevice_id r8a77995_clk_ids[] = {
{
.compatible = "renesas,r8a77995-cpg-mssr",
.data = (ulong)&r8a77995_cpg_mssr_info
},
{ }
};
U_BOOT_DRIVER(clk_r8a77995) = {
.name = "clk_r8a77995",
.id = UCLASS_CLK,
.of_match = r8a77995_clk_ids,
.priv_auto_alloc_size = sizeof(struct gen3_clk_priv),
.ops = &gen3_clk_ops,
.probe = gen3_clk_probe,
.remove = gen3_clk_remove,
};
|
{
"pile_set_name": "Github"
}
|
The present invention relates to releasable fishing line clips and more particularly concerns an improved snag-free outrigger or downrigger clip of a compact arrangement, having increased efficiency, decreased line friction and improved latching.
In various types of trolling, the fishing line is held at a position to one side of, or below, a cruising boat by means of an outrigger or downrigger. The line is releasably held at the outwardly or downwardly displaced position by being passed through a clip secured to a support, such as an outrigger pole or a weighted downwardly extending line. The clip is arranged so that when a fish strikes the bait or lure, the line tension increases sufficiently to free the line from the clip.
Because the clip is displaced from the cruising boat, the fishing line passing through the clip makes a sharp bend, generally being led over a releasable member, such as a wire or bail, that is pivoted to the clip and pulled outwardly by a sudden tension increase so as to allow the line to run freely out on the clip. Many releasable clips presently available create excessive friction between the fishing line and the wire or bail over which it runs so that the line frequently is seriously damaged or frayed.
An arrangement that attempts to decrease this friction is described in the U.S. Pat. No. 3,905,148, to Naone et al which shows a circular sheave with fixed axial protuberances. These protuberances are frictionally received and clamped between a pair of legs that are adjusted to maintain the sheave in position. The clamping force needed to hold the sheave in position exerts a rotation restraining frictional force on the sheave which thus may experience difficulties in turning and the concomitant loss of a friction-free characteristic. Further, with the arrangement of Naone et al, the increased tension on a line to release the line from the clip will pull the sheave completely free of its supporting legs as the line is released. Thus, the sheave is lost each time there is a strike, and a new sheave must be employed for reuse of the clip. Obviously, economic considerations will prevent this disposable and expendable sheave from being manufactured with optimum characteristics of efficiency, durability, and frictionless rotation.
The clip of our prior application, identified above, includes an all-plastic latch member which overlies both the body and the pivoted arm and may be subject to wear and inadvertent release or displacement. Tension of the trolling line varies as the lure skips in and out of the water, so that under some circumstances a very small diameter or compressible line, such as a Dacron line, may slip over the end of the roller of the clip of our prior application and become jammed between the end surface of the roller and the roller mounting arm. The clip described in the present application minimizes or avoids such problems and provides an improved, more efficient, and compact design having significant advantages over the invention of our earlier application.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Mass spectrometers are used in a wide variety of applications. For example, mass spectrometers are used to analyze organic materials, such as pharmaceutical compounds, environmental compounds and biomolecules. Mass spectrometers have found particular applicability in DNA and protein sequencing. In these and other applications there is an ever-increasing demand for mass accuracy, as well as comparatively high resolution of analysis of sample ions by the mass spectrometer.
Time-of-flight mass spectrometry (TOFMS) involves accelerating ions through the same potential using an electric field. The TOFMS then measures the time of travel (i.e., flight in the electric field) of the ions to a detector. If the ions are of the same charge, their kinetic energy is the same and their velocities depend on their mass. Thus, the particles of differing masses may be resolved based solely on their velocity and hence, their time of flight. TOFMS devices have a resolving power on the order of 103 to 104. However, in many applications a higher resolving power is desirable.
Fourier transform ion cyclotron resonance (FTICR) MS, measures mass by detecting the image current produced by ions cyclotroning in the presence of a magnetic field. Instead of measuring the deflection of ions with a detector such as an electron multiplier, the ions are injected into a Penning trap (a static electric/magnetic ion trap) where they effectively form part of a circuit. Detectors at fixed positions in space measure the electrical signal of ions which pass near them over time producing cyclical signal. Since the frequency of an ion's cycling is determined by its mass-to-charge ratio, the frequency can be deconvoluted by performing a Fourier transform on the signal. FTICR MS has the advantage of high sensitivity (since each ion is ‘counted’ more than once) and much high resolution and thus precision FTICR mass spectrometer provides a comparatively high resolving power (on the order of 106).
While FTICR MS provides comparatively high resolving power, these types of mass spectrometers are comparatively complex, large and expensive. Notably, FTICR MS devices require a rather large magnetic field and magnetic. These magnets may be superconducting magnets requiring sufficient cooling to achieve and maintain superconducting conditions. As such, not only is the size and complexity of the FTICR MS great, the capital and operating costs are often high. Alone of in combination, these factors render the FTICR MS impractical in many applications.
Another type of mass spectrometer that has garnered attention recently is known as an orbitrap. In a known orbitrap, ions are electrostatically trapped in an orbit around a central, spindle-shaped electrode. The electrode confines the ions so that they both orbit around the central electrode and oscillate back and forth along the central electrode's long axis. This oscillation generates an image current in the detector plates which is recorded by the instrument. The frequencies of these image currents depend on the mass to charge ratios of the ions in the orbitrap. Mass spectra are obtained by Fourier transformation of the recorded image currents.
Like FTICR MS devices, orbitraps have a comparatively high mass accuracy, a comparatively high sensitivity and a good dynamic range. However, unlike the FTICR MS, the orbitrap does not require a large magnet and ancillary equipment.
While promising, known orbitraps normally comprise machined components to generate the electric fields for the trap. Once made, these components cannot be easily altered or tuned after fabrication. As such, if there are manufacturing inconsistencies or flaws, for example, little relief is available and the manufacturing yields are adversely impacted. Moreover, if the geometry of the machined pieces is flawed the electric field may be irreparably flawed. This results in poor performance.
In addition to the noted shortcomings of known orbitraps, ion injection can be rather difficult. In particular, in known orbitraps, the outer conductor has tapered ends and is maintained at a particular voltage, which may be rather large. Ions injected into the orbitrap from the tapered ends can be ejected by the large field created by the outer conductor. Thus, many known orbitraps require elaborate ion optics and ion injectors to introduce the ions into the trap effectively. Clearly, these injection facilitating devices can be costly and can add to the complexity of the orbitrap MS.
There is a need, therefore, for resonator structure and filter that overcomes at least the shortcoming of known optical encoders discussed above.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Wednesday, 17 July 2013
Purple Emperors and supporting cast
Hi This morning was spent in the Fermyn Wood CP/Fermyn Wood/ Lady Wood and Souther Wood complex east of Corby looking at interesting insects.The star of the show was the Purple Emperor butterfly which is currently showing very well in this warm weather. The majority were males but one larger female was on the wing today. These extraordinary insects can show very well and regularly spend long periods on the ground taking minerals, and it is quite common for them to land on delighted observers in search of salt!Plenty of other butterflies were on the wing including White Admiral, Silver-washed Fritillary, Purple Hairstreak and White-letter Hairstreak. The country park ponds attracted Brown Hawker, Emperor Dragonfly, Four Spot Chaser, Ruddy Darter, Large Red Damselfly and Emerald Damselfly. The Long Pond still contained plenty of Great Crested Newts showing well.A Moorhen family included two adults, three first brood youngsters and three second brood youngsters. Surprisingly the adults were feeding youngsters of both broods even though the first brood birds were easily capable of feeding themselves!Plenty of common birds in the woods included good numbers of Nuthatch and Marsh Tit. A Crossbill flew over Fermyn Wood and a Siskin was also present. A small party of Crossbills were heard calling in Lady/Souther Wood.Scanning over Blatherwycke Lake produced a Wigeon, two Black Swans and a Tufted Duck brood.RegardsEleanor and Neil
|
{
"pile_set_name": "Pile-CC"
}
|
With its bright whites and perfect black levels, the LG 55EC9300 lives up to the promise...
Back in 2008, Toshiba took a beating when its HD DVD format lost the format wars against Blu-ray. Four years later, the enforced focus on LCD has resulted in solid budget TVs like the Toshiba 32C120U and now the Toshiba 40E220U.
The Toshiba 40E220U is a sub-$500 television with a lot to offer the bargain-minded consumer. It has fairly deep black levels, a better selection of inputs than most competitors, and rich, vibrant colors. Image processing is quite good, with a crisp picture and very good off-axis performance.
On the downside, the Toshiba's shadow detail isn't as good as its competitors', uniformity is lacking, and the design is a little dated.
In short, while there are plenty of options at this price level, the 40E220U is a no-frills television with a fine picture.
Design
Sarah Tew/CNET
The Toshiba 40E220U is a cheap TV and unfortunately it also looks like one. It sports a two-tone finish consisting of a black bezel with silver trim at the bottom -- a look that was popular several years ago but has since fallen out of fashion. The TV sits on an oval stand that doesn't swivel.
Sarah Tew/CNET
The remote is the same one that ships with the 32C120U, with squishy, closely spaced buttons. There are certainly better remotes than this if yours are ergonomic concerns.
Meanwhile, the TV's menu system is fairly basic with a black-and-green color scheme. Most irritatingly, control of one of the most important functions -- the light sensor -- is hidden inside the menu system, and if you don't disable it your picture will be too dim. Check our picture settings forum post to find out how to find it.
Key TV features
Display technology
LCD
LED backlight
N/A
Screen finish
Matte
Remote
Standard
Smart TV
No
Internet connection
No
3D technology
No
3D glasses included
No
Refresh rate(s)
60Hz
Dejudder (smooth) processing
No
DLNA-compliant
Photo/Music/Video
USB
Photo/Music/Video
Other: None
Features
Unlike the smaller 32C120U, the 40E220U has a full 1080p screen resolution, but there's no further added functionality beyond that TV's fairly basic feature set. If you're interested in multimedia playback, though, the Toshiba can play back JPEG images and MP3 tunes via the USB port.
Sarah Tew/CNET
Picture settings: The E220 offers a number of possible tweaks, including the option to adjust the grayscale slightly and to choose from among a bunch of different gamma settings. The DynaLight feature adjusts the backlight control based on image content.
Annoyingly, if you try to change any of the presets (such as Movie or Standard) the mode switches to Preference, making it easy to accidentally delete your settings.
Sarah Tew/CNET
Connectivity: The Toshiba 40E220U's inputs include two HDMI ports, one each component- and composite-video, an RGB-style PC input, and a USB port.
Picture quality
Just as the 32-inch Toshiba 32C120U has the best picture quality in its size, the 40-inch 40E220U similarly stands out among its peers. While you don't get plasmalike depths, the E220's black levels are good for the price, and shadow detail is acceptable.
|
{
"pile_set_name": "Pile-CC"
}
|
Trials Evolution Sets Sales Record
Trials Evolution, the sequel to 2009 Xbox Live Arcade game Trials HD, has had a record-setting launch. Evolution is said to have sold more than 100,000 copies in a day, making it the highest-grossing XBLA release day ever.
The exact sales figures for the day weren't released. However, Gamasutra notes that there were 120,000 users on the online leaderboards on its first day. Evolution is priced at $15 (1200 MS Points) so the game earned at least $1.5 million on launch.
The demand for the game was higher than expected. The servers were actually overloaded at first and as a result there were some leaderboard issues. Microsoft eventually added new servers, though, to stablize the experience. Hopefully it'll be smooth sailing from here on out.
Finland-based developer RedLynx must be thrilled to see Evolution make a bigger splash than its predecessor. I'm sure Ubisoft is smiling right now, too. They purchased RedLynx back in November.
In Trials Evolution, players ride a motorcycle through obstacle courses. They must ride through the course as quickly as possible with as few crashes. Up to four players can race against each other online or on the same console. An editor included with the game allows players to create and share their own tracks. The editor has a the user friendly Lite mode and a more advanced Pro mode that allows players to script entirely new types of games.
Evolution debuted on XBLA on April 18th. It's the first game released as part of the Arcade Next promotion. The four-week string of high-profile XBLA releases will also include MineCraft Xbox 360 Edition, Fable Heroes and Bloodforge.
|
{
"pile_set_name": "Pile-CC"
}
|
// go run mksysnum.go https://svn.freebsd.org/base/stable/11/sys/kern/syscalls.master
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build arm,freebsd
package unix
const (
// SYS_NOSYS = 0; // { int nosys(void); } syscall nosys_args int
SYS_EXIT = 1 // { void sys_exit(int rval); } exit sys_exit_args void
SYS_FORK = 2 // { int fork(void); }
SYS_READ = 3 // { ssize_t read(int fd, void *buf, size_t nbyte); }
SYS_WRITE = 4 // { ssize_t write(int fd, const void *buf, size_t nbyte); }
SYS_OPEN = 5 // { int open(char *path, int flags, int mode); }
SYS_CLOSE = 6 // { int close(int fd); }
SYS_WAIT4 = 7 // { int wait4(int pid, int *status, int options, struct rusage *rusage); }
SYS_LINK = 9 // { int link(char *path, char *link); }
SYS_UNLINK = 10 // { int unlink(char *path); }
SYS_CHDIR = 12 // { int chdir(char *path); }
SYS_FCHDIR = 13 // { int fchdir(int fd); }
SYS_MKNOD = 14 // { int mknod(char *path, int mode, int dev); }
SYS_CHMOD = 15 // { int chmod(char *path, int mode); }
SYS_CHOWN = 16 // { int chown(char *path, int uid, int gid); }
SYS_OBREAK = 17 // { int obreak(char *nsize); } break obreak_args int
SYS_GETPID = 20 // { pid_t getpid(void); }
SYS_MOUNT = 21 // { int mount(char *type, char *path, int flags, caddr_t data); }
SYS_UNMOUNT = 22 // { int unmount(char *path, int flags); }
SYS_SETUID = 23 // { int setuid(uid_t uid); }
SYS_GETUID = 24 // { uid_t getuid(void); }
SYS_GETEUID = 25 // { uid_t geteuid(void); }
SYS_PTRACE = 26 // { int ptrace(int req, pid_t pid, caddr_t addr, int data); }
SYS_RECVMSG = 27 // { int recvmsg(int s, struct msghdr *msg, int flags); }
SYS_SENDMSG = 28 // { int sendmsg(int s, struct msghdr *msg, int flags); }
SYS_RECVFROM = 29 // { int recvfrom(int s, caddr_t buf, size_t len, int flags, struct sockaddr * __restrict from, __socklen_t * __restrict fromlenaddr); }
SYS_ACCEPT = 30 // { int accept(int s, struct sockaddr * __restrict name, __socklen_t * __restrict anamelen); }
SYS_GETPEERNAME = 31 // { int getpeername(int fdes, struct sockaddr * __restrict asa, __socklen_t * __restrict alen); }
SYS_GETSOCKNAME = 32 // { int getsockname(int fdes, struct sockaddr * __restrict asa, __socklen_t * __restrict alen); }
SYS_ACCESS = 33 // { int access(char *path, int amode); }
SYS_CHFLAGS = 34 // { int chflags(const char *path, u_long flags); }
SYS_FCHFLAGS = 35 // { int fchflags(int fd, u_long flags); }
SYS_SYNC = 36 // { int sync(void); }
SYS_KILL = 37 // { int kill(int pid, int signum); }
SYS_GETPPID = 39 // { pid_t getppid(void); }
SYS_DUP = 41 // { int dup(u_int fd); }
SYS_PIPE = 42 // { int pipe(void); }
SYS_GETEGID = 43 // { gid_t getegid(void); }
SYS_PROFIL = 44 // { int profil(caddr_t samples, size_t size, size_t offset, u_int scale); }
SYS_KTRACE = 45 // { int ktrace(const char *fname, int ops, int facs, int pid); }
SYS_GETGID = 47 // { gid_t getgid(void); }
SYS_GETLOGIN = 49 // { int getlogin(char *namebuf, u_int namelen); }
SYS_SETLOGIN = 50 // { int setlogin(char *namebuf); }
SYS_ACCT = 51 // { int acct(char *path); }
SYS_SIGALTSTACK = 53 // { int sigaltstack(stack_t *ss, stack_t *oss); }
SYS_IOCTL = 54 // { int ioctl(int fd, u_long com, caddr_t data); }
SYS_REBOOT = 55 // { int reboot(int opt); }
SYS_REVOKE = 56 // { int revoke(char *path); }
SYS_SYMLINK = 57 // { int symlink(char *path, char *link); }
SYS_READLINK = 58 // { ssize_t readlink(char *path, char *buf, size_t count); }
SYS_EXECVE = 59 // { int execve(char *fname, char **argv, char **envv); }
SYS_UMASK = 60 // { int umask(int newmask); } umask umask_args int
SYS_CHROOT = 61 // { int chroot(char *path); }
SYS_MSYNC = 65 // { int msync(void *addr, size_t len, int flags); }
SYS_VFORK = 66 // { int vfork(void); }
SYS_SBRK = 69 // { int sbrk(int incr); }
SYS_SSTK = 70 // { int sstk(int incr); }
SYS_OVADVISE = 72 // { int ovadvise(int anom); } vadvise ovadvise_args int
SYS_MUNMAP = 73 // { int munmap(void *addr, size_t len); }
SYS_MPROTECT = 74 // { int mprotect(const void *addr, size_t len, int prot); }
SYS_MADVISE = 75 // { int madvise(void *addr, size_t len, int behav); }
SYS_MINCORE = 78 // { int mincore(const void *addr, size_t len, char *vec); }
SYS_GETGROUPS = 79 // { int getgroups(u_int gidsetsize, gid_t *gidset); }
SYS_SETGROUPS = 80 // { int setgroups(u_int gidsetsize, gid_t *gidset); }
SYS_GETPGRP = 81 // { int getpgrp(void); }
SYS_SETPGID = 82 // { int setpgid(int pid, int pgid); }
SYS_SETITIMER = 83 // { int setitimer(u_int which, struct itimerval *itv, struct itimerval *oitv); }
SYS_SWAPON = 85 // { int swapon(char *name); }
SYS_GETITIMER = 86 // { int getitimer(u_int which, struct itimerval *itv); }
SYS_GETDTABLESIZE = 89 // { int getdtablesize(void); }
SYS_DUP2 = 90 // { int dup2(u_int from, u_int to); }
SYS_FCNTL = 92 // { int fcntl(int fd, int cmd, long arg); }
SYS_SELECT = 93 // { int select(int nd, fd_set *in, fd_set *ou, fd_set *ex, struct timeval *tv); }
SYS_FSYNC = 95 // { int fsync(int fd); }
SYS_SETPRIORITY = 96 // { int setpriority(int which, int who, int prio); }
SYS_SOCKET = 97 // { int socket(int domain, int type, int protocol); }
SYS_CONNECT = 98 // { int connect(int s, caddr_t name, int namelen); }
SYS_GETPRIORITY = 100 // { int getpriority(int which, int who); }
SYS_BIND = 104 // { int bind(int s, caddr_t name, int namelen); }
SYS_SETSOCKOPT = 105 // { int setsockopt(int s, int level, int name, caddr_t val, int valsize); }
SYS_LISTEN = 106 // { int listen(int s, int backlog); }
SYS_GETTIMEOFDAY = 116 // { int gettimeofday(struct timeval *tp, struct timezone *tzp); }
SYS_GETRUSAGE = 117 // { int getrusage(int who, struct rusage *rusage); }
SYS_GETSOCKOPT = 118 // { int getsockopt(int s, int level, int name, caddr_t val, int *avalsize); }
SYS_READV = 120 // { int readv(int fd, struct iovec *iovp, u_int iovcnt); }
SYS_WRITEV = 121 // { int writev(int fd, struct iovec *iovp, u_int iovcnt); }
SYS_SETTIMEOFDAY = 122 // { int settimeofday(struct timeval *tv, struct timezone *tzp); }
SYS_FCHOWN = 123 // { int fchown(int fd, int uid, int gid); }
SYS_FCHMOD = 124 // { int fchmod(int fd, int mode); }
SYS_SETREUID = 126 // { int setreuid(int ruid, int euid); }
SYS_SETREGID = 127 // { int setregid(int rgid, int egid); }
SYS_RENAME = 128 // { int rename(char *from, char *to); }
SYS_FLOCK = 131 // { int flock(int fd, int how); }
SYS_MKFIFO = 132 // { int mkfifo(char *path, int mode); }
SYS_SENDTO = 133 // { int sendto(int s, caddr_t buf, size_t len, int flags, caddr_t to, int tolen); }
SYS_SHUTDOWN = 134 // { int shutdown(int s, int how); }
SYS_SOCKETPAIR = 135 // { int socketpair(int domain, int type, int protocol, int *rsv); }
SYS_MKDIR = 136 // { int mkdir(char *path, int mode); }
SYS_RMDIR = 137 // { int rmdir(char *path); }
SYS_UTIMES = 138 // { int utimes(char *path, struct timeval *tptr); }
SYS_ADJTIME = 140 // { int adjtime(struct timeval *delta, struct timeval *olddelta); }
SYS_SETSID = 147 // { int setsid(void); }
SYS_QUOTACTL = 148 // { int quotactl(char *path, int cmd, int uid, caddr_t arg); }
SYS_NLM_SYSCALL = 154 // { int nlm_syscall(int debug_level, int grace_period, int addr_count, char **addrs); }
SYS_NFSSVC = 155 // { int nfssvc(int flag, caddr_t argp); }
SYS_LGETFH = 160 // { int lgetfh(char *fname, struct fhandle *fhp); }
SYS_GETFH = 161 // { int getfh(char *fname, struct fhandle *fhp); }
SYS_SYSARCH = 165 // { int sysarch(int op, char *parms); }
SYS_RTPRIO = 166 // { int rtprio(int function, pid_t pid, struct rtprio *rtp); }
SYS_SEMSYS = 169 // { int semsys(int which, int a2, int a3, int a4, int a5); }
SYS_MSGSYS = 170 // { int msgsys(int which, int a2, int a3, int a4, int a5, int a6); }
SYS_SHMSYS = 171 // { int shmsys(int which, int a2, int a3, int a4); }
SYS_SETFIB = 175 // { int setfib(int fibnum); }
SYS_NTP_ADJTIME = 176 // { int ntp_adjtime(struct timex *tp); }
SYS_SETGID = 181 // { int setgid(gid_t gid); }
SYS_SETEGID = 182 // { int setegid(gid_t egid); }
SYS_SETEUID = 183 // { int seteuid(uid_t euid); }
SYS_STAT = 188 // { int stat(char *path, struct stat *ub); }
SYS_FSTAT = 189 // { int fstat(int fd, struct stat *sb); }
SYS_LSTAT = 190 // { int lstat(char *path, struct stat *ub); }
SYS_PATHCONF = 191 // { int pathconf(char *path, int name); }
SYS_FPATHCONF = 192 // { int fpathconf(int fd, int name); }
SYS_GETRLIMIT = 194 // { int getrlimit(u_int which, struct rlimit *rlp); } getrlimit __getrlimit_args int
SYS_SETRLIMIT = 195 // { int setrlimit(u_int which, struct rlimit *rlp); } setrlimit __setrlimit_args int
SYS_GETDIRENTRIES = 196 // { int getdirentries(int fd, char *buf, u_int count, long *basep); }
SYS___SYSCTL = 202 // { int __sysctl(int *name, u_int namelen, void *old, size_t *oldlenp, void *new, size_t newlen); } __sysctl sysctl_args int
SYS_MLOCK = 203 // { int mlock(const void *addr, size_t len); }
SYS_MUNLOCK = 204 // { int munlock(const void *addr, size_t len); }
SYS_UNDELETE = 205 // { int undelete(char *path); }
SYS_FUTIMES = 206 // { int futimes(int fd, struct timeval *tptr); }
SYS_GETPGID = 207 // { int getpgid(pid_t pid); }
SYS_POLL = 209 // { int poll(struct pollfd *fds, u_int nfds, int timeout); }
SYS_SEMGET = 221 // { int semget(key_t key, int nsems, int semflg); }
SYS_SEMOP = 222 // { int semop(int semid, struct sembuf *sops, size_t nsops); }
SYS_MSGGET = 225 // { int msgget(key_t key, int msgflg); }
SYS_MSGSND = 226 // { int msgsnd(int msqid, const void *msgp, size_t msgsz, int msgflg); }
SYS_MSGRCV = 227 // { int msgrcv(int msqid, void *msgp, size_t msgsz, long msgtyp, int msgflg); }
SYS_SHMAT = 228 // { int shmat(int shmid, const void *shmaddr, int shmflg); }
SYS_SHMDT = 230 // { int shmdt(const void *shmaddr); }
SYS_SHMGET = 231 // { int shmget(key_t key, size_t size, int shmflg); }
SYS_CLOCK_GETTIME = 232 // { int clock_gettime(clockid_t clock_id, struct timespec *tp); }
SYS_CLOCK_SETTIME = 233 // { int clock_settime( clockid_t clock_id, const struct timespec *tp); }
SYS_CLOCK_GETRES = 234 // { int clock_getres(clockid_t clock_id, struct timespec *tp); }
SYS_KTIMER_CREATE = 235 // { int ktimer_create(clockid_t clock_id, struct sigevent *evp, int *timerid); }
SYS_KTIMER_DELETE = 236 // { int ktimer_delete(int timerid); }
SYS_KTIMER_SETTIME = 237 // { int ktimer_settime(int timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue); }
SYS_KTIMER_GETTIME = 238 // { int ktimer_gettime(int timerid, struct itimerspec *value); }
SYS_KTIMER_GETOVERRUN = 239 // { int ktimer_getoverrun(int timerid); }
SYS_NANOSLEEP = 240 // { int nanosleep(const struct timespec *rqtp, struct timespec *rmtp); }
SYS_FFCLOCK_GETCOUNTER = 241 // { int ffclock_getcounter(ffcounter *ffcount); }
SYS_FFCLOCK_SETESTIMATE = 242 // { int ffclock_setestimate( struct ffclock_estimate *cest); }
SYS_FFCLOCK_GETESTIMATE = 243 // { int ffclock_getestimate( struct ffclock_estimate *cest); }
SYS_CLOCK_NANOSLEEP = 244 // { int clock_nanosleep(clockid_t clock_id, int flags, const struct timespec *rqtp, struct timespec *rmtp); }
SYS_CLOCK_GETCPUCLOCKID2 = 247 // { int clock_getcpuclockid2(id_t id,int which, clockid_t *clock_id); }
SYS_NTP_GETTIME = 248 // { int ntp_gettime(struct ntptimeval *ntvp); }
SYS_MINHERIT = 250 // { int minherit(void *addr, size_t len, int inherit); }
SYS_RFORK = 251 // { int rfork(int flags); }
SYS_OPENBSD_POLL = 252 // { int openbsd_poll(struct pollfd *fds, u_int nfds, int timeout); }
SYS_ISSETUGID = 253 // { int issetugid(void); }
SYS_LCHOWN = 254 // { int lchown(char *path, int uid, int gid); }
SYS_AIO_READ = 255 // { int aio_read(struct aiocb *aiocbp); }
SYS_AIO_WRITE = 256 // { int aio_write(struct aiocb *aiocbp); }
SYS_LIO_LISTIO = 257 // { int lio_listio(int mode, struct aiocb * const *acb_list, int nent, struct sigevent *sig); }
SYS_GETDENTS = 272 // { int getdents(int fd, char *buf, size_t count); }
SYS_LCHMOD = 274 // { int lchmod(char *path, mode_t mode); }
SYS_LUTIMES = 276 // { int lutimes(char *path, struct timeval *tptr); }
SYS_NSTAT = 278 // { int nstat(char *path, struct nstat *ub); }
SYS_NFSTAT = 279 // { int nfstat(int fd, struct nstat *sb); }
SYS_NLSTAT = 280 // { int nlstat(char *path, struct nstat *ub); }
SYS_PREADV = 289 // { ssize_t preadv(int fd, struct iovec *iovp, u_int iovcnt, off_t offset); }
SYS_PWRITEV = 290 // { ssize_t pwritev(int fd, struct iovec *iovp, u_int iovcnt, off_t offset); }
SYS_FHOPEN = 298 // { int fhopen(const struct fhandle *u_fhp, int flags); }
SYS_FHSTAT = 299 // { int fhstat(const struct fhandle *u_fhp, struct stat *sb); }
SYS_MODNEXT = 300 // { int modnext(int modid); }
SYS_MODSTAT = 301 // { int modstat(int modid, struct module_stat *stat); }
SYS_MODFNEXT = 302 // { int modfnext(int modid); }
SYS_MODFIND = 303 // { int modfind(const char *name); }
SYS_KLDLOAD = 304 // { int kldload(const char *file); }
SYS_KLDUNLOAD = 305 // { int kldunload(int fileid); }
SYS_KLDFIND = 306 // { int kldfind(const char *file); }
SYS_KLDNEXT = 307 // { int kldnext(int fileid); }
SYS_KLDSTAT = 308 // { int kldstat(int fileid, struct kld_file_stat* stat); }
SYS_KLDFIRSTMOD = 309 // { int kldfirstmod(int fileid); }
SYS_GETSID = 310 // { int getsid(pid_t pid); }
SYS_SETRESUID = 311 // { int setresuid(uid_t ruid, uid_t euid, uid_t suid); }
SYS_SETRESGID = 312 // { int setresgid(gid_t rgid, gid_t egid, gid_t sgid); }
SYS_AIO_RETURN = 314 // { ssize_t aio_return(struct aiocb *aiocbp); }
SYS_AIO_SUSPEND = 315 // { int aio_suspend( struct aiocb * const * aiocbp, int nent, const struct timespec *timeout); }
SYS_AIO_CANCEL = 316 // { int aio_cancel(int fd, struct aiocb *aiocbp); }
SYS_AIO_ERROR = 317 // { int aio_error(struct aiocb *aiocbp); }
SYS_YIELD = 321 // { int yield(void); }
SYS_MLOCKALL = 324 // { int mlockall(int how); }
SYS_MUNLOCKALL = 325 // { int munlockall(void); }
SYS___GETCWD = 326 // { int __getcwd(char *buf, u_int buflen); }
SYS_SCHED_SETPARAM = 327 // { int sched_setparam (pid_t pid, const struct sched_param *param); }
SYS_SCHED_GETPARAM = 328 // { int sched_getparam (pid_t pid, struct sched_param *param); }
SYS_SCHED_SETSCHEDULER = 329 // { int sched_setscheduler (pid_t pid, int policy, const struct sched_param *param); }
SYS_SCHED_GETSCHEDULER = 330 // { int sched_getscheduler (pid_t pid); }
SYS_SCHED_YIELD = 331 // { int sched_yield (void); }
SYS_SCHED_GET_PRIORITY_MAX = 332 // { int sched_get_priority_max (int policy); }
SYS_SCHED_GET_PRIORITY_MIN = 333 // { int sched_get_priority_min (int policy); }
SYS_SCHED_RR_GET_INTERVAL = 334 // { int sched_rr_get_interval (pid_t pid, struct timespec *interval); }
SYS_UTRACE = 335 // { int utrace(const void *addr, size_t len); }
SYS_KLDSYM = 337 // { int kldsym(int fileid, int cmd, void *data); }
SYS_JAIL = 338 // { int jail(struct jail *jail); }
SYS_SIGPROCMASK = 340 // { int sigprocmask(int how, const sigset_t *set, sigset_t *oset); }
SYS_SIGSUSPEND = 341 // { int sigsuspend(const sigset_t *sigmask); }
SYS_SIGPENDING = 343 // { int sigpending(sigset_t *set); }
SYS_SIGTIMEDWAIT = 345 // { int sigtimedwait(const sigset_t *set, siginfo_t *info, const struct timespec *timeout); }
SYS_SIGWAITINFO = 346 // { int sigwaitinfo(const sigset_t *set, siginfo_t *info); }
SYS___ACL_GET_FILE = 347 // { int __acl_get_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_FILE = 348 // { int __acl_set_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_GET_FD = 349 // { int __acl_get_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_FD = 350 // { int __acl_set_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS___ACL_DELETE_FILE = 351 // { int __acl_delete_file(const char *path, acl_type_t type); }
SYS___ACL_DELETE_FD = 352 // { int __acl_delete_fd(int filedes, acl_type_t type); }
SYS___ACL_ACLCHECK_FILE = 353 // { int __acl_aclcheck_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_ACLCHECK_FD = 354 // { int __acl_aclcheck_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS_EXTATTRCTL = 355 // { int extattrctl(const char *path, int cmd, const char *filename, int attrnamespace, const char *attrname); }
SYS_EXTATTR_SET_FILE = 356 // { ssize_t extattr_set_file( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_FILE = 357 // { ssize_t extattr_get_file( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_FILE = 358 // { int extattr_delete_file(const char *path, int attrnamespace, const char *attrname); }
SYS_AIO_WAITCOMPLETE = 359 // { ssize_t aio_waitcomplete( struct aiocb **aiocbp, struct timespec *timeout); }
SYS_GETRESUID = 360 // { int getresuid(uid_t *ruid, uid_t *euid, uid_t *suid); }
SYS_GETRESGID = 361 // { int getresgid(gid_t *rgid, gid_t *egid, gid_t *sgid); }
SYS_KQUEUE = 362 // { int kqueue(void); }
SYS_KEVENT = 363 // { int kevent(int fd, struct kevent *changelist, int nchanges, struct kevent *eventlist, int nevents, const struct timespec *timeout); }
SYS_EXTATTR_SET_FD = 371 // { ssize_t extattr_set_fd(int fd, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_FD = 372 // { ssize_t extattr_get_fd(int fd, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_FD = 373 // { int extattr_delete_fd(int fd, int attrnamespace, const char *attrname); }
SYS___SETUGID = 374 // { int __setugid(int flag); }
SYS_EACCESS = 376 // { int eaccess(char *path, int amode); }
SYS_NMOUNT = 378 // { int nmount(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS___MAC_GET_PROC = 384 // { int __mac_get_proc(struct mac *mac_p); }
SYS___MAC_SET_PROC = 385 // { int __mac_set_proc(struct mac *mac_p); }
SYS___MAC_GET_FD = 386 // { int __mac_get_fd(int fd, struct mac *mac_p); }
SYS___MAC_GET_FILE = 387 // { int __mac_get_file(const char *path_p, struct mac *mac_p); }
SYS___MAC_SET_FD = 388 // { int __mac_set_fd(int fd, struct mac *mac_p); }
SYS___MAC_SET_FILE = 389 // { int __mac_set_file(const char *path_p, struct mac *mac_p); }
SYS_KENV = 390 // { int kenv(int what, const char *name, char *value, int len); }
SYS_LCHFLAGS = 391 // { int lchflags(const char *path, u_long flags); }
SYS_UUIDGEN = 392 // { int uuidgen(struct uuid *store, int count); }
SYS_SENDFILE = 393 // { int sendfile(int fd, int s, off_t offset, size_t nbytes, struct sf_hdtr *hdtr, off_t *sbytes, int flags); }
SYS_MAC_SYSCALL = 394 // { int mac_syscall(const char *policy, int call, void *arg); }
SYS_GETFSSTAT = 395 // { int getfsstat(struct statfs *buf, long bufsize, int mode); }
SYS_STATFS = 396 // { int statfs(char *path, struct statfs *buf); }
SYS_FSTATFS = 397 // { int fstatfs(int fd, struct statfs *buf); }
SYS_FHSTATFS = 398 // { int fhstatfs(const struct fhandle *u_fhp, struct statfs *buf); }
SYS_KSEM_CLOSE = 400 // { int ksem_close(semid_t id); }
SYS_KSEM_POST = 401 // { int ksem_post(semid_t id); }
SYS_KSEM_WAIT = 402 // { int ksem_wait(semid_t id); }
SYS_KSEM_TRYWAIT = 403 // { int ksem_trywait(semid_t id); }
SYS_KSEM_INIT = 404 // { int ksem_init(semid_t *idp, unsigned int value); }
SYS_KSEM_OPEN = 405 // { int ksem_open(semid_t *idp, const char *name, int oflag, mode_t mode, unsigned int value); }
SYS_KSEM_UNLINK = 406 // { int ksem_unlink(const char *name); }
SYS_KSEM_GETVALUE = 407 // { int ksem_getvalue(semid_t id, int *val); }
SYS_KSEM_DESTROY = 408 // { int ksem_destroy(semid_t id); }
SYS___MAC_GET_PID = 409 // { int __mac_get_pid(pid_t pid, struct mac *mac_p); }
SYS___MAC_GET_LINK = 410 // { int __mac_get_link(const char *path_p, struct mac *mac_p); }
SYS___MAC_SET_LINK = 411 // { int __mac_set_link(const char *path_p, struct mac *mac_p); }
SYS_EXTATTR_SET_LINK = 412 // { ssize_t extattr_set_link( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_LINK = 413 // { ssize_t extattr_get_link( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_LINK = 414 // { int extattr_delete_link( const char *path, int attrnamespace, const char *attrname); }
SYS___MAC_EXECVE = 415 // { int __mac_execve(char *fname, char **argv, char **envv, struct mac *mac_p); }
SYS_SIGACTION = 416 // { int sigaction(int sig, const struct sigaction *act, struct sigaction *oact); }
SYS_SIGRETURN = 417 // { int sigreturn( const struct __ucontext *sigcntxp); }
SYS_GETCONTEXT = 421 // { int getcontext(struct __ucontext *ucp); }
SYS_SETCONTEXT = 422 // { int setcontext( const struct __ucontext *ucp); }
SYS_SWAPCONTEXT = 423 // { int swapcontext(struct __ucontext *oucp, const struct __ucontext *ucp); }
SYS_SWAPOFF = 424 // { int swapoff(const char *name); }
SYS___ACL_GET_LINK = 425 // { int __acl_get_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_LINK = 426 // { int __acl_set_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_DELETE_LINK = 427 // { int __acl_delete_link(const char *path, acl_type_t type); }
SYS___ACL_ACLCHECK_LINK = 428 // { int __acl_aclcheck_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS_SIGWAIT = 429 // { int sigwait(const sigset_t *set, int *sig); }
SYS_THR_CREATE = 430 // { int thr_create(ucontext_t *ctx, long *id, int flags); }
SYS_THR_EXIT = 431 // { void thr_exit(long *state); }
SYS_THR_SELF = 432 // { int thr_self(long *id); }
SYS_THR_KILL = 433 // { int thr_kill(long id, int sig); }
SYS_JAIL_ATTACH = 436 // { int jail_attach(int jid); }
SYS_EXTATTR_LIST_FD = 437 // { ssize_t extattr_list_fd(int fd, int attrnamespace, void *data, size_t nbytes); }
SYS_EXTATTR_LIST_FILE = 438 // { ssize_t extattr_list_file( const char *path, int attrnamespace, void *data, size_t nbytes); }
SYS_EXTATTR_LIST_LINK = 439 // { ssize_t extattr_list_link( const char *path, int attrnamespace, void *data, size_t nbytes); }
SYS_KSEM_TIMEDWAIT = 441 // { int ksem_timedwait(semid_t id, const struct timespec *abstime); }
SYS_THR_SUSPEND = 442 // { int thr_suspend( const struct timespec *timeout); }
SYS_THR_WAKE = 443 // { int thr_wake(long id); }
SYS_KLDUNLOADF = 444 // { int kldunloadf(int fileid, int flags); }
SYS_AUDIT = 445 // { int audit(const void *record, u_int length); }
SYS_AUDITON = 446 // { int auditon(int cmd, void *data, u_int length); }
SYS_GETAUID = 447 // { int getauid(uid_t *auid); }
SYS_SETAUID = 448 // { int setauid(uid_t *auid); }
SYS_GETAUDIT = 449 // { int getaudit(struct auditinfo *auditinfo); }
SYS_SETAUDIT = 450 // { int setaudit(struct auditinfo *auditinfo); }
SYS_GETAUDIT_ADDR = 451 // { int getaudit_addr( struct auditinfo_addr *auditinfo_addr, u_int length); }
SYS_SETAUDIT_ADDR = 452 // { int setaudit_addr( struct auditinfo_addr *auditinfo_addr, u_int length); }
SYS_AUDITCTL = 453 // { int auditctl(char *path); }
SYS__UMTX_OP = 454 // { int _umtx_op(void *obj, int op, u_long val, void *uaddr1, void *uaddr2); }
SYS_THR_NEW = 455 // { int thr_new(struct thr_param *param, int param_size); }
SYS_SIGQUEUE = 456 // { int sigqueue(pid_t pid, int signum, void *value); }
SYS_KMQ_OPEN = 457 // { int kmq_open(const char *path, int flags, mode_t mode, const struct mq_attr *attr); }
SYS_KMQ_SETATTR = 458 // { int kmq_setattr(int mqd, const struct mq_attr *attr, struct mq_attr *oattr); }
SYS_KMQ_TIMEDRECEIVE = 459 // { int kmq_timedreceive(int mqd, char *msg_ptr, size_t msg_len, unsigned *msg_prio, const struct timespec *abs_timeout); }
SYS_KMQ_TIMEDSEND = 460 // { int kmq_timedsend(int mqd, const char *msg_ptr, size_t msg_len,unsigned msg_prio, const struct timespec *abs_timeout);}
SYS_KMQ_NOTIFY = 461 // { int kmq_notify(int mqd, const struct sigevent *sigev); }
SYS_KMQ_UNLINK = 462 // { int kmq_unlink(const char *path); }
SYS_ABORT2 = 463 // { int abort2(const char *why, int nargs, void **args); }
SYS_THR_SET_NAME = 464 // { int thr_set_name(long id, const char *name); }
SYS_AIO_FSYNC = 465 // { int aio_fsync(int op, struct aiocb *aiocbp); }
SYS_RTPRIO_THREAD = 466 // { int rtprio_thread(int function, lwpid_t lwpid, struct rtprio *rtp); }
SYS_SCTP_PEELOFF = 471 // { int sctp_peeloff(int sd, uint32_t name); }
SYS_SCTP_GENERIC_SENDMSG = 472 // { int sctp_generic_sendmsg(int sd, caddr_t msg, int mlen, caddr_t to, __socklen_t tolen, struct sctp_sndrcvinfo *sinfo, int flags); }
SYS_SCTP_GENERIC_SENDMSG_IOV = 473 // { int sctp_generic_sendmsg_iov(int sd, struct iovec *iov, int iovlen, caddr_t to, __socklen_t tolen, struct sctp_sndrcvinfo *sinfo, int flags); }
SYS_SCTP_GENERIC_RECVMSG = 474 // { int sctp_generic_recvmsg(int sd, struct iovec *iov, int iovlen, struct sockaddr * from, __socklen_t *fromlenaddr, struct sctp_sndrcvinfo *sinfo, int *msg_flags); }
SYS_PREAD = 475 // { ssize_t pread(int fd, void *buf, size_t nbyte, off_t offset); }
SYS_PWRITE = 476 // { ssize_t pwrite(int fd, const void *buf, size_t nbyte, off_t offset); }
SYS_MMAP = 477 // { caddr_t mmap(caddr_t addr, size_t len, int prot, int flags, int fd, off_t pos); }
SYS_LSEEK = 478 // { off_t lseek(int fd, off_t offset, int whence); }
SYS_TRUNCATE = 479 // { int truncate(char *path, off_t length); }
SYS_FTRUNCATE = 480 // { int ftruncate(int fd, off_t length); }
SYS_THR_KILL2 = 481 // { int thr_kill2(pid_t pid, long id, int sig); }
SYS_SHM_OPEN = 482 // { int shm_open(const char *path, int flags, mode_t mode); }
SYS_SHM_UNLINK = 483 // { int shm_unlink(const char *path); }
SYS_CPUSET = 484 // { int cpuset(cpusetid_t *setid); }
SYS_CPUSET_SETID = 485 // { int cpuset_setid(cpuwhich_t which, id_t id, cpusetid_t setid); }
SYS_CPUSET_GETID = 486 // { int cpuset_getid(cpulevel_t level, cpuwhich_t which, id_t id, cpusetid_t *setid); }
SYS_CPUSET_GETAFFINITY = 487 // { int cpuset_getaffinity(cpulevel_t level, cpuwhich_t which, id_t id, size_t cpusetsize, cpuset_t *mask); }
SYS_CPUSET_SETAFFINITY = 488 // { int cpuset_setaffinity(cpulevel_t level, cpuwhich_t which, id_t id, size_t cpusetsize, const cpuset_t *mask); }
SYS_FACCESSAT = 489 // { int faccessat(int fd, char *path, int amode, int flag); }
SYS_FCHMODAT = 490 // { int fchmodat(int fd, char *path, mode_t mode, int flag); }
SYS_FCHOWNAT = 491 // { int fchownat(int fd, char *path, uid_t uid, gid_t gid, int flag); }
SYS_FEXECVE = 492 // { int fexecve(int fd, char **argv, char **envv); }
SYS_FSTATAT = 493 // { int fstatat(int fd, char *path, struct stat *buf, int flag); }
SYS_FUTIMESAT = 494 // { int futimesat(int fd, char *path, struct timeval *times); }
SYS_LINKAT = 495 // { int linkat(int fd1, char *path1, int fd2, char *path2, int flag); }
SYS_MKDIRAT = 496 // { int mkdirat(int fd, char *path, mode_t mode); }
SYS_MKFIFOAT = 497 // { int mkfifoat(int fd, char *path, mode_t mode); }
SYS_MKNODAT = 498 // { int mknodat(int fd, char *path, mode_t mode, dev_t dev); }
SYS_OPENAT = 499 // { int openat(int fd, char *path, int flag, mode_t mode); }
SYS_READLINKAT = 500 // { int readlinkat(int fd, char *path, char *buf, size_t bufsize); }
SYS_RENAMEAT = 501 // { int renameat(int oldfd, char *old, int newfd, char *new); }
SYS_SYMLINKAT = 502 // { int symlinkat(char *path1, int fd, char *path2); }
SYS_UNLINKAT = 503 // { int unlinkat(int fd, char *path, int flag); }
SYS_POSIX_OPENPT = 504 // { int posix_openpt(int flags); }
SYS_GSSD_SYSCALL = 505 // { int gssd_syscall(char *path); }
SYS_JAIL_GET = 506 // { int jail_get(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS_JAIL_SET = 507 // { int jail_set(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS_JAIL_REMOVE = 508 // { int jail_remove(int jid); }
SYS_CLOSEFROM = 509 // { int closefrom(int lowfd); }
SYS___SEMCTL = 510 // { int __semctl(int semid, int semnum, int cmd, union semun *arg); }
SYS_MSGCTL = 511 // { int msgctl(int msqid, int cmd, struct msqid_ds *buf); }
SYS_SHMCTL = 512 // { int shmctl(int shmid, int cmd, struct shmid_ds *buf); }
SYS_LPATHCONF = 513 // { int lpathconf(char *path, int name); }
SYS___CAP_RIGHTS_GET = 515 // { int __cap_rights_get(int version, int fd, cap_rights_t *rightsp); }
SYS_CAP_ENTER = 516 // { int cap_enter(void); }
SYS_CAP_GETMODE = 517 // { int cap_getmode(u_int *modep); }
SYS_PDFORK = 518 // { int pdfork(int *fdp, int flags); }
SYS_PDKILL = 519 // { int pdkill(int fd, int signum); }
SYS_PDGETPID = 520 // { int pdgetpid(int fd, pid_t *pidp); }
SYS_PSELECT = 522 // { int pselect(int nd, fd_set *in, fd_set *ou, fd_set *ex, const struct timespec *ts, const sigset_t *sm); }
SYS_GETLOGINCLASS = 523 // { int getloginclass(char *namebuf, size_t namelen); }
SYS_SETLOGINCLASS = 524 // { int setloginclass(const char *namebuf); }
SYS_RCTL_GET_RACCT = 525 // { int rctl_get_racct(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_GET_RULES = 526 // { int rctl_get_rules(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_GET_LIMITS = 527 // { int rctl_get_limits(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_ADD_RULE = 528 // { int rctl_add_rule(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_REMOVE_RULE = 529 // { int rctl_remove_rule(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_POSIX_FALLOCATE = 530 // { int posix_fallocate(int fd, off_t offset, off_t len); }
SYS_POSIX_FADVISE = 531 // { int posix_fadvise(int fd, off_t offset, off_t len, int advice); }
SYS_WAIT6 = 532 // { int wait6(idtype_t idtype, id_t id, int *status, int options, struct __wrusage *wrusage, siginfo_t *info); }
SYS_CAP_RIGHTS_LIMIT = 533 // { int cap_rights_limit(int fd, cap_rights_t *rightsp); }
SYS_CAP_IOCTLS_LIMIT = 534 // { int cap_ioctls_limit(int fd, const u_long *cmds, size_t ncmds); }
SYS_CAP_IOCTLS_GET = 535 // { ssize_t cap_ioctls_get(int fd, u_long *cmds, size_t maxcmds); }
SYS_CAP_FCNTLS_LIMIT = 536 // { int cap_fcntls_limit(int fd, uint32_t fcntlrights); }
SYS_CAP_FCNTLS_GET = 537 // { int cap_fcntls_get(int fd, uint32_t *fcntlrightsp); }
SYS_BINDAT = 538 // { int bindat(int fd, int s, caddr_t name, int namelen); }
SYS_CONNECTAT = 539 // { int connectat(int fd, int s, caddr_t name, int namelen); }
SYS_CHFLAGSAT = 540 // { int chflagsat(int fd, const char *path, u_long flags, int atflag); }
SYS_ACCEPT4 = 541 // { int accept4(int s, struct sockaddr * __restrict name, __socklen_t * __restrict anamelen, int flags); }
SYS_PIPE2 = 542 // { int pipe2(int *fildes, int flags); }
SYS_AIO_MLOCK = 543 // { int aio_mlock(struct aiocb *aiocbp); }
SYS_PROCCTL = 544 // { int procctl(idtype_t idtype, id_t id, int com, void *data); }
SYS_PPOLL = 545 // { int ppoll(struct pollfd *fds, u_int nfds, const struct timespec *ts, const sigset_t *set); }
SYS_FUTIMENS = 546 // { int futimens(int fd, struct timespec *times); }
SYS_UTIMENSAT = 547 // { int utimensat(int fd, char *path, struct timespec *times, int flag); }
SYS_NUMA_GETAFFINITY = 548 // { int numa_getaffinity(cpuwhich_t which, id_t id, struct vm_domain_policy_entry *policy); }
SYS_NUMA_SETAFFINITY = 549 // { int numa_setaffinity(cpuwhich_t which, id_t id, const struct vm_domain_policy_entry *policy); }
SYS_FDATASYNC = 550 // { int fdatasync(int fd); }
)
|
{
"pile_set_name": "Github"
}
|
Q:
How to make a simple escape the room game?
I want to make a very simple "escape the room" game. I was hoping for something that looks something like this. You would see images of some room and you click around to move or to add things to inventory. Then, you can select something in your inventory to use that item with something on the screen. During the whole game there would be a text box describing what is happening (probably in really broken English instead of Japanese).
I am looking for something that can be quite simple. I would prefer to have the ability to play sound (probably mp3's) when something happens. It can be web-based or a downloaded executable or .jar file. It doesn't have to be perfect, just a proof-of-concept really.
What is the best approach to get this game working with minimal effort? Are there some libraries that can help? I have plenty of Java experience and some C++, PHP, and others. I'd rather avoid Windows-based technology as I primarily run Linux. I am willing to learn other languages if they have a huge advantage.
Ideally, if someone could point me to an example program that I can modify. I'm not expecting to sell or distribute this game.
A:
Personally, I'd recommend sticking to the programming language you know best, and checking out the graphic/audio libraries available to you. If you're familiar with Flash, there is a tutorial on how to make a basic escape the room game. Even if you don't know Flash, that tutorial should help give you an idea as to how such games are constructed.
|
{
"pile_set_name": "StackExchange"
}
|
<map id="Range Plot" name="Range Plot">
<area shape="rect" id="node2" href="$group__plot_animation.html" title="Plot properties that can be animated using Core Animation. " alt="" coords="6,5,58,35"/>
</map>
|
{
"pile_set_name": "Github"
}
|
<!DOCTYPE HTML>
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (14.0.1) on Fri Jul 17 14:15:42 EDT 2020 -->
<title>ImagePullPolicy (weblogic-kubernetes-operator 3.0.0 API)</title>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<meta name="dc.created" content="2020-07-17">
<meta name="description" content="declaration: package: oracle.kubernetes.operator, enum: ImagePullPolicy">
<meta name="generator" content="javadoc/ClassWriterImpl">
<link rel="stylesheet" type="text/css" href="../../../stylesheet.css" title="Style">
<link rel="stylesheet" type="text/css" href="../../../script-dir/jquery-ui.css" title="Style">
<script type="text/javascript" src="../../../script.js"></script>
<script type="text/javascript" src="../../../script-dir/jszip/dist/jszip.min.js"></script>
<script type="text/javascript" src="../../../script-dir/jszip-utils/dist/jszip-utils.min.js"></script>
<!--[if IE]>
<script type="text/javascript" src="../../../script-dir/jszip-utils/dist/jszip-utils-ie.min.js"></script>
<![endif]-->
<script type="text/javascript" src="../../../script-dir/jquery-3.4.1.js"></script>
<script type="text/javascript" src="../../../script-dir/jquery-ui.js"></script>
</head>
<body class="class-declaration">
<script type="text/javascript">var data = {"i0":9,"i1":9};
var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],8:["t4","Concrete Methods"]};
var altColor = "altColor";
var rowColor = "rowColor";
var tableTab = "tableTab";
var activeTableTab = "activeTableTab";
var pathtoroot = "../../../";
loadScripts(document, 'script');</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<div class="flexBox">
<header role="banner" class="flexHeader">
<nav role="navigation">
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a id="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a id="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../index.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/ImagePullPolicy.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../index-all.html">Index</a></li>
<li><a href="../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<div>
<ul class="subNavList">
<li>Summary: </li>
<li><a href="#nested.class.summary">Nested</a> | </li>
<li><a href="#enum.constant.summary">Enum Constants</a> | </li>
<li>Field | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li><a href="#enum.constant.detail">Enum Constants</a> | </li>
<li>Field | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<div class="navListSearch"><label for="search">SEARCH:</label>
<input type="text" id="search" value="search" disabled="disabled">
<input type="reset" id="reset" value="reset" disabled="disabled">
</div>
</div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="skipNav"><a id="skip.navbar.top">
<!-- -->
</a></div>
</nav>
</header>
<div class="flexContent">
<main role="main">
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle"><span class="packageLabelInType">Package</span> <a href="package-summary.html">oracle.kubernetes.operator</a></div>
<h1 title="Enum ImagePullPolicy" class="title">Enum ImagePullPolicy</h1>
</div>
<div class="contentContainer">
<div class="inheritance" title="Inheritance Tree">java.lang.Object
<div class="inheritance">java.lang.Enum<<a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a>>
<div class="inheritance">oracle.kubernetes.operator.ImagePullPolicy</div>
</div>
</div>
<section class="description">
<dl>
<dt>All Implemented Interfaces:</dt>
<dd><code>java.io.Serializable</code>, <code>java.lang.Comparable<<a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a>></code>, <code>java.lang.constant.Constable</code></dd>
</dl>
<hr>
<pre>public enum <span class="typeNameLabel">ImagePullPolicy</span>
extends java.lang.Enum<<a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a>></pre>
</section>
<section class="summary">
<ul class="blockList">
<!-- ======== NESTED CLASS SUMMARY ======== -->
<li class="blockList">
<section class="nestedClassSummary"><a id="nested.class.summary">
<!-- -->
</a>
<h2>Nested Class Summary</h2>
<div class="inheritedList">
<h2>Nested classes/interfaces inherited from class java.lang.Enum</h2>
<a id="nested.classes.inherited.from.class.java.lang.Enum">
<!-- -->
</a><code>java.lang.Enum.EnumDesc<E extends java.lang.Enum<E>></code></div>
</section>
</li>
<!-- =========== ENUM CONSTANT SUMMARY =========== -->
<li class="blockList">
<section class="constantsSummary"><a id="enum.constant.summary">
<!-- -->
</a>
<h2>Enum Constant Summary</h2>
<div class="memberSummary">
<table>
<caption><span>Enum Constants</span><span class="tabEnd"> </span></caption>
<thead>
<tr>
<th class="colFirst" scope="col">Enum Constant</th>
<th class="colLast" scope="col">Description</th>
</tr>
</thead>
<tbody>
<tr class="altColor">
<th class="colFirst" scope="row"><code><span class="memberNameLink"><a href="#Always">Always</a></span></code></th>
<td class="colLast"> </td>
</tr>
<tr class="rowColor">
<th class="colFirst" scope="row"><code><span class="memberNameLink"><a href="#IfNotPresent">IfNotPresent</a></span></code></th>
<td class="colLast"> </td>
</tr>
<tr class="altColor">
<th class="colFirst" scope="row"><code><span class="memberNameLink"><a href="#Never">Never</a></span></code></th>
<td class="colLast"> </td>
</tr>
</tbody>
</table>
</div>
</section>
</li>
<!-- ========== METHOD SUMMARY =========== -->
<li class="blockList">
<section class="methodSummary"><a id="method.summary">
<!-- -->
</a>
<h2>Method Summary</h2>
<div class="memberSummary">
<div role="tablist" aria-orientation="horizontal"><button role="tab" aria-selected="true" aria-controls="memberSummary_tabpanel" tabindex="0" onkeydown="switchTab(event)" id="t0" class="activeTableTab">All Methods</button><button role="tab" aria-selected="false" aria-controls="memberSummary_tabpanel" tabindex="-1" onkeydown="switchTab(event)" id="t1" class="tableTab" onclick="show(1);">Static Methods</button><button role="tab" aria-selected="false" aria-controls="memberSummary_tabpanel" tabindex="-1" onkeydown="switchTab(event)" id="t4" class="tableTab" onclick="show(8);">Concrete Methods</button></div>
<div id="memberSummary_tabpanel" role="tabpanel">
<table aria-labelledby="t0">
<thead>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colSecond" scope="col">Method</th>
<th class="colLast" scope="col">Description</th>
</tr>
</thead>
<tbody>
<tr class="altColor" id="i0">
<td class="colFirst"><code>static <a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a></code></td>
<th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#valueOf(java.lang.String)">valueOf</a></span>​(java.lang.String name)</code></th>
<td class="colLast">
<div class="block">Returns the enum constant of this type with the specified name.</div>
</td>
</tr>
<tr class="rowColor" id="i1">
<td class="colFirst"><code>static <a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a>[]</code></td>
<th class="colSecond" scope="row"><code><span class="memberNameLink"><a href="#values()">values</a></span>()</code></th>
<td class="colLast">
<div class="block">Returns an array containing the constants of this enum type, in
the order they are declared.</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div class="inheritedList">
<h3>Methods inherited from class java.lang.Enum</h3>
<a id="methods.inherited.from.class.java.lang.Enum">
<!-- -->
</a><code>clone, compareTo, describeConstable, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf</code></div>
<div class="inheritedList">
<h3>Methods inherited from class java.lang.Object</h3>
<a id="methods.inherited.from.class.java.lang.Object">
<!-- -->
</a><code>getClass, notify, notifyAll, wait, wait, wait</code></div>
</section>
</li>
</ul>
</section>
<section class="details">
<ul class="blockList">
<!-- ============ ENUM CONSTANT DETAIL =========== -->
<li class="blockList">
<section class="constantDetails"><a id="enum.constant.detail">
<!-- -->
</a>
<h2>Enum Constant Details</h2>
<ul class="blockList">
<li class="blockList">
<section class="detail">
<h3><a id="Always">Always</a></h3>
<div class="memberSignature"><span class="modifiers">public static final</span> <span class="returnType"><a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a></span> <span class="memberName">Always</span></div>
</section>
</li>
<li class="blockList">
<section class="detail">
<h3><a id="Never">Never</a></h3>
<div class="memberSignature"><span class="modifiers">public static final</span> <span class="returnType"><a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a></span> <span class="memberName">Never</span></div>
</section>
</li>
<li class="blockList">
<section class="detail">
<h3><a id="IfNotPresent">IfNotPresent</a></h3>
<div class="memberSignature"><span class="modifiers">public static final</span> <span class="returnType"><a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a></span> <span class="memberName">IfNotPresent</span></div>
</section>
</li>
</ul>
</section>
</li>
<!-- ============ METHOD DETAIL ========== -->
<li class="blockList">
<section class="methodDetails"><a id="method.detail">
<!-- -->
</a>
<h2>Method Details</h2>
<ul class="blockList">
<li class="blockList">
<section class="detail">
<h3><a id="values()">values</a></h3>
<div class="memberSignature"><span class="modifiers">public static</span> <span class="returnType"><a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a>[]</span> <span class="memberName">values</span>()</div>
<div class="block">Returns an array containing the constants of this enum type, in
the order they are declared.</div>
<dl>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>an array containing the constants of this enum type, in the order they are declared</dd>
</dl>
</section>
</li>
<li class="blockList">
<section class="detail">
<h3><a id="valueOf(java.lang.String)">valueOf</a></h3>
<div class="memberSignature"><span class="modifiers">public static</span> <span class="returnType"><a href="ImagePullPolicy.html" title="enum in oracle.kubernetes.operator">ImagePullPolicy</a></span> <span class="memberName">valueOf</span>​(<span class="arguments">java.lang.String name)</span></div>
<div class="block">Returns the enum constant of this type with the specified name.
The string must match <i>exactly</i> an identifier used to declare an
enum constant in this type. (Extraneous whitespace characters are
not permitted.)</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>name</code> - the name of the enum constant to be returned.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>the enum constant with the specified name</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if this enum type has no constant with the specified name</dd>
<dd><code>java.lang.NullPointerException</code> - if the argument is null</dd>
</dl>
</section>
</li>
</ul>
</section>
</li>
</ul>
</section>
</div>
<!-- ========= END OF CLASS DATA ========= -->
</main>
<footer role="contentinfo">
<nav role="navigation">
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a id="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a id="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../index.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/ImagePullPolicy.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../index-all.html">Index</a></li>
<li><a href="../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<div>
<ul class="subNavList">
<li>Summary: </li>
<li><a href="#nested.class.summary">Nested</a> | </li>
<li><a href="#enum.constant.summary">Enum Constants</a> | </li>
<li>Field | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li><a href="#enum.constant.detail">Enum Constants</a> | </li>
<li>Field | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
</div>
<a id="skip.navbar.bottom">
<!-- -->
</a>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</nav>
<p class="legalCopy"><small>Copyright © 2017–2020. All rights reserved.</small></p>
</footer>
</div>
</div>
</body>
</html>
|
{
"pile_set_name": "Github"
}
|
2) effectively anonymous in the context of a google search (or similar search) due to the overwhelming number of high-ranking results produced by something/someone else with the same name.
(1) "To be ungoogleable is to have never existed" or (2) to have a very, very common name, like my baby sister: searching on her name yields “Results 1 - 10 of about 5,180.” even if she was there, it’d take me half of forever to find her. - Elaine Nelson
No longer a legal word because Google has abandoned their earlier policy of "Don't Be Evil".
"Late last year, the Swedish Language Council published a report of words that had entered the Swedish lexicon in 2012. Among them was ogooglebar – ungoogleable, in English. This did not please Google."
|
{
"pile_set_name": "Pile-CC"
}
|
Am Nichole from France and i wouldn't have believed that i would someday
share my survival from cancer with anyone because cancer almost ended my
life.
I bless that faithful day i went online in search of help and i found my
helper Dr. George who helped me via his email to defeat cancer that had
almost sucked life out of me with his cannabis oil which was as effective
as he said it was.
I will also like to use this medium to appreciate Dr.George
contacthospital_eastern.george@yahoo.com for his care, support and of
course his cannabis oil because i would have been history if not for you My
greatest hero Dr. George.
My name is Mrs. Kerry Daniel from Florida, It is with pleasure that i thank Dr. Morris for saving my dying husband with his cannabis oil.
We already lost hope for a better life when the report came that my husband cannot go for more Chemo anymore. But after so many research online, I gained a lot about the cannabis oil that i bought from the Dr. Morris whose contact I got online on reading a testimony about his past works and glory, The medication was delivered to me within 24 hours by the UPS delivery service after procurement. My husband has completed his treatment, unquenchable joy to all as my husband is cured of his stage 4 lungs cancer within 90 days of treatment. Thanks to all, today i acknowledge the greatness of cannabis oil and to those that wish to purchase the medication contact:healthcareservice01@gmail.com for help.
Cannabis Oil is the a medication for cancerous disease.
Kerry Daniel.
Historical Use: Hemp is the most universally useful plant we have at our disposal. The history of mankind's use of hemp can be traced way back in time to between about 5000 - 7000 BC. Remains of seed husks have been found at...
Although I’ve been aware of the recent discussion of cannabis oil as a treatment for various serious diseases, I was still skeptical to consider it a viable solution for certain health disorders. After all, so many people these days are looking for a miracle pill to solve their health issues! Is this another way of buying into one-size-fits-all treatments without making necessary lifestyle changes? It was time I found out more. By Contributing Writer Raluca Schachter
“After nine months of taking two different forms of cannabis oil, one, a cannabis capsule infused with organic coconut oil around 10:30am and high THC oil about an hour before bed, dad was given the life changing report, no...
Paediatric cannabis therapy is saving children. Awareness is the most important thing at this moment. This young lady is finishing up her last bit of required chemotherapy (because she is a child, her parents had no choice) treatment, so take a moment to send her your love and healing vibes, and then read away. You […]
If you're reading HIGH TIMES you are probably aware of all the ways ingesting marijuana can improve your life, so maybe just file this one away for a future argument with a spouse/boss/family member/lawmaker.
It's a big year ahead in Colorado, Washington state, Uruguay, and for me here in Mississippi. As of today, Wednesday January 1st, retail stores and licensed pot growers commence legalized business transactions.
Sharing your scoops to your social media accounts is a must to distribute your curated content. Not only will it drive traffic and leads through your content, but it will help show your expertise with your followers.
Integrating your curated content to your website or blog will allow you to increase your website visitors’ engagement, boost SEO and acquire new visitors. By redirecting your social media traffic to your website, Scoop.it will also help you generate more qualified traffic and leads from your curation work.
Distributing your curated content through a newsletter is a great way to nurture and engage your email subscribers will developing your traffic and visibility.
Creating engaging newsletters with your curated content is really easy.
|
{
"pile_set_name": "Pile-CC"
}
|
Our Favorite New Fall Collection, Really!
0
Hyperventilation is never sexy. And, yes, at the first sight of this label's price-tags, you might have trouble actually breathing. You know we're all about the mix of high and low over here, so here's the high. The very, very high. Enter KAUFMANFRANCO's fall collection, 76 (!!!) looks that might break the bank, but justifiably so. If you haven't heard of this super-luxe brand, here's a quick rundown: The collaboration, between designers Ken Kaufman and Isaac Franco, was launched in fall 2004, after the boys worked together at Valentino, helped take Ungaro to the U.S, and served as Anne Klein's co-creative directors. Going solo resulted in a line that's been consistently sexy, but always sophisticated, with top-notch fabrics, exquisite cuts, and subtle detailing—dare we say a worthy successor to Rick Owens with a dash of Jil Sander and Ralph Lauren thrown in for good measure. Hate to be gushy, but among their offerings for autumn, we don't think there's one piece we wouldn't wear—picture body-hugging black leather jackets, floor-dusting camel wrap-coats, Met Ball-worthy gowns, shimmering mini-dresses, and do-me pants that will turn every dude's head. It's breathtaking, smoldering…basically you'll hyperventilate even if it's in your budget.
|
{
"pile_set_name": "Pile-CC"
}
|
Democratic Presidential candidate Bernie Sanders is coming to Binghamton. Broome County officials have confirmed he will be at the Maines Veterans Memorial Arena on Monday, however details are still being worked out.
Local Binghamton for Bernie Campaign Coordinator Jennifer Campoli says doors are expected to open at 9am with Sanders speaking sometime around 11am or noon.
"I think it's a perfect venue," said Mary Clark, Executive Director for Citizen Action NY.
"A lot of politicians just ride along the freeway and it just shows that Bernie is a different person who comes and sees us here in the Southern Tier."
Monday's trip won't be Sanders' first visit to Binghamton. In 1990 he spoke at Binghamton University after his tenure as mayor of Burlington, Vermont. In addition to speaking on campus he taught a seminar called Affluence and Crisis in Norwich.
Deputy Binghamton Mayor Jared Kraham says Binghamton Police are coordinating with Secret Service & NYS Police on security measures.
Specific traffic and parking information will be announced.
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
JavaFX Scene Builder: Creating a new scene or just making changes on a specific element?
I'm completely new to JavaFX and Scene Builder.
My program is designed as below picture, with 4 Buttons on the right and a TabPane on the left. The problem is I don't know how to design the TabPane for each button on the right. For example, if user click on Button 1, it shows 2 tabs Option 1 - A and Option 1 - B. If clicking on Button 2, it shows Option 2 - A and Option 2 - B and so on.
How can I achieve this? It it possible to add 4 TabPane designs in 1 scene (switch between them by show hide elements like working with html and javascript) or I need to make 4 copies of the first scene and change the TabPane for each of them?
A:
Sample app: This app has a mainview that consist of an anchorpane and two buttons. This app also has two other views. When the top button is pressed in the mainview, it loads viewOne into mainview's anchorpane. When the bottom button is pressed in the mainview, it loads viewTwo into mainview's anchorpane.
Main
import javafx.application.Application;
import javafx.fxml.FXMLLoader;
import javafx.scene.Parent;
import javafx.scene.Scene;
import javafx.stage.Stage;
/**
*
* @author blj0011
*/
public class JavaFXApplication63 extends Application
{
@Override
public void start(Stage stage) throws Exception
{
Parent root = FXMLLoader.load(getClass().getResource("FXMLDocument.fxml"));
Scene scene = new Scene(root);
stage.setScene(scene);
stage.show();
}
/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
launch(args);
}
}
BaseView Controller
import java.io.IOException;
import java.net.URL;
import java.util.ResourceBundle;
import java.util.logging.Level;
import java.util.logging.Logger;
import javafx.event.ActionEvent;
import javafx.fxml.FXML;
import javafx.fxml.FXMLLoader;
import javafx.fxml.Initializable;
import javafx.scene.control.Button;
import javafx.scene.layout.AnchorPane;
import javafx.scene.layout.Pane;
/**
*
* @author blj0011
*/
public class FXMLDocumentController implements Initializable
{
@FXML AnchorPane apMain;
@FXML
private void handleButtonAction(ActionEvent event)
{
try
{
Pane newLoadedPane;
Button tempButton = (Button)event.getSource();
switch(tempButton.getId())
{
case "btnOne":
newLoadedPane = FXMLLoader.load(getClass().getResource("viewOne.fxml"));
apMain.getChildren().add(newLoadedPane);
break;
case "btnTwo":
newLoadedPane = FXMLLoader.load(getClass().getResource("viewTwo.fxml"));
apMain.getChildren().add(newLoadedPane);
break;
}
}
catch (IOException ex) {
Logger.getLogger(FXMLDocumentController.class.getName()).log(Level.SEVERE, null, ex);
}
}
@Override
public void initialize(URL url, ResourceBundle rb)
{
// TODO
}
}
Baseview FXML
<?xml version="1.0" encoding="UTF-8"?>
<?import javafx.scene.control.Button?>
<?import javafx.scene.layout.AnchorPane?>
<AnchorPane id="AnchorPane" prefHeight="200" prefWidth="320" xmlns="http://javafx.com/javafx/8.0.111" xmlns:fx="http://javafx.com/fxml/1" fx:controller="javafxapplication63.FXMLDocumentController">
<children>
<Button fx:id="btnOne" layoutX="241.0" layoutY="24.0" onAction="#handleButtonAction" text="Click Me!" />
<Button fx:id="btnTwo" layoutX="241.0" layoutY="56.0" onAction="#handleButtonAction" text="Click Me!" />
<AnchorPane fx:id="apMain" maxHeight="200.0" maxWidth="200.0" minHeight="200.0" minWidth="200.0" prefHeight="200.0" prefWidth="200.0" AnchorPane.bottomAnchor="0.0" AnchorPane.leftAnchor="0.0" AnchorPane.rightAnchor="120.0" AnchorPane.topAnchor="0.0" />
</children>
</AnchorPane>
ViewOne Controller
import java.net.URL;
import java.util.ResourceBundle;
import javafx.fxml.Initializable;
/**
* FXML Controller class
*
* @author blj0011
*/
public class ViewOneController implements Initializable
{
/**
* Initializes the controller class.
*/
@Override
public void initialize(URL url, ResourceBundle rb)
{
// TODO
}
}
ViewOne FXML
<?xml version="1.0" encoding="UTF-8"?>
<?import javafx.scene.control.Tab?>
<?import javafx.scene.control.TabPane?>
<?import javafx.scene.layout.AnchorPane?>
<AnchorPane fx:id="apOption2" maxHeight="200.0" maxWidth="200.0" minHeight="200.0" minWidth="200.0" prefHeight="200.0" prefWidth="200.0" xmlns="http://javafx.com/javafx/8.0.111" xmlns:fx="http://javafx.com/fxml/1" fx:controller="javafxapplication63.ViewOneController">
<children>
<TabPane layoutX="125.0" layoutY="83.0" prefHeight="200.0" prefWidth="200.0" tabClosingPolicy="UNAVAILABLE" AnchorPane.bottomAnchor="0.0" AnchorPane.leftAnchor="0.0" AnchorPane.rightAnchor="0.0" AnchorPane.topAnchor="0.0">
<tabs>
<Tab text="1 - A">
<content>
<AnchorPane minHeight="0.0" minWidth="0.0" prefHeight="180.0" prefWidth="200.0" />
</content>
</Tab>
<Tab text="1 - B">
<content>
<AnchorPane minHeight="0.0" minWidth="0.0" prefHeight="180.0" prefWidth="200.0" />
</content>
</Tab>
</tabs>
</TabPane>
</children>
</AnchorPane>
ViewTwo Controller
import java.net.URL;
import java.util.ResourceBundle;
import javafx.fxml.Initializable;
/**
* FXML Controller class
*
* @author blj0011
*/
public class ViewTwoController implements Initializable
{
/**
* Initializes the controller class.
*/
@Override
public void initialize(URL url, ResourceBundle rb)
{
// TODO
}
}
ViewTwo FXML
<?xml version="1.0" encoding="UTF-8"?>
<?import javafx.scene.control.Tab?>
<?import javafx.scene.control.TabPane?>
<?import javafx.scene.layout.AnchorPane?>
<AnchorPane fx:id="apOption2" maxHeight="200.0" maxWidth="200.0" minHeight="200.0" minWidth="200.0" prefHeight="200.0" prefWidth="200.0" xmlns="http://javafx.com/javafx/8.0.111" xmlns:fx="http://javafx.com/fxml/1" fx:controller="javafxapplication63.ViewTwoController">
<children>
<TabPane layoutX="24.0" layoutY="-14.0" prefHeight="200.0" prefWidth="200.0" tabClosingPolicy="UNAVAILABLE" AnchorPane.bottomAnchor="0.0" AnchorPane.leftAnchor="0.0" AnchorPane.rightAnchor="0.0" AnchorPane.topAnchor="0.0">
<tabs>
<Tab text="2 - A">
<content>
<AnchorPane minHeight="0.0" minWidth="0.0" prefHeight="180.0" prefWidth="200.0" />
</content>
</Tab>
<Tab text="2 - B">
<content>
<AnchorPane minHeight="0.0" minWidth="0.0" prefHeight="180.0" prefWidth="200.0" />
</content>
</Tab>
</tabs>
</TabPane>
</children>
</AnchorPane>
In this app, no initial view is loaded into the main anchorpane when the app starts. You might want to load a view as soon as the app starts.
|
{
"pile_set_name": "StackExchange"
}
|
Author
Topic: how to website localization (Read 1213 times)
I show you how I work for the translation:1. I select the view of only english article , on the upper menu I go where is write "Show all Languages" and select "English"
After that if you go on all pages you could add translation from each one:
You have the sign plus (+) on the flag language choosed to add the translation starting from an existing page.
If you want to modify an existing translation you have the pencil icon.
If you want to view only translation in <your language> you need to select on top menu only <your language>.
PAGE TRANSLATIONIn the page list you could see even the three page the populate the text below the three image in front page :Join, HowTo, Power of GroupFor the front pages( Join, HowTo, Power of Group) we need to add Excerpt text that is the text that you see on the front page.To complete the "Front Page" there is another page to translate with the text "Ready to switch to GNU/Linux PowerPC notebooks".To complete the "Front Page" is needed even to translate the subtitle "To make this happen a new PowerPC Notebook will be Produced soon.", you need to provide to the administrator of the website this string translated.
In wordpress there is at the top right a tab called "Screen Options" if click on the label it open down checkbox that you could click , and you must check on "Excerpt" checkbox.
POST TRANSLATIONAbout the translations of the posts you must go to POSTS, and is needed to go the top tab "Screen Options" and deselect "SEO,SEO Title,Meta Desc, Focus KW" so you will see as for the pages the flags and the symbol "+" to add the translation.
Is a good practice to translate categories you need to go to posts->categories and select the "english" languages, then as for the pages and posts;you have the sign plus (+) on the flag language choosed to add the translation starting from an existing page.If you want to modify an existing translation you have the pencil icon.If you want to view only translation in <your language> you need to select on top menu only <your language>.
|
{
"pile_set_name": "Pile-CC"
}
|
Wir stellen unsere Artikel und Faktenchecks kostenlos für alle zur Verfügung.
Hilf uns dabei, dass das so bleiben kann.
130
Verjährt der erste cumex-Fall?
Es ist der größte Steuerraub der europäischen Geschichte: Banken haben in den letzten Jahren mindestens 55,2 Milliarden Euro Steuergelder durch Steuertricks gestohlen. Allein 32 Milliarden Euro vom deutschen Staat. Doch das scheint nicht so hohe Priorität zu haben: Wie Insider berichten, sind zu wenig Ermittler auf die Fälle angesetzt, weswegen die ersten Fälle des Diebstahls jetzt zu verjähren drohen, bevor es zu Anklagen kommen konnte (Quelle).
Währenddessen wird anscheinend absurderweise vor allem gegen die Journalisten von Correctiv ermittelt, die den Diebstahl erst aufgedeckt haben (Quelle). Die Absurdität der Meldung hat so einige zu empörten Kommentaren und hilfreichen Vergleichen verleitet. Auch uns. Wir haben die treffendsten Tweets zum Thema gesammelt.
1.)
2.)
3.)
4.)
5.)
6.)
7.)
8.)
9.)
10.)
Artikelbild: twitter.com
|
{
"pile_set_name": "OpenWebText2"
}
|
/**
* MaNGOS is a full featured server for World of Warcraft, supporting
* the following clients: 1.12.x, 2.4.3, 3.3.5a, 4.3.4a and 5.4.8
*
* Copyright (C) 2005-2020 MaNGOS <https://getmangos.eu>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* World of Warcraft, and all World of Warcraft or Warcraft art, images,
* and lore are copyrighted by Blizzard Entertainment, Inc.
*/
#include "HomeMovementGenerator.h"
#include "Creature.h"
#include "CreatureAI.h"
#include "ObjectMgr.h"
#include "WorldPacket.h"
#include "movement/MoveSplineInit.h"
#include "movement/MoveSpline.h"
void HomeMovementGenerator<Creature>::Initialize(Creature& owner)
{
_setTargetLocation(owner);
}
void HomeMovementGenerator<Creature>::Reset(Creature&)
{
}
void HomeMovementGenerator<Creature>::_setTargetLocation(Creature& owner)
{
if (owner.hasUnitState(UNIT_STAT_NOT_MOVE))
{
return;
}
Movement::MoveSplineInit init(owner);
float x, y, z, o;
// at apply we can select more nice return points base at current movegen
if (owner.GetMotionMaster()->empty() || !owner.GetMotionMaster()->top()->GetResetPosition(owner, x, y, z, o))
{
owner.GetRespawnCoord(x, y, z, &o);
}
init.SetFacing(o);
init.MoveTo(x, y, z, true);
init.SetWalk(false);
init.Launch();
arrived = false;
owner.clearUnitState(UNIT_STAT_ALL_DYN_STATES);
}
bool HomeMovementGenerator<Creature>::Update(Creature& owner, const uint32& /*time_diff*/)
{
arrived = owner.movespline->Finalized();
return !arrived;
}
void HomeMovementGenerator<Creature>::Finalize(Creature& owner)
{
if (arrived)
{
if (owner.GetTemporaryFactionFlags() & TEMPFACTION_RESTORE_REACH_HOME)
{
owner.ClearTemporaryFaction();
}
owner.SetWalk(!owner.hasUnitState(UNIT_STAT_RUNNING_STATE) && !owner.IsLevitating(), false);
owner.LoadCreatureAddon(true);
owner.AI()->JustReachedHome();
}
}
|
{
"pile_set_name": "Github"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.