text
stringlengths 1
20.5k
| meta
dict | score
float64 0
1.66k
| span_scores
list |
|---|---|---|---|
Just like You (Keb' Mo' album)
Just Like You is the third studio album by Delta blues artist Keb' Mo', released in 1996. It features guest artists Jackson Browne and Bonnie Raitt, both on the title track "Just Like You". Unlike the first album, Just Like You features a more blues-pop to blues-rock feel and more of its tracks feature a full band. In 1997, Just Like You won the Grammy Award for Best Contemporary Blues Album.
Track listing
All songs written by Kevin Moore (Keb' Mo') unless otherwise noted.
"That's Not Love" - 4:08 (Georgina Graper, Kevin Moore)
"Perpetual Blues Machine" - 3:16 (Georgina Graper, Kevin Moore)
"More Than One Way Home" - 4:53 (John Lewis Parker, Kevin Moore)
"I'm on Your Side" - 3:40
"Just Like You" - 3:26 (John Lewis Parker, Kevin Moore)
"You Can Love Yourself" - 2:33
"Dangerous Mood" - 4:59 (Candy Parton, Kevin Moore)
"The Action" - 3:59
"Hand It Over" - 2:55
"Standin' at the Station" - 3:13 (Phil Ramocon, Kevin Moore)
"Momma, Where's My Daddy?" - 3:07 (Lori Barth, Kevin Moore)
"Last Fair Deal Gone Down" - 3:47 (Robert Johnson)
"Lullaby Baby Blues" - 2:36 (Georgina Graper, Kevin Moore)
Personnel
Keb' Mo' - vocals, guitar, harmonica
James "Hutch" Hutchinson - bass guitar
Tommy Eyre - keyboards; 11-string guitar on "Momma, Where's My Daddy"
Laval Belle, Ricky Fataar - drums
Munyungo Jackson - percussion
Jackie Farris, Jean McClain - backing vocals
John Porter - dobro on "Last Fair Deal Gone Down"
Larry David - harmonica on "Last Fair Deal Gone Down"
Darrell Leonard - trumpet on "Last Fair Deal Gone Down"
Jim Price - trombone on "Last Fair Deal Gone Down"
Jim Gordon - clarinet on "Last Fair Deal Gone Down"
References
Category:1996 albums
Category:Keb' Mo' albums
Category:albums produced by John Porter (musician)
Category:Epic Records albums
Category:Grammy Award for Best Contemporary Blues Album
|
{
"pile_set_name": "Wikipedia (en)"
}
| 120 |
[
{
"begin": 0,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 18,
"score": 1
},
{
"begin": 18,
"end": 20,
"score": 0
},
{
"begin": 20,
"end": 22,
"score": 1
},
{
"begin": 22,
"end": 75,
"score": 0
},
{
"begin": 75,
"end": 80,
"score": 1
},
{
"begin": 80,
"end": 94,
"score": 0
},
{
"begin": 94,
"end": 97,
"score": 1
},
{
"begin": 97,
"end": 99,
"score": 0
},
{
"begin": 99,
"end": 101,
"score": 1
},
{
"begin": 101,
"end": 148,
"score": 0
},
{
"begin": 148,
"end": 155,
"score": 1
},
{
"begin": 155,
"end": 156,
"score": 0
},
{
"begin": 156,
"end": 162,
"score": 1
},
{
"begin": 162,
"end": 167,
"score": 0
},
{
"begin": 167,
"end": 173,
"score": 1
},
{
"begin": 173,
"end": 174,
"score": 0
},
{
"begin": 174,
"end": 179,
"score": 1
},
{
"begin": 179,
"end": 380,
"score": 0
},
{
"begin": 380,
"end": 386,
"score": 1
},
{
"begin": 386,
"end": 387,
"score": 0
},
{
"begin": 387,
"end": 392,
"score": 1
},
{
"begin": 392,
"end": 402,
"score": 0
},
{
"begin": 402,
"end": 414,
"score": 1
},
{
"begin": 414,
"end": 415,
"score": 0
},
{
"begin": 415,
"end": 420,
"score": 1
},
{
"begin": 420,
"end": 429,
"score": 0
},
{
"begin": 429,
"end": 434,
"score": 1
},
{
"begin": 434,
"end": 464,
"score": 0
},
{
"begin": 464,
"end": 469,
"score": 1
},
{
"begin": 469,
"end": 470,
"score": 0
},
{
"begin": 470,
"end": 475,
"score": 1
},
{
"begin": 475,
"end": 477,
"score": 0
},
{
"begin": 477,
"end": 480,
"score": 1
},
{
"begin": 480,
"end": 482,
"score": 0
},
{
"begin": 482,
"end": 484,
"score": 1
},
{
"begin": 484,
"end": 523,
"score": 0
},
{
"begin": 523,
"end": 527,
"score": 1
},
{
"begin": 527,
"end": 537,
"score": 0
},
{
"begin": 537,
"end": 545,
"score": 1
},
{
"begin": 545,
"end": 546,
"score": 0
},
{
"begin": 546,
"end": 552,
"score": 1
},
{
"begin": 552,
"end": 554,
"score": 0
},
{
"begin": 554,
"end": 559,
"score": 1
},
{
"begin": 559,
"end": 560,
"score": 0
},
{
"begin": 560,
"end": 565,
"score": 1
},
{
"begin": 565,
"end": 578,
"score": 0
},
{
"begin": 578,
"end": 583,
"score": 1
},
{
"begin": 583,
"end": 584,
"score": 0
},
{
"begin": 584,
"end": 591,
"score": 1
},
{
"begin": 591,
"end": 601,
"score": 0
},
{
"begin": 601,
"end": 609,
"score": 1
},
{
"begin": 609,
"end": 610,
"score": 0
},
{
"begin": 610,
"end": 616,
"score": 1
},
{
"begin": 616,
"end": 618,
"score": 0
},
{
"begin": 618,
"end": 623,
"score": 1
},
{
"begin": 623,
"end": 624,
"score": 0
},
{
"begin": 624,
"end": 629,
"score": 1
},
{
"begin": 629,
"end": 650,
"score": 0
},
{
"begin": 650,
"end": 654,
"score": 1
},
{
"begin": 654,
"end": 664,
"score": 0
},
{
"begin": 664,
"end": 668,
"score": 1
},
{
"begin": 668,
"end": 669,
"score": 0
},
{
"begin": 669,
"end": 674,
"score": 1
},
{
"begin": 674,
"end": 675,
"score": 0
},
{
"begin": 675,
"end": 681,
"score": 1
},
{
"begin": 681,
"end": 683,
"score": 0
},
{
"begin": 683,
"end": 688,
"score": 1
},
{
"begin": 688,
"end": 689,
"score": 0
},
{
"begin": 689,
"end": 694,
"score": 1
},
{
"begin": 694,
"end": 709,
"score": 0
},
{
"begin": 709,
"end": 713,
"score": 1
},
{
"begin": 713,
"end": 746,
"score": 0
},
{
"begin": 746,
"end": 750,
"score": 1
},
{
"begin": 750,
"end": 751,
"score": 0
},
{
"begin": 751,
"end": 756,
"score": 1
},
{
"begin": 756,
"end": 757,
"score": 0
},
{
"begin": 757,
"end": 763,
"score": 1
},
{
"begin": 763,
"end": 765,
"score": 0
},
{
"begin": 765,
"end": 770,
"score": 1
},
{
"begin": 770,
"end": 771,
"score": 0
},
{
"begin": 771,
"end": 776,
"score": 1
},
{
"begin": 776,
"end": 787,
"score": 0
},
{
"begin": 787,
"end": 791,
"score": 1
},
{
"begin": 791,
"end": 792,
"score": 0
},
{
"begin": 792,
"end": 800,
"score": 1
},
{
"begin": 800,
"end": 820,
"score": 0
},
{
"begin": 820,
"end": 824,
"score": 1
},
{
"begin": 824,
"end": 840,
"score": 0
},
{
"begin": 840,
"end": 846,
"score": 1
},
{
"begin": 846,
"end": 848,
"score": 0
},
{
"begin": 848,
"end": 853,
"score": 1
},
{
"begin": 853,
"end": 854,
"score": 0
},
{
"begin": 854,
"end": 859,
"score": 1
},
{
"begin": 859,
"end": 866,
"score": 0
},
{
"begin": 866,
"end": 872,
"score": 1
},
{
"begin": 872,
"end": 904,
"score": 0
},
{
"begin": 904,
"end": 911,
"score": 1
},
{
"begin": 911,
"end": 920,
"score": 0
},
{
"begin": 920,
"end": 927,
"score": 1
},
{
"begin": 927,
"end": 937,
"score": 0
},
{
"begin": 937,
"end": 941,
"score": 1
},
{
"begin": 941,
"end": 942,
"score": 0
},
{
"begin": 942,
"end": 949,
"score": 1
},
{
"begin": 949,
"end": 951,
"score": 0
},
{
"begin": 951,
"end": 956,
"score": 1
},
{
"begin": 956,
"end": 957,
"score": 0
},
{
"begin": 957,
"end": 962,
"score": 1
},
{
"begin": 962,
"end": 965,
"score": 0
},
{
"begin": 965,
"end": 970,
"score": 1
},
{
"begin": 970,
"end": 983,
"score": 0
},
{
"begin": 983,
"end": 988,
"score": 1
},
{
"begin": 988,
"end": 999,
"score": 0
},
{
"begin": 999,
"end": 1003,
"score": 1
},
{
"begin": 1003,
"end": 1004,
"score": 0
},
{
"begin": 1004,
"end": 1009,
"score": 1
},
{
"begin": 1009,
"end": 1011,
"score": 0
},
{
"begin": 1011,
"end": 1016,
"score": 1
},
{
"begin": 1016,
"end": 1017,
"score": 0
},
{
"begin": 1017,
"end": 1022,
"score": 1
},
{
"begin": 1022,
"end": 1030,
"score": 0
}
] |
Q:
Running classifiers with cuts on the input arrays (python)
I wonder if it is possible to run a classifier (e.g. RandomForestClassifier, GradientBoostingClassifier) with the call accepting cuts on the input data.
To make the question more clear, let's say that we want to run
gbcl = GradientBoostingClassifier(n_estimators=100,
learning_rate=1.0,
max_depth=5,
random_state=1).fit(X_train, y_train)
but use only the events for which X_train[:,3] > 0.
Is there a way to do this other than creating new input arrays?
A:
In the context of scikit-learn you have to either create a new data like X_train_new = X_train[X_train[:,3] > 0], y_train_new = y_train[X_train[:,3] > 0] or, if you want to avoid "filling the code with stray arrays", pass the sliced data directly to the fit method:
model.fit(X_train[X_train[:, 3] > 0], y_train[X_train[:, 3] > 0])
or
b = (X_train[:, 3] > 0)
model.fit(X_train[b], y_train[b])
|
{
"pile_set_name": "StackExchange"
}
| 0 |
[
{
"begin": 0,
"end": 1024,
"score": 0
}
] |
Category: Interactive
In an effort to get more people to wait for the red light at pedestrian crossings, car manufacturer Smart redesigned the experience as part of their promotional safety campaign WhatAreYouFOR. A really fantastic concept, it uses a nearby booth and cameras to translate the dance moves of members of the public into the red traffic light man in real time. Its a really fun and engaging idea that seems to have achieved its purpose of making the public take notice and wait, as it resulted in 81% more people stopping at the crossing.
Crowdsourcing has become an often used tactic by companies recently, especially by Walkers with their many ‘do us a flavour’ competitions. The latest to jump on this bandwagon though is none other than McDonald’s, who have recently launched a ‘Build Your Own Burger’ campaign to come up with new flavours for their menu. Their UK stores have teamed up with digital agency Razorfish London to create a ‘Burger Builder’ that allows you design your dream burger from a list of ingredients that contain both standard ones such as cheese and bacon, as well as new ones like guacamole and pineapple. Five winning designs will be released for a week each over a five-week period similar to the McDonald’s Tastes of America campaign.
The competition has proved incredibly successful so far, with well over 52,000 unique designs currently submitted. However, a look through the ‘most popular’ tab shows that it may not have had the desired effect, as many of them are just gluten-free versions of burgers already on the McDonald’s menu. There are though a few really interesting sounding ones, such as (and I’m definitely not being biased here) my Sweet ‘N’ Smokey burger.
Crowdsourcing in this way is definitely popular and is a really nice way to get customers involved even more closely with the iconic McDonald’s brand. Its created a really interesting look at what other people consider their dream burger to be, as you can definitely create some odd combinations with flavours like brie slices, guacamole and pesto mayonnaise. I’m interested to see what the final five are.
Everyone knows that Coca-Cola are great at producing innovative, exciting advertising campaigns. I’ve talked about them several times on this blog, here, here and here, about their various different “share happiness” campaigns. This one however was definitely one that made me think “I wish I’d thought of that” and also made me wonder why they hadn’t created it sooner as it seems to me to be the obvious thing to do based on the slogan.
Ogilvy & Mather Singapore came up with the simple idea of having the can itself as the thing being shared. A simple twist and pull splits it in half, allowing you to share the product with a friend and the above video shows just how popular it was. It even features a nice little nod to Jonathan Mak’s Coca-Cola advert at the end.
Not wanting to be outdone on the creative advertising front, Pepsi created their own campaign with the help of Belgian advertising company TBWA.
Simply liking the Pepsi Facebook page gives you a free Pepsi in a way similar to the previous Coca-Cola campaigns that gave you free stuff for doing things. It’s perhaps too similar I feel, as although it’s using something innovative that Coca-Cola hasn’t used before in Facebook likes, the whole principle behind the idea is just the same. But that’s just my opinion.
So I found this the other day when I should have been finishing off work for the deadline I had on Friday, and it shows just how far website design has come since the mid 90’s. Space Jam was one of my favourite films when I was growing up and I’m a bit of a sucker for good web design at the moment after designing one for the past few weeks for a project of mine.
Retro design and a complete inconsistency across the pages make this website so bad its good! Who doesn’t want bright, colourful, slightly illegible text on a starry background with all manner of clickable objects and menus? Viewing it brought back some great memories of watching the film and I had great fun viewing all the pages and taking part in a trivia quiz I found by clicking on a randomly placed button. Is it too late to nominate this for best website of 1996?
So they’ve done it again. Obviously not content with the fantastic interactive advertising of theirs that I have looked at before, Coca-Cola has really pushed the levels of interaction between the public and vending machine in these two new campaigns.
The first is from Korea where they seem to have taken a leaf out of Fantastic Delites book by getting the public to work for their free Coke. Korea seems to have a lot of professional break-dancers and hand-shakers by the looks of it.
If you’re anything like me, you might have been watching the Olympics over the past few days and been left confused by the rules of some of the events and competitions. Well that’s no longer a problem thanks to this beautifully designed app from Wilson Fletcher which features some great illustrations by Ryan Todd.
Katie Buchanan, a Wilson Fletcher designer, came up with the idea last year at Wimbledon after hearing a member of the crowd ask a friend how many times the ball could bounce!
This fantastic advertising campaign from Australian company “Fantastic Delites” shares similarities with that of the Coca-Cola advertising campaigns which I looked at a few months ago as it involves a machine dispensing free items. The main difference with this one though is that members of the public had to work for their prize.
Tasks from pressing a button a huge number of times, to doing crazy dances resulted in a free pack of snacks for the participant. This creates a great element of interaction between the public and the campaign due to the large crowds which showed up to see people potentially embarrass themselves in public.
|
{
"pile_set_name": "Pile-CC"
}
| 54 |
[
{
"begin": 0,
"end": 10,
"score": 0
},
{
"begin": 10,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 123,
"score": 0
},
{
"begin": 123,
"end": 128,
"score": 1
},
{
"begin": 128,
"end": 556,
"score": 0
},
{
"begin": 556,
"end": 569,
"score": 1
},
{
"begin": 569,
"end": 639,
"score": 0
},
{
"begin": 639,
"end": 646,
"score": 1
},
{
"begin": 646,
"end": 758,
"score": 0
},
{
"begin": 758,
"end": 766,
"score": 1
},
{
"begin": 766,
"end": 815,
"score": 0
},
{
"begin": 815,
"end": 821,
"score": 1
},
{
"begin": 821,
"end": 883,
"score": 0
},
{
"begin": 883,
"end": 885,
"score": 1
},
{
"begin": 885,
"end": 928,
"score": 0
},
{
"begin": 928,
"end": 937,
"score": 1
},
{
"begin": 937,
"end": 938,
"score": 0
},
{
"begin": 938,
"end": 944,
"score": 1
},
{
"begin": 944,
"end": 958,
"score": 0
},
{
"begin": 958,
"end": 964,
"score": 1
},
{
"begin": 964,
"end": 965,
"score": 0
},
{
"begin": 965,
"end": 972,
"score": 1
},
{
"begin": 972,
"end": 1243,
"score": 0
},
{
"begin": 1243,
"end": 1251,
"score": 1
},
{
"begin": 1251,
"end": 1254,
"score": 0
},
{
"begin": 1254,
"end": 1260,
"score": 1
},
{
"begin": 1260,
"end": 1264,
"score": 0
},
{
"begin": 1264,
"end": 1271,
"score": 1
},
{
"begin": 1271,
"end": 1568,
"score": 0
},
{
"begin": 1568,
"end": 1576,
"score": 1
},
{
"begin": 1576,
"end": 1696,
"score": 0
},
{
"begin": 1696,
"end": 1701,
"score": 1
},
{
"begin": 1701,
"end": 1706,
"score": 0
},
{
"begin": 1706,
"end": 1712,
"score": 1
},
{
"begin": 1712,
"end": 1722,
"score": 0
},
{
"begin": 1722,
"end": 1735,
"score": 1
},
{
"begin": 1735,
"end": 1855,
"score": 0
},
{
"begin": 1855,
"end": 1863,
"score": 1
},
{
"begin": 1863,
"end": 2150,
"score": 0
},
{
"begin": 2150,
"end": 2159,
"score": 1
},
{
"begin": 2159,
"end": 2570,
"score": 0
},
{
"begin": 2570,
"end": 2576,
"score": 1
},
{
"begin": 2576,
"end": 2579,
"score": 0
},
{
"begin": 2579,
"end": 2585,
"score": 1
},
{
"begin": 2585,
"end": 2586,
"score": 0
},
{
"begin": 2586,
"end": 2595,
"score": 1
},
{
"begin": 2595,
"end": 2857,
"score": 0
},
{
"begin": 2857,
"end": 2865,
"score": 1
},
{
"begin": 2865,
"end": 2866,
"score": 0
},
{
"begin": 2866,
"end": 2869,
"score": 1
},
{
"begin": 2869,
"end": 2872,
"score": 0
},
{
"begin": 2872,
"end": 2881,
"score": 1
},
{
"begin": 2881,
"end": 2963,
"score": 0
},
{
"begin": 2963,
"end": 2968,
"score": 1
},
{
"begin": 2968,
"end": 3041,
"score": 0
}
] |
/*app scroll*/
.app-scroll::-webkit-scrollbar-thumb,
.app-scroll-thin::-webkit-scrollbar-thumb{
background:#323232;
}
.app-scroll-thin::-webkit-scrollbar{
background: #2c2c2c;
}
.app-scroll::-webkit-scrollbar:hover,
.app-scroll-thin::-webkit-scrollbar:hover{
background: #2c2c2c;
}
.messenger{
background: #272727;
}
.messenger-search{
background: #323232;
color: #fff;
}
.messenger-listView{
background: #272727;
border: 1px solid #323232;
}
.messenger-listView-tabs{
border-bottom: 1px solid #323232;
}
.messenger-listView-tabs a:hover,
.messenger-listView-tabs a:focus{
background-color: #323232;
}
.messenger-favorites div.avatar{
border: 2px solid #272727;
}
.messenger-list-item:hover{
background: #323232;
}
.messenger-messagingView {
border-top: 1px solid #323232;
border-bottom: 1px solid #323232;
background: #272727;
}
.m-header-messaging {
background: #323232;
}
.messenger-infoView {
background: #272727;
border: 1px solid #323232;
}
.messenger-infoView>p{
color: #fff;
}
.divider{
border-top: 1px solid #2f2f2f;
}
.messenger-sendCard{
background: #323232;
border-top: 1px solid #272727;
}
.attachment-preview>p{
color: #fff;
}
.m-send{
color: #fff;
}
.message-card p{
background: #323232;
color: #fff;
}
.m-li-divider{
border-bottom: 1px solid #323232;
}
.m-header a,
.m-header a:hover,
.m-header a:focus{
text-decoration: none;
color: #fff;
}
.messenger-list-item td p{
color: #fff;
}
.activeStatus{
border: 2px solid #272727;
}
.messenger-list-item:hover .activeStatus{
border-color: #323232;
}
.messenger-favorites>div p{
color: #ffffff;
}
/*
***********************************************
* Placeholder loading
***********************************************
*/
.loadingPlaceholder-body div,
.loadingPlaceholder-header tr td div {
background: #323232;
background-image: -webkit-linear-gradient(left, #323232 0%, #323232 20%, #323232 40%, #323232 100%);
}
/*
***********************************************
* App Modal
***********************************************
*/
.app-modal-card{
background: rgba(50, 50, 50, 0.94);
}
.app-modal-header{
color: #fff;
}
.app-modal-body{
color: #fff;
}
|
{
"pile_set_name": "Github"
}
| 3 |
[
{
"begin": 0,
"end": 1713,
"score": 0
},
{
"begin": 1713,
"end": 1724,
"score": 1
},
{
"begin": 1724,
"end": 2036,
"score": 0
},
{
"begin": 2036,
"end": 2039,
"score": 1
}
] |
Two Vancouver radio stations have apologized and taken a show off the air until the new year after its host made a controversial comment that touched off a storm on social media on Tuesday.
During the show, CFOX host Jeff O'Neil proposed that CKNW guest host Chris Gailus ask federal Liberal Leader Justin Trudeau a question — which many found offensive and misogynistic — during an upcoming interview.
O'Neil suggested that Gailus ask Trudeau whom he would "F, kill or marry," among Laureen Harper (the prime minister's wife), Health Minister Rona Ambrose or former governor general Michaëlle Jean.
Gailus, the regular evening news host on Global Television, was criticized on social media for appearing to go along with the joke.
He and sports host Squire Barnes, who was also on the show, later issued statements on Twitter, with Gailus saying he was "caught completely off guard by an offensive and disrespectful segment....It was not funny and it was #NOTokay."
Stations apologize
Both CKNW and Global Television have since issued an apology for the incident, and The Jeff O'Neil Show has been temporally taken off the air by CFOX.
The show will return to the air on an undisclosed date in the new year, according to a statement issued by CKNW. Both CKNW and CFOX are owned by Corus Entertainment.
“This morning on CKNW there was some very inappropriate comments and suggestions made that were offensive to many of our listeners. I would like to apologize for that and assure that those comments will not be repeated on this radio station," said Ian Koenigsfest, brand manager of CKNW.
"I would also like to apologize to Chris Gailus and Squire Barnes, who are hosting the CKNW Morning Show this week, for being put in an awkward situation from which they were unaware, and assure them that such a situation will not occur again.”
CFOX also issued an apology.
"We recognize now that the segment we did with the CKNW morning show and Global personalities was in tremendously poor taste to not only women, but all members of our community," said a statement on the CFOX website.
Online comments light up Twitter
|
{
"pile_set_name": "OpenWebText2"
}
| 49 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 13,
"score": 1
},
{
"begin": 13,
"end": 181,
"score": 0
},
{
"begin": 181,
"end": 188,
"score": 1
},
{
"begin": 188,
"end": 218,
"score": 0
},
{
"begin": 218,
"end": 222,
"score": 1
},
{
"begin": 222,
"end": 223,
"score": 0
},
{
"begin": 223,
"end": 224,
"score": 1
},
{
"begin": 224,
"end": 225,
"score": 0
},
{
"begin": 225,
"end": 229,
"score": 1
},
{
"begin": 229,
"end": 260,
"score": 0
},
{
"begin": 260,
"end": 265,
"score": 1
},
{
"begin": 265,
"end": 266,
"score": 0
},
{
"begin": 266,
"end": 272,
"score": 1
},
{
"begin": 272,
"end": 285,
"score": 0
},
{
"begin": 285,
"end": 292,
"score": 1
},
{
"begin": 292,
"end": 293,
"score": 0
},
{
"begin": 293,
"end": 299,
"score": 1
},
{
"begin": 299,
"end": 300,
"score": 0
},
{
"begin": 300,
"end": 306,
"score": 1
},
{
"begin": 306,
"end": 307,
"score": 0
},
{
"begin": 307,
"end": 314,
"score": 1
},
{
"begin": 314,
"end": 405,
"score": 0
},
{
"begin": 405,
"end": 406,
"score": 1
},
{
"begin": 406,
"end": 407,
"score": 0
},
{
"begin": 407,
"end": 411,
"score": 1
},
{
"begin": 411,
"end": 427,
"score": 0
},
{
"begin": 427,
"end": 433,
"score": 1
},
{
"begin": 433,
"end": 438,
"score": 0
},
{
"begin": 438,
"end": 445,
"score": 1
},
{
"begin": 445,
"end": 486,
"score": 0
},
{
"begin": 486,
"end": 493,
"score": 1
},
{
"begin": 493,
"end": 494,
"score": 0
},
{
"begin": 494,
"end": 500,
"score": 1
},
{
"begin": 500,
"end": 530,
"score": 0
},
{
"begin": 530,
"end": 536,
"score": 1
},
{
"begin": 536,
"end": 537,
"score": 0
},
{
"begin": 537,
"end": 545,
"score": 1
},
{
"begin": 545,
"end": 546,
"score": 0
},
{
"begin": 546,
"end": 550,
"score": 1
},
{
"begin": 550,
"end": 551,
"score": 0
},
{
"begin": 551,
"end": 558,
"score": 1
},
{
"begin": 558,
"end": 586,
"score": 0
},
{
"begin": 586,
"end": 595,
"score": 1
},
{
"begin": 595,
"end": 596,
"score": 0
},
{
"begin": 596,
"end": 600,
"score": 1
},
{
"begin": 600,
"end": 603,
"score": 0
},
{
"begin": 603,
"end": 609,
"score": 1
},
{
"begin": 609,
"end": 644,
"score": 0
},
{
"begin": 644,
"end": 650,
"score": 1
}
] |
City of Dragons
City of Dragons is a fantasy novel by American writer Robin Hobb, the third book in The Rain Wilds Chronicles. It was released in September 2011 and is a direct continuation of the previous novel: Dragon Haven.
Plot summary
Characters
Alise Kincarron Finbok – one of the main protagonists, a self-taught scholar of dragons.
Thymara – one of the main protagonists, keeper to Sintara.
Sintara – one of the main protagonists, a blue dragon (Thymara's dragon).
Captain Leftrin – one of the main protagonists, Captain of the barge Tarman.
Sedric – one of the main protagonists, secretary to Hest Finbok, he is assigned to accompany Alise Finbok on her journey. Keeper of Relpda.
Tats – keeper of the dragon Fente, childhood friend of Thymara and a former slave.
Sylve – keeper of the dragon Mercor.
Rapskal – keeper of the dragon Heeby.
Minor Characters
Carson Lupskip – a hunter and an old friend of Leftrin's.
Davvie – a hunter (bowman) and nephew to Carson.
Ranculos – a scarlet, male dragon.
Sestican – an azure, male dragon, kept by Warken.
Mercor – a golden dragon, tended by Sylve. Implied to have previously been the sea serpent Maulkin.
Heeby – a small red dragon queen, tended by Rapskal.
Greft – eldest of the keepers, keeper to Kalo.
Jerd – keeper of the dragon Veras.
Fente – a green dragon queen with a nasty temperament, tended by Tats.
Veras – a dragon, tended by Jerd.
Arbuc – Alum's dragon.
Kalo – a blue-black male dragon, the largest of their clan, tended by Greft.
Spit – an unclaimed, stunted silver dragon with a wounded tail.
Relpda – a sickly copper dragon queen, tended by Sedric.
Kase – a dragon keeper, cousin to Boxter.
Boxter – a dragon keeper, cousin to Kase.
Alum – a dragon keeper to Arbuc.
Nortel – a dragon keeper; one of Greft's closest supporters.
Harrikin – a dragon keeper, foster brother to Lecter. He is the second oldest keeper at 20 years.
Lecter – a dragon keeper, foster brother to Harrikin.
Skelly – Deckhand on Tarman and niece of Leftrin.
Big Eider – Deckhand on Tarman.
Hennesey – Mate on Tarman.
Hest Finbok – Husband of Alise Finbok, a rich and important Bingtown trader.
Swarge – Tillerman of the barge Tarman.
Bellin – Wife to Swarge, a poleman on Tarman.
Tarman – A liveship river barge made from wizardwood.
References
Category:2012 American novels
Category:Fantasy novels
Category:Novels by Robin Hobb
Category:HarperCollins books
Category:Dragons in popular culture
|
{
"pile_set_name": "Wikipedia (en)"
}
| 108 |
[
{
"begin": 0,
"end": 4,
"score": 1
},
{
"begin": 4,
"end": 8,
"score": 0
},
{
"begin": 8,
"end": 15,
"score": 1
},
{
"begin": 15,
"end": 17,
"score": 0
},
{
"begin": 17,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 32,
"score": 1
},
{
"begin": 32,
"end": 55,
"score": 0
},
{
"begin": 55,
"end": 63,
"score": 1
},
{
"begin": 63,
"end": 71,
"score": 0
},
{
"begin": 71,
"end": 76,
"score": 1
},
{
"begin": 76,
"end": 77,
"score": 0
},
{
"begin": 77,
"end": 81,
"score": 1
},
{
"begin": 81,
"end": 105,
"score": 0
},
{
"begin": 105,
"end": 109,
"score": 1
},
{
"begin": 109,
"end": 110,
"score": 0
},
{
"begin": 110,
"end": 115,
"score": 1
},
{
"begin": 115,
"end": 116,
"score": 0
},
{
"begin": 116,
"end": 126,
"score": 1
},
{
"begin": 126,
"end": 147,
"score": 0
},
{
"begin": 147,
"end": 156,
"score": 1
},
{
"begin": 156,
"end": 214,
"score": 0
},
{
"begin": 214,
"end": 220,
"score": 1
},
{
"begin": 220,
"end": 221,
"score": 0
},
{
"begin": 221,
"end": 226,
"score": 1
},
{
"begin": 226,
"end": 255,
"score": 0
},
{
"begin": 255,
"end": 260,
"score": 1
},
{
"begin": 260,
"end": 261,
"score": 0
},
{
"begin": 261,
"end": 270,
"score": 1
},
{
"begin": 270,
"end": 271,
"score": 0
},
{
"begin": 271,
"end": 277,
"score": 1
},
{
"begin": 277,
"end": 344,
"score": 0
},
{
"begin": 344,
"end": 351,
"score": 1
},
{
"begin": 351,
"end": 394,
"score": 0
},
{
"begin": 394,
"end": 401,
"score": 1
},
{
"begin": 401,
"end": 403,
"score": 0
},
{
"begin": 403,
"end": 410,
"score": 1
},
{
"begin": 410,
"end": 458,
"score": 0
},
{
"begin": 458,
"end": 465,
"score": 1
},
{
"begin": 465,
"end": 477,
"score": 0
},
{
"begin": 477,
"end": 484,
"score": 1
},
{
"begin": 484,
"end": 485,
"score": 0
},
{
"begin": 485,
"end": 492,
"score": 1
},
{
"begin": 492,
"end": 526,
"score": 0
},
{
"begin": 526,
"end": 533,
"score": 1
},
{
"begin": 533,
"end": 547,
"score": 0
},
{
"begin": 547,
"end": 553,
"score": 1
},
{
"begin": 553,
"end": 555,
"score": 0
},
{
"begin": 555,
"end": 561,
"score": 1
},
{
"begin": 561,
"end": 608,
"score": 0
},
{
"begin": 608,
"end": 612,
"score": 1
},
{
"begin": 612,
"end": 613,
"score": 0
},
{
"begin": 613,
"end": 619,
"score": 1
},
{
"begin": 619,
"end": 649,
"score": 0
},
{
"begin": 649,
"end": 654,
"score": 1
},
{
"begin": 654,
"end": 655,
"score": 0
},
{
"begin": 655,
"end": 661,
"score": 1
},
{
"begin": 661,
"end": 689,
"score": 0
},
{
"begin": 689,
"end": 695,
"score": 1
},
{
"begin": 695,
"end": 697,
"score": 0
},
{
"begin": 697,
"end": 701,
"score": 1
},
{
"begin": 701,
"end": 725,
"score": 0
},
{
"begin": 725,
"end": 730,
"score": 1
},
{
"begin": 730,
"end": 752,
"score": 0
},
{
"begin": 752,
"end": 759,
"score": 1
},
{
"begin": 759,
"end": 780,
"score": 0
},
{
"begin": 780,
"end": 785,
"score": 1
},
{
"begin": 785,
"end": 809,
"score": 0
},
{
"begin": 809,
"end": 815,
"score": 1
},
{
"begin": 815,
"end": 817,
"score": 0
},
{
"begin": 817,
"end": 824,
"score": 1
},
{
"begin": 824,
"end": 848,
"score": 0
},
{
"begin": 848,
"end": 853,
"score": 1
},
{
"begin": 853,
"end": 856,
"score": 0
},
{
"begin": 856,
"end": 861,
"score": 1
},
{
"begin": 861,
"end": 873,
"score": 0
},
{
"begin": 873,
"end": 879,
"score": 1
},
{
"begin": 879,
"end": 880,
"score": 0
},
{
"begin": 880,
"end": 887,
"score": 1
},
{
"begin": 887,
"end": 922,
"score": 0
},
{
"begin": 922,
"end": 929,
"score": 1
},
{
"begin": 929,
"end": 933,
"score": 0
},
{
"begin": 933,
"end": 939,
"score": 1
},
{
"begin": 939,
"end": 976,
"score": 0
},
{
"begin": 976,
"end": 982,
"score": 1
},
{
"begin": 982,
"end": 984,
"score": 0
},
{
"begin": 984,
"end": 992,
"score": 1
},
{
"begin": 992,
"end": 1021,
"score": 0
},
{
"begin": 1021,
"end": 1029,
"score": 1
},
{
"begin": 1029,
"end": 1066,
"score": 0
},
{
"begin": 1066,
"end": 1072,
"score": 1
},
{
"begin": 1072,
"end": 1074,
"score": 0
},
{
"begin": 1074,
"end": 1080,
"score": 1
},
{
"begin": 1080,
"end": 1112,
"score": 0
},
{
"begin": 1112,
"end": 1117,
"score": 1
},
{
"begin": 1117,
"end": 1167,
"score": 0
},
{
"begin": 1167,
"end": 1174,
"score": 1
},
{
"begin": 1174,
"end": 1176,
"score": 0
},
{
"begin": 1176,
"end": 1181,
"score": 1
},
{
"begin": 1181,
"end": 1220,
"score": 0
},
{
"begin": 1220,
"end": 1227,
"score": 1
},
{
"begin": 1227,
"end": 1229,
"score": 0
},
{
"begin": 1229,
"end": 1234,
"score": 1
},
{
"begin": 1234,
"end": 1271,
"score": 0
},
{
"begin": 1271,
"end": 1275,
"score": 1
},
{
"begin": 1275,
"end": 1277,
"score": 0
},
{
"begin": 1277,
"end": 1281,
"score": 1
},
{
"begin": 1281,
"end": 1305,
"score": 0
},
{
"begin": 1305,
"end": 1310,
"score": 1
}
] |
A Mount Carmel Cemetery visitor called police on Sunday morning to say the gravestones of three of his relatives had been toppled, police said in a statement. Officers found about 100 others knocked down. The incident apparently took place after dark on Saturday, police said.
ABC television affiliate WPVI said the damage was widespread and footage showed rows of headstones knocked down.
"I'm hoping it was maybe just some drunk kids. But the fact that there's so many, it leads one to think it could have been targeted," cemetery visitor Andrew Mallin, who had come to see his father's grave, told the station.
Vandalised tombstones at Mount Caramel CemeteryCredit:
AFP
The Anti-Defamation League, a watchdog group that monitors hate groups, is offering a $10,000 reward in the case, supported by the Mizel Family Foundation, police said.
The apparent vandalism came about a week after about 170 headstones were damaged at a Jewish cemetery in St Louis. Jewish community centers across the United States have also reported a surge in bomb threats, but all were hoaxes.
Muslim Americans have helped raise about $131,000 to repair the St. Louis cemetery, far exceeding organisers' $20,000 goal, according to their LaunchGood website.
Mr Trump delivered his first public condemnation of anti-Semitic incidents on Tuesday. The threats are "horrible and are painful and a very sad reminder of the work that still must be done to root out hate and prejudice and evil," he said.
The Anne Frank Center calls Trump's comments today "a Band-Aid on the cancer of Anti-Semitism that has infected his own Administration" pic.twitter.com/N29s6AXvv8
Some Jewish organizations have criticised his approach. The Anne Frank Centre for Mutual Respect in New York called his comments "a Band-Aid on the cancer of anti-Semitism that has infected his own administration."
Jewish groups had also criticized the White House for omitting any mention of Jews in its statement marking Holocaust Memorial Day last month.
|
{
"pile_set_name": "Pile-CC"
}
| 48 |
[
{
"begin": 0,
"end": 2,
"score": 0
},
{
"begin": 2,
"end": 7,
"score": 1
},
{
"begin": 7,
"end": 8,
"score": 0
},
{
"begin": 8,
"end": 14,
"score": 1
},
{
"begin": 14,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 23,
"score": 1
},
{
"begin": 23,
"end": 49,
"score": 0
},
{
"begin": 49,
"end": 55,
"score": 1
},
{
"begin": 55,
"end": 254,
"score": 0
},
{
"begin": 254,
"end": 262,
"score": 1
},
{
"begin": 262,
"end": 278,
"score": 0
},
{
"begin": 278,
"end": 281,
"score": 1
},
{
"begin": 281,
"end": 543,
"score": 0
},
{
"begin": 543,
"end": 549,
"score": 1
},
{
"begin": 549,
"end": 550,
"score": 0
},
{
"begin": 550,
"end": 556,
"score": 1
},
{
"begin": 556,
"end": 617,
"score": 0
},
{
"begin": 617,
"end": 627,
"score": 1
},
{
"begin": 627,
"end": 642,
"score": 0
},
{
"begin": 642,
"end": 647,
"score": 1
},
{
"begin": 647,
"end": 648,
"score": 0
},
{
"begin": 648,
"end": 655,
"score": 1
},
{
"begin": 655,
"end": 672,
"score": 0
},
{
"begin": 672,
"end": 675,
"score": 1
},
{
"begin": 675,
"end": 681,
"score": 0
},
{
"begin": 681,
"end": 696,
"score": 1
},
{
"begin": 696,
"end": 697,
"score": 0
},
{
"begin": 697,
"end": 703,
"score": 1
},
{
"begin": 703,
"end": 808,
"score": 0
},
{
"begin": 808,
"end": 813,
"score": 1
},
{
"begin": 813,
"end": 814,
"score": 0
},
{
"begin": 814,
"end": 820,
"score": 1
},
{
"begin": 820,
"end": 821,
"score": 0
},
{
"begin": 821,
"end": 831,
"score": 1
},
{
"begin": 831,
"end": 952,
"score": 0
},
{
"begin": 952,
"end": 954,
"score": 1
},
{
"begin": 954,
"end": 955,
"score": 0
},
{
"begin": 955,
"end": 960,
"score": 1
},
{
"begin": 960,
"end": 998,
"score": 0
},
{
"begin": 998,
"end": 1004,
"score": 1
},
{
"begin": 1004,
"end": 1005,
"score": 0
},
{
"begin": 1005,
"end": 1011,
"score": 1
},
{
"begin": 1011,
"end": 1078,
"score": 0
},
{
"begin": 1078,
"end": 1084,
"score": 1
},
{
"begin": 1084,
"end": 1085,
"score": 0
},
{
"begin": 1085,
"end": 1094,
"score": 1
},
{
"begin": 1094,
"end": 1142,
"score": 0
},
{
"begin": 1142,
"end": 1144,
"score": 1
},
{
"begin": 1144,
"end": 1146,
"score": 0
}
] |
{
"name": "lru-cache",
"description": "A cache object that deletes the least-recently-used items.",
"version": "2.3.1",
"author": {
"name": "Isaac Z. Schlueter",
"email": "[email protected]"
},
"scripts": {
"test": "tap test --gc"
},
"main": "lib/lru-cache.js",
"repository": {
"type": "git",
"url": "git://github.com/isaacs/node-lru-cache.git"
},
"devDependencies": {
"tap": "",
"weak": ""
},
"license": {
"type": "MIT",
"url": "http://github.com/isaacs/node-lru-cache/raw/master/LICENSE"
},
"contributors": [
{
"name": "Isaac Z. Schlueter",
"email": "[email protected]"
},
{
"name": "Carlos Brito Lage",
"email": "[email protected]"
},
{
"name": "Marko Mikulicic",
"email": "[email protected]"
},
{
"name": "Trent Mick",
"email": "[email protected]"
},
{
"name": "Kevin O'Hara",
"email": "[email protected]"
},
{
"name": "Marco Rogers",
"email": "[email protected]"
},
{
"name": "Jesse Dailey",
"email": "[email protected]"
}
],
"readme": "# lru cache\n\nA cache object that deletes the least-recently-used items.\n\n## Usage:\n\n```javascript\nvar LRU = require(\"lru-cache\")\n , options = { max: 500\n , length: function (n) { return n * 2 }\n , dispose: function (key, n) { n.close() }\n , maxAge: 1000 * 60 * 60 }\n , cache = LRU(options)\n , otherCache = LRU(50) // sets just the max size\n\ncache.set(\"key\", \"value\")\ncache.get(\"key\") // \"value\"\n\ncache.reset() // empty the cache\n```\n\nIf you put more stuff in it, then items will fall out.\n\nIf you try to put an oversized thing in it, then it'll fall out right\naway.\n\n## Options\n\n* `max` The maximum size of the cache, checked by applying the length\n function to all values in the cache. Not setting this is kind of\n silly, since that's the whole purpose of this lib, but it defaults\n to `Infinity`.\n* `maxAge` Maximum age in ms. Items are not pro-actively pruned out\n as they age, but if you try to get an item that is too old, it'll\n drop it and return undefined instead of giving it to you.\n* `length` Function that is used to calculate the length of stored\n items. If you're storing strings or buffers, then you probably want\n to do something like `function(n){return n.length}`. The default is\n `function(n){return 1}`, which is fine if you want to store `n`\n like-sized things.\n* `dispose` Function that is called on items when they are dropped\n from the cache. This can be handy if you want to close file\n descriptors or do other cleanup tasks when items are no longer\n accessible. Called with `key, value`. It's called *before*\n actually removing the item from the internal cache, so if you want\n to immediately put it back in, you'll have to do that in a\n `nextTick` or `setTimeout` callback or it won't do anything.\n* `stale` By default, if you set a `maxAge`, it'll only actually pull\n stale items out of the cache when you `get(key)`. (That is, it's\n not pre-emptively doing a `setTimeout` or anything.) If you set\n `stale:true`, it'll return the stale value before deleting it. If\n you don't set this, then it'll return `undefined` when you try to\n get a stale entry, as if it had already been deleted.\n\n## API\n\n* `set(key, value)`\n* `get(key) => value`\n\n Both of these will update the \"recently used\"-ness of the key.\n They do what you think.\n\n* `peek(key)`\n\n Returns the key value (or `undefined` if not found) without\n updating the \"recently used\"-ness of the key.\n\n (If you find yourself using this a lot, you *might* be using the\n wrong sort of data structure, but there are some use cases where\n it's handy.)\n\n* `del(key)`\n\n Deletes a key out of the cache.\n\n* `reset()`\n\n Clear the cache entirely, throwing away all values.\n\n* `has(key)`\n\n Check if a key is in the cache, without updating the recent-ness\n or deleting it for being stale.\n\n* `forEach(function(value,key,cache), [thisp])`\n\n Just like `Array.prototype.forEach`. Iterates over all the keys\n in the cache, in order of recent-ness. (Ie, more recently used\n items are iterated over first.)\n\n* `keys()`\n\n Return an array of the keys in the cache.\n\n* `values()`\n\n Return an array of the values in the cache.\n",
"readmeFilename": "README.md",
"bugs": {
"url": "https://github.com/isaacs/node-lru-cache/issues"
},
"_id": "[email protected]",
"_from": "lru-cache@2"
}
|
{
"pile_set_name": "Github"
}
| 37 |
[
{
"begin": 0,
"end": 153,
"score": 0
},
{
"begin": 153,
"end": 158,
"score": 1
},
{
"begin": 158,
"end": 162,
"score": 0
},
{
"begin": 162,
"end": 171,
"score": 1
},
{
"begin": 171,
"end": 188,
"score": 0
},
{
"begin": 188,
"end": 196,
"score": 1
},
{
"begin": 196,
"end": 465,
"score": 0
},
{
"begin": 465,
"end": 468,
"score": 1
},
{
"begin": 468,
"end": 483,
"score": 0
},
{
"begin": 483,
"end": 541,
"score": 1
},
{
"begin": 541,
"end": 589,
"score": 0
},
{
"begin": 589,
"end": 594,
"score": 1
},
{
"begin": 594,
"end": 598,
"score": 0
},
{
"begin": 598,
"end": 607,
"score": 1
},
{
"begin": 607,
"end": 626,
"score": 0
},
{
"begin": 626,
"end": 634,
"score": 1
},
{
"begin": 634,
"end": 664,
"score": 0
},
{
"begin": 664,
"end": 670,
"score": 1
},
{
"begin": 670,
"end": 671,
"score": 0
},
{
"begin": 671,
"end": 676,
"score": 1
},
{
"begin": 676,
"end": 677,
"score": 0
},
{
"begin": 677,
"end": 681,
"score": 1
},
{
"begin": 681,
"end": 700,
"score": 0
},
{
"begin": 700,
"end": 721,
"score": 1
},
{
"begin": 721,
"end": 751,
"score": 0
},
{
"begin": 751,
"end": 756,
"score": 1
},
{
"begin": 756,
"end": 757,
"score": 0
},
{
"begin": 757,
"end": 766,
"score": 1
},
{
"begin": 766,
"end": 785,
"score": 0
},
{
"begin": 785,
"end": 812,
"score": 1
},
{
"begin": 812,
"end": 842,
"score": 0
},
{
"begin": 842,
"end": 847,
"score": 1
},
{
"begin": 847,
"end": 848,
"score": 0
},
{
"begin": 848,
"end": 852,
"score": 1
},
{
"begin": 852,
"end": 871,
"score": 0
},
{
"begin": 871,
"end": 887,
"score": 1
},
{
"begin": 887,
"end": 917,
"score": 0
},
{
"begin": 917,
"end": 922,
"score": 1
}
] |
Conventionally, a technology disclosed, for example, in WO 2008/081861 has been proposed as a technology for a titanium-based or non-titanium based member having antibacterial activity in an implant.
WO 2008/081861 discloses an antibacterial member coated with titanate, including a substrate, a layer of a nanosheet, nanotube, nanofiber or nanocrystal made of a crystalline alkali titanate formed on the substrate, and a silver titanate layer in which a portion or all of an alkali component of the alkali titanate is substituted with silver ions.
WO 2008/081861 also discloses, as a method for producing the antibacterial member, the method comprising the steps of (i) subjecting a titanium-based substrate to a hydrothermal treatment in an aqueous alkali solution at a temperature of 110 to 180° C., (ii) heat-treating the product after subjecting to the hydrothermal treatment at 200 to 700° C., and (iii) washing and drying the product after subjecting to the heat treatment, and immersing the product in an aqueous silver ion-containing solution.
Since the antibacterial member disclosed in WO 2008/081861 includes the silver titanate layer, high antibacterial activity is obtained. However, there was a problem in that when this antibacterial member is used in an implant, titanate or silver titanate makes contacted with living tissues, resulting in poor compatibility between the implant and living tissues.
In the silver titanate layer of the antibacterial member, since a portion or all of the alkali component of the alkali titanate is substituted with silver ions, the degree of elution of silver ions varies drastically depending on a usage state of an implantation site, as described in Example 10. Therefore, this antibacterial member may not exhibit antibacterial activity when silver ions are not eluted, or exhibit toxicity when silver ions are excessively eluted. Also, there may arise a problem that antibacterial activity cannot be maintained over a long period because the degree of elution of silver ions is unstable.
|
{
"pile_set_name": "USPTO Backgrounds"
}
| 0 |
[
{
"begin": 0,
"end": 2041,
"score": 0
}
] |
Some rights may be subject to ratfucking
Not that anyone should be the least bit surprised, but the Trump administration took yet another step this week toward its well-thought-out policy goal of Reversing Anything Barack Obama Ever Did. This time, the Department of Justice reversed its position regarding an Ohio voting rights case the Supreme Court will hear in its upcoming term. Obama's DOJ had been on the side of plaintiffs who say Ohio's method of purging voter rolls is illegal. In Ohio, if you don't vote within six years of your last participation in an election, you can be stricken from the voter rolls since you've obviously died or moved. Now, the 1993 National Voter Registration Act (the "motor voter" law) includes a rule against striking names from voter rolls because of inactivity, but the Trump DOJ now thinks cleaning up voter rolls is just peachy, because too many people voting is obviously bad for America.
How many people were affected by Ohio's voter purges? More than a few -- a temporary order by an appeals court last fall restored voting rights to over 800,000 people who'd been purged since 2015. That's a lot of people disenfranchised for the sole offense of failing to vote in two consecutive federal elections. The rule was enforced vigorously -- but unevenly -- by Ohio Secretary of State Jon Husted, who has made a career of suppressing votes; in 2012, he refused to comply with a court order demanding Ohio restore early voting hours that had been cut, since he feared voters would be "confused" by having more opportunities to exercise their franchise.
Husted, who's now running for governor, insists that frequent purges of the voter rolls are the only way to prevent the epidemic of voting fraud that already doesn't exist. It's purely a happy coincidence that Republicans are pretty sure regularly clearing out infrequent voters is believed to get rid of more Democrats, especially youngs and browns, who may be less fanatical about getting out to vote every two years. As the Washington Post notes in an editorial,
As the demographic challenges to Republican electoral prospects mount, they have redoubled attempts to retain power where they hold it not by broadening their appeal but by shrinking the electorate.
The Ohio process of weeding out "invalid" voters mostly depends on people paying scrupulous attention to their mail: If people skip elections for just two years, the state mails out notices to the voters warning they'll be deleted from the rolls in another four years unless they vote in an election or contact their local election office. That's a pretty neat trick! Skip an election, and then you get a notice that you'll be deleted in another four years. Can't imagine how anyone could find that unfair. Even Donald Trump, who skipped the 2002 general election, might have gotten one of those cards had he lived in Ohio, though he'd have been fine since he then voted in the 2004 presidential election. (Incidentally, that missed 2002 vote made him a liar, again, when he claimed in 2011 that he'd never missed voting in a general election.)
As with the DOJ's recent decision to crack down on affirmative action, the Justice Department's about-face on Ohio's voting purges is being pursued by Trump political appointees; no career attorneys from the Civil Rights Division signed on to the DOJ court filing siding with Ohio. Sort of makes you wonder why Republicans have such a problem with letting qualified people vote, doesn't it?
Not voting in one presidential and one midterm election might seem unthinkable for political junkies like Wonkette readers, but not everyone, sadly, is as fervent about getting to the polls every two years. That really shouldn't disqualify anyone from voting, though. With Justice Gorsuch on the Supremes, Ohio's dumb law seems likely to be upheld, which should winnow down the chances of too many of the wrong people voting. But it if looks too dicey, at least Donald Trump can be sure that a fairly large percentage of his supporters would be OK with just not having elections, since the danger of brown people voting can't be entirely ruled out.
Yr Wonkette is supported by reader donations. Please click the "Donate" clicky to send us money!
[WaPo / Cleveland.com / WaPo]
|
{
"pile_set_name": "OpenWebText2"
}
| 50 |
[
{
"begin": 0,
"end": 101,
"score": 0
},
{
"begin": 101,
"end": 106,
"score": 1
},
{
"begin": 106,
"end": 216,
"score": 0
},
{
"begin": 216,
"end": 222,
"score": 1
},
{
"begin": 222,
"end": 223,
"score": 0
},
{
"begin": 223,
"end": 228,
"score": 1
},
{
"begin": 228,
"end": 254,
"score": 0
},
{
"begin": 254,
"end": 264,
"score": 1
},
{
"begin": 264,
"end": 268,
"score": 0
},
{
"begin": 268,
"end": 275,
"score": 1
},
{
"begin": 275,
"end": 311,
"score": 0
},
{
"begin": 311,
"end": 315,
"score": 1
},
{
"begin": 315,
"end": 339,
"score": 0
},
{
"begin": 339,
"end": 346,
"score": 1
},
{
"begin": 346,
"end": 347,
"score": 0
},
{
"begin": 347,
"end": 352,
"score": 1
},
{
"begin": 352,
"end": 385,
"score": 0
},
{
"begin": 385,
"end": 390,
"score": 1
},
{
"begin": 390,
"end": 440,
"score": 0
},
{
"begin": 440,
"end": 444,
"score": 1
},
{
"begin": 444,
"end": 492,
"score": 0
},
{
"begin": 492,
"end": 496,
"score": 1
},
{
"begin": 496,
"end": 669,
"score": 0
},
{
"begin": 669,
"end": 677,
"score": 1
},
{
"begin": 677,
"end": 697,
"score": 0
},
{
"begin": 697,
"end": 700,
"score": 1
},
{
"begin": 700,
"end": 812,
"score": 0
},
{
"begin": 812,
"end": 817,
"score": 1
},
{
"begin": 817,
"end": 925,
"score": 0
},
{
"begin": 925,
"end": 932,
"score": 1
},
{
"begin": 932,
"end": 968,
"score": 0
},
{
"begin": 968,
"end": 972,
"score": 1
},
{
"begin": 972,
"end": 1304,
"score": 0
},
{
"begin": 1304,
"end": 1308,
"score": 1
},
{
"begin": 1308,
"end": 1309,
"score": 0
},
{
"begin": 1309,
"end": 1318,
"score": 1
},
{
"begin": 1318,
"end": 1322,
"score": 0
},
{
"begin": 1322,
"end": 1327,
"score": 1
},
{
"begin": 1327,
"end": 1328,
"score": 0
},
{
"begin": 1328,
"end": 1331,
"score": 1
},
{
"begin": 1331,
"end": 1332,
"score": 0
},
{
"begin": 1332,
"end": 1338,
"score": 1
},
{
"begin": 1338,
"end": 1443,
"score": 0
},
{
"begin": 1443,
"end": 1447,
"score": 1
},
{
"begin": 1447,
"end": 1596,
"score": 0
},
{
"begin": 1596,
"end": 1602,
"score": 1
},
{
"begin": 1602,
"end": 1806,
"score": 0
},
{
"begin": 1806,
"end": 1817,
"score": 1
},
{
"begin": 1817,
"end": 1906,
"score": 0
},
{
"begin": 1906,
"end": 1915,
"score": 1
},
{
"begin": 1915,
"end": 2023,
"score": 0
}
] |
In object oriented programming languages, determining information about a class of an object from an object pointer can consume a large amount of performance resources. FIG. 1 is a block diagram illustrating a relationship between an object pointer, an object, and a class structure. Object pointer 102 includes a virtual memory address of object 104. Object 104 contains information associated with the object and includes a pointer to class structure 106 associated with the class of object 104. For each class in a program, there exists only one class structure. Objects belonging to the same class contain the same pointer to the same class structure. Class structure 106 includes information associated with an object class. Given a pointer of an object, it is often desired to determine if the class of the object associated with the pointer belongs to a known class. Since class structure pointers refer to the only class structure of a class, the value of a class structure pointer can be used as an identifier to compare object classes. An object is stored in memory using the given object pointer, and the class structure pointer is obtained from the object. The obtained class structure pointer is compared with with the given object pointer is same as the class associated with the known class object pointer value. This comparison process can consume a large amount of performance resources. Loading the object using the given object pointer usually produces a cold cache miss, causing misses in every cache level. A large number of clocks cycles are wasted as the object is brought into the cache from main memory. Since class comparisons are very common operations in object oriented language programs, it is desirable to speed up class comparison operations. Therefore, there exists a need for a more efficient way to obtain data associated with a class of an object.
|
{
"pile_set_name": "USPTO Backgrounds"
}
| 2 |
[
{
"begin": 0,
"end": 169,
"score": 0
},
{
"begin": 169,
"end": 172,
"score": 1
},
{
"begin": 172,
"end": 656,
"score": 0
}
] |
Wiz Khalifa collaborates with Miley Cyrus & Adele for upcoming album
In an interview with Fuse.tv, Wiz reveals that he's recorded songs with Miley Cyrus and Adele for his upcoming album Blacc Hollywood.
And those two big names aren't the only guests who may appear on the album. The rapper says he's already recorded a number of other collaboration tracks, however, none of the tracks have been "cleared" for the final version of the album.
Wiz Khalifa is also looking to team up with one of pop music's biggest names - Lady Gaga. He says he wants to record with the Mother Monster "really bad," adding that they "need to make it happen."
|
{
"pile_set_name": "Pile-CC"
}
| 16 |
[
{
"begin": 0,
"end": 3,
"score": 1
},
{
"begin": 3,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 30,
"score": 0
},
{
"begin": 30,
"end": 35,
"score": 1
},
{
"begin": 35,
"end": 36,
"score": 0
},
{
"begin": 36,
"end": 41,
"score": 1
},
{
"begin": 41,
"end": 44,
"score": 0
},
{
"begin": 44,
"end": 49,
"score": 1
},
{
"begin": 49,
"end": 100,
"score": 0
},
{
"begin": 100,
"end": 103,
"score": 1
},
{
"begin": 103,
"end": 142,
"score": 0
},
{
"begin": 142,
"end": 147,
"score": 1
},
{
"begin": 147,
"end": 148,
"score": 0
},
{
"begin": 148,
"end": 153,
"score": 1
},
{
"begin": 153,
"end": 158,
"score": 0
},
{
"begin": 158,
"end": 163,
"score": 1
}
] |
We’re doing our own testing (read packet sniffing) to see what we can find. We’ve also reached out to Instagram to see if they can confirm what these fixes, well, fix.
Update: We haven’t heard from Instagram this morning, but looking at the Get Satisfaction page this morning…I think it’s safe to say this fix pushed out last night fixes the security issues:
Hey Everyone,
We’ve been hard at work for the last couple weeks on making our product secure & safe. Security is a huge priority for this release. A fix has been submitted to Apple and should be available shortly. If you have any questions, you should feel free to email me personally [email protected]
Kevin
CEO & Cofounder
My packet sniffing experiments weren’t terribly effective at determining what my iPhone was sending out, but I think if the above refers to last night’s update.
|
{
"pile_set_name": "Pile-CC"
}
| 10 |
[
{
"begin": 0,
"end": 102,
"score": 0
},
{
"begin": 102,
"end": 111,
"score": 1
},
{
"begin": 111,
"end": 169,
"score": 0
},
{
"begin": 169,
"end": 175,
"score": 1
},
{
"begin": 175,
"end": 199,
"score": 0
},
{
"begin": 199,
"end": 208,
"score": 1
},
{
"begin": 208,
"end": 463,
"score": 0
},
{
"begin": 463,
"end": 471,
"score": 1
},
{
"begin": 471,
"end": 537,
"score": 0
},
{
"begin": 537,
"end": 542,
"score": 1
},
{
"begin": 542,
"end": 647,
"score": 0
}
] |
Abnormal, affect-specific modulatory effects on early auditory processing in schizophrenia: magnetoencephalographic evidence.
Abnormalities in the perception and identification of emotions have frequently been reported in schizophrenia. Hemodynamic neuroimaging studies found functional abnormalities in cortical and subcortical brain circuits that are involved in normal affective processing, but the temporal dynamics of abnormal emotion processing in schizophrenia remain largely elusive. To investigate this issue, we recorded early auditory evoked field components by means of whole-head magnetoencephalography that were in response to emotion-associated tones in seventeen patients with schizophrenia and in seventeen healthy, matched controls. Forty-two click-like tones (conditioned stimuli; CS) acquired differential emotional meaning through an affective associative learning procedure by pairing each CS three times with either pleasant, unpleasant or neutral auditory scenes. As expected, differential affect-specific modulation in patients vs. controls was evident, starting at the auditory N1m onset latency of approximately 70ms, extending to 230ms. While controls showed the expected enhanced processing of emotion associated CS, patients revealed an inverted pattern with reduced processing of arousal, when compared to neutral stimuli, in the right prefrontal cortex. The present finding suggests impairments in the prioritization of emotionally salient vs. non-salient stimuli in patients with schizophrenia. Dysfunction in higher cognitive processes and behavior in schizophrenia may therefore reflect dysfunction in fundamental, early emotion processing stages.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 4 |
[
{
"begin": 0,
"end": 237,
"score": 0
},
{
"begin": 237,
"end": 248,
"score": 1
},
{
"begin": 248,
"end": 800,
"score": 0
},
{
"begin": 800,
"end": 802,
"score": 1
},
{
"begin": 802,
"end": 912,
"score": 0
}
] |
using GitTools.Testing;
using GitVersionCore.Tests.Helpers;
using LibGit2Sharp;
using NUnit.Framework;
using Shouldly;
namespace GitVersionCore.Tests.IntegrationTests
{
[TestFixture]
public class OtherBranchScenarios : TestBase
{
[Test]
public void CanTakeVersionFromReleaseBranch()
{
using var fixture = new EmptyRepositoryFixture();
const string taggedVersion = "1.0.3";
fixture.Repository.MakeATaggedCommit(taggedVersion);
fixture.Repository.MakeCommits(5);
fixture.Repository.CreateBranch("release/beta-2.0.0");
Commands.Checkout(fixture.Repository, "release/beta-2.0.0");
fixture.AssertFullSemver("2.0.0-beta.1+0");
}
[Test]
public void BranchesWithIllegalCharsShouldNotBeUsedInVersionNames()
{
using var fixture = new EmptyRepositoryFixture();
const string taggedVersion = "1.0.3";
fixture.Repository.MakeATaggedCommit(taggedVersion);
fixture.Repository.MakeCommits(5);
fixture.Repository.CreateBranch("issue/m/github-569");
Commands.Checkout(fixture.Repository, "issue/m/github-569");
fixture.AssertFullSemver("1.0.4-issue-m-github-569.1+5");
}
[Test]
public void ShouldNotGetVersionFromFeatureBranchIfNotMerged()
{
using var fixture = new EmptyRepositoryFixture();
fixture.Repository.MakeATaggedCommit("1.0.0-unstable.0"); // initial commit in master
fixture.Repository.CreateBranch("feature");
Commands.Checkout(fixture.Repository, "feature");
fixture.Repository.MakeATaggedCommit("1.0.1-feature.1");
Commands.Checkout(fixture.Repository, "master");
fixture.Repository.CreateBranch("develop");
Commands.Checkout(fixture.Repository, "develop");
fixture.Repository.MakeACommit();
var version = fixture.GetVersion();
version.SemVer.ShouldBe("1.0.0-alpha.1");
}
}
}
|
{
"pile_set_name": "Github"
}
| 4 |
[
{
"begin": 0,
"end": 109,
"score": 0
},
{
"begin": 109,
"end": 117,
"score": 1
},
{
"begin": 117,
"end": 252,
"score": 0
},
{
"begin": 252,
"end": 256,
"score": 1
},
{
"begin": 256,
"end": 763,
"score": 0
}
] |
American president’s handling of the Sino-US relationship has been widely panned but follows his maxim for negotiations – keep your intentions secret and your opponent confused
|
{
"pile_set_name": "OpenWebText2"
}
| 1 |
[
{
"begin": 0,
"end": 8,
"score": 1
},
{
"begin": 8,
"end": 176,
"score": 0
}
] |
Q:
Does GCC support long long int?
Does GCC support:
long long int
which would be a 64-bit integer?
Also, is long long int part of the standard?
A:
Yes GCC does support long long int, which is a part of C99 standard.
The standard does not mandate its size in bits, but required values of LLONG_MIN and LLONG_MAX in <limits.h> imply it's at least 64-bit (exact 64-bit wide integer types are int64_t/uint64_t from <stdint.h>).
LLONG_MIN must be at most -9223372036854775807
LLONG_MAX must be at least 9223372036854775807
A:
long long int is a part of the C99 standard, and I know GCC supports it. And now I can prove it.
A:
On my 32-bit machine,
int main()
{
printf("%d\n", sizeof(long long int));
return 0;
}
compiled with gcc prints 8 (8 bytes * 8 bits/byte = 64 bits).
|
{
"pile_set_name": "StackExchange"
}
| 2 |
[
{
"begin": 0,
"end": 209,
"score": 0
},
{
"begin": 209,
"end": 212,
"score": 1
},
{
"begin": 212,
"end": 562,
"score": 0
}
] |
Dr. E. Faye Williams of National Congress of Black Women on Equality for Women- 4:36
"One of the things we have decided that we have to do is to stir up that Equal Rights Amendment so that we're in the Constitution and better protected than we are now."
Posted Apr 28, 2015
Share the Video
Embed Information
In the U.S., women on average, make 78 cents to every dollar earned by men. For African American women, that amount drops to 68 cents and it drops further for Hispanic women to 57 centers. Dr. E. Faye Williams, of the National Congress of Black Women discusses pay equity and other issues of equality for women.
Williams stated, "One of the things we have decided that we have to do is to stir up that Equal Rights Amendment so that we're in the Constitution and better protected than we are now."
Visit the National Congress of Black Women on the web at www.NationalCongressBW.org or www.Facebook.com/NCBWINC or follow at www.Twitter.com/DrEFayeWilliams.
Asian Americans are one of the fastest growing demographic groups in the country. And while this population engages locally within communities, there is a lack of civic engagement at the federal level. Gregg Orton, National Director of the National Council of Asian Pacific Americans shares efforts to encourage more engagement from this population not only to advocate for the needs of the AAPI community, but to add diversity to representation and the national dialogue.
Share the Video
Embed Information
Workplace giving through payroll deductions has become a key method of fundraising for non-profit organizations. On this edition of Comcast Newsmakers, Brian Gallagher, President and CEO of the United Way Worldwide discussed the next phase of workplace giving, the Philanthropy Cloud, which will encourage engagement through digital technology.
Share the Video
Embed Information
The #MeToo movement is raising awareness around sexual violence, bringing the issue to a national conversation. On this episode of Comcast Newsmakers, Ebony Tucker, Advocacy Director of the National Alliance to End Sexual Violence, discusses prevention efforts and training, funding, and instances of abuse among certain populations.
Share the Video
Embed Information
About 1 in 5 women in the U.S. today is Hispanic with projected growth to 1 in 3 by the year 2060. While recent statistics have shown that the gender wage gap in the U.S. has improved, Latinas remain on the lower end of the pay spectrum.
Amy Hinojosa, President and CEO of MANA, A National Latina Organization discusses the role of financial literacy in empowering Hispanic women. Click here for part 1 of Latinas and Financial Literacy.
Interview recorded Sept 6, 2017.
Share the Video
Embed Information
The views, opinions, and positions expressed by those featured on the program are theirs alone, and do not necessarily reflect the views, opinions or positions of Comcast Corporation, its affiliates, or its sponsors or advertisers.
|
{
"pile_set_name": "Pile-CC"
}
| 90 |
[
{
"begin": 0,
"end": 7,
"score": 0
},
{
"begin": 7,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 12,
"score": 0
},
{
"begin": 12,
"end": 20,
"score": 1
},
{
"begin": 20,
"end": 24,
"score": 0
},
{
"begin": 24,
"end": 32,
"score": 1
},
{
"begin": 32,
"end": 33,
"score": 0
},
{
"begin": 33,
"end": 41,
"score": 1
},
{
"begin": 41,
"end": 45,
"score": 0
},
{
"begin": 45,
"end": 50,
"score": 1
},
{
"begin": 50,
"end": 51,
"score": 0
},
{
"begin": 51,
"end": 56,
"score": 1
},
{
"begin": 56,
"end": 60,
"score": 0
},
{
"begin": 60,
"end": 68,
"score": 1
},
{
"begin": 68,
"end": 73,
"score": 0
},
{
"begin": 73,
"end": 78,
"score": 1
},
{
"begin": 78,
"end": 159,
"score": 0
},
{
"begin": 159,
"end": 164,
"score": 1
},
{
"begin": 164,
"end": 165,
"score": 0
},
{
"begin": 165,
"end": 171,
"score": 1
},
{
"begin": 171,
"end": 172,
"score": 0
},
{
"begin": 172,
"end": 181,
"score": 1
},
{
"begin": 181,
"end": 203,
"score": 0
},
{
"begin": 203,
"end": 215,
"score": 1
},
{
"begin": 215,
"end": 263,
"score": 0
},
{
"begin": 263,
"end": 266,
"score": 1
},
{
"begin": 266,
"end": 287,
"score": 0
},
{
"begin": 287,
"end": 292,
"score": 1
},
{
"begin": 292,
"end": 294,
"score": 0
},
{
"begin": 294,
"end": 299,
"score": 1
},
{
"begin": 299,
"end": 300,
"score": 0
},
{
"begin": 300,
"end": 311,
"score": 1
},
{
"begin": 311,
"end": 401,
"score": 0
},
{
"begin": 401,
"end": 409,
"score": 1
},
{
"begin": 409,
"end": 509,
"score": 0
},
{
"begin": 509,
"end": 513,
"score": 1
},
{
"begin": 513,
"end": 514,
"score": 0
},
{
"begin": 514,
"end": 522,
"score": 1
},
{
"begin": 522,
"end": 531,
"score": 0
},
{
"begin": 531,
"end": 539,
"score": 1
},
{
"begin": 539,
"end": 540,
"score": 0
},
{
"begin": 540,
"end": 548,
"score": 1
},
{
"begin": 548,
"end": 552,
"score": 0
},
{
"begin": 552,
"end": 557,
"score": 1
},
{
"begin": 557,
"end": 558,
"score": 0
},
{
"begin": 558,
"end": 563,
"score": 1
},
{
"begin": 563,
"end": 625,
"score": 0
},
{
"begin": 625,
"end": 633,
"score": 1
},
{
"begin": 633,
"end": 715,
"score": 0
},
{
"begin": 715,
"end": 720,
"score": 1
},
{
"begin": 720,
"end": 721,
"score": 0
},
{
"begin": 721,
"end": 727,
"score": 1
},
{
"begin": 727,
"end": 728,
"score": 0
},
{
"begin": 728,
"end": 737,
"score": 1
},
{
"begin": 737,
"end": 759,
"score": 0
},
{
"begin": 759,
"end": 771,
"score": 1
},
{
"begin": 771,
"end": 821,
"score": 0
},
{
"begin": 821,
"end": 829,
"score": 1
},
{
"begin": 829,
"end": 830,
"score": 0
},
{
"begin": 830,
"end": 838,
"score": 1
},
{
"begin": 838,
"end": 842,
"score": 0
},
{
"begin": 842,
"end": 847,
"score": 1
},
{
"begin": 847,
"end": 848,
"score": 0
},
{
"begin": 848,
"end": 853,
"score": 1
},
{
"begin": 853,
"end": 861,
"score": 0
},
{
"begin": 861,
"end": 894,
"score": 1
},
{
"begin": 894,
"end": 898,
"score": 0
},
{
"begin": 898,
"end": 922,
"score": 1
},
{
"begin": 922,
"end": 926,
"score": 0
},
{
"begin": 926,
"end": 968,
"score": 1
},
{
"begin": 968,
"end": 976,
"score": 0
},
{
"begin": 976,
"end": 985,
"score": 1
},
{
"begin": 985,
"end": 1172,
"score": 0
},
{
"begin": 1172,
"end": 1177,
"score": 1
},
{
"begin": 1177,
"end": 1178,
"score": 0
},
{
"begin": 1178,
"end": 1183,
"score": 1
},
{
"begin": 1183,
"end": 1185,
"score": 0
},
{
"begin": 1185,
"end": 1193,
"score": 1
},
{
"begin": 1193,
"end": 1194,
"score": 0
},
{
"begin": 1194,
"end": 1202,
"score": 1
},
{
"begin": 1202,
"end": 1210,
"score": 0
},
{
"begin": 1210,
"end": 1218,
"score": 1
},
{
"begin": 1218,
"end": 1219,
"score": 0
},
{
"begin": 1219,
"end": 1226,
"score": 1
},
{
"begin": 1226,
"end": 1236,
"score": 0
},
{
"begin": 1236,
"end": 1243,
"score": 1
},
{
"begin": 1243,
"end": 1244,
"score": 0
},
{
"begin": 1244,
"end": 1253,
"score": 1
},
{
"begin": 1253,
"end": 1454,
"score": 0
},
{
"begin": 1454,
"end": 1459,
"score": 1
},
{
"begin": 1459,
"end": 1461,
"score": 0
}
] |
Changes in amino acid influx with Na flow in incubated slices of mouse brain.
The uptake of amino acids into slices of adult and newborn mouse brain was studied in relation to Na+ flow. (1) The level of Na+ and K+ incubated slices of brain depends on the ionic composition of the incubation medium. The intracellular levels of Na+ in adult tissue are below, in fetal tissue above, Na+ levels in the medium used. Rapid net flow into or out of the tissue can be achieved by transferring slices into media of higher or lower Na+ content. (2) Under conditions of net Na+ inflow, the influx of all amino acids tested increased; under conditions of net Na+ outflow, the influx of all amino acids decreased, as compared to slices in ionic equilibrium. The absolute levels of Na+ in the tissue under the experimental conditions had little effect on amino acid uptake. The stimulatory effect of Na+ inflow and the inhibitory effect of Na+ outflow could be observed at all developmental stages--in adult, newborn, and fetal tissue. (3) We conclude that ion movements influence metabolite transport; these effects are smaller in the absence of fully developed ion pumps. The direction of the net ion flow does not seem to be the main determinant: active accumulation occurred both in adult and in fetal brain, although the tissue-to-medium Na+ gradients were in opposite directions; in addition, amino acid inflow occurred in the presence of Na+ outflow.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 15 |
[
{
"begin": 0,
"end": 34,
"score": 0
},
{
"begin": 34,
"end": 36,
"score": 1
},
{
"begin": 36,
"end": 176,
"score": 0
},
{
"begin": 176,
"end": 178,
"score": 1
},
{
"begin": 178,
"end": 203,
"score": 0
},
{
"begin": 203,
"end": 205,
"score": 1
},
{
"begin": 205,
"end": 211,
"score": 0
},
{
"begin": 211,
"end": 212,
"score": 1
},
{
"begin": 212,
"end": 327,
"score": 0
},
{
"begin": 327,
"end": 329,
"score": 1
},
{
"begin": 329,
"end": 381,
"score": 0
},
{
"begin": 381,
"end": 383,
"score": 1
},
{
"begin": 383,
"end": 412,
"score": 0
},
{
"begin": 412,
"end": 417,
"score": 1
},
{
"begin": 417,
"end": 522,
"score": 0
},
{
"begin": 522,
"end": 524,
"score": 1
}
] |
Hindu Blog started three months ago without any clear idea. First attempt was on collecting quotes and some links on Hinduism. But gradually it evolved into a full-fledged blog discussing various matters concerning Santana Dharma. The Hindu blogging experience was indeed great.
Numerous people and blogs encouraged me. Some challenged and some scoffed. Some played tricks like copying articles from Hindu Blog and some even posted it on Wikipedia but thanks to Wikipedia they removed it and gave me credit for the articles.
Then I realized this is a dangerous arena. I don’t mind people using my article if due credit is given.
Well, I hope to move ahead and become a full-fledged blogger. But the main difficulty is finance. Some people came forward to fund but they had vested interests, so I did not encourage it.
|
{
"pile_set_name": "Pile-CC"
}
| 11 |
[
{
"begin": 0,
"end": 5,
"score": 1
},
{
"begin": 5,
"end": 6,
"score": 0
},
{
"begin": 6,
"end": 10,
"score": 1
},
{
"begin": 10,
"end": 60,
"score": 0
},
{
"begin": 60,
"end": 65,
"score": 1
},
{
"begin": 65,
"end": 117,
"score": 0
},
{
"begin": 117,
"end": 125,
"score": 1
},
{
"begin": 125,
"end": 215,
"score": 0
},
{
"begin": 215,
"end": 222,
"score": 1
},
{
"begin": 222,
"end": 223,
"score": 0
},
{
"begin": 223,
"end": 229,
"score": 1
},
{
"begin": 229,
"end": 235,
"score": 0
}
] |
Max, we are a singel-hooman household. She walks around here like she own da place. But we allow dat cuz she brings da stinky goodness. We lets da hooman have udder hoomans visit so she get enuff exersize and soshalizashins. We don’t want her to get feral or nuffin. How can we train her to leaf da baffroom door open all da time? If she in da baffroom and dere are uvver hoomans here, she shut da door. And we MUST stand on da sink and supervize. Bofe of us. Ebery time. OR ELSE DA GRATE HOOMAN BAFFROOM EXPERMINT WILL NOT BE FULFILLD! How can we take notes (and make sugjeschins) wiff da door closed? The progres of cat-hooman syence will suffer. How can we keep dat door open? I mean we at least have to bust in, rub aginst her legs, and leaf her pants-down wiff the door swinging open or the data will be ruined. Your imput is importnant. Love, Spider and Gracie
Well, it’s a bit humiliating, but you can convince her that the door must remain open at all times if—when she or someone else is in there—one (or both) of you squats right there by the door and cut loose with whatever bodily function you can manage. If you do that 3 or 4 or 29 times she’ll realize she needs that door open just to not have a huge mess to clean up later.
Now, this might not result in the actual door being left open, but she’ll probably put a cat flap in it, and that’s just as good. Heck, if she doesn’t warn her friends, it will be hysterical. When one of them is in there, indisposed, you pop through like a weasel on fire…it will be awesome. And they’ll be very, very glad to be already sitting upon the throne.
Mister Max, my mom looked out the window and said “fall is here.” Well, I looked out the window, too, and I didn’t see anyone falling. I was very disappointed. Later she said, “I love fall.” Still, no one out there. What’s she blathering on about?
People don’t always choose their words well; sometimes I don’t think they even think about the word salad that spills from their mouths. What she should have said is, “Autumn is here,” and “I love autumn.” It’s just their time of year, when summer starts to fade away and cooler temperatures blanket over the warms. (Ok, in the U.S., anyway. You guys down under, welcome to spring.) I think people glace out the window and see leaves falling, and their poor brains break and all the sudden it’s drrr drrr drrr fallingthingies…fall!
Try not to judge them too harshly, not as long as they give us use of their thumbs.
HOW MANY SLEEPS UNTIL SANTA, MAX???
1,498,209…as long as you’ve been good.
You’ve been good, right?
Otherwise…it’s 1,498,209 sleeps until utter disappointment, which is not nearly as much fun as Santa.
Comments (7)
I’ll tell ya. The Great Bathroom Data Gathering “Sperimint is going on great here except when company comes. Inexplicably, THEY close the door. Mom never does. If they latch it instead of just bring it to, the way mom does, I can’t bust the door wide open and take up my post!
Wez Canuck cats who iz sillybrating Thanksgiving soon an wez want to know iffin wez sneak out de space portal of disappearence to de Mew S A wez can have de turkey bird twice? Wez promise to be thankful
The hooman here is good about letting us in to snoopervise but there are those occasional occasions thet he closes dat darn door. The swinging cat door izza great idee and we will credit you when we do the running in “Like a weasel on fire”
Great stuff Dood Great stuff
Got yer newest book too
Startin it soon like
Purrs
Timmy and da Crew
Pluses, (Aspen again) my Sisfurr Mango agrees, none of us want Mom to get so mad, she comes flashing photos of any of usses in our Litter Box. We are Not bothering our Mom sitting on her giant potty chair!
Our the-mom hurt her back the other day (emptying the dish washer of all things). Anyhow, we walk over her at night like we always do and she got mad and said “the next cat that does that is in big trouble!”. How do we get the orange feral-type menace to walk on the mom??
Max, we r glad to heer so menny cats is dokumentink dere hoomans’ baffroom habbits. We’d also like to invite all cats to partissipate in Laptoberfest. It’s Oktober here in Shikago (it may be a diffrint munf where you live, but …) and dat meens its rilla cold sumtimes and da hoomans r happier den pigs in mud to keep da windos open and not turn on da furniss. And dey wont shut to hek up abowt how grate awtum is. So we must gloo owrselfs to dere laps and make dem feel gilty until dey turn on da warms. Da plan is to uze 1) da sad eyes fur gilt and judjment 2) ressless stompling all over dem wen dey try to look at da kaputer 3) passiv-aggressiv silent-but-dedly farts until dey say “OK I’ll turn on da furniss! Juss sit over dere!” Game. Set. Match. Laptoberfest begins on Catlumbus Day. Will you join us? – Spider and Gracie
About Mousebreath Media
Mousebreath Media publishes Mousebreath Magazine which has an engaged following of passionate pet owners.
In addition to publishing, Mousebreath Media also provides consulting services for Wordpress design, migration and integration, expert evaluation of your blog for usability and SEO, and video production services.
Affiliate Links
Some of the links contained on this blog are affiliate links. Thanks for clicking -- they help keep Mousebreath up and running.
|
{
"pile_set_name": "Pile-CC"
}
| 75 |
[
{
"begin": 0,
"end": 3,
"score": 1
},
{
"begin": 3,
"end": 74,
"score": 0
},
{
"begin": 74,
"end": 76,
"score": 1
},
{
"begin": 76,
"end": 116,
"score": 0
},
{
"begin": 116,
"end": 118,
"score": 1
},
{
"begin": 118,
"end": 144,
"score": 0
},
{
"begin": 144,
"end": 146,
"score": 1
},
{
"begin": 146,
"end": 296,
"score": 0
},
{
"begin": 296,
"end": 298,
"score": 1
},
{
"begin": 298,
"end": 322,
"score": 0
},
{
"begin": 322,
"end": 324,
"score": 1
},
{
"begin": 324,
"end": 341,
"score": 0
},
{
"begin": 341,
"end": 343,
"score": 1
},
{
"begin": 343,
"end": 395,
"score": 0
},
{
"begin": 395,
"end": 397,
"score": 1
},
{
"begin": 397,
"end": 425,
"score": 0
},
{
"begin": 425,
"end": 427,
"score": 1
},
{
"begin": 427,
"end": 448,
"score": 0
},
{
"begin": 448,
"end": 452,
"score": 1
},
{
"begin": 452,
"end": 460,
"score": 0
},
{
"begin": 460,
"end": 465,
"score": 1
},
{
"begin": 465,
"end": 587,
"score": 0
},
{
"begin": 587,
"end": 589,
"score": 1
},
{
"begin": 589,
"end": 843,
"score": 0
},
{
"begin": 843,
"end": 847,
"score": 1
},
{
"begin": 847,
"end": 849,
"score": 0
},
{
"begin": 849,
"end": 855,
"score": 1
},
{
"begin": 855,
"end": 860,
"score": 0
},
{
"begin": 860,
"end": 866,
"score": 1
},
{
"begin": 866,
"end": 1370,
"score": 0
},
{
"begin": 1370,
"end": 1374,
"score": 1
},
{
"begin": 1374,
"end": 1602,
"score": 0
},
{
"begin": 1602,
"end": 1608,
"score": 1
},
{
"begin": 1608,
"end": 1609,
"score": 0
},
{
"begin": 1609,
"end": 1612,
"score": 1
},
{
"begin": 1612,
"end": 2018,
"score": 0
},
{
"begin": 2018,
"end": 2024,
"score": 1
},
{
"begin": 2024,
"end": 2167,
"score": 0
},
{
"begin": 2167,
"end": 2169,
"score": 1
},
{
"begin": 2169,
"end": 2180,
"score": 0
},
{
"begin": 2180,
"end": 2181,
"score": 1
},
{
"begin": 2181,
"end": 2488,
"score": 0
},
{
"begin": 2488,
"end": 2493,
"score": 1
},
{
"begin": 2493,
"end": 2661,
"score": 0
},
{
"begin": 2661,
"end": 2666,
"score": 1
},
{
"begin": 2666,
"end": 2701,
"score": 0
},
{
"begin": 2701,
"end": 2706,
"score": 1
},
{
"begin": 2706,
"end": 2707,
"score": 0
},
{
"begin": 2707,
"end": 2715,
"score": 1
},
{
"begin": 2715,
"end": 2716,
"score": 0
},
{
"begin": 2716,
"end": 2720,
"score": 1
},
{
"begin": 2720,
"end": 2732,
"score": 0
},
{
"begin": 2732,
"end": 2741,
"score": 1
},
{
"begin": 2741,
"end": 2961,
"score": 0
},
{
"begin": 2961,
"end": 2964,
"score": 1
},
{
"begin": 2964,
"end": 2965,
"score": 0
},
{
"begin": 2965,
"end": 2971,
"score": 1
},
{
"begin": 2971,
"end": 2997,
"score": 0
},
{
"begin": 2997,
"end": 3009,
"score": 1
},
{
"begin": 3009,
"end": 3094,
"score": 0
},
{
"begin": 3094,
"end": 3097,
"score": 1
},
{
"begin": 3097,
"end": 3098,
"score": 0
},
{
"begin": 3098,
"end": 3099,
"score": 1
},
{
"begin": 3099,
"end": 3137,
"score": 0
},
{
"begin": 3137,
"end": 3140,
"score": 1
},
{
"begin": 3140,
"end": 3406,
"score": 0
},
{
"begin": 3406,
"end": 3411,
"score": 1
},
{
"begin": 3411,
"end": 3418,
"score": 0
},
{
"begin": 3418,
"end": 3422,
"score": 1
},
{
"begin": 3422,
"end": 3423,
"score": 0
},
{
"begin": 3423,
"end": 3428,
"score": 1
},
{
"begin": 3428,
"end": 3459,
"score": 0
},
{
"begin": 3459,
"end": 3466,
"score": 1
},
{
"begin": 3466,
"end": 3480,
"score": 0
},
{
"begin": 3480,
"end": 3485,
"score": 1
},
{
"begin": 3485,
"end": 3486,
"score": 0
}
] |
6*o + 14 + 12*o + 29*o**2 + 14*o wrt o.
58*o
Let q be 1/(-1) + 8/2. Differentiate 0 + 2*r**3 - 3*r**q + 5 wrt r.
-3*r**2
What is the first derivative of -24 + b**2 - b**2 + 22*b**4 + 38 wrt b?
88*b**3
What is the first derivative of -368*v**3 - 1 + 369*v**3 + 6 wrt v?
3*v**2
Let w(h) = -h**3 - 4*h**2 - 4*h. Let i be w(-3). What is the third derivative of 9*y**3 - 5*y**i + 3*y**2 - 9*y**3 wrt y?
-30
Let k(l) = -l + 7. Let f be k(11). Let w(u) = -u**2 - 3. Let d(r) = -r**2. Let y(v) = f*d(v) - w(v). Differentiate y(n) with respect to n.
10*n
Let g(y) be the second derivative of -33*y**5/20 + 37*y**2/2 - 49*y. Differentiate g(x) with respect to x.
-99*x**2
Let q(b) = 8*b**5 + 4*b**2 - 15*b + 4. Let u(n) = 8*n**5 + 3*n**2 - 16*n + 3. Let c(m) = 3*q(m) - 4*u(m). What is the second derivative of c(o) wrt o?
-160*o**3
Let y be 3/6 - (-14)/4. Let q be y*(6/4)/3. What is the third derivative of 3*g**q + 11*g - 11*g - 3*g**3 wrt g?
-18
Let w(s) be the first derivative of -3*s**8/56 + s**4/4 + 2*s + 3. Let k(q) be the first derivative of w(q). Find the third derivative of k(v) wrt v.
-360*v**3
Let h(v) = -4*v**4 - 3*v**2 + 10*v. Let l(p) = -5*p**4 - 2*p**2 + 11*p. Let c(q) = -2*h(q) + 3*l(q). What is the second derivative of c(a) wrt a?
-84*a**2
Let w(j) be the first derivative of 3 + j**3 - 3/2*j**2 + 0*j. Find the second derivative of w(n) wrt n.
6
Let v be (-90)/(-40) + (-3)/(-4). Find the second derivative of s**5 - v*s**5 - s - s**5 wrt s.
-60*s**3
Differentiate -9 - 239*g**3 + 3*g**4 + 239*g**3 with respect to g.
12*g**3
Find the first derivative of 53*t**4 - 13 - 40*t**4 - 39*t**4 wrt t.
-104*t**3
Let v(i) be the second derivative of i**5/2 + 11*i**4/12 - 5*i. Find the third derivative of v(b) wrt b.
60
Let q(f) = -4*f**2 - 3*f - 6. Suppose r - 5 + 2 = 0. Let j(x) = -7*x**2 - 5*x - 11. Let h(p) = r*j(p) - 5*q(p). Differentiate h(l) with respect to l.
-2*l
Let l(a) = -a**3 + a**2. Let v(r) = -8*r**4 - 2*r**3 + 2*r**2 - 15. Let w(h) = 2*l(h) - v(h). What is the derivative of w(y) wrt y?
32*y**3
Suppose 1 = -2*m - 3*b + 10, -4*b - 8 = -4*m. Suppose m*y - 2 = 2*y. What is the third derivative of 6*o**2 - 2*o**3 - 5*o**2 - y*o**2 wrt o?
-12
Let m(h) be the second derivative of -7*h**6/30 - 11*h**3/6 + h. What is the second derivative of m(p) wrt p?
-84*p**2
Let b = 14 + -10. What is the third derivative of b*n**5 + 2*n**2 - 5*n**2 + 0*n**2 wrt n?
240*n**2
Suppose 5*p = 3*a - 11, 3*a + 0*p = 2*p + 26. Suppose u - a = -3*u. Differentiate 5*t**u - 2 - 4*t**3 + t**3 wrt t.
6*t**2
Let r(a) be the second derivative of 1/24*a**4 + a + 1/3*a**3 - 1/2*a**2 + 0. Let n(j) be the first derivative of r(j). Differentiate n(y) with respect to y.
1
Let i(h) be the first derivative of -3/2*h**2 - 3 + 2*h. Find the first derivative of i(k) wrt k.
-3
Suppose 4*c = 3*c + 3. What is the second derivative of 0*z**3 + 2*z**5 + 2*z - z**3 + z**c wrt z?
40*z**3
What is the second derivative of -5*s**5 + 4*s**5 + 0*s - 3*s wrt s?
-20*s**3
Let d(p) = 7*p**4 - 6*p**2 + 22*p - 54. Let n(w) = -15*w**4 + 13*w**2 - 43*w + 109. Let y(j) = -13*d(j) - 6*n(j). Differentiate y(o) with respect to o.
-4*o**3 - 28
Let j(m) be the second derivative of 0*m**2 + 2*m + 0 - 1/3*m**3 + 0*m**4 + 7/20*m**5. What is the second derivative of j(c) wrt c?
42*c
Let o be (10/24)/(20/8). Let b(h) be the second derivative of h + 0 + 0*h**2 - 1/12*h**4 + o*h**3. Find the second derivative of b(j) wrt j.
-2
Suppose 3*h = 4*h - 2. Differentiate g**h + 3 + g**2 - 3*g**2 with respect to g.
-2*g
Let f(d) be the first derivative of 23*d**3/3 - 3*d + 13. Find the first derivative of f(v) wrt v.
46*v
Find the third derivative of 60*h**2 - 6*h**4 + 4*h**4 + 12*h**3 - 9*h**3 + 9*h**4 wrt h.
168*h + 18
Let i(c) be the third derivative of 3*c**7/70 + 13*c**5/60 + 7*c**2. What is the third derivative of i(h) wrt h?
216*h
Suppose -3*s = -3*z - 27, 5 - 25 = 5*z. What is the second derivative of -4*y**2 + 0*y + s*y - 9*y wrt y?
-8
Let i(p) be the third derivative of -7*p**5/60 - p**4/12 + 4*p**2. Find the second derivative of i(d) wrt d.
-14
Let h(w) be the second derivative of -w**10/10080 + w**7/630 + w**4/3 - 3*w. Let o(x) be the third derivative of h(x). Find the third derivative of o(m) wrt m.
-180*m**2
Let p be 72/42*1*7. Differentiate -24*m + 4 + 16*m + p*m with respect to m.
4
Let b(g) be the second derivative of -1/15*g**6 + 0 + 0*g**2 + 0*g**3 - g + 0*g**5 + 1/12*g**4. What is the third derivative of b(f) wrt f?
-48*f
Let b(i) be the second derivative of -i**7/42 - 5*i**4/12 - 6*i. Find the third derivative of b(s) wrt s.
-60*s**2
Let b(f) be the third derivative of 1/8*f**4 + 0 + 0*f + f**2 - 1/3*f**3. Let s(a) = -a + 1. Let k(z) = -b(z) - 4*s(z). What is the derivative of k(h) wrt h?
1
Let m(a) = 21*a**3 - 124*a**2 - 27*a + 44. Let h(o) = 4*o**3 - 25*o**2 - 5*o + 9. Let j(b) = -11*h(b) + 2*m(b). Find the second derivative of j(i) wrt i.
-12*i + 54
Let r(k) = k**3 - k**2 - k + 2. Let a(s) = s**3 + 5*s**2 - 5*s + 6. Let p be a(-6). Let l be r(p). Differentiate 5 - l - 1 + 4*f**3 - f**3 wrt f.
9*f**2
Let j = -1 - -1. Suppose -6 = -3*i - 3*c + 6, j = 3*i + 4*c - 11. Find the second derivative of 3*q**i - 2*q + q**4 - q**4 wrt q.
60*q**3
Suppose -5*o - 1 = 4*t, -20 = -5*o + 2*t + 3. Let i = 5 - o. What is the second derivative of 3*x**2 + x - i + 2 wrt x?
6
Let z(h) be the third derivative of -17*h**6/60 - 7*h**4/12 + 5*h**2. What is the second derivative of z(l) wrt l?
-204*l
Differentiate -11 + 81*q**2 + 83*q**2 - 165*q**2 - 2*q**3 with respect to q.
-6*q**2 - 2*q
Let a(n) = -n + 3. Let c be a(3). Suppose c = -0*f - f. Find the first derivative of 4*h + f - h + 2 wrt h.
3
Suppose -n = -4*o - 0*o - 7, -3*o - 18 = -5*n. Find the second derivative of -6*b**3 - n*b + 3*b**4 + 5*b**3 + b**3 wrt b.
36*b**2
Let b(o) be the first derivative of -o**9/504 + o**5/20 + 2*o**3/3 + 1. Let p(z) be the third derivative of b(z). What is the second derivative of p(c) wrt c?
-120*c**3
Let p(k) be the second derivative of -2*k**7/21 + k**4/2 + 4*k. What is the third derivative of p(m) wrt m?
-240*m**2
Let p(u) be the second derivative of -3*u**5/10 - 9*u**2/2 + 2*u. Differentiate p(k) with respect to k.
-18*k**2
Let m = -3 + 5. Differentiate 3*w**3 + 5 + 4*w**m - 4*w**2 + 1 with respect to w.
9*w**2
Let r = -11 + 6. Let d = r - -10. What is the second derivative of d*i - 3*i + 4*i**2 - i wrt i?
8
Let x(k) = -20*k**4 + 3*k**3 - 3*k**2 + k. Let i(t) = 59*t**4 - 8*t**3 + 8*t**2 - 2*t. Let r(u) = -3*i(u) - 8*x(u). What is the second derivative of r(m) wrt m?
-204*m**2
Suppose 5*q = -p - 15, -2*q = -3*p - 6*q - 12. Suppose -3 = -n - p*n. What is the second derivative of 3 - 3 + 2*b**n + 2*b wrt b?
12*b
Let f be 4/(2/(-5)*-5). What is the second derivative of 2*n - 13*n - n**f - 3*n**2 + 8*n wrt n?
-8
Let u(f) = -7*f**2 - 22*f. Let x(c) = -7*c**2 - 22*c. Let l(s) = -2*u(s) + 3*x(s). What is the second derivative of l(o) wrt o?
-14
Let a(h) be the first derivative of 5*h**4 - 34*h - 29. What is the first derivative of a(f) wrt f?
60*f**2
Suppose 5*b - a - 12 = 35, 5*a = -b + 25. Let i be (-53)/(-11) + b/55. What is the third derivative of 3*r**5 + r**2 - i*r + 5*r + 0*r**5 wrt r?
180*r**2
Let n(p) be the second derivative of 0 - 4*p - 1/12*p**4 + 0*p**2 + 0*p**5 - 1/21*p**7 + 0*p**3 + 0*p**6. Find the third derivative of n(i) wrt i.
-120*i**2
Let w be -1*(1 - (-1 - -3)). Let g = -1 - -2. Differentiate -g + 0 + d - w with respect to d.
1
Let y(l) = 13*l**4 - l**3 - l**2 - 5*l + 1. Let k(u) = u**4 - u**3 - u**2 + 1. Let d(h) = -k(h) + y(h). What is the second derivative of d(g) wrt g?
144*g**2
Let y(i) be the second derivative of -11*i**5/10 + 5*i**4/12 - 16*i. What is the third derivative of y(j) wrt j?
-132
Let p(k) = k**2 + 1. Let v be p(-2). What is the second derivative of 3*f**2 + f**5 + f - 3*f**2 + 3*f**v wrt f?
80*f**3
Let u(d) be the third derivative of 0*d + 7/24*d**4 + 1/12*d**6 + 0*d**5 + 0*d**3 - 6*d**2 + 0. What is the second derivative of u(g) wrt g?
60*g
Let t(f) be the second derivative of -f**7/21 - 5*f**3/6 - 12*f. What is the second derivative of t(s) wrt s?
-40*s**3
Let d = 7 + -7. What is the second derivative of d*x + 2*x + 2*x**5 + 0*x + 0*x wrt x?
40*x**3
Let i be (-2)/4 + 1/2. Let k(a) be the third derivative of
|
{
"pile_set_name": "DM Mathematics"
}
| 47 |
[
{
"begin": 0,
"end": 68,
"score": 0
},
{
"begin": 68,
"end": 81,
"score": 1
},
{
"begin": 81,
"end": 359,
"score": 0
},
{
"begin": 359,
"end": 360,
"score": 1
},
{
"begin": 360,
"end": 368,
"score": 0
},
{
"begin": 368,
"end": 369,
"score": 1
},
{
"begin": 369,
"end": 377,
"score": 0
},
{
"begin": 377,
"end": 378,
"score": 1
},
{
"begin": 378,
"end": 386,
"score": 0
},
{
"begin": 386,
"end": 387,
"score": 1
},
{
"begin": 387,
"end": 395,
"score": 0
},
{
"begin": 395,
"end": 396,
"score": 1
},
{
"begin": 396,
"end": 481,
"score": 0
},
{
"begin": 481,
"end": 482,
"score": 1
},
{
"begin": 482,
"end": 503,
"score": 0
},
{
"begin": 503,
"end": 516,
"score": 1
},
{
"begin": 516,
"end": 517,
"score": 0
},
{
"begin": 517,
"end": 518,
"score": 1
},
{
"begin": 518,
"end": 552,
"score": 0
},
{
"begin": 552,
"end": 553,
"score": 1
},
{
"begin": 553,
"end": 587,
"score": 0
},
{
"begin": 587,
"end": 588,
"score": 1
},
{
"begin": 588,
"end": 600,
"score": 0
},
{
"begin": 600,
"end": 601,
"score": 1
},
{
"begin": 601,
"end": 612,
"score": 0
},
{
"begin": 612,
"end": 613,
"score": 1
},
{
"begin": 613,
"end": 615,
"score": 0
},
{
"begin": 615,
"end": 628,
"score": 1
},
{
"begin": 628,
"end": 827,
"score": 0
},
{
"begin": 827,
"end": 828,
"score": 1
},
{
"begin": 828,
"end": 856,
"score": 0
},
{
"begin": 856,
"end": 857,
"score": 1
},
{
"begin": 857,
"end": 1467,
"score": 0
},
{
"begin": 1467,
"end": 1480,
"score": 1
},
{
"begin": 1480,
"end": 1841,
"score": 0
},
{
"begin": 1841,
"end": 1854,
"score": 1
},
{
"begin": 1854,
"end": 2006,
"score": 0
},
{
"begin": 2006,
"end": 2007,
"score": 1
},
{
"begin": 2007,
"end": 2013,
"score": 0
},
{
"begin": 2013,
"end": 2014,
"score": 1
},
{
"begin": 2014,
"end": 2019,
"score": 0
},
{
"begin": 2019,
"end": 2020,
"score": 1
},
{
"begin": 2020,
"end": 2080,
"score": 0
},
{
"begin": 2080,
"end": 2081,
"score": 1
},
{
"begin": 2081,
"end": 2090,
"score": 0
},
{
"begin": 2090,
"end": 2091,
"score": 1
},
{
"begin": 2091,
"end": 2152,
"score": 0
},
{
"begin": 2152,
"end": 2153,
"score": 1
}
] |
2',3'-O-(2,4,6-trinitrophenyl)-8-azido-adenosine mono-, di-, and triphosphates as photoaffinity probes of the Ca2+-ATPase of sarcoplasmic reticulum. Regulatory/superfluorescent nucleotides label the catalytic site with high efficiency.
We have synthesized a new class of ATP photo-affinity analogs, 2',3'-O-(2,4,6-trinitrophenyl)-8-azido (TNP-8N3)-ATP, -ADP, and -AMP, and their radiolabeled derivatives, and characterized their interaction with sarcoplasmic reticulum vesicles. The nucleotides bind with high affinity (Kd = 0.04-0.4 microM) to the catalytic site of the Ca2+-ATPase. TNP-8N3-ATP and TNP-8N3-ADP, at low concentrations (less than 10 microM), accelerate ATPase activity 1.5- and 1.4-fold, respectively, indicating that they bind to a regulatory site. In the same concentration range, they all undergo a large increase in fluorescence ("superfluorescence") during enzyme turnover in the presence of ATP and Ca2+, or on phosphorylation from Pi in a Ca2+-depleted medium. Irradiation at alkaline pH results in specific covalent incorporation of the nucleotide at the catalytic site on the A1 tryptic subfragment. The efficiency of catalytic site labeling is greatest (up to 80% of available sites/irradiation period) in the presence of ATP, Ca2+, and Mg2+, conditions in which the probe binds only to the regulatory and superfluorescent sites. The covalently attached nucleotide exhibits fluorescence enhancement on enzyme turnover in the presence of acetyl phosphate plus Ca2+ or on phosphorylation from Pi in a Ca2+-depleted medium, but not in the presence of ATP plus Ca2+. The results suggest that the catalytic, regulatory, and superfluorescent nucleotide sites are at the same locus and that the binding domain includes portions of the A1 subfragment. The high efficiency with which the site is photolabeled during turnover is ascribed to water exclusion and possibly cleft closure in E2-P.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 16 |
[
{
"begin": 0,
"end": 56,
"score": 0
},
{
"begin": 56,
"end": 58,
"score": 1
},
{
"begin": 58,
"end": 110,
"score": 0
},
{
"begin": 110,
"end": 113,
"score": 1
},
{
"begin": 113,
"end": 364,
"score": 0
},
{
"begin": 364,
"end": 367,
"score": 1
},
{
"begin": 367,
"end": 520,
"score": 0
},
{
"begin": 520,
"end": 522,
"score": 1
},
{
"begin": 522,
"end": 571,
"score": 0
},
{
"begin": 571,
"end": 574,
"score": 1
},
{
"begin": 574,
"end": 921,
"score": 0
},
{
"begin": 921,
"end": 924,
"score": 1
},
{
"begin": 924,
"end": 962,
"score": 0
},
{
"begin": 962,
"end": 965,
"score": 1
},
{
"begin": 965,
"end": 1008,
"score": 0
},
{
"begin": 1008,
"end": 1010,
"score": 1
},
{
"begin": 1010,
"end": 1101,
"score": 0
}
] |
Q:
If you are using v-if on multiple elements, use v-else-if to chain them instead. Laravel + VueJs
First question - How to create components in a loop?
In my Index.vue I have a loop
<div v-for="(image, id, index) in images" class="col-md-4">
<photo :src ="image.src" :symbolId="image.id" :photoId="image.photo_id" :index="index"></photo>
</div>
in my app.js i registered a component
Vue.component('photo',
require('./components/Photo.vue')
);
and in my Photo.vue
<template>
<img v-on:click="replaceImages()" :src="src" class="img-responsive image" :data-symbol-id="symbolId" :data-photo-id="photoId">
<input :name="index" :data-symbol-id="symbolId" :data-photo-id="photoId"
type="hidden" :value="src">
</template>
<script>
export default {
name: 'photo',
props: {
src: {
type : String,
required: true
},
symbolId: {
type: String,
required: true
},
photoId: {
type: Number,
required: true
},
index: {
type: Number,
required: true
}
},
}
</script>
but when npm compiling it, i get an error
Component template should contain exactly one root element. If you are using v-if on multiple elements, use v-else-if to chain them instead.
A:
Add one div instead template, Vue expect one root element which contain all template, template tag is omitted by vue if using as below example
<template>
<div>
<img v-on:click="replaceImages()" :src="src" class="img-responsive image" :data-symbol-id="symbolId" :data-photo-id="photoId">
<input :name="index" :data-symbol-id="symbolId" :data-photo-id="photoId"
type="hidden" :value="src">
</div>
</template>
var child = {
template : '<div>Child component</div>'
}
var app = new Vue({
el:"#app",
components:{
child
},
data:{
name:''
}
});
<script src="https://cdnjs.cloudflare.com/ajax/libs/vue/2.5.11/vue.js"></script>
<div id="app">
<child></child>
</div>
|
{
"pile_set_name": "StackExchange"
}
| 8 |
[
{
"begin": 0,
"end": 85,
"score": 0
},
{
"begin": 85,
"end": 92,
"score": 1
},
{
"begin": 92,
"end": 102,
"score": 0
},
{
"begin": 102,
"end": 107,
"score": 1
},
{
"begin": 107,
"end": 389,
"score": 0
},
{
"begin": 389,
"end": 392,
"score": 1
},
{
"begin": 392,
"end": 823,
"score": 0
},
{
"begin": 823,
"end": 829,
"score": 1
},
{
"begin": 829,
"end": 907,
"score": 0
}
] |
The Keweenaw Mountain Lodge
and Golf Course Complex, which opened on June 23, 1935,
was conceived and constructed during the Great
Depression years of the 1930's. One of hundreds of
public works projects sponsored by the federal
government at that time, unemployed copper miners were
re-employed to clear the land on which the Lodge and its
golf course now reside. The trees that were cut were
used to construct the main lodge and
guest cabins. These hand
hewn log structures have been carefully preserved for
almost 70 years, and are a rare and unique step back in
time. Copper Harbor lies one mile north by car on US41
or at the far end of the walking trails leading from the
Lodge. The newly added conference center adds a
280-person event facility. For more information, please
visit:
www.AtTheLodge.com
The Joseph & Mary
Lizzadro Preserve
is highlighted as a high quality bedrock plant community
in the Michigan Natural Features Inventory Study of
Bedrock Shorelines. The 24-acre parcel features boreal
and mixed hardwood forests, lowland swamp, bedrock
glade, and a bedrock and cobble beach along 643 feet of
undeveloped shoreline on Lake Superior. Several small
islands just off shore are included. The primary goals
of the project are to protect sensitive Lake Superior
shoreline from development, to increase public awareness
of the need to protect such
areas through on-site
education and to provide for noninvasive public access to Keweenaw's
north shore, which is dominated by private ownership.
The Preserve is owned by the Houghton Keweenaw
Conservation District and has a conservation easement
held by the Keweenaw Land Trust. Grant funds were
provided by the Michigan Department of Environmental
Quality.For more information,
please visit:Houghton Keweenaw
Conservation District
Eagle River became the
county seat in 1861 followed by the building of a courthouse in 1866. Even after remodeling in 1925, the
formality of the courthouse, preserved in its original
appearance, attests to the prosperity of the mining era.
The sheriff's residence and jail followed in 1886. Even
today, the sheriff's family lives in a pleasant home
attached to the jail and prisoners enjoy the good food
prepared by the sheriff's wife. Bridges straddling the
Eagle River are favorite
stops to view the vast expanse of Lake Superior on one
side and, on the other side, splendid trees with a
cascading waterfall. The bridge built in 1915 was
converted to pedestrian use when the adjacent timber
bridge opened 1990. Primarily made glue-laminated timber
arches, the new bridge aesthetically blends into the
surrounding environment and was an ideal choice for such
a scenic location.
|
{
"pile_set_name": "Pile-CC"
}
| 52 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 12,
"score": 1
},
{
"begin": 12,
"end": 13,
"score": 0
},
{
"begin": 13,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 27,
"score": 1
},
{
"begin": 27,
"end": 32,
"score": 0
},
{
"begin": 32,
"end": 36,
"score": 1
},
{
"begin": 36,
"end": 37,
"score": 0
},
{
"begin": 37,
"end": 43,
"score": 1
},
{
"begin": 43,
"end": 44,
"score": 0
},
{
"begin": 44,
"end": 51,
"score": 1
},
{
"begin": 51,
"end": 69,
"score": 0
},
{
"begin": 69,
"end": 73,
"score": 1
},
{
"begin": 73,
"end": 125,
"score": 0
},
{
"begin": 125,
"end": 130,
"score": 1
},
{
"begin": 130,
"end": 131,
"score": 0
},
{
"begin": 131,
"end": 141,
"score": 1
},
{
"begin": 141,
"end": 327,
"score": 0
},
{
"begin": 327,
"end": 332,
"score": 1
},
{
"begin": 332,
"end": 580,
"score": 0
},
{
"begin": 580,
"end": 586,
"score": 1
},
{
"begin": 586,
"end": 679,
"score": 0
},
{
"begin": 679,
"end": 684,
"score": 1
},
{
"begin": 684,
"end": 790,
"score": 0
},
{
"begin": 790,
"end": 808,
"score": 1
},
{
"begin": 808,
"end": 814,
"score": 0
},
{
"begin": 814,
"end": 820,
"score": 1
},
{
"begin": 820,
"end": 823,
"score": 0
},
{
"begin": 823,
"end": 827,
"score": 1
},
{
"begin": 827,
"end": 828,
"score": 0
},
{
"begin": 828,
"end": 836,
"score": 1
},
{
"begin": 836,
"end": 837,
"score": 0
},
{
"begin": 837,
"end": 845,
"score": 1
},
{
"begin": 845,
"end": 910,
"score": 0
},
{
"begin": 910,
"end": 918,
"score": 1
},
{
"begin": 918,
"end": 919,
"score": 0
},
{
"begin": 919,
"end": 926,
"score": 1
},
{
"begin": 926,
"end": 927,
"score": 0
},
{
"begin": 927,
"end": 935,
"score": 1
},
{
"begin": 935,
"end": 946,
"score": 0
},
{
"begin": 946,
"end": 951,
"score": 1
},
{
"begin": 951,
"end": 955,
"score": 0
},
{
"begin": 955,
"end": 962,
"score": 1
},
{
"begin": 962,
"end": 963,
"score": 0
},
{
"begin": 963,
"end": 973,
"score": 1
},
{
"begin": 973,
"end": 1142,
"score": 0
},
{
"begin": 1142,
"end": 1146,
"score": 1
},
{
"begin": 1146,
"end": 1147,
"score": 0
},
{
"begin": 1147,
"end": 1155,
"score": 1
},
{
"begin": 1155,
"end": 1266,
"score": 0
},
{
"begin": 1266,
"end": 1270,
"score": 1
},
{
"begin": 1270,
"end": 1271,
"score": 0
}
] |
Description:TS superstar Chanel Santini is craving for MILF Mercedes. Soon they makes out and Chanel goes down on Mercedes diving head first into her wet pussy. Chanel fucks Mercedes pussy from behind in doggstyle position with her hard shecock.
|
{
"pile_set_name": "Pile-CC"
}
| 7 |
[
{
"begin": 0,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 31,
"score": 1
},
{
"begin": 31,
"end": 32,
"score": 0
},
{
"begin": 32,
"end": 39,
"score": 1
},
{
"begin": 39,
"end": 60,
"score": 0
},
{
"begin": 60,
"end": 68,
"score": 1
},
{
"begin": 68,
"end": 94,
"score": 0
},
{
"begin": 94,
"end": 100,
"score": 1
}
] |
While the vast majority of modern oral implants are successful, every implant journal and international conference has papers and presentations about implant failures. One common symptom of implant failure is fibrous encapsulation, which typically arises from a lack of primary stability of the implant. Clinical standards dictate that a unstable implant must be removed and, if sufficient bone stock remains, replaced. However, there is little guarantee that the next implant attempt will be successful because the underlying etiology of the initial failure is often not understood in the first place. Certainly biomechanical factors influence implant stability in bone. To examine this problem area, we have developed a novel, reproducible, in vivo model in the mouse maxilla to rigorously test our hypothesis that excessive strain drives peri-implant cells to differentiate along a fibroblastic rather than an osteoblastic lineage. In the same model we also propose to test two clinically relevant strategies to prevent -- and potentially reverse - the perplexing problem of fibrous encapsulation of a failed implant. In AIM 1 we will test how peri-implant strain affects interfacial cell proliferation, angiogenesis, and osteogenic differentiation. We have adapted a miniature in vivo loading device from our previous work in mice tibiae to create a new mouse model with several unique features: 1) Complete implant instability is caused by placing a maxillary implant into an oversized hole, creating fibrous encapsulation; 2) The model allows us to stabilize this implant (using a miniature rigid I-beam bonded to adjacent teeth) to test if stabilization promotes osteogenic healing in the peri-implant space; and 3) Using I-beams designed to be stiff in the vertical direction but less stiff in the horizontal direction, we can apply known horizontal loads o deflect the beam and its attached implant by known amounts, thereby creating controlled implant micromotion and interfacial strains. Collectively, these experiments will allow us to unravel critical relationships among implant instability, interfacial strain, and osseointegration. AIM 2 asks whether a fibrous-tissue-encapsulated (loose) implant can be rescued. The answer lies in whether peri-implant cells are irreversibly specified as fibroblasts, or whether their fate can be altered. One series of tests will examine whether nano-textured implants can prevent the proliferation and differentiation of fibroblasts that can culminate in fibrous encapsulation. A second series of tests will introduce a pro-osteogenic biological signal, Wnt3, into the implant bed at the time of placement, followed by assays for Wnt responsiveness in the peri-implant space using Wnt reporter along with cell proliferation and induction of the osteogenic program. Collectively, results will provide a scientific rationale for improving osseointegration in patient in which there is inadequate bone support or sub-optimal osteogenic healing.
|
{
"pile_set_name": "NIH ExPorter"
}
| 6 |
[
{
"begin": 0,
"end": 304,
"score": 0
},
{
"begin": 304,
"end": 312,
"score": 1
},
{
"begin": 312,
"end": 1124,
"score": 0
},
{
"begin": 1124,
"end": 1127,
"score": 1
},
{
"begin": 1127,
"end": 2148,
"score": 0
},
{
"begin": 2148,
"end": 2151,
"score": 1
},
{
"begin": 2151,
"end": 2606,
"score": 0
}
] |
Q:
Compare two git repositories including all branches
I have two forks of the same git repository and I want to check whether they are absolutely identical and thus safe to delete one of them without losing any information.
While I know how to compare single branches, I want to ask whether there is a simple way to compare all branches, tags and so on.
A:
The quickest way to do this is to add a second remote and compare the output of git ls-remote for each:
diff -u <(git ls-remote --refs origin) <(git ls-remote --refs other)
The --refs option removes pseudorefs like HEAD, which may point at different branches on each remote.
You don't even need to add the remote to your local checkout; you can run something like git ls-remote https://github.com/username/repo.git.
If you see no output, the remotes are identical. If you see deletes in the diff, that corresponds to branches on origin but not on other; additions are on other but not on origin; and modifications are where that branch/tag exists on both but points at a different commit on each.
|
{
"pile_set_name": "StackExchange"
}
| 1 |
[
{
"begin": 0,
"end": 741,
"score": 0
},
{
"begin": 741,
"end": 778,
"score": 1
}
] |
The present invention relates to novel lubricating compositions and their use with refrigerants. More particularly, the present invention relates to novel lubricating compositions for use with tetrafluoroethane and preferably, 1,1,1,2-tetrafluoroethane (known in the art as R134a). R134a is a refrigerant which may replace dichlorodifluoromethane (known in the art as R12) in many applications because environmental concerns over the use of R12 exist.
R134a has been mentioned as a possible replacement for R12 because concern over potential depletion of the ozone layer exists. R12 is used in closed loop refrigeration systems; many of these systems are automotive air-conditioning systems. R134a has properties similar to those of R12 so that it is possible to substitute R134a for R12 with minimal changes in equipment being required. The symmetrical isomer of R134a is R134 (1,1,2,2-tetrafluoroethane); the isomer is also similar in properties and may also be used. Consequently, it should be understood that in the following discussion, "tetrafluoroethane" will refer to both R134 and R134a.
A unique problem arises in such a substitution. Refrigeration systems which use R-12 generally use mineral oils to lubricate the compressor; the present discussion does not apply to absorption refrigeration equipment. See for example the discussion in Chapter 32 of the 1980 ASHRAE Systems Handbook. R-12 is completely miscible with such oils throughout the entire range of refrigeration system temperatures which may range from about -45.6.degree. to 65.6.degree. C. Consequently, oil which dissolves in the refrigerant travels around the refrigeration loop and generally returns with the refrigerant to the compressor. The oil does not separate during condensation, although it may accumulate because low temperatures exist when the refrigerant is evaporated. At the same time, the oil which lubricates the compressor contains some refrigerant which may affect its lubricating property.
It is known in the industry that chlorodifluoromethane (known in the art as R22) and monochlorodifluoromethane/1-chloro-1,1,2,2,2-pentafluoroethane (known in the art as R502) are not completely miscible in common refrigeration oils. See Downing, FLUOROCARBONS REFRIGERANT HANDBOOK, p. 13. A solution to this problem has been the use of alkylated benzene oils. Such oils are immiscible in R134a and are not useful therewith. This problem is most severe at low temperatures when a separated oil layer would have a very high viscosity. Problems of oil returning to the compressor would be severe.
R134a is not miscible with mineral oils; consequently, different lubricants will be required for use with R134a. However, as mentioned above, no changes to equipment should be necessary when the refrigerant substitution is made. If the lubricant separates from the refrigerant, it is expected that serious operating problems could result. For example, the compressor could be inadequately lubricated if refrigerant replaces the lubricant. Significant problems in other equipment also could result if a lubricant phase separates from the refrigerant during condensation, expansion, or evaporation. These problems are expected to be most serious in automotive air-conditioning systems because the compressors are not separately lubricated and a mixture of refrigerant and lubricant circulates throughout the entire system.
These problems have been recognized generally in the refrigeration art. Two recent publications by ASHRAE suggest that separation of lubricants and refrigerants presents problems, although no mention is made of R134a. These articles are Kruse et al., "Fundamentals of Lubrication in Refrigeration Systems and Heat Pumps," ASHRAE TRANSACTIONS 90(2B), 763 (1984) and Spauschus, "Evaluation of Lubricants for Refrigeration and Air-Conditioning Compressors," ibid, 784.
The following discussion will be more readily understood if the mutual solubility of refrigerants and various lubricating oils is considered in general with specific reference to R134a. Small amounts of lubricants may be soluble in R134a over a wide range of temperatures, but as the concentration of the lubricant increases, the temperature range over which complete miscibility occurs, i.e., only one liquid phase is present, narrows substantially. For any composition, two consolute temperatures, i.e., a lower and a higher temperature, may exist. That is, a relatively low temperature below which two distinct liquid phases are present and above which the two phases become miscible and a higher temperature at which the single phase disappears and two phases appear again may exist. A diagram of such a system for R502 refrigerant is shown as FIG. 2 in the Kruse et al. paper mentioned above. A range of temperatures where one phase is present exists and while it would be desirable that a refrigeration system operate within such a range, it has been found that for typical compositions, the miscible range of lubricants with R134a is not wide enough to encompass the typical refrigeration temperatures.
Some disclosures which are concerned with the choice of lubricants when R134a is used as a refrigerant exist. Polyalkylene glycols were suggested to be used in Research Disclosure 17483, October 1978 by DuPont. Specific reference was made to such oils produced by Union Carbide Corporation under the trade names "ULCON" (sic) LB-165 and UCON 525. It is stated that these oils are miscible in all proportions with R134a at temperatures at least as low as -50.degree. C. It is believed that "ULCON" (sic) LB-165 and UCON 525 are polyoxypropylene glycols which have a hydroxy group at one end of each molecule and a n-butyl group at the other end.
The use of synthetic oils for refrigeration systems including polyoxyalkylene glycols is discussed by Sanvordenker et al, in a paper given at a ASHRAE Symposium, June 29, 1972. The authors made the point that polyglycols should properly be called ethers and esters rather than glycols because the terminal hydroxyl groups are bound by ester or ether groups. It is stated that this substitution makes them suitable for lubrication.
U.S. Pat. No. 4,428,854 discloses the use of R134a as an absorption refrigerant where organic solvents are used as absorbing agents. An example is tetraethylene glycol dimethyl ether. A related patent U.S. Pat. No. 4,454,052 also discloses polyethylene glycol methyl ether used as an absorbent along with certain stabilizing materials for refrigerants such as 134a.
Japanese Patent Publication 96684 dated May 30, 1985 addresses the stability problems of refrigerants. The reference teaches that perfluoro ether oligomers are one class of useful lubrication oils.
U.S. Pat. No. 4,267,064 also recommends the use of polyglycol oils, particularly for rotary compressors. It is indicated that viscosities in the range of 25-50 centistokes (CS) at 98.9.degree. C. are needed plus a viscosity index greater than 150. Many refrigerants are mentioned but not tetrafluoroethane.
Japanese Published application No. 51795 of 1982 relates to antioxidants and corrosion inhibitors for use with various polyether type synthetic oils. The tests were carried out with R-12, which does not exhibit the immiscible character of R134a.
U.S. Pat. No. 4,431,557 relates to additives used in synthetic oils. Many refrigerants are mentioned, but not tetrafluoroethane, and the patentees gave no indication of concern for miscibility of the refrigerants and the lubricants.
Commonly assigned U.S. Pat. No. 4,755,316 teaches a compression refrigeration composition. The refrigerant is tetrafluoroethane while the lubricant is at least one polyoxyalkylene glycol which is at least difunctional with respect to hydroxyl groups, has a molecular weight between 300 and 2,000, has a viscosity of about 25-150 centistokes at 37.degree. C., has a viscosity index of at least 20, and is miscible in combination with the tetrafluoroethane in the range between -40.degree. C. and at least +20.degree. C. The reference does not teach or suggest the present fluorinated lubricating compositions.
U.K. Patent 1,087,283; U.S. Pat. Nos. 3,483,129; 4,052,277; 4,118,398; 4,379,768; 4,443,349; and 4,675,452: and lnternational Publications WO 87/02992 and WO 87/02993 teach perfluorinated ethers and perfluoropolyethers as lubricants. The references do not teach the present fluorinated lubricating compositions and the references do not teach that their lubricants are useful with R134a.
Because it is expected that R134a will become widely used in the field of refrigeration and air-conditioning, new improved lubricants useful with R134a are needed in the art.
|
{
"pile_set_name": "USPTO Backgrounds"
}
| 49 |
[
{
"begin": 0,
"end": 368,
"score": 0
},
{
"begin": 368,
"end": 371,
"score": 1
},
{
"begin": 371,
"end": 441,
"score": 0
},
{
"begin": 441,
"end": 444,
"score": 1
},
{
"begin": 444,
"end": 507,
"score": 0
},
{
"begin": 507,
"end": 510,
"score": 1
},
{
"begin": 510,
"end": 579,
"score": 0
},
{
"begin": 579,
"end": 582,
"score": 1
},
{
"begin": 582,
"end": 733,
"score": 0
},
{
"begin": 733,
"end": 736,
"score": 1
},
{
"begin": 736,
"end": 784,
"score": 0
},
{
"begin": 784,
"end": 787,
"score": 1
},
{
"begin": 787,
"end": 873,
"score": 0
},
{
"begin": 873,
"end": 877,
"score": 1
},
{
"begin": 877,
"end": 1081,
"score": 0
},
{
"begin": 1081,
"end": 1085,
"score": 1
},
{
"begin": 1085,
"end": 1177,
"score": 0
},
{
"begin": 1177,
"end": 1181,
"score": 1
},
{
"begin": 1181,
"end": 1379,
"score": 0
},
{
"begin": 1379,
"end": 1386,
"score": 1
},
{
"begin": 1386,
"end": 1397,
"score": 0
},
{
"begin": 1397,
"end": 1401,
"score": 1
},
{
"begin": 1401,
"end": 2062,
"score": 0
},
{
"begin": 2062,
"end": 2065,
"score": 1
},
{
"begin": 2065,
"end": 2155,
"score": 0
},
{
"begin": 2155,
"end": 2159,
"score": 1
},
{
"begin": 2159,
"end": 2223,
"score": 0
},
{
"begin": 2223,
"end": 2230,
"score": 1
},
{
"begin": 2230,
"end": 3638,
"score": 0
},
{
"begin": 3638,
"end": 3643,
"score": 1
},
{
"begin": 3643,
"end": 3669,
"score": 0
},
{
"begin": 3669,
"end": 3680,
"score": 1
},
{
"begin": 3680,
"end": 3698,
"score": 0
},
{
"begin": 3698,
"end": 3705,
"score": 1
},
{
"begin": 3705,
"end": 3715,
"score": 0
},
{
"begin": 3715,
"end": 3720,
"score": 1
},
{
"begin": 3720,
"end": 3743,
"score": 0
},
{
"begin": 3743,
"end": 3748,
"score": 1
},
{
"begin": 3748,
"end": 3766,
"score": 0
},
{
"begin": 3766,
"end": 3775,
"score": 1
},
{
"begin": 3775,
"end": 3792,
"score": 0
},
{
"begin": 3792,
"end": 3802,
"score": 1
},
{
"begin": 3802,
"end": 3825,
"score": 0
},
{
"begin": 3825,
"end": 3841,
"score": 1
},
{
"begin": 3841,
"end": 3842,
"score": 0
},
{
"begin": 3842,
"end": 3853,
"score": 1
},
{
"begin": 3853,
"end": 4686,
"score": 0
},
{
"begin": 4686,
"end": 4690,
"score": 1
},
{
"begin": 4690,
"end": 4715,
"score": 0
},
{
"begin": 4715,
"end": 4718,
"score": 1
}
] |
People & Places
BEST LOCALLY GENERATED WEBSITE Minneapolis 2006 - cursor.org
Who can possibly keep up with all the grim news transpiring around the world these days? Civil war in Iraq, mounting bloodshed in Afghanistan, nuclear rumblings from Iran, genocide in Sudan. It's all a bit bewildering to comprehend. That's why Cursor, with its peerless cataloguing of the day's important news stories, is so valuable. The site's tireless, crackerjack staff stays up all night culling through reports of the world's latest atrocities, and assembles them in an incisive, witty, easy-to-read digest. In addition, the site's collection of links to other essential, non-mainstream websites and blogs is first rate. Also of note is Cursor's "Media Transparency" project (www.mediatransparency.com), an encyclopedic look at the country's network of conservative philanthropists and operatives. It proves that, paranoia aside, there really is a vast right-wing conspiracy.
|
{
"pile_set_name": "Pile-CC"
}
| 11 |
[
{
"begin": 0,
"end": 48,
"score": 0
},
{
"begin": 48,
"end": 59,
"score": 1
},
{
"begin": 59,
"end": 168,
"score": 0
},
{
"begin": 168,
"end": 173,
"score": 1
},
{
"begin": 173,
"end": 181,
"score": 0
},
{
"begin": 181,
"end": 185,
"score": 1
},
{
"begin": 185,
"end": 209,
"score": 0
},
{
"begin": 209,
"end": 220,
"score": 1
},
{
"begin": 220,
"end": 245,
"score": 0
},
{
"begin": 245,
"end": 249,
"score": 1
},
{
"begin": 249,
"end": 263,
"score": 0
},
{
"begin": 263,
"end": 268,
"score": 1
}
] |
Masdevallia uniflora
Masdevallia uniflora is a species of orchid endemic to Peru (Junín). It is the type species of the genus Masdevallia.
References
External links
uniflora
Category:Endemic orchids of Peru
Category:Junín Region
|
{
"pile_set_name": "Wikipedia (en)"
}
| 9 |
[
{
"begin": 0,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 33,
"score": 1
},
{
"begin": 33,
"end": 77,
"score": 0
},
{
"begin": 77,
"end": 81,
"score": 1
},
{
"begin": 81,
"end": 83,
"score": 0
},
{
"begin": 83,
"end": 88,
"score": 1
},
{
"begin": 88,
"end": 127,
"score": 0
},
{
"begin": 127,
"end": 138,
"score": 1
},
{
"begin": 138,
"end": 179,
"score": 0
}
] |
// 这个文件是 MCF 的一部分。
// 有关具体授权说明，请参阅 MCFLicense.txt。
// Copyleft 2013 - 2018, LH_Mouse. All wrongs reserved.
#include "KernelMutex.hpp"
#include "../Core/Exception.hpp"
#include <MCFCRT/env/_nt_timeout.h>
#include <ntdef.h>
#include <ntstatus.h>
extern "C" {
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtOpenEvent(HANDLE *pHandle, ACCESS_MASK dwDesiredAccess, const OBJECT_ATTRIBUTES *pObjectAttributes) noexcept;
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtCreateEvent(HANDLE *pHandle, ACCESS_MASK dwDesiredAccess, const OBJECT_ATTRIBUTES *pObjectAttributes, EVENT_TYPE eEventType, BOOLEAN bInitialState) noexcept;
typedef enum tagEventInformationClass {
EventBasicInformation,
} EVENT_INFORMATION_CLASS;
typedef struct tagEVENT_BASIC_INFORMATION {
EVENT_TYPE eEventType;
LONG lState;
} EVENT_BASIC_INFORMATION;
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtWaitForSingleObject(HANDLE hObject, BOOLEAN bAlertable, const LARGE_INTEGER *pliTimeout) noexcept;
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtQueryEvent(HANDLE hEvent, EVENT_INFORMATION_CLASS eInfoClass, void *pInfo, DWORD dwInfoSize, DWORD *pdwInfoSizeRet) noexcept;
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtSetEvent(HANDLE hEvent, LONG *plPrevState) noexcept;
__attribute__((__dllimport__, __stdcall__))
extern NTSTATUS NtResetEvent(HANDLE hEvent, LONG *plPrevState) noexcept;
__attribute__((__dllimport__, __stdcall__))
extern ULONG WINAPI RtlNtStatusToDosError(NTSTATUS lStatus) noexcept;
}
namespace MCF {
KernelMutex::KernelMutex(const WideStringView &wsvName, std::uint32_t u32Flags){
Impl_UniqueNtHandle::UniqueNtHandle hRootDirectory;
::OBJECT_ATTRIBUTES vObjectAttributes;
const auto uNameSize = wsvName.GetSize() * sizeof(wchar_t);
if(uNameSize == 0){
InitializeObjectAttributes(&vObjectAttributes, nullptr, 0, nullptr, nullptr);
} else {
if(uNameSize > USHRT_MAX){
MCF_THROW(Exception, ERROR_BUFFER_OVERFLOW, Rcntws::View(L"KernelMutex: 内核对象的路径太长。"));
}
::UNICODE_STRING ustrObjectName;
ustrObjectName.Length = (USHORT)uNameSize;
ustrObjectName.MaximumLength = (USHORT)uNameSize;
ustrObjectName.Buffer = (PWSTR)wsvName.GetBegin();
ULONG ulAttributes;
if(u32Flags & kFailIfExists){
ulAttributes = 0;
} else {
ulAttributes = OBJ_OPENIF;
}
hRootDirectory = Y_OpenBaseNamedObjectDirectory(u32Flags);
InitializeObjectAttributes(&vObjectAttributes, &ustrObjectName, ulAttributes, hRootDirectory.Get(), nullptr);
}
HANDLE hTemp;
bool bNameExists;
if(u32Flags & kDontCreate){
const auto lStatus = ::NtOpenEvent(&hTemp, EVENT_ALL_ACCESS, &vObjectAttributes);
if(!NT_SUCCESS(lStatus)){
MCF_THROW(Exception, ::RtlNtStatusToDosError(lStatus), Rcntws::View(L"KernelMutex: NtOpenEvent() 失败。"));
}
bNameExists = true;
} else {
const auto lStatus = ::NtCreateEvent(&hTemp, EVENT_ALL_ACCESS, &vObjectAttributes, SynchronizationEvent, true);
if(!NT_SUCCESS(lStatus)){
MCF_THROW(Exception, ::RtlNtStatusToDosError(lStatus), Rcntws::View(L"KernelMutex: NtCreateEvent() 失败。"));
}
bNameExists = (lStatus == STATUS_OBJECT_NAME_EXISTS);
}
x_hEvent.Reset(hTemp);
if(bNameExists){
EVENT_BASIC_INFORMATION vBasicInfo;
const auto lStatus = ::NtQueryEvent(x_hEvent.Get(), EventBasicInformation, &vBasicInfo, sizeof(vBasicInfo), nullptr);
MCF_ASSERT_MSG(NT_SUCCESS(lStatus), L"NtQueryEvent() 失败。");
if(vBasicInfo.eEventType != SynchronizationEvent){
MCF_THROW(Exception, ::RtlNtStatusToDosError(STATUS_OBJECT_TYPE_MISMATCH), Rcntws::View(L"KernelMutex: 内核事件类型不匹配。"));
}
}
}
bool KernelMutex::Try(std::uint64_t u64UntilFastMonoClock) noexcept {
::LARGE_INTEGER liTimeout;
::__MCFCRT_InitializeNtTimeout(&liTimeout, u64UntilFastMonoClock);
const auto lStatus = ::NtWaitForSingleObject(x_hEvent.Get(), false, &liTimeout);
MCF_ASSERT_MSG(NT_SUCCESS(lStatus), L"NtWaitForSingleObject() 失败。");
return lStatus != (NTSTATUS)STATUS_TIMEOUT;
}
void KernelMutex::Lock() noexcept {
const auto lStatus = ::NtWaitForSingleObject(x_hEvent.Get(), false, nullptr);
MCF_ASSERT_MSG(NT_SUCCESS(lStatus), L"NtWaitForSingleObject() 失败。");
}
void KernelMutex::Unlock() noexcept {
LONG lPrevState;
const auto lStatus = ::NtSetEvent(x_hEvent.Get(), &lPrevState);
MCF_ASSERT_MSG(NT_SUCCESS(lStatus), L"NtSetEvent() 失败。");
MCF_ASSERT_MSG(lPrevState == 0, L"互斥锁没有被任何线程锁定。");
}
}
|
{
"pile_set_name": "Github"
}
| 10 |
[
{
"begin": 0,
"end": 54,
"score": 0
},
{
"begin": 54,
"end": 62,
"score": 1
},
{
"begin": 62,
"end": 1994,
"score": 0
},
{
"begin": 1994,
"end": 2008,
"score": 1
},
{
"begin": 2008,
"end": 2773,
"score": 0
},
{
"begin": 2773,
"end": 2787,
"score": 1
},
{
"begin": 2787,
"end": 3059,
"score": 0
},
{
"begin": 3059,
"end": 3073,
"score": 1
},
{
"begin": 3073,
"end": 3413,
"score": 0
},
{
"begin": 3413,
"end": 3414,
"score": 1
},
{
"begin": 3414,
"end": 3568,
"score": 0
}
] |
Bacterial community structure corresponds to performance during cathodic nitrate reduction.
Microbial fuel cells (MFCs) have applications other than electricity production, including the capacity to power desirable reactions in the cathode chamber. However, current knowledge of the microbial ecology and physiology of biocathodes is minimal, and as a result more research dedicated to understanding the microbial communities active in cathode biofilms is required. Here we characterize the microbiology of denitrifying bacterial communities stimulated by reducing equivalents generated from the anodic oxidation of acetate. We analyzed biofilms isolated from two types of cathodic denitrification systems: (1) a loop format where the effluent from the carbon oxidation step in the anode is subjected to a nitrifying reactor which is fed to the cathode chamber and (2) an alternative non-loop format where anodic and cathodic feed streams are separated. The results of our study indicate the superior performance of the loop reactor in terms of enhanced current production and nitrate removal rates. We hypothesized that phylogenetic or structural features of the microbial communities could explain the increased performance of the loop reactor. We used PhyloChip with 16S rRNA (cDNA) and fluorescent in situ hybridization to characterize the active bacterial communities. Our study results reveal a greater richness, as well as an increased phylogenetic diversity, active in denitrifying biofilms than was previously identified in cathodic systems. Specifically, we identified Proteobacteria, Firmicutes and Chloroflexi members that were dominant in denitrifying cathodes. In addition, our study results indicate that it is the structural component, in terms of bacterial richness and evenness, rather than the phylogenetic affiliation of dominant bacteria, that best corresponds to cathode performance.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 4 |
[
{
"begin": 0,
"end": 1270,
"score": 0
},
{
"begin": 1270,
"end": 1273,
"score": 1
},
{
"begin": 1273,
"end": 1579,
"score": 0
},
{
"begin": 1579,
"end": 1593,
"score": 1
},
{
"begin": 1593,
"end": 1595,
"score": 0
}
] |
We got sent a sexy home-made vid of some slutty Europeans on vacation. Watch this Slavic slut get fucked in fur boots in the mountains. She likes to get dirty right there on a public lookout, and doesn't care who's watching.
|
{
"pile_set_name": "Pile-CC"
}
| 2 |
[
{
"begin": 0,
"end": 48,
"score": 0
},
{
"begin": 48,
"end": 57,
"score": 1
},
{
"begin": 57,
"end": 82,
"score": 0
}
] |
Verbascum blattaria
Verbascum blattaria, or moth mullein, is a flowering biennial weed belonging to the Scrophulariaceae (figwort) family. An invasive species native to Eurasia and North Africa, it has naturalized in the United States and most of Canada since its introduction. It has been declared a noxious weed by the state of Colorado.
Alternative names
Verbascum blattaria is more commonly referred to as the moth mullein, so named because of the resemblance of its flowers' stamen to a moth’s antennae. This is not to be confused with the more popular and widely known common mullein (V. thapsus), a close relative of V. blattaria.
Description
The moth mullein is a biennial plant. In its first year of growth, its leaves develop as a basal rosette. During this first year, the stem of the plant remains extremely short. The leaves of the rosette are oblanceolate with deeply toothed edges and are attached to the stem by short petioles. The rosette can grow to a diameter of 16 in (40 cm) during this first year, with each individual leaf reaching a length up to 8 in. The mullein forms a fibrous root system with a deep taproot.
In the second year of growth, the stem of the mullein grows slender and erect, and can reach a height of 1½ to 3 ft. This length of stem is commonly referred to as the flowering stem. It usually grows unbranched, and leaves grow alternatively directly off the stem. The leaves located on the flowering stem are similar to the leaves of the rosette; however, they tend to be smaller and elliptical with shallow-toothed edges and have sharply pointed tips. These leaves can reach a length of 5 in. Both the leaves of the rosette and the leaves of the flowering stem are dark green in color and glabrous (hairless).
The flowers of the moth mullein are produced during the second year of growth on a loose raceme. Each flower is attached individually to the flowering stem by a pedicel. Each pedicel typically reaches a length less than 1 in. The flowers of the mullein consist of five petals and five anther-bearing stamens, and each flower can reach a diameter of 1 in (25 mm). The flowers can be either yellow or white and typically have a slight purple tinge. The stamens of the flower are orange in color and are covered in purple hairs, reminiscent to a moth’s antennae. The flowers of the mullein bloom between June and October of the second year.
The moth mullein grows a small, simple fruit that is spherical in shape and has a diameter less than 0.5 in. Each fruit is dark brown in color and contains numerous dark brown seeds. The fruit of the mullein develops, matures, and falls from the plant all in the second year of growth. In certain regions of the world, finches have been known to consume and distribute the seeds.
Distribution
A native of Europe, Asia, and North Africa, the moth mullein has naturalized in most of North America since its introduction. It was first recorded in Pennsylvania in 1818, and was recorded in Michigan in 1840. It has since been found in almost every one of the continental United States, as well as in southern Canada and even Hawaii. In the United States, it is found most abundantly along the East Coast.
Though having a wide range of habitats, the mullein is typically found in open fields such as pastures and meadows. It can also found in open woods. The moth mullein prefers rich soils, but is tolerant of dry, sandy, and even gravelly soils.
Uses and viability
Even in folk medicine, V. blattaria has not been attributed to a wide range of uses. However, a study conducted in 1974 reported that when a number of Aedes aegypti mosquito larvae were exposed to a methanol extract of moth mullein, at least 53% of the larvae were killed. V. blattaria has also long been known to be an effective cockroach repellent, and the name blattaria is actually derived from the Latin word for cockroach, blatta.
In a famous long-term experiment, Dr. William James Beal, then a professor of botany at Michigan Agriculture College, selected seeds of 21 different plant species (including V. blattaria) and placed seeds of each in 20 separate bottles filled with sand. The bottles, left uncorked, were buried mouth down (so as not to allow moisture to reach the seeds) in a sandy knoll in 1879. The purpose of this experiment was to determine how long the seeds could be buried dormant in the soil, and yet germinate in the future when planted. In 2000, one of these bottles was dug up, and 23 seeds of V. blattaria were planted in favorable conditions, yielding a 50% germination rate.
References
External links
Verbascum : the most complete source
Jepson Manual Treatment
Washington Burke Museum
Photo gallery
blattaria
Category:Plants described in 1753
Category:Flora of Europe
Category:Flora of North Africa
Category:Flora of temperate Asia
|
{
"pile_set_name": "Wikipedia (en)"
}
| 54 |
[
{
"begin": 0,
"end": 9,
"score": 1
},
{
"begin": 9,
"end": 21,
"score": 0
},
{
"begin": 21,
"end": 30,
"score": 1
},
{
"begin": 30,
"end": 105,
"score": 0
},
{
"begin": 105,
"end": 121,
"score": 1
},
{
"begin": 121,
"end": 170,
"score": 0
},
{
"begin": 170,
"end": 177,
"score": 1
},
{
"begin": 177,
"end": 182,
"score": 0
},
{
"begin": 182,
"end": 187,
"score": 1
},
{
"begin": 187,
"end": 188,
"score": 0
},
{
"begin": 188,
"end": 194,
"score": 1
},
{
"begin": 194,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 228,
"score": 1
},
{
"begin": 228,
"end": 229,
"score": 0
},
{
"begin": 229,
"end": 235,
"score": 1
},
{
"begin": 235,
"end": 248,
"score": 0
},
{
"begin": 248,
"end": 254,
"score": 1
},
{
"begin": 254,
"end": 331,
"score": 0
},
{
"begin": 331,
"end": 339,
"score": 1
},
{
"begin": 339,
"end": 360,
"score": 0
},
{
"begin": 360,
"end": 369,
"score": 1
},
{
"begin": 369,
"end": 641,
"score": 0
},
{
"begin": 641,
"end": 652,
"score": 1
},
{
"begin": 652,
"end": 2363,
"score": 0
},
{
"begin": 2363,
"end": 2367,
"score": 1
},
{
"begin": 2367,
"end": 2372,
"score": 0
},
{
"begin": 2372,
"end": 2379,
"score": 1
},
{
"begin": 2379,
"end": 2783,
"score": 0
},
{
"begin": 2783,
"end": 2795,
"score": 1
},
{
"begin": 2795,
"end": 2808,
"score": 0
},
{
"begin": 2808,
"end": 2814,
"score": 1
},
{
"begin": 2814,
"end": 2816,
"score": 0
},
{
"begin": 2816,
"end": 2820,
"score": 1
},
{
"begin": 2820,
"end": 2826,
"score": 0
},
{
"begin": 2826,
"end": 2831,
"score": 1
},
{
"begin": 2831,
"end": 2832,
"score": 0
},
{
"begin": 2832,
"end": 2838,
"score": 1
},
{
"begin": 2838,
"end": 2884,
"score": 0
},
{
"begin": 2884,
"end": 2889,
"score": 1
},
{
"begin": 2889,
"end": 2890,
"score": 0
},
{
"begin": 2890,
"end": 2897,
"score": 1
},
{
"begin": 2897,
"end": 2947,
"score": 0
},
{
"begin": 2947,
"end": 2959,
"score": 1
},
{
"begin": 2959,
"end": 2989,
"score": 0
},
{
"begin": 2989,
"end": 2997,
"score": 1
},
{
"begin": 2997,
"end": 3070,
"score": 0
},
{
"begin": 3070,
"end": 3076,
"score": 1
},
{
"begin": 3076,
"end": 3077,
"score": 0
},
{
"begin": 3077,
"end": 3083,
"score": 1
},
{
"begin": 3083,
"end": 3108,
"score": 0
},
{
"begin": 3108,
"end": 3114,
"score": 1
},
{
"begin": 3114,
"end": 3124,
"score": 0
},
{
"begin": 3124,
"end": 3130,
"score": 1
},
{
"begin": 3130,
"end": 3139,
"score": 0
},
{
"begin": 3139,
"end": 3145,
"score": 1
}
] |
Successful surgical management for aortic and mitral stenosis in homozygous familial hypercholesterolemia: a case report.
A 72-year-old woman with a known history of homozygous familial hyperlipidemia (IIa) was referred to our hospital for an operation necessitated by aortic and mitral stenosis and paroxysmal atrial fibrillation. Computed tomography and cardiac catheterization revealed a heavily calcified aortic root and mitral annulus as well as a high-grade stenosis of the left anterior descending and right coronary arteries. Double aortic and mitral valve replacement concomitant with replacement of ascending aorta, maze III procedure, and coronary artery bypass were performed. Temporary hypothermic arrest was employed to reduce the risk of cerebral emboli.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 2 |
[
{
"begin": 0,
"end": 534,
"score": 0
},
{
"begin": 534,
"end": 540,
"score": 1
},
{
"begin": 540,
"end": 631,
"score": 0
}
] |
ul.nav ul {
list-style:none;
margin: 0;
padding: 0 0 0 25px;
}
#downloader_application form {
margin-bottom: 10px;
}
#downloader_application ul {
list-style-type: none;
}
.browser_support th {
border-bottom-width: 3px !important;
}
.support_ie {border-bottom-color: #0275BA !important;}
.support_ff {border-bottom-color: #DF7215 !important;}
.support_sf {border-bottom-color: #43B3E9 !important;}
.support_cr {border-bottom-color: #39B642 !important;}
.support_op {border-bottom-color: #C42122 !important;}
.support_nd {border-bottom-color: #8CC84B !important;}
|
{
"pile_set_name": "Github"
}
| 3 |
[
{
"begin": 0,
"end": 393,
"score": 0
},
{
"begin": 393,
"end": 399,
"score": 1
},
{
"begin": 399,
"end": 448,
"score": 0
},
{
"begin": 448,
"end": 454,
"score": 1
}
] |
Mahalo for supporting Honolulu Star-Advertiser. Enjoy this free story!
A state judge Friday said he was inclined to grant a new trial in the civil dispute between Katherine Kealoha and her grandmother and uncle, but the case needs to be sent back from an appellate court before the judge can do so, according to the attorney for the Kealoha relatives. Read more
A state judge Friday said he was inclined to grant a new trial in the civil dispute between Katherine Kealoha and her grandmother and uncle, but the case needs to be sent back from an appellate court before the judge can do so, according to the attorney for the Kealoha relatives.
Circuit Judge James McWhinnie at a hearing indicated he was inclined to grant a motion by Florence Puana, Kealoha’s grand- mother, and Puana’s son Gerard for a new trial but couldn’t do so while the case was before the Intermediate Court of Appeals, according to Gerald Kurashima, attorney for the Puanas.
The Puanas are appealing a 2015 jury verdict that awarded Kealoha more than $650,000 in damages following a trial for a 2013 lawsuit the Puanas filed against Kealoha, a former deputy prosecutor. They accused her of stealing hundreds of thousands of dollars from them.
Kealoha recently was convicted of conspiracy and obstruction of justice in a federal criminal trial, and evidence that U.S. prosecutors produced during that proceeding was cited by Kurashima in his motion to argue for a new trial.
Kealoha; her husband, former Honolulu Police Chief Louis Kealoha; and two police officers were convicted in the federal case of trying to frame Gerard Puana in the alleged 2013 theft of the Kealohas’ mailbox and then lying to federal authorities about their actions.
The 2013 lawsuit that the Puanas filed against Katherine Kealoha was a motive for the Kealohas to try to frame Puana, federal prosecutors said.
Kurashima said new evidence presented in the federal case showed Kealoha, who is an attorney, lied when she testified in the civil trial that she did not prepare or recognize a trust document in Puana’s name.
Under the rules of civil procedures, an attorney who perjures him or herself commits a “fraud upon the court,” which warrants a new trial, Kurashima argued in his motion.
The motion was filed in Circuit Court because that court can hear new evidence while the appellate panel can consider only what happened leading up to the verdict.
Kurashima said McWhinnie agreed that a fraud upon the court was committed but could not order a new trial with the appeal still pending.
Kevin Sumida, who was Kealoha’s attorney in the civil case, argued at Friday’s hearing that Kealoha’s testimony did not constitute a fraud upon the court, according to Kurashima.
Sumida could not be reached for comment.
|
{
"pile_set_name": "OpenWebText2"
}
| 59 |
[
{
"begin": 0,
"end": 6,
"score": 1
},
{
"begin": 6,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 30,
"score": 1
},
{
"begin": 30,
"end": 31,
"score": 0
},
{
"begin": 31,
"end": 46,
"score": 1
},
{
"begin": 46,
"end": 86,
"score": 0
},
{
"begin": 86,
"end": 92,
"score": 1
},
{
"begin": 92,
"end": 164,
"score": 0
},
{
"begin": 164,
"end": 173,
"score": 1
},
{
"begin": 173,
"end": 174,
"score": 0
},
{
"begin": 174,
"end": 181,
"score": 1
},
{
"begin": 181,
"end": 334,
"score": 0
},
{
"begin": 334,
"end": 341,
"score": 1
},
{
"begin": 341,
"end": 353,
"score": 0
},
{
"begin": 353,
"end": 357,
"score": 1
},
{
"begin": 357,
"end": 378,
"score": 0
},
{
"begin": 378,
"end": 384,
"score": 1
},
{
"begin": 384,
"end": 456,
"score": 0
},
{
"begin": 456,
"end": 465,
"score": 1
},
{
"begin": 465,
"end": 466,
"score": 0
},
{
"begin": 466,
"end": 473,
"score": 1
},
{
"begin": 473,
"end": 626,
"score": 0
},
{
"begin": 626,
"end": 633,
"score": 1
},
{
"begin": 633,
"end": 646,
"score": 0
},
{
"begin": 646,
"end": 653,
"score": 1
},
{
"begin": 653,
"end": 654,
"score": 0
},
{
"begin": 654,
"end": 659,
"score": 1
},
{
"begin": 659,
"end": 660,
"score": 0
},
{
"begin": 660,
"end": 665,
"score": 1
},
{
"begin": 665,
"end": 736,
"score": 0
},
{
"begin": 736,
"end": 744,
"score": 1
},
{
"begin": 744,
"end": 745,
"score": 0
},
{
"begin": 745,
"end": 750,
"score": 1
},
{
"begin": 750,
"end": 752,
"score": 0
},
{
"begin": 752,
"end": 759,
"score": 1
},
{
"begin": 759,
"end": 782,
"score": 0
},
{
"begin": 782,
"end": 787,
"score": 1
},
{
"begin": 787,
"end": 794,
"score": 0
},
{
"begin": 794,
"end": 800,
"score": 1
},
{
"begin": 800,
"end": 866,
"score": 0
},
{
"begin": 866,
"end": 878,
"score": 1
},
{
"begin": 878,
"end": 879,
"score": 0
},
{
"begin": 879,
"end": 884,
"score": 1
},
{
"begin": 884,
"end": 888,
"score": 0
},
{
"begin": 888,
"end": 895,
"score": 1
},
{
"begin": 895,
"end": 910,
"score": 0
},
{
"begin": 910,
"end": 916,
"score": 1
},
{
"begin": 916,
"end": 917,
"score": 0
},
{
"begin": 917,
"end": 926,
"score": 1
},
{
"begin": 926,
"end": 945,
"score": 0
},
{
"begin": 945,
"end": 951,
"score": 1
},
{
"begin": 951,
"end": 958,
"score": 0
},
{
"begin": 958,
"end": 964,
"score": 1
},
{
"begin": 964,
"end": 1012,
"score": 0
},
{
"begin": 1012,
"end": 1019,
"score": 1
},
{
"begin": 1019,
"end": 1091,
"score": 0
},
{
"begin": 1091,
"end": 1097,
"score": 1
},
{
"begin": 1097,
"end": 1112,
"score": 0
},
{
"begin": 1112,
"end": 1119,
"score": 1
},
{
"begin": 1119,
"end": 1223,
"score": 0
}
] |
Q:
What's the default value for maven-surefire-plugin's forkedProcessTimeoutInSeconds?
forkedProcessTimeoutInSeconds can be set to 0 in order to prevent forked test VMs from being assumed dead after the specified time. What's the default value for this property?
The documentation doesn't specify it, the XML autocompletion in NetBeans says undefined which doesn't make sense because only setting it to a specified value or 0 does. A superficial look in the code shows that the value must be set outside the class where it's defined.
It's not overly important to figure this out, I more want to make sure that I'm getting the forking process right and can suggest improvement.
A:
Because the forkedProcessTimeoutInSeconds is a primitive int it will default to 0 itself. Any value > 0 set via the properties will cause the ForkClient to set a timeout of that value in ms.
|
{
"pile_set_name": "StackExchange"
}
| 0 |
[
{
"begin": 0,
"end": 877,
"score": 0
}
] |
Q:
Logging Key Error while using 'extra'
I have a simple logging setup as:
extra = {'hostname': socket.gethostname(), 'ip': socket.gethostbyname(socket.gethostname()), 'user': getpass.getuser()}
def get_logger():
logging.basicConfig(
format='%(asctime)s # %(user)s # %(hostname)s # %(ip)s # %(message)s',
datefmt='%m/%d/%Y %I:%M:%S')
crawler_logger = logging.getLogger("crawler")
crawler_logger.setLevel(logging.INFO)
crawler_logger = logging.LoggerAdapter(crawler_logger, extra)
return crawler_logger
And I'm using this setup in all my logs. Some examples:
logger.warning("Harmful URL # Potentially harmful url # %s" % url["url"])
logger.info("URL already exists: %s ", url_dict["url"])
logger.error("ERROR # ERROR while crawling url. %s" % e)
But whenever an error occurs from any of the libraries I use (aiokafka for instance) my code throws a "Logging Error" with KeyError: 'user' even though the 'user' key exists and valued in the extra dictionary.
A stacktrace of the error:
--- Logging error ---
Traceback (most recent call last):
File "/usr/lib/python3.6/logging/__init__.py", line 992, in emit
msg = self.format(record)
File "/usr/lib/python3.6/logging/__init__.py", line 838, in format
return fmt.format(record)
File "/usr/lib/python3.6/logging/__init__.py", line 578, in format
s = self.formatMessage(record)
File "/usr/lib/python3.6/logging/__init__.py", line 547, in formatMessage
return self._style.format(record)
File "/usr/lib/python3.6/logging/__init__.py", line 391, in format
return self._fmt % record.__dict__
KeyError: 'user'
I couldn't find any solutions so asking here.
A:
Fixed by setting Logger formatter for only my custom loggers, before i was (unknowingly) setting the logger format for all loggers like this:
logging.basicConfig(
format='%(asctime)s # %(user)s # %(hostname)s # %(ip)s # %(message)s',
datefmt='%m/%d/%Y %I:%M:%S')
Fixed version:
extra = {'hostname': socket.gethostname(), 'ip': socket.gethostbyname(socket.gethostname()), 'user': getpass.getuser()}
def get_logger():
app_logger = logging.getLogger(__name__)
handler = logging.StreamHandler()
handler.setLevel(logging.INFO)
formatter = logging.Formatter('%(asctime)s # %(user)s # %(hostname)s # %(ip)s # %(message)s',
datefmt='%d/%m/%Y %I:%M:%S')
handler.setFormatter(formatter)
app_logger.addHandler(handler)
app_logger.setLevel(logging.INFO)
app_logger = logging.LoggerAdapter(app_logger, extra)
return app_logger
|
{
"pile_set_name": "StackExchange"
}
| 5 |
[
{
"begin": 0,
"end": 12,
"score": 0
},
{
"begin": 12,
"end": 15,
"score": 1
},
{
"begin": 15,
"end": 16,
"score": 0
},
{
"begin": 16,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 900,
"score": 0
},
{
"begin": 900,
"end": 905,
"score": 1
}
] |
Q:
Run time error using Jeffrey Way's Generator with Composer
I am using Jeffrey Way's Generator. The generator is installed successfully, however when I run the following commands, I get the error:
php artisan generate:migration create_departments_table department:string
php artisan generate:migration create_roles_table department_id:integer role:string
php artisan generate:migration create_transactions_table department_id:integer main_menu:string menu_text:string address:string
php artisan generate:migration create_rolestransactions_table role_id:integer transaction_id:integer status:integer
php artisan generate:migration create_userlogs_table user_id:integer user:string department:string transaction:string dateandtime:timestamp
not working [RuntimeException]
Too many arguments.
generate:migration [--fields[="..."]] [--path[="..."]] [--templatePath[="..."]] [-- testing[="..."]] migrationName
Why would I be getting this error?
A:
Compare this code from the documentation:
php artisan generate:migration create_posts_table --fields="title:string, body:text"
To the command you try to execute:
php artisan generate:migration create_userlogs_table user_id:integer user:string department:string transaction:string dateandtime:timestamp
Your command has 6 arguments: the database name and 5 fields
The command from the docs has 1 argument and 1 option: the database name as argument and the --fields option listing all fields
|
{
"pile_set_name": "StackExchange"
}
| 5 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 7,
"score": 1
},
{
"begin": 7,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 32,
"score": 1
},
{
"begin": 32,
"end": 39,
"score": 0
},
{
"begin": 39,
"end": 48,
"score": 1
}
] |
package example.packt.com.dynamicregisterapp.client;
import android.support.annotation.NonNull;
import example.packt.com.dynamicregisterapp.client.oauth2.AuthorizationRequest;
import example.packt.com.dynamicregisterapp.client.registration.ClientCredentials;
import example.packt.com.dynamicregisterapp.client.registration.ClientRegistrationRequest;
import example.packt.com.dynamicregisterapp.client.registration.ClientRegistrationResponse;
import retrofit2.Call;
import retrofit2.Callback;
import retrofit2.Response;
public class ClientRegistrationService {
public void registerClient(final OnClientRegistrationResult registrationResult) {
ClientRegistrationRequest request = new ClientRegistrationRequest();
request.setScope("read_profile");
request.setClientName("android-app");
request.setClientUri("http://adolfoeloy.com.br/en");
request.setSoftwareId("android-packt");
request.getGrantTypes().add("authorization_code");
request.getRedirectUris().add(AuthorizationRequest.REDIRECT_URI);
Call<ClientRegistrationResponse> call = ClientAPI.registration().register(request);
call.enqueue(new Callback<ClientRegistrationResponse>() {
@Override
public void onResponse(Call<ClientRegistrationResponse> call,
Response<ClientRegistrationResponse> response) {
ClientRegistrationResponse credentialsResponse = response.body();
registrationResult.onSuccessfulClientRegistration(
createClientCredentials(credentialsResponse));
}
@Override
public void onFailure(Call<ClientRegistrationResponse> call, Throwable t) {
registrationResult.onFailedClientRegistration(
"Failed on trying to register client", t);
}
});
}
@NonNull
private ClientCredentials createClientCredentials(
ClientRegistrationResponse credentialsResponse) {
ClientCredentials credentials = new ClientCredentials();
credentials.setClientId(credentialsResponse.getClientId());
credentials.setClientSecret(credentialsResponse.getClientSecret());
return credentials;
}
}
|
{
"pile_set_name": "Github"
}
| 6 |
[
{
"begin": 0,
"end": 846,
"score": 0
},
{
"begin": 846,
"end": 873,
"score": 1
},
{
"begin": 873,
"end": 1229,
"score": 0
},
{
"begin": 1229,
"end": 1238,
"score": 1
},
{
"begin": 1238,
"end": 1620,
"score": 0
},
{
"begin": 1620,
"end": 1629,
"score": 1
},
{
"begin": 1629,
"end": 1703,
"score": 0
}
] |
Q:
Ninject 3 in WebForms
I'm getting an the following error when I try and start my WebForms application, with Ninject.Web (v3) installed.
"The static container already has a kernel associated with it!"
I'm implementing Ninject in Global.asax inheriting from NinjectHttpApplication and overriding CreateKernel() with my module being in the following form
public class NinjectWebModule: NinjectModule
{
public override void Load()
{
Bind<IBlah>().To<Blah>();
}
}
I basically followed the setup advice contained How can I implement Ninject or DI on asp.net Web Forms?
The yellow screen of pain says
[NotSupportedException: The static container already has a kernel associated with it!]
Ninject.Web.KernelContainer.set_Kernel(IKernel value) in c:\Projects\Ninject\ninject.web\src\Ninject.Web\KernelContainer.cs:38
Ninject.Web.NinjectWebHttpApplicationPlugin.Start() in c:\Projects\Ninject\ninject.web\src\Ninject.Web\NinjectWebHttpApplicationPlugin.cs:62
Ninject.Web.Common.Bootstrapper.<Initialize>b__0(INinjectHttpApplicationPlugin c) in c:\Projects\Ninject\Ninject.Web.Common\src\Ninject.Web.Common\Bootstrapper.cs:52
Ninject.Infrastructure.Language.ExtensionsForIEnumerableOfT.Map(IEnumerable`1 series, Action`1 action) in c:\Projects\Ninject\ninject\src\Ninject\Infrastructure\Language\ExtensionsForIEnumerableOfT.cs:32
Ninject.Web.Common.Bootstrapper.Initialize(Func`1 createKernelCallback) in c:\Projects\Ninject\Ninject.Web.Common\src\Ninject.Web.Common\Bootstrapper.cs:52
Ninject.Web.Common.NinjectHttpApplication.Application_Start() in c:\Projects\Ninject\Ninject.Web.Common\src\Ninject.Web.Common\NinjectHttpApplication.cs:80
[HttpException (0x80004005): The static container already has a kernel associated with it!]
System.Web.HttpApplicationFactory.EnsureAppStartCalledForIntegratedMode(HttpContext context, HttpApplication app) +9859725
System.Web.HttpApplication.RegisterEventSubscriptionsWithIIS(IntPtr appContext, HttpContext context, MethodInfo[] handlers) +118
System.Web.HttpApplication.InitSpecial(HttpApplicationState state, MethodInfo[] handlers, IntPtr appContext, HttpContext context) +172
System.Web.HttpApplicationFactory.GetSpecialApplicationInstance(IntPtr appContext, HttpContext context) +336
System.Web.Hosting.PipelineRuntime.InitializeApplication(IntPtr appContext) +296
[HttpException (0x80004005): The static container already has a kernel associated with it!]
System.Web.HttpRuntime.FirstRequestInit(HttpContext context) +9873912
System.Web.HttpRuntime.EnsureFirstRequestInit(HttpContext context) +101
System.Web.HttpRuntime.ProcessRequestNotificationPrivate(IIS7WorkerRequest wr, HttpContext context) +254
Any ideas?
A:
Doh! Installing Ninject.Web (v3) adds an App_Start folder with NinjectWebCommon.cs
This is where you register your bindings and not in the Global.asax
|
{
"pile_set_name": "StackExchange"
}
| 53 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 113,
"score": 0
},
{
"begin": 113,
"end": 120,
"score": 1
},
{
"begin": 120,
"end": 121,
"score": 0
},
{
"begin": 121,
"end": 124,
"score": 1
},
{
"begin": 124,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 229,
"score": 1
},
{
"begin": 229,
"end": 577,
"score": 0
},
{
"begin": 577,
"end": 584,
"score": 1
},
{
"begin": 584,
"end": 602,
"score": 0
},
{
"begin": 602,
"end": 605,
"score": 1
},
{
"begin": 605,
"end": 606,
"score": 0
},
{
"begin": 606,
"end": 611,
"score": 1
},
{
"begin": 611,
"end": 734,
"score": 0
},
{
"begin": 734,
"end": 741,
"score": 1
},
{
"begin": 741,
"end": 742,
"score": 0
},
{
"begin": 742,
"end": 745,
"score": 1
},
{
"begin": 745,
"end": 803,
"score": 0
},
{
"begin": 803,
"end": 810,
"score": 1
},
{
"begin": 810,
"end": 827,
"score": 0
},
{
"begin": 827,
"end": 834,
"score": 1
},
{
"begin": 834,
"end": 835,
"score": 0
},
{
"begin": 835,
"end": 838,
"score": 1
},
{
"begin": 838,
"end": 864,
"score": 0
},
{
"begin": 864,
"end": 871,
"score": 1
},
{
"begin": 871,
"end": 872,
"score": 0
},
{
"begin": 872,
"end": 875,
"score": 1
},
{
"begin": 875,
"end": 931,
"score": 0
},
{
"begin": 931,
"end": 938,
"score": 1
},
{
"begin": 938,
"end": 955,
"score": 0
},
{
"begin": 955,
"end": 962,
"score": 1
},
{
"begin": 962,
"end": 963,
"score": 0
},
{
"begin": 963,
"end": 966,
"score": 1
},
{
"begin": 966,
"end": 1008,
"score": 0
},
{
"begin": 1008,
"end": 1015,
"score": 1
},
{
"begin": 1015,
"end": 1016,
"score": 0
},
{
"begin": 1016,
"end": 1019,
"score": 1
},
{
"begin": 1019,
"end": 1105,
"score": 0
},
{
"begin": 1105,
"end": 1112,
"score": 1
},
{
"begin": 1112,
"end": 1113,
"score": 0
},
{
"begin": 1113,
"end": 1120,
"score": 1
},
{
"begin": 1120,
"end": 1121,
"score": 0
},
{
"begin": 1121,
"end": 1124,
"score": 1
},
{
"begin": 1124,
"end": 1136,
"score": 0
},
{
"begin": 1136,
"end": 1143,
"score": 1
},
{
"begin": 1143,
"end": 1144,
"score": 0
},
{
"begin": 1144,
"end": 1147,
"score": 1
},
{
"begin": 1147,
"end": 1177,
"score": 0
},
{
"begin": 1177,
"end": 1184,
"score": 1
},
{
"begin": 1184,
"end": 1263,
"score": 0
},
{
"begin": 1263,
"end": 1271,
"score": 1
},
{
"begin": 1271,
"end": 1295,
"score": 0
},
{
"begin": 1295,
"end": 1302,
"score": 1
}
] |
În timpul protestelor din această toamnă, au existat mai multe tipologii care și-au făcut apariția în Piața Universității și în marșurile prin cartierele Capitalei. Cu riscul de a apela la șabloane și fără pretenția că acestea sunt definitorii pentru protestele care au încă loc, iată câteva dintre ele.
Hipsterul:
Apariția sa la un protest a constituit în sine o surpriză, pentru că hipsterul nu este interesat de treburile curente ale zilei, fie că este vorba despre mersul politicii, al societății sau al economiei. Conectat la ultimele tehnologii și trenduri online, hipsterul este mai interesat de obicei de cultivarea propriei imagini și a propriilor pasiuni, neînțelese sau neauzite de cei catalogați drept mainstream – adică marele public. De aici și inundația de poze de la proteste, postate pe Facebook. Unele guri rele spun că, uneori, pe traseele marșurilor sau în Piața Universității, rețelele de internet mobil se blocau, pentru că majoritatea protestatarilor erau preocupați să posteze pe Facebook statusuri despre ei înșiși sau poze cu ei înșiși la protest (selfies).
Hipsterul este în esență o persoană cu studii superioare, educată și cultivată, dar care poate fi considerată cu ușurință cu capul în nori în ce privește aspectele pragmatice ale societății în care trăiește. Putând fi recunoscut după felul în care se îmbracă, chiar dacă nu este o „uniformă” de tipul celor purtate de rockeri sau rapperi, hipsterul-clișeu are haine retro-cool-chic-tocilar, teniși sau derivate ale acestora în picioare, ochelari cu rame groase, și freze cât mai asimetrice sau, dimpotrivă, studiat-clasice. E greu să îl descrii și totuși atât de ușor de recunoscut pe stradă. Nu va recunoaște în veci că este hipster, aceasta fiind regula de căpătâi a hipsterilor. Lucrează de obicei în domenii liberale sau artistice, iar uneori este pur și simplu șomer. Banii nu sunt definitorii pentru el, însă de obicei nu suferă de nevoi stringente.
Cineva ar putea presupune că hipsterii au fost animați de acest protest pentru că a fost declanșat pe o temă de nișă în societatea românească – ecologia, dar și poate pentru că promotorii acestui protest sunt hipsteri sau au tendințe de hipster.
Activistul:
Personaje de linia întâi, cei care au ținut în viață acest protest weekend de weekend, cei care s-au preocupat ca mesajele să devină coerente, vizibile și memorabile, dar și ca tacticile de gherilă urbană să fie aplicate de masa de manifestanți. Activiștii implicați în aceste proteste provin din mai multe domenii, iar problema Roșia Montană i-a adus pe toți sub același stindard.
Activiștii s-au antrenat în societatea civilă de mai mulți ani, unii pentru a contracara exploatarea minieră de la Roșia Montană, alții pentru a cultiva spiritul protestului la români, ca exercițiu al democrației, alții pentru protejarea ariilor urbane sau a patrimoniului. Declicul provocat de Guvernul Ponta a constituit momentul în care masa critică a fost atinsă – nici unul dintre ei nu reușise până atunci să urnească în stradă sau în dezbateri atâția oameni.
Anticapitalistul de multinațională
Fost sau actual angajat al unei multinaționale sau companii mari, acest tip de personaj suferă de un conflict lăuntric. Scârbit de practicile dure, imorale ale multor companii, el a ajuns să le confunde cu însuși conceptul de capitalism. Deși se bucură din plin de binefacerile tehnologiei sau vestimentației produse de astfel de corporații sau multinaționale, el le urăște deopotrivă. Uneori, acest tip este și hipster.
Extrema acestei tipologii a putut fi observată în Piață, cu bannere pe care scria „Jos capitalismul” sau alte mesaje cu iz marxist. O variantă a acestei tipologii este și marxistul de lume nouă, etichetat de unii de-a dreptul comunist. Toate aceste variațiuni pe aceeași temă anticapitalistă, mai mult sau mai puțin asumate ideologic, au fost ațâțate de tema protestului: o corporație cu practici veroase, care a venit în România să pună mâna pe o resursă imensă, în același timp corupând statul.
Ecologistul:
Această tipologie subsumează toate persoanele care cred, argumentat sau nu, că o exploatare minieră bazată pe cianuri și o exploatare de gaze naturale bazată pe fracturare hidraulică sunt automat dezastre pentru mediul înconjurător. De obicei, contra-argumentele nu au loc într-o discuție cu ei, pentru că sunt convinși definitiv de ceea ce spun. Varianta moderată a ecologistului, o pasăre rară, este în stare să accepte că, dacă statul sau o autoritate independentă ar fi atât de puternice în a controla la sânge standardele de mediu aplicate de companiile care fac aceste tipuri de exploatare, riscul pentru mediu ar fi redus aproape de zero.
Ecologiști fără să își dea seama sunt și tinerii, destul de numeroși, care au luat parte la proteste și care apreciază curentul muzical electronic psy și filozofiile care au în centru natura, spiritele și energiile. Ei pot fi porecliți hippioți moderni sau hippioți-electro, un hibrid între muzica electronică, dragostea de natură și ezoterism.
Picăturile de culoare:
La proteste au existat mereu grupuri de personaje fără legătură cu tema principală a protestului, dar care prin acțiunile lor au putut să creeze anumite impresii privitorilor de pe margine.
Huliganii, așa numiții băieți de galerie de fotbal, aproape că au lipsit de la aceste proteste. Când au apărut mai numeroși, în luna decembrie, s-a ajuns la violențe cu jandarmii. Din practica revoltei din 2012, nu este deplasat să crezi că acești băieți sunt motivați politic.
Legionarii de debara și-au făcut și ei apariția la proteste, fiind vorba despre tema pământului românesc care se duce cu japca la străini. Cum la noi extrema dreaptă este infim dezvoltată, acești tipi au putut fi confundați cu ușurință cu niște rockeri mai deprimați și predispuși la violență. Variantele acestei tipologii mai sunt românii verzi (cei care susțin românismul cu orice preț și cu orice ocazie, precum și faptul că Basarabia este pământ românesc și trebuie anexat cu orice preț României), dar și ultraortodocșii, mireni sau chiar preoți, care au putut fi văzuți la proteste propovăduind pildele Bibliei.
„Dacii liberi” sunt câteva personaje care și-au făcut apariția și care cred că Dacia a constituit o civilizație din care se revendică absolut orice în lume și, prin urmare, românii trebuie să fie mândri că se trag din daci și să conștientizeze că sunt superiori altor popoare. Până la urmă, o deviație a românismului verde.
Protestatarii de serviciu – acei oameni care sunt nelipsiți de la orice protest, indiferent de temă și pe care ajungi să îi cunoști dacă te perinzi pe la suficiente manifestații de stradă.
|
{
"pile_set_name": "OpenWebText2"
}
| 58 |
[
{
"begin": 0,
"end": 2,
"score": 1
},
{
"begin": 2,
"end": 102,
"score": 0
},
{
"begin": 102,
"end": 107,
"score": 1
},
{
"begin": 107,
"end": 108,
"score": 0
},
{
"begin": 108,
"end": 121,
"score": 1
},
{
"begin": 121,
"end": 154,
"score": 0
},
{
"begin": 154,
"end": 163,
"score": 1
},
{
"begin": 163,
"end": 305,
"score": 0
},
{
"begin": 305,
"end": 314,
"score": 1
},
{
"begin": 314,
"end": 317,
"score": 0
},
{
"begin": 317,
"end": 325,
"score": 1
},
{
"begin": 325,
"end": 521,
"score": 0
},
{
"begin": 521,
"end": 529,
"score": 1
},
{
"begin": 529,
"end": 750,
"score": 0
},
{
"begin": 750,
"end": 752,
"score": 1
},
{
"begin": 752,
"end": 806,
"score": 0
},
{
"begin": 806,
"end": 814,
"score": 1
},
{
"begin": 814,
"end": 816,
"score": 0
},
{
"begin": 816,
"end": 821,
"score": 1
},
{
"begin": 821,
"end": 879,
"score": 0
},
{
"begin": 879,
"end": 884,
"score": 1
},
{
"begin": 884,
"end": 885,
"score": 0
},
{
"begin": 885,
"end": 898,
"score": 1
},
{
"begin": 898,
"end": 1006,
"score": 0
},
{
"begin": 1006,
"end": 1014,
"score": 1
},
{
"begin": 1014,
"end": 1087,
"score": 0
},
{
"begin": 1087,
"end": 1096,
"score": 1
},
{
"begin": 1096,
"end": 1295,
"score": 0
},
{
"begin": 1295,
"end": 1301,
"score": 1
},
{
"begin": 1301,
"end": 1680,
"score": 0
},
{
"begin": 1680,
"end": 1682,
"score": 1
},
{
"begin": 1682,
"end": 1769,
"score": 0
},
{
"begin": 1769,
"end": 1777,
"score": 1
},
{
"begin": 1777,
"end": 1860,
"score": 0
},
{
"begin": 1860,
"end": 1865,
"score": 1
},
{
"begin": 1865,
"end": 1944,
"score": 0
},
{
"begin": 1944,
"end": 1950,
"score": 1
},
{
"begin": 1950,
"end": 2191,
"score": 0
},
{
"begin": 2191,
"end": 2201,
"score": 1
},
{
"begin": 2201,
"end": 2204,
"score": 0
},
{
"begin": 2204,
"end": 2213,
"score": 1
},
{
"begin": 2213,
"end": 2450,
"score": 0
},
{
"begin": 2450,
"end": 2460,
"score": 1
},
{
"begin": 2460,
"end": 2533,
"score": 0
},
{
"begin": 2533,
"end": 2538,
"score": 1
},
{
"begin": 2538,
"end": 2539,
"score": 0
},
{
"begin": 2539,
"end": 2546,
"score": 1
},
{
"begin": 2546,
"end": 2587,
"score": 0
},
{
"begin": 2587,
"end": 2597,
"score": 1
},
{
"begin": 2597,
"end": 2702,
"score": 0
},
{
"begin": 2702,
"end": 2707,
"score": 1
},
{
"begin": 2707,
"end": 2708,
"score": 0
},
{
"begin": 2708,
"end": 2715,
"score": 1
},
{
"begin": 2715,
"end": 2861,
"score": 0
},
{
"begin": 2861,
"end": 2869,
"score": 1
},
{
"begin": 2869,
"end": 2882,
"score": 0
},
{
"begin": 2882,
"end": 2890,
"score": 1
},
{
"begin": 2890,
"end": 2891,
"score": 0
},
{
"begin": 2891,
"end": 2896,
"score": 1
}
] |
A little girl and her spaceship
Murder on a train! Parades! Trespassing in a movie studio?
Small child, giant worlds
Cute hats, magical yarn and snappy badges
Community-funded, community-focused
is a cute-as-heck 3D platformer featuring a little girl who stitches hats for wicked powers.In A Hat in Time you play as a tiny space-travelling girl with a big tophat. Her adventure is halted when all her fuel, the Time Pieces, is lost and scattered across a nearby planet. Hat Kid must now jump, fight and stitch new hats to make her way into every nook and cranny of this new world in order to restore her fuel and resume her journey. On her way, she'll bump into the menacing Mafia of Cooks, the goofy birds of Dead Bird Studio, the spooky shadows of Subcon Forest, and more!Every mission in A Hat in Time is unique! At one moment you'll be solving theby finding clues and interrogating the locals, the next moment you'll be the band marshal in, or sneaking through the bird-runJump freely around in 5 massive worlds with new adventures to discover around every corner! Just like any child, Hat Kid loves to climb and explore, no mountain is too big for her sense of adventure. She can do multiple jump moves, as well as climb walls, and swing over gaps!By finding and collecting rare magical yarn, Hat Kid can stitch new cute hats with a variety of abilities, including a witch hat that allows her to cook explosive concoctions, and a wooden ghost mask that allows her to peek into other dimensions. Hats can become even more powerful, by attaching badges that are found, sold and traded by the locals!A Hat in Time was successfully funded on Kickstarter, reaching nearly 10 times its goal! In order to celebrate our community, A Hat in Time is releasing with full modding, an in-game screenshot mode, and more!
(C) 2017 Gears for Breakfast ApS
|
{
"pile_set_name": "OpenWebText2"
}
| 26 |
[
{
"begin": 0,
"end": 218,
"score": 0
},
{
"begin": 218,
"end": 220,
"score": 1
},
{
"begin": 220,
"end": 297,
"score": 0
},
{
"begin": 297,
"end": 300,
"score": 1
},
{
"begin": 300,
"end": 304,
"score": 0
},
{
"begin": 304,
"end": 308,
"score": 1
},
{
"begin": 308,
"end": 416,
"score": 0
},
{
"begin": 416,
"end": 420,
"score": 1
},
{
"begin": 420,
"end": 421,
"score": 0
},
{
"begin": 421,
"end": 427,
"score": 1
},
{
"begin": 427,
"end": 475,
"score": 0
},
{
"begin": 475,
"end": 478,
"score": 1
},
{
"begin": 478,
"end": 479,
"score": 0
},
{
"begin": 479,
"end": 482,
"score": 1
},
{
"begin": 482,
"end": 680,
"score": 0
},
{
"begin": 680,
"end": 685,
"score": 1
},
{
"begin": 685,
"end": 689,
"score": 0
},
{
"begin": 689,
"end": 694,
"score": 1
},
{
"begin": 694,
"end": 715,
"score": 0
},
{
"begin": 715,
"end": 719,
"score": 1
},
{
"begin": 719,
"end": 720,
"score": 0
},
{
"begin": 720,
"end": 724,
"score": 1
},
{
"begin": 724,
"end": 725,
"score": 0
},
{
"begin": 725,
"end": 731,
"score": 1
},
{
"begin": 731,
"end": 755,
"score": 0
},
{
"begin": 755,
"end": 761,
"score": 1
},
{
"begin": 761,
"end": 762,
"score": 0
}
] |
Monitoring patient-ventilator breath contribution in the critically ill during neurally adjusted ventilatory assist: reliability and improved algorithms for bedside use.
The patient-ventilator breath contribution (PVBC) index estimates the relative contribution of the patient to total tidal volume (Vtinsp) during mechanical ventilation in neurally adjusted ventilator assist mode and has been used to titrate ventilator support. The reliability of this index in ventilated patients is unknown and was investigated in this study. PVBC was calculated by comparing tidal volume (Vtinsp) and diaphragm electrical activity (EAdi) during assisted breaths (Vtinsp/EAdi)assist and during unassisted breaths (Vtinsp/EAdi)no-assist. Vtinsp was normalized to peak EAdi (EAdipeak) using 1) one assisted breath, 2) five consecutive assisted breaths, or 3) five assisted breaths with matching EAdi preceding the unassisted breath (N1PVBC2, X5PVBC2, and PX5VBCEAdi-matching2 , respectively). In addition, PVBC was calculated by comparing only Vtinsp for breaths with matching EAdi (PVBCβ2). Test-retest reliability of the different PVBC calculation methods was evaluated with the intraclass correlation coefficient (ICC) using five repeated PVBC maneuvers performed with a 1-min interval. In total, 125 PVBC maneuvers were analyzed in 25 patients. ICC [95% confidence interval] values were 0.46 [0.23-0.66], 0.51 [0.33-0.70], and 0.42 [0.14-0.69] for N1PVBC2, X5PVBC2, PX5VBCEAdi-matching2 , respectively. Complex waveform analyses showed that insufficient EAdi filtering by the ventilator software affects reliability of PVBC calculation. With our new EAdi-matching techniques reliability improved (PVBCβ2 ICC: 0.78 [0.60-0.90]). We conclude that current techniques to calculate PVBC exhibit low reliability and that our newly developed criteria and estimation of PVBC-using Vtinsp of assisted breaths and unassisted breaths with matching EAdi-improves reliability. This may help implementation of PVBC in clinical practice. NEW & NOTEWORTHY The patient-ventilator breath contribution (PVBC) index estimates the relative contribution of the patient to tidal volume generated by the patient and the mechanical ventilator during mechanical ventilation in neurally adjusted ventilator assist mode. It could be used to titrate ventilator support and thus to limit development of diaphragm dysfunction in intensive care unit patients. Currently available methods for bedside assessment of PVBC are unreliable. Our newly developed criteria and estimation of PVBC largely improve reliability and help to quantify patient contribution to total inspiratory effort.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 11 |
[
{
"begin": 0,
"end": 300,
"score": 0
},
{
"begin": 300,
"end": 306,
"score": 1
},
{
"begin": 306,
"end": 578,
"score": 0
},
{
"begin": 578,
"end": 584,
"score": 1
},
{
"begin": 584,
"end": 652,
"score": 0
},
{
"begin": 652,
"end": 658,
"score": 1
},
{
"begin": 658,
"end": 702,
"score": 0
},
{
"begin": 702,
"end": 708,
"score": 1
},
{
"begin": 708,
"end": 725,
"score": 0
},
{
"begin": 725,
"end": 731,
"score": 1
},
{
"begin": 731,
"end": 1030,
"score": 0
},
{
"begin": 1030,
"end": 1036,
"score": 1
}
] |
My debut album Written, performed, produced, and engineered entirely by myself Hit me up on Soundcloud to hear more music, DJ mixes, and talk about potentially buying beats if you're interested: https://soundcloud.com/user-53929289
|
{
"pile_set_name": "OpenWebText2"
}
| 3 |
[
{
"begin": 0,
"end": 92,
"score": 0
},
{
"begin": 92,
"end": 102,
"score": 1
},
{
"begin": 102,
"end": 123,
"score": 0
},
{
"begin": 123,
"end": 125,
"score": 1
}
] |
Big Tobacco are using Instagram influencers to advertise cigarettes even in Australia, advocates warn
The days of glitzy cigarette advertising luring young people to smoke are so far gone, it's hard to imagine they existed in the first place.
The only smoking ads young Australians can remember are the ones that told us to quit before we'd even started: macabre TV spots showing emphysemic patients on their deathbeds, using their last wheezy breaths to warn us not to take up the deadly habit.
But glamorous ads for cigarettes are circumventing Australian laws and making a fierce comeback by using Instagram influencers, anti-smoking advocates say.
In a petition filed to the United States Federal Trade Commission last week, the results of a two-year long study found that tobacco companies are using "the same marketing tactics they used in the US for decades to attract kids and young people", only with social media as its vehicle, a limitless and international audience, and absolutely zero regulations placed upon them.
They've called it the "greatest threat" to how young people perceive tobacco products today.
Matthew Myers, President for the anti-smoking advocacy group Campaign for Tobacco Free Kids, who co-authored the report, told Hack that Big Tobacco are blatantly using influencers as their "front" for advertising.
Do you know more about this story? Email [email protected]
"We found evidence of major social media campaigns, clearly targeted at young people in at least 40 countries. We found examples of at least two campaigns that began in Australia. As a net result we found those campaigns generated over 25 billion views by individuals.
"As is usually the case with the tobacco industry, if you put up a dyke they'll find a hole in it. With social media, boundaries mean much less than they ever did before.
"It's truly insidious."
How it works
Obviously you can't just post an ad for cigarettes in Australia, or even America; our anti-smoking advertising laws state that corporations can face a fine of up to $126,000 if they advertise their products. Individuals can face a fine of up to $25,000.
But social media marketing has become very sophisticated in recent years: you've probably seen bloggers or celebrities you follow on instagram post shots of their favourite skincare or makeup brands; or maybe you've seen them post pictures from an event thrown by a champagne brand or beer label.
If those posts aren't actually paid for directly by the brands, they're often at least encouraged by them - with gifts, exclusive events, and parties.
Share Facebook
Twitter
Mail
Whatsapp
Share Facebook
Twitter
Mail
Whatsapp
Tobacco companies are doing the exact same thing on an international scale, Matthew Myers says.
"We began to see a series of events, hosted parties that attracted young people, where young people were given free cigarettes, often given free alcohol and gifts.
"In return what was expected of them was that they would post on social media to all of their friends, often featuring the product, or talking very favourably about the product, or cigarettes in general."
The report found evidence of at least two parties hosted by cigarette brands taking place in Australia, attended by influencers; and Australians using at least 10 hashtags associated with global marketing campaigns by cigarette companies.
"The work that [the Australian] government did to make sure that the kind of imagery that makes cigarettes so attractive to kids, they're seeing it now through social media that takes place in countries that don't have comparable laws."
Influencers were also found to be paid by tobacco companies to post content related to their products, given specific briefs, and in some cases told to cover up health warning labels on cigarette packaging in their photos.
Share Facebook
Twitter
Mail
Whatsapp Guidelines for influencers participating in a Lucky Strike campaign in Italy.
"So what they're doing is associating cigarettes with the lifestyle that a young person would want," Matthew says.
"It's an exact duplicate of the type of advertising that we used to see on TV before it was banned, then in magazines and other places before it was banned.
"The sad reality is, this has gone on for a number of years, with no governments investigating it carefully, and with little attention brought to it. That's the reason we conducted the investigation."
Governments and regulators around the world tend to be unaware of the practice happening until they've been told about it by anti-smoking advocates, Matthew says.
Hack contacted the Federal Health department to see if they were aware that ads for tobacco products were sneaking into young Australians' feeds.
A spokeswoman for the federal Health department told Hack they have not received complaints of any Australian based tobacco suppliers using online influencers to advertise and market tobacco products to young people.
"The Department considers allegations received from the public on a case-by-case basis," the spokeswoman said.
Matthew Myers says strict governmental policy on this issue is needed for tobacco companies to back down.
"What the tobacco industry has demonstrated is they don't have a conscience. They will only do what governments tell them they must do."
|
{
"pile_set_name": "OpenWebText2"
}
| 53 |
[
{
"begin": 0,
"end": 3,
"score": 1
},
{
"begin": 3,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 31,
"score": 1
},
{
"begin": 31,
"end": 76,
"score": 0
},
{
"begin": 76,
"end": 85,
"score": 1
},
{
"begin": 85,
"end": 604,
"score": 0
},
{
"begin": 604,
"end": 613,
"score": 1
},
{
"begin": 613,
"end": 683,
"score": 0
},
{
"begin": 683,
"end": 689,
"score": 1
},
{
"begin": 689,
"end": 690,
"score": 0
},
{
"begin": 690,
"end": 696,
"score": 1
},
{
"begin": 696,
"end": 697,
"score": 0
},
{
"begin": 697,
"end": 704,
"score": 1
},
{
"begin": 704,
"end": 705,
"score": 0
},
{
"begin": 705,
"end": 710,
"score": 1
},
{
"begin": 710,
"end": 711,
"score": 0
},
{
"begin": 711,
"end": 721,
"score": 1
},
{
"begin": 721,
"end": 1128,
"score": 0
},
{
"begin": 1128,
"end": 1135,
"score": 1
},
{
"begin": 1135,
"end": 1136,
"score": 0
},
{
"begin": 1136,
"end": 1141,
"score": 1
},
{
"begin": 1141,
"end": 1143,
"score": 0
},
{
"begin": 1143,
"end": 1152,
"score": 1
},
{
"begin": 1152,
"end": 1189,
"score": 0
},
{
"begin": 1189,
"end": 1197,
"score": 1
},
{
"begin": 1197,
"end": 1202,
"score": 0
},
{
"begin": 1202,
"end": 1209,
"score": 1
},
{
"begin": 1209,
"end": 1210,
"score": 0
},
{
"begin": 1210,
"end": 1214,
"score": 1
},
{
"begin": 1214,
"end": 1215,
"score": 0
},
{
"begin": 1215,
"end": 1219,
"score": 1
},
{
"begin": 1219,
"end": 1254,
"score": 0
},
{
"begin": 1254,
"end": 1258,
"score": 1
},
{
"begin": 1258,
"end": 1264,
"score": 0
},
{
"begin": 1264,
"end": 1267,
"score": 1
},
{
"begin": 1267,
"end": 1268,
"score": 0
},
{
"begin": 1268,
"end": 1275,
"score": 1
},
{
"begin": 1275,
"end": 1384,
"score": 0
},
{
"begin": 1384,
"end": 1411,
"score": 1
},
{
"begin": 1411,
"end": 1582,
"score": 0
},
{
"begin": 1582,
"end": 1591,
"score": 1
},
{
"begin": 1591,
"end": 1948,
"score": 0
},
{
"begin": 1948,
"end": 1957,
"score": 1
},
{
"begin": 1957,
"end": 1967,
"score": 0
},
{
"begin": 1967,
"end": 1974,
"score": 1
},
{
"begin": 1974,
"end": 2605,
"score": 0
},
{
"begin": 2605,
"end": 2613,
"score": 1
},
{
"begin": 2613,
"end": 2615,
"score": 0
},
{
"begin": 2615,
"end": 2622,
"score": 1
},
{
"begin": 2622,
"end": 2624,
"score": 0
},
{
"begin": 2624,
"end": 2628,
"score": 1
},
{
"begin": 2628,
"end": 2630,
"score": 0
}
] |
Apparent cease-fire on Central Corridor
Article by: Scott Gillespie
January 15, 2009 - 4:34 PM
It looks like St. Paul Mayor Chris Coleman played the role of Henry Kissinger earlier this week. After a meeting called by Coleman, Minnesota Public Radio (MPR) said it would work with Metropolitan Council engineers on plans to mitigate noise that might interfere with MPR's operations at its downtown headquarters. Those engineers have said mitigation technology can be used so that the headquarters will actually experience less noise and vibration after the trains are up and running. During its feud with the Met Council, MPR has argued that is own engineers are skeptical that mitigation will work. As we suggested in a recent editorial, it was time for MPR to work in good faith with the Met Council to find solutions other than moving the line off of Cedar Street. Thanks to Coleman's leadership, it appears that the high-profile dispute will cool down long enough for both sides to finally work out a detailed mitigation plan.
|
{
"pile_set_name": "Pile-CC"
}
| 25 |
[
{
"begin": 0,
"end": 23,
"score": 0
},
{
"begin": 23,
"end": 30,
"score": 1
},
{
"begin": 30,
"end": 31,
"score": 0
},
{
"begin": 31,
"end": 39,
"score": 1
},
{
"begin": 39,
"end": 53,
"score": 0
},
{
"begin": 53,
"end": 58,
"score": 1
},
{
"begin": 58,
"end": 59,
"score": 0
},
{
"begin": 59,
"end": 68,
"score": 1
},
{
"begin": 68,
"end": 70,
"score": 0
},
{
"begin": 70,
"end": 77,
"score": 1
},
{
"begin": 77,
"end": 94,
"score": 0
},
{
"begin": 94,
"end": 96,
"score": 1
},
{
"begin": 96,
"end": 116,
"score": 0
},
{
"begin": 116,
"end": 120,
"score": 1
},
{
"begin": 120,
"end": 121,
"score": 0
},
{
"begin": 121,
"end": 126,
"score": 1
},
{
"begin": 126,
"end": 127,
"score": 0
},
{
"begin": 127,
"end": 132,
"score": 1
},
{
"begin": 132,
"end": 133,
"score": 0
},
{
"begin": 133,
"end": 140,
"score": 1
},
{
"begin": 140,
"end": 160,
"score": 0
},
{
"begin": 160,
"end": 165,
"score": 1
},
{
"begin": 165,
"end": 166,
"score": 0
},
{
"begin": 166,
"end": 175,
"score": 1
},
{
"begin": 175,
"end": 221,
"score": 0
},
{
"begin": 221,
"end": 228,
"score": 1
}
] |
Satisfactory progress is being made on the synthesis of the C-nucleoside analogs of 5-fluorouridine and 5-fluoro-2'-deoxyuridine. The synthesis has almost been completed of the acetylenic "suicide" inhibitors of de novo pyrimidine biosynthesis, 5-ethynyl-5,6-dihydrouracil and 5-ethynyl-5,6-dihydroorotic acid. Five new 1,2,4-triazin-3-one-1-oxides, as well as 6-methyluricytin, have been synthesized as potential chemoimmunotherapeutic agents. A comparative study of the modes of action of uricytin and showdomycin was conducted. The deoxyribonucleoside of 3-deazaguanine was synthesized, as well as the corresponding N-7 isomer.
|
{
"pile_set_name": "NIH ExPorter"
}
| 1 |
[
{
"begin": 0,
"end": 619,
"score": 0
},
{
"begin": 619,
"end": 622,
"score": 1
}
] |
Yle uutisoi tyypillisen populistiseen tapaansa entisistä Nokialaisista ja heidän vaikeuksistaan löytää töitä. Alla hienoimpia lainauksia:
Omalta kohdaltani olen huomannut, että vahva ammattitaitokin estää työllistymistä, siitähän on maksettava PALKKAA. Ilmaista työvoimaa on tarjolla työnantajille pilvin pimein mm. kouluista ilmaiset työharjoittelijat, palkkatuella, työkokeilun muodossa. Työn laadulla ei niinkään ole merkitystä.
Tässä on tyypillinen ajatusvirhe. Ammattitaidosta maksaa mielellään, mutta se että on istunut 15 vuotta Nokialla ei automaattisesti tee työnhakijasta kaikkien alojen teknologia-asiantuntijaa. Yleensä päinvastoin.
Minulla on kaksi korkeakoulututkintoa loistoarvosanoin ja 20+ vuotta työkokemusta erittäin vaativista johtotason tehtävistä. Nyt olen hakenut töitä kuusi vuotta tuloksetta. Olen kuulemma ylikoulutettu ja ylipätevä, joten minun työmotivaationi kyseenalaistetaan täysin.
Työnantajaa ei yleensä kiinnosta hevonveenhumppaa vaikka sinulla olisi kymmenen tohtoritutkintoa, tai jos työkokemusta on 20+ vuotta jostain muusta tehtävästä kuin mitä yritys tarvitsee. Tässä taas näkee kuvitelman, että tutkinto jotenkin pätevöittäisi työelämään, ja jotenkin sen perusteella työntekijällä olisi oikeus johonkin palkkatasoon riippumatta siitä mitä yritys tarvitsee.
Jos on ollut kuusi vuotta työttömänä, ei ole selkeästikään myöskään realistista käsitystä oman osaamisen markkinahinnasta.
Sama toistuu melkein jokaisessa haastattelussa: “minulla on tutkinto xxx ja olen muka ylikoulutettu”. Todennäköisesti hakija on vain väärin koulutettu, mutta työnantaja yrittää olla lyttäämättä itsetuntoa tarpeettomasti. Toisin kuin yleensä ajatellaan, työnantajilla ei ole mitään erityistä motivaatiota tylyttää hakijoita.
Seuraava kommentti kertoo myös, miten iloisesti pihalla jotkut ovat:
Taitava johtaja osaa itse pohtia, miten hakijan osaamista hyödyttää ja mitä uutta hän toisi työpaikkaan. On vain hyväksi, että työnhakija ei täysin vastaa haettua. Vai pelkääkö johtaja muutosta, edistystä ja uudenlaista ajattelua? Siinä tapauksessa hän voi sanoa hyvästit yritykselleen, sitä ei kohta ole.
Varmasti tällainen henkilö on suoranainen kultakimpale yritykselle. Hänellä itsellään ei selkeästikään ole halua miettiä mitä hänellä olisi yritykselle annettavanaan, vaan yrityskin pitäisi kääntää nurin tämän taivaanlahjan taitojen ja osaamisen mukaan.
Tämä on kuitenkin kaikkein paras:
Yksi ISO ongelma johon olen törmännyt työnhaussa ja haastatteluissa. Jos olet hyvin koulutettu ja sinulla on osaamista ja työkokemusta enemmän kuin tulevalla pomollasi. Ei ole mukava tilanne pomolle kun alaiseksi on tulossa osaaja, jolla on osaamista huimasti enemmän.
Itse haluan palkata vain itseäni osaavampia työntekijöitä. En ole myöskään tavannut yhtään sellaista mystistä yrittäjää, joka vain omaa egoa suojellakseen palkkaisi itseään osaamattomamman. Siinä ei yksinkertaisesti taloudellisesti ole mitään järkeä! Ymmärrän että se on mukava pumpulitarina jonka työttömänä voi itselleen kertoa, mutta todellisuusperää siinä ei ole.
Meillekin on hakenut useampia “entisiä Nokialaisia” töihin. Yhtään en ole ottanut edes työhaastatteluun asti, koska viestintä on ollut puisevaa, CV-vetoista ja paikoin ylimielistä. On annettu selkeästi kuva, että tässä olisi nyt maailmanluokan talenttia powerpointtien ja corporate politicsin maailmasta tarjolla rupiseen pieneen nakkikioskiinne. Palkkatoiveet ovat heti olleet sen mukaisia, vaikka osaamista tai kokemusta ei ole ollut meidän tarpeisiimme juuri ollenkaan.
Kukaan ei halua omaan yritykseensä ihmistä, jotka tuovat mukanaan epäonnistuneen ja ylimielisen hasbeen-jättiläisen asenteita ja “kokemusta”. Tuo mieluummin oma itsesi ja mieti heti alkumetreillä, miten sinä voit olla hyödyksi yritykselle.
Jos määrittelee olevansa ex-jotain, tuskin on valmis avomielisesti tarttumaan uusiin haasteisiinkaan.
|
{
"pile_set_name": "OpenWebText2"
}
| 41 |
[
{
"begin": 0,
"end": 3,
"score": 1
},
{
"begin": 3,
"end": 57,
"score": 0
},
{
"begin": 57,
"end": 70,
"score": 1
},
{
"begin": 70,
"end": 110,
"score": 0
},
{
"begin": 110,
"end": 114,
"score": 1
},
{
"begin": 114,
"end": 139,
"score": 0
},
{
"begin": 139,
"end": 145,
"score": 1
},
{
"begin": 145,
"end": 254,
"score": 0
},
{
"begin": 254,
"end": 262,
"score": 1
},
{
"begin": 262,
"end": 391,
"score": 0
},
{
"begin": 391,
"end": 395,
"score": 1
},
{
"begin": 395,
"end": 434,
"score": 0
},
{
"begin": 434,
"end": 439,
"score": 1
},
{
"begin": 439,
"end": 468,
"score": 0
},
{
"begin": 468,
"end": 483,
"score": 1
},
{
"begin": 483,
"end": 538,
"score": 0
},
{
"begin": 538,
"end": 546,
"score": 1
},
{
"begin": 546,
"end": 626,
"score": 0
},
{
"begin": 626,
"end": 633,
"score": 1
},
{
"begin": 633,
"end": 648,
"score": 0
},
{
"begin": 648,
"end": 655,
"score": 1
},
{
"begin": 655,
"end": 773,
"score": 0
},
{
"begin": 773,
"end": 776,
"score": 1
},
{
"begin": 776,
"end": 821,
"score": 0
},
{
"begin": 821,
"end": 825,
"score": 1
},
{
"begin": 825,
"end": 918,
"score": 0
},
{
"begin": 918,
"end": 929,
"score": 1
},
{
"begin": 929,
"end": 1105,
"score": 0
},
{
"begin": 1105,
"end": 1110,
"score": 1
},
{
"begin": 1110,
"end": 1302,
"score": 0
},
{
"begin": 1302,
"end": 1305,
"score": 1
},
{
"begin": 1305,
"end": 1426,
"score": 0
},
{
"begin": 1426,
"end": 1430,
"score": 1
},
{
"begin": 1430,
"end": 1528,
"score": 0
},
{
"begin": 1528,
"end": 1543,
"score": 1
},
{
"begin": 1543,
"end": 1647,
"score": 0
},
{
"begin": 1647,
"end": 1653,
"score": 1
},
{
"begin": 1653,
"end": 1751,
"score": 0
},
{
"begin": 1751,
"end": 1759,
"score": 1
},
{
"begin": 1759,
"end": 1821,
"score": 0
},
{
"begin": 1821,
"end": 1828,
"score": 1
},
{
"begin": 1828,
"end": 1985,
"score": 0
}
] |
Q:
.net Bitmap changes color of image
I am trying to resize the image without the loss of any color. But I can't get this to work. See the picture below, the top one is the original, the bottom one is the one which has gone through .NET.
My question is, how can I keep the colors?
I have tried a lot of different settings, looking for GDI+ bugs. Changing the Palette, changing the ImageAttributes to TileFlipXY which people suggest on the internet. But none seems to work.
My Code:
Public Class ImageEditor
Private _img As Image
Private _format As Imaging.ImageFormat
Private _pixelformat As Imaging.PixelFormat
Private _palette As Imaging.ColorPalette
Public Sub New(ByVal img As Image)
_img = img
_palette = _img.Palette
_format = _img.RawFormat
_pixelformat = _img.PixelFormat
End Sub
Function getImage() As Image
Return _img
End Function
''' <summary>
''' Een stuk afbeelding uit een afbeelding knippen
''' </summary>
''' <param name="x1">Start X positie</param>
''' <param name="y1">Start Y positie</param>
''' <param name="width">Breedte van het stuk dat geknipt wordt</param>
''' <param name="height">Hoogte van het stuk dat geknipt wordt</param>
''' <remarks></remarks>
Public Sub crop(ByVal x1 As Integer, ByVal y1 As Integer, ByVal width As Integer, ByVal height As Integer)
' Cropping the image
Dim tmp As New Bitmap(width, height, _pixelformat)
tmp.SetResolution(_img.HorizontalResolution, _img.VerticalResolution)
Dim imageAttributes As New Imaging.ImageAttributes
imageAttributes.SetWrapMode(Drawing2D.WrapMode.TileFlipXY)
Using g = Graphics.FromImage(tmp)
g.SmoothingMode = Drawing2D.SmoothingMode.HighQuality
g.InterpolationMode = Drawing2D.InterpolationMode.HighQualityBicubic
g.PixelOffsetMode = Drawing2D.PixelOffsetMode.HighQuality
g.CompositingQuality = Drawing2D.CompositingQuality.HighQuality
g.CompositingMode = Drawing2D.CompositingMode.SourceCopy
g.DrawImage(_img, New Rectangle(0, 0, width, height), x1, y1, width, height, GraphicsUnit.Pixel, imageattributes)
End Using
_img = tmp
End Sub
End Class
My converter class.. Any my .NET code:
' Load file
Dim img As Image = Image.FromFile(filename)
Dim format As Imaging.ImageFormat = img.RawFormat
' Crop and scale
Dim editor As New ImageEditor(img)
editor.crop(x1, y1, x2 - x1, y2 - y1)
img.Dispose()
' Generate binairies
Dim newImg As Image = editor.getImage()
Dim myEncoder As System.Drawing.Imaging.Encoder = System.Drawing.Imaging.Encoder.Quality
Dim myEncoderParameters As New EncoderParameters(1)
Dim myEncoderParameter As New EncoderParameter(myEncoder, 100&)
myEncoderParameters.Param(0) = myEncoderParameter
Dim ms As New MemoryStream()
newImg.Save(ms, GetEncoder(format), myEncoderParameters)
Dim binairies As Byte() = ms.ToArray()
A:
It is as Hans Passant says. I just had to add the true at Image.FromFile(filename, True)
This true stands for:
Creates an Image from the specified file using embedded color management information in that file.
More info: http://msdn.microsoft.com/en-us/library/system.drawing.image.fromfile%28v=vs.110%29.aspx
|
{
"pile_set_name": "StackExchange"
}
| 43 |
[
{
"begin": 0,
"end": 9,
"score": 0
},
{
"begin": 9,
"end": 15,
"score": 1
},
{
"begin": 15,
"end": 361,
"score": 0
},
{
"begin": 361,
"end": 368,
"score": 1
},
{
"begin": 368,
"end": 479,
"score": 0
},
{
"begin": 479,
"end": 483,
"score": 1
},
{
"begin": 483,
"end": 485,
"score": 0
},
{
"begin": 485,
"end": 491,
"score": 1
},
{
"begin": 491,
"end": 492,
"score": 0
},
{
"begin": 492,
"end": 497,
"score": 1
},
{
"begin": 497,
"end": 677,
"score": 0
},
{
"begin": 677,
"end": 683,
"score": 1
},
{
"begin": 683,
"end": 684,
"score": 0
},
{
"begin": 684,
"end": 687,
"score": 1
},
{
"begin": 687,
"end": 688,
"score": 0
},
{
"begin": 688,
"end": 691,
"score": 1
},
{
"begin": 691,
"end": 755,
"score": 0
},
{
"begin": 755,
"end": 762,
"score": 1
},
{
"begin": 762,
"end": 844,
"score": 0
},
{
"begin": 844,
"end": 847,
"score": 1
},
{
"begin": 847,
"end": 853,
"score": 0
},
{
"begin": 853,
"end": 861,
"score": 1
},
{
"begin": 861,
"end": 910,
"score": 0
},
{
"begin": 910,
"end": 918,
"score": 1
},
{
"begin": 918,
"end": 946,
"score": 0
},
{
"begin": 946,
"end": 949,
"score": 1
},
{
"begin": 949,
"end": 1092,
"score": 0
},
{
"begin": 1092,
"end": 1093,
"score": 1
},
{
"begin": 1093,
"end": 1146,
"score": 0
},
{
"begin": 1146,
"end": 1149,
"score": 1
},
{
"begin": 1149,
"end": 1221,
"score": 0
},
{
"begin": 1221,
"end": 1224,
"score": 1
},
{
"begin": 1224,
"end": 1292,
"score": 0
},
{
"begin": 1292,
"end": 1298,
"score": 1
},
{
"begin": 1298,
"end": 1299,
"score": 0
},
{
"begin": 1299,
"end": 1302,
"score": 1
},
{
"begin": 1302,
"end": 1320,
"score": 0
},
{
"begin": 1320,
"end": 1327,
"score": 1
},
{
"begin": 1327,
"end": 1341,
"score": 0
},
{
"begin": 1341,
"end": 1348,
"score": 1
},
{
"begin": 1348,
"end": 1365,
"score": 0
},
{
"begin": 1365,
"end": 1372,
"score": 1
},
{
"begin": 1372,
"end": 1390,
"score": 0
},
{
"begin": 1390,
"end": 1397,
"score": 1
}
] |
Kitakyushu (KKJ) Airport
Kitakyushu KKJ Airport Overview
Kitakyushu Airport KKJ, opened in 2006, serves southern Japan's Kyushu Island and its capital city (prefecture) Fukuoka. It is located at Kiushu Island's north shore - actually built on an artficial island at western Seto Inland Sea
KKJAirport is located 3 km east of Kitakyushu, and is accessible by a 2.1 km toll-free bridge connecting to the Higashikyushu Expressway via the Kanda-Kitakyushukuko interchange.
With a long runway and an estimated 3 million passengers a year, Kitakyushu Airport is served mainly by a number of airlines offering direct and connecting flights to all parts of the globe.
The two-level Passenger Terminal at Kitakyushu Airport has a barrier-free design. The first levelis the Arrivals level with domestic & international baggage claim areas, Immigration & Customs Inspection, and separate Domestic & International Arrivals Halls with a rental car desk in the international section. The second level is the Departures level, housing a Departure Lobby check-in desks, and security check, leading to both the domestic & the international waiting areas and to the gates (Gate 4 is for international boarding (with a duty-free shop nearby) and gates 1, 2 3 are for domestic boarding)..The level 2 boarding gate area offers a caffee with light meals for late night/early mornings, and in the Departure lobby is Cafe Rosen. Also, six stores are disbursed on level 2. The third levelhouses a modern restaurant and a ramen bar.
The observation deck is open 6:30am-9:30pm, but charges a small fee; it includes a footbath open 10am-6pm.Parking is available in the parking lots across from the passenger terminal; for more parking information call 093 551 4947.
|
{
"pile_set_name": "Pile-CC"
}
| 37 |
[
{
"begin": 0,
"end": 10,
"score": 1
},
{
"begin": 10,
"end": 17,
"score": 0
},
{
"begin": 17,
"end": 24,
"score": 1
},
{
"begin": 24,
"end": 26,
"score": 0
},
{
"begin": 26,
"end": 36,
"score": 1
},
{
"begin": 36,
"end": 41,
"score": 0
},
{
"begin": 41,
"end": 48,
"score": 1
},
{
"begin": 48,
"end": 49,
"score": 0
},
{
"begin": 49,
"end": 57,
"score": 1
},
{
"begin": 57,
"end": 59,
"score": 0
},
{
"begin": 59,
"end": 69,
"score": 1
},
{
"begin": 69,
"end": 70,
"score": 0
},
{
"begin": 70,
"end": 77,
"score": 1
},
{
"begin": 77,
"end": 115,
"score": 0
},
{
"begin": 115,
"end": 120,
"score": 1
},
{
"begin": 120,
"end": 123,
"score": 0
},
{
"begin": 123,
"end": 129,
"score": 1
},
{
"begin": 129,
"end": 130,
"score": 0
},
{
"begin": 130,
"end": 136,
"score": 1
},
{
"begin": 136,
"end": 171,
"score": 0
},
{
"begin": 171,
"end": 178,
"score": 1
},
{
"begin": 178,
"end": 197,
"score": 0
},
{
"begin": 197,
"end": 203,
"score": 1
},
{
"begin": 203,
"end": 204,
"score": 0
},
{
"begin": 204,
"end": 210,
"score": 1
},
{
"begin": 210,
"end": 276,
"score": 0
},
{
"begin": 276,
"end": 280,
"score": 1
},
{
"begin": 280,
"end": 281,
"score": 0
},
{
"begin": 281,
"end": 287,
"score": 1
},
{
"begin": 287,
"end": 288,
"score": 0
},
{
"begin": 288,
"end": 291,
"score": 1
},
{
"begin": 291,
"end": 328,
"score": 0
},
{
"begin": 328,
"end": 338,
"score": 1
},
{
"begin": 338,
"end": 405,
"score": 0
},
{
"begin": 405,
"end": 418,
"score": 1
},
{
"begin": 418,
"end": 419,
"score": 0
},
{
"begin": 419,
"end": 429,
"score": 1
},
{
"begin": 429,
"end": 438,
"score": 0
}
] |
Yury Golovshchikov
Yury Golovshchikov (born 10 July 1963) is a Soviet ski jumper. He competed in the normal hill and large hill events at the 1984 Winter Olympics.
References
Category:1963 births
Category:Living people
Category:Soviet male ski jumpers
Category:Olympic ski jumpers of the Soviet Union
Category:Ski jumpers at the 1984 Winter Olympics
Category:Sportspeople from Saint Petersburg
|
{
"pile_set_name": "Wikipedia (en)"
}
| 20 |
[
{
"begin": 0,
"end": 4,
"score": 1
},
{
"begin": 4,
"end": 5,
"score": 0
},
{
"begin": 5,
"end": 18,
"score": 1
},
{
"begin": 18,
"end": 20,
"score": 0
},
{
"begin": 20,
"end": 24,
"score": 1
},
{
"begin": 24,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 38,
"score": 1
},
{
"begin": 38,
"end": 45,
"score": 0
},
{
"begin": 45,
"end": 57,
"score": 1
},
{
"begin": 57,
"end": 136,
"score": 0
},
{
"begin": 136,
"end": 147,
"score": 1
},
{
"begin": 147,
"end": 148,
"score": 0
},
{
"begin": 148,
"end": 154,
"score": 1
},
{
"begin": 154,
"end": 155,
"score": 0
},
{
"begin": 155,
"end": 163,
"score": 1
},
{
"begin": 163,
"end": 178,
"score": 0
},
{
"begin": 178,
"end": 191,
"score": 1
},
{
"begin": 191,
"end": 199,
"score": 0
},
{
"begin": 199,
"end": 214,
"score": 1
},
{
"begin": 214,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 237,
"score": 1
}
] |
Physical activity and nutrition health promotion interventions: what is working for people with intellectual disabilities?
A scoping review of studies on physical activity and nutrition health promotion interventions for individuals with intellectual disabilities was conducted. Searches included MEDLINE, PsycINFO, and CINAHL databases from 1986 through July 2006. The final number included 11 articles comprising 12 studies. Generally, this review indicated some evidence for fitness and psychosocial benefits of community-based physical activity and exercise programs for adults with intellectual disabilities. When combined with a more comprehensive health behavior education program incorporating exercise and nutrition information, some evidence exists for reductions in weight.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 2 |
[
{
"begin": 0,
"end": 8,
"score": 1
},
{
"begin": 8,
"end": 355,
"score": 0
},
{
"begin": 355,
"end": 359,
"score": 1
}
] |
Q:
How to parse ebay xml response with php
I am trying to parse XML response from ebay for the findingitem api with php. Here is my code:
<head>
<title>Title</title>
<meta content="text/html;charset=utf-8" http-equiv="Content-Type">
<meta content="utf-8" http-equiv="encoding">
<meta name="viewport" content="width=device-width, initial-scale=1">
</head>
<body>
<?
$pagenumber = 1;
$keyword = 'iphone';
$entriesperpage = 1;
$ebayusername = 'ebay-username-here';
$response = getFindProducts($keyword, $ebayusername, $entriesperpage);
echo '<div style="display: none;">' . $response . '</div>';
$xmlResponse = new SimpleXMLElement($response);
echo $xmlResponse -> searchresult -> item[0] -> title;
function getFindProducts($keyword,$ebayusername,$entriesperpage) {
$xmlRequest = "<?xml version=\"1.0\" encoding=\"utf-8\"?>";
$xmlRequest .= '<findItemsAdvancedRequest xmlns="http://www.ebay.com/marketplace/search/v1/services">';
$xmlRequest .= '<keywords>' . $keyword . '</keywords>';
$xmlRequest .= '<itemFilter>';
$xmlRequest .= '<name>Seller</name>';
$xmlRequest .= '<value>' . $ebayusername . '</value>';
$xmlRequest .= '</itemFilter>';
$xmlRequest .= '<paginationInput>';
$xmlRequest .= '<entriesPerPage>' . $entriesperpage . '</entriesPerPage>';
$xmlRequest .= '</paginationInput>';
$xmlRequest .= '</findItemsAdvancedRequest>';
// define our header array for the Shopping API call
$headers = array(
'X-EBAY-SOA-SECURITY-APPNAME:' . 'appname-here',
'X-EBAY-SOA-OPERATION-NAME:findItemsAdvanced'
);
// initialize our curl session
$session = curl_init(FINDING_API_ENDPOINT);
// set our curl options with the XML request
curl_setopt($session, CURLOPT_SSL_VERIFYPEER, false);
curl_setopt($session, CURLOPT_HTTPHEADER, $headers);
curl_setopt($session, CURLOPT_POST, true);
curl_setopt($session, CURLOPT_POSTFIELDS, $xmlRequest);
curl_setopt($session, CURLOPT_RETURNTRANSFER, true);
if(curl_exec($session) === false){ echo 'Curl error: ' . curl_error($session); }
// execute the curl request
$responseXML = curl_exec($session);
// close the curl session
curl_close($session);
// return the response XML
return $responseXML;
}
?>
</body>
</html>
When I run it, it runs successfully in that it does get the response from ebay, and I can see the product XML structure if I echo the whole thing to the page in the source code.
The problem is with section:
$xmlResponse = new SimpleXMLElement($response);
echo $xmlResponse -> searchresult -> item[0] -> title;
It fails silently without any errors. I do have error reporting turned on.
Any help much appreciated!
--- EDIT ---
The XML code response is structured as follows:
<!--?xml version='1.0' encoding='UTF-8'?-->
<finditemsadvancedresponse xmlns="http://www.ebay.com/marketplace/search/v1/services">
<ack>Success</ack>
<version>1.13.0</version>
<timestamp>2016-08-18T19:25:06.303Z</timestamp>
<searchresult count="1">
<item>
<itemid>123456789</itemid>
<title>Item Title</title>
<globalid>EBAY-US</globalid>
<primarycategory>
<categoryid>12345</categoryid>
<categoryname>Category Name</categoryname>
</primarycategory>
<galleryurl>Galery URL</galleryurl>
<viewitemurl>Item URL</viewitemurl>
<paymentmethod>PayPal</paymentmethod>
<autopay>false</autopay>
<postalcode>12345</postalcode>
<location>Location</location>
<country>US</country>
<shippinginfo>
<shippingservicecost currencyid="USD">0.0</shippingservicecost>
<shippingtype>Free</shippingtype>
<shiptolocations>US</shiptolocations>
<expeditedshipping>true</expeditedshipping>
<onedayshippingavailable>false</onedayshippingavailable>
<handlingtime>1</handlingtime>
</shippinginfo>
<sellingstatus>
<currentprice currencyid="USD">15.99</currentprice>
<convertedcurrentprice currencyid="USD">15.99</convertedcurrentprice>
<sellingstate>Active</sellingstate>
<timeleft>P9DT3H29M13S</timeleft></sellingstatus>
<listinginfo>
<bestofferenabled>false</bestofferenabled>
<buyitnowavailable>false</buyitnowavailable>
<starttime>2015-12-01T22:54:19.000Z</starttime>
<endtime>2016-08-27T22:54:19.000Z</endtime>
<listingtype>FixedPrice</listingtype>
<gift>false</gift>
</listinginfo>
<returnsaccepted>true</returnsaccepted>
<condition>
<conditionid>3000</conditionid>
<conditiondisplayname>Used</conditiondisplayname>
</condition>
<ismultivariationlisting>false</ismultivariationlisting>
<topratedlisting>false</topratedlisting>
</item>
</searchresult>
<paginationoutput>
<pagenumber>1</pagenumber>
<entriesperpage>1</entriesperpage>
<totalpages>100</totalpages>
<totalentries>100</totalentries>
</paginationoutput>
<itemsearchurl>http://www.ebay.com/sch/i.html?_sasl=allkillerdeals&_saslop=1&_fss=1&LH_SpecificSeller=1&_nkw=knife&_ddo=1&_ipg=1&_pgn=1</itemsearchurl>
</finditemsadvancedresponse>
A:
Finally cracked it. After hours of frustration finally figured out that the xml echo path is case sensative. Only happened in the actual script becuase when I copied the xml (for the above example) from the html source code, it showed up all lower case. But the actual returned xml has mixed case in the xml nodes.
So,
echo $xmlResponse -> searchresult -> item[0] -> title;
needed to be:
echo $xmlResponse -> searchResult -> item[0] -> title;
|
{
"pile_set_name": "StackExchange"
}
| 7 |
[
{
"begin": 0,
"end": 229,
"score": 0
},
{
"begin": 229,
"end": 241,
"score": 1
},
{
"begin": 241,
"end": 896,
"score": 0
},
{
"begin": 896,
"end": 946,
"score": 1
},
{
"begin": 946,
"end": 1393,
"score": 0
},
{
"begin": 1393,
"end": 1401,
"score": 1
},
{
"begin": 1401,
"end": 1402,
"score": 0
},
{
"begin": 1402,
"end": 1405,
"score": 1
}
] |
The day after the Chargers cast doubt on their ability to put a proposal for a new stadium before voters next fall, some skeptics wondered whether the announcement was spin or the real deal.
The team announced Thursday that it has been trying for almost a year to find a development partner but had been hampered by the political and financial turmoil at San Diego City Hall.
Absent a partner who would share the risk on $800 million in upfront development costs for a new $450 million stadium and a housing and commercial project at the Qualcomm Stadium site, a Chargers spokesman said the team may not get ballot language to the city by February to qualify the proposal for a November 2006 election.
The team says it needs time to circulate the petition in the weeks after February to gather signatures from registered voters to get the measure on the fall ballot.
Yesterday, as two representatives of the Chargers reiterated their concerns at a luncheon meeting of civic leaders, there was skepticism in some quarters and support in others.
"That's spin. It's a PR move," said City Attorney Michael Aguirre, who before he was elected last year often questioned the city's dealings with the Chargers.
He said neither the city's pension deficit of at least $1.4 billion nor the vacancies of a mayor and two City Council members should prevent the team from going ahead with the ballot measure.
It would ask voters whether the city should give the team 60 acres at the Qualcomm site to build housing, a hotel, offices and retail outlets. The revenue from the developments would pay for a new stadium, which would be built on the 166-acre site.
"It's a mystery to me why that project can't be put before the people of San Diego so they can decide," said Aguirre, adding that he is willing to discuss any ideas or concerns the Chargers may have.
Businessman Dan Shea, a Chargers' booster, said he believes the team is having difficulty finding a partner, and the city should create a backup plan to help keep the team in the county.
The Chargers can begin talking in January 2007 with other cities about relocating. Shea wants the city to amend its lease with the team to allow it to talk with other cities in the county. Under the lease, the team can leave town after the 2008 season.
"We're in danger of losing this team," Shea said.
Former Councilman Bruce Henderson, who unsuccessfully sued to prevent public money from being spent on the Padres' downtown ballpark and to stop a 1997 expansion of Qualcomm Stadium, said he believes the Chargers really want to leave.
Henderson said the Mission Valley site poses enormous challenges, including traffic congestion, petrochemical contamination and expensive development costs.
"They're talking about spending $800 million up front. That's an incredible amount for even a billionaire," Henderson said. "I don't believe the plan is real. I don't think they're serious."
Libertarian activist Richard Rider, who made a failed bid for mayor this year, said he believes the team is threatening to pull the proposal off the table because the Chargers are not off to a winning start.
The Chargers need a winning season to capture voter support for the proposal, he said. The team has a 2-3 record.
"They've done their marketing, and they sense the time is not right," Rider said.
At a meeting yesterday of the Catfish Club, Chargers Vice President Jim Steeg and team spokesman Mark Fabiani said they are working to make the November 2006 ballot. If that doesn't work, the team will try for 2007.
"We're determined to work with everyone," Fabiani said. "We believe that if we can sit down and talk about it (the stadium proposal), we can convince them it's a good idea."
The team is scheduled Wednesday to provide an update on the ballot proposal to the City Council's Land Use and Housing Committee.
Steeg said the team is off to a great start this season in ticket sales, having had its biggest crowd ever when the Chargers lost Monday night to the Pittsburgh Steelers.
The team knows it has to overcome an impression that owner Alex Spanos has been a "taker" in San Diego since buying the team in 1984, Steeg said. He also said Spanos gives generously to charity but does not publicize it.
Fabiani said the team has not talked to other cities about a new stadium because it would violate the Chargers' lease with the city. The team won't pursue the right to talk with other cities, he said, but would "take advantage of it" if the council decided to permit the discussions.
Since last November, the team has received seven letters from individuals asking about a possible move. Three involved Chula Vista, with one each from National City, Pasadena, Anaheim and a businessman in the county. The Pasadena and Anaheim letters were general and did not include a relocation proposal.
All of the letters were forwarded to the City Attorney's Office, and the team, abiding by its lease, did not engage in discussions, Fabiani said.
The Chargers have looked at other sites in the city, but no other ones make sense from the standpoint of fan familiarity and accessible mass transit, Steeg said. Of the 68,000 who attended Monday night's game, 19,000 rode the trolley, he said.
While several cities in San Diego County yesterday reported a lack of interest or a lack of available land for a stadium, Chula Vista Councilman John McCann said his city could accommodate the Chargers' new home.
McCann, who wrote one of the letters, said the city would be interested in talking to the Chargers should the team expand its search.
Chula Vista, he said, has vacant land on the east side and a major roadway being built – south state Route 125 is scheduled to open in October 2006. The city's border proximity is also a benefit, McCann said.
While the Chula Vista bayfront is unavailable because of a proposed development, McCann said Otay Ranch would work.
|
{
"pile_set_name": "Pile-CC"
}
| 116 |
[
{
"begin": 0,
"end": 18,
"score": 0
},
{
"begin": 18,
"end": 26,
"score": 1
},
{
"begin": 26,
"end": 211,
"score": 0
},
{
"begin": 211,
"end": 219,
"score": 1
},
{
"begin": 219,
"end": 356,
"score": 0
},
{
"begin": 356,
"end": 359,
"score": 1
},
{
"begin": 359,
"end": 360,
"score": 0
},
{
"begin": 360,
"end": 365,
"score": 1
},
{
"begin": 365,
"end": 366,
"score": 0
},
{
"begin": 366,
"end": 370,
"score": 1
},
{
"begin": 370,
"end": 371,
"score": 0
},
{
"begin": 371,
"end": 375,
"score": 1
},
{
"begin": 375,
"end": 540,
"score": 0
},
{
"begin": 540,
"end": 548,
"score": 1
},
{
"begin": 548,
"end": 549,
"score": 0
},
{
"begin": 549,
"end": 556,
"score": 1
},
{
"begin": 556,
"end": 565,
"score": 0
},
{
"begin": 565,
"end": 573,
"score": 1
},
{
"begin": 573,
"end": 641,
"score": 0
},
{
"begin": 641,
"end": 649,
"score": 1
},
{
"begin": 649,
"end": 680,
"score": 0
},
{
"begin": 680,
"end": 688,
"score": 1
},
{
"begin": 688,
"end": 778,
"score": 0
},
{
"begin": 778,
"end": 786,
"score": 1
},
{
"begin": 786,
"end": 912,
"score": 0
},
{
"begin": 912,
"end": 920,
"score": 1
},
{
"begin": 920,
"end": 1070,
"score": 0
},
{
"begin": 1070,
"end": 1072,
"score": 1
},
{
"begin": 1072,
"end": 1085,
"score": 0
},
{
"begin": 1085,
"end": 1089,
"score": 1
},
{
"begin": 1089,
"end": 1090,
"score": 0
},
{
"begin": 1090,
"end": 1098,
"score": 1
},
{
"begin": 1098,
"end": 1099,
"score": 0
},
{
"begin": 1099,
"end": 1106,
"score": 1
},
{
"begin": 1106,
"end": 1107,
"score": 0
},
{
"begin": 1107,
"end": 1114,
"score": 1
},
{
"begin": 1114,
"end": 1198,
"score": 0
},
{
"begin": 1198,
"end": 1206,
"score": 1
},
{
"begin": 1206,
"end": 1314,
"score": 0
},
{
"begin": 1314,
"end": 1318,
"score": 1
},
{
"begin": 1318,
"end": 1319,
"score": 0
},
{
"begin": 1319,
"end": 1326,
"score": 1
},
{
"begin": 1326,
"end": 1476,
"score": 0
},
{
"begin": 1476,
"end": 1484,
"score": 1
},
{
"begin": 1484,
"end": 1725,
"score": 0
},
{
"begin": 1725,
"end": 1728,
"score": 1
},
{
"begin": 1728,
"end": 1729,
"score": 0
},
{
"begin": 1729,
"end": 1734,
"score": 1
},
{
"begin": 1734,
"end": 1761,
"score": 0
},
{
"begin": 1761,
"end": 1768,
"score": 1
},
{
"begin": 1768,
"end": 1833,
"score": 0
},
{
"begin": 1833,
"end": 1841,
"score": 1
},
{
"begin": 1841,
"end": 1865,
"score": 0
},
{
"begin": 1865,
"end": 1868,
"score": 1
},
{
"begin": 1868,
"end": 1869,
"score": 0
},
{
"begin": 1869,
"end": 1873,
"score": 1
},
{
"begin": 1873,
"end": 1877,
"score": 0
},
{
"begin": 1877,
"end": 1885,
"score": 1
},
{
"begin": 1885,
"end": 2045,
"score": 0
},
{
"begin": 2045,
"end": 2053,
"score": 1
},
{
"begin": 2053,
"end": 2075,
"score": 0
},
{
"begin": 2075,
"end": 2082,
"score": 1
},
{
"begin": 2082,
"end": 2124,
"score": 0
},
{
"begin": 2124,
"end": 2128,
"score": 1
},
{
"begin": 2128,
"end": 2334,
"score": 0
},
{
"begin": 2334,
"end": 2338,
"score": 1
},
{
"begin": 2338,
"end": 2353,
"score": 0
},
{
"begin": 2353,
"end": 2363,
"score": 1
},
{
"begin": 2363,
"end": 2364,
"score": 0
},
{
"begin": 2364,
"end": 2369,
"score": 1
},
{
"begin": 2369,
"end": 2370,
"score": 0
},
{
"begin": 2370,
"end": 2379,
"score": 1
},
{
"begin": 2379,
"end": 2453,
"score": 0
},
{
"begin": 2453,
"end": 2459,
"score": 1
},
{
"begin": 2459,
"end": 2511,
"score": 0
},
{
"begin": 2511,
"end": 2519,
"score": 1
},
{
"begin": 2519,
"end": 2520,
"score": 0
},
{
"begin": 2520,
"end": 2527,
"score": 1
},
{
"begin": 2527,
"end": 2550,
"score": 0
},
{
"begin": 2550,
"end": 2558,
"score": 1
},
{
"begin": 2558,
"end": 2582,
"score": 0
},
{
"begin": 2582,
"end": 2591,
"score": 1
},
{
"begin": 2591,
"end": 2601,
"score": 0
},
{
"begin": 2601,
"end": 2608,
"score": 1
},
{
"begin": 2608,
"end": 2609,
"score": 0
},
{
"begin": 2609,
"end": 2615,
"score": 1
},
{
"begin": 2615,
"end": 2848,
"score": 0
},
{
"begin": 2848,
"end": 2857,
"score": 1
},
{
"begin": 2857,
"end": 2953,
"score": 0
},
{
"begin": 2953,
"end": 2960,
"score": 1
},
{
"begin": 2960,
"end": 2961,
"score": 0
},
{
"begin": 2961,
"end": 2966,
"score": 1
},
{
"begin": 2966,
"end": 3099,
"score": 0
},
{
"begin": 3099,
"end": 3107,
"score": 1
},
{
"begin": 3107,
"end": 3145,
"score": 0
},
{
"begin": 3145,
"end": 3153,
"score": 1
},
{
"begin": 3153,
"end": 3326,
"score": 0
},
{
"begin": 3326,
"end": 3331,
"score": 1
},
{
"begin": 3331,
"end": 3369,
"score": 0
},
{
"begin": 3369,
"end": 3376,
"score": 1
},
{
"begin": 3376,
"end": 3377,
"score": 0
},
{
"begin": 3377,
"end": 3381,
"score": 1
},
{
"begin": 3381,
"end": 3383,
"score": 0
},
{
"begin": 3383,
"end": 3391,
"score": 1
},
{
"begin": 3391,
"end": 3392,
"score": 0
},
{
"begin": 3392,
"end": 3396,
"score": 1
},
{
"begin": 3396,
"end": 3397,
"score": 0
},
{
"begin": 3397,
"end": 3406,
"score": 1
},
{
"begin": 3406,
"end": 3407,
"score": 0
},
{
"begin": 3407,
"end": 3410,
"score": 1
},
{
"begin": 3410,
"end": 3411,
"score": 0
},
{
"begin": 3411,
"end": 3416,
"score": 1
},
{
"begin": 3416,
"end": 3436,
"score": 0
},
{
"begin": 3436,
"end": 3440,
"score": 1
},
{
"begin": 3440,
"end": 3441,
"score": 0
},
{
"begin": 3441,
"end": 3448,
"score": 1
},
{
"begin": 3448,
"end": 3483,
"score": 0
}
] |
I just got in from collecting Japanese beetles from wild Evening Primrose flowers which are growing throughout my property. By 7 a.m. the bees are already busy on the yellow flowers, and the beetles are just waking up. Slowly I knock them into a container of water, careful not to interrupt the bees. Two things are accomplished by my doing this twice a day. First, I am saving the flowers from being devoured, and second, my chickens enthusiastically consume the crunchy bodies of these pests. Useful pests, I call them, providing extra protein and minerals for my birds.
The wild Evening Primrose used be seen in areas along roads which have not been mowed, in vacant fields and ditches if they are lucky, and in my gardens. Sadly I see very few of them this year, beyond my gardens, due to herbiciding and lots of mowing. I imagine most home owners would not like them since they grow much taller than the greenhouse cultivated primroses most gardeners buy. Perhaps this aversion is due to an over civilized fear of wild natives. Well, I have no fear, just curiosity. I have never seen my primroses grow as tall as they are this year which is most likely due to all the rain we had earlier this summer. My tallest plant towers above my head at a record breaking height of 9 feet. Now that’s tall !
For some reason I have a particular interest in tall, gangly, misunderstood plants. I suppose that is because I see their value for our pollinators, but mostly I believe it is because I admire them. In truth, I am blown away by the diversity of wild flora which are indigenous to this area, and have made it my mission to preserve as much as I can here on my property and elsewhere when possible, before they become extinct. I know my worry is legitimate since every year it seems many rare plants (see list at bottom of this article) have just disappeared from places I have seen them in the past. So, I am writing here to clear up misunderstandings about our interesting wild neighbors, and possibly to save them
Teasel, another plant which is normally not permitted to grow in typical gardens, can still be seen in areas along the highway and other unused places. It is not a thistle, though it looks like it. In my gardens I pamper it. It has multiple uses, primarily as a producer of beautiful lavender flowers which bees love. It is also an interesting component in dry plant arrangements which I make. Stately, but prickly, they are to be handled with care, preferably with a gloved hand. Presently I am cutting some of mine down now that they have flowered as I don’t want the seeds to scatter everywhere in my main garden where I also grow vegetables. I plan to scatter some of the seeds in the larger meadow before winter.
By far the most misunderstood wildflower of all is Golden Rod. I have learned through my reading that it is not the pollen producer that affects most people adversely. Ragweed is the culprit as it has very nondescript flowers and blooms at the same time as Golden Rod. Very sneaky of Ragweed, I would say. The pollen from Golden Rod is too heavy to be carried very far by the wind whereas ragweed pollen is very light. There are 16 species of Golden Rod throughout our country, and I happen to have about 4 or more species on my property. They are beginning to bloom, and I eagerly await the show ! All my various wild aster will bloom soon as well, so between the two of them my bees and butterflies will be well fed before the killing frost. Along with all these pollinators you can be sure I will be rejoicing as well !
The other day I nearly hit a Monarch butterfly which was caught between a road, parking lots, stores, and large grass deserts with no flowers in sight. It seemed confused and did not know where to go. This is a perfect example of a growing problem called “habitat fragmentation.”. Good-hearted people who plant flowers in their yards are doing a great service, but these same butterflies and bees we feed frequently must travel far and wide just to find other flowers to feed on or appropriate plants on which to lay their eggs. We all know the need of Monarchs for Milkweed, but there are many others, such as the larvae of the Fritillary butterfly for violets, the Checkerspot for Trutlehead flowers and the rare/endangered butterflies in the Blues Family for clovers and Lupine flowers.
Lately, and even over many years, I have been reading writings by prominent mystics and naturalists who all sing a similar theme song. This song is one of praise for creation and its awesome diversity which can aid us as humans to connect more intimately with ourselves and the Creator. This goes for everyone, even atheists and agnostics, for “things in nature are optimal teachers to help us discern how to be ourselves. We have been separated from the source of our identity and have to fall in love with it all over again “. Thus writes Belden Lane in his book Backpacking with the Saints, an amazing read full of wisdom.
And so, this Sunday morning the natural world is the temple in which I worship, today, and everyday. For me, and so many others, the amazing diversity of life forms on this planet are not only an expression of the infinite nature of their Creator, but also an expression of amazing love, without end, unless we humans choose to continue to destroy it. We always have a choice.
This art series advocates Organic Agriculture (Gardening / Farming / Foraging), Permaculture, and Sustainable Architecture. A series of ‘beautiful’ images of humans and animals, males and females, working or meditating or playing in the garden, farm field, barn, orchard, or wilderness…. poses not bound to traditional commercial or pinup surface objectification… in favor of equal-rights showing strength, intelligence, and skill. One idea being that people will see attractive or cute people and other sentient beings gardening, and more and more people will want to garden and feel or look like them; and by relating to them, they will want to garden; and vice versa. Based on “Organic Pinup Girls” project, expanded.
Journalist Laura Flanders about SCOD Bog Peeps – “If I had to pick an avatar from those cool Organic gardeners, I’d go for the green haired woman with the shoulder tattoo and the shovel. Funnily enough, I just walked inside after a morning spent wielding a machete in an overgrown garden.” – in an email to Drogo 8/2/2017
Savannah has the historic integrity of an ivy-league campus, yet for the poor as well as rich. Yes, it is very much the old pirate ‘Port Royal’ still, but in some ways it also surpasses the nobility of elite university campuses. Even the SCAD (Savannah College of Art & Design) campus is spread throughout the city, and SCAD classes are held in renovated industrial buildings, often with Richardsonian strength; so that liberal education is fully-integrated with the city. As far as competing with modern industrial metropolitan cities, Savannah has plenty of modern and post-modern architecture, and SCAD teaches cutting-edge technology; but it has no desire to be as massively impersonal as New York, or any other major city.
Savannah urban design is overwhelmingly utopian, despite there being dystopian flavors as well. The main streets force cars to either park or drive around the eleven park squares (circuses), while pedestrians can go straight through on sidewalks and bike lanes. It is easy to find any place in the formal city because there are no diagonal streets, one tall building in the middle (DeSoto Hotel), and a few tall buildings downtown parallel with the Savannah River. The downtown main-streets (River Street) on Saint Patrick’s Day are celebrated on par with Mardi-Gras. There are so many unique aspects to Savannah, from its very origins. The basic ‘Roman encampment’ grid urban layout is flavored by multiple circuses with vegetation. Live-oaks, palms, and crepe-myrtle trees are naturally hung with Spanish moss. From sandy soil hedges, herbs, flowers and grasses are also publicly grown for the enjoyment of all.
I will find out more about the city founders, besides Oglethorpe; specifically the Native American chief of the local Creek Indians, because he seems to deserve the same level of respect as the English founder, Oglethorpe. The British and Indians were friends, and one of the largest monuments in a prominent park is dedicated to the Indian Chief’s grave. Southern hospitality is less surface courtesy in Savannah, and more a part of its essence; in regards to integration of whites and blacks, international representation, multi-culturalism, and willingness to welcome even enemies (like General Sherman during the Civil War).
There are several ways to consider the social types that comprise the ‘daily population’ of Savannah. There are five basic social types; the rich residents (white blue-blood aristocracy and new-money millionaires), the poor working-class (merchant and service residents and workers), the street beggars (homeless, hustlers, artists), SCAD students (artists, professors, staff), and tourists (pedestrian, trolley, horse-buggy).
According to Dr. Hsu-Jen Huang (SCAD Architecture Professor), Savannah has been growing, even during the recession. In ten years, the city population and SCAD enrollment have doubled. Some buildings still fall between the cracks, but for every loss two more renovations or new constructs emerge. After the 1994 book Midnight In the Garden of Good and Evil, Savannah has continued to blossom as one of the best cities in the World. Many of its qualities were always inherent in the original urban design, and it continues to grow because of accepted differences.
From the American Revolution, to the Civil War, and beyond; Savannah embraces its strange stories. It has an other-worldly, old world, old town feel. Ghost tours are quite at home with the lamp-lights, cobblestone streets, brick walkways, and French ironwork balconies. It is in fact a small city; one which favors pedestrian traffic more than automobiles. The whole downtown is walkable, and locals often easily commute with bicycles as well (as I did for 3 years).
There are so many fun things to do there, it might be hard to know were to begin; if Savannah were not an immediately immersible, hospitable environment. The whole city is a memory garden, which literally blooms because of all the flowers. There are less flowers and leaves in the Winter, but Fall, Winter, and Spring are best weather-wise; as there is rarely snow, and Summers are often walls of heat and humidity (which it is known for even during Fall and Spring).
Architecturally Savannah is truly unique, with historic world and southern romantic blends. Town-houses often have the side-porch design, as with nearby Charleston, SC. The cast-iron railings and french dormers have that New Orleans feel. Parks and trees really do make a huge difference for traffic. Even while continuing to grow, Savannah is still one of the most colorful and pedestrian friendly cities in America. I can say after living there, the magic is real; including the variety of character personalities that the famous book alludes to.
Midnight In the Garden of Good & Evil describes much of the architectural and social feel of the town. ‘Midnight’ the book has much more analysis of detail, while the film has literally has more visual images. I lived in three parts of town, and often passed by famous landmarks on daily commutes to classes. The main character’s house (Mercer Mansion) is on Bull Street along a square, towards the largest city park, Forsyth Park. Forsyth Park was my favorite park that I loved living on, because of the large open grass lawns, largest and most beautiful fountain, organic paths, and shady flora. There I was free to publicly practice Tai-Chi, hippy folk music, or jogging without much bother.
Most of this essay describes the utopian aspects of Savannah, but this paragraph should put some of the dystopian perspectives in context. The poor and the dead, out-number the rich and the living. Southern swamp-lands naturally have a salty entropic power that corrodes metals, moisture that promotes the decay of organic matter, and massive humidity that stifles productive activity, while encouraging roaches and gnats. The humane social ‘decadence’ of the town, allows for an ease of poverty. Kindness tolerates and sometimes falls prey to hustlers. Vandalism and theft are common crimes in Savannah, with the occasional mugging (typical of cities in general). Although crimes are committed by lower classes, the majority (which are poor) are respectful, lawful, and often generous. So you see despite the ‘scariness’, actual dangers are minimal for a city.
Savannah’s name appropriately indicates the climate heat, and the flat field look of the surrounding wetland marsh grasses. Old pirate maps referred to the lands inland along the River as ‘Savannah Land’. Google Street view is very impressive, with realism. It really helps get the feel for the freedom of moving through the town by photographic vista. In the 1990’s we were taking panoramic photos for architecture projects so it really feels appropriate. Day trips easily include the famous Bonaventure Cemetery, Oatland Island Wildlife Center, and Tybee Island Beach.
Two basic plans for spiral gardens. The green represents vegetation (herbs, flowers, grasses, shrubs, hedges, veggies, etc), the brown is for tilled soil edging (regularly cleared using hoe, mattock, etc), and the grey is the path made using gravel, bricks, blocks, tiles, sand, or whatever you want. The center of the designs can also feature sculptures, bird baths, etc….
I suppose it is fair warning to tell people that Mints tend to want to take over a garden, just in case they do not want that. I however, am perfectly happy with my 7 types of mint taking over the whole lawn if they want; and they are welcome to leave my property and go visit other places if they so choose. Sure you can try to wall it in, or keep it in a pot, but I say let it go! Stop trying to control mint, when it is such a perfect plant, much better than lawn grass (or crab-grass). In fact it is my favorite type of plant because it is so independent, and edible, and gives us nice flowers to share with the bees and butterflies.
In the photos you can see how mint looks when it is given the freedom to explore a garden. The photo is taken after years of trying to control the mints. The year before the photos were taken, the entire garden was stacked with wood and burned in a bonfire. The mint regrew from their own roots. Years after the photos, trucks and bulldozers drove over the site crushing everything. However the mint is back…on its own!
You can clear areas of the mint to temporarily grow other things, like vegetables (see photos for a center crop of squash), and then when the veggies are done, the mint will close the gap again as only the strongest weeds can. Why fight such a beneficial and pleasant herb? I say, let the mint grow!!! Peppermint, Spearmint, Lemonbalm, Beebalm, and even the mighty Applemint. Let it grow, let it grow, let it grow. Go “mintal” and get “balmy”.
General Description: Annual, reproducing only by seed. Resembles a small Sunflower plant, with very similar fury serrated leaves, but distinguished by tiny yellow flowers and rotund seedpods. This weed is targeted by industrial farmers for annihilation. It usually grows less than 3 feet tall in gardens, but on farms has been know to grow over 6 feet tall.
Main-stream America should be more aware of just how sexy organic farming and gardening can be! The fossil-fuel industry has had the market for pin-up girls for far too long, so now it is time to advertise for alternative and renewable livelihoods.
This is a neo-pagan attempt to advocate organic gardening / farming. A series of sexy modern-feminist styles related to paper-doll, cut-and-paste, cartoon tracery of women. Working in the garden or farm field or orchard…. poses not bound to traditional pinup surface objectification… in favor of equal-rights showing strength, intelligence and skill. One idea being that people will see sexy women gardening, and want to garden and look like them; and by looking like them, they will want to garden; and vice-versa.
This is the first collection of “Organic Farm and Garden Women”, and more will be added as the art is created, expressed, and captured.
This tryptic scene is collage from Knight’s paintings and other random models.
|
{
"pile_set_name": "Pile-CC"
}
| 169 |
[
{
"begin": 0,
"end": 57,
"score": 0
},
{
"begin": 57,
"end": 64,
"score": 1
},
{
"begin": 64,
"end": 65,
"score": 0
},
{
"begin": 65,
"end": 73,
"score": 1
},
{
"begin": 73,
"end": 359,
"score": 0
},
{
"begin": 359,
"end": 364,
"score": 1
},
{
"begin": 364,
"end": 583,
"score": 0
},
{
"begin": 583,
"end": 590,
"score": 1
},
{
"begin": 590,
"end": 591,
"score": 0
},
{
"begin": 591,
"end": 599,
"score": 1
},
{
"begin": 599,
"end": 2019,
"score": 0
},
{
"begin": 2019,
"end": 2025,
"score": 1
},
{
"begin": 2025,
"end": 2789,
"score": 0
},
{
"begin": 2789,
"end": 2795,
"score": 1
},
{
"begin": 2795,
"end": 2796,
"score": 0
},
{
"begin": 2796,
"end": 2799,
"score": 1
},
{
"begin": 2799,
"end": 2906,
"score": 0
},
{
"begin": 2906,
"end": 2913,
"score": 1
},
{
"begin": 2913,
"end": 2995,
"score": 0
},
{
"begin": 2995,
"end": 3001,
"score": 1
},
{
"begin": 3001,
"end": 3002,
"score": 0
},
{
"begin": 3002,
"end": 3005,
"score": 1
},
{
"begin": 3005,
"end": 3022,
"score": 0
},
{
"begin": 3022,
"end": 3029,
"score": 1
},
{
"begin": 3029,
"end": 3060,
"score": 0
},
{
"begin": 3060,
"end": 3066,
"score": 1
},
{
"begin": 3066,
"end": 3067,
"score": 0
},
{
"begin": 3067,
"end": 3070,
"score": 1
},
{
"begin": 3070,
"end": 3181,
"score": 0
},
{
"begin": 3181,
"end": 3187,
"score": 1
},
{
"begin": 3187,
"end": 3188,
"score": 0
},
{
"begin": 3188,
"end": 3191,
"score": 1
},
{
"begin": 3191,
"end": 3591,
"score": 0
},
{
"begin": 3591,
"end": 3598,
"score": 1
},
{
"begin": 3598,
"end": 4115,
"score": 0
},
{
"begin": 4115,
"end": 4123,
"score": 1
},
{
"begin": 4123,
"end": 4128,
"score": 0
},
{
"begin": 4128,
"end": 4136,
"score": 1
},
{
"begin": 4136,
"end": 4191,
"score": 0
},
{
"begin": 4191,
"end": 4201,
"score": 1
},
{
"begin": 4201,
"end": 4229,
"score": 0
},
{
"begin": 4229,
"end": 4240,
"score": 1
},
{
"begin": 4240,
"end": 4245,
"score": 0
},
{
"begin": 4245,
"end": 4255,
"score": 1
},
{
"begin": 4255,
"end": 4307,
"score": 0
},
{
"begin": 4307,
"end": 4312,
"score": 1
},
{
"begin": 4312,
"end": 4313,
"score": 0
},
{
"begin": 4313,
"end": 4319,
"score": 1
},
{
"begin": 4319,
"end": 4336,
"score": 0
},
{
"begin": 4336,
"end": 4342,
"score": 1
},
{
"begin": 4342,
"end": 4631,
"score": 0
},
{
"begin": 4631,
"end": 4638,
"score": 1
},
{
"begin": 4638,
"end": 4894,
"score": 0
},
{
"begin": 4894,
"end": 4900,
"score": 1
},
{
"begin": 4900,
"end": 4901,
"score": 0
},
{
"begin": 4901,
"end": 4905,
"score": 1
},
{
"begin": 4905,
"end": 4918,
"score": 0
},
{
"begin": 4918,
"end": 4929,
"score": 1
},
{
"begin": 4929,
"end": 4939,
"score": 0
},
{
"begin": 4939,
"end": 4945,
"score": 1
},
{
"begin": 4945,
"end": 4993,
"score": 0
},
{
"begin": 4993,
"end": 4999,
"score": 1
},
{
"begin": 4999,
"end": 5219,
"score": 0
},
{
"begin": 5219,
"end": 5226,
"score": 1
},
{
"begin": 5226,
"end": 5384,
"score": 0
},
{
"begin": 5384,
"end": 5391,
"score": 1
},
{
"begin": 5391,
"end": 5392,
"score": 0
},
{
"begin": 5392,
"end": 5403,
"score": 1
},
{
"begin": 5403,
"end": 5405,
"score": 0
},
{
"begin": 5405,
"end": 5414,
"score": 1
},
{
"begin": 5414,
"end": 5427,
"score": 0
},
{
"begin": 5427,
"end": 5435,
"score": 1
},
{
"begin": 5435,
"end": 5438,
"score": 0
},
{
"begin": 5438,
"end": 5450,
"score": 1
},
{
"begin": 5450,
"end": 5456,
"score": 0
},
{
"begin": 5456,
"end": 5467,
"score": 1
},
{
"begin": 5467,
"end": 5468,
"score": 0
},
{
"begin": 5468,
"end": 5480,
"score": 1
},
{
"begin": 5480,
"end": 6039,
"score": 0
},
{
"begin": 6039,
"end": 6046,
"score": 1
},
{
"begin": 6046,
"end": 6047,
"score": 0
},
{
"begin": 6047,
"end": 6052,
"score": 1
},
{
"begin": 6052,
"end": 6053,
"score": 0
},
{
"begin": 6053,
"end": 6058,
"score": 1
},
{
"begin": 6058,
"end": 6080,
"score": 0
},
{
"begin": 6080,
"end": 6090,
"score": 1
},
{
"begin": 6090,
"end": 6091,
"score": 0
},
{
"begin": 6091,
"end": 6096,
"score": 1
},
{
"begin": 6096,
"end": 6097,
"score": 0
},
{
"begin": 6097,
"end": 6105,
"score": 1
},
{
"begin": 6105,
"end": 6117,
"score": 0
},
{
"begin": 6117,
"end": 6120,
"score": 1
},
{
"begin": 6120,
"end": 6121,
"score": 0
},
{
"begin": 6121,
"end": 6126,
"score": 1
},
{
"begin": 6126,
"end": 6173,
"score": 0
},
{
"begin": 6173,
"end": 6180,
"score": 1
},
{
"begin": 6180,
"end": 6267,
"score": 0
},
{
"begin": 6267,
"end": 6274,
"score": 1
},
{
"begin": 6274,
"end": 6387,
"score": 0
},
{
"begin": 6387,
"end": 6392,
"score": 1
},
{
"begin": 6392,
"end": 6403,
"score": 0
},
{
"begin": 6403,
"end": 6411,
"score": 1
},
{
"begin": 6411,
"end": 6535,
"score": 0
},
{
"begin": 6535,
"end": 6539,
"score": 1
},
{
"begin": 6539,
"end": 6540,
"score": 0
},
{
"begin": 6540,
"end": 6545,
"score": 1
},
{
"begin": 6545,
"end": 6647,
"score": 0
},
{
"begin": 6647,
"end": 6655,
"score": 1
},
{
"begin": 6655,
"end": 6656,
"score": 0
},
{
"begin": 6656,
"end": 6663,
"score": 1
},
{
"begin": 6663,
"end": 6667,
"score": 0
},
{
"begin": 6667,
"end": 6670,
"score": 1
},
{
"begin": 6670,
"end": 6673,
"score": 0
},
{
"begin": 6673,
"end": 6679,
"score": 1
},
{
"begin": 6679,
"end": 6791,
"score": 0
},
{
"begin": 6791,
"end": 6804,
"score": 1
},
{
"begin": 6804,
"end": 6940,
"score": 0
},
{
"begin": 6940,
"end": 6948,
"score": 1
},
{
"begin": 6948,
"end": 7096,
"score": 0
},
{
"begin": 7096,
"end": 7099,
"score": 1
},
{
"begin": 7099,
"end": 7100,
"score": 0
},
{
"begin": 7100,
"end": 7104,
"score": 1
},
{
"begin": 7104,
"end": 7132,
"score": 0
},
{
"begin": 7132,
"end": 7140,
"score": 1
},
{
"begin": 7140,
"end": 7514,
"score": 0
},
{
"begin": 7514,
"end": 7520,
"score": 1
},
{
"begin": 7520,
"end": 7521,
"score": 0
},
{
"begin": 7521,
"end": 7526,
"score": 1
},
{
"begin": 7526,
"end": 7581,
"score": 0
},
{
"begin": 7581,
"end": 7589,
"score": 1
},
{
"begin": 7589,
"end": 7590,
"score": 0
},
{
"begin": 7590,
"end": 7595,
"score": 1
},
{
"begin": 7595,
"end": 7624,
"score": 0
},
{
"begin": 7624,
"end": 7629,
"score": 1
},
{
"begin": 7629,
"end": 7630,
"score": 0
},
{
"begin": 7630,
"end": 7636,
"score": 1
},
{
"begin": 7636,
"end": 7641,
"score": 0
},
{
"begin": 7641,
"end": 7646,
"score": 1
},
{
"begin": 7646,
"end": 7647,
"score": 0
},
{
"begin": 7647,
"end": 7654,
"score": 1
},
{
"begin": 7654,
"end": 7657,
"score": 0
},
{
"begin": 7657,
"end": 7660,
"score": 1
},
{
"begin": 7660,
"end": 7688,
"score": 0
},
{
"begin": 7688,
"end": 7698,
"score": 1
},
{
"begin": 7698,
"end": 7736,
"score": 0
},
{
"begin": 7736,
"end": 7744,
"score": 1
},
{
"begin": 7744,
"end": 7780,
"score": 0
},
{
"begin": 7780,
"end": 7785,
"score": 1
},
{
"begin": 7785,
"end": 8101,
"score": 0
},
{
"begin": 8101,
"end": 8111,
"score": 1
},
{
"begin": 8111,
"end": 8130,
"score": 0
},
{
"begin": 8130,
"end": 8136,
"score": 1
},
{
"begin": 8136,
"end": 8137,
"score": 0
},
{
"begin": 8137,
"end": 8145,
"score": 1
},
{
"begin": 8145,
"end": 8165,
"score": 0
},
{
"begin": 8165,
"end": 8170,
"score": 1
},
{
"begin": 8170,
"end": 8171,
"score": 0
},
{
"begin": 8171,
"end": 8178,
"score": 1
},
{
"begin": 8178,
"end": 8241,
"score": 0
},
{
"begin": 8241,
"end": 8248,
"score": 1
},
{
"begin": 8248,
"end": 8258,
"score": 0
},
{
"begin": 8258,
"end": 8268,
"score": 1
},
{
"begin": 8268,
"end": 8286,
"score": 0
},
{
"begin": 8286,
"end": 8293,
"score": 1
},
{
"begin": 8293,
"end": 8381,
"score": 0
},
{
"begin": 8381,
"end": 8387,
"score": 1
},
{
"begin": 8387,
"end": 8388,
"score": 0
},
{
"begin": 8388,
"end": 8393,
"score": 1
},
{
"begin": 8393,
"end": 8403,
"score": 0
},
{
"begin": 8403,
"end": 8411,
"score": 1
}
] |
This invention relates generally to the use of body fluid-soluble nuclear matrix proteins as cellular markers. More particularly, the invention relates to a method of monitoring the degree of cell death in a tissue by monitoring the level of interior nuclear matrix proteins and/or fragments thereof released from cells in a body fluid-soluble form.
Cell death occurs as a function of healthy tissue homeostasis, as well as a result of disease or injury to the tissue. Detectable changes in the rate of cell death in a tissue therefore can provide an indication of the tissue's status. In normal growing tissue, for example, changes in the rate of cell death can indicate a new developmental stage. Alternatively, a sudden detected change in cell death in adult tissue can signal an injury to the tissue and also provide information on the type of injury. Previously, clinical assessment of tissue viability has required presentation of clinical symptoms and a visual inspection of the tissue itself, requiring observation of the morphology of cells in a tissue sample, and/or an indirect estimation of cell death by measuring changes in tissue/organ size. While the state of the art of morphological observation has advanced significantly, reliance on histological observation of an abnormality requires that the abnormal cells comprise part of the tissue sample tested. Early stages of a malignancy therefore can be particularly difficult to detect by this method. Biochemical assessments of cell or tissue viability also generally have been difficult to interpret, primarily because in many instances cell death occurs in individual cells which are intimately intermixed with viable cells in a sample.
There exists a need for reliable means of monitoring the degree of cell death in a tissue which does not rely on histology or tissue biopsy. A particularly useful method would be one wherein the rate of cell death could be monitored in a body fluid assay. It is anticipated that the ability to accurately monitor tissue-specific cell death in a fluid assay would have significant impact on the study of tissue development and cell kinetics, as well as on many different clinical applications. For example, the method may be used to monitor the progress of a disease or injury associated with cell death, as well as to monitor the efficacy of a therapy for an affected tissue. The method also may be used to monitor the effect of the therapy on unaffected, normal tissue. In addition, the method may be used to evaluate a compound's cytotoxicity.
Recently, methods have been disclosed for extracting and isolating the normally highly insoluble interior nuclear matrix proteins from cells. Interior nuclear matrix proteins are proteins from within the boundaries of the nuclear matrix, termed "interior" nuclear matrix proteins, which are substantially free of chromatin proteins, and intermediate filaments, collectively termed "exterior" nuclear matrix proteins (see Penman et al., U.S. Pat No. 4,882,268, the disclosure of which is hereby incorporated by reference). In the method, the cell nucleus is isolated, the cytoskeleton proteins and chromatin are removed, the "nuclear matrix" is isolated, and the interior and exterior components of the nuclear matrix are separated. The nuclear matrix-intermediate filament complex comprises a specific fraction of cell protein constituting less than five percent of the total protein and six percent of the total DNA of the cell. The interior nuclear matrix comprises about one percent or less of the total cellular protein. It contains many proteins that differ according to cell type, and is highly enriched with type-specific antigens including cell-type and transformation-specific proteins that had not been detected using prior art procedures. It also contains the lamina and nuclear pore complex proteins. The separation method makes use of the unique properties of the nuclear matrix to achieve separation from substantially all other cell constituents. The method is simple, rapid, reproducible, achieves a high degree of purity, and is applicable to essentially all types of cells.
The method of Penman et al. has enabled the art to identify and isolate cell type-specific and transformation-specific interior nuclear matrix proteins of sufficient purity to allow antibodies to be made. These antibodies then can be used to detect cell type-specific interior nuclear matrix proteins in a sample, as disclosed in U.S. Pat. No. 5,273,877, the disclosure of which is incorporated herein by reference. As used therein and here, the term "cell-type" is understood to refer to cells of various different tissues such as neural, glial, muscle, liver, mesenchymal, and different types of epithelia and endothelia, as well as malignant cell forms and cells having an altered genomic expression profile caused by viral infection or other factors.
It is an object of this invention to provide a method for monitoring the degree of cell death in a body fluid assay by monitoring the level of body fluid-soluble interior nuclear matrix proteins in a fluid. Another object of the invention is to provide a method for quantifying the body fluid-soluble interior nuclear matrix proteins released from cells and present in a cell compatible fluid. Still another object of the invention is to provide a method for evaluating a therapy, or the progress of a disease associated with cell death by monitoring the degree of cell death in an affected tissue. Another object of the invention is to provide a method for assessing the toxicity of compounds by assessing their ability to induce cell death. Still another object of the invention is to provide a method for inducing the release of body fluid-soluble nuclear matrix proteins from eucaryotic cells. These and other objects and features of the invention will be apparent from the description and claims which follow.
|
{
"pile_set_name": "USPTO Backgrounds"
}
| 8 |
[
{
"begin": 0,
"end": 350,
"score": 0
},
{
"begin": 350,
"end": 354,
"score": 1
},
{
"begin": 354,
"end": 1467,
"score": 0
},
{
"begin": 1467,
"end": 1478,
"score": 1
},
{
"begin": 1478,
"end": 2693,
"score": 0
},
{
"begin": 2693,
"end": 2701,
"score": 1
},
{
"begin": 2701,
"end": 2972,
"score": 0
},
{
"begin": 2972,
"end": 2978,
"score": 1
},
{
"begin": 2978,
"end": 2992,
"score": 0
}
] |
Coles’ new move to offer cheaper fruit, veg
COLES is now offering its own range of unattractive fruit and vegetables to the public, in another attempt to cut its level of food waste.
The supermarket giant's new I'm Perfect range is being trialled in Victoria and South Australia first and includes:
*Apples (2kg)
*Pears (2kg)
*Oranges (3kg)
*Lemons (1kg)
*Onions (2kg)
*Carrots (2.5kg)
*Sweet Potatoes (2kg)
A Coles spokesman told News Corp the fruit and vegetables in the I'm Perfect range would always be cheaper than the standard range of produce in their stores.
The range would also be cheaper than those items which are on promotion.
He said that apples, which are currently $3.50 a kilo, would cost $5 for a 2kg bag in the I'm Perfect range.
Loose carrots are $2.20 a kilo or a bag of Coles' carrots are currently $2. But in the I'm Perfect range, carrots would cost $3.50 for a 2kg bag.
Coles also told News Corp that if successful, they would look to expand it nationally in the coming months.
Coles also confirmed each bag of produce comes in recyclable plastic that can be dropped off at Coles' REDcycle drop off points.
The new I'm Perfect range of unattractive fruit now available at Coles in SA and Victoria. Picture: Supplied
Coles General Manager of Produce, Brad Gorman, said in a statement the initiative was one way that Coles was working with suppliers to reduce food waste.
It comes as Coles continues to use imperfect fruit and vegetables across its private label products sold in-store, which include items like banana bread and muffins.
"Our customers know that regardless of shape, size or any small cosmetic blemishes, Coles produce is fresh and bursting with flavour," he said.
"So when we were thinking how to package produce that looked a little less than perfect, we thought we'd celebrate the fact that great-tasting fruit and veggies come in all shapes and sizes."
The new I'm Perfect range of unattractive fruit now available at Coles in SA and Victoria. Picture: Supplied
"All of these products help reduce food waste and increase overall crop yields by utilising
vegetable pieces that typically would not be sold at retail level."
Coles also has an ongoing national partnership with food waste charity SecondBite, where it has donated more than 36 million kilograms of unsold edible food, which equates to 72 million meals, between 2011 and 30 November 2018.
Between 2010 and 30 June 2018, Coles supermarkets also donated the equivalent of more than 17 million meals to Foodbank.
Some organic waste from its supermarkets that cannot be directed to food rescue is also sent to anaerobic digestion plants in Western Australia and New South Wales, where it is converted into clean energy and certified compost.
It comes as Woolworths still has its Odd Bunch program in stores nationally, where it sells its own range of strangely-staped fruit and vegetables at discount prices.
|
{
"pile_set_name": "Pile-CC"
}
| 50 |
[
{
"begin": 0,
"end": 5,
"score": 1
},
{
"begin": 5,
"end": 252,
"score": 0
},
{
"begin": 252,
"end": 260,
"score": 1
},
{
"begin": 260,
"end": 265,
"score": 0
},
{
"begin": 265,
"end": 270,
"score": 1
},
{
"begin": 270,
"end": 271,
"score": 0
},
{
"begin": 271,
"end": 280,
"score": 1
},
{
"begin": 280,
"end": 318,
"score": 0
},
{
"begin": 318,
"end": 323,
"score": 1
},
{
"begin": 323,
"end": 332,
"score": 0
},
{
"begin": 332,
"end": 339,
"score": 1
},
{
"begin": 339,
"end": 348,
"score": 0
},
{
"begin": 348,
"end": 354,
"score": 1
},
{
"begin": 354,
"end": 363,
"score": 0
},
{
"begin": 363,
"end": 369,
"score": 1
},
{
"begin": 369,
"end": 378,
"score": 0
},
{
"begin": 378,
"end": 385,
"score": 1
},
{
"begin": 385,
"end": 396,
"score": 0
},
{
"begin": 396,
"end": 401,
"score": 1
},
{
"begin": 401,
"end": 402,
"score": 0
},
{
"begin": 402,
"end": 410,
"score": 1
},
{
"begin": 410,
"end": 420,
"score": 0
},
{
"begin": 420,
"end": 425,
"score": 1
},
{
"begin": 425,
"end": 441,
"score": 0
},
{
"begin": 441,
"end": 445,
"score": 1
},
{
"begin": 445,
"end": 446,
"score": 0
},
{
"begin": 446,
"end": 450,
"score": 1
},
{
"begin": 450,
"end": 762,
"score": 0
},
{
"begin": 762,
"end": 767,
"score": 1
},
{
"begin": 767,
"end": 805,
"score": 0
},
{
"begin": 805,
"end": 810,
"score": 1
},
{
"begin": 810,
"end": 909,
"score": 0
},
{
"begin": 909,
"end": 914,
"score": 1
},
{
"begin": 914,
"end": 925,
"score": 0
},
{
"begin": 925,
"end": 929,
"score": 1
},
{
"begin": 929,
"end": 930,
"score": 0
},
{
"begin": 930,
"end": 934,
"score": 1
},
{
"begin": 934,
"end": 1018,
"score": 0
},
{
"begin": 1018,
"end": 1023,
"score": 1
},
{
"begin": 1023,
"end": 1114,
"score": 0
},
{
"begin": 1114,
"end": 1119,
"score": 1
},
{
"begin": 1119,
"end": 1213,
"score": 0
},
{
"begin": 1213,
"end": 1218,
"score": 1
},
{
"begin": 1218,
"end": 1222,
"score": 0
},
{
"begin": 1222,
"end": 1224,
"score": 1
},
{
"begin": 1224,
"end": 1229,
"score": 0
},
{
"begin": 1229,
"end": 1237,
"score": 1
},
{
"begin": 1237,
"end": 1239,
"score": 0
},
{
"begin": 1239,
"end": 1246,
"score": 1
},
{
"begin": 1246,
"end": 1248,
"score": 0
},
{
"begin": 1248,
"end": 1256,
"score": 1
}
] |
0% found this document useful (0 votes)
0 ratings 0% found this document useful (0 votes)
The Achaemenid Army in a Near Eastern Context
Save Save The Achaemenid Army in a Near Eastern Context For Later
0% 0% found this document useful, Mark this document as useful
0% 0% found this document not useful, Mark this document as not useful
Embed
Share
|
{
"pile_set_name": "OpenWebText2"
}
| 9 |
[
{
"begin": 0,
"end": 96,
"score": 0
},
{
"begin": 96,
"end": 106,
"score": 1
},
{
"begin": 106,
"end": 107,
"score": 0
},
{
"begin": 107,
"end": 111,
"score": 1
},
{
"begin": 111,
"end": 122,
"score": 0
},
{
"begin": 122,
"end": 129,
"score": 1
},
{
"begin": 129,
"end": 153,
"score": 0
},
{
"begin": 153,
"end": 163,
"score": 1
},
{
"begin": 163,
"end": 164,
"score": 0
},
{
"begin": 164,
"end": 168,
"score": 1
}
] |
/* Copyright (c) MediaArea.net SARL. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license that can
* be found in the License.html file in the root of the source tree.
*/
//---------------------------------------------------------------------------
// Pre-compilation
#include "MediaInfo/PreComp.h"
#ifdef __BORLANDC__
#pragma hdrstop
#endif
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
#include "MediaInfo/Setup.h"
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
#if defined(MEDIAINFO_DSF_YES)
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
#include "MediaInfo/Audio/File_Dsf.h"
using namespace ZenLib;
using namespace std;
//---------------------------------------------------------------------------
namespace MediaInfoLib
{
//***************************************************************************
// Infos
//***************************************************************************
//---------------------------------------------------------------------------
static const size_t DSF_FormatID_Size=1;
static const char* DSF_FormatID[DSF_FormatID_Size]=
{
"DSD",
};
//---------------------------------------------------------------------------
static const size_t DSF_ChannelType_Size=8;
static const char* DSF_ChannelType[DSF_ChannelType_Size]=
{
"",
"Front: C",
"Front: L R",
"Front: L C R",
"Front: L C R, LFE",
"Front: L R, Side: L R",
"Front: L C R, Side: L R",
"Front: L C R, Side: L R, LFE",
};
static const char* DSF_ChannelType_ChannelLayout[DSF_ChannelType_Size] =
{
"",
"C",
"L R",
"L R C",
"L R C LFE",
"L R Ls Rs",
"L R C Ls Rs",
"L R C Ls Rs LFE",
};
//***************************************************************************
// Constants
//***************************************************************************
//---------------------------------------------------------------------------
namespace Elements
{
const int64u data = 0x64617461;
const int64u DSD_ = 0x44534420;
const int64u fmt_ = 0x666D7420;
}
//***************************************************************************
// Constructor/Destructor
//***************************************************************************
//---------------------------------------------------------------------------
File_Dsf::File_Dsf()
:File__Analyze(), File__Tags_Helper()
{
//File__Tags_Helper
Base=this;
//Configuration
ParserName="Dsf";
#if MEDIAINFO_EVENTS
//ParserIDs[0]=MediaInfo_Parser_Dsf;
StreamIDs_Width[0]=0;
#endif //MEDIAINFO_EVENTS
MustSynchronize=true;
DataMustAlwaysBeComplete=false;
}
//---------------------------------------------------------------------------
void File_Dsf::Streams_Accept()
{
Fill(Stream_General, 0, General_Format, "DSF");
File__Tags_Helper::Stream_Prepare(Stream_Audio);
}
//---------------------------------------------------------------------------
void File_Dsf::Streams_Finish()
{
int64u SamplingRate=Retrieve(Stream_Audio, 0, Audio_SamplingRate).To_int64u();
for (int64u Multiplier=64; Multiplier<=512; Multiplier*=2)
{
int64u BaseFrequency=SamplingRate/Multiplier;
if (BaseFrequency==48000 || BaseFrequency==44100)
{
Fill(Stream_Audio, 0, Audio_Format_Commercial_IfAny, __T("DSD")+Ztring::ToZtring(Multiplier));
break;
}
}
//Tags
File__Tags_Helper::Streams_Fill();
}
//***************************************************************************
// Buffer - File header
//***************************************************************************
//---------------------------------------------------------------------------
bool File_Dsf::FileHeader_Begin()
{
//Must have enough buffer for having header
if (Buffer_Size<4)
return false; //Must wait for more data
if (Buffer[0]!=0x44 //"DSD "
|| Buffer[1]!=0x53
|| Buffer[2]!=0x44
|| Buffer[3]!=0x20)
{
File__Tags_Helper::Reject();
return false;
}
//Temp
Metadata=(int64u)-1;
File__Tags_Helper::Accept();
return true;
}
//***************************************************************************
// Buffer - Synchro
//***************************************************************************
//---------------------------------------------------------------------------
bool File_Dsf::Synched_Test()
{
if (File_Offset+Buffer_Offset==Metadata)
{
//Tags
if (!File__Tags_Helper::Synched_Test())
return false;
}
return true;
}
//***************************************************************************
// Buffer - Per element
//***************************************************************************
//---------------------------------------------------------------------------
void File_Dsf::Header_Parse()
{
//Parsing
int64u Size;
int32u Name;
Get_C4 (Name, "Name");
Get_L8 (Size, "Size");
//Coherency check
if (File_Offset+Buffer_Offset+Size>File_Size)
{
Size=File_Size-(File_Offset+Buffer_Offset);
if (Element_Level<=2) //Incoherencies info only at the top level chunk
Fill(Stream_General, 0, "IsTruncated", "Yes");
}
Header_Fill_Code(Name, Ztring().From_CC4(Name));
Header_Fill_Size(Size);
}
//***************************************************************************
// Elements
//***************************************************************************
//---------------------------------------------------------------------------
void File_Dsf::Data_Parse()
{
//Parsing
DATA_BEGIN
ATOM_PARTIAL(data)
ATOM(DSD_)
ATOM(fmt_)
DATA_END
}
//***************************************************************************
// Elements
//***************************************************************************
//---------------------------------------------------------------------------
void File_Dsf::data()
{
//Parsing
Skip_XX(Element_TotalSize_Get(), "sample data");
//Filling
Fill(Stream_Audio, 0, Audio_StreamSize, Element_TotalSize_Get());
}
//---------------------------------------------------------------------------
void File_Dsf::DSD_()
{
//Parsing
int64u FileSize;
Get_L8 (FileSize, "Total file size");
Get_L8 (Metadata, "Pointer to Metadata chunk");
if (FileSize!=File_Size)
Fill(Stream_General, 0, "Truncated", "Yes");
}
//---------------------------------------------------------------------------
void File_Dsf::fmt_()
{
//Parsing
int64u Count;
int32u Version, FormatID, ChannelType, Num, Frequency, Bits;
Get_L4 (Version, "Format version");
Get_L4 (FormatID, "Format ID");
Get_L4 (ChannelType, "Channel Type");
Get_L4 (Num, "Channel num");
Get_L4 (Frequency, "Sampling frequency");
Get_L4 (Bits, "Bits per sample");
Get_L8 (Count, "Sample count");
Skip_L4( "Block size per channel");
Skip_L4( "Reserved");
FILLING_BEGIN();
Fill(Stream_General, 0, General_Format_Version, __T("Version ")+Ztring::ToZtring(Version));
if (FormatID<DSF_FormatID_Size)
Fill(Stream_Audio, 0, Audio_Format, DSF_FormatID[FormatID]);
else
Fill(Stream_Audio, 0, Audio_Format, FormatID);
if (FormatID<DSF_ChannelType_Size)
{
Fill(Stream_Audio, 0, Audio_ChannelPositions, DSF_ChannelType[ChannelType]);
Fill(Stream_Audio, 0, Audio_ChannelLayout, DSF_ChannelType_ChannelLayout[ChannelType]);
}
else
{
Fill(Stream_Audio, 0, Audio_ChannelPositions, ChannelType);
Fill(Stream_Audio, 0, Audio_ChannelLayout, ChannelType);
}
Fill(Stream_Audio, 0, Audio_Channel_s_, Num);
Fill(Stream_Audio, 0, Audio_SamplingRate, Frequency);
switch (Bits)
{
case 1 : Fill(Stream_Audio, 0, Audio_Format_Settings, "Little"); Fill(Stream_Audio, 0, Audio_Format_Settings_Endianness, "Little"); break;
case 8 : Fill(Stream_Audio, 0, Audio_Format_Settings, "Big"); Fill(Stream_Audio, 0, Audio_Format_Settings_Endianness, "Big"); break;
default:;
}
Fill(Stream_Audio, 0, Audio_SamplingCount, Count);
FILLING_END();
}
//---------------------------------------------------------------------------
} //NameSpace
#endif //MEDIAINFO_DSF_YES
|
{
"pile_set_name": "Github"
}
| 136 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 13,
"score": 1
},
{
"begin": 13,
"end": 42,
"score": 0
},
{
"begin": 42,
"end": 48,
"score": 1
},
{
"begin": 48,
"end": 49,
"score": 0
},
{
"begin": 49,
"end": 57,
"score": 1
},
{
"begin": 57,
"end": 1216,
"score": 0
},
{
"begin": 1216,
"end": 1221,
"score": 1
},
{
"begin": 1221,
"end": 1701,
"score": 0
},
{
"begin": 1701,
"end": 1706,
"score": 1
},
{
"begin": 1706,
"end": 1718,
"score": 0
},
{
"begin": 1718,
"end": 1723,
"score": 1
},
{
"begin": 1723,
"end": 1725,
"score": 0
},
{
"begin": 1725,
"end": 1726,
"score": 1
},
{
"begin": 1726,
"end": 1737,
"score": 0
},
{
"begin": 1737,
"end": 1742,
"score": 1
},
{
"begin": 1742,
"end": 1744,
"score": 0
},
{
"begin": 1744,
"end": 1745,
"score": 1
},
{
"begin": 1745,
"end": 1758,
"score": 0
},
{
"begin": 1758,
"end": 1763,
"score": 1
},
{
"begin": 1763,
"end": 1765,
"score": 0
},
{
"begin": 1765,
"end": 1766,
"score": 1
},
{
"begin": 1766,
"end": 1784,
"score": 0
},
{
"begin": 1784,
"end": 1789,
"score": 1
},
{
"begin": 1789,
"end": 1791,
"score": 0
},
{
"begin": 1791,
"end": 1792,
"score": 1
},
{
"begin": 1792,
"end": 1796,
"score": 0
},
{
"begin": 1796,
"end": 1800,
"score": 1
},
{
"begin": 1800,
"end": 1802,
"score": 0
},
{
"begin": 1802,
"end": 1803,
"score": 1
},
{
"begin": 1803,
"end": 1814,
"score": 0
},
{
"begin": 1814,
"end": 1819,
"score": 1
},
{
"begin": 1819,
"end": 1821,
"score": 0
},
{
"begin": 1821,
"end": 1822,
"score": 1
},
{
"begin": 1822,
"end": 1828,
"score": 0
},
{
"begin": 1828,
"end": 1832,
"score": 1
},
{
"begin": 1832,
"end": 1834,
"score": 0
},
{
"begin": 1834,
"end": 1835,
"score": 1
},
{
"begin": 1835,
"end": 1846,
"score": 0
},
{
"begin": 1846,
"end": 1851,
"score": 1
},
{
"begin": 1851,
"end": 1853,
"score": 0
},
{
"begin": 1853,
"end": 1854,
"score": 1
},
{
"begin": 1854,
"end": 1860,
"score": 0
},
{
"begin": 1860,
"end": 1864,
"score": 1
},
{
"begin": 1864,
"end": 1866,
"score": 0
},
{
"begin": 1866,
"end": 1867,
"score": 1
},
{
"begin": 1867,
"end": 1984,
"score": 0
},
{
"begin": 1984,
"end": 1985,
"score": 1
},
{
"begin": 1985,
"end": 1996,
"score": 0
},
{
"begin": 1996,
"end": 1997,
"score": 1
},
{
"begin": 1997,
"end": 2010,
"score": 0
},
{
"begin": 2010,
"end": 2011,
"score": 1
},
{
"begin": 2011,
"end": 2028,
"score": 0
},
{
"begin": 2028,
"end": 2029,
"score": 1
},
{
"begin": 2029,
"end": 2032,
"score": 0
},
{
"begin": 2032,
"end": 2034,
"score": 1
},
{
"begin": 2034,
"end": 2035,
"score": 0
},
{
"begin": 2035,
"end": 2037,
"score": 1
},
{
"begin": 2037,
"end": 2046,
"score": 0
},
{
"begin": 2046,
"end": 2047,
"score": 1
},
{
"begin": 2047,
"end": 2052,
"score": 0
},
{
"begin": 2052,
"end": 2054,
"score": 1
},
{
"begin": 2054,
"end": 2055,
"score": 0
},
{
"begin": 2055,
"end": 2057,
"score": 1
},
{
"begin": 2057,
"end": 2066,
"score": 0
},
{
"begin": 2066,
"end": 2067,
"score": 1
},
{
"begin": 2067,
"end": 2072,
"score": 0
},
{
"begin": 2072,
"end": 2074,
"score": 1
},
{
"begin": 2074,
"end": 2075,
"score": 0
},
{
"begin": 2075,
"end": 2077,
"score": 1
},
{
"begin": 2077,
"end": 2565,
"score": 0
},
{
"begin": 2565,
"end": 2587,
"score": 1
},
{
"begin": 2587,
"end": 2749,
"score": 0
},
{
"begin": 2749,
"end": 2767,
"score": 1
},
{
"begin": 2767,
"end": 2772,
"score": 0
},
{
"begin": 2772,
"end": 2785,
"score": 1
},
{
"begin": 2785,
"end": 2789,
"score": 0
},
{
"begin": 2789,
"end": 2806,
"score": 1
},
{
"begin": 2806,
"end": 2819,
"score": 0
},
{
"begin": 2819,
"end": 2836,
"score": 1
},
{
"begin": 2836,
"end": 2893,
"score": 0
},
{
"begin": 2893,
"end": 2896,
"score": 1
},
{
"begin": 2896,
"end": 3187,
"score": 0
},
{
"begin": 3187,
"end": 3211,
"score": 1
},
{
"begin": 3211,
"end": 3222,
"score": 0
},
{
"begin": 3222,
"end": 3241,
"score": 1
},
{
"begin": 3241,
"end": 3246,
"score": 0
},
{
"begin": 3246,
"end": 3260,
"score": 1
},
{
"begin": 3260,
"end": 3275,
"score": 0
},
{
"begin": 3275,
"end": 3321,
"score": 1
},
{
"begin": 3321,
"end": 3414,
"score": 0
},
{
"begin": 3414,
"end": 3438,
"score": 1
},
{
"begin": 3438,
"end": 3545,
"score": 0
},
{
"begin": 3545,
"end": 3558,
"score": 1
},
{
"begin": 3558,
"end": 3560,
"score": 0
},
{
"begin": 3560,
"end": 3575,
"score": 1
},
{
"begin": 3575,
"end": 3577,
"score": 0
},
{
"begin": 3577,
"end": 3590,
"score": 1
},
{
"begin": 3590,
"end": 3737,
"score": 0
},
{
"begin": 3737,
"end": 3754,
"score": 1
},
{
"begin": 3754,
"end": 3889,
"score": 0
},
{
"begin": 3889,
"end": 3906,
"score": 1
},
{
"begin": 3906,
"end": 4012,
"score": 0
},
{
"begin": 4012,
"end": 4018,
"score": 1
},
{
"begin": 4018,
"end": 4289,
"score": 0
},
{
"begin": 4289,
"end": 4302,
"score": 1
},
{
"begin": 4302,
"end": 4364,
"score": 0
},
{
"begin": 4364,
"end": 4370,
"score": 1
},
{
"begin": 4370,
"end": 4398,
"score": 0
},
{
"begin": 4398,
"end": 4404,
"score": 1
},
{
"begin": 4404,
"end": 4423,
"score": 0
},
{
"begin": 4423,
"end": 4429,
"score": 1
},
{
"begin": 4429,
"end": 4448,
"score": 0
},
{
"begin": 4448,
"end": 4454,
"score": 1
},
{
"begin": 4454,
"end": 4481,
"score": 0
},
{
"begin": 4481,
"end": 4506,
"score": 1
},
{
"begin": 4506,
"end": 4559,
"score": 0
},
{
"begin": 4559,
"end": 4567,
"score": 1
},
{
"begin": 4567,
"end": 4587,
"score": 0
},
{
"begin": 4587,
"end": 4604,
"score": 1
},
{
"begin": 4604,
"end": 4722,
"score": 0
},
{
"begin": 4722,
"end": 4728,
"score": 1
},
{
"begin": 4728,
"end": 4731,
"score": 0
},
{
"begin": 4731,
"end": 4738,
"score": 1
},
{
"begin": 4738,
"end": 4905,
"score": 0
},
{
"begin": 4905,
"end": 4927,
"score": 1
},
{
"begin": 4927,
"end": 4942,
"score": 0
},
{
"begin": 4942,
"end": 4977,
"score": 1
},
{
"begin": 4977,
"end": 5016,
"score": 0
},
{
"begin": 5016,
"end": 5047,
"score": 1
},
{
"begin": 5047,
"end": 5193,
"score": 0
},
{
"begin": 5193,
"end": 5199,
"score": 1
},
{
"begin": 5199,
"end": 5380,
"score": 0
},
{
"begin": 5380,
"end": 5402,
"score": 1
},
{
"begin": 5402,
"end": 5464,
"score": 0
},
{
"begin": 5464,
"end": 5470,
"score": 1
},
{
"begin": 5470,
"end": 5538,
"score": 0
}
] |
Q:
What should our off-topic migration paths be?
Triggered by this question This question belongs on another site in the Stack Exchange network and the ongoing discussion of on-/off-topicness we need to agree on our main migration paths. As they appear when vote to close a question as off-topic is done, they are an important tool for community moderation, i.e. for anyone using VTC privileges.
Answers to this question should finally result in a list of possible migration paths, i.e. the most appropriate sites, the ones which we will be migrating to most often.
As always: remember not to migrate crap and being off-topic here does not mean being on-topic somewhere else.
Candidates:
Electrical Engineering
Security
SuperUser
U&L
A:
I'd say we wait until we actually have a question that merits—by community decision—a migration. The slots are limited and users are encouraged to only migrate to sites of which they know the question would be welcome there. We don't have enough migration-privileged users that have that knowledge of these target sites.
Considering migration it's important to remember, if you're not sure, don't migrate it. So until we have that voting base of people who can in good conscience migrate to those sites we shouldn't open any preset migration paths. For the amount of expected migrations there will always be the pro-tem moderators who can migrate right away (tm), meaning after checking in with the receiving site.
|
{
"pile_set_name": "StackExchange"
}
| 7 |
[
{
"begin": 0,
"end": 123,
"score": 0
},
{
"begin": 123,
"end": 128,
"score": 1
},
{
"begin": 128,
"end": 129,
"score": 0
},
{
"begin": 129,
"end": 137,
"score": 1
},
{
"begin": 137,
"end": 383,
"score": 0
},
{
"begin": 383,
"end": 386,
"score": 1
},
{
"begin": 386,
"end": 692,
"score": 0
},
{
"begin": 692,
"end": 702,
"score": 1
}
] |
// Copyright 2017 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build amd64,!gccgo,!appengine
package argon2
import "golang.org/x/sys/cpu"
func init() {
useSSE4 = cpu.X86.HasSSE41
}
//go:noescape
func mixBlocksSSE2(out, a, b, c *block)
//go:noescape
func xorBlocksSSE2(out, a, b, c *block)
//go:noescape
func blamkaSSE4(b *block)
func processBlockSSE(out, in1, in2 *block, xor bool) {
var t block
mixBlocksSSE2(&t, in1, in2, &t)
if useSSE4 {
blamkaSSE4(&t)
} else {
for i := 0; i < blockLength; i += 16 {
blamkaGeneric(
&t[i+0], &t[i+1], &t[i+2], &t[i+3],
&t[i+4], &t[i+5], &t[i+6], &t[i+7],
&t[i+8], &t[i+9], &t[i+10], &t[i+11],
&t[i+12], &t[i+13], &t[i+14], &t[i+15],
)
}
for i := 0; i < blockLength/8; i += 2 {
blamkaGeneric(
&t[i], &t[i+1], &t[16+i], &t[16+i+1],
&t[32+i], &t[32+i+1], &t[48+i], &t[48+i+1],
&t[64+i], &t[64+i+1], &t[80+i], &t[80+i+1],
&t[96+i], &t[96+i+1], &t[112+i], &t[112+i+1],
)
}
}
if xor {
xorBlocksSSE2(out, in1, in2, &t)
} else {
mixBlocksSSE2(out, in1, in2, &t)
}
}
func processBlock(out, in1, in2 *block) {
processBlockSSE(out, in1, in2, false)
}
func processBlockXOR(out, in1, in2 *block) {
processBlockSSE(out, in1, in2, true)
}
|
{
"pile_set_name": "Github"
}
| 1 |
[
{
"begin": 0,
"end": 3,
"score": 0
},
{
"begin": 3,
"end": 12,
"score": 1
}
] |
President Donald Trump said Thursday that his “fire and fury” warning to North Korea’s dictator may not have been strong enough.
He also turned up the heat on Kim Jong Un’s threats toward the U.S. territory of Guam.
“Let’s see what he does with Guam. He does something in Guam, it will be an event the likes of which nobody’s seen before, what will happen in North Korea,” Trump said, adding:
It’s not a dare. It’s a statement. It has nothing to do with dare. That’s a statement. He’s not going to go around threatening Guam and he’s not going to threaten the United States and he’s not going to threaten Japan and he’s not going to threaten South Korea.
During two press conferences at the Trump National Golf Club in Bedminster, New Jersey—one before and another after a national security briefing—Trump also pressed Senate Majority Leader Mitch McConnell, R-Ky., to pass more GOP agenda items such as health care and tax reforms, and vowed to address the opioid drug crisis.
One reporter asked at the first press conference whether the Trump administration is considering a pre-emptive strike against North Korea, which intelligence officials believe has developed a miniaturized nuclear warhead to mount on an intercontinental ballistic missile.
“We don’t talk about that. We never do,” Trump said, explaining he didn’t want to reveal plans to an enemy, as he said other administrations have.
“I’m not like the other administration that would say we’re going into Mosul in four months. I don’t talk about it,” he said. “We’ll see what happens. But I can tell you that what they’ve been doing and what they’ve been getting away with is a tragedy, and it can’t be allowed.”
He referred to his three immediate predecessors, Barack Obama, George W. Bush, and Bill Clinton:
Clinton folded on negotiations, he was weak and ineffective. You look what happened with Bush, you look what happened with Obama. Obama, he didn’t even want to talk about it. But I talk. Somebody has to do it.
When asked whether his Tuesday promise of “fire and fury” to North Korea if it doesn’t behave was too much, Trump responded: “Maybe it wasn’t tough enough.”
Asked what’s tougher, he replied: “You’ll see.”
Trump praised Russia and China for joining a 15-0 vote in the U.N. Security Council to place new sanctions on North Korea, and Nikki Haley for her related work as U.N. ambassador.
The president also sought to calm the nerves and fears of worried Americans:
The people of this country should be very comfortable, and I will tell you this. If North Korea does anything in terms of even thinking about attack of anybody that we love or we represent or our allies or us, they can be very, very nervous. I’ll tell you why. And they should be very nervous. Because things will happen to them like they never thought possible, OK? He’s been pushing the world around for a long time.
Trump, without naming him, was referring to Kim, head of the communist regime.
Trump already had been tough on McConnell in tweets earlier that day, responding to the Republican Senate leader’s criticism that the president had unrealistic expectations.
“But I said, ‘Mitch, get to work and let’s get it done,’” he said of McConnell.
“They should have had this last one done,” Trump said, referring to the Senate’s failure to make progress on getting rid of Obamacare. “They lost by one vote. For a thing like that to happen is a disgrace.”
A reporter asked whether McConnell should step down as majority leader, on which Trump was noncommittal.
“Well, I’ll tell you what. If he doesn’t get [Obamacare] repeal and replace done, if he doesn’t get taxes done, meaning cuts and reform, and if he doesn’t get a very easy one to get done—infrastructure—if he doesn’t get that done, then you should ask me that question,” Trump said during the first press conference.
During the second press conference, Trump compared McConnell’s effort with that of Transportation Secretary Elaine Chao, the wife of the Senate majority leader.
“Elaine is doing a very good job. We’re very proud of Elaine as secretary of transportation, as you know,” Trump said. “She’s doing a very good job. I’m very disappointed in Mitch. If he gets these bills passed, I’ll be very happy with him, and I’ll be the first to admit it.”
The president said opioid addiction is a national emergency, and a problem across the world.
“The opioid crisis is an emergency, and I’m saying officially right now it is an emergency,” Trump said. “It’s a national emergency. We’re going to spend a lot of time, a lot of effort, and a lot of money on the opioid crisis.” (For more from the author of “Trump: Maybe Warning to North Korea ‘Wasn’t Tough Enough'” please click HERE)
|
{
"pile_set_name": "Pile-CC"
}
| 98 |
[
{
"begin": 0,
"end": 9,
"score": 1
},
{
"begin": 9,
"end": 10,
"score": 0
},
{
"begin": 10,
"end": 16,
"score": 1
},
{
"begin": 16,
"end": 17,
"score": 0
},
{
"begin": 17,
"end": 22,
"score": 1
},
{
"begin": 22,
"end": 28,
"score": 0
},
{
"begin": 28,
"end": 36,
"score": 1
},
{
"begin": 36,
"end": 73,
"score": 0
},
{
"begin": 73,
"end": 78,
"score": 1
},
{
"begin": 78,
"end": 79,
"score": 0
},
{
"begin": 79,
"end": 84,
"score": 1
},
{
"begin": 84,
"end": 160,
"score": 0
},
{
"begin": 160,
"end": 163,
"score": 1
},
{
"begin": 163,
"end": 164,
"score": 0
},
{
"begin": 164,
"end": 168,
"score": 1
},
{
"begin": 168,
"end": 169,
"score": 0
},
{
"begin": 169,
"end": 171,
"score": 1
},
{
"begin": 171,
"end": 211,
"score": 0
},
{
"begin": 211,
"end": 215,
"score": 1
},
{
"begin": 215,
"end": 247,
"score": 0
},
{
"begin": 247,
"end": 251,
"score": 1
},
{
"begin": 251,
"end": 274,
"score": 0
},
{
"begin": 274,
"end": 278,
"score": 1
},
{
"begin": 278,
"end": 361,
"score": 0
},
{
"begin": 361,
"end": 366,
"score": 1
},
{
"begin": 366,
"end": 367,
"score": 0
},
{
"begin": 367,
"end": 372,
"score": 1
},
{
"begin": 372,
"end": 375,
"score": 0
},
{
"begin": 375,
"end": 380,
"score": 1
},
{
"begin": 380,
"end": 523,
"score": 0
},
{
"begin": 523,
"end": 527,
"score": 1
},
{
"begin": 527,
"end": 563,
"score": 0
},
{
"begin": 563,
"end": 569,
"score": 1
},
{
"begin": 569,
"end": 570,
"score": 0
},
{
"begin": 570,
"end": 576,
"score": 1
},
{
"begin": 576,
"end": 608,
"score": 0
},
{
"begin": 608,
"end": 613,
"score": 1
},
{
"begin": 613,
"end": 645,
"score": 0
},
{
"begin": 645,
"end": 650,
"score": 1
},
{
"begin": 650,
"end": 651,
"score": 0
},
{
"begin": 651,
"end": 656,
"score": 1
},
{
"begin": 656,
"end": 695,
"score": 0
},
{
"begin": 695,
"end": 700,
"score": 1
},
{
"begin": 700,
"end": 701,
"score": 0
},
{
"begin": 701,
"end": 709,
"score": 1
},
{
"begin": 709,
"end": 710,
"score": 0
},
{
"begin": 710,
"end": 714,
"score": 1
},
{
"begin": 714,
"end": 715,
"score": 0
},
{
"begin": 715,
"end": 719,
"score": 1
},
{
"begin": 719,
"end": 723,
"score": 0
},
{
"begin": 723,
"end": 733,
"score": 1
},
{
"begin": 733,
"end": 735,
"score": 0
},
{
"begin": 735,
"end": 738,
"score": 1
},
{
"begin": 738,
"end": 804,
"score": 0
},
{
"begin": 804,
"end": 809,
"score": 1
},
{
"begin": 809,
"end": 823,
"score": 0
},
{
"begin": 823,
"end": 829,
"score": 1
},
{
"begin": 829,
"end": 830,
"score": 0
},
{
"begin": 830,
"end": 838,
"score": 1
},
{
"begin": 838,
"end": 839,
"score": 0
},
{
"begin": 839,
"end": 845,
"score": 1
},
{
"begin": 845,
"end": 846,
"score": 0
},
{
"begin": 846,
"end": 851,
"score": 1
},
{
"begin": 851,
"end": 852,
"score": 0
},
{
"begin": 852,
"end": 861,
"score": 1
},
{
"begin": 861,
"end": 863,
"score": 0
},
{
"begin": 863,
"end": 867,
"score": 1
},
{
"begin": 867,
"end": 883,
"score": 0
},
{
"begin": 883,
"end": 886,
"score": 1
},
{
"begin": 886,
"end": 1044,
"score": 0
},
{
"begin": 1044,
"end": 1049,
"score": 1
},
{
"begin": 1049,
"end": 1109,
"score": 0
},
{
"begin": 1109,
"end": 1114,
"score": 1
},
{
"begin": 1114,
"end": 1115,
"score": 0
},
{
"begin": 1115,
"end": 1120,
"score": 1
},
{
"begin": 1120,
"end": 1297,
"score": 0
},
{
"begin": 1297,
"end": 1302,
"score": 1
},
{
"begin": 1302,
"end": 1475,
"score": 0
},
{
"begin": 1475,
"end": 1480,
"score": 1
},
{
"begin": 1480,
"end": 1733,
"score": 0
},
{
"begin": 1733,
"end": 1739,
"score": 1
},
{
"begin": 1739,
"end": 1740,
"score": 0
},
{
"begin": 1740,
"end": 1745,
"score": 1
},
{
"begin": 1745,
"end": 1747,
"score": 0
},
{
"begin": 1747,
"end": 1753,
"score": 1
},
{
"begin": 1753,
"end": 1757,
"score": 0
},
{
"begin": 1757,
"end": 1761,
"score": 1
},
{
"begin": 1761,
"end": 1767,
"score": 0
},
{
"begin": 1767,
"end": 1771,
"score": 1
},
{
"begin": 1771,
"end": 1772,
"score": 0
},
{
"begin": 1772,
"end": 1779,
"score": 1
},
{
"begin": 1779,
"end": 1782,
"score": 0
},
{
"begin": 1782,
"end": 1789,
"score": 1
},
{
"begin": 1789,
"end": 1871,
"score": 0
},
{
"begin": 1871,
"end": 1875,
"score": 1
},
{
"begin": 1875,
"end": 1905,
"score": 0
},
{
"begin": 1905,
"end": 1910,
"score": 1
},
{
"begin": 1910,
"end": 1912,
"score": 0
},
{
"begin": 1912,
"end": 1917,
"score": 1
}
] |
Q:
What are modular forms used for?
I have seen the definition of a modular form, but it seems obscure to me. I get the impression that if I were to read a lot about them, eventually I would see how they can be used. I am curious about the ways in which modular forms are applied. How are they used? What are some important theorems of intrinsic interest that can be (relatively easily) obtained by using them? Are there any that I should look at in particular?
A:
One of the simplest applications (and quickest to get to) is to representation numbers of quadratic forms. E.g. Jacobi's formula, that the number
of ways of writing a natural number $n$ as the sum of four squares is equal
to $8 \sum_{d|n, 4 \not\mid d} d$, was originally proved using modular forms,
and I think this is still the most versatile method of proof.
For more general quadratic forms, one can't necessarily get as precise formulas
(so-called cuspforms introduce error terms which don't admit explicit formulas),
but one gets approximations (and the Ramanujan--Petersson conjecture on growth
of Fourier coeffs. of cuspforms plays a role in bounding the error terms coming
from cuspforms).
Some of this (although not Jacobi's formula itself) can be found in Serre's Course in arithmetic, which is the nicest treatment for a beginner.
There are also the applications to the theory of elliptic curves (and then to FLT) mentioned in the comments. For example, the best results in the direction of BSD (such as Gross--Zagier, or Kato's results) rely on the connection between modular forms and elliptic curves.
|
{
"pile_set_name": "StackExchange"
}
| 8 |
[
{
"begin": 0,
"end": 582,
"score": 0
},
{
"begin": 582,
"end": 588,
"score": 1
},
{
"begin": 588,
"end": 1030,
"score": 0
},
{
"begin": 1030,
"end": 1050,
"score": 1
},
{
"begin": 1050,
"end": 1075,
"score": 0
},
{
"begin": 1075,
"end": 1082,
"score": 1
},
{
"begin": 1082,
"end": 1197,
"score": 0
},
{
"begin": 1197,
"end": 1203,
"score": 1
},
{
"begin": 1203,
"end": 1238,
"score": 0
}
] |
Q:
El tag [poo] es sinónimo de [orientación-a-objetos]
Eso.
Existen poo y orientación-a-objetos, y se refieren a lo mismo. Habría que unificarlos antes de que crezcan.
Y que podamos soportar tags con tildes ^_^
A:
Yo creé la etiqueta poo. Inicialmente quise crearla como programación-orientada-a-objetos que es el término correcto pero lamentablemente el sistema solo permite hasta 25 caracteres en los tags como máximo, por lo cual opté por dejarla como poo.
Pienso que por el sinónimo debe ser en este sentido
poo <-- orientación-a-objetos
A:
Hecho. Se ha creado el sinónimo:
orientación-a-objetos (etiqueta maestra) - poo
El término orientación a objetos es más descriptivo, mientras que poo es esto en inglés.
Debido al comentario de @dwarandae, y reforzado por el de @toledano, he intercambiado los sinónimos.
poo (etiqueta maestra) - orientación-a-objetos
|
{
"pile_set_name": "StackExchange"
}
| 17 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 6,
"score": 1
},
{
"begin": 6,
"end": 57,
"score": 0
},
{
"begin": 57,
"end": 60,
"score": 1
},
{
"begin": 60,
"end": 62,
"score": 0
},
{
"begin": 62,
"end": 69,
"score": 1
},
{
"begin": 69,
"end": 74,
"score": 0
},
{
"begin": 74,
"end": 75,
"score": 1
},
{
"begin": 75,
"end": 99,
"score": 0
},
{
"begin": 99,
"end": 100,
"score": 1
},
{
"begin": 100,
"end": 125,
"score": 0
},
{
"begin": 125,
"end": 131,
"score": 1
},
{
"begin": 131,
"end": 170,
"score": 0
},
{
"begin": 170,
"end": 171,
"score": 1
},
{
"begin": 171,
"end": 218,
"score": 0
},
{
"begin": 218,
"end": 220,
"score": 1
},
{
"begin": 220,
"end": 243,
"score": 0
},
{
"begin": 243,
"end": 255,
"score": 1
}
] |
Join Our Discussion
Dialogue 5.0
"prevents and transforms conflicts driven by deep differences in identity, beliefs or values"
David Cantor's segmentation of the four primary stances in any exchange between people (the proposer, the follower, the contestor and the by-standor)
The by-standor is the most important out of all four, in bringing perspective and bridging the gaps between opposing views.
Article and interview with Strategy+Business: The Thought Leader Interview: David Kantor - An eminent systems therapist says that learning to recognize the hidden patterns in conversation is the first step toward more effective executive leadership (28/05/2013)
|
{
"pile_set_name": "Pile-CC"
}
| 9 |
[
{
"begin": 0,
"end": 21,
"score": 0
},
{
"begin": 21,
"end": 29,
"score": 1
},
{
"begin": 29,
"end": 130,
"score": 0
},
{
"begin": 130,
"end": 135,
"score": 1
},
{
"begin": 135,
"end": 136,
"score": 0
},
{
"begin": 136,
"end": 142,
"score": 1
},
{
"begin": 142,
"end": 433,
"score": 0
},
{
"begin": 433,
"end": 450,
"score": 1
},
{
"begin": 450,
"end": 456,
"score": 0
},
{
"begin": 456,
"end": 463,
"score": 1
}
] |
Q:
Get maximum and minimum from numbers
I need to print maximum and minimum number from numbers.
Problem is that when i set mn and mx to 0 it just wont work because when user write numbers 1 2 3 4 5 minimum is 0 and not 1 and thats the problem.
My code:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main() {
int x, mx = 0, mn = 0;
int i = 1, n;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
printf("Your number %d:", i);
scanf("%d", &x);
if (x > mx) {
mx = x;
};
if (x < mn) {
mn = x;
};
};
printf("minimum is: %d", mn);
printf("maximum is: %d", mx);
system("pause");
return 0;
}
A:
Set both to the first value entered. Then use your current code as it is.
(Except for system("pause");. C does not need that.)
|
{
"pile_set_name": "StackExchange"
}
| 1 |
[
{
"begin": 0,
"end": 99,
"score": 0
},
{
"begin": 99,
"end": 106,
"score": 1
}
] |
Q:
how to use nobs in sas so that it can be used to find percentage frequency
I have imported one datafile. It has 246 observations. By using nobs how can I replace 246 in the last sentence of my code to find percentage?
proc import datafile='G:\Data file\Dec 2014.csv'
out=out.datafile
dbms=csv
replace;
*SUMMARY TABLE IS MADE;
proc summary data = out.datafile missing;
class AGE sentiment; *age, sentiment are two columns in datafile;
var ;
output out = out.summ_age ;
run;
*SORTING SUMMARY TABLE BY AGE;
proc sort data = out.summ_age;
by age;
run;
*TRANSPOSING THE SORTED DATA WITH AGE AS OBS SENTIMENT VALUES AS COLUMNS;
PROC transpose data = out.summ_age out = out.hsi_age;
by age;
id sentiment;
var count;
run;
data out.hsi_age;
set out.hsi_age;
tot = d+s+i;
PERCENTAGE=round((tot/246)*100,0.01); /*PERCENTAGE PER GROUP*/
run;
A:
If you want to the number of observations in a dataset into a macro variable then you can put this count into a macro variable - as in your case:
proc sql ;
select count(*)
into :N
from out.datafile ;
quit ;
You can then call this in your final step:
data out.hsi_age;
set out.hsi_age;
tot = d+s+i;
PERCENTAGE=round((tot/&N.)*100,0.01); /*PERCENTAGE PER GROUP*/
run;
|
{
"pile_set_name": "StackExchange"
}
| 7 |
[
{
"begin": 0,
"end": 245,
"score": 0
},
{
"begin": 245,
"end": 252,
"score": 1
},
{
"begin": 252,
"end": 656,
"score": 0
},
{
"begin": 656,
"end": 659,
"score": 1
},
{
"begin": 659,
"end": 1161,
"score": 0
},
{
"begin": 1161,
"end": 1164,
"score": 1
},
{
"begin": 1164,
"end": 1776,
"score": 0
},
{
"begin": 1776,
"end": 1780,
"score": 1
}
] |
Q:
Clearing or resetting a singleton in test class
I'm writing a test method to reset the value of a singleton variable, however I have no clue how to do it. please can someone assist me with the test code to test the following:
public class Service extends CompositeService {
.....
//SINGLETON
private static Service singleton;
public static Service get() {
if (singleton == null) {
singleton = new Service ();
}
return singleton;
}
private Service () {}
....
...}
A:
If your test class needs to "interfere" with private variables that are not accessible through your class's public API, you should add the @TestVisible annotation:
@TestVisible
private static Service singleton;
Your unit test can then do
Service.singleton = null;
when needed.
It's broadly preferable, where possible, to test using the public API, as this insulates your test class from the implementation details of your class and makes it run tests like any other consumer of the class's API. However, there are lots of situations, as it sounds like you've discovered, where it does become necessary to reach into the private state of a class during a test.
|
{
"pile_set_name": "StackExchange"
}
| 13 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 12,
"score": 1
},
{
"begin": 12,
"end": 244,
"score": 0
},
{
"begin": 244,
"end": 251,
"score": 1
},
{
"begin": 251,
"end": 315,
"score": 0
},
{
"begin": 315,
"end": 322,
"score": 1
},
{
"begin": 322,
"end": 349,
"score": 0
},
{
"begin": 349,
"end": 356,
"score": 1
},
{
"begin": 356,
"end": 418,
"score": 0
},
{
"begin": 418,
"end": 425,
"score": 1
},
{
"begin": 425,
"end": 469,
"score": 0
},
{
"begin": 469,
"end": 476,
"score": 1
},
{
"begin": 476,
"end": 613,
"score": 0
},
{
"begin": 613,
"end": 616,
"score": 1
}
] |
<?xml version="1.0" encoding="utf-8"?>
<extension version="3.1" type="plugin" group="privacy" method="upgrade">
<name>plg_privacy_actionlogs</name>
<author>Joomla! Project</author>
<creationDate>July 2018</creationDate>
<copyright>(C) 2005 - 2020 Open Source Matters. All rights reserved.</copyright>
<license>GNU General Public License version 2 or later; see LICENSE.txt</license>
<authorEmail>[email protected]</authorEmail>
<authorUrl>www.joomla.org</authorUrl>
<version>3.9.0</version>
<description>PLG_PRIVACY_ACTIONLOGS_XML_DESCRIPTION</description>
<files>
<filename plugin="actionlogs">actionlogs.php</filename>
</files>
<languages>
<language tag="en-GB">en-GB.plg_privacy_actionlogs.ini</language>
<language tag="en-GB">en-GB.plg_privacy_actionlogs.sys.ini</language>
</languages>
</extension>
|
{
"pile_set_name": "Github"
}
| 6 |
[
{
"begin": 0,
"end": 251,
"score": 0
},
{
"begin": 251,
"end": 255,
"score": 1
},
{
"begin": 255,
"end": 263,
"score": 0
},
{
"begin": 263,
"end": 270,
"score": 1
},
{
"begin": 270,
"end": 319,
"score": 0
},
{
"begin": 319,
"end": 326,
"score": 1
},
{
"begin": 326,
"end": 327,
"score": 0
}
] |
Q:
Bootstrap 3 Nav Tabs bookmark url not working
Using Wordpress & Bootstrap 3 - my links for the nav tabs bookmarks aren't working.
I've found many (different) examples of JavaScript & jQuery, but none that work so far.
My HTML:
<ul class="nav nav-tabs" role="tablist" id="myTab">
<li class="active"><a href="#home" role="tab" data-toggle="tab">Home</a></li>
<li><a href="#profile" role="tab" data-toggle="tab">Profile</a></li>
<li><a href="#messages" role="tab" data-toggle="tab">Messages</a></li>
<li><a href="#settings" role="tab" data-toggle="tab">Settings</a></li>
</ul>
<div class="tab-content">
<div class="tab-pane active" id="home">...</div>
<div class="tab-pane" id="profile">...</div>
<div class="tab-pane" id="messages">...</div>
<div class="tab-pane" id="settings">...</div>
</div>
I want to be able to type in/access a URL - like www.mysite.com/example#messages - and land on the www.mysite.com/example page (that contains the tabs), with the #messages tab open.
I just can't get a different tab to open, that doesn't have the .active class in it. There's a bunch of prior examples on StackOverFlow, but none of them (so far) are working for me.
I have followed the instructions & markup as per Bootstrap's website:
http://getbootstrap.com/javascript/#tabs
...with no luck as yet.
Any ideas?
Appreciate the tips!
A:
$(document).ready(function() {
var url = document.location.toString();
if (url.match('#')) {
$('.nav-tabs a[href="#' + url.split('#')[1] + '"]').tab('show');
}
});
this will do
but it will go to the bookmark of #tabid too ....
finding how not to...
|
{
"pile_set_name": "StackExchange"
}
| 8 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 13,
"score": 1
},
{
"begin": 13,
"end": 16,
"score": 0
},
{
"begin": 16,
"end": 19,
"score": 1
},
{
"begin": 19,
"end": 57,
"score": 0
},
{
"begin": 57,
"end": 66,
"score": 1
},
{
"begin": 66,
"end": 69,
"score": 0
},
{
"begin": 69,
"end": 78,
"score": 1
},
{
"begin": 78,
"end": 865,
"score": 0
}
] |
175 CVs for "Receptionist" in Kuwait.
Anywhere in Kuwait Dear Sir/Madam, I am writing to outline the skills, knowledge and expertise I have gained as a Human Resource Officer and within sales and marketing and the commitment I have to consistently delivering against challenging targets, KPIs and business objectives. I believe that these capabilities ma...[more]
Anywhere in Kuwait ...skills Enthusiasm and personal drive about what i do; completing tasks with excellence and always looking forward to the next one Problem-solving – being able to offer solutions to problem WORKING EXPERIEINCE: Receptionist Sheraton Hotel Abuja 2016 -2018 Duties and Responsibilities • Greet hote...[more]
worldwide My name is Md. Rizwan. I am Graduate, I Have Completed One Year Diploma In Hospitality Management From Pioneer College Of Management. I Have One Year Experience As A Front Office Assistant In Hotel aananda imperial. At present I am working as a front office executive in hotel orbit. I have Working k...[more]
Anywhere in Kuwait worked with wns global ltd as operations associate and worked on sabre and amadeus, worked on ms word and ms excel in back office department in religare securities, and work as a receptionist, in IDBI bank worked on oracle system and handled customer issues and queries related to banking. i also hav...[more]
Popular Professions
We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media partners, advertising partners, google analytics and other google services. Find out more
|
{
"pile_set_name": "Pile-CC"
}
| 32 |
[
{
"begin": 0,
"end": 13,
"score": 0
},
{
"begin": 13,
"end": 25,
"score": 1
},
{
"begin": 25,
"end": 30,
"score": 0
},
{
"begin": 30,
"end": 36,
"score": 1
},
{
"begin": 36,
"end": 51,
"score": 0
},
{
"begin": 51,
"end": 57,
"score": 1
},
{
"begin": 57,
"end": 58,
"score": 0
},
{
"begin": 58,
"end": 62,
"score": 1
},
{
"begin": 62,
"end": 63,
"score": 0
},
{
"begin": 63,
"end": 72,
"score": 1
},
{
"begin": 72,
"end": 153,
"score": 0
},
{
"begin": 153,
"end": 158,
"score": 1
},
{
"begin": 158,
"end": 159,
"score": 0
},
{
"begin": 159,
"end": 167,
"score": 1
},
{
"begin": 167,
"end": 168,
"score": 0
},
{
"begin": 168,
"end": 175,
"score": 1
},
{
"begin": 175,
"end": 378,
"score": 0
},
{
"begin": 378,
"end": 384,
"score": 1
},
{
"begin": 384,
"end": 598,
"score": 0
},
{
"begin": 598,
"end": 610,
"score": 1
},
{
"begin": 610,
"end": 611,
"score": 0
},
{
"begin": 611,
"end": 619,
"score": 1
},
{
"begin": 619,
"end": 620,
"score": 0
},
{
"begin": 620,
"end": 625,
"score": 1
},
{
"begin": 625,
"end": 626,
"score": 0
},
{
"begin": 626,
"end": 631,
"score": 1
},
{
"begin": 631,
"end": 643,
"score": 0
},
{
"begin": 643,
"end": 649,
"score": 1
},
{
"begin": 649,
"end": 654,
"score": 0
},
{
"begin": 654,
"end": 670,
"score": 1
},
{
"begin": 670,
"end": 673,
"score": 0
},
{
"begin": 673,
"end": 678,
"score": 1
},
{
"begin": 678,
"end": 719,
"score": 0
}
] |
Police and election officials in Scotland have issued warnings to polling stations and local commanders after radical nationalists urged voters to photograph their ballot papers and follow ballot boxes to count centres on Thursday night.
Some pro-independence campaigners allege that last September’s independence referendum result was fixed – a claim repeatedly rejected by the Scottish National party leader, Nicola Sturgeon. Activists claim that voting in Thursday’s general election could also be rigged, in an effort to prevent SNP votes being properly counted.
Police and electoral officials placed the campaigners’ claims “in the context of conspiracy theories after the referendum” but are worried about the risks of trouble after recent tussles during nationalist protests at Labour election rallies in Glasgow.
Officials at City of Edinburgh council told the Guardian formal warnings were sent on Wednesday morning from Scotland’s electoral management board (EMB) to returning officers in all 32 local authorities to watch for queues forming and for any disruption or “threatening behaviour” at polling stations.
In an online campaign dubbed #OperationScallop, shared hundreds of times on Facebook and Twitter, activists have urged voters to wait until the final hour of polling on Thursday so they can track their ballot papers from polling stations to count centres, in an attempt to prevent them being tampered with.
A detailed advice sheet issued by the Twitter account for a Glasgow-based IT company Spectrum Systems urges them to photograph their voting papers, check that each ballot carries valid security markings and then watch them be correctly handled.
Contacted by the Guardian, Simon Lott, a director of Spectrum Systems, insisted their monitoring is intended to be peaceful and within the law: the campaign advice note to activists states they must not post any photographs before polling closes, not arouse police suspicions, and be “polite and courteous” if challenged. They must “comply with their legal requests without exception”.
But after taking advice from the Electoral Commission, polling station staff and police have also been told to ban voters from taking selfies or using cameras or smartphones in polling stations because it could be illegal.
The commission said there is no law explicitly banning photography in polling stations but it believes that sharing photographs of ballot papers is illegal, breaching the legal principle that voting must be secret. The commission did not concede that images of a ballot paper could be shared after polling closes.
Lott confirmed to the Guardian he planned to follow his ballot paper to the Glasgow election count at the Emirates arena on Thursday night. He would also amend his advice to fellow activists to alert them that the Electoral Commission advised it would be illegal to publish photographs of their ballot papers.
Lott said he believed his referendum ballot paper was a fake, and had failed to arrive at the count on 18 September. His complaints to the courts, the police, the Royal family and the security service had not been investigated, he said, and he had no confidence in Sturgeon’s assurances that the referendum was safe and legal.
“I will be watching my vote to make sure my vote gets to the count on time,” he said.
“All I want to do is have my eyes there to make sure my ballot paper gets into the box as per the law, gets handled and checked properly, gets loaded into the van as per the law, gets driven off by Labour council drivers in Labour council vans completely unsupervised for the next two hours and until they go to the Emirates. That gap needs to be supervised.”
Police Scotland has also circulated warnings and advice from the EMB to all divisional commanders, urging them to watch for queues forming after 9pm and to be aware of problems emerging in polling stations and on the roads after vans leave at 10pm with ballot boxes.
The notice states that police have been asked to be alert for any issues at polling stations. “That would include any threatening behaviour, either within polling places, outside them or during transit to the count.
“People are not encouraged and should not be allowed to take selfies, but obviously polling staff will need to make judgments about how or when they intervene with a view to their own safety and the efficient conduct of the poll.”
The official advice, passed to the Guardian, states: “This is all in the context of the various conspiracy theories after the referendum and of the general suspicion out there among certain sectors of the public. The police are aware of this campaign, as are the Electoral Commission.”
It adds: “With respect to following vans, the issue here is not one of electoral law but of laws with respect to the use of the public roads. The police should be involved if you have any concerns about the safety of your staff either in polling places, during the transport of boxes or at the count.”
The email repeats Electoral Commission advice that the law on taking selfies or photographs in polling booths is complex and depends on the circumstances of how a photograph is taken and what is done with it, but it urges polling staff to ban it entirely.
The advice states: “The law relating to voters taking photos of themselves in polling stations is complex and whether an offence has been committed would depend on a number of factors, including whether the photograph was shared with others and what the photograph showed.
“Given the risk that someone taking a photo inside a polling station may be in breach of the law, whether intentionally or not, our advice is that you should not allow photos to be taken inside polling stations.”
Sturgeon has repeatedly rejected complaints from within the yes movement that the referendum – which was set up by the Scottish government, was rigged. An SNP spokesman said they had no fears of any kind that the general election result would be undermined.
“We are entirely satisfied that the referendum was a gold standard in terms of the robustness of the democratic process, popular engagement, and a result which accurately reflected the votes of the people,” he said.
“And we are equally satisfied about all the arrangements for the general election, in which we hope that the people of Scotland will come together to elect a big team of SNP MPs to make Scotland stronger at Westminster and help deliver progressive policies for the whole of the UK.”
Ch Supt Jim Baird, the Police Scotland commander overseeing polling night operations, said: “We are aware of this. However, we will not comment on specific details of security arrangements.
“I would like to take this opportunity to assure the public that appropriate policing and security arrangements will be put in place to ensure the election process runs smoothly. The safety and security of the process is a top priority for Police Scotland and we have been liaising with the Electoral Commission and returning officers and will continue to do so throughout.”
|
{
"pile_set_name": "Pile-CC"
}
| 69 |
[
{
"begin": 0,
"end": 6,
"score": 1
},
{
"begin": 6,
"end": 33,
"score": 0
},
{
"begin": 33,
"end": 41,
"score": 1
},
{
"begin": 41,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 230,
"score": 1
},
{
"begin": 230,
"end": 290,
"score": 0
},
{
"begin": 290,
"end": 299,
"score": 1
},
{
"begin": 299,
"end": 380,
"score": 0
},
{
"begin": 380,
"end": 388,
"score": 1
},
{
"begin": 388,
"end": 389,
"score": 0
},
{
"begin": 389,
"end": 397,
"score": 1
},
{
"begin": 397,
"end": 412,
"score": 0
},
{
"begin": 412,
"end": 418,
"score": 1
},
{
"begin": 418,
"end": 419,
"score": 0
},
{
"begin": 419,
"end": 427,
"score": 1
},
{
"begin": 427,
"end": 460,
"score": 0
},
{
"begin": 460,
"end": 468,
"score": 1
},
{
"begin": 468,
"end": 569,
"score": 0
},
{
"begin": 569,
"end": 575,
"score": 1
},
{
"begin": 575,
"end": 787,
"score": 0
},
{
"begin": 787,
"end": 793,
"score": 1
},
{
"begin": 793,
"end": 814,
"score": 0
},
{
"begin": 814,
"end": 821,
"score": 1
},
{
"begin": 821,
"end": 837,
"score": 0
},
{
"begin": 837,
"end": 841,
"score": 1
},
{
"begin": 841,
"end": 845,
"score": 0
},
{
"begin": 845,
"end": 854,
"score": 1
},
{
"begin": 854,
"end": 872,
"score": 0
},
{
"begin": 872,
"end": 880,
"score": 1
},
{
"begin": 880,
"end": 910,
"score": 0
},
{
"begin": 910,
"end": 919,
"score": 1
},
{
"begin": 919,
"end": 933,
"score": 0
},
{
"begin": 933,
"end": 941,
"score": 1
},
{
"begin": 941,
"end": 1203,
"score": 0
},
{
"begin": 1203,
"end": 1211,
"score": 1
},
{
"begin": 1211,
"end": 1216,
"score": 0
},
{
"begin": 1216,
"end": 1223,
"score": 1
},
{
"begin": 1223,
"end": 1296,
"score": 0
},
{
"begin": 1296,
"end": 1304,
"score": 1
},
{
"begin": 1304,
"end": 1473,
"score": 0
},
{
"begin": 1473,
"end": 1480,
"score": 1
},
{
"begin": 1480,
"end": 1495,
"score": 0
},
{
"begin": 1495,
"end": 1502,
"score": 1
},
{
"begin": 1502,
"end": 1520,
"score": 0
},
{
"begin": 1520,
"end": 1528,
"score": 1
},
{
"begin": 1528,
"end": 1529,
"score": 0
},
{
"begin": 1529,
"end": 1536,
"score": 1
},
{
"begin": 1536,
"end": 1698,
"score": 0
},
{
"begin": 1698,
"end": 1706,
"score": 1
},
{
"begin": 1706,
"end": 1708,
"score": 0
},
{
"begin": 1708,
"end": 1713,
"score": 1
},
{
"begin": 1713,
"end": 1714,
"score": 0
},
{
"begin": 1714,
"end": 1718,
"score": 1
},
{
"begin": 1718,
"end": 1734,
"score": 0
},
{
"begin": 1734,
"end": 1742,
"score": 1
},
{
"begin": 1742,
"end": 1743,
"score": 0
},
{
"begin": 1743,
"end": 1750,
"score": 1
},
{
"begin": 1750,
"end": 2101,
"score": 0
},
{
"begin": 2101,
"end": 2110,
"score": 1
},
{
"begin": 2110,
"end": 2111,
"score": 0
},
{
"begin": 2111,
"end": 2121,
"score": 1
},
{
"begin": 2121,
"end": 2607,
"score": 0
},
{
"begin": 2607,
"end": 2611,
"score": 1
},
{
"begin": 2611,
"end": 2629,
"score": 0
},
{
"begin": 2629,
"end": 2637,
"score": 1
},
{
"begin": 2637,
"end": 2683,
"score": 0
},
{
"begin": 2683,
"end": 2690,
"score": 1
},
{
"begin": 2690,
"end": 2713,
"score": 0
},
{
"begin": 2713,
"end": 2721,
"score": 1
},
{
"begin": 2721,
"end": 2731,
"score": 0
}
] |
Walter Gregor
Walter Gregor (1825–1897) was a Scottish folklorist, linguist and minister of religion. His anthropological research work won him an international reputation.
Life
The son of James Gregor, a tenant farmer of Forgieside, near Keith, Banffshire, Walter Gregor was born on 23 October 1825. He obtained an MA at King's College, Aberdeen, then took the position of Master at Macduff Parish School, in a small village on Moray Firth.
Gregor completed his degree in divinity at the age of 32, and a series of earlier appointments led to his placement in 1863 at the Parish of Pitsligo by Queen Victoria. He spoke French and Hebrew and gained an international reputation for his broad studies and discoveries. Gregor's field collections and writing were often focused on archaeology and folklore, but his interest and publications extended to a wide range of subjects.
Gregor was a published member of the Folklore Society, New Spalding Club, and Scottish Text Society. His works extended to a series of books and over 65 papers, which appeared in French, English, and Spanish. His books included Glossary of Words not in Jamieson's Scottish Dictionary (1866), Echo of Olden Times from the North of Scotland (1881), and Notes on the Folk-Lore of the North-East of Scotland for the Folk-Lore Society (1881).
He died on 4 February 1897 at Bonnyrigg, two years after his retirement there. He is buried in the small north cemetery at Lasswade on the north side of the entrance path, with his wife, Margaret Aven Gardiner (1837–1906). They were survived by a son and a daughter.
Recognition
An excerpt of the original obituary in the Journal of the Folklore Society was reprinted in their centennial review of his contribution, "His name appears on the first list of members of the Folk-Lore Society; and among the early publications of the Society were his Notes on the Folk-Lore of the North-East of Scotland. To know this book is to recognise its value as a transcript of the superstitions and traditions of a district rich in remains of the past up to that time unrecorded. Its author, however, was by no means content to rest on the reputation its publication immediately won, for he was an indefatigable collector. Frequent communications to the Folk-Lore Society and to the Société des Traditions Populaires, of which he was also a member, attest his continued industry."
References
External links
Category:Folklorists
Category:1825 births
Category:1897 deaths
Category:Alumni of the University of Aberdeen
Category:Ministers of the Church of Scotland
|
{
"pile_set_name": "Wikipedia (en)"
}
| 82 |
[
{
"begin": 0,
"end": 6,
"score": 1
},
{
"begin": 6,
"end": 7,
"score": 0
},
{
"begin": 7,
"end": 13,
"score": 1
},
{
"begin": 13,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 28,
"score": 1
},
{
"begin": 28,
"end": 47,
"score": 0
},
{
"begin": 47,
"end": 55,
"score": 1
},
{
"begin": 55,
"end": 175,
"score": 0
},
{
"begin": 175,
"end": 179,
"score": 1
},
{
"begin": 179,
"end": 191,
"score": 0
},
{
"begin": 191,
"end": 196,
"score": 1
},
{
"begin": 196,
"end": 197,
"score": 0
},
{
"begin": 197,
"end": 203,
"score": 1
},
{
"begin": 203,
"end": 224,
"score": 0
},
{
"begin": 224,
"end": 234,
"score": 1
},
{
"begin": 234,
"end": 241,
"score": 0
},
{
"begin": 241,
"end": 246,
"score": 1
},
{
"begin": 246,
"end": 248,
"score": 0
},
{
"begin": 248,
"end": 258,
"score": 1
},
{
"begin": 258,
"end": 260,
"score": 0
},
{
"begin": 260,
"end": 266,
"score": 1
},
{
"begin": 266,
"end": 267,
"score": 0
},
{
"begin": 267,
"end": 273,
"score": 1
},
{
"begin": 273,
"end": 289,
"score": 0
},
{
"begin": 289,
"end": 296,
"score": 1
},
{
"begin": 296,
"end": 324,
"score": 0
},
{
"begin": 324,
"end": 328,
"score": 1
},
{
"begin": 328,
"end": 331,
"score": 0
},
{
"begin": 331,
"end": 338,
"score": 1
},
{
"begin": 338,
"end": 340,
"score": 0
},
{
"begin": 340,
"end": 348,
"score": 1
},
{
"begin": 348,
"end": 376,
"score": 0
},
{
"begin": 376,
"end": 382,
"score": 1
},
{
"begin": 382,
"end": 386,
"score": 0
},
{
"begin": 386,
"end": 393,
"score": 1
},
{
"begin": 393,
"end": 394,
"score": 0
},
{
"begin": 394,
"end": 400,
"score": 1
},
{
"begin": 400,
"end": 401,
"score": 0
},
{
"begin": 401,
"end": 407,
"score": 1
},
{
"begin": 407,
"end": 431,
"score": 0
},
{
"begin": 431,
"end": 436,
"score": 1
},
{
"begin": 436,
"end": 437,
"score": 0
},
{
"begin": 437,
"end": 442,
"score": 1
},
{
"begin": 442,
"end": 445,
"score": 0
},
{
"begin": 445,
"end": 451,
"score": 1
},
{
"begin": 451,
"end": 576,
"score": 0
},
{
"begin": 576,
"end": 582,
"score": 1
},
{
"begin": 582,
"end": 586,
"score": 0
},
{
"begin": 586,
"end": 594,
"score": 1
},
{
"begin": 594,
"end": 598,
"score": 0
},
{
"begin": 598,
"end": 603,
"score": 1
},
{
"begin": 603,
"end": 604,
"score": 0
},
{
"begin": 604,
"end": 612,
"score": 1
},
{
"begin": 612,
"end": 634,
"score": 0
},
{
"begin": 634,
"end": 640,
"score": 1
},
{
"begin": 640,
"end": 719,
"score": 0
},
{
"begin": 719,
"end": 725,
"score": 1
},
{
"begin": 725,
"end": 879,
"score": 0
},
{
"begin": 879,
"end": 885,
"score": 1
},
{
"begin": 885,
"end": 925,
"score": 0
},
{
"begin": 925,
"end": 932,
"score": 1
},
{
"begin": 932,
"end": 934,
"score": 0
},
{
"begin": 934,
"end": 937,
"score": 1
},
{
"begin": 937,
"end": 938,
"score": 0
},
{
"begin": 938,
"end": 946,
"score": 1
},
{
"begin": 946,
"end": 947,
"score": 0
},
{
"begin": 947,
"end": 951,
"score": 1
},
{
"begin": 951,
"end": 957,
"score": 0
},
{
"begin": 957,
"end": 965,
"score": 1
},
{
"begin": 965,
"end": 971,
"score": 0
},
{
"begin": 971,
"end": 978,
"score": 1
},
{
"begin": 978,
"end": 1066,
"score": 0
},
{
"begin": 1066,
"end": 1073,
"score": 1
},
{
"begin": 1073,
"end": 1107,
"score": 0
},
{
"begin": 1107,
"end": 1115,
"score": 1
},
{
"begin": 1115,
"end": 1132,
"score": 0
},
{
"begin": 1132,
"end": 1140,
"score": 1
},
{
"begin": 1140,
"end": 1143,
"score": 0
},
{
"begin": 1143,
"end": 1151,
"score": 1
},
{
"begin": 1151,
"end": 1152,
"score": 0
},
{
"begin": 1152,
"end": 1162,
"score": 1
}
] |
Abdominal strength after breast reconstruction using a free abdominal flap.
Today, breast reconstruction with autologous tissue is most commonly done either as a free muscle sparring TRAM flap or as a DIEP flap. Studies of donor site morbidity have shown an advantage in using the DIEP flap. However, this procedure might also be associated with an increased risk of flow related complications and it is also thought to be more demanding and time consuming. A few studies have evaluated the abdominal wall strength after dissection of a TRAM flap or a DIEP flap. However, these studies do not distinguish between the various types of free TRAM flaps and they also compare TRAM procedures preformed in an early period to DIEP procedures done in a later period. We used an isokinetic dynamometer to measure concentric, eccentric and isometric abdominal muscle strength in 32 patients who had had a unilateral breast reconstruction with a free MS-2 (15) or a DIEP (17) flap in the year 2003. No significant reduction in muscle strength was observed for concentric or isometric muscle strength. However, significant lower eccentric muscle strength was found in the TRAM compared to the DIEP group (p=0.05). There was no significant difference in abdominal strength between the two flap groups at low to moderate work intensity (isometric/concentric). At the greatest work intensity (eccentric muscle strength) the patients reconstructed with a DIEP flap had a clinical small, but significant advantage over the patients reconstructed with a MS-2 TRAM flap.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 0 |
[
{
"begin": 0,
"end": 1552,
"score": 0
}
] |
Writings about Education and Life in New England
Years ago I saw a couple standing along the Deerfield River in western Massachusetts, dripping wet in their boating gear. The woman’s eyes were red. She stood with her arms crossed, her back toward the man she was with. They weren’t talking. He wore a haunted look and all but flung himself in front of my car with his thumb out. A few minutes into our ride, the silence was awkward.
“What’s wrong?” I asked.
Head in his hands, he let out a sigh.
“Don’t ever try to teach your wife to paddle.”
And for years, I didn’t.
***
In the meantime, I taught her to ski, to snowshoe, and to drive within ten miles per hour of the speed limit. I’ve taken her kayaking on lakes and on the ocean. Sure, I’d broached the subject of rivers, but I’d never been seriously tempted to take her. Why not?
First, I’m a whitewater fatalist.
What’s that? It means I think our sport is scary. It means I don’t expect most people to like it. Every sport has a barrier of entry that you have to get past. In flatwater kayaking, it’s “Can you get your boat on and off the car?” In whitewater, it’s “How comfortable are you flipping upside down with rocks whizzing past your head?” For most people, the answer is “I’ll stick to watching NASCAR on the couch, thank you.” And don’t forget how claustrophobic people feel in a small kayak with sprayskirt on. Rafting on the Lower Yough? That’s okay. You’re up high, you’re not strapped in, you’re safer. Your aunt and her church group do that. Flatwater paddling on Lake Meowmix? That’s downright relaxing. Your mom likes that. But jam your claustrophobic spouse into a small boat with a chance of flipping upside down? She’ll last about as long as Anthony Scaramucci.
Paddling on the lake is fun. Paddling on the river? Whole different story.
Second, I’m a relationship realist.
I’ve never thought that couples need to share every last interest. Plenty of guys I knew swore they’d never date a woman who wasn’t a kayaker or wasn’t interested in becoming one. I disagreed. First, I’d find it terrifying to watch my spouse paddle class V. Second, it’s just plain healthy to have your own separate interests. My wife and I hike together, travel together, even (nerd alert) read together. You don’t need everything in common. It’s better if you don’t.
So I never pushed it.
***
Okay, maybe a little.
After all, what is there in life that’s quite like paddling a boat down a river, through a beautiful valley, on a hot summer day? Finally, a few weeks ago, I set up the perfect first trip: dinner and live music with family in the Berkshires, then camp out at Zoar Outdoor and paddle the Deerfield River the next morning. It was the perfect blend of culture and adventure, the perfect first entry into the greatest sport there is.
And then as we were driving to the put in, I had a flashback.
Ten years before . . . the Deerfield River . . . same shuttle road . . . this was where I’d seen that couple! The haunted man appeared before me. His ghost — the Ghost of Relationships Past, the Ghost of Wedding Rings Whipped Back in Your Face, the Ghost of #Shesaidyes #Thenshetookitback — whispered in my ears:
“Alden,” he said, “Why didn’t you listen to me?”
“Why are you teaching your wife to paddle?”
“Why not just start dividing up your household possessions right now?”
“Go away,” I told the ghost. “I know what I’m doing.”
But of course, like every boyfriend or husband ever, I didn’t.
***
Fortunately I am publishing this article so that you can learn from my mistakes. That’s right: If you ever decide to teach your spouse to paddle, here are a few suggestions:
1. If you want to give her the authentic dirtbag kayaker camping experience, you should probably wait until she’s truly hooked on the sport. Having to sleep with her sweatshirt as a blanket and her lifejacket as a pillow is not going to go over well. Neither is offering her an old space blanket that looks like a giant garbage bag. Next time try to remember the camping stuff.
2. Treating her to an awesome breakfast the next morning can help you rebound from the previous night’s debacle, but realizing that the release isn’t happening for another four hours can put you right back in the penalty box.
3. Keep it “fun.” Filling that extra time with side trips to places that no whitewater boaters have ever set foot in before, such as the Bridge of Flowers in Shelburne, Massachusetts (to, you know, appreciate the flowers) can make things smell a lot sweeter.
4. Think of yourself as the staff at a nice hotel. Make sure her boat gets on and off the car without her realizing it. Make sure that you carry your boat on your shoulder, while also carrying the stern of her boat, so that she only has to pick up the bow. Make all the gear magically appear in the back of the car the night before.
5. Don’t bark orders at her. You know how many women really appreciated that time you shouted a million pointers at them right as they were floating into their first ever rapid, completely terrified? Zero. Don’t let her hold the paddle upside down or anything, but don’t be an officious jerk. It doesn’t matter if she masters the subtleties of the draw stroke. It matters if she comes back a second time. Keep it light and fun.
6. You always check the boat for spiders first. Seriously, that’s not a weird request at all. Actually, it’s a standard kayaker thing. I think Dane Jackson does it before he races the North Fork. Totally normal.
7. Offer lots of praise. You’re going to have to say things you’d never say to your boating buddies: “Wow, you’re doing great!” or “How do you look so pretty even in my old boating gear?”
8. Even if by the end she’s feeling cocky because of all that praise, don’t let her run the big class III without scouting. Even if she’s persistent and / or questions your manhood, you have to stand firm.
9. Try not to get ahead of the release. Otherwise you’ll find yourself running that big class III at a much harder water level than usual. If by chance you only realize this after you’re both committed to the rapid, try to cross yourself a few times and pray that when the dust settles, you won’t be communicating through lawyers.
10. If she does flip and swim in Zoar Gap, instead of yelling “I told you we should have scouted” or “Bootie beer!” you’re going to have to do something you’d never do with your regular crew. Give her a hug.
11. If you find her that evening watching videos of kayakers running Zoar Gap and saying, “I bet I could do it without flipping” . . . Congratulations. You’ve avoided the fate of the Ghosts of Relationships Past.
One thought on “How to Teach Your Spouse to Paddle (Without Getting Divorced)”
I thankfully learned to snowboard a whole month before my first (snowboarding) date with Eli from someone I paid to teach me. That might be the only reason we made to getting married. Funny post. I’ll have to tell you about the Kara-Asa-Abe + crickets-in-the-kayak story sometime!
|
{
"pile_set_name": "Pile-CC"
}
| 57 |
[
{
"begin": 0,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 24,
"score": 1
},
{
"begin": 24,
"end": 29,
"score": 0
},
{
"begin": 29,
"end": 33,
"score": 1
},
{
"begin": 33,
"end": 37,
"score": 0
},
{
"begin": 37,
"end": 40,
"score": 1
},
{
"begin": 40,
"end": 41,
"score": 0
},
{
"begin": 41,
"end": 48,
"score": 1
},
{
"begin": 48,
"end": 94,
"score": 0
},
{
"begin": 94,
"end": 103,
"score": 1
},
{
"begin": 103,
"end": 104,
"score": 0
},
{
"begin": 104,
"end": 109,
"score": 1
},
{
"begin": 109,
"end": 121,
"score": 0
},
{
"begin": 121,
"end": 134,
"score": 1
},
{
"begin": 134,
"end": 461,
"score": 0
},
{
"begin": 461,
"end": 465,
"score": 1
},
{
"begin": 465,
"end": 501,
"score": 0
},
{
"begin": 501,
"end": 504,
"score": 1
},
{
"begin": 504,
"end": 842,
"score": 0
},
{
"begin": 842,
"end": 847,
"score": 1
},
{
"begin": 847,
"end": 1385,
"score": 0
},
{
"begin": 1385,
"end": 1392,
"score": 1
},
{
"begin": 1392,
"end": 1406,
"score": 0
},
{
"begin": 1406,
"end": 1411,
"score": 1
},
{
"begin": 1411,
"end": 1520,
"score": 0
},
{
"begin": 1520,
"end": 1529,
"score": 1
},
{
"begin": 1529,
"end": 1542,
"score": 0
},
{
"begin": 1542,
"end": 1546,
"score": 1
},
{
"begin": 1546,
"end": 1547,
"score": 0
},
{
"begin": 1547,
"end": 1554,
"score": 1
},
{
"begin": 1554,
"end": 1725,
"score": 0
},
{
"begin": 1725,
"end": 1732,
"score": 1
},
{
"begin": 1732,
"end": 1733,
"score": 0
},
{
"begin": 1733,
"end": 1743,
"score": 1
},
{
"begin": 1743,
"end": 1746,
"score": 0
},
{
"begin": 1746,
"end": 1754,
"score": 1
},
{
"begin": 1754,
"end": 1775,
"score": 0
},
{
"begin": 1775,
"end": 1783,
"score": 1
},
{
"begin": 1783,
"end": 2052,
"score": 0
},
{
"begin": 2052,
"end": 2057,
"score": 1
},
{
"begin": 2057,
"end": 2610,
"score": 0
},
{
"begin": 2610,
"end": 2620,
"score": 1
},
{
"begin": 2620,
"end": 2639,
"score": 0
},
{
"begin": 2639,
"end": 2643,
"score": 1
},
{
"begin": 2643,
"end": 2667,
"score": 0
},
{
"begin": 2667,
"end": 2676,
"score": 1
},
{
"begin": 2676,
"end": 2677,
"score": 0
},
{
"begin": 2677,
"end": 2682,
"score": 1
},
{
"begin": 2682,
"end": 2901,
"score": 0
},
{
"begin": 2901,
"end": 2910,
"score": 1
},
{
"begin": 2910,
"end": 2911,
"score": 0
},
{
"begin": 2911,
"end": 2916,
"score": 1
},
{
"begin": 2916,
"end": 3045,
"score": 0
},
{
"begin": 3045,
"end": 3058,
"score": 1
},
{
"begin": 3058,
"end": 3086,
"score": 0
},
{
"begin": 3086,
"end": 3091,
"score": 1
},
{
"begin": 3091,
"end": 3092,
"score": 0
},
{
"begin": 3092,
"end": 3099,
"score": 1
}
] |
Transportation Staff
Information
Please locate the road closest to your address to determine the approximate time of arrival and the bus number your child will ride. If your child rode last year the bus should be close to the same time and the same location.
Please have students at the bus stop 5 minutes before the scheduled arrival time.
Please remind students to stand at least 10 feet from the street for their safety.
Students should wait at the bus stop, not inside the home. The bus driver is not obligated to wait.
Children should not retrieve the mail as they get off the bus. They are to go straight to the home.
Should your child need to ride a bus different than their assigned bus, a note must be sent to the attendance office at the child’s school. Without a note, the child will be directed to their regular bus.
Parents of young children are required to be at the bus stop when the bus arrives. Bus drivers are trained to make this verification before they will let the student off. In the event no one is visible, the child may be taken back to the school.
On the first day of school, each student will receive a Rules and Regulations brochure. Attached to the brochure is an emergency contact form. This form needs to be returned to the bus driver no later than the third day of school.
If you have any questions regarding your child’s bus schedule, please contact the Transportation office at 540-948-3787. We look forward to transporting our most precious possession, your children.
|
{
"pile_set_name": "Pile-CC"
}
| 6 |
[
{
"begin": 0,
"end": 14,
"score": 1
},
{
"begin": 14,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 20,
"score": 1
},
{
"begin": 20,
"end": 22,
"score": 0
},
{
"begin": 22,
"end": 33,
"score": 1
},
{
"begin": 33,
"end": 1140,
"score": 0
},
{
"begin": 1140,
"end": 1145,
"score": 1
}
] |
The Cluster Of Blue Stars Surrounding The M31 Nuclear Black Hole
View/Open
Date
Author
Share
Metadata
Abstract
We obtained U330- and B-band images of the M31 nucleus using the High Resolution Camera of the Advanced Camera for Surveys on board the Hubble Space Telescope (HST). The spatial resolution in the U-330 band, 0.'' 03 FWHM, or 0.1 pc at M31, is sufficient to resolve the outskirts of the compact cluster (P3) of UV-bright stars surrounding the M31 black hole. The center of the cluster is marked by an extended source that is both brighter and redder than the other point sources within P3; it is likely to be a blend of several bright stars. We hypothesize that it marks the location of the M31 black hole. Both stellar photometry and a surface brightness fluctuation analysis show that the P3 stellar population is consistent with early-type main-sequence stars formed in a similar to 100-200 Myr old starburst population. Evolutionary tracks of post early asymptotic giant branch (PEAGB) stars, associated with late-stage evolution of an old population, also traverse the U and U - B domain occupied by the P3 stars; but we argue that only a few stars could be accounted for that way. PEAGB evolution is very rapid, and there is no progenitor population of red giants associated with P3. The result that P3 comprises young stars is consistent with inferences from earlier HST observations of the integrated light of the cluster. Like the Milky Way, M31 harbors a black hole closely surrounded by apparently young stars.
|
{
"pile_set_name": "Pile-CC"
}
| 38 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 15,
"score": 0
},
{
"begin": 15,
"end": 19,
"score": 1
},
{
"begin": 19,
"end": 20,
"score": 0
},
{
"begin": 20,
"end": 25,
"score": 1
},
{
"begin": 25,
"end": 42,
"score": 0
},
{
"begin": 42,
"end": 45,
"score": 1
},
{
"begin": 45,
"end": 46,
"score": 0
},
{
"begin": 46,
"end": 53,
"score": 1
},
{
"begin": 53,
"end": 54,
"score": 0
},
{
"begin": 54,
"end": 59,
"score": 1
},
{
"begin": 59,
"end": 60,
"score": 0
},
{
"begin": 60,
"end": 64,
"score": 1
},
{
"begin": 64,
"end": 66,
"score": 0
},
{
"begin": 66,
"end": 75,
"score": 1
},
{
"begin": 75,
"end": 83,
"score": 0
},
{
"begin": 83,
"end": 89,
"score": 1
},
{
"begin": 89,
"end": 98,
"score": 0
},
{
"begin": 98,
"end": 106,
"score": 1
},
{
"begin": 106,
"end": 108,
"score": 0
},
{
"begin": 108,
"end": 116,
"score": 1
},
{
"begin": 116,
"end": 130,
"score": 0
},
{
"begin": 130,
"end": 134,
"score": 1
},
{
"begin": 134,
"end": 140,
"score": 0
},
{
"begin": 140,
"end": 141,
"score": 1
},
{
"begin": 141,
"end": 161,
"score": 0
},
{
"begin": 161,
"end": 164,
"score": 1
},
{
"begin": 164,
"end": 183,
"score": 0
},
{
"begin": 183,
"end": 187,
"score": 1
},
{
"begin": 187,
"end": 188,
"score": 0
},
{
"begin": 188,
"end": 198,
"score": 1
},
{
"begin": 198,
"end": 199,
"score": 0
},
{
"begin": 199,
"end": 205,
"score": 1
},
{
"begin": 205,
"end": 213,
"score": 0
},
{
"begin": 213,
"end": 221,
"score": 1
},
{
"begin": 221,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 228,
"score": 1
},
{
"begin": 228,
"end": 254,
"score": 0
}
] |
Association of abnormal serum lipids in elderly persons with atherosclerotic vascular disease and dementia, atherosclerotic vascular disease without dementia, dementia without atherosclerotic vascular disease, and no dementia or atherosclerotic vascular disease.
Observational data have shown that the use of statins was associated with a lower prevalence of vascular dementia and of Alzheimer's disease. We investigated in an academic nursing home the association of dyslipidemia with atherosclerotic vascular disease (group 1), atherosclerotic vascular disease without dementia (group 2), dementia without atherosclerotic vascular disease (group 3), and no dementia or atherosclerotic vascular disease (group 4). Increased serum low-density lipoprotein (LDL) cholesterol was present in 36 of 50 group 1 patients (72%), in 34 of 50 group 2 patients (68%), in 34 of 50 group 3 patients (68%), and in 18 of 50 group 4 patients (36%) (p =.0003 for 1 versus 4; p = 0.001 for 2 versus 4 and 3 versus 4). Decreased serum high-density lipoprotein (HDL) cholesterol was present in 34 of 50 group 1 patients (68%), in 35 of 50 group 2 patients (70%), in 32 of 50 group 3 patients (64%), and in 16 of 50 group 4 patients (32%) (p =.0003 for 1 versus 4; p =.0001 for 2 versus 4; p =.001 for 3 versus 4). Hypertriglyceridemia was not significantly different in the 4 groups. The prevalence of increased serum LDL cholesterol and decreased serum HDL cholesterol were significantly higher in elderly patients with atherosclerotic vascular disease plus dementia, atherosclerotic vascular disease without dementia, and dementia without atherosclerotic vascular disease than in patients with no dementia or atherosclerotic vascular disease.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 3 |
[
{
"begin": 0,
"end": 11,
"score": 1
},
{
"begin": 11,
"end": 384,
"score": 0
},
{
"begin": 384,
"end": 393,
"score": 1
},
{
"begin": 393,
"end": 1294,
"score": 0
}
] |
#!./perl
warnings->unimport('experimental::lexical_topic')
if !$Config{usecperl} and $] > 5.018;
my $_ = "foo";
my $ok = any { $_ eq "a" } qw(a b c);
#warn $ok;
ok( $ok, 'any my $_');
|
{
"pile_set_name": "Github"
}
| 0 |
[
{
"begin": 0,
"end": 187,
"score": 0
}
] |
The Vigilant
The Vigilant was an English-language newspaper published from Khartoum, Sudan. The first issue was published on March 23, 1965. It was an organ of the Southern Front. It functioned as a relatively well-written informative newsletter, and became the mouthpiece of the Southern movement in general and the Southern Front in particular. Effectively it was the sole press outlet for Southern opinions.
Bona Malual Madut Ring (the general secretary of the Southern Front) was the editor of The Vigilant. Darurs Beshar was the registered proprietor of the publication.
Publication of The Vigilant was interrupted between July 1965 and January 1966. The suspension was issued on July 15, 1965, following the publishing of articles about the recent massacres in Juba and Wau. The Vigilant had held the government responsible for what it called 'barbaric and brutal killing'. The newspaper claimed that there had been 1,400 casualties and 76 killed (out of whom 49 victims would have been Southern Sudanese government employees, killed in Wau on Mau 8-9). Furthermore the publication argued that the incidents was "not accident but part and parcel of a plan to depopulate the south". Copies of the newspaper commenting on the massacres were seized. Darurs Beshar and Bona Malual were arrested and tried in court. They were eventually acquitted of any criminal acts.
The publishing frequency of The Vigilant varied. For some periods it was issued daily. Between November 1967 and April 1968 it appeared on weekly basis.
The Vigilant was closed down in May 1969.
References
Category:1965 establishments in Sudan
Category:1969 disestablishments in Sudan
Category:Defunct newspapers of Sudan
Category:English-language newspapers
Category:Publications established in 1965
Category:Publications disestablished in 1969
|
{
"pile_set_name": "Wikipedia (en)"
}
| 48 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 12,
"score": 1
},
{
"begin": 12,
"end": 18,
"score": 0
},
{
"begin": 18,
"end": 26,
"score": 1
},
{
"begin": 26,
"end": 76,
"score": 0
},
{
"begin": 76,
"end": 84,
"score": 1
},
{
"begin": 84,
"end": 86,
"score": 0
},
{
"begin": 86,
"end": 91,
"score": 1
},
{
"begin": 91,
"end": 126,
"score": 0
},
{
"begin": 126,
"end": 131,
"score": 1
},
{
"begin": 131,
"end": 165,
"score": 0
},
{
"begin": 165,
"end": 173,
"score": 1
},
{
"begin": 173,
"end": 174,
"score": 0
},
{
"begin": 174,
"end": 179,
"score": 1
},
{
"begin": 179,
"end": 281,
"score": 0
},
{
"begin": 281,
"end": 289,
"score": 1
},
{
"begin": 289,
"end": 318,
"score": 0
},
{
"begin": 318,
"end": 326,
"score": 1
},
{
"begin": 326,
"end": 327,
"score": 0
},
{
"begin": 327,
"end": 332,
"score": 1
},
{
"begin": 332,
"end": 393,
"score": 0
},
{
"begin": 393,
"end": 401,
"score": 1
},
{
"begin": 401,
"end": 413,
"score": 0
},
{
"begin": 413,
"end": 417,
"score": 1
},
{
"begin": 417,
"end": 418,
"score": 0
},
{
"begin": 418,
"end": 424,
"score": 1
},
{
"begin": 424,
"end": 425,
"score": 0
},
{
"begin": 425,
"end": 430,
"score": 1
},
{
"begin": 430,
"end": 431,
"score": 0
},
{
"begin": 431,
"end": 435,
"score": 1
},
{
"begin": 435,
"end": 466,
"score": 0
},
{
"begin": 466,
"end": 474,
"score": 1
},
{
"begin": 474,
"end": 475,
"score": 0
},
{
"begin": 475,
"end": 480,
"score": 1
},
{
"begin": 480,
"end": 504,
"score": 0
},
{
"begin": 504,
"end": 512,
"score": 1
},
{
"begin": 512,
"end": 514,
"score": 0
},
{
"begin": 514,
"end": 520,
"score": 1
},
{
"begin": 520,
"end": 521,
"score": 0
},
{
"begin": 521,
"end": 527,
"score": 1
},
{
"begin": 527,
"end": 598,
"score": 0
},
{
"begin": 598,
"end": 606,
"score": 1
},
{
"begin": 606,
"end": 631,
"score": 0
},
{
"begin": 631,
"end": 635,
"score": 1
},
{
"begin": 635,
"end": 645,
"score": 0
},
{
"begin": 645,
"end": 652,
"score": 1
},
{
"begin": 652,
"end": 688,
"score": 0
},
{
"begin": 688,
"end": 692,
"score": 1
},
{
"begin": 692,
"end": 770,
"score": 0
}
] |
The Dayton
International Airport is located in west central Ohio. The primary objective
of the Dayton International Airport Master Plan is to enhance safety,
to reduce delays, increase airfield operational flexibility, while taking
into consideration environmental impacts. The current Dayton International
Airport Master Plan recommends future development projects that will provide
airfield and landside improvements to meet forecast projections for passenger
and cargo operations well into the 21st Century.
An evaluation of the existing airfield showed that its current geometry
is the main constraint to achieving the primary objectives of the Dayton
International Airport Master Plan. The Master Plan recommends extending
Runway 6R-24L to 9,500 feet in length, and extending Runway 18-36 to 9,500
feet in length and relocating the 36 threshold to the north side of Runway
6R-24L.
These proposed runway projects would provide the following improvements:
4. Enhance the flow of aircraft movements and reduce the number of
aircraft runway crossings.
5. Enhance the flow and safety of the on-airport service road system
by virtually eliminating all vehicle runway crossings.
The Runway
6R-24L extension to the southwest should be implemented first, followed
by the extension and relocation of Runway 18-36 to the north. Lastly,
the Future Airport Layout Plan drawing depicts a future southwest extension
to Runway 6L-24R. The Runway 6L-24R extension project will be undertaken
only when needed. The third parallel runway, which was originally envisioned
to be needed beyond the 20-year planning horizon, has been removed from
the plan.
|
{
"pile_set_name": "Pile-CC"
}
| 39 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 10,
"score": 1
},
{
"begin": 10,
"end": 11,
"score": 0
},
{
"begin": 11,
"end": 24,
"score": 1
},
{
"begin": 24,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 32,
"score": 1
},
{
"begin": 32,
"end": 60,
"score": 0
},
{
"begin": 60,
"end": 64,
"score": 1
},
{
"begin": 64,
"end": 95,
"score": 0
},
{
"begin": 95,
"end": 101,
"score": 1
},
{
"begin": 101,
"end": 102,
"score": 0
},
{
"begin": 102,
"end": 115,
"score": 1
},
{
"begin": 115,
"end": 116,
"score": 0
},
{
"begin": 116,
"end": 123,
"score": 1
},
{
"begin": 123,
"end": 124,
"score": 0
},
{
"begin": 124,
"end": 130,
"score": 1
},
{
"begin": 130,
"end": 131,
"score": 0
},
{
"begin": 131,
"end": 135,
"score": 1
},
{
"begin": 135,
"end": 286,
"score": 0
},
{
"begin": 286,
"end": 292,
"score": 1
},
{
"begin": 292,
"end": 293,
"score": 0
},
{
"begin": 293,
"end": 306,
"score": 1
},
{
"begin": 306,
"end": 307,
"score": 0
},
{
"begin": 307,
"end": 314,
"score": 1
},
{
"begin": 314,
"end": 315,
"score": 0
},
{
"begin": 315,
"end": 321,
"score": 1
},
{
"begin": 321,
"end": 322,
"score": 0
},
{
"begin": 322,
"end": 326,
"score": 1
},
{
"begin": 326,
"end": 502,
"score": 0
},
{
"begin": 502,
"end": 509,
"score": 1
},
{
"begin": 509,
"end": 650,
"score": 0
},
{
"begin": 650,
"end": 656,
"score": 1
},
{
"begin": 656,
"end": 657,
"score": 0
},
{
"begin": 657,
"end": 670,
"score": 1
},
{
"begin": 670,
"end": 671,
"score": 0
},
{
"begin": 671,
"end": 678,
"score": 1
},
{
"begin": 678,
"end": 679,
"score": 0
},
{
"begin": 679,
"end": 685,
"score": 1
},
{
"begin": 685,
"end": 686,
"score": 0
},
{
"begin": 686,
"end": 690,
"score": 1
}
] |
Driving the Creation of Knowledge
When you've got something to say, we believe it is important that getting your message across and making an impact should be as easy as possible. Our aim is to help you explain it better, to give you the freedom to share your knowledge with others - However you want, and whenever you want, when your audience is in the same room or on the other side of the world. Because knowledge matters - to all of us.
Generating new and sometimes groundbreaking knowledge, whether in education or in research presents tremendous, but at the same time marvellous challenges. Meeting these challenges successfully requires innovative, comprehensive solutions, for presentation, knowledge sharing, and collaboration. This is what vSolution offers us.
Visualizer presentation & collaboration systems
Never before has success in business been so dependent on effective knowledge sharing and collaboration between employees. It is also just as important in educational institutions, where successful learning depends on the effective implementation of innovative and creative teaching methods.
WolfVision Visualizer Systems and solutions support more effective communication and collaboration, through advanced but easy-to-use presentation and collaboration technology.
|
{
"pile_set_name": "Pile-CC"
}
| 4 |
[
{
"begin": 0,
"end": 443,
"score": 0
},
{
"begin": 443,
"end": 453,
"score": 1
},
{
"begin": 453,
"end": 774,
"score": 0
},
{
"begin": 774,
"end": 784,
"score": 1
},
{
"begin": 784,
"end": 1127,
"score": 0
}
] |
Donate
Donations to the Chan Meditation Center are tax-deductible. When you donate to CMC, you are helping to support our core services, retreats and center activities, as well as peace building and improving our community.
Please consider making a one-time donation or an installment pledge. Gifts of stock transfer and bequests are always appreciated. For assistance with making donations, please email [email protected], or by phone: (718) 592-6593.
Please make your checks payable to CMC and send it to:
Chan Meditation Center
90-56 Corona Avenue
Elmhurst, NY 11373
Alternatively, you can donate online using PayPal by clicking on the DONATE button below:
Thank you for your generosity!
Whether or not you are able to make a donation at this time, there are other ways you can help further the goals of CMC, such as volunteering your time, skills, and energy, as many are doing at our affiliate centers around the world. On behalf of our founder, Master Sheng Yen, and the sangha, thank you for everything you are doing through your own practice and generosity.
|
{
"pile_set_name": "Pile-CC"
}
| 15 |
[
{
"begin": 0,
"end": 25,
"score": 0
},
{
"begin": 25,
"end": 29,
"score": 1
},
{
"begin": 29,
"end": 30,
"score": 0
},
{
"begin": 30,
"end": 40,
"score": 1
},
{
"begin": 40,
"end": 41,
"score": 0
},
{
"begin": 41,
"end": 47,
"score": 1
},
{
"begin": 47,
"end": 407,
"score": 0
},
{
"begin": 407,
"end": 427,
"score": 1
},
{
"begin": 427,
"end": 442,
"score": 0
},
{
"begin": 442,
"end": 456,
"score": 1
},
{
"begin": 456,
"end": 515,
"score": 0
},
{
"begin": 515,
"end": 519,
"score": 1
},
{
"begin": 519,
"end": 520,
"score": 0
},
{
"begin": 520,
"end": 530,
"score": 1
},
{
"begin": 530,
"end": 531,
"score": 0
},
{
"begin": 531,
"end": 537,
"score": 1
}
] |
Q:
How to Run a Loop through multiple groups in R
I have a data set with multiple variables, where I want to sum the value of two columns by row. If the sum is below a set threshold, I want to replace the values of the second column (that is being summed) with the sum value. However, I want to do this by group.
My dataframe is setup with 18 different columns, these include "Closed_Grid", "Closed_Sets", "BestAvail", "Best_Sets" and "Best_Distance". "BestAvail", "Best_Sets" and "Best_Distance" are repeated for 2nd Best, 3rd, 4th and 5th. I am using this information to determine a final Destination Location (column 18 "Dest_Grid") which will be filled with a grid index from "BestAvail", "2nd_Best", etc. based on the conditional summing of the "Closed_Sets" and Destination Sets (Best, 2nd, etc..). In the end, if the sum of the two columns in <=150, that grid cell ("BestAvail") will be the "Dest_Grid". If the sum is >150 then it will move on to the next block and calculate the new sum between "Closed_Sets" and "2nd_Best" and so on until all "Closed_Sets" have a "Dest_Grid".
So just to help simplify this for the sake of what I am trying to accomplish, a sample (and subset) of my dataset looks like this:
Closed_Grid Closed_Sets BestAvail Best_Sets
GY38 72.875 GX38 91.75
GY37 87.125 GX38 91.75
GY36 39.875 GX38 91.75
GZ38 29 GX38 91.75
GZ37 80 GX38 91.75
GY35 2.375 GX38 91.75
GZ36 125.25 GX38 91.75
GZ35 29.875 GX38 91.75
GY39 17.5 GX39 54.125
HA35 34.375 GZ33 30.5
GZ41 109.625 GZ42 76.76
GY41 82.28571 GZ42 76.75
HA41 87.5 GZ42 76.75
GZ40 104.75 GZ42 76.75
GY40 60.625 GZ42 76.75
HA40 79.875 GZ42 76.75
GZ39 51.57143 GZ42 76.75
HA39 71 GZ42 76.75
I have first arranged my data by "BestAvail" and by "Distance" (smallest to largest) using:
Destination <- Destination %>% arrange(BestAvail, BestDistance)
This is an important order as the Closed_Grid with the smallest distance to BestAvail get first priority to move into that grid.
So now I want to Sum "Closed_Sets" and "Best_Sets" by row, within a group (i.e. where "BestAvail" is the same). Whenever the sum of a row is less than a threshold (150), the "Best_Sets" value is replaced with the prior sum. So, what I want the output to be is this:
Closed_Grid Closed_Sets BestAvail Best_Sets BestSum
GY38 72.875 GX38 91.75 164.6250
GY37 87.125 GX38 91.75 178.8750
GY36 39.875 GX38 91.75 131.625
GZ38 29 GX38 131.625 160.625
GZ37 80 GX38 131.625 211.625
GY35 2.375 GX38 131.625 134.00
GZ36 125.25 GX38 134.00 259.250
GZ35 29.875 GX38 134.00 163.8750
GY39 17.5 GX39 54.125 71.625
HA35 34.375 GZ33 30.5 64.875
GZ41 109.625 GZ42 76.75 186.375
GY41 82.28571 GZ42 76.75 159.03571
HA41 87.5 GZ42 76.75 164.25
GZ40 104.75 GZ42 76.75 181.5
GY40 60.625 GZ42 76.75 137.375
HA40 79.875 GZ42 137.375 217.25
GZ39 51.57143 GZ42 137.375 188.94643
HA39 71 GZ42 137.375 208.375
I can partially achieve this by using this loop:
for (i in 1:nrow(Destination)){
Destination$BestSum[i] <- sum(Destination$Closed_Sets[i], Destination$Best_Sets[i])
if (Destination$BestSum[i] <= 150){
Destination [i:length(Destination),"Best_Sets"] <- Destination$BestSum[i]
}
}
However, this code makes all of the "Best_Sets" a value of 134, and doesn't restart when the "BestAvail" value changes, which in turns messes up all of the following sums. Ultimately, I am trying to do a conditional cumulative sum of every "Closed_Set" in a group that remains under a value of 150.
This is part of a model I am working on that will have upwards of 150+ individual datasets run through it, all with varying lengths and values. This particular bit of code will also need to iterate through the 2nd, 3rd, etc. sets so it needs to be something that can be repeated and the variables easily changed.
I have tried using the unique() function in the loop, tried making my own function to use in dplyr (this would be ideal!), tried different cumulative sums with reset functions,and have searched through hundreds of threads at this point.
I am relatively new to R and programming and am having a hard time figuring out how to do this. I have looked through multiple discussions on every possible question relating to this but can't seem to get it to work on my data.
I hope what I am trying to achieve makes sense.
Thanks in advance!
A:
So I tried the couple of solutions offered, but unfortunately I couldn't get them to really work for me. However, I did come up with a solution (with the help of my supervisor), it is super ugly and long but it worked to give me my wanted outcome.
##Rearrange data from ascending order of Best Avail grids and Distance
Destination <- Destination %>% arrange(BestAvail, BestDistance)
####Set Levels and change to a factor in order to iterate through the different groups
Destination$Closed_Grid <- droplevels(Destination$Closed_Grid)
Destination$BestAvail <- as.factor(Destination$BestAvail)
###create a working file
WorkingDest = Destination[FALSE,]
##Loop that conditionally sums row by group, gives final dest grid, and pastes into working file
for (f in 1: nlevels (Destination$BestAvail)) {
work <- subset(Destination, BestAvail == levels(Destination$BestAvail)[f])
for (i in 1:nrow(work)){
for (j in 1:length(levels(work$BestAvail))){
if (as.character(work$BestAvail)[i] == as.character(levels(work$BestAvail)[j])){
work$BestSum[i] <- sum(work$Closed_Sets[i], work$Best_Sets[i])
if (work$BestSum[i] <= 150){
work [i:nrow(work),"Best_Sets"] <- work$BestSum[i]
work$Dest_Grid [i] <- as.character(work$BestAvail)[i]
}
}
}
}
WorkingDest <- rbind(WorkingDest, work)
}
###Create Results DataFrame for Closed Sets that have Moved
FinalDestination <- WorkingDest[WorkingDest$Dest_Grid != 0,]
##Create a working df that only have the new base sets for matching purposes
MaxSetsBest <- WorkingDest %>%
group_by(BestAvail) %>% top_n(1, Best_Sets)
MaxSetsBest <- MaxSetsBest[!duplicated(MaxSetsBest$BestAvail), ]
####change basesets for SecondBest based on previous iterations
for(id in 1:nrow(MaxSetsBest)){
WorkingDest$Second_Sets[WorkingDest$SecondBest %in% MaxSetsBest$BestAvail[id]] <- MaxSetsBest$Best_Sets[id]
}
rm(id)
##Reset Destination with new basesets
Destination <- WorkingDest
##Remove Closed Grids that have moved from working file
Destination <- WorkingDest[!WorkingDest$Dest_Grid != 0,]
I then reran the same code for the SecondBest options, and so on. I know it's not nice coding, but it works, and I have very small dataframes (max 50 rows) being run through this so speed isn't a huge factor. If anyone knows a way to make this nicer great, but if not it worked for me!
|
{
"pile_set_name": "StackExchange"
}
| 76 |
[
{
"begin": 0,
"end": 11,
"score": 0
},
{
"begin": 11,
"end": 14,
"score": 1
},
{
"begin": 14,
"end": 17,
"score": 0
},
{
"begin": 17,
"end": 21,
"score": 1
},
{
"begin": 21,
"end": 379,
"score": 0
},
{
"begin": 379,
"end": 390,
"score": 1
},
{
"begin": 390,
"end": 394,
"score": 0
},
{
"begin": 394,
"end": 405,
"score": 1
},
{
"begin": 405,
"end": 422,
"score": 0
},
{
"begin": 422,
"end": 431,
"score": 1
},
{
"begin": 431,
"end": 438,
"score": 0
},
{
"begin": 438,
"end": 451,
"score": 1
},
{
"begin": 451,
"end": 469,
"score": 0
},
{
"begin": 469,
"end": 478,
"score": 1
},
{
"begin": 478,
"end": 485,
"score": 0
},
{
"begin": 485,
"end": 498,
"score": 1
},
{
"begin": 498,
"end": 594,
"score": 0
},
{
"begin": 594,
"end": 605,
"score": 1
},
{
"begin": 605,
"end": 606,
"score": 0
},
{
"begin": 606,
"end": 614,
"score": 1
},
{
"begin": 614,
"end": 627,
"score": 0
},
{
"begin": 627,
"end": 636,
"score": 1
},
{
"begin": 636,
"end": 754,
"score": 0
},
{
"begin": 754,
"end": 765,
"score": 1
},
{
"begin": 765,
"end": 771,
"score": 0
},
{
"begin": 771,
"end": 782,
"score": 1
},
{
"begin": 782,
"end": 902,
"score": 0
},
{
"begin": 902,
"end": 911,
"score": 1
},
{
"begin": 911,
"end": 1007,
"score": 0
},
{
"begin": 1007,
"end": 1018,
"score": 1
},
{
"begin": 1018,
"end": 1056,
"score": 0
},
{
"begin": 1056,
"end": 1067,
"score": 1
},
{
"begin": 1067,
"end": 1077,
"score": 0
},
{
"begin": 1077,
"end": 1086,
"score": 1
},
{
"begin": 1086,
"end": 1220,
"score": 0
},
{
"begin": 1220,
"end": 1231,
"score": 1
},
{
"begin": 1231,
"end": 1232,
"score": 0
},
{
"begin": 1232,
"end": 1243,
"score": 1
},
{
"begin": 1243,
"end": 1254,
"score": 0
},
{
"begin": 1254,
"end": 1263,
"score": 1
},
{
"begin": 1263,
"end": 2056,
"score": 0
},
{
"begin": 2056,
"end": 2064,
"score": 1
},
{
"begin": 2064,
"end": 2095,
"score": 0
},
{
"begin": 2095,
"end": 2106,
"score": 1
},
{
"begin": 2106,
"end": 2110,
"score": 0
},
{
"begin": 2110,
"end": 2121,
"score": 1
},
{
"begin": 2121,
"end": 2194,
"score": 0
},
{
"begin": 2194,
"end": 2205,
"score": 1
},
{
"begin": 2205,
"end": 2306,
"score": 0
},
{
"begin": 2306,
"end": 2309,
"score": 1
},
{
"begin": 2309,
"end": 2311,
"score": 0
},
{
"begin": 2311,
"end": 2322,
"score": 1
},
{
"begin": 2322,
"end": 2329,
"score": 0
},
{
"begin": 2329,
"end": 2338,
"score": 1
},
{
"begin": 2338,
"end": 2464,
"score": 0
},
{
"begin": 2464,
"end": 2473,
"score": 1
},
{
"begin": 2473,
"end": 2555,
"score": 0
},
{
"begin": 2555,
"end": 2566,
"score": 1
},
{
"begin": 2566,
"end": 2567,
"score": 0
},
{
"begin": 2567,
"end": 2578,
"score": 1
},
{
"begin": 2578,
"end": 2589,
"score": 0
},
{
"begin": 2589,
"end": 2598,
"score": 1
},
{
"begin": 2598,
"end": 2748,
"score": 0
},
{
"begin": 2748,
"end": 2764,
"score": 1
},
{
"begin": 2764,
"end": 2906,
"score": 0
},
{
"begin": 2906,
"end": 2921,
"score": 1
},
{
"begin": 2921,
"end": 3062,
"score": 0
},
{
"begin": 3062,
"end": 3077,
"score": 1
},
{
"begin": 3077,
"end": 3612,
"score": 0
},
{
"begin": 3612,
"end": 3623,
"score": 1
},
{
"begin": 3623,
"end": 3631,
"score": 0
},
{
"begin": 3631,
"end": 3642,
"score": 1
},
{
"begin": 3642,
"end": 3661,
"score": 0
},
{
"begin": 3661,
"end": 3672,
"score": 1
},
{
"begin": 3672,
"end": 3673,
"score": 0
},
{
"begin": 3673,
"end": 3684,
"score": 1
},
{
"begin": 3684,
"end": 3689,
"score": 0
}
] |
A generalization of multiple groups of Protestant Christianity . It's not actually a denomination, but a category that churches of many denominations fall under, ranging from some baptist churches in the south to non-denominational churches in the north and along the coastline . Using that criteria, the majority of protestant Christians in the US probably fall under the " Evangelical " category. Despite popular belief, they are real, tangible people, who are just as capable of being discriminated against as the people who they are frequently (and usually, falsely) accused of being discriminated against. An Evangelical Christian is best characterized as someone who wants to spread the Gospel of Christ by being living examples to the people around them. Real Evangelicals do not believe in forcing people who are not Christians to act like Christians, because they believe that Christ his followers to only come of their own free will.Evangelical Christians should NOT be confused with "fundamentalists," a term that has come to mean someone who is far more mental than fun. Evangelicals tend to believe in more literal interpretations of the bible, but that does not mean that they are against scientific study or using critical thinking (after all, how can you understand how the Bible applies to your life without critical thinking?). Also, they do not want religion to control the government, because as Martin Luther figured out during the dark ages, religion controlling government is actually a cheap disguise for the government controlling religion. True Evangelicals want freedom of religion, and that includes the freedom to share the gospel with others.Evangelical Christians are a large, and unfortunately, misunderstood part of the global population. They are constantly stereotyped as being hateful, bigoted people, even though many of them have done many great works for bringing rights to people and sending help to places. Evangelicals want to change their communities for the better by changing the people, one person at a time. Maybe if people came to realize that the large majority of Evangelical Christians are actually legitimately nice people who enjoy life and are happy to share their happiness with others, they'd realize that the mainstream perception of " evangelical " is merely an aggressively propagated stereotype that aims to strip Christians of their legitimacy as human beings.
|
{
"pile_set_name": "OpenWebText2"
}
| 20 |
[
{
"begin": 0,
"end": 39,
"score": 0
},
{
"begin": 39,
"end": 49,
"score": 1
},
{
"begin": 49,
"end": 50,
"score": 0
},
{
"begin": 50,
"end": 62,
"score": 1
},
{
"begin": 62,
"end": 328,
"score": 0
},
{
"begin": 328,
"end": 338,
"score": 1
},
{
"begin": 338,
"end": 626,
"score": 0
},
{
"begin": 626,
"end": 635,
"score": 1
},
{
"begin": 635,
"end": 693,
"score": 0
},
{
"begin": 693,
"end": 699,
"score": 1
},
{
"begin": 699,
"end": 703,
"score": 0
},
{
"begin": 703,
"end": 709,
"score": 1
},
{
"begin": 709,
"end": 767,
"score": 0
},
{
"begin": 767,
"end": 779,
"score": 1
},
{
"begin": 779,
"end": 825,
"score": 0
},
{
"begin": 825,
"end": 835,
"score": 1
},
{
"begin": 835,
"end": 848,
"score": 0
},
{
"begin": 848,
"end": 858,
"score": 1
},
{
"begin": 858,
"end": 886,
"score": 0
},
{
"begin": 886,
"end": 892,
"score": 1
},
{
"begin": 892,
"end": 955,
"score": 0
}
] |
West Shore RCMP and the BC Coroner's Service are investigating the discovery of human remains in a wooded area of Langford Friday.
Police were called to the forested area along the 2500-block of West Shore Parkway at around 10:30 a.m. after a member of the public reported finding the deceased person.
Mounties cordoned off the area as they investigated along with Island District RCMP forensic officers and the Vancouver Island Integrated Major Crime Unit.
Authorities could later be seen transporting a body from the wooded area.
Investigators say no foul play is suspected and there is no risk to the public. They're not releasing the identity of the deceased person pending next-of-kin notification.
Earlier in the day, investigators seemed to be focused on a series of white spray-painted arrows leading up to the wooded area. At least four of the arrows had evidence markers placed beside them.
The investigation is ongoing.
|
{
"pile_set_name": "OpenWebText2"
}
| 16 |
[
{
"begin": 0,
"end": 4,
"score": 1
},
{
"begin": 4,
"end": 5,
"score": 0
},
{
"begin": 5,
"end": 10,
"score": 1
},
{
"begin": 10,
"end": 37,
"score": 0
},
{
"begin": 37,
"end": 44,
"score": 1
},
{
"begin": 44,
"end": 114,
"score": 0
},
{
"begin": 114,
"end": 122,
"score": 1
},
{
"begin": 122,
"end": 123,
"score": 0
},
{
"begin": 123,
"end": 129,
"score": 1
},
{
"begin": 129,
"end": 132,
"score": 0
},
{
"begin": 132,
"end": 138,
"score": 1
},
{
"begin": 138,
"end": 196,
"score": 0
},
{
"begin": 196,
"end": 200,
"score": 1
},
{
"begin": 200,
"end": 201,
"score": 0
},
{
"begin": 201,
"end": 206,
"score": 1
},
{
"begin": 206,
"end": 207,
"score": 0
},
{
"begin": 207,
"end": 214,
"score": 1
}
] |
Q:
Array with select option in Angular and Typescript
I display 51 questions with their related answers on a page.
Both information come from one web-service call.
<tbody>
<tr *ngFor="let QuestionOption of questions; trackBy: trackQuestionById; let i = index;">
<th scope="row">{{QuestionOption.id}}</th>
<td>{{QuestionOption.name}} {{QuestionOption.description}}
</p>
<select class="form-control" name="selectAnswer" [(ngModel)]="answer[i]">
<option *ngFor="let answers of QuestionOption.Answers" [ngValue]="answers.id">{{answers.description}}</option>
</p>
</td>
</tr>
</tbody>
on the typescript code I try the following:
answer: Answer[];
this.answer = new Array<Answer>();
The type Answer has multiple fields like: Id, Name, Score, Description
What is not working is that I always have get the Id into the answer[i]
but I want to have the id in the field answer[i].id
If i change the
[(ngModel)]="answer[i]"
into
[(ngModel)]="answer[i].id"
I get the following exception:
ERROR TypeError: "_co.caaAnswer[_v.context.index] is undefined"
I also tried:
[(ngModel)]="answer[i]?.id"
So is it correct to use answer[i] ? and then in the option I should somehow assign to answer[i].id the selected value. If so somebody can help how to do it.
Any help is appreciated! Thanks a lot.
augeres
A:
I found the solution. The problem was that the compareWith function did not work properly because of the Array. It only works in case you name the html select based upon the array index:
Working version:
<select class="form-control" id="field_answer{{i}}" name="field_answer{{i}}" [(ngModel)]="resultAnswer[i].answer" [compareWith]="compareFn">
<option [ngValue]="answer" *ngFor="let answer of Question.answers; trackBy: trackAnswerById">{{answer.id}} {{answer.description}}</option>
</select>
|
{
"pile_set_name": "StackExchange"
}
| 7 |
[
{
"begin": 0,
"end": 4,
"score": 0
},
{
"begin": 4,
"end": 9,
"score": 1
},
{
"begin": 9,
"end": 32,
"score": 0
},
{
"begin": 32,
"end": 39,
"score": 1
},
{
"begin": 39,
"end": 44,
"score": 0
},
{
"begin": 44,
"end": 54,
"score": 1
},
{
"begin": 54,
"end": 697,
"score": 0
},
{
"begin": 697,
"end": 702,
"score": 1
}
] |
Friday, 17 March 2017
The world’s smallest dragon is an amazing creature,it is so tiny that it sit on only two fingers of a human hand.It’s called the world’s smallest dragon because it’s so tiny. it has transparent wings and it has a hairy tail and spikey talons as sharp as knives.
Caring for this creature is a challenging task and should not be taken on without serious thought.i would take care of my dragon for ever until it gets it gets bigger. I feed my dragon and give it water and play with it.
Dragons are playful creature and they love to play games with children.i play with my dragon hide and seek and tag and i take it to the playground.
|
{
"pile_set_name": "Pile-CC"
}
| 3 |
[
{
"begin": 0,
"end": 6,
"score": 1
},
{
"begin": 6,
"end": 11,
"score": 0
},
{
"begin": 11,
"end": 16,
"score": 1
},
{
"begin": 16,
"end": 508,
"score": 0
}
] |
480 S.W.2d 893 (1972)
In re ESTATE of Ralph A. PERRY, Deceased.
Morran D. HARRIS, Administrator-Respondent,
v.
Mildred PERRY, Appellant.
No. 55810.
Supreme Court of Missouri, Division No. 2.
February 22, 1972.
Motion for Rehearing or to Transfer Denied June 12, 1972.
*894 T. Bryant Johnson, Osceola, for respondent.
Robert G. Barstow, Houston, Poague, Brock & Wall, Julius F. Wall, Clinton, for appellant.
Motion for Rehearing or to Transfer to Court En Banc Denied June 12, 1972.
PRITCHARD, Special Judge.
The dispositive issue is whether appellant, widow of Ralph A. Perry, deceased, both of whom were residents of the state of Texas, may take certain personal property located in St. Clair County, Missouri, by reason of Texas community property laws.
Appellant's spouse, Ralph A. Perry, whom she married in 1955, died on January 7, 1968. The two owned as tenants by the entirety Rim Point Ranch in St. Clair County, Missouri. On this ranch was located all the personal property here in dispute. Mr. Perry and appellant both resided at Conroe, Texas, at the time of his death. Shortly after deceased's death, appellant obtained a power of attorney from his children by a prior marriage to represent their interests in his estate, but this was revoked when she did not seek appointment as administratrix. On the request of the children, respondent was appointed administrator of deceased's estate in the Probate Court of St. Clair County, Missouri, on June 3, 1968. An inventory was then filed by the administrator on June 22, 1968, listing cattle, saddles, machinery, and other items said to belong to deceased's estate. On October 9, 1968, appellant filed her inventory of the same property "reflecting the partnership assets in Missouri on January 7, 1968, the date of Ralph A. Perry's death, such assets being community property of the marriage." On October 8, 1968, respondent and appellant, by her attorney, agreed that she purchase all livestock, cattle and horses, saddles and trucks for $12,945.00, which was to be placed on interest, and if determined to be her separate or exempt property, the amount with interest was to be paid to her less court costs. Appellant agreed that the farm machinery, valued at $2,935.00, might be stored on her ranch without cost to the estate.
Without any doubt, Texas community property laws of the nonresident appellant and her deceased spouse, Ralph A. *895 Perry, control her property rights in the personal property having a situs in this state at the time of his death. See 41 C.J.S. Husband and Wife § 466, p. 991 et seq., for the general rule. The rule has been applied in principle in this state in the early case of Depas v. Mayo, 11 Mo. 314. There the parties, after their marriage, resided in Louisiana where they accumulated considerable estate by their joint exertions, and where one-half of all the property acquired during the coverture belonged to the wife, could not be disposed of to defeat the wife's interests, and was not subject to the husband's debts. Later the husband and wife moved to St. Louis taking with them a considerable amount of the jointly acquired property, with which the husband purchased a real estate lot in St. Louis taking title in his own name. The wife sued for and obtained a divorce after the couple returned to New Orleans, and thereafter sought and was successful in having adjudicated her right to one-half the community property under Louisiana law and by reason of equitable title resulting in trust the title to one-half the Missouri real estate (the rights in the real property were adjudicated in accordance with the law of its situs). See also 15A C.J.S. Conflict of Laws § 18(2), p. 493; and the case of Snyder v. Stringer, 116 Wash. 131, 198 P. 733, where an automobile bought by a husband, who with his wife were residents of Washington, was held to be governed by Washington community property laws and was not subject to seizure and sale to satisfy the husband's debts in another jurisdiction.
Under Vernon's Tex.Ann.Civ.St., Art. 4619 (Act 1967, 60th Leg., p. 738, ch. 309, § 1), in effect at the time of Mr. Perry's death, it was provided, "All property possessed by either spouse during or on dissolution of marriage is presumed to be community property." Under Texas law, the burden of proof to rebut the statutory presumption was here upon respondent. Kirtley v. Kirtley (Tex.Civ.App.), 417 S.W.2d 847; Podolnick v. Hamilton (Tex.Civ.App.), 359 S.W.2d 108. Here, respondent testified that as administrator he made and filed an inventory in Mr. Perry's estate, the basis for which was that "The property was located on his farm for one thing." He knew the farm was owned by Mr. and Mrs. Perry as tenants by the entirety. It was respondent's understanding that the machinery was sold to Mr. Perry by one of the appraisers. The title to a 1963 GMC pickup was in the name of Ralph A. Perry. He could not recall any information about the cattle other than the fact that they were on his property. Respondent did not know when any other property was acquired, and did not know whether it was considered by Mr. and Mrs. Perry as their separate property. Mrs. Perry did tell him that some things belonged to her, and they did not inventory these things. At the time the inventory was being made, appellant made no claim that any property listed was not that of Mr. Perry's. She was aware that the inventory was being made, and later filed a request for an allowance from the probate court. Respondent could not tell what property he found on the ranch was owned by deceased prior to his marriage, or whether any of it was acquired after the marriage by gift, devise or descent. Claims have been made since the inventory was filed to the effect that the property was not the separate estate of Mr. Perry.
V.A.T.S. Probate Code, § 45, provides that upon dissolution of the marriage relation by death, all property belonging to the community estate shall go to the survivor, if there are no children of the deceased, but if there are children of deceased one-half the property shall go to the survivor, and the other half shall go to such children. V.A.T.S. Probate Code, § 160, provides that when no one has qualified as executor or administrator of a deceased spouse's estate, the surviving spouse, without qualifying as community administrator, has power to sue and be sued for the recovery *896 of community property; to sell, mortgage, lease and otherwise dispose of community property for the purpose of paying community debts, to collect claims due to the community estate; "and has such other powers as shall be necessary to preserve the community property, discharge, community obligations, and wind up community affairs."
The evidence above is insufficient to prove that Mr. Perry had separate ownership in the estate inventoried, and is insufficient to rebut the presumption existing under Texas law that all of the property was and is community property. It follows that respondent was without authority as administrator to take charge of any of the property and to proceed with administration with respect to it. Under the evidence, the property should have been ordered turned over to appellant to hold in accordance with V.A.T.S. Probate Code, § 160, or in accordance with other Texas law with respect thereto.
The judgment is reversed and the case remanded with directions that respondent pay over to appellant all funds in his hands, and deliver to her all machinery inventoried, free and clear of any court costs or allowances for administrator fees, attorney fees, or claims against the estate.
PER CURIAM:
The foregoing opinion by PRITCHARD, Special Judge, is adopted as the opinion of the Court.
MORGAN, P. J., and DONNELLY, J., concur.
HENLEY, J., concurs in result.
|
{
"pile_set_name": "FreeLaw"
}
| 126 |
[
{
"begin": 0,
"end": 39,
"score": 0
},
{
"begin": 39,
"end": 44,
"score": 1
},
{
"begin": 44,
"end": 55,
"score": 0
},
{
"begin": 55,
"end": 63,
"score": 1
},
{
"begin": 63,
"end": 65,
"score": 0
},
{
"begin": 65,
"end": 71,
"score": 1
},
{
"begin": 71,
"end": 83,
"score": 0
},
{
"begin": 83,
"end": 107,
"score": 1
},
{
"begin": 107,
"end": 112,
"score": 0
},
{
"begin": 112,
"end": 119,
"score": 1
},
{
"begin": 119,
"end": 127,
"score": 0
},
{
"begin": 127,
"end": 136,
"score": 1
},
{
"begin": 136,
"end": 149,
"score": 0
},
{
"begin": 149,
"end": 156,
"score": 1
},
{
"begin": 156,
"end": 157,
"score": 0
},
{
"begin": 157,
"end": 162,
"score": 1
},
{
"begin": 162,
"end": 166,
"score": 0
},
{
"begin": 166,
"end": 174,
"score": 1
},
{
"begin": 174,
"end": 176,
"score": 0
},
{
"begin": 176,
"end": 184,
"score": 1
},
{
"begin": 184,
"end": 192,
"score": 0
},
{
"begin": 192,
"end": 200,
"score": 1
},
{
"begin": 200,
"end": 211,
"score": 0
},
{
"begin": 211,
"end": 217,
"score": 1
},
{
"begin": 217,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 231,
"score": 1
},
{
"begin": 231,
"end": 254,
"score": 0
},
{
"begin": 254,
"end": 258,
"score": 1
},
{
"begin": 258,
"end": 277,
"score": 0
},
{
"begin": 277,
"end": 283,
"score": 1
},
{
"begin": 283,
"end": 284,
"score": 0
},
{
"begin": 284,
"end": 291,
"score": 1
},
{
"begin": 291,
"end": 293,
"score": 0
},
{
"begin": 293,
"end": 300,
"score": 1
},
{
"begin": 300,
"end": 318,
"score": 0
},
{
"begin": 318,
"end": 324,
"score": 1
},
{
"begin": 324,
"end": 328,
"score": 0
},
{
"begin": 328,
"end": 335,
"score": 1
},
{
"begin": 335,
"end": 337,
"score": 0
},
{
"begin": 337,
"end": 344,
"score": 1
},
{
"begin": 344,
"end": 346,
"score": 0
},
{
"begin": 346,
"end": 352,
"score": 1
},
{
"begin": 352,
"end": 354,
"score": 0
},
{
"begin": 354,
"end": 359,
"score": 1
},
{
"begin": 359,
"end": 362,
"score": 0
},
{
"begin": 362,
"end": 366,
"score": 1
},
{
"begin": 366,
"end": 368,
"score": 0
},
{
"begin": 368,
"end": 374,
"score": 1
},
{
"begin": 374,
"end": 378,
"score": 0
},
{
"begin": 378,
"end": 382,
"score": 1
},
{
"begin": 382,
"end": 384,
"score": 0
},
{
"begin": 384,
"end": 391,
"score": 1
},
{
"begin": 391,
"end": 408,
"score": 0
},
{
"begin": 408,
"end": 414,
"score": 1
},
{
"begin": 414,
"end": 419,
"score": 0
},
{
"begin": 419,
"end": 428,
"score": 1
},
{
"begin": 428,
"end": 447,
"score": 0
},
{
"begin": 447,
"end": 452,
"score": 1
},
{
"begin": 452,
"end": 453,
"score": 0
},
{
"begin": 453,
"end": 455,
"score": 1
},
{
"begin": 455,
"end": 456,
"score": 0
},
{
"begin": 456,
"end": 460,
"score": 1
},
{
"begin": 460,
"end": 468,
"score": 0
},
{
"begin": 468,
"end": 472,
"score": 1
},
{
"begin": 472,
"end": 502,
"score": 0
},
{
"begin": 502,
"end": 507,
"score": 1
},
{
"begin": 507,
"end": 562,
"score": 0
},
{
"begin": 562,
"end": 567,
"score": 1
},
{
"begin": 567,
"end": 571,
"score": 0
},
{
"begin": 571,
"end": 576,
"score": 1
},
{
"begin": 576,
"end": 632,
"score": 0
},
{
"begin": 632,
"end": 637,
"score": 1
},
{
"begin": 637,
"end": 689,
"score": 0
},
{
"begin": 689,
"end": 694,
"score": 1
},
{
"begin": 694,
"end": 695,
"score": 0
},
{
"begin": 695,
"end": 701,
"score": 1
},
{
"begin": 701,
"end": 703,
"score": 0
},
{
"begin": 703,
"end": 711,
"score": 1
},
{
"begin": 711,
"end": 726,
"score": 0
},
{
"begin": 726,
"end": 731,
"score": 1
},
{
"begin": 731,
"end": 757,
"score": 0
},
{
"begin": 757,
"end": 766,
"score": 1
},
{
"begin": 766,
"end": 777,
"score": 0
},
{
"begin": 777,
"end": 782,
"score": 1
},
{
"begin": 782,
"end": 786,
"score": 0
},
{
"begin": 786,
"end": 791,
"score": 1
},
{
"begin": 791,
"end": 827,
"score": 0
},
{
"begin": 827,
"end": 834,
"score": 1
},
{
"begin": 834,
"end": 885,
"score": 0
},
{
"begin": 885,
"end": 888,
"score": 1
},
{
"begin": 888,
"end": 889,
"score": 0
},
{
"begin": 889,
"end": 894,
"score": 1
},
{
"begin": 894,
"end": 895,
"score": 0
},
{
"begin": 895,
"end": 900,
"score": 1
},
{
"begin": 900,
"end": 908,
"score": 0
},
{
"begin": 908,
"end": 913,
"score": 1
},
{
"begin": 913,
"end": 914,
"score": 0
},
{
"begin": 914,
"end": 920,
"score": 1
},
{
"begin": 920,
"end": 922,
"score": 0
},
{
"begin": 922,
"end": 930,
"score": 1
},
{
"begin": 930,
"end": 1005,
"score": 0
},
{
"begin": 1005,
"end": 1010,
"score": 1
},
{
"begin": 1010,
"end": 1041,
"score": 0
},
{
"begin": 1041,
"end": 1047,
"score": 1
},
{
"begin": 1047,
"end": 1049,
"score": 0
},
{
"begin": 1049,
"end": 1054,
"score": 1
},
{
"begin": 1054,
"end": 1408,
"score": 0
},
{
"begin": 1408,
"end": 1415,
"score": 1
},
{
"begin": 1415,
"end": 1416,
"score": 0
},
{
"begin": 1416,
"end": 1421,
"score": 1
},
{
"begin": 1421,
"end": 1429,
"score": 0
},
{
"begin": 1429,
"end": 1434,
"score": 1
},
{
"begin": 1434,
"end": 1435,
"score": 0
},
{
"begin": 1435,
"end": 1441,
"score": 1
},
{
"begin": 1441,
"end": 1443,
"score": 0
},
{
"begin": 1443,
"end": 1451,
"score": 1
},
{
"begin": 1451,
"end": 1456,
"score": 0
},
{
"begin": 1456,
"end": 1460,
"score": 1
},
{
"begin": 1460,
"end": 1522,
"score": 0
},
{
"begin": 1522,
"end": 1526,
"score": 1
},
{
"begin": 1526,
"end": 1629,
"score": 0
},
{
"begin": 1629,
"end": 1636,
"score": 1
},
{
"begin": 1636,
"end": 1735,
"score": 0
},
{
"begin": 1735,
"end": 1743,
"score": 1
},
{
"begin": 1743,
"end": 1747,
"score": 0
},
{
"begin": 1747,
"end": 1754,
"score": 1
},
{
"begin": 1754,
"end": 1776,
"score": 0
}
] |
Neurolepticlike actions of l-methadone: effect on mescaline-induced altered behavior and on tissue levels of mescaline in mice.
Mice were injected ip with either saline, l-methadone (2.5, 5, 20 mg/kg), perphenazine (1, 10, 15 mg/kg), or chlorprothixene (1.25, 2.5, 15 mg/kg) 30 min prior to mescaline-14C (25 mg/kg). Mescaline-induced behavioral changes such as agitation, excitement, slight increase in ventilation, and fright to sound stimuli were prevented by all doses of three drugs, and head-shaking, scratching, and locomotor-increasing effects by 5 and 20 mg/kg methadone and by all doses of both neuroleptics. Catalepticlike state and moderate to marked hypothermia induced by all doses of chlorprothixene, 10 and 15 mg/kg perphenazine, and 20 mg/kg methadone were not reversed by mescaline. Chlorprothixene (all doses), perphenazine (10, 15 mg/kg), and methadone (5, 20 mg/kg) caused marked retention of mescaline and its deaminated metabolite, 3, 4, 5-trimethoxyphenyl acetic acid in both brain and plasma. The fact that relatively higher doses of methadone than neuroleptics are needed to ensure effective antagonism to mescaline action tends to indicate a less specific interaction of the opiate with the neuroleptic/dopamine receptor proposed for central mescaline effects.
|
{
"pile_set_name": "PubMed Abstracts"
}
| 3 |
[
{
"begin": 0,
"end": 15,
"score": 1
},
{
"begin": 15,
"end": 619,
"score": 0
},
{
"begin": 619,
"end": 633,
"score": 1
},
{
"begin": 633,
"end": 801,
"score": 0
}
] |
Jamie Anderson is an Olympic gold medalist in snowboarding's slopestyle event, a Sierra-at-Tahoe team rider and a South Lake Tahoe native. We talk to the golden girl about life since reaching the top of the podium in Sochi....
|
{
"pile_set_name": "Pile-CC"
}
| 8 |
[
{
"begin": 0,
"end": 5,
"score": 1
},
{
"begin": 5,
"end": 6,
"score": 0
},
{
"begin": 6,
"end": 14,
"score": 1
},
{
"begin": 14,
"end": 21,
"score": 0
},
{
"begin": 21,
"end": 28,
"score": 1
},
{
"begin": 28,
"end": 91,
"score": 0
},
{
"begin": 91,
"end": 96,
"score": 1
},
{
"begin": 96,
"end": 114,
"score": 0
},
{
"begin": 114,
"end": 119,
"score": 1
}
] |
Peroral endoscopic myotomy (POEM) is currently considered the least invasive, innovative endoscopic intervention for permanent treatment of all types of esophageal achalasia \[[@ref1]\]. POEM, however, is a technically demanding procedure, necessitating high-quality endoscopic abilities to manage the individualized technical difficulties. Herein we report a successful POEM in a 75-year-old male with sigmoid-type achalasia performed by Greek gastroenterologists.
The patient had a 45-year history of achalasia, diagnosed by manometry, endoscopy and esophagogram, treated by repeated balloon dilatations up to 40 mmHg. He also had a history of coronary bypass surgery and was under anticoagulants and antianginal drugs. He was referred for POEM due to severe deterioration of dysphagia despite treatment, including nitrates for his angina. Eckard score was 10 (stage III). Control esophagoscopy revealed esophageal dilatation and fluid stasis, resistance at gastroesophageal junction (GEJ) and sigmoid type I achalasia, according to Inoue *et al* \[[@ref1]\].
Esophagogram showed esophageal dilatation \>3 cm and high lower esophageal sphincter (LES) pressure. After detailed information the patient agreed and signed to undergo POEM, performed at AHEPA Hospital, Aristotle University of Thessaloniki, according to Inoue's \[[@ref1]\] technique ([Fig. 1](#F1){ref-type="fig"}). CO~2~ insufflation was administered during procedure, while Triangle-T knife was exclusively used for submucosal tunnel creation and myotomy. Selective circular myotomy 15 cm in length, 13 cm at the esophageal and 2 cm at the gastric side, was finally completed, without serious complications.
{#F1}
Special problems, which prolonged POEM duration (3 h), were: a) the extremely thick circular muscle, which made myotomy difficult and time consuming; b) difficulty in orientation within the submucosal space and identification of GEJ due to sigmoid esophagus. Continuous control within the esophageal lumen and retroversion in the stomach and identification of ectopic longitudinal muscle fiber \[[@ref2]\] in front of circular muscle when approaching GEJ were helpful to extend myotomy to the gastric side; c) severe mucosal bleeding was controlled using coagulation forceps, paying attention to coagulate the vessel and avoid mucosal perforation; d) mucosal entry closure was completed with difficulty after many attempts (25 clips) and longer fasting (to 3 days).
Esophagogram and control endoscopy the day after POEM showed intact esophageal mucosa, no leakage and open GEJ with no resistance (Fig. [1B](#F1){ref-type="fig"}-[D](#F1){ref-type="fig"}). He was discharged on day 3 post-operatively. During the two-month follow up he reported almost complete relief of dysphagia.
According to this difficult and technically demanding case, we consider POEM feasible, safe and effective treatment, even for sigmoid-type esophageal achalasia, by Greek Gastroenterologists. Although it has been already proved that POEM is possible in sigmoid type achalasia, international experience in these advanced cases is still limited, and this is the first successful Greek case. Further experience and long-term results are necessary and awaited.
Prof. Dr. Haruhiro Inoue (Digestive Disease Center, Showa University Northern Yokohama Hospital, Japan) for POEM training and case consultation
Conflict of Interest: None
AHEPA University Hospital, Aristotle University of Thessaloniki; Gastroenterology Unit of Athens, Greece
|
{
"pile_set_name": "PubMed Central"
}
| 46 |
[
{
"begin": 0,
"end": 7,
"score": 1
},
{
"begin": 7,
"end": 177,
"score": 0
},
{
"begin": 177,
"end": 182,
"score": 1
},
{
"begin": 182,
"end": 439,
"score": 0
},
{
"begin": 439,
"end": 444,
"score": 1
},
{
"begin": 444,
"end": 843,
"score": 0
},
{
"begin": 843,
"end": 849,
"score": 1
},
{
"begin": 849,
"end": 870,
"score": 0
},
{
"begin": 870,
"end": 873,
"score": 1
},
{
"begin": 873,
"end": 876,
"score": 0
},
{
"begin": 876,
"end": 883,
"score": 1
},
{
"begin": 883,
"end": 1036,
"score": 0
},
{
"begin": 1036,
"end": 1041,
"score": 1
},
{
"begin": 1041,
"end": 1053,
"score": 0
},
{
"begin": 1053,
"end": 1058,
"score": 1
},
{
"begin": 1058,
"end": 1064,
"score": 0
},
{
"begin": 1064,
"end": 1076,
"score": 1
},
{
"begin": 1076,
"end": 1258,
"score": 0
},
{
"begin": 1258,
"end": 1266,
"score": 1
},
{
"begin": 1266,
"end": 1268,
"score": 0
},
{
"begin": 1268,
"end": 1277,
"score": 1
},
{
"begin": 1277,
"end": 1278,
"score": 0
},
{
"begin": 1278,
"end": 1288,
"score": 1
},
{
"begin": 1288,
"end": 1292,
"score": 0
},
{
"begin": 1292,
"end": 1304,
"score": 1
},
{
"begin": 1304,
"end": 1319,
"score": 0
},
{
"begin": 1319,
"end": 1324,
"score": 1
},
{
"begin": 1324,
"end": 1330,
"score": 0
},
{
"begin": 1330,
"end": 1335,
"score": 1
},
{
"begin": 1335,
"end": 1442,
"score": 0
},
{
"begin": 1442,
"end": 1452,
"score": 1
},
{
"begin": 1452,
"end": 1679,
"score": 0
},
{
"begin": 1679,
"end": 1689,
"score": 1
},
{
"begin": 1689,
"end": 1735,
"score": 0
},
{
"begin": 1735,
"end": 1740,
"score": 1
},
{
"begin": 1740,
"end": 1774,
"score": 0
},
{
"begin": 1774,
"end": 1775,
"score": 1
},
{
"begin": 1775,
"end": 1777,
"score": 0
},
{
"begin": 1777,
"end": 1784,
"score": 1
},
{
"begin": 1784,
"end": 1820,
"score": 0
},
{
"begin": 1820,
"end": 1824,
"score": 1
},
{
"begin": 1824,
"end": 2340,
"score": 0
},
{
"begin": 2340,
"end": 2345,
"score": 1
},
{
"begin": 2345,
"end": 2710,
"score": 0
},
{
"begin": 2710,
"end": 2722,
"score": 1
},
{
"begin": 2722,
"end": 3189,
"score": 0
},
{
"begin": 3189,
"end": 3194,
"score": 1
}
] |
The hell that is a restaurant website - telemachos
http://venomousporridge.com/post/389785000/a-conversation-i-have-every-month-or-so#disqus_thread
Better link: http://venomousporridge.com/post/389785000/a-conversation-i-have-every-month-or-so
======
rubyrescue
Amen. This is why we're building BuenaCarta.com - example page:
[http://www.buenacarta.com/restaurantes/buenos-
aires/palermo-...](http://www.buenacarta.com/restaurantes/buenos-
aires/palermo-soho/la-paila) (very early alpha)... We're starting with South
America but we're planning on releasing a white label version of the product
for other markets (and not just restaurants). Our focus is right now on
getting reviews 'right', before we start building content, because we still
believe there's not a truly good restaurant/bar/store review site whose
reviews aren't ranked using hidden magic, astroturfed, or just really, really
bland.
We've spent a lot of time on the "Open Hours" feature - we want people to view
a page and see "Open NOW", "Open Later Today", "Closed Today", etc. so that
they're sure it's really open, or it will be when they take a cab across town,
or so its really clear they're closed mondays and you don't go all the way
there only to find that out.
However, we also want to be able to search the data ourselves, and we want it
to be localized into two or three languages. So we can't just store the open
hours as a string, we need to render the open hours as text but it needs to be
stored as data. Generating the English/Spanish/Portuguese from the data is a
lot of fun.
~~~
nazgulnarsil
god i wish there was a US site that aggregated hours info.
~~~
prawn
I've always wondered about an iPhone or web-app for a given location that just
showed what was open right then and how soon they closed. Quite often I'm in
an area at 10pm with friends wondering what our dining options are. Would
obviously need the cooperation of the restaurants themselves though.
~~~
pretz
Yelp for iPhone (and Pre, and Android) will do that. You can filter your
search results by "Open Now". Of course, we don't have perfect data, but we're
trying. (I'm a Yelp developer)
~~~
prawn
I'm in Australia so I don't think you have my area covered?
------
waterlesscloud
My theory on this is that it's two things-
One, every restaurant wants their site to look like every other restaurant
site. Which makes a certain kind of sense, even if it's the wrong approach.
Two, web developers push this kind of website because it would be hard to
justify charging a decent wage for the basic sites that restaurants really
need. So they make it all fancy.
~~~
InclinedPlane
I think it's more that many restaurant owners are unsophisticated when it
comes to the web, and it's easier for designers to sell a flash-based site
because it looks fancier in a demo than a plain html site.
It's comparatively more difficult to pitch usability.
~~~
bodhi
The first comment made an excellent point I believe:
> Owners never visit their own websites after the initial presentation by the
> web designers because they don't need to.
However, the design firm pitches to the owner, not to the customers. And thus
the website is designed to please them, rather than actually being useful for
_potential_ customers.
~~~
pyre
The point is that the owner _should_ be interested in what please their
customers not what looks pleasing to them, but it unusable by their customers.
~~~
InclinedPlane
Nevertheless, this is the problem of fighting uphill against human nature.
This phenomenon is made worse by the fact that patronage due to the website is
difficult for most restaurants to quantify. The vast majority of restaurants
are completely clueless as to how much business their websites are responsible
for, which, as with most things unmeasured, leads to neglect and disrespect.
If more restaurants integrated aspects such as table reservations or mailing
lists more restaurant owners may come to a greater respect for the importance
of getting their web presence right.
------
kaiserama
I worked on this problem for about 6 months, I had built a simple hosted
solution, for restaurants in this case, that the operator could build a mobile
version of their site that was viewable on iPhone, Android, and Blackberry.
The first few places I told the idea to loved it and so I thought it might
take off. Unfortunately (fortunately?) for me I happened to talk to two
restaurant operators who actually used social media and 'got it'. When I
started doing more market research with other operators and restaurant
marketers the basic reaction was simply this: operators are too busy to be
bothered with frivolous things like websites, and for some even email
addresses. They're just trying to get through the month, the week, the day
without closing the place up (obviously a lot of turn over in the industry).
My personal take is that the next generation of operators will likely be more
receptive and will see the value in using different forms of media and
accepting that people get their information in very different ways than even 5
years ago. I think there are other ways to make money in the restaurant
industry, if I was someone looking to do something in this industry I'd start
making some connections with the US Foods and the Syscos of the world, alone
you'll be lucky to even get face time with an operator, let alone convince
them to use your product.
If anyone is interested one of the restaurants that used the service was here
<http://www.edinagrill.com>, access from your iphone/android/blackberry and
you'll see a mobile version vs normal browser.
~~~
autarch
I'm not sure you "got" it, based on the horrific flash nav menu, and the
ridiculously small window all the info is displayed in (I have more than 300
or so vertical pixels!).
~~~
kaiserama
That's part of their full site. If you're accessing from an iPhone, Android,
or Blackberry and haven't disabled Javascript you should see a mobile friendly
version. Other devices may display it differently.
------
mprime
Common sense would dictate that Flash/PDF's/.doc's/JavaScript is/are only
necessary in a small number of cases, when there is _no other way to provide
that content_. When you use it, you're making an assumption about what the
user is willing and able to process on their end. If you do that enough, it
becomes just as annoying as someone distributing a C file for everyone to use
that relies on windows.h
What's worse still is that it took the iPhone not supporting Flash for
everyone to realize that Flash actually isn't needed for most things.
~~~
_delirium
One explanation I've heard for the PDF menus is that they have to have PDF
versions anyway for printing, so the least-effort solution is to just put the
same PDFs online.
~~~
mprime
If they can't be bothered to run the PDF through a program to translate it to
HTML, and then post a link to the PDF version, I don't want to do business
with them.
If their menu is so fancy that it can't be easily translated into HTML,
they're missing the point entirely.
~~~
kscaldef
Well, good luck with that approach, I guess. Personally I care a lot more
about the quality of the food, the quality of service, the cleanliness of the
restaurant, the ambiance, the price, ...
~~~
mprime
If I'm trying to order food from them, and their entire business model depends
on me buying food from them, yet they're making it hard for me to find what
food I can buy from them, they are either idiots or sloppy people who hire
idiots to design their website. Either way, they're worthless.
------
callmeed
We're actually working on a rest. site solution now precisely because Flash
sites, PDF menus, and impossible-to-use-on-mobile drives us crazy. I will
probably apply to YC with it but we plan to release in May regardless. There's
a big restaurant trade show then and we're planning to exhibit.
------
pg
<http://fukisushi.com>
~~~
eam
<http://elfarolitoinc.com/>
~~~
Semiapies
That's the most useful "under construction" page I've ever seen.
------
icefox
+1 for movie theaters also. I have one right down the street that I have
didn't go to for years because it was just a big flash box that I could never
use to find out what they were playing. _I want to give them money_ , but I
don't think they get that.
------
thetable
I find it sad that many restaurants are so bad at SEO, or maybe they just
can't compete with Yelp and their spammier friends.
Often, it's nearly impossible to find the one authoritative website on a
restaurant, bar, or store - the one owned by that business. Instead, search
engine result pages tend to be dominated by crappy Yellow pages entries that
may or may not include the correct phone number of the place, but never
photos, the menu or the hours.
------
metamemetics
I'm in the midst of designing a restaurant website right now. They initially
asked for Flash, but I showed them a jQuery\html\css design instead. They
really liked it and it wasn't a problem. Also using Django as a CMS for
mailing list and menu items.
------
telemachos
I seem to have accidentally linked to the #disqus-thread version of the link.
If anyone with mod powers (?) happens by and can fix it, thanks in advance.
------
elblanco
Oh if this isn't true. Due to valentine's day I ran into this about a dozen
times before just going to the local "nice restaurant".
~~~
prawn
An idea of mine is for calendar-specific events. e.g., for Valentine's Day, I
often look to see which decent restaurants are running special events like
degustations. For Melbourne Cup, I want to know who's doing booking-only and
who's got a free for all. For NYE, people want to know if there's a specific
cover charge or event when they're trying to pick a place to go.
Right now, if you want to book a special event for Valentine's Day, you have
to go from site to site, hoping restaurants have updated recently (fat
chance), and then contact them to see if they have a booking. Would be so much
simpler to pick the event, the locale and then see a list of options including
whether they were already booked out.
With a database of restaurant phone numbers, the polling of data could be
automated. Robo-dial a restaurant at a less-than-busy time with "This is
Service X. Are you doing anything special for Event Name? If the usual, press
1. If a special menu, press 2. If you never want us to pester you again, press
0." Then receive and transcribe the eventual descriptions.
Could have an automated call handling capacity too. "Are you booked out for
Event Name? Press 1 for no, or press 2 if you are booked out. Hit 0 to stop
these messages."
------
autarch
Here's an exception - <http://evergreen-chinese.com>
All HTML and CSS, hours, phone #, and address all on the front page. Menu is
in HTML and kept up to date.
~~~
sebastianavina
let me guess... one of your projects.
~~~
autarch
Not exactly. I'm friends with the owners, and when they wanted a website, I
handed them off to a designer friend of mine who I know does good work.
I do host the website and keep the menu up to date for them, though.
------
Groxx
Restaurant websites are indeed a special kind of hell. They're nearly
universally Flash'd up and annoying.
My solution for restaurant-website-woes, especially for simple things like
hours: phone. Their automated answerer will probably tell you before you could
navigate their site. Especially with Goog 411, I rarely use my computer for
business phone numbers any more.
------
roedog
I appreciate the practical and intrinsic value of a good website, and how a
restaurant owner may not appreciate the difference in work quality of web
design consultants.
What I wonder is why should they care? I think that the success of a
restaurant depends far more on the food, service, and setting of the
restaurant itself. Setting aside we discerning HN readers, very few people
choose where to eat based on web design.
I have a theory from observations of restaurants in my city. The restaurants
with neon "OPEN" signs in front tend to be more empty than the ones without
the OPEN sign. This is across all price points and styles. My thinking is that
they are not filling tables, so think they need to let people know they are
open and to come eat there. If people are not eating at your restaurant, will
making a good quality website with accurate hours help you?
------
eldenbishop
Sometimes it is just laughable...I went to a website on my phone to look up
the menu. I got a "flash required" message. I was at home so I dug out my
laptop and went to the site. The "Flash" application was a static image with
the hours and phone number printed on it.
------
rodyancy
I've ran into this problem so many times I've developed a workaround using
various applications.
Google maps on the iphone gets me the phone number. If I have to see a menu,
UrbanSpoon or Yelp works sometimes. I don't even bother with mobile browsers.
------
telemachos
Randomly selected favorites (restaurants, not websites) from my hometown:
<http://www.tablany.com/>
<http://shakeshack.com/> (Nope, I'm completely off-base here. Shake Shack has
a lovely, flash-free, pdf-free mobile version. Apologies to Danny Meyer and
company.)
<http://barstuzzichini.com/index.asp>
I should send them a snapshot of what their websites look like with
ClickToFlash installed.
~~~
lliiffee
In fairness, shakeshack has a wonderfully simple version that loads for me
with noscript on.
~~~
telemachos
Maybe so, but with ClickToFlash, I get one giant Flash button.
(This suggests that on an iPhone, you're toast if you surf there.)
The nearby Standburger does much better, and their toasted marshmallow shake
is the wife's favorite anyhow.
<http://www.standburger.com/>
@Mikeryan, you are completely right. I was going there as you replied. I
edited my post above to note that.
Weirdly, Tabla (same owner) does not have an alternative website for mobile.
~~~
mikeryan
No shakeshack.com has a very nice iphone based site if you go there on the
iphone.
Kudos to them for handling this well.
------
dpcan
I see what's happening here. He's taking a shot at Flash. Right? No, he's
taking a shot at a terrible web designer. Wait, no again. It must be taking a
shot at a restaurant owner who saw a moving website with flying cheeseburgers
and thought it was really cool and demanded the same thing from the web
development company he/she hired.
So, "Website" that's totally ignoring me, I apologize for accusing you of
being Flash, when in reality it's your advertising and marketing decision
makers who are clueless.
------
timdorr
It's funny to read this because we just did this for a client:
<http://www.bluefinatlanta.com/> Hours on the front page, menu in HTML, zero
Flash. Not even that hard to do, realistically.
Before, they didn't even show up in Google's results for "Atlanta sushi". Now
they've actually got some content to index. I get that it's easy to market
flashy sites, but it's also easy to market search engine optimization too.
------
johnl
Why don't you create an app that solves that particular problem and give it
away free on the condition that you can dish up and split Google ads on the
app. Create a site where they can automatically update their hours. Some
simple loan calculators made good money referring people to mortgage companies
a few years ago.
------
radley
dev: I just made an incredible site for you - it's totally HTML5.
rest: I can't see the video.
dev: you have to use Google Chrome.
rest: I Googled Chrome. It took me to a picture of YouTube. Is my video on
YouTube?
dev: no - that's a picture of a browser with YouTube in it. You have to
download it. The browser I mean.
rest: I already have a browser. It's called Firefox Explorer or something.
dev: No you have to use this one. It's the best.
rest: but it says beta. Doesn't that mean it's not done?
dev: it's fine. It's better than your browser.
rest: How is it better than my browser? My customers don't even have that
browser.
dev: because it's a standard. So everyone has to use it.
rest: I want my Flash site back.
dev: No! Flash is bad! It's not open source.
rest: I'd rather be open for business...
la la la
~~~
ZeroGravitas
dev: I just made an incredible site for you - it's totally HTML5.
rest: I can't see the video.
dev: There is no video. You're a bloody _restaurant_ , not Lady Gaga.
~~~
radley
rest: Can I at least use a nice font?
dev: NO FONT FOR YOU!
------
scarlson
Or, you could have just phoned the place and asked whoever picked up the
receiver.
While I agree that restaurants could do well to have iPhone accessible store
hours, I don't think it's totally unrealistic to phone in and politely ask the
maître d’.
------
antidaily
yelp app.
~~~
whopa
In my experience, Yelp's open hours data is inaccurate often enough to be
entirely untrustworthy.
~~~
ecuzzillo
Thank you for telling me that.
------
tjic
As I wrote yesterday in a different comment:
People who submit stories: please submit the URL of the article, not the
anchor-laden URL of the comments.
This happens all the time, and it's annoying.
Thank you.
------
sonnym
I'm surprised that no one has mentioned allmenus.com - a bit menu-centric, but
still lists the hours of most restaurants.
It's a spin-off of campusfood.com, so it has online ordering capabilities
built-in.
~~~
dpritchett
See also Memphis-area startup <http://www.MarksMenus.com>. This one came out
of Startup Weekend in 2009. It does menus and per-dish reviews with user
comments and reviews.
I'm not affiliated but I did meet the founders at SUWMem.
------
payjo
Am I missing something here or do people not just go to yelp? They have hours
for most businesses. Or is this post more aimed at new ventures and the
importance of having hours on the site?
------
jasonlbaptiste
grr, i cant find the company/post, but a long while back sergey brin invested
in a startup that basically listed information for a business' operating
hours.
------
ThomPete
This seems like a pseudo problem, no?
Don't most people use exactly everything else than the restaurants website and
instead yelp.com, allmenus.com.
|
{
"pile_set_name": "HackerNews"
}
| 94 |
[
{
"begin": 0,
"end": 53,
"score": 0
},
{
"begin": 53,
"end": 149,
"score": 1
},
{
"begin": 149,
"end": 150,
"score": 0
},
{
"begin": 150,
"end": 156,
"score": 1
},
{
"begin": 156,
"end": 163,
"score": 0
},
{
"begin": 163,
"end": 245,
"score": 1
},
{
"begin": 245,
"end": 329,
"score": 0
},
{
"begin": 329,
"end": 375,
"score": 1
},
{
"begin": 375,
"end": 395,
"score": 0
},
{
"begin": 395,
"end": 441,
"score": 1
},
{
"begin": 441,
"end": 513,
"score": 0
},
{
"begin": 513,
"end": 518,
"score": 1
},
{
"begin": 518,
"end": 519,
"score": 0
},
{
"begin": 519,
"end": 526,
"score": 1
},
{
"begin": 526,
"end": 936,
"score": 0
},
{
"begin": 936,
"end": 940,
"score": 1
},
{
"begin": 940,
"end": 997,
"score": 0
},
{
"begin": 997,
"end": 1001,
"score": 1
},
{
"begin": 1001,
"end": 1009,
"score": 0
},
{
"begin": 1009,
"end": 1013,
"score": 1
},
{
"begin": 1013,
"end": 1491,
"score": 0
},
{
"begin": 1491,
"end": 1501,
"score": 1
},
{
"begin": 1501,
"end": 1506,
"score": 0
},
{
"begin": 1506,
"end": 1532,
"score": 1
},
{
"begin": 1532,
"end": 1682,
"score": 0
},
{
"begin": 1682,
"end": 1688,
"score": 1
},
{
"begin": 1688,
"end": 1962,
"score": 0
},
{
"begin": 1962,
"end": 1966,
"score": 1
},
{
"begin": 1966,
"end": 1971,
"score": 0
},
{
"begin": 1971,
"end": 1977,
"score": 1
},
{
"begin": 1977,
"end": 1983,
"score": 0
},
{
"begin": 1983,
"end": 1986,
"score": 1
},
{
"begin": 1986,
"end": 1992,
"score": 0
},
{
"begin": 1992,
"end": 1999,
"score": 1
},
{
"begin": 1999,
"end": 2054,
"score": 0
},
{
"begin": 2054,
"end": 2058,
"score": 1
},
{
"begin": 2058,
"end": 2129,
"score": 0
},
{
"begin": 2129,
"end": 2133,
"score": 1
},
{
"begin": 2133,
"end": 2163,
"score": 0
},
{
"begin": 2163,
"end": 2172,
"score": 1
},
{
"begin": 2172,
"end": 4240,
"score": 0
},
{
"begin": 4240,
"end": 4246,
"score": 1
},
{
"begin": 4246,
"end": 4248,
"score": 0
},
{
"begin": 4248,
"end": 4255,
"score": 1
},
{
"begin": 4255,
"end": 4261,
"score": 0
},
{
"begin": 4261,
"end": 4271,
"score": 1
},
{
"begin": 4271,
"end": 5276,
"score": 0
},
{
"begin": 5276,
"end": 5281,
"score": 1
},
{
"begin": 5281,
"end": 5290,
"score": 0
},
{
"begin": 5290,
"end": 5296,
"score": 1
},
{
"begin": 5296,
"end": 5498,
"score": 0
},
{
"begin": 5498,
"end": 5523,
"score": 1
},
{
"begin": 5523,
"end": 5601,
"score": 0
},
{
"begin": 5601,
"end": 5603,
"score": 1
},
{
"begin": 5603,
"end": 5883,
"score": 0
},
{
"begin": 5883,
"end": 5889,
"score": 1
},
{
"begin": 5889,
"end": 5891,
"score": 0
},
{
"begin": 5891,
"end": 5898,
"score": 1
},
{
"begin": 5898,
"end": 5903,
"score": 0
},
{
"begin": 5903,
"end": 5913,
"score": 1
},
{
"begin": 5913,
"end": 5935,
"score": 0
},
{
"begin": 5935,
"end": 5945,
"score": 1
},
{
"begin": 5945,
"end": 6045,
"score": 0
},
{
"begin": 6045,
"end": 6051,
"score": 1
},
{
"begin": 6051,
"end": 6490,
"score": 0
},
{
"begin": 6490,
"end": 6496,
"score": 1
},
{
"begin": 6496,
"end": 7797,
"score": 0
},
{
"begin": 7797,
"end": 7800,
"score": 1
},
{
"begin": 7800,
"end": 7897,
"score": 0
},
{
"begin": 7897,
"end": 7917,
"score": 1
},
{
"begin": 7917,
"end": 7929,
"score": 0
},
{
"begin": 7929,
"end": 7954,
"score": 1
},
{
"begin": 7954,
"end": 7961,
"score": 0
},
{
"begin": 7961,
"end": 7970,
"score": 1
},
{
"begin": 7970,
"end": 8415,
"score": 0
},
{
"begin": 8415,
"end": 8419,
"score": 1
},
{
"begin": 8419,
"end": 8649,
"score": 0
},
{
"begin": 8649,
"end": 8655,
"score": 1
},
{
"begin": 8655,
"end": 9002,
"score": 0
},
{
"begin": 9002,
"end": 9008,
"score": 1
},
{
"begin": 9008,
"end": 9014,
"score": 0
},
{
"begin": 9014,
"end": 9017,
"score": 1
},
{
"begin": 9017,
"end": 9443,
"score": 0
},
{
"begin": 9443,
"end": 9452,
"score": 1
},
{
"begin": 9452,
"end": 9455,
"score": 0
},
{
"begin": 9455,
"end": 9458,
"score": 1
},
{
"begin": 9458,
"end": 9555,
"score": 0
},
{
"begin": 9555,
"end": 9564,
"score": 1
},
{
"begin": 9564,
"end": 9565,
"score": 0
},
{
"begin": 9565,
"end": 9568,
"score": 1
},
{
"begin": 9568,
"end": 9808,
"score": 0
},
{
"begin": 9808,
"end": 9817,
"score": 1
},
{
"begin": 9817,
"end": 9820,
"score": 0
},
{
"begin": 9820,
"end": 9823,
"score": 1
},
{
"begin": 9823,
"end": 10249,
"score": 0
}
] |
The present invention relates generally to electrical connectors for connecting a power or communication cable to an appliance or telecommunications equipment and more particularly to a rotary electrical connector assembly for a telephone handset.
A rotary electrical connector is used, for example, in conjunction with a cable that connects the handset to the base of a telephone. The purpose of the rotary electrical connector is to prevent the cable from becoming tangled or twisted when used over an extended period of time, which is undesirable.
The rotary connectors described in the related applications generally comprise a spindle at least part of which is contained within a housing. The spindle and the housing are mutually rotatable, in relation to each other, about a common axis. In some embodiments, male and female modular electrical connecting elements are associated with one or both of the housing and the spindle. The female connecting element associated with the rotary connector receives a modular male connecting element normally located at one end of the telephone cable, and the male modular connecting element associated with the rotary connector normally plugs into a female modular connecting element on the telephone, typically on the handset thereof.
The spindle typically has electrically conductive rings located around its periphery, and these rings are connected by electrical conducting elements extending through the spindle to electrical contact members on one of the modular connecting elements or to other connections with the telephone equipment. The rings are engaged by electrical contact members or wipers typically electrically connected to the other modular connecting element associated with the rotary connector or to the cord or cable conventionally extending between the handset and the base. There is thus formed a rotatable electrical connection between the telephone cable and the handset.
|
{
"pile_set_name": "USPTO Backgrounds"
}
| 0 |
[
{
"begin": 0,
"end": 1941,
"score": 0
}
] |
859 N.E.2d 323 (2004)
344 Ill. App.3d 1229
307 Ill.Dec. 312
SAUER
v.
SAFECO INS. CO.
No. 2-03-0077.
Appellate Court of Illinois, Second District.
January 2, 2004.
Affirmed.
|
{
"pile_set_name": "FreeLaw"
}
| 9 |
[
{
"begin": 0,
"end": 48,
"score": 0
},
{
"begin": 48,
"end": 52,
"score": 1
},
{
"begin": 52,
"end": 77,
"score": 0
},
{
"begin": 77,
"end": 80,
"score": 1
},
{
"begin": 80,
"end": 82,
"score": 0
},
{
"begin": 82,
"end": 84,
"score": 1
},
{
"begin": 84,
"end": 101,
"score": 0
},
{
"begin": 101,
"end": 110,
"score": 1
},
{
"begin": 110,
"end": 111,
"score": 0
},
{
"begin": 111,
"end": 116,
"score": 1
}
] |
Rep. Alexandria Ocasio-Cortez (D-NY) on Saturday slammed President Donald Trump for “[phoning it in”] at the G-20 summit on Osaka, Japan — and argued that his daughter, Ivanka Trump, is unqualified to represent the United States at such a high-stake meeting.
Ocasio-Cortez’s criticism came after a video fo Ivanka Trump went viral over the weekend, showing the president’s daughter appearing to try and interject herself into a conversation with Canadian Prime Minister Justin Trudeau, British Prime Minister Theresa May, and International Monetary Fund (IMF) chief Christine Lagarde. The video was released by the French government.
In a tweet Saturday, Ocasio-Cortez wrote, “It may be shocking to some, but being someone’s daughter actually isn’t a career qualification.”
You can read the full tweet below:
It may be shocking to some, but being someone’s daughter actually isn’t a career qualification. It hurts our diplomatic standing when the President phones it in & the world moves on. The US needs our President working the G20. Bringing a qualified diplomat couldn’t hurt either. https://t.co/KCZMXJ8FD9 — Alexandria Ocasio-Cortez (@AOC) June 30, 2019
And watch the original clip here:
|
{
"pile_set_name": "OpenWebText2"
}
| 41 |
[
{
"begin": 0,
"end": 3,
"score": 1
},
{
"begin": 3,
"end": 5,
"score": 0
},
{
"begin": 5,
"end": 15,
"score": 1
},
{
"begin": 15,
"end": 16,
"score": 0
},
{
"begin": 16,
"end": 29,
"score": 1
},
{
"begin": 29,
"end": 40,
"score": 0
},
{
"begin": 40,
"end": 48,
"score": 1
},
{
"begin": 48,
"end": 57,
"score": 0
},
{
"begin": 57,
"end": 66,
"score": 1
},
{
"begin": 66,
"end": 67,
"score": 0
},
{
"begin": 67,
"end": 73,
"score": 1
},
{
"begin": 73,
"end": 74,
"score": 0
},
{
"begin": 74,
"end": 79,
"score": 1
},
{
"begin": 79,
"end": 109,
"score": 0
},
{
"begin": 109,
"end": 113,
"score": 1
},
{
"begin": 113,
"end": 124,
"score": 0
},
{
"begin": 124,
"end": 129,
"score": 1
},
{
"begin": 129,
"end": 131,
"score": 0
},
{
"begin": 131,
"end": 136,
"score": 1
},
{
"begin": 136,
"end": 169,
"score": 0
},
{
"begin": 169,
"end": 175,
"score": 1
},
{
"begin": 175,
"end": 176,
"score": 0
},
{
"begin": 176,
"end": 181,
"score": 1
},
{
"begin": 181,
"end": 215,
"score": 0
},
{
"begin": 215,
"end": 221,
"score": 1
},
{
"begin": 221,
"end": 222,
"score": 0
},
{
"begin": 222,
"end": 228,
"score": 1
},
{
"begin": 228,
"end": 260,
"score": 0
},
{
"begin": 260,
"end": 273,
"score": 1
},
{
"begin": 273,
"end": 308,
"score": 0
},
{
"begin": 308,
"end": 314,
"score": 1
},
{
"begin": 314,
"end": 315,
"score": 0
},
{
"begin": 315,
"end": 320,
"score": 1
},
{
"begin": 320,
"end": 456,
"score": 0
},
{
"begin": 456,
"end": 461,
"score": 1
},
{
"begin": 461,
"end": 462,
"score": 0
},
{
"begin": 462,
"end": 470,
"score": 1
},
{
"begin": 470,
"end": 471,
"score": 0
},
{
"begin": 471,
"end": 477,
"score": 1
},
{
"begin": 477,
"end": 478,
"score": 0
},
{
"begin": 478,
"end": 485,
"score": 1
},
{
"begin": 485,
"end": 495,
"score": 0
}
] |
Twitter Will Finally Stop Making Your Images Look Terrible - fewi
https://onezero.medium.com/twitter-will-finally-stop-making-your-images-look-terrible-2ed882dfcd9e?source=rss----444d13b52878---4&gi=fad303263da1
======
gojomo
Next, maybe Twitter can assign a big team the multi-month project of making it
so that when you click an image, to zoom for more details:
* it doesn't ever shrink the image size (as currently happens with certain oversized/proportioned images)
* it doesn't add new overlays obscuring edges of the image that you just clicked to get a fuller view
Baby steps! I know they're running a cash-starved skeleton crew over at their
non-profit hobby site.
~~~
ryanlol
Perhaps after they close these tickets they could make the website load
successfully more than half the time?
Ah, nevermind. I’m asking for way too much.
------
sedatk
The depreciation of digital images is an interesting phenomenon. Like the real
paper, the quality of memes on the Internet gets worse and worse over time. We
were promised that digital medium would never lose quality yet here we are. Of
course, it's not just lossy compression but bit rot too.
I wonder how we will be tackling these problems in the future. Maybe, at some
point, the savings of JPEG will be negligible for what we have so we'll have
images as PNGs?
~~~
Edmond
The phenomenon of meme photo degradation is indeed an interesting one.
I think that is one reason I have always been put off by memes even when they
come from loved ones, the photos look LITERALLY dirty, as if passed around by
hand :)
~~~
serf
a lot of that has to do with meme-regurgitator sites that stamp their
watermark all over an image.
the reality is that the picture is being passed around by way too many
automations that apply filters or reencodes with little regard to the quality
drop, and lots of priority going to making the image smaller, and thus cheaper
to host.
~~~
ryanlol
>and thus cheaper to host
Sure, if you host all the images on S3. But why would you? Anywhere else you
can get unmetered gigabit for a few hundred/mo, the savings would be non-
existent.
------
zaroth
Yes, this is apparently a multi-billion user site used to share images, which
doesn’t know that the image which is currently being uploading has already
been compressed at a quality setting _lower_ than what they are about to try
_recompressing_ the image at, and so will endlessly recompress the same image
ad nauseam until it becomes illegible. But now, maybe not. But only if the
upload the image through a web browser. So impressive.
------
egdod
>To make Medium work, we log user data and share it with service providers.
Click “Sign Up” above to accept Medium’s Terms of Service & Privacy Policy.
Gross.
|
{
"pile_set_name": "HackerNews"
}
| 15 |
[
{
"begin": 0,
"end": 1,
"score": 0
},
{
"begin": 1,
"end": 8,
"score": 1
},
{
"begin": 8,
"end": 39,
"score": 0
},
{
"begin": 39,
"end": 45,
"score": 1
},
{
"begin": 45,
"end": 51,
"score": 0
},
{
"begin": 51,
"end": 59,
"score": 1
},
{
"begin": 59,
"end": 67,
"score": 0
},
{
"begin": 67,
"end": 212,
"score": 1
},
{
"begin": 212,
"end": 239,
"score": 0
},
{
"begin": 239,
"end": 246,
"score": 1
},
{
"begin": 246,
"end": 576,
"score": 0
},
{
"begin": 576,
"end": 580,
"score": 1
},
{
"begin": 580,
"end": 974,
"score": 0
},
{
"begin": 974,
"end": 982,
"score": 1
},
{
"begin": 982,
"end": 1331,
"score": 0
},
{
"begin": 1331,
"end": 1337,
"score": 1
}
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.