texts
list | meta
dict | scores
list | avg_score
float64 0
1
| num_sents
int64 1
32.7k
|
|---|---|---|---|---|
[
"What Does An Asset Protection Attorney Do?",
"\n\nThere is one expert you should know about if you want to protect and preserve your hard-earned assets. ",
"An asset protection attorney. ",
"What is an asset protection attorney? ",
"He or she is a specialist in a field that is increasingly becoming more relevant in this litigious age.",
"\n\nAsset protection lawyers can assist you in several ways. ",
"They use different strategies to craft an asset protection plan that’s tailor-made for your unique situation. ",
"Plus, they help protect you and your assets from lawsuits. ",
"Moreover, they make sure your asset protection plan is in step with the changes in your professional and personal life. ",
"In addition, they apprise you of all possible options – whether you end up using them or not. ",
"So, they perform a delicate balancing act of giving you a measure of control over your assets at the very same time you’re giving them up to protect them. ",
"In this day and age, Google seems to have the answer to everything; but an asset protection lawyer is still indispensable.",
"\n\nAsset Protection Strategies\n\nThe concept of liability appears to be in a state of constant flux lately. ",
"Even states with asset protection laws on their books do not seem to apply the rules evenly. ",
"In an attempt to deal with this ambiguity, the industry has spawned a wide range of asset protection instruments. ",
"There certainly are more now than there ever were even just three or four years ago. ",
"Deciding on which instruments will work best for you can be confusing, to say the least. ",
"This is where an asset protection lawyer can be of assistance.",
"\n\nThink of asset protection as a maze. ",
"However, it’s not a typical maze where there’s only one way to reach the prize at the end. ",
"There are many different ways to go through this maze – each one unique to a person’s own set of circumstances. ",
"A good asset protection attorney helps you find your way around this maze. ",
"The asset protection strategy that will work for you may not be as effective for another individual. ",
"That other person has to find another way through the maze – one that corresponds to their individual goals more closely.",
"\n\nBeware of the asset protection ‘specialist’ who knows of only one way through the maze. ",
"An asset protection plan is a customized combination of investment and financial instruments that a lawyer designs for each unique client. ",
"Anyone who tells you otherwise is simply wrong. ",
"At best, he or she is misinformed, or worse, someone is conning you. ",
"Don’t fall for it.",
"\n\nProtect Your Assets from Lawsuits\n\nNo asset protection plan is 100 percent impenetrable all the time. ",
"But you will often find that having one in place can be an excellent lawsuit deterrent. ",
"Predatory claimants don’t want to work too hard to separate you from your assets. ",
"Sometimes, all they have to know is that you have a plan in place and they’ll leave you alone. ",
"An efficient asset protection lawyer does not have to hide your assets – unless that’s what you want. ",
"As long as he or she places them just out of reach of frivolous claimants, they’re doing their job.",
"\n\nA well-crafted asset protection plan is a potent tool in the hands of a skilled asset protection attorney. ",
"He or she can use it as a leverage to convince a creditor to settle out of court. ",
"Your creditor can try to pierce your plan and go through the expense of a lengthy trial. ",
"Or, they can accept a settlement – for cents on the dollar in your favor – and spare everyone the ordeal. ",
"Odds are, your creditor will take the deal. ",
"You still have to shell out something, of course, but it will likely be nowhere near the original amount demanded.",
"\n\nAsset Protection Attorney in Estate Planning\n\nFor a majority of people, estate planning means writing out a will and dealing with inheritance issues. ",
"While these can be part of estate planning, they do not constitute the entirety of this complex task. ",
"An experienced asset protection attorney knows that asset protection is an important and integral part of estate planning. ",
"How do you make sure your beneficiaries will put the assets you leave behind to good use? ",
"What can you do to you pass your assets down to your beneficiaries and still qualify for government long-term care assistance? ",
"How do you get around a forced heirship regulation? ",
"These are just some estate planning issues your asset protection lawyer can help you resolve.",
"\n\nIt’s always prudent to review your estate and asset protection plans regularly. ",
"You need to make sure the changes in your personal and professional life are reflect and support your plans. ",
"A beneficiary may die or fall out of favor. ",
"You can start a new business or expand your current one overseas. ",
"As you get older, your plans for the use of your assets may change as well. ",
"An asset protection lawyer will always be one step ahead of you. ",
"In the changes that happen in your life, he or she will see the need to revisit your asset protection and estate plans. ",
"Don’t settle for one who drafts an asset protection plan for you and never shows up on your doorstep again.",
"\n\nDomestic Versus Offshore Asset Protection\n\nYou can’t have a complete discussion about asset protection without mentioning offshore options. ",
"You may think you don’t have a high enough net worth or ample assets to go this route. ",
"It’s a common perception that offshore asset protection is an option reserved for the mega-rich. ",
"While it’s true that this option is not for everyone, it’s not only for super-rich individuals either. ",
"Foreign asset protection vehicles provide something its domestic counterparts cannot. ",
"That is the protection of a sovereign country. ",
"Offshore jurisdictions have their own asset protection laws, which are often grantor-friendly (if you’re setting up a trust). ",
"These locations want to attract foreigners who will establish LLCs or corporations on their land. ",
"Of course, they will enact legislation that will favor these investors.",
"\n\nThe simple truth is that these offshore jurisdictions add another blanket of protection over your assets. ",
"In this litigation-crazy world, the greater distance you can put between your assets and an opportunistic plaintiff, the safer your assets will be. ",
"If your asset protection lawyer doesn’t talk about the possibility of using a foreign asset protection instrument, bring it up. ",
"Ask about offshore banking / savings account in an overseas LLC and trust. ",
"Your assets or your financial goals may not warrant it, but it’s always good to know all your options.",
"\n\nAsset Protection Trust\n\nNo one likes giving up control over their assets – especially if you’ve spent a lifetime accruing them through hard work. ",
"But an experienced asset protection lawyer knows that giving up a measure of control over your assets is the best way to stay in control of them. ",
"This is not empty rhetoric. ",
"Consider one of the most basic – and potent – asset protection instruments available – the irrevocable trust. ",
"If you create a trust, you build a wall of protection around the different types of assets you own. ",
"You no longer own the assets you place in a trust; the trust does. ",
"Therefore, if someone sues you for them, they are beyond the reach of your creditors. ",
"By the same token, someone ever places the trust assets in jeopardy, your personal assets will remain safe. ",
"This is because your personal assets are separate and distinct from the assets held inside the trust.",
"\n\nThe asset protection features of a trust become even more powerful when you create an irrevocable trust. ",
"Once setup, you cannot readily change the terms of an irrevocable trust without the trustee’s cooperation. ",
"If a creditor wins a lawsuit against you and you could change it, the courts could force you to change the beneficiary to your legal opponent. ",
"With an irrevocable trust, since you cannot change it directly, the court cannot force you to change the terms of the trust to satisfy a creditor. ",
"So in giving up control of your assets, you end up protecting them. ",
"In a very real sense, you’re still in control of your assets because you prevented someone from taking them away from you. ",
"You kept them exactly where you wanted them to be – safe and secure, away from predatory claimants and nuisance plaintiffs.",
"\n\nDrafting the Trust\n\nAn asset protection attorney can help you draft a trust deed that will allow you to retain a level of control over your assets without putting them in harm’s way. ",
"You can place certain conditions that have to be met before a discretionary interest is distributed. ",
"For instance, a child has to reach a certain age first or graduate from college. ",
"With the assistance of a knowledgeable asset protection lawyer, a careful wording of the trust deed means you do not lost complete control of the assets you have worked so hard to build.",
"\n\nConclusion\n\nAsset protection attorneys know there is no one-size-fits-all plan when it comes to protecting their client’s assets. ",
"The lawyer customizes each asset protection plan to ensure it can provide comprehensive and maximum security. ",
"A well-crafted plan can also help protect your assets from a lawsuit or lead to a settlement in your favor. ",
"An asset protection lawyer will be proactive in reviewing your asset protection plan regularly. ",
"This is so he or she can in turn assure you that the plan continues to support your financial goals and your plans for your assets.",
"\n\nEven though you may not need to use a foreign asset protection instrument, it’s good to stay informed about them. ",
"The level of protection they offer is quite unmatched in the asset protection world. ",
"Finally, an asset protection attorney knows that the best way to protect your assets is to simply not own them. ",
"They help you keep a measure of control over your assets at the same time you are giving them up. ",
"It’s a delicate balancing act, but one that a seasoned asset protection lawyer knows only too well.",
"\n\nDo you need an asset protection attorney? ",
"Would you like to speak with a consultant with years of experience in protecting assets from lawsuits. ",
"Use the contact numbers above or the inquiry form on this page."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0007878415635786951,
0.0006103913183324039,
0.0007463095244020224,
0.0007659441907890141,
0.0006543158087879419,
0.0005585344624705613,
0.0005750382551923394,
0.0009831429924815893,
0.0006974771386012435,
0.0007165665156207979,
0.0007245778106153011,
0.0007715012179687619,
0.0005689087556675076,
0.0006401650607585907,
0.0005886660073883832,
0.0007323857280425727,
0.0005400236696004868,
0.0006336206570267677,
0.0008609736687503755,
0.0007435756269842386,
0.0005635279230773449,
0.0005877309013158083,
0.0005787712289020419,
0.0006400936399586499,
0.0008268061210401356,
0.0005990184145048261,
0.0007396229193545878,
0.041582927107810974,
0.022776121273636818,
0.0015161025803536177,
0.0008781650103628635,
0.0025805591139942408,
0.01971319131553173,
0.000910119793843478,
0.0014652705285698175,
0.0005726756644435227,
0.000704994541592896,
0.024742120876908302,
0.0014800477074459195,
0.0071157230995595455,
0.0005950226914137602,
0.0006208416889421642,
0.0006185771781019866,
0.0005822919774800539,
0.0009191033896058798,
0.0007837128359824419,
0.001100959605537355,
0.0005814523319713771,
0.0007091234438121319,
0.0007305176695808768,
0.06433822214603424,
0.001133825397118926,
0.0012414545053616166,
0.0007007288513705134,
0.0006666029221378267,
0.0016588435973972082,
0.0005939450347796082,
0.0020113151986151934,
0.0006280961097218096,
0.0008152549271471798,
0.0006176537717692554,
0.0006807456957176328,
0.0006068690563552082,
0.0007747997879050672,
0.0006622680812142789,
0.0006286465213634074,
0.011271816678345203,
0.0006252764142118394,
0.0005812215385958552,
0.0006176637834869325,
0.0007724163588136435,
0.0006398682598955929,
0.001092344056814909,
0.0005767956026829779,
0.0008370532304979861,
0.0009940913878381252,
0.006846439093351364,
0.0006441750447265804,
0.0007252329960465431,
0.0005929854232817888,
0.0005593661335296929,
0.004358171485364437,
0.000659116602037102,
0.0011504648718982935,
0.0017564920708537102,
0.003964227624237537,
0.0006773778004571795,
0.0005985931493341923,
0.0010954953031614423,
0.0006081020110286772,
0.0006491721142083406,
0.0005471714539453387,
0.0007751531666144729,
0.0005762755172327161,
0.0007062817458063364,
0.0005192090757191181,
0.0005954859661869705,
0.0008372171432711184,
0.00063797936309129,
0.0006559100584127009,
0.0010239356197416782,
0.0005728239193558693,
0.0006085701752454042
] | 0.002723 | 103 |
[
"Morphological effects of octreotide on growth hormone-producing pituitary adenomas.",
"\nThe SRIH analog octreotide is a potent GH-inhibiting agent that has been used to effectively treat patients with acromegaly. ",
"To investigate the morphological changes induced by octreotide on GH-producing pituitary tumors, we examined 86 adenomas from acromegalic patients who participated in a multicenter study. ",
"GH- producing pituitary adenomas removed from 43 patients treated preoperatively with octreotide for 4 months were compared to those obtained from 43 untreated acromegalic patients. ",
"Tissue samples were studied by histology, immunohistochemistry, and transmission electron microscopy as well as light microscopic and ultrastructural morphometry. ",
"The morphological appearance of some tumors was unaltered by octreotide treatment. ",
"Necrotic changes were not apparent in any. ",
"Acidophilia and GH immunoreactivity were more pronounced in the octreotide-treated tumors. ",
"Perivascular and interstitial fibrosis was more prevalent in the octreotide group (72% vs. 42%). ",
"An increase in hormone granularity was obvious in 4 of 15 densely granulated and 2 of 9 sparsely granulated (SG) tumors from treated patients. ",
"A decrease in cell size was conspicuous in 4 of 15 densely granulated and 2 of 10 SG adenomas. ",
"There was a slight downward trend in the cell and cytoplasmic size in all treated tumors and a slight upward trend in secretory granule size in treated SG adenomas. ",
"Only 2 of 9 SG adenomas in the octreotide group, however, demonstrated a statistically significant reduction in cell and cytoplasmic size. ",
"There was no statistically significant change in the size of nuclei, secretory granules, or lysosomes between the 2 groups. ",
"Decreased cell size and increased granularity were not linked, however. ",
"We conclude that there are no striking morphological alterations in GH pituitary adenomas that can be consistently associated with octreotide treatment."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0030169866513460875,
0.0011330210836604238,
0.0006910450756549835,
0.0018669146811589599,
0.0005860510864295065,
0.0005907506565563381,
0.0012269258731976151,
0.0008916996303014457,
0.013047113083302975,
0.0006077109137549996,
0.000655628798995167,
0.0006816763198003173,
0.0006616668542847037,
0.0006001015426591039,
0.0005797054036520422,
0.0008721497724764049
] | 0.001732 | 16 |
[
"Using homework assignments to give feedback is pokey. ",
"Inefficient. ",
"Slow.",
"\n\nThink about the length of the feedback loop for traditional homework assignments:\n\nTeacher assigns homework to students.",
"\n\nStudents take it home (maybe) and work on it (maybe).",
"\n\nStudents turn it in the next day.",
"\n\nTeacher grades and provides comments that night (if not completely swamped with other work)\n\nTeacher returns assignment the next day with feedback\n\nAs teachers, we’re appalled that students take their graded work — with meaningful feedback — and throw it in the trash. (",
"Or my favorite … seeing it trapped in a closed locker door as I walk down the hallway. ",
"It makes me think, “I spent all that time grading that work and this is where it ends up?!?!”)",
"\n\nBut why wouldn’t they throw it in the trash?",
"\n\nIt takes work for students to take themselves back in time to when they were working on that assignment. ",
"As an adult, I have a hard time thinking about my thoughts and struggles with my work two days ago.",
"\n\nThe path of least resistance is NOT to do that mental back-tracking to apply slow feedback to a meaningless assignment. ",
"That assignment was SO two days ago.",
"\n\nI’ve found that the best feedback is the kind that can be applied right away. ",
"Why wait when we can get help right now with whatever we’re cognitively wrestling with?",
"\n\nEspecially today, where technology is ubiquitous and communication is instant, we can do so much better than tardy feedback.",
"\n\nMy feedback revelation with student blogging\n\nThis really hit me when my own students started blogging with their writing in my Spanish classes.",
"\n\nAt first, I thought I needed to comment digitally on their work if they were writing digitally. ",
"So I spent most of my time giving them suggestions through written comments after they were done writing.",
"\n\nBad move. ",
"So, so, so wrong.",
"\n\nOnce they were done with that blog post, they had moved on with their lives. ",
"They had little incentive to go back into that blog post, find my comments, read them and internalize them.",
"\n\nI’ve heard people say that in traditional school, once a grade is assigned, the learning is over. ",
"I was trying to teach them after they thought they were done learning.",
"\n\nThe feedback was good, but perception is reality: they thought they were done learning, so the feedback didn’t land.",
"\n\nI revised my techniques and tried a VERY low-tech option …\n\nI think the technical term for it is “walk around class and talk to students.”",
"\n\nStudents wrote their blog posts in class. ",
"As they were writing, I stopped by each student’s desk and took a knee. ",
"I briefly read what they were writing and used the sandwich feedback technique:\n\nA compliment (positive feedback)\n\nA change they could make\n\nAnother compliment (more positive feedback)\n\nIt sounded something like this:“Hey, that’s impressive that you remembered that word. ",
"We haven’t gone over it in a couple months! (",
"Positive feedback.) ",
"Remember right there that you want to use the word ‘por’ because you’re talking about a length of time. (",
"A change to make.) ",
"Other than that, it’s looking good. ",
"Keep up the good work! (",
"Positive feedback.)”",
"\n\nCould I have given that student about 17 corrections? ",
"Ohhhhhhh yes. ",
"Probably more. ",
"But I didn’t.",
"\n\nThere’s this thing called cognitive load. ",
"It’s the total amount of mental effort being used in the working memory. ",
"I figured that if I gave students more than one or two suggestions during their writing, it would be more like cognitive OVERload. ",
"So I chose my feedback wisely.",
"\n\nIt’s like coaching little kids to hit a baseball. ",
"They have a LOT to learn. ",
"If you tell them seven different things to remember when they go to bat, they won’t remember any of them.",
"\n\nTell them the most important thing to remember and they might actually remember it and do it.",
"\n\nAs teachers, it makes us feel better — like we’re doing our jobs — when we give lots of pointed feedback. ",
"But how much does it help kids when we overwhelm them and they can’t actually use any of it?",
"\n\n10 ways to provide quick feedback students can REALLY use\n\nLooking for some ways to up your feedback game? ",
"To make it lightning-quick so students will actually use it?",
"\n\nHere are some ideas:\n\n1. ",
"Play a quick formative assessment game. ",
"There are lots of great techy options here. ",
"Kahoot!.Quizizz.",
"Quizlet Live. ",
"The list goes on and on. ",
"If we want kids to get meaningful repetitions with instant feedback, they’re a great option.",
"\n\nTry replacing your repetition-based homework assignments with two quick Quizizz games each day. ",
"Do the first and check the student results. ",
"Do a quick mini lesson to address deficits. ",
"Then play the exact same game again. ",
"The instant feedback in those two short games will outweigh daily homework almost every time. (",
"Hat tip to Jon Corippo for this idea!)",
"\n\n2. ",
"Use digital assignment tools. ",
"These tools let you create an assignment and send it out to students digitally. ",
"As students work, they can get instant feedback. ",
"Some options:\n\nGoogle Forms quizzes (forms.google.com) — Create simple quizzes using Google Forms. ",
"Then click the settings gear button in the top right corner and choose “Quizzes.” ",
"Add instant feedback for students once they’re done with the quiz. ",
"They won’t have to wait on you to grade it!",
"\n\nFormative (goformative.com) — Create digital assignments with questions, teacher-created drawings, videos and more. (",
"I LOVE the draw-your-answer option called the “show your work” question.) ",
"Watch in real time as students answer and give them instant grades and comments. (",
"Be sure students have an account and have joined your Formative class to make this happen.)",
"\n\nClassKick (classkick.com) — The brilliance of this one is that students can give each other anonymous help. ",
"Who says the teacher has to give all the feedback? ",
"Create an assignment. ",
"Let students work. ",
"They can digitally raise their hands for help. ",
"The teacher can help — or students who are finished can help. ",
"Everyone is invested in everyone else’s learning.",
"\n\n3. ",
"Comments in Google Slides, Docs, etc. ",
"I’m a HUGE proponent of Google Apps/G Suite for its instant collaboration. ",
"I love creating a slide presentation and sharing it with students (giving everyone editing rights with the “Share” button). ",
"Each student gets a slide for his/her work. ",
"Students and the teacher can leave comments for each other. ",
"Plus, those comments are “nested” — you can reply to specific comments and keep that “conversation” separate from other comments.",
"\n\n4. ",
"The paper version of #3. ",
"Tech isn’t a necessity for instant feedback! ",
"Have students complete a task on paper. ",
"Then have them pass their papers to the student behind them. ",
"That student provides some pointed feedback (positive, constructive or both). ",
"Then pass to the student to the right. ",
"Then pass again. ",
"Return papers to their owners.",
"\n\n5. ",
"Post to social media. ",
"Looking for a bigger audience than the classroom? ",
"Have students copy sentences from their work (or take a photo of a paragraph) and post it to social media. ",
"Use hashtags to reach a larger audience. ",
"They can get feedback from whoever sees it. (",
"Note: Know that this opens them up to a broad audience that could abuse that privilege. ",
"But also know that people are generally good and inappropriate comments rarely happen.)",
"\n\n6. ",
"Provide online flashcards. ",
"There’s something to be said about flashcards even in a digital age. ",
"They still provide instant feedback. ",
"Using a tool like Quizlet lets students create their own flashcards — even for classes where the teacher might ask, “What’s a Quizlet???” ",
"Students can share flashcards with each other. (",
"Plus, when you have banks of Quizlet flashcards, you can create instant Quizlet Live games to do collaborative group practice in class!)",
"\n\n7. ",
"Do speed dating. ",
"Not real match-making in the classroom. ",
"The academic version. ",
"The way I’ve done it is to arrange chairs/desks in two circles — an inner circle facing out and an outer circle facing in. ",
"Give each pair of students a minute or so to talk and provide feedback. ",
"Then rotate. (",
"My wife calls the rotating group the “taters.” ",
"Middle school kids like to be taters.) ",
"You can even take a desk and be one of the stops in speed dating. (",
"Just don’t make any awkward dating comments to students, OK???)",
"\n\n8. ",
"Communicate in a backchannel like TodaysMeet.",
"TodaysMeet creates what’s essentially a private chat room for you and your students. ",
"Just making one of these available for students to use gives them a place to ask questions and trade ideas. ",
"Participate and monitor as the teacher as little or much as you decide.",
"\n\n9. ",
"Use Voxer for group or individual feedback.",
"Voxer is a digital walkie-talkie app. (",
"And more!) ",
"Voice feedback is often the fastest and easiest. ",
"Have students download the app and create an account. ",
"You can create a whole-class, large-group Voxer group or engage in one-on-one, private feedback with personal Voxer chats.",
"\n\n10. ",
"Bellringers, exit tickets and class polls. ",
"They’re a classroom staple — and for a reason! ",
"They still work. ",
"Do them on little slips of paper. ",
"Do a hands-up poll. ",
"Or find a digital tool to conduct them. ",
"The important part is that you ACT ON THEM. ",
"When you get data from them, make the feedback instant. ",
"Don’t wait until tomorrow.",
"\n\nQuestion: How do you provide instant feedback — digitally OR without tech? ",
"How important do you think instant feedback is? ",
"You can leave a comment by clicking here.",
"\n\nFor notifications of new Ditch That Textbook content and helpful links:\n\nRelated\n\nDisclosure of Material Connection: Some of the links in this post are affiliate links, and at no additional cost to you, I will earn a commission if you decide to make a purchase. ",
"If you decide to purchase, think of it as a way of supporting Ditch That Textbook without paying anything extra! ",
"I am disclosing this in accordance with the Federal Trade Commission’s 16 CFR, Part 255: “Guides Concerning the Use of Endorsements and Testimonials in Advertising.”",
"\n\nHi Matt. ",
"Thanks for the ideas! ",
"One effective, immediate, simple, low-tech feedback technique I use on a daily basis is “Honest Answers”. ",
"I ask all the students to cover their eyes, then I ask for an honest answer to my question(s), which might be, “Who thinks that they really understand this idea?” ",
"or Who is confused?”, ",
"or “Who might have some questions for me about this?” ",
"Because nobody can see their answers, the students feel safe to respond honestly and without embarrassment. ",
"For fun, I often ask a final question such as, “Who thinks ——is the best football team?”, ",
"or “Who thinks I’m the best looking teacher in Middle School?” (",
"I’ll let you imagine what the response to this one is…)\n\n[…] how should they be doing things. ",
"Instead of pointing out all negative aspects at once, try using a sandwich method. ",
"Give positive feedback, then point out something they could change, and then provide positive […]\n\nABOUT MATT\n\nMatt Miller\n\nDitch That Textbook is written by Matt Miller, a high school Spanish teacher in West Central Indiana. ",
"After trying to do the traditional \"teach by the textbook\" for a few years, he launched into a textbook-less path where learning activities were often custom-produced for his students as well as infused with technology. ",
"He likes the results a lot, and his students do, too. ",
"More about Matt »\n\nSPEAKING Matt speaks at schools, conferences and events about intentional technology use in the classroom. ",
"More details »\n\nTech Like a PIRATE! ",
"Add a techy spark to the passion, enthusiasm and flair promoted by \"Teach Like a PIRATE\" by Dave Burgess in this FREE EBOOK! ",
"Get your copy now!"
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006325783324427903,
0.014210964553058147,
0.015897557139396667,
0.0005904003046452999,
0.0005917788366787136,
0.0006564822979271412,
0.04218527302145958,
0.0009270855225622654,
0.000666106934659183,
0.5837909579277039,
0.0005692976992577314,
0.0006841752328909934,
0.0027015835512429476,
0.0008643166511319578,
0.0005160009604878724,
0.0008381290826946497,
0.000989257823675871,
0.0005883064586669207,
0.0005104325828142464,
0.0005501725245267153,
0.001943783601745963,
0.002140193013474345,
0.0010500651551410556,
0.002239696681499481,
0.0006355245714075863,
0.0010019729379564524,
0.0005788901471532881,
0.0006165342638269067,
0.0006370590999722481,
0.0035685282200574875,
0.0005251379334367812,
0.0007255026139318943,
0.0005872434703633189,
0.000701810116879642,
0.0006449330830946565,
0.0005752081633545458,
0.0007363475160673261,
0.0005902244593016803,
0.0009563504136167467,
0.0009152090060524642,
0.0009091400424949825,
0.0009641075739637017,
0.0008847048738971353,
0.0020031253807246685,
0.0005519429105333984,
0.0005234176060184836,
0.02433069422841072,
0.0008571860962547362,
0.0025624181143939495,
0.000556126527953893,
0.0005575523246079683,
0.000947637134231627,
0.00067287462297827,
0.0006916743004694581,
0.0006657616468146443,
0.0009137370507232845,
0.0005548973567783833,
0.01175894308835268,
0.001370044075883925,
0.0015213186852633953,
0.0006146778468973935,
0.0013274538796395063,
0.0007035991293378174,
0.002081124112010002,
0.0022298255935311317,
0.000578943407163024,
0.0009208591654896736,
0.001185585861094296,
0.0007410222897306085,
0.0006324662244878709,
0.0005348544218577445,
0.0006236501503735781,
0.0007667457102797925,
0.0005625007324852049,
0.0018022482981905341,
0.0006495784036815166,
0.0006184233352541924,
0.0006235457840375602,
0.0008981460705399513,
0.0006465510232374072,
0.0007176138460636139,
0.0020846067927777767,
0.0030710455030202866,
0.0005889853346161544,
0.0006053183460608125,
0.0006693887407891452,
0.00117425003554672,
0.0005977944238111377,
0.0005348888807930052,
0.0005413649487309158,
0.0006581420893780887,
0.0005902157863602042,
0.0006656207842752337,
0.0012900278670713305,
0.0006574452854692936,
0.0008859487716108561,
0.000633907679002732,
0.0008604323375038803,
0.0005294214934110641,
0.0007524319807998836,
0.0010493076406419277,
0.00067986297653988,
0.0013671480119228363,
0.0008227829821407795,
0.0008127184701152146,
0.0006380511331371963,
0.0007894856389611959,
0.0005484933499246836,
0.0006764837307855487,
0.0005977884866297245,
0.001202064217068255,
0.000675699848216027,
0.0006096258875913918,
0.000538528140168637,
0.0012783915735781193,
0.0005432904581539333,
0.0006864922470413148,
0.0013101339573040605,
0.001166342874057591,
0.0006634586025029421,
0.0006451605586335063,
0.0008582146256230772,
0.0005215413402765989,
0.0006613844307139516,
0.0009925776394084096,
0.03283219411969185,
0.0008290300611406565,
0.0010526753030717373,
0.0014581186696887016,
0.0009217080078087747,
0.0006263505783863366,
0.0005588117055594921,
0.0008800232317298651,
0.00135024543851614,
0.0006145445513539016,
0.000987981096841395,
0.0008510581683367491,
0.0005568877095356584,
0.0006631860742345452,
0.0006666998378932476,
0.0011672148248180747,
0.000822496076580137,
0.0033038805704563856,
0.0011239942396059632,
0.0010390367824584246,
0.004038671962916851,
0.0007043888326734304,
0.0009468731586821377,
0.0006040152511559427,
0.0027525953482836485,
0.000644570856820792,
0.0006520302849821746,
0.0005542577710002661,
0.0005665232893079519,
0.0011691488325595856,
0.0005897645023651421,
0.0009622799698263407,
0.0005813603638671339,
0.0005746878450736403,
0.0022900148760527372,
0.0008543989388272166,
0.0007143924594856799,
0.0008740758057683706,
0.0006478084251284599,
0.0008391995797865093,
0.000702669785823673,
0.0007251221686601639,
0.0006275689811445773,
0.0005904802237637341,
0.0006645375397056341,
0.0005653001717291772,
0.003611357184126973,
0.0009436485706828535,
0.031394898891448975
] | 0.005259 | 174 |
[
"You are here\n\nSuspect charged in Friday's lakefront manhunt\n\nPolice say one of two men taken into custody Friday after a yard-to-yard search near Evanston's lakefront now has been charged with weapons violations.",
"\n\nAntoine Sanders, 21, of 7015 N. Paulina Ave. ",
"in Chicago, was charged with unlawful use of a weapon by a felon and possession of ammunition without a firearm owners ID card.",
"\n\nPolice say Sanders was one of three men who bailed out of a car on Greenwood Street near Judson Avenue shortly before 11 a.m. Friday morning.",
"\n\nThe car had been identified minutes earlier as having been involved in an incident in which shots were fired near Gale Elementary School in Rogers Park.",
"\n\nPolice say they recovered a .40 caliber semi-automatic handgun from the vehicle that Sanders had been riding in, and another .40 caliber handgun was located in the 1300 block of Forest Avenue during the search.",
"\n\nPolice released the second subject in custody without charges on Sunday. ",
"A third subject who fled the vehicle has not been apprehended or identified.",
"\n\nPolice have submitted the recovered firearms for latent fingerprints to the Illinois State Police Crime Lab in hopes of identifying the third offender and linking Sanders along with the second subject, who is currently on parole, to the recovered weapons.",
"\n\nSanders is scheduled to appear in Skokie district court at 9 a.m. June 18."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0013201608089730144,
0.0008907706360332668,
0.0046918210573494434,
0.0009874136885628104,
0.0013660696567967534,
0.0006391515489667654,
0.000750117702409625,
0.0007136630592867732,
0.0006352929631248116,
0.0009318400989286602
] | 0.001293 | 10 |
[
"Check out our new site Makeup Addiction\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nadd your own caption\n\nSneezed while taking a piss this morning didn't shit myself"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.7852897644042969
] | 0.78529 | 1 |
[
"//args: -Egofumpt\n//config: linters-settings.gofumpt.extra-rules=true\npackage testdata\n\nimport \"fmt\"\n\nfunc GofmtNotExtra(bar string, baz string) { // ERROR \"File is not `gofumpt`-ed with `-extra`\"\n\tfmt.",
"Print(\"foo\")\n}\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.005775353871285915,
0.0007058053161017597
] | 0.003241 | 2 |
[
"6, -175, -116, -23, 110?",
"\n289\nWhat is next in -201, -402, -603, -804, -1005?",
"\n-1206\nWhat is next in 97, 142, 201, 280, 385, 522, 697?",
"\n916\nWhat comes next: 18, 37, 102, 237, 466, 813, 1302?",
"\n1957\nWhat comes next: 54, 109, 160, 207?",
"\n250\nWhat is next in -13, -4, 3, 2, -13, -48?",
"\n-109\nWhat comes next: -92, -174, -244, -296, -324, -322, -284, -204?",
"\n-76\nWhat comes next: -38, -52, -42, -2, 74?",
"\n192\nWhat is next in -43, -74, -105, -136?",
"\n-167\nWhat is next in 7, 42, 103, 202, 351, 562, 847?",
"\n1218\nWhat is the next term in -20406, -20404, -20402, -20400, -20398?",
"\n-20396\nWhat is next in -17, -35, -69, -119, -185?",
"\n-267\nWhat comes next: -951, -952, -953, -954, -955, -956?",
"\n-957\nWhat is the next term in 167, 189, 211, 233?",
"\n255\nWhat is the next term in 442, 878, 1314, 1750?",
"\n2186\nWhat comes next: 50821, 50832, 50857, 50902, 50973?",
"\n51076\nWhat is the next term in 20, 41, 74, 125, 200?",
"\n305\nWhat is next in -1371, -1370, -1369?",
"\n-1368\nWhat is the next term in 50, 203, 464, 833?",
"\n1310\nWhat comes next: 747, 741, 725, 693, 639, 557?",
"\n441\nWhat comes next: -1125, -1127, -1131, -1137, -1145?",
"\n-1155\nWhat is the next term in 4, 35, 122, 289, 560?",
"\n959\nWhat comes next: -201, -399, -599, -801, -1005, -1211, -1419?",
"\n-1629\nWhat comes next: 7504, 7503, 7502, 7501, 7500, 7499?",
"\n7498\nWhat comes next: 22, 45, 72, 103, 138?",
"\n177\nWhat comes next: -122, -482, -1088, -1946, -3062, -4442?",
"\n-6092\nWhat comes next: 60, 135, 208, 279, 348, 415, 480?",
"\n543\nWhat is next in 134, 137, 142, 149, 158, 169, 182?",
"\n197\nWhat is next in -3579, -3581, -3583?",
"\n-3585\nWhat is next in -17, -21, -21, -11, 15, 63, 139, 249?",
"\n399\nWhat is the next term in 1574, 1583, 1604, 1643, 1706?",
"\n1799\nWhat is next in 388, 387, 386?",
"\n385\nWhat is the next term in -72, -129, -176, -207, -216, -197, -144?",
"\n-51\nWhat comes next: 333, 669, 1003, 1335?",
"\n1665\nWhat is the next term in 5131, 10261, 15391, 20521, 25651?",
"\n30781\nWhat comes next: -4745, -4744, -4743?",
"\n-4742\nWhat is the next term in 30, 58, 86?",
"\n114\nWhat is the next term in -17, -54, -107, -170, -237, -302, -359?",
"\n-402\nWhat comes next: 30, 71, 112, 153, 194?",
"\n235\nWhat is the next term in -26, -54, -96, -158, -246, -366?",
"\n-524\nWhat comes next: 13, 31, 61, 103, 157, 223?",
"\n301\nWhat is the next term in 14, 18, 20, 20, 18?",
"\n14\nWhat is next in -3, 23, 75, 159, 281, 447, 663, 935?",
"\n1269\nWhat comes next: 15, 32, 49?",
"\n66\nWhat is next in 31, 23, 17, 13?",
"\n11\nWhat is next in -39, -67, -93, -117, -139?",
"\n-159\nWhat comes next: 35, 60, 87, 116?",
"\n147\nWhat is the next term in 14826, 29649, 44472, 59295?",
"\n74118\nWhat comes next: 16, 27, 36, 43, 48, 51?",
"\n52\nWhat is the next term in 120, 221, 322?",
"\n423\nWhat is next in -1, -9, -17, -25, -33?",
"\n-41\nWhat is next in -53, -50, -35, -2, 55, 142?",
"\n265\nWhat comes next: -208, -195, -160, -91, 24, 197, 440?",
"\n765\nWhat is the next term in 2, 3, -2, -19, -54, -113?",
"\n-202\nWhat comes next: -13, -27, -49, -79, -117?",
"\n-163\nWhat comes next: 97, 94, 89, 82?",
"\n73\nWhat is the next term in -1, 19, 47, 83, 127, 179, 239?",
"\n307\nWhat is next in 5, 19, 57, 131, 253, 435, 689, 1027?",
"\n1461\nWhat comes next: 301, 310, 327, 358, 409, 486, 595, 742?",
"\n933\nWhat comes next: 10, 64, 122, 184, 250, 320?",
"\n394\nWhat is the next term in -190, -192, -194, -196?",
"\n-198\nWhat is next in 9, 20, 53, 120, 233, 404, 645, 968?",
"\n1385\nWhat is the next term in 128, 118, 96, 56, -8, -102, -232, -404?",
"\n-624\nWhat is next in 5, -8, -23, -40?",
"\n-59\nWhat is the next term in -48, -76, -114, -162, -220, -288?",
"\n-366\nWhat is next in 34, 61, 134, 277, 514?",
"\n869\nWhat is next in -412, -832, -1252, -1672?",
"\n-2092\nWhat is the next term in 145, 592, 1337, 2380?",
"\n3721\nWhat comes next: 3277, 3288, 3311, 3352, 3417?",
"\n3512\nWhat is the next term in -108, -237, -366?",
"\n-495\nWhat is the next term in 17, 19, 13, -7, -47, -113, -211?",
"\n-347\nWhat comes next: -129, -135, -141, -147?",
"\n-153\nWhat is the next term in -159, -171, -183, -195, -207, -219?",
"\n-231\nWhat comes next: -797, -795, -793, -791, -789?",
"\n-787\nWhat comes next: -35, -125, -215, -305, -395?",
"\n-485\nWhat comes next: -10612, -10616, -10620?",
"\n-10624\nWhat is the next term in 173, 1443, 4889, 11597, 22653, 39143, 62153?",
"\n92769\nWhat comes next: 3653, 7314, 10975, 14636, 18297, 21958?",
"\n25619\nWhat is the next term in 38, 103, 238, 479, 862?",
"\n1423\nWhat comes next: 3, 13, 43, 105, 211, 373, 603?",
"\n913\nWhat comes next: 50, 391, 1308, 3089, 6022?",
"\n10395\nWhat comes next: -28, 15, 58, 101, 144?",
"\n187\nWhat is next in 8576, 17151, 25726?",
"\n34301\nWhat is next in 179, 195, 231, 293, 387?",
"\n519\nWhat is next in -57, -106, -155, -204?",
"\n-253\nWhat is next in -651, -1307, -1965, -2625, -3287?",
"\n-3951\nWhat is the next term in 38, 334, 1150, 2744, 5374, 9298, 14774, 22060?",
"\n31414\nWhat is next in 869, 881, 907, 953, 1025, 1129?",
"\n1271\nWhat comes next: 1, -10, -31, -62, -103?",
"\n-154\nWhat comes next: -398, -392, -386, -380?",
"\n-374\nWhat is next in -36, -153, -348, -621, -972?",
"\n-1401\nWhat is the next term in -62, -103, -144?",
"\n-185\nWhat comes next: 26, 22, 20, 20, 22, 26?",
"\n32\nWhat is the next term in 128, 99, 60, 5, -72, -177, -316, -495?",
"\n-720\nWhat is next in -82, -335, -756, -1345?",
"\n-2102\nWhat is next in 4, 10, 24, 46, 76?",
"\n114\nWhat is the next term in -62, -126, -190, -254, -318?",
"\n-382\nWhat is the next term in -9, -14, -17, -18, -17?",
"\n-14\nWhat is the next term in 213, 219, 209, 177, 117?",
"\n23\nWhat comes next: -57, -71, -99, -147, -221, -327, -471?",
"\n-659\nWhat is next in 13, 24, 35, 46, 57?",
"\n68\nWhat is next in -26, -72, -200, -452, -870, -1496, -2372, -3540?",
"\n-5042\nWhat is the next term in -137, -269, -401, -533, -665, -797?",
"\n-929\nWhat comes next: -30, -37, -44, -51, -58?",
"\n-65\nWhat is next in -37, -42, -49, -58, -69?",
"\n-82\nWhat is the next term in -78, -87, -102, -123, -150?",
"\n-183\nWhat is the next term in 29, 45, 85, 161, 285?",
"\n469\nWhat is next in -17, -5, -3, -17, -53, -117?",
"\n-215\nWhat comes next: 131, 118, 115, 128, 163?",
"\n226\nWhat is the next term in -83, -160, -237, -314?",
"\n-391\nWhat comes next: 46, 252, 596, 1078, 1698, 2456?",
"\n3352\nWhat is next in 2, 20, 46, 86, 146?",
"\n232\nWhat is the next term in -109, -129, -163, -217, -297, -409?",
"\n-559\nWhat is next in -7, -28, -59, -100, -151, -212, -283?",
"\n-364\nWhat is the next term in -41, -53, -77, -119, -185, -281?",
"\n-413\nWhat is next in -169, -346, -521, -694, -865, -1034?",
"\n-1201\nWhat is the next term in 1, 10, 19, 28, 37, 46?",
"\n55\nWhat is next in -466, -919, -1386, -1873, -2386, -2931, -3514, -4141?",
"\n-4818\nWhat is the next term in -34, -68, -102, -136?",
"\n-170\nWhat is next in -124, -186, -246, -304, -360, -414, -466?",
"\n-516\nWhat comes next: 1429, 1422, 1409, 1390, 1365, 1334, 1297?",
"\n1254\nWhat is next in -15233, -30466, -45699, -60932?",
"\n-76165\nWhat is next in 149, 305, 471, 653, 857, 1089, 1355, 1661?",
"\n2013\nWhat comes next: 96, 83, 58, 15, -52?",
"\n-149\nWhat comes next: -40, -55, -84, -133, -208?",
"\n-315\nWhat is next in -179, -178, -177, -176, -175?",
"\n-174\nWhat is next in 28, 83, 130, 163, 176, 163, 118?",
"\n35\nWhat comes next: -50696, -50695, -50694?",
"\n-50693\nWhat is the next term in 250, 1973, 6648, 15751, 30758, 53145, 84388?",
"\n125963\nWhat comes next: -69, -139, -209?",
"\n-279\nWhat comes next: -237, -919, -2049, -3621, -5629, -8067, -10929, -14209?",
"\n-17901\nWhat is next in -166, -192, -216, -238, -258, -276?",
"\n-292\nWhat is the next term in -114, -240, -366, -492?",
"\n-618\nWhat is next in -3, -10, -21, -36, -55, -78, -105?",
"\n-136\nWhat is the next term in 16, 146, 364, 670, 1064, 1546, 2116?",
"\n2774\nWhat is next in 116, 117, 118, 119, 120?",
"\n121\nWhat comes next: -81, -165, -235, -285, -309, -301, -255, -165?",
"\n-25\nWhat is the next term in 7, 23, 43, 67, 95, 127, 163?",
"\n203\nWhat comes next: 2, 4, -14, -58, -134, -248?",
"\n-406\nWhat is the next term in -117, -232, -347?",
"\n-462\nWhat is the next term in -887, -888, -889?",
"\n-890\nWhat is next in 70, 85, 122, 193, 310?",
"\n485\nWhat is next in -48, -187, -426, -771, -1228?",
"\n-1803\nWhat comes next: 247, 487, 721, 949, 1171?",
"\n1387\nWhat comes next: 733, 1466, 2199, 2932?",
"\n3665\nWhat comes next: -13, -38, -77, -136, -221, -338, -493?",
"\n-692\nWhat is the next term in -1642, -1642, -1640, -1636, -1630, -1622?",
"\n-1612\nWhat is next in -81, -141, -201, -261?",
"\n-321\nWhat comes next: 356, 707, 1048, 1373, 1676, 1951, 2192, 2393?",
"\n2548\nWhat comes next: -781, -776, -771, -766, -761?",
"\n-756\nWhat comes next: -8, -28, -62, -110, -172, -248?",
"\n-338\nWhat is next in 30626, 30627, 30630, 30635, 30642, 30651, 30662?",
"\n30675\nWhat comes next: 47, 47, 49, 53, 59?",
"\n67\nWhat is the next term in -128, -259, -390, -521, -652, -783?",
"\n-91"
] |
{
"pile_set_name": "DM Mathematics"
}
|
[
0.0009591815178282559,
0.0007764964830130339,
0.000800088222604245,
0.0009806836023926735,
0.0007903026416897774,
0.0008889756281860173,
0.0006689824513159692,
0.0010220234980806708,
0.0008753451402299106,
0.0008720322512090206,
0.0009566606604494154,
0.000911735522095114,
0.0012071685632690787,
0.0009172653662972152,
0.0008376995101571083,
0.001015792484395206,
0.0008772822329774499,
0.0008319921907968819,
0.0008300514309667051,
0.0008595723775215447,
0.0008763360674493015,
0.0007055088062770665,
0.0012362129054963589,
0.0008542173309251666,
0.0009384177392348647,
0.0008504829602316022,
0.0007272511720657349,
0.000989308813586831,
0.0008597078849561512,
0.0009627091349102557,
0.0007974503678269684,
0.0009146646480076015,
0.0008586456533521414,
0.0008910520118661225,
0.0007171246688812971,
0.000968698353972286,
0.0008554437081329525,
0.0008947686874307692,
0.0008228605729527771,
0.0009511857642792165,
0.0008609613869339228,
0.0009084991761483252,
0.0008942942367866635,
0.0008989854250103235,
0.0008697555749677122,
0.0008899324457161129,
0.0009254383039660752,
0.0007678852416574955,
0.0009605954401195049,
0.0007494435994885862,
0.0009344767895527184,
0.0009069843799807131,
0.0008743384969420731,
0.0009918224532157183,
0.0011109424522146583,
0.0008836219785735011,
0.0009221226209774613,
0.0008296191808767617,
0.0007347377249971032,
0.000900472397916019,
0.0009454357204958797,
0.0009021922014653683,
0.0009133679559454322,
0.000962647667620331,
0.0009343948331661522,
0.0009480142034590244,
0.0008259986061602831,
0.0009091781685128808,
0.0007539873477071524,
0.0008077968959696591,
0.0008574679377488792,
0.0009970261016860604,
0.0009302004473283887,
0.0014968898613005877,
0.0009810288902372122,
0.0009539383463561535,
0.0009616572060622275,
0.0009316510404460132,
0.0009681240189820528,
0.0010018788743764162,
0.0009459384600631893,
0.0009450552752241492,
0.0007175460923463106,
0.0009221656946465373,
0.0009062518365681171,
0.0009251958108507097,
0.000804703333415091,
0.0010242268908768892,
0.0009316697833128273,
0.000955223455093801,
0.0010527379345148802,
0.000813035003375262,
0.001151649747043848,
0.0008345231181010604,
0.0007645268924534321,
0.0008912464836612344,
0.0008715699077583849,
0.001021472504362464,
0.0009075276902876794,
0.0009927110513672233,
0.0009546275832690299,
0.0009487424395047128,
0.0007960173534229398,
0.0011023717233911157,
0.0010146816493943334,
0.0008638037252239883,
0.0007962316740304232,
0.0010167757282033563,
0.000876012200023979,
0.0007890114211477339,
0.0009709029109217227,
0.0009394747321493924,
0.00088884262368083,
0.0008859800291247666,
0.0009235654724761844,
0.0009591015405021608,
0.0009627288090996444,
0.0009198221960105002,
0.0008720367914065719,
0.0010328551288694143,
0.0008768999250605702,
0.0009898942662402987,
0.001004630234092474,
0.0006955352728255093,
0.0010983934625983238,
0.0008860307279974222,
0.001028779661282897,
0.0012747711734846234,
0.0007795338751748204,
0.0010596617357805371,
0.001003805547952652,
0.0008468892192468047,
0.0007851757691241801,
0.0009728145087137818,
0.0008345529204234481,
0.0009210364078171551,
0.0007700459100306034,
0.0008896327344700694,
0.001119933440349996,
0.0007931272848509252,
0.0009171260171569884,
0.000809060235042125,
0.000992425950244069,
0.000820841290988028,
0.0009152570273727179,
0.0009315534261986613,
0.0007085313554853201,
0.0007433528662659228,
0.0006932654068805277,
0.0011633996618911624,
0.0010943948291242123,
0.0006523366901092231,
0.0009059087024070323,
0.0007937449845485389,
0.0008139562560245395
] | 0.000909 | 155 |
[
"Cool Stuff\n\nA concept Super7 has been batting around for a couple of years has been realized and now we can add some subtle and sophisticated Star Wars awesomeness to any room in your house. ",
"Follow this link to check out the product page for their Imperial Forces Wallpaper and stay tuned for future announcements.",
"\n\nApril 13th, 2018, the big day for Lucasfilm's International Solo: A Star Wars Story product launch. ",
"Our reprogrammed Imperial Probe Droid has been tasked to see where all the stuff is. ",
"You can help by let it know how successful the day was for you."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006834620144218206,
0.0005510783521458507,
0.0006342112901620567,
0.0009666493278928101,
0.0005593948881141841
] | 0.000679 | 5 |
[
"Self-focused attention and emotional reactivity: the role of culture.",
"\nResearch conducted with European Americans suggests that attention to the individual self intensifies emotional reactivity. ",
"We propose, however, that cultural models of the self determine which aspect of the self (individual vs. relational), when attended to, intensifies emotional reactivity. ",
"In 3 studies, we predicted and observed that attention to individual aspects of the self was associated with levels of emotional reactivity that were greater in individuals from European American contexts (which promote an independent model of the self) than in individuals from Asian American contexts (which promote an interdependent model of the self). ",
"In contrast, attention to relational aspects of the self was associated with levels of emotional reactivity that were similar or greater in individuals from Asian American than in individuals from European American contexts. ",
"These findings highlight the importance of considering cultural and situational factors when examining links between the self and emotion."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.000570968899410218,
0.0005910193431191146,
0.0005840141675435007,
0.0005525537417270243,
0.0006366354646161199,
0.0005671529797837138
] | 0.000584 | 6 |
[
"Q:\n\nregisterOnSharedPreferenceChangeListener Stops getting called after some time\n\nI have a sharedPreference that that gets updated continuously (around every second)from a Class which extends BroadcastReceiver.",
"\nThe first few times, the registerOnSharedPreferenceChangeListener gets called, but after a while, it stops getting called(I dont even press any button on my emulator).",
"\nI know that the sharedPreference is still getting updated because I have seen my log. ",
"It is a problem with the registerOnSharedPreferenceChangeListener.",
"\nThis is the code for the listener(using the suggestion from here)\nMy shared preference is getting updated almost once every second. ",
"\nHere is the code for my listener:\nSharedPreferences.",
"OnSharedPreferenceChangeListener listener=new SharedPreferences.",
"OnSharedPreferenceChangeListener() {\n @Override\n public void onSharedPreferenceChanged(SharedPreferences sharedPreferences,\n String key) {\n // TODO Auto-generated method stub\n if(key==\"TIME\")\n {\n Log.v(\"Tagger\",\"Value has changed\");\n long L=-2;\n if(sharedPreferences.contains(\"TIME\"))\n {\n L=sharedPreferences.getLong(\"TIME\", 0);\n\n long HH=(L/1000)/3600; \n long MM=((L/1000)/60)%60;\n long SS=(L/1000)%60;\n MILLIS-=1000;\n mainHH.setText(Long.toString(HH));\n mainMM.setText(Long.toString(MM));\n mainSS.setText(Long.toString(SS));\n }\n\n if(L<=0)\n {\n Editor edit=sharedPreferences.edit();\n edit.remove(\"TIME\");\n edit.commit();\n\n Log.v(\"VALUE\",Long.toString(454L));\n Intent intent = new Intent(getApplicationContext(), TimerAlarmReceiver.class);\n PendingIntent pendingIntent = PendingIntent.getBroadcast(getApplicationContext(), 0, intent, 0);\n TimerAlarmReceiver.alarmMgr = (AlarmManager)getSystemService(Context.",
"ALARM_SERVICE);\n TimerAlarmReceiver.alarmMgr.cancel(pendingIntent);\n start.setText(\"Start the Test?\");",
"\n TimerOn=false;\n\n edit.putBoolean(\"TimerOn\", TimerOn);\n edit.commit();\n }\n }\n }};\n sharedPreferences.registerOnSharedPreferenceChangeListener(listener);\n\nI have provided the full code because something else might be the problem.",
"\nEDIT::\nhere is my BroadcastReceiver class\npublic class TimerAlarmReceiver extends BroadcastReceiver { \n public static long TIME;\n public static Boolean TimerOn=false;\n public static AlarmManager alarmMgr ;\n @Override\n public void onReceive(Context context, Intent intent) {\n\n //Toast.makeText(context, \"Alarm went off\", Toast.",
"LENGTH_SHORT).show(); \n\n /* SharedPreferences sharedPreferences = PreferenceManager\n .getDefaultSharedPreferences(context);\n Editor editor = sharedPreferences.edit();\n editor.putLong(key, value);\n editor.commit();*/\n\n SharedPreferences time = PreferenceManager\n .getDefaultSharedPreferences(context);\n long T = time.getLong(\"TIME\",594554L);\n\n Editor editor=time.edit();\n editor.putLong(\"TIME\", T-1000);\n editor.commit();\n\n Log.v(\"Tag\", Long.toString(T));\n //this gets updated and i can see the new values of T\n }\n\n public static void setTime(long T)\n {\n TIME=TimerActivity.",
"DMILLIS;\n }\n}\n\nA:\n\nOnSharedPreferenceChangeListeners are registered via weak reference. ",
"Make sure you keep a reference to the listener by setting it to an instance variable.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0006469162763096392,
0.0007034249138087034,
0.0005866239662282169,
0.0011694901622831821,
0.0005860318196937442,
0.0006525882054120302,
0.0007747026393190026,
0.0012333361664786935,
0.0006571781123057008,
0.001895595109090209,
0.0010853310814127326,
0.0010266477474942803,
0.0007275641546584666,
0.0005840726080350578,
0.001995444530621171
] | 0.000955 | 15 |
[
"Weezer have shared the video for “Can’t Knock the Hustle,” the first single from their forthcoming Black Album, due out in 2019 through Crush Music/Atlantic Records.",
"\n\nThe song, produced by TV on the Radio’s Dave Sitek, is that rarest of things: a Weezer disco song. ",
"Squelching clavinets, tight drum rhythms and Rivers Cuomo at his David Byrne-iest: all that and more in this strange (and strangely propulsive) pop song.",
"\n\nThe video embraces the band’s newfound meme-master status with a video courtesy of FuckJerry’s media production channel. (",
"Yes, you read that right.) ",
"The video stars errant fall-out boy Pete Wentz—billed as “Rivers Wentz”—as an Uber driver with a pair of unruly passengers and a texting fling with a hot librarian, coincidentally also named Rivers. ",
"Things devolve, naturally, and, with the help of a well-placed spork attack, the ride becomes a bloodbath. ",
"This, following the band’s cover of meme-anthem “Africa” by Toto, finds the band having a bit more self-awareness in regards to the ridiculousness of being a “rock star” in the 21st century.",
"\n\nWatch the video for “Can’t Knock the Hustle” below. ",
"Weezer will be hitting the road again next spring with the Pixies—the full list of dates can be found further down.",
"\n\nWeezer & Pixies 2019 Tour Dates:\n\nMarch\n\n08 – Louisville, Ky. @ KFC Yum! ",
"Center\n\n10 – Columbia, S.C. @ Colonial Life Arena\n\n11 – Montreal, Que. @ ",
"Bell Centre\n\n14 – Albany, N.Y. @ Times Union Center\n\n16 – Mashantucket, Conn. @ Foxwoods Resort Casino\n\n17 – Baltimore, Md. @ Royal Farms Arena\n\n19 – Columbus, Ohio @ Schottenstein Center\n\n20 – Grand Rapids, Mich. @ Van Andel Arena\n\n22 – Memphis, Tenn. @ FedEx Forum\n\n24 – St. Louis, Mo. @ Enterprise Center\n\n26 – Kansas City, Mo. @ Sprint Center\n\n27 – Tulsa, Okla. @ BOK Center\n\n28 – Des Moines, Iowa @ Wells Fargo Arena\n\n30 – St. Paul, Minn. @ Xcel Energy Center\n\n31 – Madison, Wis. @ Alliant Energy Center\n\nApril\n\n05 – Nampa, Idaho @ Ford Idaho Center Arena\n\n06 – Portland, Ore. @ Moda Center\n\n07 – Vancouver, B.C. @ Rogers Arena\n\n09 – Sacramento, Calif. @ Golden 1 Center\n\n10 – Oakland, Calif. @ Oracle Arena\n\n12 – Las Vegas, Nev. @ Mandalay Bay Event Center"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0012523207115009427,
0.001408880576491356,
0.0008599184220656753,
0.7172021269798279,
0.0006068317452445626,
0.13303369283676147,
0.04323031008243561,
0.002008320763707161,
0.02543165162205696,
0.0026004109531641006,
0.0014297099551185966,
0.0006323574343696237,
0.0008912838529795408
] | 0.071584 | 13 |
[
"\n333 S.W.2d 63 (1960)\nSTATE of Missouri, Respondent,\nv.\nVerla Jane PINKSTON, Appellant.",
"\nNo. ",
"47564.",
"\nSupreme Court of Missouri, Division No. ",
"2.",
"\nMarch 14, 1960.",
"\n*64 Melvin E. Carnahan, Breuer, Northern & Crow, Rolla, for appellant.",
"\nJohn M. Dalton, Atty. ",
"Gen., Robert T. Donnelly, Sp. ",
"Asst. ",
"Atty. ",
"Gen., for respondent.",
"\nEAGER, Judge.",
"\nDefendant was charged by information with first degree murder, convicted by a jury of second degree murder, and sentenced to thirty-five years' imprisonment. ",
"The deceased was her husband, Frank Pinkston. ",
"Defendant and deceased operated a tavern on Highway 66 in Phelps County, known as \"Club 66\"; it contained a bar and dance floor, with living quarters in the rear. ",
"The shooting occurred in the living quarters. ",
"Since the only two points of error appearing in the brief involve remarks and conduct of the trial judge, no detailed recital of all the evidence will be necessary.",
"\nThe killing occurred on November 5, 1957, at about 11:30 p. m. Defendant had been away from the tavern all evening, and at least much of the day; the deceased had been in and out, but he had gone to bed early in the evening. ",
"Defendant returned shortly prior to the shooting, drank all or part of a beer at the bar, and then proceeded back into the living quarters. ",
"She was followed by a friend and relative, Catherine Gollahon and, a little later, by deceased's brother Wallace Pinkston, who had been tending bar. ",
"It was shown that a .22 caliber automatic pistol had been lying on a shelf near the head of deceased, as he lay in bed. ",
"Wallace Pinkston testified that he saw *65 defendant shoot deceased twice with that pistol, she remarking at the time, in somewhat opprobrious language, that she would kill him. ",
"The testimony of Catherine will be referred to separately. ",
"There was much other evidence, direct and circumstantial, accusatory and defensive, but it all went to the jury issue, and we are not concerned with it here.",
"\nCatherine Gollahon, testifying for the State, was obviously a reluctant witness. ",
"She had told the special prosecutor that she would rather not discuss the case until she was \"called to the witness stand.\" ",
"In substance, her testimony was: that she saw the defendant, Jane, switch on the light in the bedroom; that she (the witness) turned to set her purse down, and that when she looked back saw Jane jerk the covers off deceased and saw a gun in Jane's hand pointed toward the floor; that \"someone whizzed by me,\" and she heard \"Wally scream `Jane'\"; that she then screamed and ran out; that the only shot she heard was the one which Wally (the brother) fired into the soda pop cooler as he came out through the storeroom. ",
"This last shot was explained by \"Wally\" to have resulted from his nervousness after he took the gun from Jane. ",
"Catherine testified specifically that she did not see Jane fire two shots into her husband; also, that she did not tell Trooper Reynolds that \"Wally came through the door as Jane fired twice at Pinky\" (deceased), although she talked to Trooper Reynolds and told him what she knew.",
"\nThe State then produced Trooper G. M. Reynolds of the Highway Patrol. ",
"He arrived at the scene of the shooting about an hour after it occurred; he took the pistol, and he and the Sheriff found four empty shells, but there was considerable confusion and they did not get much information of value at the time. ",
"He testified: that Jane fell off a stool while he was there and apparently lost consciousness; that she later regained consciousness and talked \"pretty wildly,\" but said \"I love him, I shot him. ",
"I don't want him to die\"; that since he and the Sheriff couldn't get \"too much\" out of Catherine that night, he and the Deputy Sheriff talked with her the next day at the home of Jane's mother; that Jane was there, so they took Catherine out to his car where she \"told the whole story\"; that she made the statement that \"I screamed for Wally and Wally came through the door as Jane fired twice at Pinky. ",
"Pinky twisted and fell partly off the bed. ",
"Wally grabbed Jane and wrestled for the gun.\" (",
"Counsel at this point was reading from a memo stated to be in counsel's own handwriting.) ",
"The witness further testified that he had \"copied\" these words down as \"she said them,\" asking her to go slowly. ",
"He did not testify that she signed any statement. ",
"On cross-examination of Trooper Reynolds, defense counsel referred to the \"statement that she made\" and asked the witness if he had a copy, to which he replied that he did not \"have it with me\"; almost immediately, however, he said \"It's not a statement, it's what she told me * * * It's incorporated in my report.\" ",
"He was then asked \"Where is your report?\" ",
"and he stated that it was \"in the Highway Patrol.\" ",
"When asked if there was such a \"statement on file\" he replied in the affirmative, but he also said he believed that the words attributed to Catherine, as quoted above, were taken from the Patrol Report, but not by him. ",
"Counsel for defendant at this point requested that a subpoena be issued for \"those records,\" and the witness stated that the original report had been sent to Jefferson City but that a copy had been retained at Troop Headquarters. ",
"A recess was declared, and the witness was then sent to Troop Headquarters to get the copy, after further specific discussion between the court and the special prosecutor to the effect that the \"originals\" were not there. ",
"When the witness returned, the cross-examination was resumed; counsel for defendant announced to the witness that he had not produced, \"as requested, the statement\" taken from Catherine; the witness again said that there was no signed statement, and \"that's the only statement * * * made to me\"; counsel stated: \"I'm talking about the *66 statement that you said you wrote down * * *\"; the witness answered that her statement was incorporated in his report, and counsel again insisted that \"you haven't brought to me the writing you put down.\" ",
"At this stage the court intervened to say, in substance, that it was made clear in the previous testimony that there was only a typewritten copy of the report at the Troop Headquarters, that counsel so understood when he asked that a recess be declared and that the witness be sent there, and that counsel should \"proceed\" with this cross-examination. ",
"To a further question the witness said that he had no idea where the handwritten report or copy was. ",
"After the witness testified on re-direct examination that the portion of the report in question was \"verbatim from * * * the handwritten copy,\" counsel for defendant moved for a mistrial because of the comments of the court and the reprimand of counsel, saying that it was not his understanding that the witness was \"talking about any typewritten report.\" ",
"This motion was denied and the court had the reporter read the prior testimony to counsel, out of the presence of the jury.",
"\nThe two points made here may be considered together. ",
"These are, in substance, that the court departed from the traditional and required attitude of impartiality by reprimanding, rebuking and arguing with counsel, of its own volition and not in response to any ruling or objection, and that it displayed an attitude of impatience and annoyance at counsel which indicated that it \"was favorable to the prosecution\" and thus prejudiced the defendant in the minds of the jury. ",
"The cases cited by defendant will be mentioned in our discussion, along with various others. ",
"On such a subject, it is seldom that a case precisely in point is found. ",
"The governing principles, however, are well established. ",
"The trial court must remain wholly impartial as between the parties and it should not indicate, directly or indirectly, a belief in the guilt or innocence of the accused; counsel must be treated fairly, and the court should not so act as to humiliate or embarrass counsel. ",
"State v. Castino, Mo., 264 S.W.2d 372; State v. Montgomery, 363 Mo. 459, 251 S.W. 2d 654; State v. Hudson, 358 Mo. 424, 215 S.W.2d 441; State v. Moore, Mo., 303 S.W. 2d 60; State v. Jones, Mo., 197 S.W. 156; State v. Bunton, 312 Mo. 655, 280 S.W. 1040; State v. Teeter, 239 Mo. 475, 144 S.W. 445. ",
"But, on the other hand, it is the duty of the court to maintain order and decorum, to exercise a general control over the trial, to protect witnesses from abuse and intimidation, and to keep the inquiry within legitimate issues and within the applicable rules of law. ",
"To effectuate these purposes it may correct or reprimand counsel, when necessary. ",
"State v. Hudson, 358 Mo. 424, 215 S.W.2d 441; State v. Montgomery, 363 Mo. 459, 251 S.W.2d 654; State v. Brotherton, Mo., 266 S.W.2d 712; State v. Barnes, 325 Mo. 545, 29 S.W.2d 156; State v. Powell, Mo.App., ",
"55 S.W.2d 334; State v. Stillman, Mo., 310 S.W.2d 886. ",
"Not every exhibition of \"impatience\" will constitute reversible error, for we are all human. ",
"State v. Turner, Mo., 320 S.W. 2d 579; State v. Barnholtz, Mo., 287 S.W. 2d 808; State v. Atkins, Mo., 292 S.W. 422; State v. Powell, Mo.App., ",
"55 S.W.2d 334; State v. Hudson, 358 Mo. 424, 215 S.W.2d 441. ",
"Especially is this true where there has been no demonstrable prejudice of the defendant's interests through some indication that the court believes him guilty. ",
"State v. Atkins, supra; State v. Turner, Mo., 320 S.W.2d 579; State v. Barnholtz, Mo., 287 S.W.2d 808; State v. Powell, Mo. App., ",
"55 S.W.2d 334; State v. Brotherton, Mo., 266 S.W.2d 712. ",
"Trial courts are and must necessarily be invested with a large discretion in such matters. ",
"State v. Thursby, Mo., 245 S.W.2d 859; State v. Turner, Mo., 320 S.W.2d 579; State v. Barnes, 325 Mo. 545, 29 S.W.2d 156. ",
"Defendant mildly criticizes the application of this rule of \"discretion,\" saying that \"remarks of trial judges are often glossed over * *\" by the appellate courts. ",
"The vesting of a reasonable discretion in the trial courts is a matter lying at the very foundation of our judicial system. \"",
"In every court of general *67 jurisdiction there resides authority which is not strictly defined or limited by fixed rules of law, but which must be exercised in order justly to vindicate substantive rights, properly frame issues, and duly conduct trials.\" ",
"27 C.J.S. Discretion p. 293. ",
"An appellate court cannot truly reconstruct the entire atmosphere and circumstances of a trial, with all its expressions and inflections, nor the total effect of stated occurrences and remarks upon the jury. ",
"We do not propose now to depart from these essential principles which we have so long followed. ",
"The loser in a combat often regards the rules as unfair.",
"\nLittle would be gained here by a discussion of individual cases. ",
"We note that counsel only requested a mistrial, and not an explanation or withdrawal of the comments. ",
"We have determined that the remarks and conduct of the court did not constitute prejudicial error. ",
"For instances to the contrary, and by way of distinction, see, State v. Castino, Mo., 264 S.W.2d 372; State v. Jones, Mo., 197 S.W. 156; State v. Montgomery, 363 Mo. 459, 251 S.W.2d 654; State v. Bunton, 312 Mo. 655, 280 S.W. 1040. ",
"The record fairly showed that counsel knew, or should have known, that the Trooper had not purported to testify that he would procure his handwritten notes or report, but that he was merely going for a copy of the official Highway Patrol report. ",
"The \"voluntary\" remarks of the court were made, in essence, to confine the cross-examination to the legitimate issues, and they were not such as to humiliate or unduly embarrass counsel. ",
"And we fail to see how these remarks could possibly have been taken by the jury to indicate that the court favored the prosecution or believed the defendant guilty. ",
"The court was simply attempting to reflect what was in the prior record. ",
"The remarks did not fairly demonstrate any belief or disbelief by the court in the witness' credibility.",
"\nFinding no prejudicial error, the judgment is affirmed.",
"\nAll concur.",
"\n"
] |
{
"pile_set_name": "FreeLaw"
}
|
[
0.0008219343144446611,
0.0013785817427560687,
0.0009370315237902105,
0.0007775197154842317,
0.001185585861094296,
0.0007900707423686981,
0.0007134131155908108,
0.0010159482480958104,
0.0007785495254211128,
0.6347649693489075,
0.002001298824325204,
0.0006955134449526668,
0.0008023297996260226,
0.0066353026777505875,
0.0008855052874423563,
0.0006856952095404267,
0.0007237038225866854,
0.0006116186268627644,
0.0009663108503445983,
0.0007533187163062394,
0.0008147675544023514,
0.0013848210219293833,
0.18663403391838074,
0.0005249647074379027,
0.0006434767856262624,
0.0006230474100448191,
0.0006273129838518798,
0.001099713845178485,
0.0011330534471198916,
0.00105307309422642,
0.0008682965999469161,
0.0007409587851725519,
0.006876638159155846,
0.04101230204105377,
0.07904430478811264,
0.0008454503840766847,
0.000553565623704344,
0.000637484306935221,
0.0006798344547860324,
0.0005759460036642849,
0.0006120976759120822,
0.000623615924268961,
0.000597326026763767,
0.0005420911475084722,
0.0005655844579450786,
0.0005784050445072353,
0.0005547392065636814,
0.0005895192152820528,
0.0006207961705513299,
0.0006755926879122853,
0.0005240753525868058,
0.0007225746521726251,
0.0005265952786430717,
0.000598069978877902,
0.0005569954519160092,
0.0006363861612044275,
0.0017938498640432954,
0.0015190020203590393,
0.0006175042944960296,
0.0012114114360883832,
0.0008976460085250437,
0.001034830929711461,
0.0010664535220712423,
0.0009211580036208034,
0.0007149190059863031,
0.0010192047338932753,
0.000974646711256355,
0.0006887324270792305,
0.0011849700240418315,
0.0006334908539429307,
0.0007047527469694614,
0.0005763645167462528,
0.000899347010999918,
0.0006270137964747846,
0.0006041474407538772,
0.31692278385162354,
0.0006274768384173512,
0.0006067198701202869,
0.0006941119208931923,
0.0007017094758339226,
0.0005784138920716941,
0.0008310778648592532,
0.0007164959097281098,
0.0005937907844781876,
0.0006389767513610423,
0.0006950479582883418,
0.0006457148119807243,
0.001995444530621171
] | 0.015202 | 88 |
[
"DC's Amazon, after she found her grandparents. ",
"Being nobility has its perks, as she found out. ",
"Also, more scarred from new adventures. ",
"The more timid nobles are intimated, while the chivalrous ones warmed to her more quickly.",
"\n\n\n\n"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0007056358153931797,
0.0017348395194858313,
0.000596606289036572,
0.0006741191609762609,
0.001995444530621171
] | 0.001141 | 5 |
[
"[The number and size of human ventricular cardiomyocytes and the number of nuclei in them].",
"\nThe study of isolated cardiomyocytes after alkaline dissociation allowed to reveal an individual variability of the absolute number and average volume of cells, as well as characteristics of these indices in the left and right ventricle myocardia of the dead adult patients' hearts. ",
"On the basis of the analysis of these indices and of other parameters of isolated cardiomyocytes, a possibility of hyperplasia of nuclei and of muscle cells themselves during their hypertrophy is discussed."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0007850234396755695,
0.0007834357675164938,
0.000591419986449182
] | 0.00072 | 3 |
[
"![](",
"indmedgaz72923-0027){#sp1 .153}\n\n![](",
"indmedgaz72923-0028){#sp2 .154}\n"
] |
{
"pile_set_name": "PubMed Central"
}
|
[
0.0012735376367345452,
0.0017255775164812803,
0.0014273993438109756
] | 0.001476 | 3 |
[
"Cake Batter Pancakes.",
"\n\nI’m fairly convinced that the world would be a better place if more sprinkles were involved.",
"\n\nI know. ",
"I just made pancakes. ",
"It seems I have an unnatural obsession with cake batter. ",
"Well I do.",
"\n\nBut hear me out.",
"\n\nWhen I develop recipes, I try to make all of them for a purpose. ",
"We really hate to waste food in this house. ",
"Crab cakes for dinner, cake for a birthday party, quinoa as a side dish… it all works out. ",
"I get to share it with you and we get to eat it.",
"\n\nThen sometimes, I get ideas in my head. ",
"Ideas that get me so worked up that I must attempt the recipe and give it a shot as soon as possible, even if it isn’t something we will eat every day. ",
"Otherwise, I cannot stop thinking about it. ",
"These are the things that keep me up at night.",
"\n\nCase in point: it isn’t anyone’s birthday. ",
"It’s not even really close to anyone’s birthday.",
"\n\nBut I don’t need an excuse to eat cake and sprinkles. ",
"I believe it should be a daily occurrence.",
"\n\nAnd because pancakes always need some sort of topping, I went with a sprinkled glaze.",
"\n\nBecause nothing goes better with cake than more sugar!",
"\n\nThese are just plain fun.",
"\n\nSure, they would be best for a special occasion like a birthday, but they also work on a random Saturday in January when it’s -2 degrees outside and all you want to see is some sunshine.",
"\n\nAnd you don’t feel like getting on the treadmill, so you decided to eat cake instead.",
"\n\nThat wasn’t me. ",
"I swear.",
"\n\nAnd yes, this means you will have an open box of cake mix, just like you did with the cake batter bark. ",
"This is okay. ",
"You will manage. ",
"Sure, you may find yourself mixing cake mix with odd ingredients, but so what? ",
"Mother Lovett always had an open box of cake mix in her pantry. ",
"Given hers were usually about 4 years old… but still.",
"\n\nJust do it.",
"\n\nPrint Recipe 5 from 9 votes Leave a Review » Yield: 12 pancakes Cake Batter Pancakes Ingredients 1 1/2 cups all purpose flour\n\n2/3 cup yellow cake mix\n\n1 tablespoon sugar\n\n3/4 teaspoon baking powder\n\npinch of salt\n\n2 eggs\n\n1 teaspoon vanilla extract\n\n1-2 cups milk, I used vanilla almond milk\n\nassorted sprinkles glaze 1 cup powdered sugar\n\n1/2 tablespoon milk\n\n1/2 teaspoon vanilla extract\n\nassorted sprinkles Instructions Combine flour, cake mix, baking powder, sugar and salt in a bowl and mix. ",
"Add 1 cup of milk, egg and vanilla extract and stir until smooth. ",
"You want the batter to look like regular pancake batter; not too thin, not too thick. ",
"This will vary greatly on the brand of cake mix you use. ",
"Start with 1 cup of milk and add more if needed. ",
"I suggest a small taste test as well to see if the pancakes are flavored enough. ",
"Preheat a skillet on medium heat (I use an electric grilled and turn it to 250 degrees). ",
"Fold desired amount of sprinkles into batter. ",
"Pour batter in 1/4 cup measurements onto skillet and let cook until bubbles form on top, about 2-3 minutes. ",
"Flip and cook for 1 minute more. ",
"Serve with vanilla glaze. ",
"glaze Mix milk, extract and powdered sugar until glaze forms. ",
"You may need to add a little more sugar or water/milk to reach desired consistency. ",
"Mix into glaze and drizzle on pancakes. ",
"Did you make this recipe? ",
"Be sure to follow howsweeteats on instagram and tag #howsweeteats. ",
"You can also post a photo of your recipe to the howsweeteats facebook page. ",
"I appreciate you so much!",
"\n\nMaybe the secret to choking down broccoli is throwing sprinkles on top?",
"\n\nWishful thinking…"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0011547518661245704,
0.0009618353797122836,
0.0009301326354034245,
0.0009593642898835242,
0.0010881380876526237,
0.0007410148973576725,
0.009728066623210907,
0.000536833074875176,
0.06320071965456009,
0.0008408685098402202,
0.000813257705885917,
0.0007730592624284327,
0.0007439056062139571,
0.0006091066752560437,
0.005002210848033428,
0.0008702516788616776,
0.0010022727074101567,
0.008289437741041183,
0.0005652463296428323,
0.0010575882624834776,
0.0017931669717654586,
0.0009488807991147041,
0.0006005383911542594,
0.004363579209893942,
0.0023538563400506973,
0.03934231400489807,
0.0006855854298919439,
0.0006460413569584489,
0.0006664142129011452,
0.000658663862850517,
0.000875382567755878,
0.0013050100533291698,
0.0020279535092413425,
0.0008428345900028944,
0.0006382043357007205,
0.0016093970043584704,
0.0006300987442955375,
0.0007988768629729748,
0.0005562802543863654,
0.0012685063993558288,
0.0007503858651034534,
0.0007237851386889815,
0.0011086694430559874,
0.0009944925550371408,
0.0008278447785414755,
0.0005507210735231638,
0.0010400087339803576,
0.0008739657350815833,
0.0008528750040568411,
0.0007729428471066058,
0.0006003695307299495,
0.032014504075050354,
0.001167606795206666
] | 0.003863 | 53 |
[
"The jury in John Edwards' campaign finance trial ended its second day of deliberations today requesting to review additional evidence, but not indicating they are any closer to reaching a verdict.",
"\n\nThe panel of eight men and four women spent spend the day today focusing discussions on one count of the indictment dealing specifically with money obtained from 101-yeard-old heiress and Edwards supporter, Rachel \"Bunny\" Mellon.",
"\n\nToday marked the second day, since they were charged Friday, that jurors sent a note to Judge Catherine Eagles, requesting a number of trial exhibits related to funds Edwards and his associates received from Mellon in 2007.",
"\n\nThe government alleges in count two of a six-count indictment that Edwards and his former aide Andrew Young illegally solicited the money from Mellon as part of the effort to hide his pregnant mistress, Rielle Hunter, during the 2008 Democratic presidential primary campaign. ",
"Count three of the indictment contains similar allegations, but is focused on checks Mellon wrote in January 2008, shortly before Edwards ended his quest for the nomination.",
"\n\nAmong the exhibits the jury requested is a letter Mellon wrote in April 2007 that is sometimes referred to as the \"haircut\" letter. ",
"Mellon wrote the letter to Young, shortly after the press had seized on the news that Edwards had charged a $400 haircut to his campaign.",
"\n\n\"I was sitting alone in a grim mood - furious that the press had attacked Sen. Edwards on the price of a hair cut,\" Mellon's handwritten note reads. \"",
"From now on, all hair cuts, etc., ",
"that are a necessary and important part of his campaign, please send the bills to me. ",
"It is a way to help our friend without government restrictions.\"",
"\n\nWithin six weeks of that letter Mellon began writing a series of personal checks that would eventually add up to $725,000 over seven months. ",
"The jury also requested copies of the first two of those two checks, which were funnelled to Andrew Young through an intermediary and eventually deposited in an account in the maiden name of Young's wife, Cheri.",
"\n\nEdwards' defense team has argued that Young was taking advantage of Mellon, bilking her out of the money with the pretense that it was for Edwards. ",
"They noted that the vast majority of Mellon's money went to Young and his wife, who used much of it to fund the construction of their $1.6 million home.",
"\n\nAfter the jury's request on Friday, an Edwards lawyer told a clutch of reporters in the courtroom that the deliberations could take a while. ",
"The jury appears, at least at the outset, to be taking a meticulous, count-by-count approach to their discussions.",
"\n\nEdwards is charged with conspiracy, accepting illegal campaign contributions and making false statements. ",
"If convicted on all six counts, he faces a maximum penalty of 30 years in prison and $1.5 million in fines. ",
"Practically speaking, any prison term is likely to be well below the maximum.",
"\n\nIn addition to the money sent by Mellon, the jury must also consider the support provided to Hunter by Edwards' campaign finance chairman, Fred Baron, who funded a cross-country luxury odyssey for Hunter and the Youngs, after Andrew Young falsely claimed paternity of Edwards' child.",
"\n\nAnd they also must consider the broader question of whether the financial support provided by Mellon and Baron constitutes an illegal contribution under federal election laws.",
"\n\nAt the close of the day the jurors informed the judge that they'd prefer to keep to a set schedule for deliberations, starting each day at 9:30 a.m. and calling it quits by about 4 p.m. The Middle District of North Carolina covers 24 counties and several of the jurors have long commutes to court each day."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006183278746902943,
0.000759922550059855,
0.0006139383767731488,
0.0007313758251257241,
0.000591346703004092,
0.0005552554503083229,
0.001223988365381956,
0.0009690181468613446,
0.0014408077113330364,
0.0006714080227538943,
0.0005834080511704087,
0.0006247995188459754,
0.0005689843674190342,
0.0008749427506700158,
0.0006035310216248035,
0.0005484846769832075,
0.0005933039938099682,
0.0020159531850367785,
0.018307587131857872,
0.0006793480715714395,
0.0005956525565125048,
0.000565774564165622,
0.0006669358699582517
] | 0.001539 | 23 |
[
"Towards in vitro molecular diagnostics using nanostructures.",
"\nNanostructures appear to be promising for a number of applications in molecular diagnostics, mainly due to the increased surface-to-volume ratio they can offer, the very low limit of detection achievable, and the possibility to fabricate point-of-care diagnostic devices. ",
"In this paper, we review examples of the use of nanostructures as diagnostic tools that bring in marked improvements over prevalent classical assays. ",
"The focus is laid on the various sensing paradigms that possess the potential or have demonstrated the capability to replace or augment current analytical strategies. ",
"We start with a brief introduction of the various types of nanostructures and their physical properties that determine the transduction principle. ",
"This is followed by a concise collection of various functionalization protocols used to immobilize biomolecules on the nanostructure surface. ",
"The sensing paradigms are discussed in two contexts: the nanostructure acting as a label for detection, or the nanostructure acting as a support upon which the molecular recognition events take place. ",
"In order to be successful in the field of molecular diagnostics, it is important that the nanoanalytical tools be evaluated in the appropriate biological environment. ",
"The final section of the review compiles such examples, where the nanostructure-based diagnostic tools have been tested on realistic samples such as serum, demonstrating their analytical power even in the presence of complex matrix effects. ",
"The ability of nanodiagnostic tools to detect ultralow concentrations of one or more analytes coupled with portability and the use of low sample volumes is expected to have a broad impact in the field of molecular diagnostics."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0006373579381033778,
0.0005315871676430106,
0.0005451262113638222,
0.0005834958865307271,
0.0005529457121156156,
0.0006284374394454062,
0.000522632384672761,
0.0005093975341878831,
0.0005414552870206535,
0.0005834458861500025
] | 0.000564 | 10 |
[
"LATEST IN\n\nThursday, February 5, 2015\n\nbb dakota #ultimatethrowback contest\n\nCongrats on making it this far.",
"You have earned your right to view this photo.",
"\n\nClick through for my #ultimatethrowback photo. ",
"Warning: We're throwing it way back for this one.",
"\n\nTalk about an awkward photo: black hair, sparse brows, and matching with my mom! ",
"Okay, who am I kidding, matching with my mom is still dope as hell. ",
"I do have to give my mom mad props for these fly leopard-print coats, and also for instilling wanderlust in me at a ripe young age (we were traveling overseas at the time this photo was taken, apparent by the luggage). ",
"Yung Eugenie.",
"\n\nI'm such a fan of interesting Instagram contests, and this one is definitely going to be one of the funnier ones. ",
"Show us your major TBT looks to get a chance to win a $500 gift card to shop BB Dakota on Dailylook! ",
"Worried about not getting first place? ",
"No prob. ",
"Two runners up will receive $250 gift cards! ",
"View the guidelines + my look details below and check out the full contest details here."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0007204304565675557,
0.000645119056571275,
0.0008331536664627492,
0.0008703467319719493,
0.0016820390010252595,
0.6011534333229065,
0.01709424890577793,
0.0013860354665666819,
0.0007166757714003325,
0.011889842338860035,
0.0007894231821410358,
0.0008932919590733945,
0.0007355542620643973,
0.0005311587010510266
] | 0.04571 | 14 |
[
"For the 9 patients whose upper eyelid defects could not be repaired by primary closure or had 50-75% of the upper eyelid excised, reconstruction was done using an ipsilateral tarsal rotational flap to create the posterior lamella and an ipsilateral upper eyelid advancement or contralateral upper eyelid free graft for the anterior lamella.",
"\n\nAll content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. ",
"This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0009452677913941443,
0.0005677300505340099,
0.0005834866897203028
] | 0.000699 | 3 |
[
"National Voter Registration Day.",
"\n\nFor many of my fellow Americans, the day (which was Tuesday by the way) does not exactly belong in the pantheon of notable recognized days that deserve to be mentioned in Facebook posts or serve as the inspiration for time-off requests to their employers.",
"\n\nIn all honesty, National Voter Registration Day probably falls somewhere between Arbor Day and National Hog Day — I will let you guess which one is more important to Americans. ",
"Hint. ",
"It is not the one about the trees.",
"\n\nThe Daily Iberian\n\nBy Raymond Partsch III\n\nSeptember 26, 2018\n\nNot to mention, the majority of people probably don’t even know that the day existed before reading that first sentence.",
"\n\nNow as a longtime registered voter, I did not need to go register on the day, so instead I celebrated National Voter Registration Day the only way I know how — by printing off my sample ballot for the upcoming Nov. 6 election.",
"\n\nI know what you are thinking, “Raymond, calm down there, killer. ",
"You are an absolute wild man. ",
"You may need to slow your roll with the excessive lifestyle.”",
"\n\nYeah, yeah. ",
"I know being enthralled by voting is not exactly cool — no matter how many telethons-PSAs celebrities and sports figures produce every election cycle.",
"\n\nVoting is not exactly cool because if it were more en vogue then more than 55 percent of the registered voters would have cast a ballot in the 2016 presidential election, which by the way, was the lowest turnout since 1996.",
"\n\nI could rail on and on about the reasons why the turnout was a historic low that November day — like due to the lack of appealing candidates on both sides and the massive generational apathy among a generation of voters.",
"\n\nThe harsh truth is that possessing a borderline-geeky passion about voting is something that is not shared by everyone. ",
"To be honest, that was a sentiment that I too shared as I did not vote in a single election from the ages of 18 to 22.",
"\n\nBut then the 2000 Presidential Election occurred.",
"\n\nI had began working in the newspaper business in July that year, which subsequently exposed me to more local, state and national politics. ",
"At the same time, I began to have a strong desire to vote in the general election and what really lit the fire inside of me was the Republican primary battle between the now late Sen. John McCain and Gov. George W. Bush.",
"\n\nEven though I didn’t agree with all of his stances, the man they called ‘The Maverick” inspired to register to vote and more importantly cast my ballot.",
"\n\nBut with McCain losing the nomination to Bush, I had lost my inspiration in the political fight. ",
"And having just turned 22 years old I was filled with the anti-establishment vigor that comes from being, well, in your early 20s.",
"\n\nSo since I was not fan of then Vice President Al Gore (he didn’t seem all that genuine to me) and I didn’t think that Bush was qualified for the position (I mean he ran the Texas Rangers into the ground), I opted to go rogue — I voted third party.",
"\n\nYep, I was proud supporter and voter for the consumer advocate hero Ralph Nader. ",
"And, yes, you are thinking how did both McCain and Nader appeal to you Raymond? ",
"My only real answer is that I was 22.",
"\n\nI was all in for the Green Party candidate as I ordered the campaign T-shirt, the bumper stickers and buttons. ",
"I meticulously researched his background and his policies, read books and I even attended a few local Green Party meetings that fall. ",
"If I remember correctly each of the two meetings had a total of seven people at them and the fact that I drove a Dodge Ram pickup truck didn’t set well with some of them.",
"\n\nWhen Nov. 7, 2000, came around, yours truly (who since that year and every year since then has been a proud registered Independent) went into the voting booth and cast his ballot for Nader.",
"\n\nOf course, Nader didn’t win. ",
"Heck he didn’t even really make a dent in the election (and don’t tell me he cost Gore the election because that was then and still is a ridiculous statement) as my vote was one of a mere 446 cast for Nader in my parish.",
"\n\nBut the feeling of joy that I received from casting my ballot, and more importantly having the privilege to do so, has lasted long after the Nader T-shirt was donated to my local Goodwill.",
"\n\nThat joy also inspired me to become more knowledge about my local elections and statewide elections. ",
"I began to pay attention more about what the candidates were really saying (by what legislation they authored and sponsored and voted for) rather than campaign slogans.",
"\n\nThat joy though is not just reserved for the big elections like presidential and governor races, no I still get just as excited about off-season elections and proudly cast my ballots for council and commissioner races.",
"\n\nSo yeah, maybe National Voter Registration Day pales in comparison to the popularity of National Hot Dog Day (I mean to be fair, what wouldn’t pale in comparison to that day because hot dogs are delicious and any day celebrating them should be treasured).",
"\n\nBut it is day that still fills this particular voter with excitement nearly two decades after he first registered to vote.",
"\n\nRAYMOND PARTSCH III is the managing editor of The Daily Iberian."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.000655458599794656,
0.0005852141184732318,
0.000664465653244406,
0.0009655221947468817,
0.0008222918841056526,
0.0005993367522023618,
0.0006506112404167652,
0.19600531458854675,
0.22076009213924408,
0.0031970387790352106,
0.0007967758574523032,
0.0011115570086985826,
0.0006449072971008718,
0.0011705145006999373,
0.0008928086026571691,
0.0006462568999268115,
0.0005938088870607316,
0.0005768918199464679,
0.0011943686986342072,
0.0010087889386340976,
0.0008808470447547734,
0.003862234763801098,
0.0010482914512977004,
0.0006914456025697291,
0.0021804380230605602,
0.001869982574135065,
0.0007481697830371559,
0.0005387081182561815,
0.0006566506344825029,
0.0009326430736109614,
0.002704866463318467,
0.014705733396112919,
0.000710886437445879,
0.0005377479828894138,
0.0005474665085785091,
0.0005776965408585966,
0.000864471890963614,
0.0005834953626617789,
0.0008115179371088743
] | 0.012026 | 39 |
[
"Berkey and Gay Furniture Company Factory\n\nBerkey and Gay Furniture Company Factory is a manufacturing plant located at 940 Monroe Ave., ",
"NW in Grand Rapids, Michigan. ",
"It was listed on the National Register of Historic Places in 2000.",
"\n\nHistory\nIn 1855, William Berkey arrived in Grand Rapids and founded a mill to manufacture window sashes and other wood building products. ",
"He was joined by his brother, Julius, who later began manufacturing what became known as the \"Berkey Table.\" ",
"This was highly successful, and soon the Berkey brothers were concentrating on making furniture. ",
"The company took on various partners over time, including George W. Gay, who bought an interest in the company in 1866 to form \"Berkey Bros and Gay.\" ",
"In 1873, William Berkey withdrew from the company, and Julius Berkey and George W. Gay incorporated to form the Berkey & Gay Furniture Company. ",
"In 1874, the new company opened their six-story factory, complete with wholesale and retail showrooms, in Grand Rapids. ",
"By 1882, this factory covered three city blocks. ",
"The company is known for making Victorian furniture. ",
"\n\nGeorge W. Gay, although continuing to be involved with Berkey & Gay, also struck out on his own business ventures. ",
"One of these was the Oriel Cabinet Company, which he established in 1880. ",
"Oriel Cabinet constructed a factory at this site in the 1880s, but the original factory was destroyed by fire in 1890. ",
"In 1892, the company constructed a new factory, which continues to occupy the site. ",
"Both Oriel Cabinet and Berkey & Gay continued independently until 1911, when the two companies merged. ",
"The Oriel factory became Berkey & Gay's Plant No. ",
"1 following the merger, and an addition was immediately made to the plant in 1912. ",
"In 1919 the company further expanded the factory 240 feet north along Monroe Avenue.",
"\n\nIn 1920, the company merged with the Wallace Furniture Company and the Grand Rapids Upholstery Company to form Consolidated Furniture Companies, but continued to use the trademark \"Berkey & Gay\" because of its name recognition. ",
"Sales skyrocketed in the 1920s and the company aggressively expanded, However, when the Great Depression hit, the company was unable to continue financing their new sites, and was forced to sell to the Chicago-based Simmons Company. ",
"Even this was not enough, as Simmons declared bankruptcy in 1931, and the Grand Rapids factories closed their doors. ",
"Local stockholders reopened the factory in 1935, and continued production until World War II, when it was converted to wartime needs. ",
"After the war, an attempt was made to convert back to furniture production, but the company was again forced to declare bankruptcy in 1948 and closing the factory for good.",
"\n\nSince the closing of factory operations, the Berkey & Gay Furniture Company Factory was used for a variety of smaller tenants, ranging from small manufacturers to artists. ",
"By 2000, the building underwent rehabilitation to create residential apartments and retail commercial space.",
"\n\nDescription\nThe Berkey & Gay Furniture Company Factory is a massive, five-story, flat-roofed, cream brick building. ",
"It is basically rectilinear, with two open interior courtyards. ",
"The plant consists of three sections. ",
"The oldest section, constructed in 1892 by the Oriel Cabinet Company, is a U-shape building which now forms the southernmost part of the factory. ",
"The second section, constructed in 1912 after the merger, is an east side addition which enclosed the U-shape of the original building to create what is now the south courtyard. ",
"The third section was build in 1921, and is a U-shaped addition on the north side, which created a second courtyard and nearly doubled the area of the building.",
"\n\nOn the main facade, three groups of three large, two-story round arch openings are located at the street level: one grouping in the center of the facade and one at each end. ",
"The arches are formed with rusticated stonework , reminiscent of Richardsonian Romanesque style. ",
"Above the arches are paired windows on each of the upper four levels. ",
"Between these sections are long rows of single, regularly spaced segmental arch, twelve-over-twelve, double-hung wood windows. ",
"Atop the building is a brick parapet cap. ",
"The 1892 and 1912 building sections sit on a stone foundation, and the later 1921 addition has a concrete foundation.",
"\n\nReferences\n\nCategory:Romanesque Revival architecture in Michigan\nCategory:Industrial buildings completed in 1892\nCategory:Buildings and structures in Grand Rapids, Michigan\nCategory:Economy of Grand Rapids, Michigan\nCategory:Manufacturing plants in the United States\nCategory:Industrial buildings and structures on the National Register of Historic Places in Michigan\nCategory:National Register of Historic Places in Kent County, Michigan"
] |
{
"pile_set_name": "Wikipedia (en)"
}
|
[
0.02636372484266758,
0.0006577646126970649,
0.0011853548930957913,
0.0006849930505268276,
0.0009246405679732561,
0.0007263442385010421,
0.03203379362821579,
0.004260841757059097,
0.0006714714108966291,
0.000775336695369333,
0.0007466499228030443,
0.13369344174861908,
0.0005987646873109043,
0.0006707985303364694,
0.0007838290184736252,
0.0016379943117499352,
0.07307862490415573,
0.0005536687094718218,
0.0007455591694451869,
0.005614693742245436,
0.0007632769993506372,
0.0010345721384510398,
0.00069432269083336,
0.0008618790307082236,
0.0010947233531624079,
0.0006031969096511602,
0.001987007213756442,
0.0006120279431343079,
0.0006023070309311152,
0.0006500122253783047,
0.0007315385737456381,
0.0006893690442666411,
0.0007339557632803917,
0.0007128636934794486,
0.0006905190530233085,
0.0012462997110560536,
0.0011964046861976385,
0.0006733094924129546,
0.0005628145299851894
] | 0.007758 | 39 |
[
"/* SPDX-License-Identifier: GPL-2.0 */\n#ifndef __NVKM_VOLT_H__\n#define __NVKM_VOLT_H__\n#include <core/subdev.h>\n\nstruct nvkm_volt {\n\tconst struct nvkm_volt_func *func;\n\tstruct nvkm_subdev subdev;\n\n\tu8 vid_mask;\n\tu8 vid_nr;\n\tstruct {\n\t\tu32 uv;\n\t\tu8 vid;\n\t} vid[256];\n\n\tu32 max_uv;\n\tu32 min_uv;\n\n\t/*\n\t * These are fully functional map entries creating a sw ceiling for\n\t * the voltage. ",
"These all can describe different kind of curves, so\n\t * that for any given temperature a different one can return the lowest\n\t * value of all three.",
"\n\t */\n\tu8 max0_id;\n\tu8 max1_id;\n\tu8 max2_id;\n\n\tint speedo;\n};\n\nint nvkm_volt_map(struct nvkm_volt *volt, u8 id, u8 temperature);\nint nvkm_volt_map_min(struct nvkm_volt *volt, u8 id);\nint nvkm_volt_get(struct nvkm_volt *);\nint nvkm_volt_set_id(struct nvkm_volt *, u8 id, u8 min_id, u8 temp,\n\t\t int condition);\n\nint nv40_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\nint gf100_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\nint gf117_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\nint gk104_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\nint gk20a_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\nint gm20b_volt_new(struct nvkm_device *, int, struct nvkm_volt **);\n#endif\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.0014197073178365827,
0.0006868031341582537,
0.012294669635593891
] | 0.0048 | 3 |
[
"param(\n [Parameter(Mandatory=$true)][string] $Operation,\n [string] $AuthToken,\n [string] $CommitSha,\n [string] $RepoName,\n [switch] $IsFeedPrivate\n)\n\n$ErrorActionPreference = 'Stop'\nSet-StrictMode -Version 2.0\n. ",
"$PSScriptRoot\\tools.ps1\n\n# Sets VSS_NUGET_EXTERNAL_FEED_ENDPOINTS based on the \"darc-int-*\" feeds defined in NuGet.config. ",
"This is needed\n# in build agents by CredProvider to authenticate the restore requests to internal feeds as specified in\n# https://github.com/microsoft/artifacts-credprovider/blob/0f53327cd12fd893d8627d7b08a2171bf5852a41/README.md#environment-variables. ",
"This should ONLY be called from identified\n# internal builds\nfunction SetupCredProvider {\n param(\n [string] $AuthToken\n ) \n\n # Install the Cred Provider NuGet plugin\n Write-Host 'Setting up Cred Provider NuGet plugin in the agent...'\n Write-Host \"Getting 'installcredprovider.ps1' from 'https://github.com/microsoft/artifacts-credprovider'...\"\n\n $url = 'https://raw.githubusercontent.com/microsoft/artifacts-credprovider/master/helpers/installcredprovider.ps1'\n \n Write-Host \"Writing the contents of 'installcredprovider.ps1' locally...\"\n Invoke-WebRequest $url -OutFile installcredprovider.ps1\n \n Write-Host 'Installing plugin...'\n .\\installcredprovider.ps1 -Force\n \n Write-Host \"Deleting local copy of 'installcredprovider.ps1'...\"\n Remove-Item .\\installcredprovider.ps1\n\n if (-Not(\"$env:USERPROFILE\\.nuget\\plugins\\netcore\")) {\n Write-PipelineTelemetryError -Category 'Arcade' -Message 'CredProvider plugin was not installed correctly!'",
"\n ExitWithExitCode 1 \n } \n else {\n Write-Host 'CredProvider plugin was installed correctly!'",
"\n }\n\n # Then, we set the 'VSS_NUGET_EXTERNAL_FEED_ENDPOINTS' environment variable to restore from the stable \n # feeds successfully\n\n $nugetConfigPath = \"$RepoRoot\\NuGet.config\"\n\n if (-Not (Test-Path -Path $nugetConfigPath)) {\n Write-PipelineTelemetryError -Category 'Build' -Message 'NuGet.config file not found in repo root!'",
"\n ExitWithExitCode 1 \n }\n \n $endpoints = New-Object System.",
"Collections.",
"ArrayList\n $nugetConfigPackageSources = Select-Xml -Path $nugetConfigPath -XPath \"//packageSources/add[contains(@key, 'darc-int-')]/@value\" | foreach{$_.Node.",
"Value}\n \n if (($nugetConfigPackageSources | Measure-Object).Count -gt 0 ) {\n foreach ($stableRestoreResource in $nugetConfigPackageSources) {\n $trimmedResource = ([string]$stableRestoreResource).Trim()\n [void]$endpoints.",
"Add(@{endpoint=\"$trimmedResource\"; password=\"$AuthToken\"}) \n }\n }\n\n if (($endpoints | Measure-Object).Count -gt 0) {\n # [SuppressMessage(\"Microsoft.",
"Security\", \"CS002:SecretInNextLine\", Justification=\"Endpoint code example with no real credentials.\")]",
"\n # Create the JSON object. ",
"It should look like '{\"endpointCredentials\": [{\"endpoint\":\"http://example.index.json\", \"username\":\"optional\", \"password\":\"accesstoken\"}]}'\n $endpointCredentials = @{endpointCredentials=$endpoints} | ConvertTo-Json -Compress\n\n # Create the environment variables the AzDo way\n Write-LoggingCommand -Area 'task' -Event 'setvariable' -Data $endpointCredentials -Properties @{\n 'variable' = 'VSS_NUGET_EXTERNAL_FEED_ENDPOINTS'\n 'issecret' = 'false'\n } \n\n # We don't want sessions cached since we will be updating the endpoints quite frequently\n Write-LoggingCommand -Area 'task' -Event 'setvariable' -Data 'False' -Properties @{\n 'variable' = 'NUGET_CREDENTIALPROVIDER_SESSIONTOKENCACHE_ENABLED'\n 'issecret' = 'false'\n } \n }\n else\n {\n Write-Host 'No internal endpoints found in NuGet.config'\n }\n}\n\n#Workaround for https://github.com/microsoft/msbuild/issues/4430\nfunction InstallDotNetSdkAndRestoreArcade {\n $dotnetTempDir = \"$RepoRoot\\dotnet\"\n $dotnetSdkVersion=\"2.1.507\" # After experimentation we know this version works when restoring the SDK (compared to 3.0.*)",
"\n $dotnet = \"$dotnetTempDir\\dotnet.exe\"\n $restoreProjPath = \"$PSScriptRoot\\restore.proj\"\n \n Write-Host \"Installing dotnet SDK version $dotnetSdkVersion to restore Arcade SDK...\"\n InstallDotNetSdk \"$dotnetTempDir\" \"$dotnetSdkVersion\"\n \n '<Project Sdk=\"Microsoft.",
"DotNet.",
"Arcade.",
"Sdk\"/>' | Out-File \"$restoreProjPath\"\n\n & $dotnet restore $restoreProjPath\n\n Write-Host 'Arcade SDK restored!'",
"\n\n if (Test-Path -Path $restoreProjPath) {\n Remove-Item $restoreProjPath\n }\n\n if (Test-Path -Path $dotnetTempDir) {\n Remove-Item $dotnetTempDir -Recurse\n }\n}\n\ntry {\n Push-Location $PSScriptRoot\n\n if ($Operation -like 'setup') {\n SetupCredProvider $AuthToken\n } \n elseif ($Operation -like 'install-restore') {\n InstallDotNetSdkAndRestoreArcade\n }\n else {\n Write-PipelineTelemetryError -Category 'Arcade' -Message \"Unknown operation '$Operation'!\"",
"\n ExitWithExitCode 1 \n }\n} \ncatch {\n Write-Host $_.ScriptStackTrace\n Write-PipelineTelemetryError -Category 'Arcade' -Message $_\n ExitWithExitCode 1\n} \nfinally {\n Pop-Location\n}\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.0009943764889612794,
0.0020427433773875237,
0.0007611720357090235,
0.0009570075781084597,
0.0008385117398574948,
0.0013429998653009534,
0.0008025511633604765,
0.0008056002552621067,
0.0008370919385924935,
0.0010770853841677308,
0.0007424756768159568,
0.0006193783483467996,
0.002163833938539028,
0.0007322140736505389,
0.001076693064533174,
0.002125457627698779,
0.0008659413433633745,
0.0009411168866790831,
0.0018476536497473717,
0.0009776856750249863
] | 0.001128 | 20 |
[
"Q:\n\nПереназначение боковых кнопок мыши(конфликт со стоковыми действиями)\n\nХочу написать прогу типа logitech options(переназначение клавиш) главной особенностью, которой будут жесты и возможность работы с любой мышкой. ",
"\nПока писал в idle использовал ctypes и боковую кнопки мыши, где они не задействованы и я мог добавлять свои действия. ",
"А вот в chrome, мои действия также выполняются, но у них есть и стандартные действия назад/вперед, что сильно мешает мне! ",
"Как я могу скрыть нажатия кнопок от других программ или заблокировать их действия?",
"\nКакую библиотеку или функцию лучше использовать, чтобы это сделать?",
"\nЯ использую этот код чтобы отследить нажатие кнопок:\nfrom ctypes import windll, Structure, c_ulong, byref, c_ushort\nimport time\n\nLBUTTON = 0x01 # Left mouse button\nRBUTTON = 0x02 # Right mouse button\nmiddle = 0x04\nMIDDLEDOWN = 0x0020 # middle button down \nMIDDLE_UP = 0x0040 # middle button up \nblignyy = 0x05 \ndalnyy = 0x06 \nx=1\nwhile x<10:\n windll.user32.GetKeyState.restype = c_ushort\n windll.user32.UnregisterHotKey(LBUTTON)\n print(windll.user32.GetKeyState(LBUTTON))\n time.sleep(0.1)\n\nВозможно мне нужно не отслеживать кнопки, а нужно перехватить её нажатие или поменять её идентификатор, я новичок, но я уже прошерстил весь гугл по запросам qtpy,tkinter,ctypes блокировка, переназначение , перехват и я нашел только как отключить мышь и клавиатуру полностью, что мне не подходит, тк я использую жесты! ",
"Я в тупике(\n\nA:\n\nПредыстория\nНашел глобальный хук для питона тут , но появилось ощущение, что мышь лагает и двигается не плавно, поэтому я решил поискать решения на других языках. ",
"AutoIT и библиотека mouseonevent.au3, было очень приятно познакомить, но появился баг после которого я терял возможно отправлять действия от нажатий, он возникал, когда я кликал по неактивным окнам. ",
"Видел темы на Stack Overflow с решением моего вопроса на с++, но не смог его запустить из-за проблем со стандартной библиотекой.",
"\nРешение\nОстановился на языке С# с библиотекой LowLevelControls , она поддерживает все мои кнопки XButton1, XButton2, левую, правую, горизонтальную и вертикальную прокрутку. ",
"Для блокировки стандартного отклика кнопок надо вернуть true! ",
"Вот что я поменял в примере LowLevelControls.",
"Sample2 для блокировки боковых кн: \n msHook.",
"MouseDownEvent += (sender, vkCode, x, y, delta, injected) =>\n {\n if ((Keys)vkCode == Keys.",
"XButton1) return true;\n if ((Keys)vkCode == Keys.",
"XButton2) return true;\n return false;\n };\n msHook.",
"MouseUpEvent += (sender, vkCode, x, y, delta, injected) =>\n {\n if ((Keys)vkCode == Keys.",
"XButton1) return true;\n if ((Keys)vkCode == Keys.",
"XButton2) return true;\n return false;\n };\n\nПроблемы и замечания\n\nПосле нажатия левой кнопки мыши консолька и мышь начинают\nвиснуть, но так только при активной консоли.",
"\nПри блокировке перемещения курсора msHook.",
"MouseMoveEvent\nкоординаты мыши X и Y тоже блокируются, хотя на питоне, они менялись\nне смотря на блокировку. ",
"Забавно, что курсор можно сдвинуть, но\nчерез мгновенье он вернётся на место!",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.001245785620994866,
0.0014618190471082926,
0.002602525521069765,
0.002885933965444565,
0.001297886949032545,
0.0025697643868625164,
0.0015126480720937252,
0.0020527243614196777,
0.0034726406447589397,
0.0030372748151421547,
0.0023011062294244766,
0.010694590397179127,
0.0007746355258859694,
0.0007531482842750847,
0.0011347082909196615,
0.00823424756526947,
0.0007565756095573306,
0.0011347082909196615,
0.0030596228316426277,
0.0028620059601962566,
0.005796334706246853,
0.007110145874321461,
0.001995444530621171
] | 0.002989 | 23 |
[
"Expressing generic concepts with and without a language model.",
"\nUtterances expressing generic kinds (\"birds fly\") highlight qualities of a category that are stable and enduring, and thus provide insight into conceptual organization. ",
"To explore the role that linguistic input plays in children's production of generic nouns, we observed American and Chinese deaf children whose hearing losses prevented them from learning speech and whose hearing parents had not exposed them to sign. ",
"These children develop gesture systems that have language-like structure at many different levels. ",
"The specific question we addressed in this study was whether the gesture systems, developed without input from a conventional language model, would contain generics. ",
"We found that the deaf children used generics in the gestures they invented, and did so at about the same rate as hearing children growing up in the same cultures and learning English or Mandarin. ",
"Moreover, the deaf children produced more generics for animals than for artifacts, a bias found previously in adult English- and Mandarin-speakers and also found in both groups of hearing children in our current study. ",
"This bias has been hypothesized to reflect the different conceptual organizations underlying animal and artifact categories. ",
"Our results suggest that not only is a language model not necessary for young children to produce generic utterances, but the bias to produce more generics for animals than artifacts also does not require linguistic input to develop."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0006341514526866376,
0.000572717166505754,
0.0019285848829895258,
0.0010671792551875114,
0.0005443232948891819,
0.003201046958565712,
0.0029455479234457016,
0.0006515600252896547,
0.0007358950097113848
] | 0.001365 | 9 |
[
"Localized delivery of epidermal growth factor improves the survival of transplanted hepatocytes.",
"\nHepatocyte transplantation may provide a new approach for treating a variety of liver diseases if a sufficient number of the transplanted cells survive over an extended time period. ",
"In this report, we describe a technique to deliver growth factors to transplanted hepatocytes to improve their engraftment. ",
"Epidermal growth factor (EGF) was incorporated (0.11%) into microspheres (19 +/- 12 mum) fabricated from a copolymer of lactic and glycolic acid using a double emulsion technique. ",
"The incorporated EGF was steadily released over 1 month in vitro, and it remained biologically active, as determined by its ability to stimulate DNA synthesis, cell division, and long-term survival of cultured hepatocytes. ",
"EGF-containing microspheres were mixed with a suspension of hepatocytes, seeded onto porous sponges, and implanted into the mesentery of two groups of Lewis rats. ",
"The first group of animals had their portal vein shunted to the inferior vena cava prior to cell transplantation (portal-caval shunt = PCS), and the second group of animals did not (non-PCS). ",
"This surgical procedure improves the survival of transplanted hepatocytes. ",
"The engraftment of transplanted hepatocytes in PCS animals was increased two-fold by adding EGF microspheres, as compared to adding control microspheres that contained no growth factors. ",
"Devices implanted into non-PCS animals had fewer engrafted hepatocytes than devices implanted into PCS animals, regardless of whether blank or EGF-containing microspheres were added. ",
"These results first indicate that it is possible to design systems which can alter the microenvironment of transplanted hepatocytes to improve their engraftment. ",
"They also suggest that hepatocyte engraftment is not improved by providing single growth factors unless the correct environment (PCS) is provided for the transplanted cells. (",
"c) 1996 John Wiley & Sons, Inc."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0006998785538598895,
0.0006951086106710136,
0.000536932609975338,
0.0009126216173171997,
0.000581348140258342,
0.006201700773090124,
0.001195918070152402,
0.0006534884450957179,
0.0006377148674800992,
0.0007546516135334969,
0.0005873356130905449,
0.000588795926887542,
0.0007488731062039733
] | 0.001138 | 13 |
[
"Expedition in Nepal 2021\n\nPosted in : 7th Jan, 2019\n\nOne of the most challenging adventure trips in Nepal is an expedition in Nepal. ",
"Expedition in Nepal includes mountaineering in Nepal Himalaya expeditions both for mountaineers or adventure seekers. ",
"Nepal boasts of various Himalayan peaks and Eight of the world’s 14 peaks over 8000m including the top of the world Mt. Everest (8848m), Mt. Kanchenjunga (8586m), Mt. Lhotse (8516m), Mt. Makalu (8463m), Mt. Cho Oyu (8201m), Mt. Dhaulagiri (8167m), Mt. Manaslu (8163m) & Mt. Annapurna (8091m). ",
"Expedition in Nepal is famous but demanding adventure activity in Nepal.",
"\n\nFirst of all, after the successful conquest the Mt. Everest, the tallest mountain in the world, on 29th May 1953 by Sir Edmund Hilary & Tenzing Norgay Sherpa, Himalayas became more popular Expedition in Nepal. ",
"Nepal actually turned into more admired for expedition in Nepal destination after that. ",
"The lure of Himalayas is irresistible for the adventure seekers, as the Himalayas are the greatest range of mountains on earth, their beauty, vastness, fascination, and mystery will always have an everlasting appeal for those who venture in this region of Nepal. ",
"We find enthusiastic mountaineers flocking to the summit every year.",
"\n\nExpedition in Nepal fascinates a lot of tourists every year. ",
"No doubt Nepal expedition require previous mountaineering experience with good bodily fitness. ",
"However, if you are a beginner Mountain Experience Trekking & Expeditions is always there for you to assist. ",
"In every step of your adventure, we will guide you through the route with our experienced team of guides and porters while trekking to the different destination. ",
"Mountaineering and trekking in Nepal have relied heavily on the progress and inspiration developed by various expeditions to the Himalayas including Everest.",
"\n\nWhich time will be the best time for Expedition in Nepal?",
"\n\nNormally Autumn and spring season is the best time for Expedition in Nepal. ",
"We Himalaya Journey Trekking and expedition arrange Mountain expedition in Nepal. ",
"Either private or groups, family and friends, school or university and Alpine club groups as per wish and holiday schedule. ",
"As a result, Mountain Experience Trekking & Expeditions is the choice for many mountaineers.",
"\n\nExpedition in Nepal 2020 | Nepal Expedition 2020\n\nMountain Experience Trekking & Expedition is an active member of the Nepal Mountaineering Association and is affiliated with Nepal Tourism Board and Trekking Agencies’ Association of Nepal. ",
"In addition, we are professional Expedition organizers to operate all kinds of Nepal Himalaya expeditions. ",
"We also provide trained, competent and experienced climbing guides to ensure the safety and success of your expedition in Nepal. ",
"Furthermore, we also help you by providing all the information about the best day to climb, important gear for climbing, fixed departure date to go and all other things you like to know more. ",
"Furthermore, Mountain Experience Trekking & Expedition even helps you with the royalty and other government liable charges."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0005416208878159523,
0.0005653446423821151,
0.0006565014482475817,
0.0005679443711414933,
0.0006084449705667794,
0.0005400962545536458,
0.0005502845160663128,
0.0005285950028337538,
0.002178288297727704,
0.0006489553488790989,
0.000608312722761184,
0.0005485168658196926,
0.0005673790001310408,
0.0005847293650731444,
0.0005459716776385903,
0.0005923999124206603,
0.000603123044129461,
0.0005788744310848415,
0.0005755879683420062,
0.0005907943123020232,
0.0005017086514271796,
0.0005253584822639823,
0.0006211349973455071
] | 0.000645 | 23 |
[
"Authorities found and confiscated the arms collection of Christopher Hasson, a Baltimore Coast Guard officer arrested for drug dealing, but whose computer records revealed plans for a terrorist rampage.",
"\n\nThere’s one encouraging sign in the fight to turn back the tide of white-nationalist organizing and its attendant criminality: Law enforcement officials in a variety of locations are taking the threats posed by the most violent and threatening of these extremists seriously and either arresting them or taking their guns away.",
"\n\nIn Camden County, New Jersey, police confiscated the guns of 51-year-old David Greco after months of posting material online in which he “threatened, advocated and celebrated the killing of Jewish people.” ",
"In an earlier exchange with police officers, he told them he “believes that Jews are raping our woman and children” and that “force or violence is necessary to realign society.”",
"\n\nHis guns were confiscated under a court order issued by a Superior Court judge, operating under a so-called “red flag” law called the Extreme Risk Protection Order Act, which allows courts to issue orders at least temporarily confiscating the guns of people deemed potential imminent threats to public safety.",
"\n\nMeanwhile, in Brownsville, Texas, an 18-year-old man faces criminal terrorism charges after he allegedly threatened to mail a bomb to the Federal Reserve, set fire to a local mosque, as well as to both torch and shoot up a local synagogue—while apparently possessing both the bombs and other materials that made the threats less than idle talk.",
"\n\nAccording to the local Brownsville Herald, Joel Hayden Schrimsher faces federal charges for the array of threats he made on Twitter. ",
"It reports that “investigators found four chemical compounds used in bomb making, as well as white supremacist literature in the home where Schrimsher lived with his parents.” ",
"Schrimsher, the paper reports, was arrested in June by Harlingen, Texas, police who were tipped to his Twitter activity by agents at the Bureau of Alcohol, Tobacco, Firearms, and Explosives in Washington, D.C.\n\nThe FBI’s top leadership has been sounding the warning signal recently, testifying before Congress that the agency has seen a significant upsurge in white supremacist terrorism. ",
"Among the recent cases in which a potential terrorist attack was averted by preemptive arrest was the hair-raising case of Baltimore Coast Guard officer Christopher Hasson, who allegedly wrote down his plans to embark on a deadly terrorist rampage in the event of Donald Trump’s impeachment."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0009791151387616992,
0.002348292386159301,
0.009880391880869865,
0.30360040068626404,
0.001213515643030405,
0.007147149182856083,
0.001325603574514389,
0.0010114021133631468,
0.0008741232450120151,
0.0008913814672268927
] | 0.032927 | 10 |
[
"BCBSNC, UNC School of Medicine Collaborate to Benefit Veterans and Tackle Health Care Professional Shortage\n\nOn Dec. 3, Colonel Peter J. Benson from Fort Bragg joined BCBSNC and UNC School of Medicine to reveal a new collaboration for veterans that will address the health care professional shortage in N.C.\n\nBCBSNC and the UNC School of Medicine are collaborating to create a physician assistant master’s degree program for veteran medics with input from the United States Army Special Operations Command.",
"\n\nThe program aims to enroll its first class of students in 2015, and will build on the extensive medical training Special Forces Medical Sergeants receive during their service.",
"\n\nAlmost 1 million North Carolinians live in areas with a shortage of health care professionals. ",
"The two-year program will provide opportunities for military veterans to practice medicine in North Carolina, helping communities facing these shortages.",
"\n\nCHAPEL HILL, N.C. – Blue Cross and Blue Shield of North Carolina (BCBSNC) and the UNC School of Medicine (UNC) are collaborating to create a physician assistant (PA) master’s degree program designed for returning military veterans with input from the United States Army Special Operations Command team at Fort Bragg, N.C. The program will build on the medical experience and training that Special Forces Medical Sergeants receive during their service and provide opportunities for veterans who want to transfer their unique and hard-earned skills into the health care system. ",
"This collaborative effort will improve health care access for North Carolinians by reducing the shortage of health care professionals in our state.",
"\n\nBCBSNC has pledged $1.2 million over the next four years to help UNC establish the master’s curriculum and hire full-time program staff. ",
"A significant portion of the grant will provide scholarship funds through the Medical Foundation of North Carolina to assist Special Forces Medical Sergeants who have transitioned out of the military.",
"\n\n“Collaborating on creative approaches like this program will help us tackle the challenges our health care system is facing,” said Brad Wilson, BCBSNC president and CEO. “",
"It’s a simple equation: we need more physician assistants in North Carolina, and our veterans want the jobs. ",
"When these medics return home, they’ll have the opportunity to take their experience in the field and use it to advance their careers and continue to care for patients.”",
"\n\nThe United States and North Carolina are facing a deepening shortage of doctors and primary care physicians. ",
"Some figures estimate that by 2020, there will be a national shortage of about 150,000 physicians and 65,000 primary care physicians[i]. ",
"And in North Carolina, almost 1 million people live in areas that do not have enough health care professionals to effectively serve their communities[ii]. ",
"UNC will create a two-year curriculum with training rotations at UNC Hospitals and free clinics around the state. ",
"The program’s training will focus on primary care to meet the needs of underserved communities in North Carolina.",
"\n\n“We know that the majority of our Special Forces Medical Sergeants want to continue their careers in medicine to help improve the health and lives of our citizens, but many are unsure of what path to take when they transition out of the military,” said United States Army Special Operations Command Surgeon Colonel Peter J. Benson. “",
"This program gives our veterans the education and opportunity to lend their unique health care and leadership skills to benefit citizens across North Carolina.”",
"\n\nResearch has indicated there will be high interest and participation in the program. ",
"A 2010 national survey of Special Forces Medical Sergeants revealed that nine out of ten respondents wanted to pursue a career in health care outside of a military setting, and about half were interested in becoming PAs[iii].",
"\n\n“This collaboration is evidence of our shared commitment to veterans, providing access to primary care and improving the health of all North Carolinians,” said Dr. William L. Roper, MD, MPH, UNC School of Medicine dean and UNC Health Care CEO. “",
"Physician assistants play a vital role in the primary care setting, and our medically trained soldiers return to us well-equipped to meet the needs of underserved communities. ",
"North Carolina, in particular, provides many opportunities for our veterans who want to pursue a long-term career in medicine.”",
"\n\nSince 2009, the UNC School of Medicine and the Joint Special Operations Medical Training Center (JSOMTC) at Fort Bragg have collaborated to enhance medical training, care and innovation in underserved areas of North Carolina. ",
"Their existing collaboration will influence the development of the new master’s degree program with an executive advisory board seeking input from JSOMTC.",
"\n\n\"I'm extremely proud that the University of North Carolina at Chapel Hill is part of this initiative,” said Chancellor Holden Thorp, University of North Carolina at Chapel Hill. “",
"It's one more example of how our campus has worked with the United States Armed Forces since World War I to train our soldiers and to help the people of North Carolina.\"",
"\n\nThe UNC Master’s of Physician Assistant Studies degree program, pending review and approval by the UNC Board of Governors, is in the early planning stages and plans to enroll its first class of student veterans in 2015.",
"\n\nAbout Blue Cross and Blue Shield of North Carolina:\n\nBlue Cross and Blue Shield of North Carolina is a leader in delivering innovative health care products, services and information to more than 3.6 million members, including approximately 900,000 served on behalf of other Blue Plans. ",
"For 78 years, the company has served its customers by offering health insurance at a competitive price and has served the people of North Carolina through support of community organizations, programs and events that promote good health. ",
"Blue Cross and Blue Shield of North Carolina is an independent licensee of the Blue Cross and Blue Shield Association. ",
"Access BCBSNC online at bcbsnc.com. ",
"® Marks of the Blue Cross and Blue Shield Association. ",
"All other marks are the property of their respective owners.",
"\n\nAbout UNC School of Medicine:\n\nThe University of North Carolina School of Medicine is a nationally-ranked public medical school with campuses in Chapel Hill, Asheville, and Charlotte. ",
"The UNC School of Medicine is home to more than 1,500 students in various degree programs including those offered in the outstanding department of Allied Health Sciences, PhD programs in the biomedical sciences, and the MD program. ",
"Students may earn combined degrees, including the MD-PhD, MD-MPH, and MD-MBA degrees, in cooperation with the Gillings School of Public Health and the Kenan-Flagler School of Business, respectively, at UNC.",
"\n\nMedical education began at UNC-Chapel Hill in 1879. ",
"A four-year MD-granting School of Medicine was established in 1952, in conjunction with the opening of the N.C. Memorial Hospital. ",
"The UNC School of Medicine is in the top tier of peer institutions for graduating students who practice medicine in underserved areas as well as bringing in federal grants and contracts, including NIH funding. ",
"The School is one of the few in the nation to excel at both teaching primary care skills and the fostering of research careers."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005761698121204972,
0.0005734351580031216,
0.0011320393532514572,
0.0005462650442495942,
0.000545871036592871,
0.000637518591247499,
0.0006177644245326519,
0.0005333663430064917,
0.0005866711726412177,
0.0005940005066804588,
0.0006732841720804572,
0.000880162522662431,
0.0005999194108881056,
0.0006240226211957633,
0.0005688366945832968,
0.0007188948802649975,
0.000563989975489676,
0.0006399518460966647,
0.000514596002176404,
0.0005908914608880877,
0.0005925024161115289,
0.0007132411119528115,
0.0005654785200022161,
0.0005894835339859128,
0.0005267548840492964,
0.0005621106247417629,
0.0006072709220461547,
0.0005917532253079116,
0.0005724942311644554,
0.0006188340485095978,
0.0007442331407219172,
0.0007390392129309475,
0.0005912432679906487,
0.0012840989511460066,
0.0006022932357154787,
0.0005852715694345534,
0.0005574370152316988,
0.000619978120084852,
0.0006187724065966904,
0.0005985831958241761,
0.0010142007376998663
] | 0.000649 | 41 |
[
"u be 1 + 0 + (m - 2). ",
"Sort u, -3/7, -3 in ascending order.",
"\n-3, -3/7, u\nLet x = 4.6 - 2.2. ",
"Let p = 0.6 + x. Sort p, -5, -4/9 in increasing order.",
"\n-5, -4/9, p\nSuppose -c + 0*c = 2. ",
"Suppose -9*g + 5*g = 24. ",
"Sort g, 0, c in descending order.",
"\n0, c, g\nLet c be (-2)/(-7) - (-1105)/(-119). ",
"Sort -1, c, 0 in descending order.",
"\n0, -1, c\nLet d be 27/(-5) + 6/15. ",
"Put d, 4, 2 in decreasing order.",
"\n4, 2, d\nLet x(o) = -o**2 - 14*o + 1. ",
"Suppose 4*j - 4 = -60. ",
"Let y be x(j). ",
"Suppose 5*u - 10 = 5. ",
"Sort -1, u, y in decreasing order.",
"\nu, y, -1\nSuppose -25 = 5*k - 5*t, k - t = -k - 10. ",
"Put 2, -1, k in ascending order.",
"\nk, -1, 2\nLet z = 5.4 - -2.4. ",
"Let g = z - 7. ",
"Let t = g + -0.4. ",
"Sort -0.3, t, -0.1.",
"\n-0.3, -0.1, t\nLet v = 146 + -442/3. ",
"Let b = 27 + -19. ",
"Let u = -7 + b. Sort u, -0.1, v in descending order.",
"\nu, -0.1, v\nLet p = 3 + 1. ",
"Let o = 0 + 0.2. ",
"Sort -0.1, p, o.\n-0.1, o, p\nLet i be (-1)/(-4)*6/(-6). ",
"Let n = 8 - 8.3. ",
"Sort -0.2, i, n.\nn, i, -0.2\nLet y = -18 + 18.2. ",
"Put y, -5, 1 in ascending order.",
"\n-5, y, 1\nLet m = -1.05 + 0.05. ",
"Let x be 12/(-2 + -2) - 0. ",
"Sort x, m, 2 in increasing order.",
"\nx, m, 2\nLet b = 6 + -2. ",
"Let r = -34 - -26. ",
"Let d = b + r. Put d, -3, 2 in increasing order.",
"\nd, -3, 2\nSuppose y + 5*s + 6 = 2*y, -3*s = -y + 8. ",
"Let w = -4 + y. Suppose 3*r - 12 = w*r. ",
"Sort 5, r, -1 in decreasing order.",
"\n5, -1, r\nLet f be 0 + 2 + -3 - -9. ",
"Let a be 2*(-10)/f*-2. ",
"Let x be -4*(33/(-12) - -2)*-1. ",
"Put -4, a, x in ascending order.",
"\n-4, x, a\nSuppose 4*x + 3*h + 87 = -17, 0 = 5*x + h + 130. ",
"Let k be 74/x - (-2)/(-13). ",
"Sort 0, k, 3.",
"\nk, 0, 3\nLet o be 8/(-40)*(-5)/3. ",
"Let m = -2 + 1.8. ",
"Put 0, m, o in ascending order.",
"\nm, 0, o\nLet c(k) = -k**2 + 12*k - 3. ",
"Let t be c(11). ",
"Let w = 4 - t. Let n be (2/4)/((-2)/8). ",
"Sort 0, w, n in decreasing order.",
"\n0, n, w\nLet u = -0.14 - -0.04. ",
"Let a = 8.1 + u. Let o = a + -7.5. ",
"Put 0.4, -1, o in ascending order.",
"\n-1, 0.4, o\nLet y = 62 + -59. ",
"Put 11, y, 4 in increasing order.",
"\ny, 4, 11\nLet i(r) = r**3 + 2*r**2 - 6*r - 6. ",
"Let p be i(-3). ",
"Put -3, 8, 2, p in descending order.",
"\n8, p, 2, -3\nLet k(w) = -w**2 + 6*w + 5. ",
"Let f be k(6). ",
"Let i be 4*2/8*1. ",
"Sort i, f, 2 in ascending order.",
"\ni, 2, f\nLet f = -0.5 + 1. ",
"Let z be (3 - 0) + (-3 - -2). ",
"Let x be (-1)/2*-2 - z. Sort x, -2/3, f.\nx, -2/3, f\nSuppose -5*t - 2 = -2*s, -t - 2 - 4 = s. Put s, -12, 4, 1 in decreasing order.",
"\n4, 1, s, -12\nLet v = -128 + 128. ",
"Put 4, 3, -10, v in ascending order.",
"\n-10, v, 3, 4\nSuppose -2*b = -4*l + 12, 5*b - 2 - 23 = -l. ",
"Let n(o) = -o**2 - 4. ",
"Let g be (1 + -1)/((-4)/(-2)). ",
"Let t be n(g). ",
"Put 2, t, l in decreasing order.",
"\nl, 2, t\nLet g = 1.7 + 0.73. ",
"Let f = g - 0.23. ",
"Let j = f + -2. ",
"Put 3, j, 1/4 in decreasing order.",
"\n3, 1/4, j\nLet h = -2 + 2. ",
"Suppose 0 = -3*s - 3*p - 8 - 1, 5*s - 2*p = -15. ",
"Put s, h, -5 in descending order.",
"\nh, s, -5\nLet l = -19 - -17. ",
"Let z be (1/1)/(1/(-4)). ",
"Sort z, l, 1.",
"\nz, l, 1\nLet h(s) = -s**3 - 3*s**2 + 4*s - 4. ",
"Let k be h(-4). ",
"Let b = -4 - -3. ",
"Sort k, b, 3 in decreasing order.",
"\n3, b, k\nLet b = 0.65 + -0.15. ",
"Let a = -568/2583 - 2/861. ",
"Sort b, 1, a.\na, b, 1\nLet r be (-6)/(-4)*112/(-42). ",
"Sort r, -3, 1 in increasing order.",
"\nr, -3, 1\nLet z be 2/(-7) - 22/(-28). ",
"Let y = -9.1 - -8. ",
"Let n = 0.1 + y. Sort n, z, 0.2 in increasing order.",
"\nn, 0.2, z\nLet k(p) = -p**2 + 2*p - 2*p - p - p**3. ",
"Let r be k(3). ",
"Let d = r + 194/5. ",
"Sort d, -4, 5 in increasing order.",
"\n-4, d, 5\nLet o = -32 - -32. ",
"Sort 1, 23, o.\no, 1, 23\nSuppose -4*d + 68 = 3*l - 6, -4*l = 2*d - 102. ",
"Let s be (-30)/l + (-1 - -2). ",
"Sort s, 4, 3/4 in descending order.",
"\n4, 3/4, s\nLet x = 0 - 0. ",
"Let k = -13 + 19. ",
"Let u be ((-6)/9)/((-2)/k). ",
"Put x, u, -1 in descending order.",
"\nu, x, -1\nLet v = 1 + 1. ",
"Suppose 2*z + 3*z - 4*t - 26 = 0, -4*t = 3*z + 10. ",
"Suppose o - v*o = z. Put 1, o, -4 in decreasing order.",
"\n1, o, -4\nLet r = 268 + -263. ",
"Suppose 0 = -0*f - 5*f + 5. ",
"Suppose i + 2*i = -2*s + 6, -s = 3. ",
"Sort i, f, r in decreasing order.",
"\nr, i, f\nLet t = 3 - 1. ",
"Suppose 2 = t*y + 4. ",
"Sort 0, 1, y in descending order.",
"\n1, 0, y\nLet s(t) = -t**3 - t**2 - t. Let u be s(0). ",
"Suppose u*n = -5*n - 5. ",
"Suppose 4*a + 20 = -0*a. ",
"Sort a, n, 1 in descending order.",
"\n1, n, a\nSuppose -2*u + 2 = -0. ",
"Let h(o) = o**2 + 8*o + 10. ",
"Let m be h(-7). ",
"Sort u, m, -1 in descending order.",
"\nm, u, -1\nLet c be (-1 + 2)*4*1. ",
"Suppose -c*u + 10 = -2. ",
"Suppose 1 + u = f. Sort f, -1, -2 in descending order.",
"\nf, -1, -2\nLet z = -0.1 - 0. ",
"Let w = -226 - -224. ",
"Suppose 4*m - 3*m = -5. ",
"Put w, z, m in ascending order.",
"\nm, w, z\nLet h = -5 + 8. ",
"Suppose 0 = -h*c - 12. ",
"Let r be 42/(-49)*14/(-3). ",
"Sort 3, r, c in descending order.",
"\nr, 3, c\nSuppose -f = -5*f - 5*u + 4, -u = -5*f - 24. ",
"Sort -2, f, 4, 2 in increasing order.",
"\nf, -2, 2, 4\nLet i be ((-3)/2)/(21/56). ",
"Let x(s) = s + 9. ",
"Let n be x(i). ",
"Suppose 5*r + 4 - 9 = 0. ",
"Put -2, r, n in increasing order.",
"\n-2, r, n\nLet m = 20 - 25. ",
"Sort m, 5, 9 in descending order.",
"\n9, 5, m\nLet d be (-3)/(-2) + -1 + (-90)/(-36). ",
"Let g(u) = -2*u - 2. ",
"Let p be g(-2). ",
"Sort d, -5, p.\n-5, p, d\nLet c = 0.081 + 24.419. ",
"Let k = c - 24. ",
"Sort 0.2, 0, k.\n0, 0.2, k\nLet c = -9 - -5.1. ",
"Sort -3/4, c, 0.2 in descending order.",
"\n0.2, -3/4, c\nLet c be (-2)/((8 + -4)/8). ",
"Sort 1, c, -1 in descending order.",
"\n1, -1, c\nLet m(t) = -t**2 + t + 17. ",
"Let f be m(-3). ",
"Sort -3, 25, 0, f in descending order.",
"\n25, f, 0, -3\nLet d(o) = 154*o + 4. ",
"Let a be d(3). ",
"Let n = 11648/25 - a. Sort 6, 5, n in ascending order.",
"\nn, 5, 6\nLet h be (5/3)/(55/66). ",
"Put 0.2, h, 3/4 in increasing order.",
"\n0.2, 3/4, h\nLet a = -1.1 - -0.1. ",
"Let b = 0 + a. Let v be 30/20*(-10)/(-6). ",
"Sort -2, v, b in ascending order.",
"\n-2, b, v\nLet f(v) = -2*v + 17. ",
"Let r be f(8). ",
"Sort -5, 0, 4, r in ascending order.",
"\n-5, 0, r, 4\nLet x be (-10)/16*(-12)/(-24). ",
"Let h = 29/16 + x. Put -0.1, -4/7, h in decreasing order.",
"\nh, -0.1, -4/7\nLet y be (3*-1)/(28/(-4)). ",
"Let q be (57/9 + -3)*3/(-6). ",
"Sort -1/2, q, y in decreasing order.",
"\ny, -1/2, q\nSuppose -2*n + 3 = -5*n. ",
"Sort n, 1, -2, 0.",
"\n-2, n, 0, 1\nLet o = 1.2 + -1. ",
"Let c = -0.3 - o. Let q be (-6)/(-9) - 28/51. ",
"Sort 5, c, q in descending order.",
"\n5, q, c\nLet f = -2 + 3. ",
"Suppose -5*p + 22 = 5*r + 2, -4 = -2*r. ",
"Suppose -10 = -4*d + p. Sort d, f, -2 in increasing order.",
"\n-2, f, d\nSuppose -3*z = -y - 7, -6*z + y = -2*z - 11. ",
"Let w = z + -2. ",
"Let s(d) = -d**3 - d**2 + 4*d - 3. ",
"Let g be s(1). ",
"Sort g, w, 5 in descending order.",
"\n5, w, g\nLet z = -6 + 5. ",
"Put -3, -2, z in increasing order.",
"\n-3, -2, z\nLet l = 4.925 + 0.075. ",
"Put l, 5/6, -0.5, 0.3 in decreasing order.",
"\nl, 5/6, 0.3, -0.5\nSuppose -2*x - w = -5, x - 3*w - 1 = -x. ",
"Put 3, 5, 8, x in descending order.",
"\n8, 5, 3, x\nLet k be ((-1)/(-5))/(4/16). ",
"Sort -2/3, k, 0.05.",
"\n-2/3, 0.05, k\nLet t(j) = 3 - j**2 - 10*j + 2 - 12. ",
"Let w be t(-9). ",
"Let m = -9 - -13. ",
"Sort m, 1, w in increasing order.",
"\n1, w, m\nLet h = -3.6 + 4. ",
"Sort -3, h, 2/3 in descending order.",
"\n2/3, h, -3\nLet y(x) = -2*x - 7. ",
"Let u be y(-5). ",
"Suppose 3*j = 5*j - 4*p + 12, 2*j + u*p + 5 = 0. ",
"Let w be -6 + 0 - 21/(-7). ",
"Sort j, w, 2 in decreasing order.",
"\n2, w, j\nSuppose -3*f - 4 = -2*f. ",
"Sort 4, -3, f in ascending order.",
"\nf, -3, 4\nLet l be ((-1)/(-5))/(-1)*-1. ",
"Suppose u = 3*u + 2. ",
"Let v be 6/12*10*u. ",
"Sort 0.4, l, v in descending order.",
"\n0.4, l, v\nSuppose 0 = -0*m + m - 3. ",
"Suppose 0 = y - m*y - 8. ",
"Put -3, 4, y in increasing order.",
"\ny, -3, 4\nLet h be (18/10)/(2/10). ",
"Let k = h + -7. ",
"Put -4/3, k, 0.5 in ascending order.",
"\n-4/3, 0.5, k\nLet m(h) be the second derivative of -1/2*h**2 + 3*h - 1/12*h**4 + 0 + 1/6*h**3 + 1/20*h**5. ",
"Let c be m(2). ",
"Sort c, 4, -1 in descending order.",
"\nc, 4, -1\nLet p = -1.7 - 0.3. ",
"Sort -5, -3/7, p in decreasing order.",
"\n-3/7, p, -5\nLet w = 6.8 - 6. ",
"Let u = -0.3 + w. Let f = 474 + -3324/7. ",
"Sort f, 5, u.\nf, u, 5\nLet z be 7/(-28) - 34/(-8). ",
"Let v = 0.01 - -0.01. ",
"Let o = -0.32 + v. Put -1, z, o in increasing order.",
"\n-1, o, z\nLet l = -109 - -108.7. ",
"Sort 41, -1/3, l in increasing order.",
"\n-1/3, l, 41\nLet r be 5*(-4)/(-20) + -3. ",
"Suppose -3*s - 1 = 11. ",
"Put 3, r, s in descending order.",
"\n3, r, s\nLet c(l) = 2*l**3 + 2*l**2 - 1. ",
"Let b be c(-1). ",
"Put -5, 1, b in decreasing order.",
"\n1, b, -5\nSuppose 2*d - 7*d - 5 = 0. ",
"Suppose -5*f = 3*p + 10, 0*p = -5*f + 3*p - 10. ",
"Put d, f, 1 in descending order.",
"\n1, d, f\nLet t = -0.17 - -3.67. ",
"Let f = t + -4. ",
"Sort -5, 0.4, f in descending order.",
"\n0.4, f, -5\nLet f(k) = k**3 + 5*k**2. ",
"Let s be f(-4). ",
"Let g be (2/12)/((-8)/s). ",
"Put g, 0.9, 4 in increasing order.",
"\ng, 0.9, 4\nLet g = 12.7 - 13. ",
"Put -0.7, -4/5, g in decreasing order.",
"\ng"
] |
{
"pile_set_name": "DM Mathematics"
}
|
[
0.23305588960647583,
0.0006567420205101371,
0.0030096436385065317,
0.0009642595541663468,
0.0035740595776587725,
0.002801000140607357,
0.0006575897568836808,
0.002858865773305297,
0.0006290642777457833,
0.0022350610233843327,
0.0008607099880464375,
0.04502321034669876,
0.001480832346715033,
0.002034522593021393,
0.0019907704554498196,
0.0007261935970745981,
0.920697033405304,
0.0009866307955235243,
0.008135232143104076,
0.0024928725324571133,
0.008057480677962303,
0.0008531411876901984,
0.01361093483865261,
0.001439146464690566,
0.00195815647020936,
0.012071388773620129,
0.008869023993611336,
0.004507326986640692,
0.002163242781534791,
0.011905533261597157,
0.0008700212347321212,
0.010102057829499245,
0.0016947353724390268,
0.0006287457072176039,
0.002999882912263274,
0.0013207707088440657,
0.0013792483368888497,
0.006945705972611904,
0.020399238914251328,
0.0006241751834750175,
0.012436645105481148,
0.8706536889076233,
0.001345780212432146,
0.00076134322443977,
0.002448678482323885,
0.0013597173383459449,
0.0009523564949631691,
0.09181085973978043,
0.0027515548281371593,
0.0018303912365809083,
0.9197272658348083,
0.0013768741628155112,
0.014216001145541668,
0.0007138816872611642,
0.06656575202941895,
0.057026457041502,
0.001301269163377583,
0.002720192074775696,
0.0008479364914819598,
0.15696649253368378,
0.0016096055041998625,
0.000737397582270205,
0.7924194931983948,
0.005458179395645857,
0.025344958528876305,
0.0006956741563044488,
0.011750446632504463,
0.0016252162167802453,
0.008960716426372528,
0.0019645015709102154,
0.0009786096634343266,
0.002566805575042963,
0.06328460574150085,
0.0013740727445110679,
0.029184916988015175,
0.0009691238519735634,
0.012921404093503952,
0.007596240378916264,
0.004617034457623959,
0.0008496352820657194,
0.0021383913699537516,
0.018920687958598137,
0.0009119431488215923,
0.002318711718544364,
0.0011923527345061302,
0.0008044150890782475,
0.050210610032081604,
0.0022885489743202925,
0.0017712495755404234,
0.000657316530123353,
0.0037671313621103764,
0.0011499888496473432,
0.0012216571485623717,
0.0006053558317944407,
0.0029280458111315966,
0.002778704511001706,
0.0017656022682785988,
0.6668353080749512,
0.0018756398931145668,
0.0013543068198487163,
0.0006119322497397661,
0.008080190047621727,
0.0024280317593365908,
0.0009332333575002849,
0.0006349007599055767,
0.001962184440344572,
0.0037838087882846594,
0.004405338317155838,
0.0011122141731902957,
0.008105885237455368,
0.006727441679686308,
0.09024647623300552,
0.001421811175532639,
0.03000185452401638,
0.0023050562012940645,
0.0008024387643672526,
0.01172314677387476,
0.007891618646681309,
0.0006887222407385707,
0.34998297691345215,
0.208145409822464,
0.0022451484110206366,
0.0007099084905348718,
0.005306410603225231,
0.14116406440734863,
0.0014937801752239466,
0.0006757768569514155,
0.03546473756432533,
0.13067318499088287,
0.0034083982463926077,
0.011270822025835514,
0.0013773941900581121,
0.0027491343207657337,
0.0012185925152152777,
0.007623875513672829,
0.002573116449639201,
0.0012780243996530771,
0.0006255526677705348,
0.41530945897102356,
0.0006134824361652136,
0.0046574389562010765,
0.0018331994069740176,
0.010591194964945316,
0.001685030059888959,
0.0007404120988212526,
0.002308220835402608,
0.0006476712878793478,
0.0028945307713001966,
0.10074110329151154,
0.002773554529994726,
0.0014874896733090281,
0.0038830433040857315,
0.0050651333294808865,
0.0006074619013816118,
0.004798649810254574,
0.0006305679562501609,
0.06759777665138245,
0.004039260558784008,
0.0006555767031386495,
0.12197017669677734,
0.0014492783229798079,
0.0007716979598626494,
0.00494652334600687,
0.0009123854688368738,
0.008137592114508152,
0.00489520700648427,
0.0006317977677099407,
0.011019228026270866,
0.0021881337743252516,
0.0006455843686126173,
0.0026067544240504503,
0.0013386154314503074,
0.009792245924472809,
0.0009334698552265763,
0.0006482981843873858,
0.029085272923111916,
0.0009951015235856175,
0.016967182978987694,
0.00990776065737009,
0.0006373916985467076,
0.009884092025458813,
0.011816165409982204,
0.0009645508835092187,
0.00484849838539958,
0.002244446659460664,
0.010348097421228886,
0.00238270522095263,
0.0006587341194972396,
0.005496263038367033,
0.0007419469184242189,
0.0021296285558491945,
0.001081814174540341,
0.003777921199798584,
0.0008887626463547349,
0.002647791989147663,
0.000810310069937259,
0.09845568984746933,
0.0029215794056653976,
0.0018632119754329324,
0.0006492918473668396,
0.0034426322672516108,
0.0006236272747628391,
0.0035056115593761206,
0.004383439663797617,
0.0226126741617918,
0.0012647585244849324,
0.0006481217569671571,
0.12781363725662231,
0.0006775770452804863,
0.004177809692919254,
0.002805504482239485,
0.05277812108397484,
0.0006757095688953996,
0.002598180901259184,
0.017925545573234558,
0.0007132530445232987,
0.003919975832104683,
0.01073664054274559,
0.0008711464470252395,
0.25813406705856323,
0.0017461267998442054,
0.0006216196925379336,
0.007016817107796669,
0.0006164120277389884,
0.002111561829224229,
0.016844874247908592,
0.02771393395960331,
0.0016168832080438733,
0.0016920487396419048,
0.010454775765538216,
0.0006165947415865958,
0.00586317852139473,
0.0171549953520298,
0.0009924457408487797,
0.019053449854254723,
0.0011890674941241741,
0.0007447213283739984,
0.0019014411373063922,
0.12878644466400146,
0.0009973724372684956,
0.023732315748929977,
0.013213829137384892,
0.0006582358619198203,
0.9890424609184265,
0.0014626336051151156,
0.0012148490641266108,
0.0008379769860766828,
0.005084381438791752,
0.0008976724348030984,
0.0014935688814148307
] | 0.036887 | 250 |
[
"Q:\n\nBehaviour of active transaction on connection close?",
"\n\nIf the close method is called and there is an active transaction, what will happen to active transactions? ",
"Will they be commited or rolled back?",
"\n\nA:\n\nAdding to the other answer, I tested the behavior on Oracle and SQL Server, the databases I'm currently working with. ",
"\nMSSQL rolls back the transaction. ",
"This is what you'd intuitively expect.",
"\nOracle on the other side, commits the transaction. ",
"This is documented in their JDBC Guide:\nIf the auto-commit mode is disabled and you close the connection without explicitly committing or rolling back your last changes, then an implicit COMMIT operation is run. ",
"\nSure, the JDBC spec gives you freedom to go either way, but I personally think that implicitly committing the transaction is a poor design choice. ",
"As an argument, consider the use case of a thread which is busy working on a long-ish transaction and is not responsive to a shutdown request. ",
"When the application eventually closes the connection pool, this will in turn close the connection, committing the incomplete transaction!",
"\nThe moral of this story is that connection pool implementations must always call rollback() before closing a connection in manual commit mode. ",
"However this is not something that just comes to mind when implementing a connection pool. ",
"As an example, see PooledConnectionImpl from DBCP\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0006717873038724065,
0.0006212385487742722,
0.0014967950992286205,
0.0005794509779661894,
0.0012247237609699368,
0.000656876596622169,
0.0007399155292659998,
0.0007467381074093282,
0.0006526411743834615,
0.0007124015246517956,
0.0006397408433258533,
0.0008355507161468267,
0.0005768522387370467,
0.0006461672601290047
] | 0.000771 | 14 |
[
"Q:\n\nHow to disable an onDestroy method from activity in a specific fragment?",
"\n\nI have an activity with multiple fragments. ",
"When the user reaches the last fragment and clicks on a button, he gets to the MainActivity via intent. ",
"\nThis is a multiplayer quiz app and I need to update a \"turn\" field in the database which decides wether player 1 or 2 has to play. ",
"This field currently gets updated when...\n... the player finishes his quiz round normally (by clicking the next button on the last fragment)\n... the player clicks the back button of the phone during the game (it opens an AlertDialogso when the player chooses to go back to the MainActivity this triggers an \"update turn field method\")\nThere has to be a third option where the turn field gets updated and this is the scenario: The player starts his turn but closes the app during his turn. ",
"This means currently that the \"turn\" field in my database does not get updated which means in my code that neither of the players can resume the game. ",
"I want to avoid this by updating the turn field when the user decides to close the app.",
"\nIn the fragments there is a ProgressBar which is still running when the user accidentally closes the app, I did this in the onStopmethod of the fragment. ",
"Because of this I cannot call the onStopmethod in the activity to update the fields in the database, so I am wondering if there is a way to achieve my desired result without calling the onStop method. ",
"\nHere is my activity where I have currently the method that updates some fields in Firestore inside the onDestroy method:\n...\n// When the user clicks the phones back button during the game an alert window opens to aks if he is sure to exit the game\n public void onBackPressed() {\n AlertDialog();\n }\n\npublic void AlertDialog() {\n\n yes.setOnClickListener(new View.",
"OnClickListener() {\n @Override\n public void onClick(View v) {\n closeGame();\n Intent i = new Intent(GameActivity.this, MainActivity.class);\n startActivity(i);\n finish();\n }\n });\n }\n\n @Override\n protected void onDestroy() {\n super.onDestroy();\n updateGameStatus();\n }\n\n protected void updateGameStatus() {\n\ncollectionRef.document(gameId).collection(\"Round\").document(\"Round\").update(\"round\", roundValue + 1)\n .addOnCompleteListener(new OnCompleteListener<Void>() {\n @Override\n public void onComplete(@NonNull Task<Void> task) {\n }\n });\n\n }\n...\n\nIs there a good way to achieve my desired result?",
"\nPlease let me know if you need additional informations.",
"\nI very much appreciate any tips!",
"\n\nA:\n\nSince there is no way to disable the onDestroy on a specific Fragment, I arranged my code logic around the onDestroymethod of the Activity that holds the Fragments.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.001060777809470892,
0.0005983730079606175,
0.0008213900728151202,
0.0015553026460111141,
0.0007110348087735474,
0.0007570310262963176,
0.0006994748255237937,
0.000683060847222805,
0.0006401534774340689,
0.0007965617696754634,
0.0012027885532006621,
0.0005491299671120942,
0.0005596861592493951,
0.0007272029761224985,
0.001995444530621171
] | 0.00089 | 15 |
[
"Q:\n\nSQL Server same string but different results, why?",
"\n\nI am trying to create a query for a prototype but can't seem to get it to work. ",
"I have no idea. ",
"The first query was captured using Express Profiler. ",
"The second query is just a copy, and paste from the first query. ",
"The only difference is that in the second query I copied/pasted the param value directly from the row in the database. ",
"Why are these two queries returning different results? ",
"\nI did change the queries before posting this, so ignore any minor mistakes I may have missed. ",
"I did this to remove client specific details.",
"\nexec sp_executesql N'SELECT DISTINCT COUNT(*)\n FROM [Test_Import] \n WHERE CONCAT(Name, '' -- '', City, '', '', State, '', '', Zip) = \n @Info', N'@Info nvarchar(49)',\n @Info=N'LLC -- Morganton, NC, 28655'\ngo\n\nexec sp_executesql N'SELECT DISTINCT COUNT(*)\n FROM [Test_Import] \n WHERE CONCAT(Name, '' -- '', City, '', '', State, '', '', Zip) = \n @Info', N'@Info nvarchar(49)',\n @Info=N'LLC -- Morganton, NC, 28655'\ngo\n\nInsert values\nINSERT INTO [dbo].[Test_Import] ([Name], [City], [State], [Zip])\nVALUES ('LLC', 'Morganton', 'NC', '28655')\n\nCreate table\nSET ANSI_NULLS ON\nSET QUOTED_IDENTIFIER ON\nSET ANSI_PADDING ON\nGO\n\nCREATE TABLE [dbo].[Test_Import]\n(\n [Name] [varchar](200) NULL,\n [City] [varchar](200) NULL,\n [State] [varchar](200) NULL,\n [Zip] [varchar](200) NULL\n) ON [PRIMARY]\nGO\n\nSET ANSI_PADDING OFF\nGO\n\nA:\n\ncheck if there is any hidden characters beneath the parameter\nyou can do that by copy and paste this sql into Notepad++ \nFrom Notepad++ menu goto view-->show Symbol --> show all characters\nThis will help you figure out the difference\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0006452976958826184,
0.0005882456316612661,
0.0008099674014374614,
0.0005574455135501921,
0.0006919736624695361,
0.000642203027382493,
0.0006818663678131998,
0.0007685543387196958,
0.000588364782743156,
0.0009106528596021235
] | 0.000688 | 10 |
[
"/* eslint-disable no-console */\nrequire('colors');\n\nconst ARROW = '==>';\n\n/**\n * Decorates console.log statements with colors and symbols\n */\nclass Logger {\n /**\n * @static\n *\n * General information messages in bold blue, with ==> arrow\n *\n * @param {string} str\n */\n static info(str) {\n console.log(`${ARROW.blue} ${str}`.bold);\n }\n\n /**\n * @static\n *\n * Warnings in bold yellow\n *\n * @param {string} str\n */\n static warn(str) {\n console.log(`WARNING: ${str}`.bold.yellow);\n }\n\n /** @static\n *\n * Tagged information\n *\n * @param {string} tag\n * @param {string} str\n */\n static tagged(tag, str, color = 'yellow') {\n const formattedTag = `[${tag}]`[color];\n console.log(` ${formattedTag} ${str}`);\n }\n\n /**\n * @static\n *\n * Errors in bold red\n *\n * @param {string} err\n */\n static error(err) {\n console.log(`ERROR: ${err}`.bold.red);\n }\n\n /**\n * @static\n *\n * Additional information with generic formatting, line returns\n *\n * @param {string|array} lines\n */\n static extra(lines) {\n const combined = (Array.isArray(lines) ? ",
"lines : [lines]).join('\\n');\n console.log(combined);\n }\n}\n\nmodule.exports = Logger;\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.0020878093782812357,
0.0011420915834605694
] | 0.001615 | 2 |
[
"悪質なコードが埋め込まれた画像ファイル経由でマルウェアに感染させる攻撃方法が発見されたと、セキュリティ企業「Check Point Software Technologies」が明らかにしている。",
"\n\n（画像はCheck Point Software Technologiesの動画より）\n\n「ImageGate」と命名されたこの攻撃は、Facebookなどのソーシャルメディアを利用して拡散している。手法は次の通り。SNSにアップデートされた悪質なコードが埋め込まれた画像ファイルを利用者がダウンロード。このファイルをクリックした瞬間にマルウェアが実行される。",
"\n\n感染したランサムウェアがファイルを暗号化\n\n同企業は9月上旬からSNSでこの攻撃を確認しており、「画像をクリックしてブラウザがファイルのダウンロードを開始した場合は、ファイルを開かない。SNSのWebサイト上で、ファイルをダウンロードせずに写真を表示する」「見慣れない拡張子の画像ファイル（SVG、JS、HTAなど）を開かない」よう注意を呼び掛けている。",
"\n\n関連キーワード ファイル | ダウンロード | 感染 | マルウェア | SNS | 拡張子 | ランサムウェア | セキュリティ\n\n"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0014183389721438289,
0.0015620036283507943,
0.0020405487157404423,
0.001081937807612121
] | 0.001526 | 4 |
[
"Founded by directors and NEW INC members Teddy Goitom and Senay Berhe, Afripedia is a global platform created to unite and promote work from a new generation of artists, filmmakers, photographers, designers, musicians, and other creatives in Africa and its diaspora. ",
"By helping to circulate the work of contemporary artists, the project hopes to help change the world’s conversation surrounding Africa.",
"\n\nThe project started as a five-part documentary series displaying the vibrant art scenes of Angola, Senegal, South Africa, Kenya, and Ghana — the last two of which will be screened next week at National Sawdust, a Brooklyn-based and artist-led non-profit music venue. ",
"Put on in partnership with The Dillon Gallery, the films will paired with musical performances by Blinky Bill of Just A Band, a Kenyan Funk band and art collective, as well as Jojo Abot, a musical performer moving between Accra, Copenhagen, and New York.",
"\n\nFollowing the screening, Goitom and Berhe will join the musicians for a moderated conversation, led by Founder and Creative Director of Society HAE, Ngozi Oita."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006352969212457538,
0.000582589244004339,
0.000571876298636198,
0.0008151511428877711,
0.0005851530586369336
] | 0.000638 | 5 |
[
"UNITED STATES ARMY COURT OF CRIMINAL APPEALS\n Before\n KERN, ALDYKIEWICZ, and MARTIN\n Appellate Military Judges\n\n UNITED STATES, Appellee\n v.\n Master Sergeant PATRICK A. FAUST\n United States Army, Appellant\n\n ARMY 20090080\n\n Headquarters, 4th Infantry Division (Mechanized) and Fort Carson\n Jeffery R. Nance and Gregg A. Marchessault, Military Judges\n Lieutenant Colonel Tania M. Martin, Staff Judge Advocate (pretrial)\n Colonel Randy T. Kirkvold, Staff Judge Advocate (post-trial)\n\n\nFor Appellant: Captain James S. Trieschman, Jr., JA (argued); Lieutenant Colonel\nImogene M. Jamison, JA; Major Laura R. Kesler, JA; Lieutenant Colonel Scott R.\nLawson, JA (on brief); Major Richard E. Gorini, JA; Captain Matthew T. Grady, JA.",
"\n\nFor Appellee: Captain Steve T. Nam, JA (argued); Colonel Michael E. Mulligan,\nJA; Major Amber J. Williams, JA; Major LaJohnne A. White, JA; Captain\nChristopher B. Witwer, JA (on brief).",
"\n\n\n 8 January 2013\n\n ---------------------------------------------------\n SUMMARY DISPOSITION ON REMAND\n ---------------------------------------------------\n\nPer Curiam:\n\n A military judge sitting as a general court-martial convicted appellant,\npursuant to mixed pleas, of conspiracy to commit extortion, conspiracy to commit\nbribery (two specifications), disobeying a superior commissioned officer, violating a\nlawful general order, larceny, 1 extortion (four specifications), and bribery (two\nspecifications), in violation of Articles 81, 90, 92, 121, 127, and 134, Uniform Code\nof Military Justice, 10 U.S.C. §§ 881, 890, 892, 921, 927, 934 (2006) [hereinafter\n1\n The promulgating order incorrectly reflects that appellant was convicted of two\nspecifications of larceny: Specifications 1 and 2 (both as renumbered) of Additional\nCharge II (as redesignated). ",
"However, appellant was found not guilty of\nSpecification 1 (as renumbered) of Additional Charge II (as redesignated). ",
"The\npromulgating order is hereby corrected accordingly.",
"\n\fFAUST—ARMY 20090080\n\nUCMJ]. ",
"The court sentenced appellant to a bad-conduct discharge, confinement for\nthirty months, and reduction to the grade of E-1. ",
"2 The convening authority approved\nonly so much of the sentence as provided for a bad-conduct discharge, confinement\nfor twenty-eight months, and reduction to the grade of E-1. ",
"Appellant was credited\nwith six days of confinement credit against the sentence to confinement.",
"\n\n On 21 November 2011, this court issued a decision in this case, summarily\naffirming the findings and sentence. ",
"United States v. Faust, ARMY 20090080\n(Army Ct. ",
"Crim. ",
"App. ",
"21 Nov. 2011). ",
"On 11 July 2012, our superior court reversed\nthe portion of our decision as to Specifications 1 and 2 of Charge V, and as to the\nsentence, and affirmed our decision as to the remaining charges and specifications.",
"\nUnited States v. Faust, 71 M.J. 360 (C.A.A.F. 2012). ",
"The court returned the record\nof trial to The Judge Advocate General of the Army for remand to this court upon\nconsideration of United States v. Humphries, 71 M.J. 209 (C.A.A.F. 2012). ",
"Id.\nConsequently, appellant’s case is once again before this court for review under\nArticle 66, UCMJ.",
"\n\n In Specifications 1 and 2 of Charge V, appellant was charged with bribery in\nviolation of Article 134, UCMJ. ",
"See Manual for Courts-Martial, United States\n(2008 ed.), ",
"pt. ",
"IV, ¶ 66.b. ",
"The bribery specifications fail to allege the terminal\nelements of prejudice to good order and discipline or service-discrediting conduct.",
"\nPursuant to United States v. Fosler, 70 M.J. 225 (C.A.A.F. 2011), United States v.\nBallan, 71 M.J. 28 (C.A.A.F. 2012), and Humphries, it was error to omit the\nterminal elements from these specifications.",
"\n\n Under the totality of the circumstances in this case, we conclude that the\nomission of the terminal elements from the bribery specifications materially\nprejudiced appellant’s substantial right to notice. ",
"UCMJ art. ",
"59(a); Humphries,\n71 M.J. at 215. ",
"There is nothing in the record to satisfactorily establish notice of the\nneed to defend against a terminal element, and the evidence was controverted as to\nat least one clause of Article 134, UCMJ. ",
"See Humphries, 71 M.J. at 215–16\n(holding that to assess prejudice, “we look to the record to determine whether notice\nof the missing element is somewhere extant in the trial record, or whether the\nelement is ‘essentially uncontroverted’” (citing United States v. Cotton, 535 U.S.\n625, 633 (2002); Johnson v. United States, 520 U.S. 461, 470 (1997))).",
"\nAccordingly, we must disapprove the findings of guilty as to the Article 134, UCMJ,\nbribery offenses previously affirmed.",
"\n\n However, we are confident “that, absent any error, the sentence adjudged\nwould have been of at least a certain severity.” ",
"United States v. Sales, 22 M.J. 305,\n308 (C.M.A. 1986). ",
"In this case, the penalty landscape is minimally changed, as\n\n2\n The promulgating order incorrectly states that the court also adjudged a forfeiture\nof all pay and allowances. ",
"The promulgating order is hereby corrected accordingly.",
"\n\n\n\n 2\n\fFAUST—ARMY 20090080\n\nappellant would face a maximum sentence to confinement of twenty-six years for the\nremaining charges. ",
"3 In addition, the facts concerning the bribery specifications\nherein set aside would nonetheless have been before the military judge, because\nappellant was also charged with and convicted of a conspiracy to commit those very\nsame bribery offenses. ",
"Therefore, in light of the remaining charges and their serious\nnature, we are confident the court would have adjudged a sentence of at least a bad-\nconduct discharge, confinement for twenty-eight months, and reduction to the grade\nof E-1.",
"\n\n CONCLUSION\n\n On consideration of the entire record, and in light of Humphries, the findings\nof guilty of Specifications 1 and 2 of Charge V, and Charge V, are set aside and\nthose specifications are dismissed without prejudice. ",
"Reassessing the sentence on\nthe basis of the error noted, the entire record, and in accordance with the principles\nof Sales and United States v. Moffeit, 63 M.J. 40 (C.A.A.F. 2006), to include the\nfactors identified by Judge Baker in his concurring opinion in Moffeit, the approved\nsentence is AFFIRMED.",
"\n\n\n FOR\n FOR THE\n THE COURT:\n COURT:\n\n\n\n\n MALCOLM H.\n MALCOLM H. SQUIRES,\n SQUIRES, JR.",
"\n JR.",
"\n Clerk of Court\n Clerk of Court\n\n\n\n\n3\n The military judge merged three of the four extortion specifications for sentencing\npurposes, and he separately merged the two conspiracy to commit bribery offenses\nfor sentencing purposes.",
"\n\n\n\n 3\n\f"
] |
{
"pile_set_name": "FreeLaw"
}
|
[
0.0006821269635111094,
0.0006739434902556241,
0.001050467835739255,
0.0006691062008030713,
0.0006365915178321302,
0.0009136321023106575,
0.0012420854764059186,
0.0007469170959666371,
0.000664412509649992,
0.0005702825728803873,
0.0007376780267804861,
0.0018367550801485777,
0.000847632298246026,
0.0007069139974191785,
0.0006229128921404481,
0.0008450437453575432,
0.0006457578856498003,
0.0009128390229307115,
0.000726349011529237,
0.0006004233146086335,
0.001237388700246811,
0.0007568603614345193,
0.000773570325691253,
0.0007042234065011144,
0.0006212246371433139,
0.002114110393449664,
0.0009235254838131368,
0.0006965863867662847,
0.0006271525053307414,
0.0007595128263346851,
0.0006227523554116488,
0.0007418444729410112,
0.0006879704887978733,
0.0006365915178321302,
0.0025863402988761663,
0.0007333285757340491,
0.000844439200591296,
0.0007093542953953147,
0.0006499477894976735,
0.0006065545021556318,
0.0010649332543835044,
0.0007665787125006318,
0.000995183945633471
] | 0.000865 | 43 |
[
"Photodynamic potential of curcumin and blue LED against Streptococcus mutans in a planktonic culture.",
"\nThe photodynamic therapy (PDT) involves the use of light of specific wavelength to activate a nontoxic photosensitizing agent or dye in the presence of oxygen for eradication of target cells. ",
"In dentistry, this therapy is used to suppress the growth of microorganisms involved directly with dental decay and periodontitis process. ",
"There are evidences that curcumin dye is able to control microbial activity when illuminated with specific wavelength. ",
"The purpose of this study was to evaluate the in vitro efficacy of PDT using curcumin dye (Cur-C) in combination with a blue LED (L) device on a planktonic model of Streptococcus mutans (S. mutans). ",
"Suspensions (0.5 mL) containing S. mutans at 1×10(7)CFU mL(-1) were prepared and divided into 4 groups: Group C-L- (control: no treatment and 1 experimental condition), Group C+L- (curcumin at 3 different concentrations: 2000; 4000 and 8000 μM and 3 experimental conditions), Group C-L+ (LED at 3 different dosages: 24, 48 and 72 Jcm(-2) and 3 experimental conditions), and Group C+L+ (PDT group: curcumin at respective concentrations combined to LED dosages and 9 experimental conditions). ",
"Samples of each experimental condition were cultured in Petri dishes of BHI agar. ",
"Incubation in micro-aerophilia at 37°C for 48 h was performed for subsequent visual counting of CFU/mL. Data were transformed into log10 and analyzed by two-way ANOVA and Tukey's test at p<0.05. ",
"Group C+L+, in specific experimental conditions, demonstrated a log bacterial reduction 70% higher than Group C-L-. ",
"Both groups C-L+ and C+L- presented a slight decrease in log bacterial counting. ",
"This in vitro method was able to reduce the number of S. mutans in a planktonic suspension."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0007887062383815646,
0.000685886072460562,
0.001037068315781653,
0.0006200956995598972,
0.0006723387050442398,
0.0005978653789497912,
0.0006910731317475438,
0.0006343935383483768,
0.0006176817114464939,
0.0006428953493013978,
0.0007927166880108416
] | 0.000707 | 11 |
[
"There's No Reason to Write OpenAPI By Hand Phil Sturgeon · 10 min read\n\nSome API developers use API descriptions to plan the interface of an API before building it, which is known as the \"API design first\" workflow. ",
"Others build the API then generate (or manually produce) API descriptions later, which is the \"code-first\" workflow. ",
"We wrote API Design-first vs Code-first recently to help get you up to speed on the differences, but how do you actually create these API descriptions?",
"\n\nMany of these API descriptions (OpenAPI, JSON Schema, or GraphQL Schemas) involve writing out a bunch of special keywords in YAML, JSON, or another text language. ",
"Neither the design-first or code-first crew enjoy writing thousands of lines of that by hand. ",
"Why? ",
"Well, say you've got a list of integers:\n\nschema : type : array description : List of IDs items : type : integer description : Pet ID\n\nDesigning an API with 100 endpoints like that will get you through at least one keyboard (maybe two if it's a Macbook). ",
"Designing a few APIs could drive you bonkers.",
"\n\nLet's look at some alternatives to hand-rolling your own homegrown artisanal YAML, and how these approaches fit into design-first or code-first. ",
"More importantly, let's see how they can be used to achieve the ultimate goal for API designers: one source of truth for API descriptions that power mocks, documentation, request validation, shareable design libraries, and more.",
"\n\nAnnotations\n\nSome programming languages support a syntax-level feature called \"Annotations\", for example Java Annotations. ",
"An OpenAPI annotation framework provides a bunch of keywords that help the API developer describe the interface of the HTTP request and response, and hopefully it's telling the truth.",
"\n\nclass UserController { @OpenApi ( path = \"/users\" , method = HttpMethod . ",
"POST , ) public static void createUser ( Context ctx ) { } }\n\nSome languages do not have any support for annotations, and they achieve this with docblock comments.",
"\n\npublic function getUserByName ( $username , $newparam ) { }\n\nIn JavaScript it looks a bit like this:\n\napp . ",
"get ( '/users' , ( req , res ) => { } ) ;\n\nThis approach is the oldest around, and is primarily used by the code-first people. ",
"It's easy to understand why: you wrote the code already, so now lets get some docs! ",
"Sprinkle some keywords around the code, and the annotation system will integrate with your framework to emit a /docs endpoint, and boom, you've got some documentation. ",
"Great, if all you want is documentation.",
"\n\nDesign-first people also sometimes use this approach. ",
"They design the entire API (writing YAML by hand or with one of the other approaches we're going to mention), then use Server Generators like openapi-generator or swagger-generator to create their API code. ",
"This API code is created from the machine-readable documents that were made in the design process, and the code that is generated is chock full of annotations already, which in turn can generate documentation. ",
"Throw those machine-readable documents away, the annotated code is the source of truth now... right?",
"\n\nOne downside to annotations is that they don't confirm the code is doing what it says. ",
"I've heard the argument \"Annotations are closer to the code they describe, so developers are more likely to keep it up to date\". ",
"Do not confuse proximity with accuracy. ",
"Developers can forget to make the changes, and developers can make mistakes.",
"\n\nAnnotation users need to find a way to contract test the actual output against these annotations, which we've written about before in Keeping Documentation Honest.",
"\n\nThe tools in this article generally involve the machine-readable OpenAPI / JSON Schema files around, so you need to export them back to a machine-readable format in order to compare them to the code... This means running a command in the command line which pulls the annotations out into a machine-readable file, then running a tool like Dredd or a JSON Schema validators, which is a pretty awkward step.",
"\n\nDesign-first is incompatible with all this, unless you chose to design the API, then generate code with annotations, then figure out how to keep the code, the annotations AND the machine readable designs up to date. ",
"If there's anything worse than two sources of truth it's three...\n\nFor this reason, folks who like design-first run and hide from annotations, but the folks who like annotations generally really really love them because to them their code is the source of truth and if they can crowbar one of these test suites in to confirm that then they're perfectly happy. ",
"This mindset can lead to API clients being a bit of an afterthought, but that's another topic for another article.",
"\n\nDSL (Domain Specific Language)\n\nA few DSLs popped up over the years, created by people who wanted to create API Descriptions, but didn't fancy writing it out in that specific format, with articles like Making OpenAPI / Swagger Bearable With Your Own DSL.",
"\n\nDSL's can be used in code-first or design-first. ",
"You have your code, you have your DSL-based descriptions, and whatever format they were written in doesn't make much difference here.",
"\n\n;;; ENTITIES (define pet-entity (entity \"Pet\" 'race (string \"What kind of dog / cat this is (labrador, golden retriever, siamese, etc...)\" \"Labrador\") 'origin (string \"Country of origin\" \"Egypt\") 'birthday (datetime \"Birth date of the pet\" \"2017-10-20T00:14:02+0000\") 'species (string \"What kind of animal is this\" \"dog\" #:enum '(\"dog\" \"cat\")))) (define $pet (schema-reference 'Pet pet-entity)) ;;; RESPONSES (define list-pets-response (jsonapi-paginated-response \"List of pets\" ($pet))) ;;; REQUESTS (define pet-request (json-request \"Pet Request Body\" ($pet))) ;;; MAIN DOC (define swagger (my-service-api-doc \"Pet Store\" \"Per store pets management\" (path \"/pets\") (endpoint-group 'tags pet-tags 'parameters (list store-id-param) 'get (endpoint 'operationId \"listPets\" 'summary \"Retrieve all the pets for this store\" 'parameters pagination-params 'responses (with-standard-get-responses 200 list-pets-response)) 'post (endpoint 'operationId \"createPet\" 'summary \"Create a new Pet record\" 'requestBody pet-request 'parameters (list xsrf-token) 'responses (with-standard-post-responses 200 single-pet-response)))\n\nThis is shorter than the OpenAPI YAML it replaces, but it's also another format for people to learn. ",
"People who know how to write up OpenAPI will need to learn this format, and the folks familiar with a different DSL will have to learn this format too. ",
"Your editor will also need to learn about this format if you want autocomplete, syntax highlighting, linting and validation. ",
"The \"native\" description formats all have this, but these DSLs usually do not.",
"\n\nThis approach, just like annotations, do not help you ensure that what you're writing in the DSL is actually correct. ",
"The contract written down in the description could be completely incorrect. ",
"Some DSLs like RSawg aim to solve this by having their DSL be written as integration texts. ",
"The source of truth for how you create OpenAPI is literally integration tests:\n\ndescribe 'Blogs API' do path '/blogs/{id}' do get 'Retrieves a blog' do tags 'Blogs' produces 'application/json' , 'application/xml' parameter name : :id , :in = > :path , :type = > :string response '200' , 'blog found' do schema type : :object , properties : { id : { type : :integer } , title : { type : :string } , content : { type : :string } } , required : [ 'id' , 'title' , 'content' ] let ( :id ) { Blog . ",
"create ( title : 'foo' , content : 'bar' ) . ",
"id } run_test ! ",
"end end end end\n\nThis approach is pretty handy for Test-driven development (TDD) advocates, but you're just writing OpenAPI in another form which isn't particularly any shorter, just more Ruby-ish. ",
"RSwag was a big favourite at my last job, but it's had a rough time getting updated onto OpenAPI v3.0 (still a work in progress 3 years after OpenAPI v3.0 was released).",
"\n\nWriting in a DSL or annotations means you're at the mercy of that maintainer to support functionality that you could already use if you could just... edit the OpenAPI yourself.",
"\n\nGraphical Design Editors\n\nWhat is the alternative to editing the files but now having to wrangle YAML? ",
"Visual thinkers and non-technical people might want a wizard mode, the ability to create arrays of objects with a few buttons, and selection boxes for shared models without having to think about the filepath. ",
"Graphical design editors are pretty new in the world of OpenAPI and GraphQL, with a few popping up over the last year or two.",
"\n\nStoplight Studio main form editor view, showing some the `$ref` selector for picking OpenAPI models.",
"\n\nTwo years ago I was looking around for a beautiful, effective graphical editor to satisfy some code-first sticklers pushing back against API design-first at WeWork. ",
"I figured a GUI would help them convert, and Stoplight told me they were planning a new GUI. ",
"Shortly after seeing their amazing prototype I joined the company to help roll it out to even more folks, and now my job is gathering feedback from the API community to make Studio, our open-source tools, and the upcoming SaaS platform even better. ",
"🥳\n\nModern GUI editors have mocks and docs publishing built right in so you no longer have to figure out your own \"DocOps\". ",
"Editors like Stoplight Studio add \"Design Libraries\", where you can manage shared models between multiple APIs in an organization. ",
"These editors support organization-wide style guides to have the editor lint during editing (and/or in continuous integration) to enforce consistency, and a bajillion other things.",
"\n\nStoplight Studio with Spectral linting results from a custom rule written to stop folks designing a GET endpoint with a body.",
"\n\nThere are a bunch of different OpenAPI-based graphical editors around, check out our list on OpenAPI.Tools:\n\nGraphQL fans, who are having a lot of the same conversations right now, can check out these:\n\nSome editors will help you with part of the API design life-cycle, but make a lot of difficult assumptions about what order you're going to do what in. ",
"They might help you create a design, then they'd assume you wanted to export it and generate some code, leaving your machine-readable description documents floating around to become obsolete, and giving you no way to edit them even if you wanted to. ",
"Other tools let you import an OpenAPI document, but convert it to their own internal format and provide no way to pull the OpenAPI back out again.",
"\n\nUsing tools where the format changes entirely at different points locks you into whatever workflows they support, instead of letting you plug-and-play your own tooling at every stage of the process. ",
"For me the ideal solution is supporting a git-based flow, where they live in the repository (maybe before the code exists), and regardless of how these API descriptions were created you can edit them and send a pull request back to that repo with the changes you made.",
"\n\nLeaving the machine-readable source of truth in the repo means any integrations are possible. ",
"Continuous integration processes can deploy documentation to any documentation provider, you can use use any code-generators to build and publish SDKs, sync with popular HTTP clients like Postman or Insomnia instead of maintaining API descriptions and bookmarks, and fully take care of contract testing in-repo or end-to-end repositories. ",
"If your editor is backed by a design library then the repositories will be analyzed on push, allowing others to use these updated models instead of having 1000 different versions of a \"User\", \"Company\" or a \"Flight\".",
"\n\nThe main Stoplight Explorer dashboard, providing search across all APIs in an organization. ",
"This has only been available for Enterprise users, but is available for everyone this April.",
"\n\nBut, how does having an editor help you catch mistakes? ",
"Stoplight Studio has a built in HTTP Client, which amongst other things is watching for mismatches between the OpenAPI defined for the API and the actual HTTP requests you send. ",
"It will also notice mismatches between OpenAPI and the responses coming back, so you'll see mistakes popping up like this:\n\nNoticing contract mismatches in a HTTP client is all well and good for spotting mistakes in requests you're making, but you'll want to automate this checking too.",
"\n\nInstead of having all your model validation rules and header checking written in code, and then also writing it down in the API descriptions, use the existing machine-readable descriptions for validating incoming requests. ",
"If your request logic is powered by API descriptions, there is no need to check that it matches the code, because it... is the code. ",
"Framework middlewares for every framework and every language implement this. ",
"NodeJS has about 100.",
"\n\nThe Rails one, for example, takes a single line to set up the Rack middleware:\n\nuse Committee : : Middleware : : RequestValidation , schema_path : \"./openapi.yaml\"\n\nThat covers incoming requests, but how to ensure the responses are doing the right thing? ",
"Some of those middlewares will implement response validation too, which can confirm the response coming through it matches the code. ",
"This is a great thing to enable in dev and staging, but turn that off for production. ",
"🤣\n\nAnother approach to checking responses is contract testing. ",
"Instead of having some DSL-based integration testing suite specifically for checking the responses, or using some other tool where you have to write out the contract again, you can can just use the API descriptions as contract tests. ",
"So easy, and all it takes is a few lines of code to mush the response into a data validator for the API description format of your choice.",
"\n\nAnother approach is using Prism Proxy in end-to-end testing to blow up if any requests or responses are invalid throughout the test suite. ",
"This can be implemented with little to no buy in from the folks producing the APIs, because you can just funnel existing cross-API traffic through the proxy in the testing environment without modifying any code.",
"\n\nCode first and editors do not jive at all, because the editors do not understand the annotation system in the Java/PHP/Pyhton/etc sourcecode. ",
"According to an extremely scientific poll on my Twitter, 35% of teams are battling through with a mixture of code-first and design-first.",
"\n\nSo long as the code-first folks add a build step (pre-commit or in CI) to generate a machine-readable file in the filesystem (like openapi.yaml ), then hosted solutions like Stoplight Platform can analyze repo contents to give the same hosted docs, mocks, and design libraries, to all the projects. ",
"No editing for them of course, but those who want editors are on the same remaining workflow as those who don't. ",
"🥳\n\nAnnotations-as-Code Web Frameworks\n\nMany web-frameworks third-party support for request/response validation, which we've mentioned above. ",
"This is usually in the form of middlewares or just baked right in, and they read API descriptions from the filesystem.",
"\n\nOther frameworks have first-party or third-party support for annotations, which are purely descriptive repetitions of the actual code they sit above at best. ",
"At worst they're just lies.",
"\n\nThere is a new category of API description integration popping up in some web frameworks which is somewhat like Annotations or DSLs, but instead of being purely descriptive it's actually powering logic and reducing code, giving you one source of truth. ",
"Effectively they do the same thing as the machine-readable powered validation middlewares, but instead of coming from openapi.yaml the logic is coming from the annotations.",
"\n\nHere's an example from tsoa, which is a TypeScript and NodeJS framework for building OpenAPI-compliant REST APIs.",
"\n\nimport { Body , Controller , Get , Header , Path , Post , Query , Route , SuccessResponse } from 'tsoa' ; import { User , UserCreationRequest } from '../models/user' ; import { UserService } from '../services/userService' ; @ Route ( 'Users' ) export class UsersController extends Controller { @ Get ( '{id}' ) public async getUser ( id : number , @ Query ( ) name : string ) : Promise < User > { return await new UserService ( ) . ",
"get ( id ) ; } @ SuccessResponse ( '201' , 'Created' ) @ Post ( ) public async createUser ( @ Body ( ) requestBody : UserCreationRequest ) : Promise < void > { new UserService ( ) . ",
"create ( request ) ; this . ",
"setStatus ( 201 ) ; return Promise . ",
"resolve ( ) ; } }\n\nThis is a brand new approach. ",
"Instead of descriptive annotations or comments shoved in as an afterthought, the API framework has been designed around the use of annotations.",
"\n\nBeyond simple things like request validation, TSOA handles authentication quite nicely. ",
"Numerous times I've seen API documentation say bearer tokens are required, or an OAuth token needs a certain scope, only to find out the developer forgot to register that in the API controller. ",
"Free sensitive data anyone?",
"\n\nTSOA solves that by having you register security definitions, then reference them in your annotations, and have middlewares created to handle the actual logic. ",
"This way the annotations are all the actual source of truth for authentication, instead of just being lies in comments or YAML.",
"\n\nThen, OpenAPI can be generated from a command:\n\ntsoa spec\n\nWhilst I definitely have a preference for design-first development for all the prototyping benefits it brings (changing a few lines of YAML in an awesome GUI is easier than rewriting a bunch of code every time you get feedback on a prototype), this new approach for making annotations useful is very much closing the gap. ",
"If you're going to use a code-first approach, you should absolutely try and find a framework like TSOA to power your API and reduce the chance of mismatches.",
"\n\nIdeally the file-based middlewares and these new annotation-driven middlewares would share a bunch of dependencies. ",
"As I mentioned before there's a million of these file-based validation middlewares out there, and some get more love and attention than others. ",
"I convinced three PHP request validation middleware authors to combine efforts and make one amazing one, so it'd be great if some of these other middleware developers could team up with some annotations-as-code framework people to allow them as inputs to their existing middleware. ",
"With OpenAPI v3.1.0 coming out soon, it'll be a lot better for us tooling vendors to start collaborating on a smaller number of higher quality tools, instead of everyone battling through the upgrade process individually.",
"\n\nWhatever you're up to: code-first, or design-first, make sure you're doing what you can to avoid maintaining two sources of truth. ",
"Of all the options possible, try and stick to:\n\na) awesome editors like Stoplight Studio or GraphQL Designer to maintain API description documents, then reference them in the code, or\n\nb) frameworks which support annotations-as-code that knows how to express itself as API descriptions\n\nJust don't maintain code and descriptions separately, because having two sources of truth just means waste time trying to find out which one of them is lying."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0006477194838225842,
0.0006702284445054829,
0.0005663014017045498,
0.0006521977484226227,
0.0006189726409502327,
0.0009686383418738842,
0.0006772448541596532,
0.039259832352399826,
0.0076167285442352295,
0.0005669391830451787,
0.0006378808757290244,
0.0005811767186969519,
0.0009062859462574124,
0.0007963420357555151,
0.0007400974864140153,
0.0007528694695793092,
0.0017324183136224747,
0.0006851755315437913,
0.0006251402082853019,
0.0005694441497325897,
0.0006746574654243886,
0.0007256253738887608,
0.001164476852864027,
0.001194162294268608,
0.0005483284476213157,
0.000723866221960634,
0.0006684162653982639,
0.0006331055192276835,
0.0006067522335797548,
0.0006047626957297325,
0.0006803390569984913,
0.0009667999111115932,
0.0007100779912434518,
0.0005791467847302556,
0.0010574995540082455,
0.000905070046428591,
0.0005738955223932862,
0.0005767272086814046,
0.0006553031271323562,
0.0007683979929424822,
0.0005670594400726259,
0.001068015699274838,
0.0006539056194014847,
0.0006730080349370837,
0.0024877043906599283,
0.0005933246575295925,
0.0008287934469990432,
0.0011705349897965789,
0.001983857015147805,
0.0006027693161740899,
0.0006206033285707235,
0.0005818925565108657,
0.000550722936168313,
0.0006470211083069444,
0.0005228095687925816,
0.0009652762091718614,
0.0006259215297177434,
0.0006811840576119721,
0.0005944482400082052,
0.0005698182503692806,
0.0006559763569384813,
0.0007106426055543125,
0.0006855661631561816,
0.0006028090137988329,
0.0006683522369712591,
0.0006244426476769149,
0.000556405633687973,
0.0005986705073155463,
0.0005758884362876415,
0.0007516242912970483,
0.0006318631931208074,
0.0006095642456784844,
0.0006234150496311486,
0.000632853654678911,
0.0006495715933851898,
0.0007320658187381923,
0.0006202762597240508,
0.0005735584418289363,
0.0006604430382139981,
0.0006525767385028303,
0.0005667890072800219,
0.0006743287085555494,
0.0017402496887370944,
0.0006024810718372464,
0.0006467084749601781,
0.0006208071135915816,
0.0006391091737896204,
0.000624711683485657,
0.000617543701082468,
0.0006236584158614278,
0.000597403384745121,
0.16117358207702637,
0.0006270398152992129,
0.0006629105773754418,
0.0006732030306011438,
0.0007160211680456996,
0.0008076309459283948,
0.0007431145058944821,
0.0006404283340089023,
0.0006628518458455801,
0.000728077779058367,
0.0005371724255383015,
0.0006299128872342408,
0.0007013962604105473,
0.0006946343928575516,
0.0018059259746223688,
0.000609518145211041,
0.0007168835145421326,
0.0006806578021496534,
0.0006614616140723228,
0.0005507809109985828,
0.0005561806028708816,
0.000659922428894788,
0.0024412851780653
] | 0.002559 | 114 |
[
"This institutional DSA program has graduated a total of eight clinical scholars. ",
"In addition, four clinical scholars were trained on individual DSA/PSA awards. ",
"Four clinical scholars funded by other mechanisms have also graduated. ",
"Ten other graduates have been funded through other sources. ",
"Thus, our training history is a total of twenty-six graduates. ",
"Six of the present roster of ten active students are in combined programs, attesting to our commitment to combined certificate/Ph.D. training. ",
"All of our DSA clinical scholars have completed their certificate and Ph.D. programs and have entered productive careers; no one has defaulted either by leaving the program or by entering private practice. ",
"The clinical scholars who are positioned to obtain independent funding have done so; 89% are funded. ",
"The programs, both clinical and graduate, accommodate their schedules to ensure efficient and successful progress through the program. ",
"Because of the diversity and complexity of oral disease, training is focused on basic biological problems related to the oral cavity in health and disease rather than a single discipline- centered program. ",
"The organization of a faculty of basic scientists and dental and medical clinicians in this training program has permitted us to offer a range of opportunities for students of dental health and disease. ",
"In addition, research centers in chemosensory systems, dental and general clinical research and biomaterials have fostered the active participation of the Oral Biology Graduate Faculty (OBGF) in the clinical and scientific education of clinical scholars by serving as mentors for their research. ",
"Because the faculty are engaged in multidisciplinary collaborations, individually and through research centers and program projects, the OBGF is diverse, is drawn from all segments of the Health Center and represents a range of investigative expertise and interests. ",
"This mix of clinical programs and manifold research opportunities provides a dynamic and stimulating training environment. ",
"Consequently, the research projects devised for our students have had a similar breadth and scope. ",
"The objective of this program is to offer a program that produces highly qualified clinical scholars competent in their clinical disciplines and as independent scientists able to initiate and maintain funded research programs. ",
"In addition, the program will provide educational experiences that are tailored to each candidate, while maintaining a focus in the oral biological sciences through seminars, courses, clinical research centers and collaborative research activities."
] |
{
"pile_set_name": "NIH ExPorter"
}
|
[
0.0005974158993922174,
0.000537053681910038,
0.0005710766999982297,
0.0005725094815716147,
0.0005733884172514081,
0.000537751882802695,
0.0006079345475882292,
0.0005447283620014787,
0.0005199519800953567,
0.0006528625381179154,
0.0005499633261933923,
0.0005650524399243295,
0.0005523051950149238,
0.0005385206895880401,
0.000546219467651099,
0.0005758263287134469,
0.0005222213221713901
] | 0.000563 | 17 |
[
"MARCH 2018\n\nTranslate\n\nAmazon Contextual Product Ads\n\nFriday, November 28, 2008\n\nI have stumbled upon what may be the secret pattern to world events. ",
"It rests upon three pillars of wisdom, and they have nothing in common with the seven pillars elucidated by T.E. Lawrence (of Arabia). ",
"The have to do with a Tin Pan Alley song writer, and a ski resort in New England, and a disgraced American politician. ",
"I’ll prove it to you.",
"\n\nI would say that Jimmy Kennedy was a lyrical genius. ",
"Thank God he turned down that job offer from the English Foreign Service in Nigeria. ",
"Otherwise we would have been cheated out of such evocative lyrics as, “South of the bor-der, down Mexico way. ",
"That’s where I fell in love when the stars came out to play. ",
"And now as I wander, my thoughts ever stray, south of the bor-der, down Mexico way”. ",
"He wrote that, in classic Tin Pan Alley fashion, after seeing a post card of Tijuana.",
"\n\nAnd then there was his magical, “You put your left hand in, you take your left hand out, you put your left hand in and you shake it all about.” ",
"Yea, he was a genius, alright.",
"Jimmy was an Irishman, and so English –English was a second language to him, which may help explain his lyrics for “Every gal in Cons-tan-tinople, lives in Istanbul, not Con-stan-tinople, so if you've got a date in Cons-tan-tinople, she'll be waiting in Istanbul.” (",
"The name was officially changed in 1930, at the behest of the Turkish Post Office.)",
"\n\nBut my favorite Jimmy Kennedy lyric remains the vaguely ominous drumbeat of “If you go down to the woods today you’re sure of a big surprise. ",
"If you go down to the woods today you better go in disguise. ",
"For every bear that ever there was will gather there for certain because today’s the day the teddy bears have their pi-cnic.",
"”I have a long held the image of the “Teddy Bears Picnic” being sung by that looming giant of economists, John Maynard Keynes. ",
"Can’t you just hear him croaking in his perfectly correct Eton English? “",
"If you go down to the woods today you better not go alone. ",
"It’s lovely down in the woods today, but safer to stay at home.” ",
"I can.",
"\n\nAnd by woods, I mean \"Bretton Woods\", the New England ski resort invaded in June-July of 1944 by 730 of the best economic brains in the world, of which Keynes was the very best. ",
"The American economists were the bears and they were there to picnic upon the corpse of the British Empire, and John Maynard Keynes had the unenviable (for an Englishman) assignment to acting as the maître d'. ",
"Would you like to know what kind of an economist Keynes was? ",
"He was married to a ballarina, that's what kind of an economist he was. ",
"He was attracted to drama. ",
"Interesting, for a student of \"the dismal science\" of economics.",
"\n\nAmongst the things settled at Bretton Woods was how to structure the world’s economy after World War II. ",
"It was clear to everyone that the lead would have to be taken by the United States, because we were the only nation that ended the war with more gold than we had started with. ",
"It’s the golden rule; he who has the gold makes the rules. ",
"But it just seemed less tacky that the idea would be put forward by a Brit rather than by an American. ",
"So the Bretton Woods accords, presided over by Keynes, tied all of the world’s monetary systems (the pound, the franc, the yen) to the American dollar, because each and every ounce of gold in America’s vaults was officially represented by 35 dollars . ",
"And nobody else in the world could make that claim. ",
"Then.",
"But things change over time, and eventually we Americans tried to pay for our “Great Society” and the Vietnam War, both at the same time, and both without raising taxes. ",
"You know what? ",
"You can’t do that, no matter how many voters may want to believe that you can, you can’t, as George Bush Jr. could now explain if he had two neurons worth of introspection .",
"\n\nNewly elected President Richard Nixon tried to close the budget deficit by shutting down many of the anti-poverty programs started by the Democrats. ",
"But those programs were far too small a fraction of the Federal budget to stop the bleeding of dollars. ",
"A Massachusetts Institute of Technology study done in 1971 calculated the real cost of the Vietnam War (in 1971 dollars) was then about $750 billion, equal to the Wall Street bailout thirty-five years later that caused all the conservatives to flinch.(“Vietnam; Past and Present” by D.R. SarDeasai).",
"\n\nThe obvious pressure in 1969 when he took office was for Nixon to increase taxes to pay for the war. ",
"But that would have made the war even more unpopular than it already was. ",
"And having been elected on his pledge to end the war “with honor”, Nixon didn’t yet have a way out of the war, and he was not willing to be a one term president. ",
"So he continued the war, and he did not raise taxes.",
"The immediate effect was that the U.S. was plagued by both inflation and a stagnant economy, called “Stagflation”. ",
"Wages were stuck. ",
"The nation was losing jobs because the Federal deficits were gobbling up all the available dollars. ",
"Businesses couldn’t borrow, so they were shutting down. ",
"And, as I recall, that was when hamburger jumped from 35 cents a pound to something closer to a $1.25 a pound. ",
"It is not the same situation we face today, but at the time it was an untenable situation. ",
"But “Tricky Dick” eventually found a way to make it \"tenable\". ",
"He took America off the gold standard.",
"In the stroke of a pen the dollar was no longer backed by gold. ",
"That’s when the treasury stopped issuing real dollars and started issuing “silver certificates”. ",
"Read your dollar sometime. ",
"With out the limit of gold reserves on the treasury, the printing presses were free to work overtime, and suddenly you could print enough money to afford any war you wanted for however long you wanted.",
"\n\nIn 1971 thirty-five dollars could buy an ounce of gold, by November of 2008 it would take $816.40 to buy that same ounce of gold. ",
"That is what you call inflation. ",
"In 1971 the minimum wage, which is a “lagging indicator of inflation” was $1.60 an hour. ",
"By 1981 was $2.50 an hour. ",
"It had doubled in ten years. ",
"Ten years later it was at $3.80 an hour.",
"This period also saw the introduction of the computer into the general economy, so a great deal of new wealth was also being created. ",
"But that only masked the growing instability of the new monetary system Nixon had placed us on. ",
"Economists call it “Floating Currency” but I call it the “Trust Economy”. ",
"There is no longer any gold behind your dollar, and, really, there is no silver, either. ",
"You trust that your dollar will provide you with goods and services of value.",
"I don’t blame Nixon for our current mess. ",
"Politicians are not hired to create perfect systems, just systems that can function for the time being. ",
"But what the sub-prime mortgage fiasco has proven, and the dot-com bubble proved before that, and the Savings & Loan debacle proved before that, is that without regulation there can be no trust. ",
"To quote Ronald Regan; “Trust and verify.” ",
"And to quote French President Sarkozy, “We must rethink the financial system from scratch, as at Bretton Woods”. ",
"And this time we (the United States) ain’t got the gold, so we ain’t making the rules. ",
"Those days are past. ",
"Or as Jimmy Kennedy put it, “No, you can't go back to Con-stan-tinople, been a long time gone, Con-stan-tinople, Why did Con-tan-tinople get the works? ",
"That’s nobody's business but the Turks.” ",
"Words of wisdom to ponder as we enter the woods again.",
"\n\nWednesday, November 26, 2008\n\nI have some shocking news for you. ",
"The man in the Iron Mask was not Leonardo DiCaprio. ",
"And anyway, he didn’t wear an iron mask. ",
"I mean, the first time you drool in your sleep an iron mask would rust shut. ",
"It was a velvet mask. ",
"And he was not the twin of King Louis XIV or any other Louie. ",
"Who he was seems to have been mixed up in what is called “The Affair of the Poisons” which is a morality tale of a cute little love-sick tramp with the affinity for “inheritance powders”, and her amoral boyfriend. ",
"Throw in the King’s mistress for a little spice, and you have a recipe for what Alexis de Tocqueville called “L’Ancien Regime”, and what in modern terms we would call a soap opera of the rich and infamous. ",
"It leaves me wondering why they waited so long to start chopping off heads.",
"\n\nWe begin in 1659, with a little tramp named Marie Madeleine Margherite D’Aubray Brinvillers. ",
"We’ll call her Maire for short. ",
"I don’t think she’ll mind. ",
"Marie was a tiny doll of a woman who seems to have committed no major public sins until she was about thirty when her husband introduced her to a handsome cavalryman named Godin de Sainte-Croix, to whom the husband owed a whole bunch of money. ",
"Hubby had to move out of the country to avoid his other creditors, and he left Marie behind as a sort of payment on account for Sainte-Croix. ",
"Marie didn’t seem to mind this arrangement, and neither did Sainte-Croix. ",
"Except, as much fun as Sainte-Croix had with little Marie, she wasn’t making him any richer. ",
"Where, oh, where was Sainte-Croix going to find enough money to live in the style to which he wanted to grow accustomed to? ",
"Sainte-Croix developed a multi-step plan. ",
"Step one was to encourage Marie to do some charity work. ",
"Step two was for Sainte-Croix to make the acquaintance of certain people with a knowledge of chemistry, such as a man known only to history by the name of “Auguer”.",
"Now, in the days before CSI the only way to prove poisoning - as opposed to just an unhygienic cook - was to catch the suspect pouring poison on the food, or get him to confess. ",
"This is why torture was so popular for so long. ",
"It never failed. ",
"No matter who you arrested, ten minutes with them on the rack and your case would be solved. ",
"But if your suspect was too connected to be tortured the only alternative was to lock him up while you slowly collected evidence. ",
"It might take decades. ",
"And during that time witnesses could be bought off, killed off, or just die of natural causes. ",
"It all made for the convoluted plots of some very popular French novels.",
"\n\nSo when poor people started dropping dead at the hospital where Marie volunteered, nobody took notice. ",
"They were poor people. ",
"In 17th century France the streets were littered with dead poor people. ",
"So when Marie had perfected the formula she had gotten from Sainte-Croix, which she did in 1666, she had no trouble slipping the poison into her father’s lunch. ",
"He died suddenly and his little darling inherited a little money, which she and Saint-Croix eventually burned through. ",
"So in 1670 Marie poisoned her two brothers. ",
"She inherited a little more money. ",
"By now, the heirs in the Brinvillers family were getting nervous. ",
"But still nobody suspected the little elf Marie. ",
"She was too cute. ",
"Cute people can’t be serial murderers. ",
"And just when the homicidal little pixie was about to knock off her own mother, Gordin Sainte-Croix unexpectedly dropped dead himself. ",
"Mon Dieu! ",
"Cele semble suspecte?!The cops were brought in. ",
"They uncovered a hand written confession by Sainte-Croix (Why do upper crust muderers always feel the need to write it down?). ",
"And they also found a list of names of satisfied customers who had been directed by Sainte-Croix to Msr. ",
"Auger. ",
"The list included little Marie, but it also included Madame de Montespan, who was Louis XIV’s mistress – which in pre-revolutionary France was almost a cabinet position - and the Duchesse of Orleans, Louis’s sister-in-law. ",
"Marie panicked. ",
"The cops were not going to torture the King’s mistress, but they would have no hesitation about putting a cutie like Marie on the rack. ",
"She ran off to her husband in exile. ",
"But she was now infamous and he wanted nothing to do with her. ",
"So Marie signed herself into a convent in Liege, Belgium.",
"This placed the pious nuns running the convent in a moral bind. ",
"They were sworn to provide sanctuary to all who asked for it, but on the other hand, how do you solve a problem like Marie? ",
"How do you catch a cloud of suspicion and pin it down? ",
"The good sisters consulted scripture and after due deliberations decided to rat out their guest. ",
"They allowed a cop disguised as a priest to enter the convent and while offering solace to the trouble little lady he escorted Marie right out the front gate, where she was immediately arrested. ",
"Marie was brought back to Paris in chains, tortured for a confession, tried in secret, and on July 16, 1676 she was forced to drink eight pints of water… and then mercifully she was beheaded. ",
"And just to be sure, they then burned her corpse. ",
"And that is how you solve a problem like Marie.",
"It looked like all hell was about to break loose in France, but just before it did...Louis XIV ordered all further investigations to cease. ",
"He shut it down. ",
"Nobody ever asked Madame Montespan or the Duchesse of Orleans how their names came to be on a list of people who had bought “inheritance powders”. ",
"But there was still one big problem oustanding: Msr. ",
"Auger. ",
"Who was he, and what did he know? ",
"And more importantly, did he have any plans to write his memories? ",
"And what does any of this have to do with Leonardo DiCaprio?Nothing: like I said, the “Man in the Iron Mask” was really the “Man in a Velvet Mask” and that just sounds too fey for a novel. ",
"Ask yourself - why would the King of France keep someone locked in one prison after another for decades, required to wear a mask at all times in front of strangers and not allowed to converse with anyone, even with his jailers? ",
"It’s too complicated. ",
"James Bond villains have simpler plans than that. ",
"Why not just kill him? ",
"You don’t even need a trial, let alone a secret trial. ",
"By the middle of the 17th century the one thing France had a surfeit of besides starving peasants, was nobility with no morality. ",
"Louis could have knocked off every royal mass murderer from “Auger” to the Marquis de Sade and nobody would have said “Boo”. ",
"If you ask me this story is mostly a fantasy invented by Alexande Dumas. ",
"And wasn’t the truth just as entertaining as the myth? ",
"Not to Marie's relatives, of course, but for you? ",
"It was for me.",
"\n\nMonday, November 24, 2008\n\nI wonder how many people worked in the advertising department at the Cole Motor Company in Indianapolis? ",
"Besides supporting Bob Fowler’s “Cole Flyer” transcontinental flight, they also had a big balloon that made appearances at county fairs and a share in the founding of the Indianapolis Motor Speedway. ",
"As their slogan went, “There’s a Touch of Tomorrow in All Cole Does Today”. ",
"Well, not forever. ",
"Joe Cole had built a fortune in horse buggies before he borrowed enough cash from Harvey Firestone to start his auto company in 1909. ",
"He ordered the parts from other manufacturers and assembled them in the Cole building. “",
"A man’s car any woman can drive.”",
"\n\nJoe offered such innovations as “adjustable door glasses” (i.e., removable windows) a 15 foot long dash light and a speedometer that read up to 75 mph; unfortunately the car only went up to 45 mph. ",
"Bigwigs at General Motors wanted to buy out Cole, and when Joe wouldn’t sell they just bought up his suppliers and gradually cut him off. ",
"With the post war recession of 1920-21 Joe realized the jig was up and began a careful liquidation of his company. ",
"In 1924, as he closed up his firm, Joe died suddenly. ",
"His family rented the building out and kept the name, the Cole Building, into the 1970’s.",
"After he reached El Paso it took Bob Fowler a month to escape Texas. ",
"He crash landed in a rice field outside of Seixas, Louisiana, on Christmas Eve. ",
"He landed in New Orleans at about 3 p.m. on New Year’s Eve. ",
"It took him until February of 1912 to reach Florida. ",
"He landed on the sand at Jacksonville Beach on February 12, not that anybody noticed, what with the Titanic going down just two nights later. ",
"Bob would later observe with understatement, “I was the first to start and the last to finish.” ",
"It had taken him 116 days to travel 72 hours of flight time and 2,800 miles across America. ",
"The very next year Bob Fowler made the first non-stop transcontinental flight – across the Isthmus of Panama. ",
"Bob Fowler was a pretty crafty fellow.",
"Bob sold The “Cole Flyer” in 1912, and after being used in the movie business for a few years it was sold again, this time for scrap. ",
"The engine is on display at the Exposition Museum in Los Angles. ",
"In 1916 Bob started the “Fowler Airplane Corporation” in his home town of San Francisco. ",
"He modified and sold Curtis JN-4’s (“Jennys”) to the U.S. Army as trainers, and after WWI he started Bluebird Airways, a passenger service. ",
"He retired to San Jose and died in 1966, at the healthy old age of 82.Jimmy Ward, the man who came to his senses and dropped out of the amazing race, died in Florida sometime after 1917, allegedly of stomach cancer. ",
"He was buried in an unmarked paupers grave. ",
"Some of his fellow aviation pioneers collected money to give him a more respectful funeral, but I can find no record of that ever happening. ",
"Perhaps somebody down in Florida can correct my mistake.",
"Cal Rogers was testing a new airplane on Wednesday April 3, 1912, just off shore of Long Beach, California when he ran into a flock of sea gulls. ",
"The plane banked sharply 45 degrees and slid into the surf, crashing just feet from where Cal had posed grinning in the surf with the “Vin Fiz” in December. ",
"The engine broke loose from its mounts and crushed Cal, breaking his neck. ",
"He was still breathing when swimmers pulled him from the water, but he died soon after. ",
"Cal Rogers was the 127th death since the Wright Brothers flight in 1903, and the 22nd American aviator killed. ",
"Considering the number of people flying in 1912, those were still terrible odds.",
"His mother, Maria (Rogers) Sweitzer, took procession of her son’s body and had it shipped back to Pittsburg. ",
"There Calbraith Perry Rogers was buried in Allegheny Cemetery under an elaborate tombstone, marked with the words “I Endure, I Conquer.”",
"\n\nCal’s brother John took procession of the “Vin Fiz Flyer” and had it shipped back to Ohio, to the Wright shops, to be repaired. ",
"He offered the Flyer to the Smithsonian but they already had a Wright B, so in 1917 the Flyer was donated to the Carnegie Institute in Pittsburg. ",
"In 1934 the Smithsonian changed their minds and bought the “Vin Fiz Flyer”. ",
"Refurbished and rebuilt, that is the plane that hangs from the ceiling in the Air and Space Museum in Washington, D.C.And little Maude was determined to endure and conquer as well. ",
"After lengthy court battles with her ex-mother-in-law in California, Maude was awarded legal possession of the “Vin Fiz Flyer”. ",
"How could this be? ",
"Wasn’t the Flyer back in Ohio, being rebuilt? ",
"It was. ",
"But the contents of the baggage car of the “Vin Fiz Special” contained enough spare parts and replacement parts and replaced parts, many of which had actually flown on sections the transcontinental voyage at least once, to construct a second “Vin Fiz Flyer” and still claim it as an “original.",
"”Two years after Cal’s death, and after the court battles with Maria had finally been settled, Maude married Charlie “Wiggie” Wiggin, who had shown such faith and devotion to her Cal; two lonely souls who shared an adoration of another man. “",
"Wiggie”, had, by this time, acquired his own pilot’s license. ",
"And Maude and Wiggie made a living for a few years barnstorming their “Vin Fiz Flyer” around the country. ",
"And then they quietly faded out of history. ",
"It would be ten years later when Jimmy Doolittle would cross the continent in less than a day - 21 hours 19 minutes, with just one stop for fuel. ",
"And as you sit in your tiny passenger seat, crammed four to an aisle, held prisoner on the tarmac for endless hours, forced to use a toilet designed for a diminutive Marquise de Sade, charged extra for a micro-waved “snack”, a pillow, a blanket, a soda or a thimble full of peanuts, consider the sacrifices of those who suffered before you; landing in chicken coops, landing in tree tops, landing in barbed wire fences, landing in Texas for day after day. ",
"And remember the immortal words of Cal Rogers; “I am not in this business because I like it, but because of what I can make out of it.",
"”It has become the mantra of every airline passenger world wide."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005747209652327001,
0.0006258439971134067,
0.004710710141807795,
0.0015637328615412116,
0.0005866996943950653,
0.0006224417011253536,
0.0014002269599586725,
0.000848383002448827,
0.0010243391152471304,
0.0006297895452007651,
0.006995082832872868,
0.0006512806285172701,
0.00121502042748034,
0.0005441056564450264,
0.0007271545473486185,
0.0048429518938064575,
0.0010177231160923839,
0.0006432309164665639,
0.009439959190785885,
0.014817449264228344,
0.0006096063880249858,
0.0009997235611081123,
0.0006077926373109221,
0.0008269522804766893,
0.000782600836828351,
0.0010031320853158832,
0.0008340862696059048,
0.0007394079584628344,
0.0006025484763085842,
0.0012418063124641776,
0.0013488574186339974,
0.0006299606175161898,
0.0006132223061285913,
0.0018119049491360784,
0.0009156621526926756,
0.0008371142321266234,
0.0010293340310454369,
0.0009933245601132512,
0.0018827790627256036,
0.001352245337329805,
0.0006263350369408727,
0.0009653915767557919,
0.0019688198808580637,
0.0018594125285744667,
0.006711039692163467,
0.0038950517773628235,
0.024668561294674873,
0.013835670426487923,
0.0096570560708642,
0.007592312525957823,
0.0006606102106161416,
0.9210833311080933,
0.0011419159127399325,
0.0007526951958425343,
0.0009500607848167419,
0.0007786679198034108,
0.0012168074026703835,
0.0006543283234350383,
0.0018072780221700668,
0.0011791740544140339,
0.0008871102472767234,
0.0006273195613175631,
0.0007463870570063591,
0.0006439752178266644,
0.0007631272310391068,
0.0007224720320664346,
0.0012777590891346335,
0.0006108187371864915,
0.005814562551677227,
0.0008144971216097474,
0.0006962363258935511,
0.0006529204547405243,
0.0006156316958367825,
0.001821355544961989,
0.0010305149480700493,
0.005766000133007765,
0.06693520396947861,
0.0005591801018454134,
0.000606841582339257,
0.001202006940729916,
0.0012946516508236527,
0.514391303062439,
0.0016538334311917424,
0.0014069316675886512,
0.04794977232813835,
0.03381919860839844,
0.05984063819050789,
0.000991361797787249,
0.0014454190386459231,
0.001698152394965291,
0.019904866814613342,
0.0012085686903446913,
0.0007721271831542253,
0.0015018993290141225,
0.0007674185908399522,
0.0005634897388517857,
0.0006894906400702894,
0.0006279778899624944,
0.0016030098777264357,
0.025001833215355873,
0.0009306968422606587,
0.005661236587911844,
0.012852084822952747,
0.0007370691746473312,
0.1606270968914032,
0.0006414836389012635,
0.00492359884083271,
0.5581965446472168,
0.008016819134354591,
0.002058780752122402,
0.009439473040401936,
0.05537090450525284,
0.0008120384882204235,
0.0009783263085409999,
0.0008752538124099374,
0.0010690377093851566,
0.09157130867242813,
0.7063260674476624,
0.036147039383649826,
0.01908174157142639,
0.0006042554159648716,
0.000623994623310864,
0.0022114873863756657,
0.0008748852997086942,
0.0008914469508454204,
0.3249756991863251,
0.002514664549380541,
0.07930206507444382,
0.0005972980870865285,
0.0007158174994401634,
0.000991604058071971,
0.0014884929405525327,
0.0007761454326100647,
0.0042107864283025265,
0.06012670695781708,
0.42827925086021423,
0.01156533695757389,
0.031194256618618965,
0.17412379384040833,
0.0007747409981675446,
0.0007827052613720298,
0.0022114873863756657,
0.001060309587046504,
0.0007126075797714293,
0.000939590681809932,
0.006620577536523342,
0.0008230585954152048,
0.0007478782790713012,
0.4763738512992859,
0.0160613302141428,
0.014557020738720894,
0.28432270884513855,
0.0006933113327249885,
0.0007541508530266583,
0.000673122180160135,
0.001236960873939097,
0.0005871704197488725,
0.0006236563785932958,
0.0012001809664070606,
0.0008432607864961028,
0.0008032450568862259,
0.0006645334069617093,
0.0827084481716156,
0.0007148617296479642,
0.0020379305351525545,
0.0012354501523077488,
0.0015816972590982914,
0.0008690369431860745,
0.000699798867572099,
0.0010919122723862529,
0.0008887651492841542,
0.0007375603308901191,
0.0007545336848124862,
0.0007692203507758677,
0.0007638784009031951,
0.001359288697130978,
0.0005981093272566795,
0.0015820497646927834,
0.0006015500403009355,
0.0007387783844023943,
0.0016178363002836704,
0.004975043702870607,
0.02402382716536522,
0.000578402541577816,
0.000601156847551465,
0.0015944616170600057,
0.000961065583396703,
0.06832138448953629,
0.014834143221378326,
0.015112840570509434,
0.001032601809129119,
0.0014437517384067178,
0.0012134689604863524,
0.0007765115587972105,
0.00059688207693398,
0.0007461142959073186,
0.0006180736236274242,
0.0016108242562040687,
0.0014667356153950095,
0.0007524090469814837,
0.0011656909482553601,
0.000681007222738117,
0.002529445569962263,
0.002401915844529867,
0.0026526113506406546,
0.0006856553955003619,
0.0011520088883116841,
0.015112251043319702,
0.0005695378640666604,
0.0006834251689724624
] | 0.027485 | 210 |
[
"--####################################################################\r\n--Peter Magnusson provided the script to create SqlLite version of the Northwind test DB - thanks!",
"\r\n--####################################################################\r\n\r\nCREATE TABLE IF NOT EXISTS [Regions] (\r\n [RegionID] INTEGER PRIMARY KEY NOT NULL,\r\n [RegionDescription] VARCHAR(50) NOT NULL\r\n \r\n);\r\n\r\n\r\nCREATE TABLE IF NOT EXISTS [Territories] (\r\n [TerritoryID] VARCHAR(20) NOT NULL,\r\n [TerritoryDescription] VARCHAR(50) NOT NULL,\r\n [RegionID] INTEGER NOT NULL REFERENCES Regions(RegionID),\r\n PRIMARY KEY([TerritoryID])\r\n);\r\n\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Categories] (\r\n [CategoryID] INTEGER NOT NULL ,\r\n [CategoryName] VARCHAR(15) NOT NULL,\r\n [Description] TEXT NULL,\r\n [Picture] BLOB NULL,\r\n PRIMARY KEY([CategoryID])\r\n);\r\n\r\n\r\nCREATE TABLE IF NOT EXISTS [Suppliers] (\r\n [SupplierID] INTEGER NOT NULL ,\r\n [CompanyName] VARCHAR(40) NOT NULL DEFAULT '',\r\n [ContactName] VARCHAR(30) NULL,\r\n [ContactTitle] VARCHAR(30) NULL,\r\n [Address] VARCHAR(60) NULL,\r\n [City] VARCHAR(15) NULL,\r\n [Region] VARCHAR(15) NULL,\r\n [PostalCode] VARCHAR(10) NULL,\r\n [Country] VARCHAR(15) NULL,\r\n [Phone] VARCHAR(24) NULL,\r\n [Fax] VARCHAR(24) NULL,\r\n PRIMARY KEY([SupplierID])\r\n);\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Products] (\r\n [ProductID] INTEGER NOT NULL ,\r\n [ProductName] VARCHAR(40) NOT NULL DEFAULT '' COLLATE NOCASE,\r\n [SupplierID] INTEGER NULL REFERENCES Suppliers(SupplierID),\r\n [CategoryID] INTEGER NULL,\r\n [QuantityPerUnit] VARCHAR(20) NULL,\r\n [UnitPrice] DECIMAL NULL,\r\n [UnitsInStock] SMALLINT NULL,\r\n [UnitsOnOrder] SMALLINT NULL,\r\n [ReorderLevel] SMALLINT NULL,\r\n [Discontinued] BIT NOT NULL,\r\n PRIMARY KEY([ProductID])\r\n);\r\n\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Customers] (\r\n [CustomerID] VARCHAR(5) NOT NULL,\r\n [CompanyName] VARCHAR(40) NOT NULL DEFAULT '',\r\n [ContactName] VARCHAR(30) NULL,\r\n [ContactTitle] VARCHAR(30) NULL,\r\n [Address] VARCHAR(60) NULL,\r\n [City] VARCHAR(15) NULL,\r\n [Region] VARCHAR(15) NULL,\r\n [PostalCode] VARCHAR(10) NULL,\r\n [Country] VARCHAR(15) NULL,\r\n [Phone] VARCHAR(24) NULL,\r\n [Fax] VARCHAR(24) NULL,\r\n PRIMARY KEY([CustomerID])\r\n);\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Shippers] (\r\n [ShipperID] INTEGER NOT NULL ,\r\n [CompanyName] VARCHAR(40) NOT NULL,\r\n [Phone] VARCHAR(24) NULL,\r\n PRIMARY KEY([ShipperID])\r\n);\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Employees] (\r\n [EmployeeID] INTEGER NOT NULL ,\r\n [LastName] VARCHAR(20) NOT NULL,\r\n [FirstName] VARCHAR(10) NOT NULL,\r\n [Title] VARCHAR(30) NULL,\r\n [BirthDate] DATETIME NULL,\r\n [HireDate] DATETIME NULL,\r\n [Address] VARCHAR(60) NULL,\r\n [City] VARCHAR(15) NULL,\r\n [Region] VARCHAR(15) NULL,\r\n [PostalCode] VARCHAR(10) NULL,\r\n [Country] VARCHAR(15) NULL,\r\n [HomePhone] VARCHAR(24) NULL,\r\n [Photo] BLOB NULL,\r\n [Notes] TEXT NULL,\r\n [TitleOfCourtesy] VARCHAR(25) NULL,\r\n [PhotoPath] VARCHAR (255) NULL,\r\n [Extension] VARCHAR(5) NULL,\r\n [ReportsTo] INTEGER NULL REFERENCES Employees(EmployeeID),\r\n PRIMARY KEY([EmployeeID])\r\n);\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [EmployeeTerritories] (\r\n [EmployeeID] INTEGER NOT NULL REFERENCES Employees(EmployeeID),\r\n [TerritoryID] VARCHAR(20) NOT NULL REFERENCES Territories(TerritoryID),\r\n PRIMARY KEY([EmployeeID],[TerritoryID])\r\n);\r\n\r\n\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Orders] (\r\n [OrderID] INTEGER NOT NULL ,\r\n [CustomerID] VARCHAR(5) NULL CONSTRAINT fk_customer_id REFERENCES Customers(CustomerID),\r\n [EmployeeID] INTEGER NULL CONSTRAINT fk_employee_id REFERENCES Employees(EmployeeID),\r\n [OrderDate] DATETIME NULL,\r\n [RequiredDate] DATETIME NULL,\r\n [ShippedDate] DATETIME NULL,\r\n [ShipVia] INT NULL,\r\n [Freight] DECIMAL NULL,\r\n [ShipName] VARCHAR(40) NULL,\r\n [ShipAddress] VARCHAR(60) NULL,\r\n [ShipCity] VARCHAR(15) NULL,\r\n [ShipRegion] VARCHAR(15) NULL,\r\n [ShipPostalCode] VARCHAR(10) NULL,\r\n [ShipCountry] VARCHAR(15) NULL,\r\n PRIMARY KEY([OrderID])\r\n);\r\n\r\n\r\n\r\n\r\n-- Foreign Key Preventing insert\r\nCREATE TRIGGER IF NOT EXISTS fki_Orders_CustomerID_Customers_CustomerID\r\nBEFORE INSERT ON [Orders]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'insert on table \"Orders\" violates foreign key constraint \"fki_Orders_CustomerID_Customers_CustomerID\"')\r\n WHERE NEW.CustomerID IS NOT NULL AND (SELECT [CustomerID] FROM [Customers] WHERE [CustomerID] = NEW.CustomerID) IS NULL;\r\nEND;\r\n\r\n-- Foreign key preventing update\r\nCREATE TRIGGER IF NOT EXISTS fku_Orders_CustomerID_Customers_CustomerID\r\nBEFORE UPDATE ON [Orders]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'update on table \"Orders\" violates foreign key constraint \"fku_Orders_CustomerID_Customers_CustomerID\"')\r\n WHERE NEW.CustomerID IS NOT NULL AND (SELECT [CustomerID] FROM [Customers] WHERE [CustomerID] = NEW.CustomerID) IS NULL;\r\nEND;\r\n\r\n-- Foreign key preventing delete\r\nCREATE TRIGGER IF NOT EXISTS fkd_Orders_CustomerID_Customers_CustomerID\r\nBEFORE DELETE ON [Customers]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'delete on table \"[Customers]\" violates foreign key constraint \"fkd_Orders_CustomerID_Customers_CustomerID\"')\r\n WHERE (SELECT CustomerID FROM Orders WHERE CustomerID = OLD.[CustomerID]) IS NOT NULL;\r\nEND;\r\n-- Foreign Key Preventing insert\r\nCREATE TRIGGER IF NOT EXISTS fki_Orders_EmployeeID_Employees_EmployeeID\r\nBEFORE INSERT ON [Orders]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'insert on table \"Orders\" violates foreign key constraint \"fki_Orders_EmployeeID_Employees_EmployeeID\"')\r\n WHERE NEW.EmployeeID IS NOT NULL AND (SELECT [EmployeeID] FROM [Employees] WHERE [EmployeeID] = NEW.EmployeeID) IS NULL;\r\nEND;\r\n\r\n-- Foreign key preventing update\r\nCREATE TRIGGER IF NOT EXISTS fku_Orders_EmployeeID_Employees_EmployeeID\r\nBEFORE UPDATE ON [Orders]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'update on table \"Orders\" violates foreign key constraint \"fku_Orders_EmployeeID_Employees_EmployeeID\"')\r\n WHERE NEW.EmployeeID IS NOT NULL AND (SELECT [EmployeeID] FROM [Employees] WHERE [EmployeeID] = NEW.EmployeeID) IS NULL;\r\nEND;\r\n\r\n-- Foreign key preventing delete\r\nCREATE TRIGGER IF NOT EXISTS fkd_Orders_EmployeeID_Employees_EmployeeID\r\nBEFORE DELETE ON [Employees]\r\nFOR EACH ROW BEGIN\r\n SELECT RAISE(ROLLBACK, 'delete on table \"[Employees]\" violates foreign key constraint \"fkd_Orders_EmployeeID_Employees_EmployeeID\"')\r\n WHERE (SELECT EmployeeID FROM Orders WHERE EmployeeID = OLD.[EmployeeID]) IS NOT NULL;\r\nEND;\r\n\r\n--####################################################################\r\nCREATE TABLE IF NOT EXISTS [Order Details] (\r\n [OrderID] INTEGER NOT NULL REFERENCES Orders (OrderID),\r\n [ProductID] INTEGER NOT NULL REFERENCES Products (ProductID),\r\n [UnitPrice] DECIMAL NOT NULL,\r\n [Quantity] SMALLINT NOT NULL,\r\n [Discount] FLOAT NOT NULL,\r\n PRIMARY KEY([OrderID],[ProductID])\r\n);\r\n\r\n\r\n\r\n\r\n\r\n--####################################################################\r\n--## populate tables with seed data\r\n--####################################################################\r\nDELETE FROM [Categories];\r\nInsert INTO [Categories] (CategoryName,Description)\r\nvalues ('Beverages',\t'Soft drinks, coffees, teas, beers, and ales');\r\nInsert INTO [Categories] (CategoryName,Description)\r\nvalues ('Condiments','Sweet and savory sauces, relishes, spreads, and seasonings');\r\nInsert INTO [Categories] (CategoryName,Description)\r\nvalues ('Seafood','Seaweed and fish');\r\n\r\n\r\nINSERT INTO Regions (RegionDescription) VALUES ('North America');\r\nINSERT INTO Regions (RegionDescription) VALUES ('Europe');\r\n\r\nDELETE FROM EmployeeTerritories; -- must be truncated before Territories\r\nDELETE FROM Territories;\r\nINSERT INTO Territories (TerritoryID,TerritoryDescription, RegionID) VALUES ('US.Northwest', 'Northwest', 1);\r\n\r\nDELETE FROM [Orders]; -- must be truncated before Customer\r\nDELETE FROM [Customers];\r\n\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName,Country,PostalCode,City)\r\nvalues ('AIRBU', 'airbus','jacques','France','10000','Paris');\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName,Country,PostalCode,City)\r\nvalues ('BT___','BT','graeme','U.K.','E14','London');\r\n\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName,Country,PostalCode,City)\r\nvalues ('ATT__','ATT','bob','USA','10021','New York');\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName,Country,PostalCode,City)\r\nvalues ('UKMOD', 'MOD','(secret)','U.K.','E14','London');\r\n\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName, ContactTitle, Country,PostalCode,City, Phone)\r\nvalues ('ALFKI', 'Alfreds Futterkiste','Maria Anders','Sales Representative','Germany','12209','Berlin','030-0074321');\r\n\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName, ContactTitle, Country,PostalCode,Address,City, Phone, Fax)\r\nvalues ('BONAP', 'Bon app''','Laurence Lebihan','Owner','France','13008','12, rue des Bouchers','Marseille','91.24.45.40', '91.24.45.41');\r\n\r\ninsert INTO [Customers] (CustomerID, CompanyName,ContactName, ContactTitle, Country,PostalCode,City, Phone)\r\nvalues ('WARTH', 'Wartian Herkku','Pirkko Koskitalo','Accounting Manager','Finland','90110','Oulu','981-443655');\r\n\r\nDELETE FROM [Orders]; -- must be truncated before Products\r\nDELETE FROM [Products];\r\nDELETE FROM [Suppliers];\r\n\r\ninsert INTO Suppliers (CompanyName, ContactName, ContactTitle, Address, City, Region, Country)\r\nVALUES ('alles AG', 'Harald Reitmeyer', 'Prof', 'Fischergasse 8', 'Heidelberg', 'B-W', 'Germany');\r\n\r\ninsert INTO Suppliers (CompanyName, ContactName, ContactTitle, Address, City, Region, Country)\r\nVALUES ('Microsoft', 'Mr Allen', 'Monopolist', '1 MS', 'Redmond', 'WA', 'USA');\r\n\r\nINSERT INTO Suppliers (CompanyName, ContactName, ContactTitle, Address, City, Region, PostalCode, Country, Phone, Fax)\r\nVALUES ('Pavlova, Ltd.', 'Ian Devling', 'Marketing Manager', '74 Rose St. Moonie Ponds', 'Melbourne', 'Victoria', '3058', 'Australia', '(03) 444-2343', '(03) 444-6588');\r\n\r\n--## (OLD WARNING: this actually inserts two 'Pen' rows into Products.)",
"\r\n--## could someone with knowledge of MySQL resolve this?",
"\r\n--## Answer: upgrade to newer version of MySql Query Browser - the problem will go away\r\ninsert INTO [Products] (ProductName,SupplierID, QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Pen',1, 10, 12, 2, 0);\r\ninsert INTO [Products] (ProductName,SupplierID, QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Bicycle',1, 1, 6, 0, 0);\r\ninsert INTO [Products] (ProductName,QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Phone',3, 7, 0, 0);\r\ninsert INTO [Products] (ProductName,QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('SAM',1, 51, 11, 0);\r\ninsert INTO [Products] (ProductName,QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('iPod',0, 11, 0, 0);\r\ninsert INTO [Products] (ProductName,QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Toilet Paper',2, 0, 3, 1);\r\ninsert INTO [Products] (ProductName,QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Fork',5, 111, 0, 0);\r\ninsert INTO [Products] (ProductName,SupplierID, QuantityPerUnit,UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Linq Book',2, 1, 0, 26, 0);\r\nINSERT INTO [Products] (ProductName,SupplierID, QuantityPerUnit,UnitPrice, UnitsInStock,UnitsOnOrder,Discontinued)\r\nVALUES ('Carnarvon Tigers', 3,'16 kg pkg.",
"',62.50, 42, 0, 0);\r\n\r\nDELETE FROM [Employees];\r\n\r\ninsert INTO [Employees] (LastName,FirstName,Title,BirthDate,HireDate,Address,City,ReportsTo,Country,HomePhone)\r\nVALUES ('Fuller','Andrew','Vice President, Sales','19540101','19890101', '908 W. Capital Way','Tacoma',NULL,'USA','(111)222333');\r\n\r\ninsert INTO [Employees] (LastName,FirstName,Title,BirthDate,HireDate,Address,City,ReportsTo,Country,HomePhone)\r\nVALUES ('Davolio','Nancy','Sales Representative','19640101','19940101','507 - 20th Ave. ",
"E. Apt. ",
"2A','Seattle',1,'USA','(444)555666');\r\n\r\ninsert INTO [Employees] (LastName,FirstName,Title,BirthDate,HireDate,Address,City,ReportsTo,Country,HomePhone)\r\nVALUES ('Builder','Bob','Handyman','19640101','19940101','666 dark street','Seattle',2,'USA','(777)888999');\r\n\r\ninsert into employeeTerritories (EmployeeID,TerritoryID)\r\nvalues (2,'US.Northwest');\r\n\r\n--####################################################################\r\nDELETE FROM [Orders];\r\ninsert INTO [Orders] (CustomerID, EmployeeID, OrderDate, Freight)\r\nValues ('AIRBU', 1, '2007-12-14', 21.3);\r\n\r\ninsert INTO [Orders] (CustomerID, EmployeeID, OrderDate, Freight)\r\nValues ('BT___', 1, '2007-12-15', 11.1);\r\n\r\ninsert INTO [Orders] (CustomerID, EmployeeID, OrderDate, Freight)\r\nValues ('BT___', 1, '2007-12-16', 11.5);\r\n\r\ninsert INTO [Orders] (CustomerID, EmployeeID, OrderDate, Freight)\r\nValues ('UKMOD', 1, '2007-12-17', 32.5);\r\n\r\ninsert INTO [Orders] (CustomerID, EmployeeID, OrderDate, RequiredDate, ShippedDate, Freight, ShipName, ShipAddress, ShipCity, ShipCountry)\r\nValues ('BONAP', 1, '1996-10-16', '1996-11-27', '1996-10-21', 10.21, 'Bon app''', '12, rue des Bouchers', 'Marseille', 'France' );\r\n\r\nINSERT INTO [Order Details] (OrderID, ProductID, UnitPrice, Quantity, Discount)\r\nVALUES (1,2, 33, 5, 11);\r\n\r\nINSERT INTO [Order Details] (OrderID, ProductID, UnitPrice, Quantity, Discount)\r\nVALUES (5,9, 50, 20, 0.05); --## CanarvonTigers for customer BONAP\r\n\r\n\r\n\r\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.0013346226187422872,
0.04362335056066513,
0.0009377550450153649,
0.0007034972659312189,
0.0006891395314596593,
0.0016703041037544608,
0.000791016558650881
] | 0.007107 | 7 |
[
"Identifying biologically relevant differences between metagenomic communities.",
"\nMetagenomics is the study of genetic material recovered directly from environmental samples. ",
"Taxonomic and functional differences between metagenomic samples can highlight the influence of ecological factors on patterns of microbial life in a wide range of habitats. ",
"Statistical hypothesis tests can help us distinguish ecological influences from sampling artifacts, but knowledge of only the P-value from a statistical hypothesis test is insufficient to make inferences about biological relevance. ",
"Current reporting practices for pairwise comparative metagenomics are inadequate, and better tools are needed for comparative metagenomic analysis. ",
"We have developed a new software package, STAMP, for comparative metagenomics that supports best practices in analysis and reporting. ",
"Examination of a pair of iron mine metagenomes demonstrates that deeper biological insights can be gained using statistical techniques available in our software. ",
"An analysis of the functional potential of 'Candidatus Accumulibacter phosphatis' in two enhanced biological phosphorus removal metagenomes identified several subsystems that differ between the A.phosphatis stains in these related communities, including phosphate metabolism, secretion and metal transport. ",
"Python source code and binaries are freely available from our website at http://kiwi.cs.dal.ca/Software/STAMP CONTACT: beiko@cs.dal.ca Supplementary data are available at Bioinformatics online."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0005918584065511823,
0.0006773100467398763,
0.0005562070873565972,
0.0005499247927218676,
0.0006251935847103596,
0.0005499086109921336,
0.0005506704328581691,
0.0006977052544243634,
0.0005534471129067242
] | 0.000595 | 9 |
[
"EXE\t\t=\nLIB\t\t= .a\nOBJ\t\t= .o\n\nMAKE\t\t= make\nAR\t\t= ar\nARFLAGS\t\t= -ruv\nCAT\t\t= cat\nCCS\t\t= gcc\nCCP\t\t= mpicc\nCCD\t\t= gcc\nCFLAGS\t\t= -O3 -Drestrict=__restrict -DCOMMON_FILE_COMPRESS_GZ -DCOMMON_RANDOM_FIXED_SEED -DSCOTCH_RENAME -DSCOTCH_RENAME_PARSER\nCLIBFLAGS\t=\nLDFLAGS\t\t= -lz -lm\nCP\t\t= cp\nLEX\t\t= flex -Pscotchyy -olex.yy.c\nLN\t\t= ln\nMKDIR\t\t= mkdir\nMV\t\t= mv\nRANLIB\t\t= ranlib\nYACC\t\t= bison -pscotchyy -y -b y\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.02440277859568596
] | 0.024403 | 1 |
[
"Q:\n\nPrototype-binding on re-evaluated anonymous constructor retroactive to original instantiated objects\n\nThis is more of a theory question than a how-to question. ",
" I was working on a project in which objects can \"differentiate\" into several different types, so I decided to explore some of Javascript's dynamic features, but there's one thing that has me really confused:\nOriginalConstructor = function() {this.value = 42;}\noriginalInstance = new OriginalConstructor();\nModifiedConstructor = eval(originalInstance.constructor);\nModifiedConstructor.prototype.addedFunction = function(x) {return this.value + x;}\nmodifiedInstance = new ModifiedConstructor();\ndocument.write(\"modified: \" + modifiedInstance.addedFunction(10));\ndocument.write(\"<br>original: \" + originalInstance.addedFunction(20));\n\nWhy is addedFunction bound to originalInstance, even though ModifiedConstructor was copied through eval()? ",
" Surely these two constructors can't have the same reference, can they?",
"\nIs there a way to modify an object (or future instances) without affecting other objects already instantiated from the same constructor? ",
" I know there are other ways to approach this, but I want to understand Javascript at a deeper level. ",
" Thanks for any insights you can offer.",
"\n@Felix Kling:\nThanks for the quick, clear and complete answer. ",
" For some reason, I thought the constructor property was a string that could be parsed by eval(), so now I understand why this didn't work. ",
" I still don't fully understand prototypal inheritance, but at least now I know what I need to study. ",
" Thank you!",
"\nEDIT:\nI get it now. ",
" Prototypal inheritance seems pretty weird if you're coming from a background in classical OOP, but it's conceptually simpler and easier to understand, AND it's actually more powerful in some ways. ",
" If you want to learn more about Javascript's prototypal inheritance, I highly recommend these articles:\nhttp://javascript.crockford.com/prototypal.html\nhttp://www.laktek.com/2011/02/02/understanding-prototypical-inheritance-in-javascript/\nhttp://blog.vjeux.com/2011/javascript/how-prototypal-inheritance-really-works.html\nhttp://howtonode.org/prototypical-inheritance\nAlso, if you need this kind of flexibility, you may want to consider using an \"entity system\", which would offer several advantages as an alternative to a complex hierarchy of inheritance. ",
" Most articles about entity systems focus on game development, but I think this architecture could be useful for other applications as well. ",
" It's a very foreign concept to OOP programmers, so set aside everything you know about OOP and think more in terms of relational database design. ",
" Check it out:\nhttp://cowboyprogramming.com/2007/01/05/evolve-your-heirachy/\nhttp://t-machine.org/index.php/2007/09/03/entity-systems-are-the-future-of-mmog-development-part-1/\n\nA:\n\nModifiedConstructor is not a copy of OriginalConstructor, it is one and the same function.",
"\nThe first instruction in eval's algorithm is:\n\nIf Type(x) is not String, return x.\n\ni.e. you simply get back what you pass in. ",
"OriginalConstructor === ModifiedConstructor yields true.",
"\n\nIs there a way to modify an object (or future instances) without affecting other objects already instantiated from the same constructor?",
"\n\nYou can, through prototypal inheritance:\nModifiedConstructor = function() {\n OriginalConstructor.apply(this, arguments);\n};\n\nModifiedConstructor.prototype = Object.create(OriginalConstructor.prototype);\nModifiedConstructor.prototype.constructor = ModifiedConstructor;\n\nNow you can add functions to ModifiedConstructor.prototype without affecting instances created by OriginalConstructor.",
"\nIf you only want to prevent already created instances from being extended, you could just overwrite OriginalConstructor.prototype, but is not a clean solution and will also break instanceOf for the existing instances.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0007137171342037618,
0.000698339135851711,
0.0006287492578849196,
0.0007252966170199215,
0.0005633678520098329,
0.0005234046257100999,
0.0005945394514128566,
0.000631313247140497,
0.0005765666719526052,
0.0006528116064146161,
0.0007420087931677699,
0.0006298981606960297,
0.0005761599168181419,
0.0005377023480832577,
0.0007024270598776639,
0.000744811084587127,
0.0007255544769577682,
0.0009021603036671877,
0.0007252966170199215,
0.0008164090104401112,
0.0007088826387189329,
0.001995444530621171
] | 0.000732 | 22 |
[
"---\nabstract: |\n The surge of mobile data traffic forces network operators to cope with capacity shortage. ",
"The deployment of small cells in 5G networks is meant to reduce latency, backhaul traffic and increase radio access capacity. ",
"In this context, mobile edge computing technology will be used to manage dedicated cache space in the radio access network. ",
"Thus, mobile network operators will be able to provision OTT content providers with new caching services to enhance the quality of experience of their customers on the move.",
"\n\n In turn, the cache memory in the mobile edge network will become a shared resource. ",
"Hence, we study a competitive caching scheme where contents are stored at given price set by the mobile network operator.",
"\n\n We first formulate a resource allocation problem for a tagged content provider seeking to minimize the expected missed cache rate. ",
"The optimal caching policy is derived accounting for popularity and availability of contents, the spatial distribution of small cells, and the caching strategies of competing content providers. ",
"It is showed to induce a specific order on contents to be cached based on their popularity and availability.",
"\n\n Next, we study a game among content providers in the form of a generalized Kelly mechanism with bounded strategy sets and heterogeneous players. ",
"Existence and uniqueness of the Nash equilibrium are proved. ",
"Finally, extensive numerical results validate and characterize the performance of the model.",
"\nauthor:\n- 'Francesco De Pellegrini$^\\diamond$, Antonio Massaro$^\\diamond$, Leonardo Goratti$^\\diamond$, and Rachid El-Azouzi$^\\star$[^1]'\nbibliography:\n- 'CachingBib.bib'\ntitle: |\n Competitive Caching of Contents\\\n in 5G Edge Cloud Networks\n---\n\nMobile Edge Computing, Caching, Convex Optimization, Kelly Mechanism, Nash Equilibrium.",
"\n\nIntroduction {#sec:intro}\n============\n\nThe recent boom of mobile data traffic is causing unprecedented stress over mobile networks. ",
"In fact, the global figures for such traffic reached 3.7 exabytes per month at the end of $2015$. They are ascribed mostly to over-the-top (OTT) video content providers (CP) such as Vimeo, YouTube and NetFlix. ",
"Forecasts predict that the world’s mobile data traffic will reach $30.6$ monthly exabytes by $2020$, of which $75\\%$ will be video [@Cisco].",
"\n\nAs a consequence, capacity shortage has become a real threat for mobile network operators (MNOs). ",
"Solutions involving the deployment of small cell (SC) base stations [@What5GwillBe] have been receiving large consensus from industry and academia for next 5G systems. ",
"SCs are low power secondary base stations with limited coverage, to which user equipments (UEs) in radio range can connect, hence increasing spatial reuse and network capacity.",
"\n\nHowever, SCs are connected to a mobile operator’s core network via backhaul technologies such as, e.g., DSL, Ethernet or flexible millimeter-wave links. ",
"In order to avoid potential bottlenecks over the backhaul connection to SCs, mobile edge caching solutions have been devised. ",
"Actually, the primary goal of mobile edge caching is precisely to circumvent the limited backhaul connection of SCs [@WangCacheAir] and ensure fast adaptation to radio link conditions.",
"\n\nFrom the network management standpoint, in order to handle a large number of SCs and associated memory caches, MNOs will rely on the emerging mobile edge computing (MEC) [@ETSIMEC] 5G technology. ",
"MEC platforms are designed to enable services to run inside the mobile Radio Access Network (RAN) increasing proximity to mobile users, drastically reducing round trip time and thus improving the user experience.",
"\n\nUltimately, CPs will be able to leverage on the MEC caching service offered by 5G MNOs. ",
"Contents can be replicated directly on lightweight server facilities embedded in the radio access network in proximity of SCs. ",
"In this context, the design of effective mobile edge caching policies requires to factor in popularity, number of contents, cache memory size as well as spatial density of small cells to which UEs may associate to. ",
"Indeed, due to storage limitations, allocation of contents on mobile edge caches has become an important optimization problem [@CaireFoundITW2013; @Pantisano1; @Poor2015; @Kang2014; @Sengupta2014; @hachem2014coded; @BastugCommMag].",
"\n\nIn this paper, we consider a scheme in which CPs can reserve mobile edge cache memory from a MNO. ",
"The MNO will provide a multi-tenant environment where contents can be stored at given price and will assign the available caching resources to different OTT content providers. ",
"In turn, this engenders competition of CPs for cache utilization.",
"\n\nFirst, we study the single CP optimization problem: under a given spatial distribution of SCs, the CP decides the optimal cache memory share to be reserved to different classes of contents. ",
"This permits to identify the minimum missed cache rate as a function of the purchased memory. ",
"Also, the optimal caching policy defines an order among contents jointly determined by two attributes: by the demand rate, i.e., the contents’ [*popularity*]{}, and by the concurrent effect of contents with similar popularity, i.e., the contents’ [*availability*]{}.",
"\n\nFinally, the competition among CPs is formulated using a new generalized Kelly mechanism with bounded strategy set. ",
"CPs trade off the cost for caching contents in the radio access network versus the expected missed cache rate. ",
"We show that the game admits a Nash equilibrium, and we prove that it is unique. ",
"Further properties of the game, including convergence and the revenue of the MNO, are investigated numerically.",
"\n\nThe manuscript is organized as follows. ",
"In Sec. ",
"\\[sec:related\\] we provide the related work and we outline the main contributions. ",
"Sec.",
" \\[sec:model\\] introduces the mathematical model developed throughout the paper. ",
"In Sec.",
" \\[sec:contalloc\\] the optimal content caching strategy is devised and in Sec.",
" \\[sec:util\\] we obtain the key characterization of the optimal missed cache rate. ",
"Sec.",
" \\[sec:game\\] provides the analysis of the caching game. ",
"Numerical validation is performed in Sec.",
" \\[sec:numres\\]. ",
"Finally, Sec.",
" \\[sec:concls\\] provides closing remarks.",
"\n\nRelated Works and main contribution {#sec:related}\n===================================\n\nIn [@CaireFoundITW2013] the authors consider a device-to-device (D2D) network and derive throughput scaling laws under cache coding and spatial reuse. ",
"Content delay is optimized in [@Towsley2015] by performing joint routing and caching, whereas in [@Pantisano1] a distributed matching scheme based on the deferred acceptance algorithm provides association of users and SC base stations based on latency figures. ",
"Similarly to our model, in [@Poor2015] SC base stations are distributed according to a Poisson point process. ",
"Contents to be cached minimize a cost which depends on the expected number of missed cache hits.",
"\n\nIn [@Kang2014] a model for caching contents over a D2D network is proposed. ",
"A convex optimization problem is obtained and solved using a dual optimization algorithm. ",
"In our formulation we have obtained closed form solutions and properties of the optimal cost function.",
"\n\nIn [@Sengupta2014] a coded caching strategy is developed to optimize contents’ placement based on SC association patterns. ",
"In [@stack] a Stackelberg game is investigated to study a caching system consisting of a content provider and multiple network providers. ",
"In that model, the content providers lease their videos to the network providers to gain profit and network providers aim to save the backhaul costs by caching popular videos. ",
"In [@hachem2014coded] the authors model a wireless content distribution system where contents are replicated at multiple access points – depending on popularity – so as to maximally create network-coding opportunities during delivery. ",
"Finally, [@BastugCommMag] proposes proactive caching in order to take advantage of contents’ popularity. ",
"The scheme we develop in this work can also be applied to proactive caching.",
"\n\nSince content demand patterns are typically not known apriori, practical caching algorithms perform local content replacement policies [@Ma2004; @LiPopCache]. ",
"Those rule how contents are replaced when the cache memory is full: heuristics including replacing least frequently used contents (LFU), last recently used contents (LRU) and several other variants have been proposed in literature. ",
"In our development we assume perfect knowledge of contents’ popularity, namely, the demand rates: recent results [@LiPopCache] show that by online estimation of the contents’ popularity, it is possible to achieve optimality, i.e., to minimize the missed cache rate. ",
"We leave the online estimation of the contents’ demand rates as part of future works.",
"\n\n[*Main results.*]{} ",
"The main contributions obtained in this work are the following:\n\n- a model is introduced which accounts for the contents’ characteristics, the spatial distribution of small cells, the price for cache memory reservation and the effect of competing content providers under multi-tenancy;\n\n- using such model, by convex optimization, the optimal caching policy is found to possess a waterfilling-type of structure which induces an ordering of contents depending on contents’ popularity and availability;\n\n- a competitive game is formulated where the price for cache memory reservation is fixed by the network provider. ",
"It is proved to be a new type of Kelly mechanism with bounded strategy set and it is showed to admit a unique Nash equilibrium.",
"\n\nTo the best of the authors’ knowledge, this work is the first one to study mobile edge caching under a competitive scheme. ",
"This appears a crucial aspect in order to define new business models of 5G MNOs for the emerging MEC technology.",
"\n\n [*Symbol*]{} [*Meaning*]{}\n --------------------------------------------- -----------------------------------------------------------------------------------------------------------\n $M$ number of content classes\n $\\Lambda$ intensity, i.e., spatial density of small-cells\n $\\mathcal C$ set of content providers, $|\\mathcal C|=C$\n $r$ covering radius of UEs\n $N$ storage capacity of a local edge cache unit (number of caching slots)\n $N_0$ total storage capacity of the deployment\n ${N_c^i}$ number of contents of class $i$ for content provider $c$\n ${g_c^i}$ [*popularity*]{}, i.e., demand rate for contents of class $i$ of content provider $c$\n ${\\Lambda_c^i}$ [*availability*]{}, i.e., ${\\Lambda_c^i}:=\\Lambda \\pi r^2N/{N_c^i}$\n $b_c$ caching rate of content provider $c$, $b_c\\in [0,B_c]$\n $b$ total caching rate $b=\\displaystyle \\sum_{c\\in {\\mathcal C}}b_c$\n $b_{-c}=\\displaystyle \\sum_{v\\not = c}b_v$ total caching rate of competing content providers;\n $\\delta$ mobile network provider’s own caching rate\n ${{\\mathbf u}_c}$ caching policy for content provider $c$, ${{\\mathbf u}_c}=({u_c^{1}},\\ldots,{u_c^{M}})$, $\\sum {u_c^i}=1$\n $x_c$ share of cache memory occupied by content provider $c$\n ${x_c^i}$ share of cache memory for $i$-th class contents of content provider $c$\n $B_c$ maximum caching rate for content provider $c$\n $\\lambda_c$ price per caching slot for content provider $c$\n\n : Main notation used throughout the paper\n\n\\[tab:notation\\]\n\nSystem Model {#sec:model}\n============\n\nLet us consider a MNO serving a set ${\\mathcal C}$ of content providers, where $|{\\mathcal C}|=C$. Each CP $c$ serves his customers leveraging the MNO network.",
"\n\nContents served to the customers of a tagged CP $c$ belong to $M$ different popularity classes, based on their demand rate or [*popularity*]{} ${g_c^i}$. The $i$-th popularity class thus features ${N_c^i}$ contents and ${g_c^i}$ content requests per day. ",
"Thus, we follow a multi-level popularity model similar to the one proposed in [@hachem2014coded; @hachem2014isit]. ",
"In such model, files are divided into different popularity classes, and files within each class are equally popular.",
"\n\nWe assume that each SC is attached to a local edge caching server, briefly [*cache*]{}. ",
"Multiple caches are aggregated by connecting them through the MNO backhaul and managed using a local MEC orchestrator, thus forming a seamless local edge cache unit as in Fig.",
" \\[fig:edgecloud\\]. ",
"$N$ [*caching slots*]{} represent the available memory on such local edge cache unit; the total cache space across the whole deployment is hence $N_0=K\\cdot N$ where $K$ is the number of local edge cache units. ",
"For the sake of simplicity, each content is assumed to occupy one caching slot; since we assume $N_0,N\\gg 1$, we rely on fluid approximations to describe the dynamics of cache occupation.",
"\n\nFetching a non cached content from the remote CP server beyond the backhaul comes at unitary cost; such cost may represent the content’s access delay or the throughput to fetch the content from the remote server. ",
"Conversely, such cost is negligible if the user associates to a small cell storing a cached copy of the content. ",
"However, such cache should be reached by connecting to a SC within the UE radio range $r>0$. SCs are distributed according to a spatial Poisson point process with intensity $\\Lambda$.\n\nThe following assumptions characterize the caching process:\\\ni. each CP $c$ can purchase edge-caching service from the MNO and issue $b_c$ caching slot requests per day; we call $b_c$ the [*caching rate*]{}, where $0 \\leq b_c \\leq B_c$;\\\nii. ",
"MNO will reserve $\\delta>0$ caching slots per day for her own purposes;\\\niii. ",
"reserved slots expire after $1/\\eta$ days for $\\eta>0$;\\\niv. ",
"in order to attain $b_c$ caching slots per day, CP $c$ bids $\\tilde b \\in [0,1]$, and the MNO grants $b_c = b_0 \\, \\tilde b$ caching slots per day, where $b_0$ is such that $\\sum b_c + \\delta \\leq N_0$. In our analysis we assume $b_0=1$ for the sake of simplicity[^2].\\\nv. CPs are charged based on the caching rate $b_c$;\\\nvi. ",
"demand rates ${g_c^i}$ per content class are uniform across the MNO’s network.",
"\n\nThe MNO will thus accommodate $X_c$ memory slots for CP $c$ according to $$\\label{eq:state}\n\\dot X_c=b_c -\\eta \\, X_c,$$ so that the whole cache memory occupation will be ruled by $$\\label{eq:stateall}\n\\dot X=b -\\eta \\, X,$$ where $b:=\\sum_c b_c + \\delta$ is the total caching rate. ",
"The corresponding dynamics for the fraction of reserved cache memory, assuming $X(0)=0$ is $$x(t)=\\min \\left \\{ 1, \\frac{b}{N_0 \\eta}\\left(1-e^{-\\eta t}\\right) \\right \\}$$ The MNO, in order to ensure full memory utilization, will choose $\\eta$ such that $b/(N_0\\eta)\\geq 1$. It follows from a simple calculation that in steady state, the fraction of the caching space for content provider $c$ is $$x_c(t)=\\frac{b_c}{b_c+b_{-c}+\\delta}$$ Because contents’ requests are uniform across the MNO’s network, same fraction of cache space is occupied by CP $c$ in each local edge cache unit.",
"\n\nIn particular, CP $c$ will split his reserved memory among content classes according to a proportional share allocation with weighting coefficients ${u_c^i}$, $i=1,\\ldots,M$, where $\\sum_{i=1}^M {u_c^i}=1$. We define ${{\\mathbf u}_c}:=({u_c^{1}},\\ldots,{u_c^{M}})$ the [*caching policy*]{} of CP $c$.\n\nThen, the fraction of local edge cache memory occupied by contents of class $i$ from content provider $c$ is $$\\label{eq:share}\n{x_c^i}=\\frac{ b_c}{\\sum_{v \\in {\\mathcal C}} b_v +\\delta}{u_c^i}$$\n\nFinally, a tagged content of class $i$ of content provider $c$ is found in the memory of a local edge cache with probability ${P_c^i}=\\min\\{\\frac{N}{{N_c^i}}{x_c^i},1\\}$. In the rest of the paper, we will assume $N<{N_c^i}$ for the sake of simplicity.",
"\n\nNow, we want to quantify the probability for a given requested content not to be found in the local edge cache memory, i.e., the *missed cache* probability.",
"\n\nUnder the Poisson assumption, the probability for a tagged UE not to find any SC within a distance $r$ is $e^{-\\pi r^2 \\Lambda}$. Applying a thinning argument, the probability not to find a content of class $i$ of CP $c$ within distance $r$ is $e^{-\\pi r^2 \\Lambda P_c^i}$.\n\nThe expected missed cache rate (MCR) is thus $$\\label{eq:costfun}\nU_c(b_c,b_{-c},{{\\mathbf u}_c})=\\sum_i {g_c^i}\\, e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^i}}\\frac{b_c}{b_c+b_{-c}+\\delta}{u_c^i}}$$ It depends on caching rate $b_c$ and on caching policy ${{\\mathbf u}_c}$. Also, $b_{-c}:=\\sum_{v\\not = c}b_v$ accounts for the fact that other content providers share the same cache space. ",
"In the next section we shall describe the optimal caching policy ${{\\mathbf u}_c}^*$ attained when CP $c$ aims at minimizing , for a fixed value $b_c$ of the caching rate.",
"\n\n![",
"Local edge cache unit providing $N$ memory slots.[]{data-label=\"fig:edgecloud\"}](FIG/NetworkDiagram2.png){width=\"\\linewidth\"}\n\nOptimal Caching Policy {#sec:contalloc}\n======================\n\nIn order to analyse the model introduced before, we need to characterize the CPs’ response to competitors’ actions, i.e., $b_{-c}$. Hence, we assume that each CP aims at minimizing his own MCR, and that the network provider guarantees full information to CPs, i.e., storage capacity, spatial density of SCs and total caching rate. ",
"We defer the study of the system under partial information at the content provider’s side to later works.",
"\n\nWe hence consider the following resources allocation problem for the single CP:\n\nGiven opponents’ strategy profile ${\\mathbf b}_{-c}=(b_1,\\ldots,b_{c-1},b_{c+1},\\ldots,b_C)$ the optimal caching policy of $c\\ \\in {\\mathcal C}$ is the solution of $$\\label{eq:best_resp}\n\\mathbf{u}_c^* := \\arg\\min_{{u_c^{1}},\\ldots,{u_c^{M}}} U_c(b_c,b_{-c},{{\\mathbf u}_c})$$ subject to the following constraints: $$\\label{eq:constraints}\n{u_c^i}\\geq0, \\quad \\sum_i{u_c^i}= 1$$\n\nIt is immediate to observe that $U_c(b_c,b_{-c},{{\\mathbf u}_c})$ is a strictly convex function in the single content provider control ${{\\mathbf u}_c}$, so that a unique solution exists [@boyd]. ",
"In order to solve for the constrained minimization problem in equations and we can write the Lagrangian for player $c \\in {\\mathcal C}$ as follows $$L_c(\\mathbf{u}_c,\\mathbf{\\mu},\\nu)=\\sum_i {g_c^i}e^{-{\\Lambda_c^i}\\frac{b_c}{b+\\delta} {u_c^i}}-\\sum_i\\mu_i{u_c^i}+\\nu\\left(\\sum_i{u_c^i}-1\\right)\\nonumber$$ For notation’s sake, we have defined ${\\Lambda_c^i}:= \\pi r^2\\, \\Lambda_f \\frac{N}{N^c_i}$; we define this quantity [*availability*]{}. ",
"Furthermore, since constraints are affine, the Karush Kuhn Tucker (KKT) conditions provide the solution of the original problem [@boyd].",
"\n\nHereafter, we enlist the KKT conditions: $$\\begin{aligned}\n&& \\nabla_u L_c(\\mathbf{u}_c,\\mathbf{\\mu},\\nu)={\\mathbf 0}\n\\qquad \\mbox{stationarity}\\\\ \n&&{u_c^i}\\geq 0 \\qquad \\mbox{primal feasibility: control}\\\\\n&&\\sum_i{u_c^i}-1= 0 \\qquad \\mbox{ primal feasibility: normalization}\\\\\n&&\\mu_i\\geq 0 \\qquad \\mbox{ dual feasibility: control}\\\\\n&&\\nu\\geq 0 \\qquad \\mbox{ dual feasibility: normalization}\\\\\n&&\\mu_i{u_c^i}=0 \\qquad \\mbox{complementarity slackness}\\end{aligned}$$\n\nUsing a standard argument [@boyd], by complementary slackness, ${u_c^i}>0$ implies $\\mu_i=0$; let us define index set $I:=\\{i \\in \\{1,2,\\ldots,M\\}\\,|\\, {u_c^i}>0\\}$.\n\nPopularity sorted case {#sec:popsort}\n----------------------\n\nLet us discuss a simplified setting where popularity is the main driver for the CPs. ",
"Let us first assume that the indexes are sorted according to contents’ popularity ${g_c^{r}}$, i.e., ${g_c^{1}}\\geq \\ldots \\geq {g_c^{M}}$. We also assume ${N_c^{1}} \\leq \\ldots\\leq {N_c^{M}}$: more popular contents are also less abundant. ",
"This assumption will be relaxed in the next section, where we derive the general solution; we will see that there exists a natural order combining popularity and availability of contents which determines whether a content class is cached or not.",
"\n\nIn the case at hand, the structure of the optimal allocation follows from\n\n\\[lemma:saturation\\] Let ${g_c^{r}}\\geq {g_c^{r+1}}$ and ${N_c^{r}}\\leq {N_c^{r+1}}$ for $r=1,\\ldots,M$, then ${u^*}_c^r=0$ implies ${u^*}_c^{r+1}=0$\n\nFrom the previous statement we can deduce the following\n\n\\[eq:corl1\\] Under the assumptions of Lemma.",
" \\[lemma:saturation\\] there exists $1\\leq r_0 \\leq M$ such that response ${u^*}_c^i>0$ for $i \\leq r_0$ and ${u^*}_c^i=0$ otherwise\n\nThe stationarity conditions can be used in order to determine the optimal content allocation in closed form. ",
"Let $0\\leq i \\leq r_0$, then $\\mu_i=\\mu_{r_0}=0$, so that $${\\Lambda_c^{r_0}}{g_c^{r_0}} e^{-{\\Lambda_c^{r_0}}\\frac{b_c}{b+\\delta} {u^*}_c^{r_0}}={\\Lambda_c^i}{g_c^i}e^{-{\\Lambda_c^i}\\frac{b_c}{b+\\delta}{u^*}_c^{i}}$$ and $${{u^*}_c^i}=\\frac{{\\Lambda_c^{r_0}}}{{\\Lambda_c^{i}}}{u^*}_c^{r_0} - \\frac{b+\\delta}{ {\\Lambda_c^i}b_c} \\log \\Big ( \\frac{{g_c^{r_0}}\\,{\\Lambda_c^{r_0}}}{{g_c^{i}}\\,{\\Lambda_c^{i}}}\\Big )$$\n\nFinally, due to the constraint saturation $$\\begin{aligned}\n\\label{eq:threshold}\n{u^*}_c^{r_0} = \\frac{1 + \\frac{b+\\delta}{b_c}\\sum_{i=0}^{r_0} \\frac{1}{{\\Lambda_c^{i}}}\\log \\Big ( \\frac{{g_c^{r_0}}\\,{\\Lambda_c^{r_0}}}{{g_c^{i}}\\,{\\Lambda_c^{i}}}\\Big )}{\\sum_{i=0}^{r_0}\\frac{{\\Lambda_c^{r_0}}}{{\\Lambda_c^{i}}}} \\end{aligned}$$ From Corol.",
" \\[eq:corl1\\], the optimal solution corresponds to the maximal $r_0$ such that the corresponding ${u^*}_c^{r_0}$ solving lies in $[0,1]$.\n\nWe hence observe that when ${\\Lambda_c^i}={\\Lambda_c^{j}}$ for all $i,j$, i.e., when availability is same for all classes, the optimal caching policy depends on contents’ popularity only. ",
"The smaller the request rate ${g_c^i}$, i.e., the less popular the content class, the smaller the cache share reserved to contents of that class. ",
"Such optimal policy is analogous to the optimal content replacement $\\texttt{MIN}$ algorithm [@BeladyMIN]. ",
"In fact, $\\texttt{MIN}$, assumes full information about the future, replaces first contents which will be requested farthest in the future.",
"\n\nGeneral solution\n----------------\n\nThe solution to the KKT conditions can be formulated as a waterfilling-like solution [@boyd]. ",
"In fact, from stationarity conditions, $\\mu_r$ writes as $$\\partial_{u_c^i}L_c=-{\\Lambda_c^i}\\frac{b_c}{b+\\delta}{g_c^i}e^{-{\\Lambda_c^i}\\frac{b_c}{b+\\delta} {u_c^i}}-\\mu_i+\\nu=0$$ $$\\mu_i=\\nu-{\\Lambda_c^i}\\frac{b_c}{b+\\delta}{g_c^i}e^{-{\\Lambda_c^i}\\frac{b_c}{b+\\delta} {u_c^i}}$$\n\nwhich can be specialized into the following two cases.",
"\n\n[*Case i*]{}: $\\nu>{\\Lambda_c^i}{g_c^i}\\frac{b_c}{b+\\delta}$. In this case $\\mu_i>0$ for any ${u_c^i}\\geq 0$. Hence, by complementary slackness, ${u_c^i}=0$.\n\n[*Case ii*]{}: $\\nu\\leq{\\Lambda_c^i}{g_c^i}\\frac{b_c}{b+\\delta}$. It is always possible to find ${u_c^i}>0$ satisfying the stationarity condition and a $\\mu_i$ that satisfies the complementary slackness condition: just set $\\mu_i=0$ and $${u_c^i}=\\frac{b+\\delta}{{\\Lambda_c^i}b_c} \\log\\left(\\frac{{\\Lambda_c^i}{g_c^i}}{\\nu}\\frac{b_c }{b+\\delta}\\right)\n$$ Finally, let $\\alpha_i:=\\frac{b+\\delta}{{\\Lambda_c^i}{g_c^i}b_c}$. For notation’s sake, the solution writes $$\\begin{aligned}\n\\label{eq:watersol1}\n&&\\hskip-12mm {u_c^*}^i=\\begin{cases}\n\\frac{b+\\delta}{{\\Lambda_c^i}b_c}\\left(\\log(1/\\nu) -\\log(\\alpha_i)\\right)& \\mbox{ if } 1/\\nu>\\alpha_i\\\\\n0 & \\mbox{ if } 1/\\nu \\leq \\alpha_i\\\\\n\\end{cases}\\\\\n&&\\hskip-12mm \\mbox{subject to: } \\quad \\sum_i {u_c^*}^i =1\\nonumber\\end{aligned}$$\n\nIt is immediate to recognize a waterfilling solution in logarithmic scale. ",
"Let $\\alpha=\\min_i\\alpha_i$. Indeed $\\sum_i{u_c^*}^i $ is strictly increasing in $1/\\nu, 1/\\nu>\\alpha$. Also, $\\sum_i{u_c^*}^i(1/\\nu)=0$ for $1/\\nu\\leq \\alpha$, and $\\lim_{1/\\nu\\rightarrow\\infty}\\sum_i{u_c^*}^i(1/\\nu)=\\infty$. Thus, there exists a unique positive $\\nu$ satisfying our problem.",
"\n\nActually, the solution is determined in polynomial time $O(M)$: let $[\\cdot]$ be the permutation of the indexes which sorts $\\alpha_i$ in increasing order, i.e., $\\alpha_{[i]}\\leq \\alpha_{[i+1]}$. For every choice $\\alpha_{[i]}\\leq 1/\\nu \\leq \\alpha_{[i+1]}$, one can determine a value of $\\nu$ $$\\log(1/\\nu)=\\frac{\\frac{b_c}{b_c+b_{-c}+\\delta}+\\sum_{r=1}^k \\frac{\\log \\alpha_{[r]}}{{\\Lambda_c^{[r]}}}}{\\sum_{r=1}^k \\frac 1{{\\Lambda_c^{[r]}}}}$$ for $k=1,\\ldots,M$. Then, consider the only $1/\\nu$, compatible with . ",
"We observe that $\\alpha_{[i]}\\leq \\alpha_{[i+1]}$ is equivalent to state that ${g_c^{[i]}}{\\Lambda_c^{[i]}} \\geq {g_c^{[i+1]}}{\\Lambda_c^{[i+1]}}$: clearly, if $u_c^{[i]}=0$, indeed $u_c^{[i+1]}=0$, so that we can generalize Prop.",
" \\[eq:corl1\\] as follows\n\n\\[eq:corl2\\] There exists $1\\leq r_0 \\leq M$ such that ${u_c^*}^{[s]}>0$ for $s \\leq r_0$ and ${u_c^*}^{[s]}=0$ otherwise.",
"\n\n\\[rem:popularity\\] The existence of a threshold structure in a waterfilling-type of solution is not surprising; what we learn instead is that the natural order which determines which content classes are cached or not is given by the values ${g_c^i}\\cdot {\\Lambda_c^i}$. Hence, the index sorting $[\\cdot]$ which orders the content classes with decreasing ${g_c^i}\\cdot {\\Lambda_c^i}$ is the order by which a content provider prioritizes content classes to be cached as the cache memory available increases.",
"\n\nIn the rest of the paper we assume content classes sorted according to $[\\cdot]$.\n\nOptimal Missed Cache Rate {#sec:util}\n=========================\n\nCPs who optimize contents to be cached, for a given value of $b_c$, minimize the expected MCR $U_c(b_c,b_{-c},{{\\mathbf u}_c})$ in the caching policy ${{\\mathbf u}_c}$. In the game model presented in the next section we shall leverage on the convexity properties of the optimized MCR $U_c: \\mathbb {R}_+^2 \\rightarrow \\mathbb {R}$, defined as $$\\label{eq:onedymutil}\n\\hskip-3mm U(b_c,b_{-c}):=\\min_{\\mathbf {{\\mathbf u}_c}\\in \\Pi}\\!\\! ",
"\\left \\{ \\sum_i {g_c^i}e^{-{\\Lambda_c^i}\\frac{ b_c}{b_c + b_{-c}+\\delta}{u_c^i}} \\right \\}$$ where $\\Pi=\\{\\mathbf u \\in \\mathbb{R}^M| {{\\mathbf u}_c}\\geq 0, \\sum {u_c^i}= 1\\}$. As already proved, the minimum in is unique, hence $U_c(b_c,b_{-c})$ is well defined. ",
"Hereafter we thus demonstrate its convexity in $b_c$.\n\nActually, convexity can be derived for a class of functions wider than the posynomial expression appearing in . ",
"We first need the following fact, whose proof is found in the Appendix.",
"\n\n\\[lemma:lemma3\\] Let $f$ be non increasing, with domain $\\mathbb{R}_+$. Let $H(x)=x \\, f(x)$ be convex. ",
"Then $f$ is convex on $\\mathbb{R}_+$.\n\nWe can now derive the general conditions for the convexity of the optimal missed cache rate\n\n\\[lem:conv\\] Let $h: \\mathbb{R}^{M} \\rightarrow \\mathbb{R}$, convex and decreasing in each variable $x_i$ for $i=1,\\ldots,M$, then $$U_c(b_c,b_{-c}):= \\min_{\\mathbf {{\\mathbf u}_c}\\in \\Pi} h \\Big (\\frac{{u_c^{1}} b_c}{b_c + b_{-c} + \\delta},\\ldots, \\frac{{u_c^{M}} b_c}{b_c + b_{-c} + \\delta}\\Big )$$ is convex and decreasing in $b_c$.\n\nIn order to prove convexity for $U_c$, we consider perspective function $H(t,\\mathbf x)=t \\cdot h(\\mathbf x/t)$: $H$ is known to be convex if $h$ is convex [@boyd pp.89]. ",
"In the next step, let $a=b_{-c}+\\delta$, and consider the function $$\\begin{aligned}\n\\hskip-7mm &&\\min_{\\mathbf ({u_c^{1}},\\ldots,{u_c^{M}})} \\left \\{ H(b_c + a,b\\cdot {{\\mathbf u}_c})\\left | \\sum {u_c^i}=1 ,{u_c^i}\\geq 0\\right .\\right \\} \\nonumber \\\\\n\\hskip-7mm &&=(b_c + a) \\cdot \\!\\!\\!\\!\\min_{\\mathbf ({u_c^{1}},\\ldots,{u_c^{M}})} \\left \\{ h\\Big (\\frac{b_c \\cdot {{\\mathbf u}_c}}{b_c + a} \\Big )\\left | \\sum {u_c^i}=1,{u_c^i}\\geq 0 \\right .\\right \\}\\nonumber \\\\\n\\hskip-7mm &&=(b_c + a) \\, U_c((b_c + a)-a,b_{-c})=(b_c + a) \\, \\widehat U_c(b_c + a ,b_{-c}) \\nonumber \\end{aligned}$$ which is convex since it is obtained by minimizing $H(b_c + a,\\mathbf x)$ over the simplex $\\sum x_i=b_c$ which is a convex set. ",
"Now using Lemma \\[lem:conv\\], we conclude that $\\widehat U_c(b_c + a,b_{-c})$ is convex in the first variable, and by affinity so does $U_c(b_c,b_{-c})$.\n\nIn order to prove the monotonicity of $U_c(b_c,b_{-c})$ in $b_c$, let us consider $b_c\\geq 0$ and $b_c+\\epsilon$ for some $\\epsilon>0$ and the respective optimal caching policy ${{\\mathbf u}_c}^*(b_c)$ and ${{\\mathbf u}_c}^*(b_c+\\epsilon)$. We write\n\n$$\\begin{aligned}\n\\hskip-3mm&&h\\Big ({{\\mathbf u}_c}^*(b_c) \\frac{b_c}{b_c+b_{-c}+\\delta} \\Big ) > h\\Big ({{\\mathbf u}_c}^*(b_c) \\frac{b_c+\\epsilon}{b_c+\\epsilon+b_{-c}+\\delta} \\Big ) \\nonumber\\\\\n&&> h\\Big ({{\\mathbf u}_c}^*(b_c+\\epsilon) \\frac{b_c+\\epsilon}{b_c+\\epsilon+b_{-c}+\\delta} \\Big )\\nonumber \\end{aligned}$$\n\nwhere the first inequality follows from monotonicity and the second from optimality.",
"\n\nThe case in satisfies the assumptions by letting $h(\\mathbf x)=\\sum_i {g_c^i}e^{-{\\Lambda_c^i}\\, x_i}$.\n\nFor presentation’s sake, in Sec.",
" \\[sec:game\\] we shall identify $U(b_c,b_{-c},{{\\mathbf u}_c}^*):=U(b_c,b_{-c})$. There, we also need the following result, whose proof is found in the Appendix.",
"\n\n\\[lma:limit\\] There exists $\\varepsilon>0$ such that, for any $b_c<\\varepsilon$, ${{\\mathbf u}_c}^*=(1,0,\\ldots,0)$ and the optimal MCR is $$\\label{eq:utilzero}\nU_c(b_c,b_{-c},{{\\mathbf u}_c}^*)={g_c^{1}} e^{-{\\Lambda_c^{1}}\\frac{b_c}{b_c + b_{-c}+\\delta}}+\\sum_{i > 1}{g_c^{i}}$$\n\nThe case $M=2$\n--------------\n\nFor two classes of contents, $M=2$, the expression for $U_c(b_c,b_{-c})$ can be derived in simple closed form. ",
"This sample case retains the main properties of the optimal policy and it is useful in order to provide insight into the structure of the optimal MCR. ",
"First, we write the expression of the optimal MCR $$U_c(b_c,b_{-c})=\\min_{0\\leq {u_c^{1}} \\leq b_c} {g_c^{1}} e^{-{\\Lambda_c^{1}} \\frac{b_c\\,{u_c^{1}}}{b_c+b_{-c}+\\delta}} +{g_c^{2}} e^{-{\\Lambda_c^{2}} \\frac{b_c(1-{u_c^{1}})}{b_c+b_{-c}+\\delta}}$$ For the sake of notation, we denote $\\Gamma:=\\frac{{g_c^{2}}{\\Lambda_c^{2}}}{{g_c^{1}} {\\Lambda_c^{1}}}$. The (unconstrained) minimum of the right hand term is attained at $$\\label{eq:min2D}\n{u^*}_c^1=\\frac{{\\Lambda_c^{2}}}{{\\Lambda_c^{1}}+{\\Lambda_c^{2}}}-\\frac{(b_c+b_{-c}+\\delta)}{b_c({\\Lambda_c^{1}}+{\\Lambda_c^{2}})}\\log(\\Gamma)$$ When ${u^*}_c^1\\in (0,1)$, the utility function of $c\\in {\\mathcal C}$ is $$U_c(b_c,b_{-c})= K_c \\, e^{-\\frac{{\\Lambda_c^{1}}{\\Lambda_c^{2}}}{{\\Lambda_c^{1}}+{\\Lambda_c^{2}}}\\frac{b_c}{b_c+b_{-c}+\\delta}}$$ where the constant appearing on the first term is $$\\label{eq:Kc}\nK_c={g_c^{1}} \\cdot \\Gamma ^{\\frac{{\\Lambda_c^{1}}}{{\\Lambda_c^{1}}+{\\Lambda_c^{2}}}}+ {g_c^{2}} \\cdot \\Gamma ^{-\\frac{{\\Lambda_c^{2}}}{{\\Lambda_c^{1}}+{\\Lambda_c^{2}}}}$$ Incidentally, the convexity of $U_c(\\cdot,b_{-c})$ for $M=2$ can be verified directly from the convexity of $\\exp(1/x)$ and by composition with an affine function, which preserves convexity.",
"\n\nWe are interested in characterizing precisely the behavior of the expected MCR as a function of $b_c$. In particular, we want to assess the influence of the system parameters.",
"\n\nNow, we can obtain the following result\n\n\\[prop:2Dcase\\] i. Assume $\\Gamma<1$. Let ${\\Lambda_c^{1}} > \\log(1/\\Gamma)$, and define threshold for content $2$ $$\\label{eq:bcstar}\nb_c^{\\star}=(b_{-c}+\\delta)\\frac{\\log(1/\\Gamma)}{{\\Lambda_c^{1}} - \\log(1/\\Gamma)}$$ then it holds $$\\label{eq:util}\nU_c(b_c,b_{-c})=\\begin{cases}\n{g_c^{1}} e^{-{\\Lambda_c^{1}} \\frac{b_c}{b_c+b_{-c}+\\delta}} + {g_c^{2}} & \\mbox{if} \\quad 0 \\leq b_c < b_c^{\\star}\\\\\nK_c \\, e^{-\\frac{{\\Lambda_c^{1}}{\\Lambda_c^{2}}}{{\\Lambda_c^{1}}+{\\Lambda_c^{2}}}\\frac{b_c}{b_c+b_{-c}+\\delta}} & \\mbox{if} \\quad b_c \\geq b_c^{\\star}\n\\end{cases}$$ where the corresponding optimal cache policy is $(1,0)$ in the first case, $({u^*}_c^1,1-{u^*}_c^1)$ in the second case and constant $K_c$ as in\\\nii. ",
"Let ${\\Lambda_c^{1}} \\leq \\log(1/\\Gamma)$, then $(1,0)$ case holds for any $b_c>0$ with associated expected MCR defined as in case i.\\\niii. ",
"If $\\Gamma>1$, both i. and ii. ",
"hold with role of content $1$ and $2$ reversed.",
"\n\nThe proof follows by inspection of considering ${u^*}_c^1$ as an unconstrained minimizer. ",
"First, we observe that if $\\Gamma<1$, then ${u^*}_c^1>0$, i.e., the first content class is always cached. ",
"The other conditions follow by imposing ${u^*}_c^1 \\geq 1$.\n\nDiscussion: availability, popularity and competition {#discussion-availability-popularity-and-competition .unnumbered}\n----------------------------------------------------\n\nHereafter we draw insight from Prop.",
" \\[prop:2Dcase\\]. ",
"First, as seen there, the optimal caching rate ${u^*}_c^1$ depends solely on a few system parameters, namely ${g_c^{i}}$ and ${\\Lambda_c^{i}}$ for $i=1,2$. Actually, when $\\Gamma<1$ then ${{u_c^{1}}}^*=1-{{u_c^{2}}}^*>0$: contents of type $1$ are always cached because ${g_c^{2}}{\\Lambda_c^{2}}<{g_c^{1}}{\\Lambda_c^{1}}$. The fact that contents of type $2$ are cached depends on the sign of ${\\Lambda_c^{1}} - \\log(1/\\Gamma)$, which in turn determines the actual structure of the waterfilling solution.",
"\n\nFrom Prop.",
" \\[prop:2Dcase\\], $\\Gamma<1$ means that contents of type $2$ are either less popular (${g_c^{2}}\\leq {g_c^{1}}$) and/or less available (${\\Lambda_c^{2}}\\leq {\\Lambda_c^{1}}$) than contents of type $1$. The availability ${\\Lambda_c^{1}}$ of contents of type $1$ determines whether they will be eventually cached. ",
"In practice, when ${\\Lambda_c^{1}} > \\log(1/\\Gamma)$, there exists a critical value of the CP caching rate $b_c$, i.e., the threshold . ",
"Above such value, contents of type $2$ are cached, below that they are not cached. ",
"For the sake of consistency, in the case when ${\\Lambda_c^{1}} \\leq \\log(1/\\Gamma)$, $b^\\star=+\\infty$ while for $\\Gamma>1$, $b^\\star=0$.\n\nFurthermore, $b_c^\\star$ increases linearly with both the MNO caching rate $\\delta$ and the competitors’ aggregate caching rate $b_{-c}$: competition for edge caching resources tends to prevent caching of contents with smaller product ${g_c^i}{\\Lambda_c^i}$. Actually, under higher competition figures, optimal caching policies are of the type ${{u_c^{1}}}^*=1$, and ${u^*}_c^2=0$. It is interesting to observe that, as detailed in case ii., ",
"not always there exists a caching rate $b_c$ such that it is worth caching the least profitable content class.",
"\n\nWe have provided a pictorial representation of the results of this section in Fig.",
" \\[fig:2D\\] for the case $M=2$. In Fig.",
" \\[fig:2Da\\] the value of ${\\Lambda_c^{1}}$ has been fixed at different values and the corresponding behavior of the threshold value $b_c^\\star$ has been reported as a function of $\\Gamma$. For $\\exp({\\Lambda_c^{1}}) \\leq 1/\\Gamma$, it holds $b_c^\\star=\\infty$ since there is no switch-on value of $b_c$ for class $2$. Fig.",
" \\[fig:2Db\\] represents the region where the switch-on of the less popular content is possible as it can be derived from the expression as a function of $1/\\Gamma$ and ${\\Lambda_c^{1}}$.\n\nGame Model for Content Providers {#sec:game}\n================================\n\nSo far the caching rate $b_c$ has been input for the CPs in order to decide how to optimize the caching policy ${{\\mathbf u}_c}$. Let MNO propose to CPs costs $\\lambda_c$ per caching slot. ",
"CP $c$ strategy in turn is the number $b_c$ of caching slots he reserves per day, with convex and compact strategy set $[0,Bc]$. The best response $b_c^*$ of CP $c$ depends on his contents, and his opponents’ strategies. ",
"It is the minimizer of the [*cost function*]{} $U_c(b_c,b_{-c},{{\\mathbf u}_c}) + \\lambda_c \\cdot b_c$: it solves $$\\begin{aligned}\n\\label{eq:userlutil}\n&&\\min_{b_c} U_c(b_c,b_{-c},{{\\mathbf u}_c}) + \\lambda_c \\cdot b_c \\\\\n&& \\quad 0 \\leq b_c \\leq B_c\\nonumber\\nonumber\\end{aligned}$$ Here $b_{-c}=\\sum_{v\\not = c} b_{-v}$ and opponents’ strategy profile writes $\\mathbf b=(b_1,\\ldots,b_{c-1},b_{c+1},\\ldots,b_C)$.\n\nThe ${{\\mathbf u}_c}$ appearing in is a general caching policy and we shall consider two cases.",
"\n\n[**Caching Rate Optimizers.**]{} ",
"In this case, the best response of content providers is decided for a [*fixed caching policy*]{} ${{\\mathbf u}_c}$. I.e., each content provider decides beforehand the caching policy ${{\\mathbf u}_c}$ for any given caching rate $b_c$. Let $V_c(x_c)= \\sum_i g_c \\, e^{-{\\Lambda_c^{i}} x_c}$: it is convex and decreasing and $U_c(b_c,b_{-c},{{\\mathbf u}_c})=V_c(b_c/(\\sum b_c + \\delta))$. Hence, if all players are caching rate optimizers, the game is a variant of the Kelly mechanism [@YangPerfEval]. ",
"The basic Kelly mechanism allocates a divisible resource among players proportionally to the players’ bids, in our case the equivalent required caching rates. ",
"Here, compared to the standard formulations in literature [@comsnet2014; @johari2004; @YangPerfEval; @basar] our formulation combines three specific features which render it non standard:\n\n- bounded compact and convex strategy set;\n\n- $\\delta > 0$ is equivalent to a bidding reservation, as described in [@basar];\n\n- prices may depend on the player, i.e., the game is a generalized Kelly mechanism [@YangPerfEval]\n\nWe denote the Kelly mechanism in the form outlined above a [*generalized Kelly mechanism with reservation and bounded strategy set*]{}.",
"\n\n[**Simultaneous Optimizers.**]{} ",
"In this case ${{\\mathbf u}_c}={{\\mathbf u}_c}^*$. When players are simultaneous optimizers, the structure of the game still resembles the Kelly mechanism [@johari2004]. ",
"For $M=1$, the game corresponds to the case of caching rate optimizers. ",
"For $M\\geq 2$, the fact that the game is actually a Kelly mechanism is proved formally in the following\n\n\\[lma:kellyform\\] If players are simultaneous optimizers, the game is a generalized Kelly mechanism with reservation and bounded strategy set.",
"\n\nThe proof of the above result is found in the Appendix. ",
"Here, it is sufficient to observe that even in the case of a simultaneous optimizer CP $c$, the optimal MCR can be expressed as $U_c(b_c,b_{-c})=U_c(b_c,b_{-c},{{\\mathbf u}_c}^*)=V_c(b_c/(\\sum b_c + \\delta))$ where $V_c(x_c)$ is convex and continuously differentiable in $x_c=\\frac{b_c}{\\sum b_c + \\delta}$.\n\nExistence and uniqueness of the Nash Equilibrium\n------------------------------------------------\n\nIn the general case, the game may comprise a mixture of both CPs who are caching rate optimizers and who are simultaneous optimizers. ",
"From the above discussion, the game is still a generalized Kelly mechanism with reservation and bounded strategy set.",
"\n\nIn order to characterize the possible equilibria, we describe first the best response $b_c^*$ of each player\n\n\\[lma:bestresp\\] Given the opponent CPs’ strategy profile $\\mathbf b_{-c}$:\\\ni. It holds $b_c^*=0$ if and only if $\\dot U(0,b_{-c}) > -\\lambda_c$ where $$\\dot U(0,b_{-c})=\n\\begin{cases}\n-\\frac{\\sum_i {g_c^i}{\\Lambda_c^{i}} {u_c^i}}{b_{-c}+\\delta} & \\mbox{caching rate optimizers} \\\\\n-\\frac{{g_c^{1}} {\\Lambda_c^{1}} }{b_{-c}+\\delta} & \\mbox{simultaneous optimizers} \n\\end{cases}$$ ii. ",
"Let $b_c^*>0$, then $b_c^*=\\min\\{b_c,B_c\\}$, where $\\dot U_c(b_c,b_{-c})=-\\lambda_c$.\\\n\nThe above statement follows from the fact that the objective function in is convex and thus has a unique minimum in $[0,B_c]$. The expression of $\\dot U(0,b_{-c})$ in the case of simultaneous optimizers is derived from the expression reported in Lemma \\[lem:conv\\].",
"\n\nThe zero ${{\\mathbf b}}^*={\\mathbf 0}$ and the saturated ${{\\mathbf b}}^*=\\mathbf B$ Nash equilibria are easily characterized in the following\n\n\\[thm:trivialNash\\] i. ${{\\mathbf b}}^*={\\mathbf 0}$ is the unique Nash equilibrium iff ${g_c^{1}} {\\Lambda_c^{1}} <\\lambda_c \\delta $ if $c$ is a simultaneous optimizer and $\\sum {g_c^i}{\\Lambda_c^{i}} <\\lambda_c \\delta $ if $c$ is a caching rate optimizer.\\\nii. ",
"${{\\mathbf b}}^*=\\mathbf B$ is the unique Nash equilibrium if and only if it holds $\\dot U_c(B_c,\\sum B_c + \\delta)>-\\lambda_c$ for all $c\\in {\\mathcal C}$.\n\nWe observe that in the original Kelly mechanism, the strategy vector ${\\mathbf 0}$ is never a Nash equilibrium [@comsnet2014; @johari2004].",
"\n\nIn our case, it may be the Nash equilibrium and this is the effect of the term $\\delta>0$ due the MNO’s usage of the cache. ",
"In fact, the physical interpretation is provided by the condition i. in Prop.",
" \\[thm:trivialNash\\]. ",
"No CP has incentive to start caching at give price when the marginal revenue for starting caching, i.e., represented by the product of demand and availability, does not exceed the value of the cache share reserved to the MNO operations, the term $\\lambda_c \\delta$. Conversely, at low prices a saturated Nash equilibrium ${{\\mathbf b}}^*=\\mathbf B$ is expected.",
"\n\nIn the general case, the presence of a bounded strategy set requires a specific proof for the uniqueness of the Nash equilibrium, as seen in the following.",
"\n\n\\[lma:uniqueness\\] The game has a Nash equilibrium and it is unique.",
"\n\nWe describe a brief outline of the full proof of the above result which is found in the Appendix. ",
"In order to prove the existence of Nash equilibria of the game, it is sufficient to observe that:\n\n- the multistrategy set is a convex compact subset of $\\mathbb{R}^C$;\n\n- $U_c(b_c,b_{-c},{{\\mathbf u}_c})$ is convex conditionally to the opponents strategy, both for simultaneous optimizers and caching rate optimizers;\n\nHence, the existence of Nash equilibria is a direct consequence of the result of Rosen [@rosen], originally formulated for $n$–persons concave games. ",
"With respect to the uniqueness, ${{\\mathbf b}}^* = {\\mathbf 0}$ and ${{\\mathbf b}}^* = \\mathbf B$ are always unique from Prop.",
" \\[thm:trivialNash\\]. ",
"Once we excluded those trivial cases, the uniqueness can be derived by extending an argument [@basar] to the case of a bounded strategy set. ",
"Such proof applies to both the case of simultaneous optimizers and of caching-rate optimizers. ",
"However, it requires cost functions to be continuously differentiable in $b_c$, which is not straightforward for simultaneous optimizers.",
"\n\nFinally, the proof of uniqueness applies also to the context where part of the players are simultaneous optimizers and the others are caching-rate optimizers.",
"\n\nWe further observe that from the proof of Thm.",
" \\[lma:uniqueness\\] we can derive a simple bisection algorithm to calculate the unique solution of the game. ",
"It will be used in the numerical section where we shall provide further characterization of the game via quantitative measures, There, we are describing the pricing operated by the MNO and the convergence to the Nash equilibrium when CPs are myopic cost minimizers.",
"\n\nNumerical Results {#sec:numres}\n=================\n\n{width=\"0.23\\linewidth\"} (-129,95)[(b)]{} (-115,28)\n\n[90]{}[Cost Function]{}\n\n(-65,0)[Step]{} \\[fig:F22\\]\n\nIn this section we provide numerical description and validation of the model.[^3] First we validate the models’ assumptions against a real world scenario. ",
"Then, we focus on the single player’s actions, having fixed the remaining players’ strategies. ",
"Finally we provide numerical characterization of the game introduced in the previous section.\\\n[*Point Process.*]{} ",
"The model introduced in Sec.",
" \\[sec:model\\] assumes that SCs are distributed according to a spatial Poisson process of given intensity $\\Lambda$. Hence, we have tested the performance of the optimal caching policy in the case the SCs spatial deployment does not adhere to the assumption of a Poisson point distribution. ",
"In order to do so, we have been comparing the theoretical results with the outcome of a simulation performed over a real dataset. ",
"The real dataset (source <http://opencellid.org/>) is the sample distribution of the cell towers deployed in downtown Milan over a $ 2\\times 3$ Kms area, as depicted in Fig.",
" \\[fig:F11\\]: it includes the location of $4717$ cell towers corresponding to $\\Lambda=786.2$ base stations per square Km. ",
"The distribution of base stations in a very densely populated urban area has been used as a reasonable approximation for a SC deployment.",
"\n\nThe sample spatial density $\\Lambda$ has been used in the model in order to evaluate, under the same spatial density of SCs, the theoretical CP’s cost function for increasing values of the covering radius $0\\leq r\\leq 400$m in the following cases (see Fig.",
" \\[fig:F12\\]): a) the CP performs a uniformly [*random*]{} caching policy ${u_c^{i}}=1/3$, $i=1,2,3$ for constant caching rate $b_c$ b) the CP performs a [*popularity-based*]{} caching policy, i.e., ${u_c^{i}}:={g_c^i}/\\sum {g_c^i}$, for constant $b_c$ c) the CP is a [*caching rate optimizer*]{} adopting a popularity based caching policy d) the CP is a [*simultaneous optimizer*]{}.",
"\n\nThe results in Fig.",
" \\[fig:F13\\] refer to a simulation encompassing the same strategies under the sample point distribution of Fig.",
" \\[fig:F11\\]. ",
"The simulation has been performed by repeatedly selecting a random UE position in the playground, and measuring the sampling frequency of missed cache events upon requesting contents from SCs within the UE’s radio range.",
"\n\nBy comparing the results in Fig.",
" \\[fig:F12\\] and Fig.",
" \\[fig:F13\\], we observe that the Poisson distribution – as expected due to the non-uniform spatial density of the sample real-world deployment – tends to slightly underestimate the cost incurred by CPs. ",
"However, the theoretical and the simulated results are very close and the relative performance of the caching policies match the prediction of the theoretical model. ",
"This result confirms that the proposed model performs well even in real world scenarios: under a non-Poisson point process for the SC spatial distribution a rational optimizing player would choose the proposed optimal strategy over other possible strategies.",
"\n\n[*Cost function.*]{} ",
"In the next experiment we describe the optimal caching policy (Fig.",
" \\[fig:F14\\]) and the cost function (Fig.",
" \\[fig:F21\\]) in the case $M=3$. In particular, Fig.",
" \\[fig:F14\\] reports on the characteristic waterfilling structure of the optimal caching as the parameter $b_c$ increases. ",
"As predicted by the model, the water-filling solution has a threshold structure. ",
"The value of $b_c$ determines the content classes that become active: for large $b_c$ all content classes are cached, whereas for small values only some are cached. ",
"In Fig.",
" \\[fig:F21\\] we have reported the typical convex shape of the cost function corresponding to the same setting and for increasing values of $b_{-c}$. It is worth noting how the actions of opponents, reflected in the value of $b_{-c}$, affect the shape of $c$’s cost function.",
"\n\n[*Convergence to the Nash equilibrium.*]{} ",
"In Fig.",
" \\[fig:F22\\] and Fig.",
" \\[fig:F23\\] we have simulated $3$ CPs who are simultaneous optimizers. ",
"They behave as [*myopic*]{} players: each one of them, chosen at random, optimizes his own cost function based on the opponents’ profile. ",
"Numerical simulations show that, after a small number of iterations the game stabilizes on the same restpoint irrespective of initial strategies. ",
"As depicted in Fig.",
" \\[fig:F23\\] the restpoint is indeed a minimum for each CP’s cost function, i.e., it is the Nash equilibrium of the game. ",
"This behavior suggests that the game has the finite improvement property [@MondreShapPotGames], even though we could not identify analytically a potential for the game. ",
"Hence, the system would naturally converge to his unique Nash equilibrium if each player optimizes independently its own cost function against the opponents.",
"\n\nFinally, we have drawn in Fig \\[fig:F24\\] the daily revenue of the MNO at the Nash equilibrium ${{\\mathbf b}}^*$ as a function of the caching price $\\lambda$, uniform for all CPs. ",
"Because the MNO’s total revenue $\\sum_c \\lambda \\cdot b_c^*$ depends on the Nash equilibrium, she could try to optimize her revenue by leveraging the CPs’ cost structure. ",
"We observe numerically that the total revenue appears to have a unique maximum at a certain maximizer price $\\lambda^*$. This suggests the existence of a unique Stackelberg equilibrium for the proposed scheme. ",
"This provides the possibility to compute the global restpoint of the system when both CPs and MNO behave strategically.",
"\n\nConclusions {#sec:concls}\n===========\n\nA model for mobile edge caching in 5G networks has been presented. ",
"OTT content providers compete for the cache memory made available by a MNO at given price. ",
"Several features of the system are captured, including popularity and availability of contents, spatial distribution of small cells, competition for cache memory and the effect of price. ",
"CPs can optimize the allocation of contents in order to reduce customers’ aggregated missed cache rate. ",
"We have found that the optimal caching policy is of waterfilling type. ",
"Also, it is showed to give priority to contents based on popularity and availability. ",
"We have confirmed the validity of the caching policy optimization on real-world traces.",
"\n\nFinally, the competition for the shared caching memory can be formulated as a convex $n$–persons game. ",
"This game is a new form of the Kelly mechanism with bounded strategy set, where each CP trades off the expected missed cache rate for the price paid to the MNO in order to reserve cache memory space. ",
"The existence and uniqueness properties of the Nash equilibrium are demonstrated. ",
"Also, numerical results indicate that when CPs are myopic optimizers, the system converges to a unique restpoint which is the Nash equilibrium.",
"\n\nFurthermore, from numerical results, this game appears to have a unique Stackelberg equilibrium, a relevant feature for the MNO in order to maximize her revenue at the optimal price. ",
"To this respect, an interesting research direction is to develop online algorithms by which the MNO can learn over time such optimal price.",
"\n\nAppendix\n========\n\nProof of Lemma \\[lemma:saturation\\]\n-----------------------------------\n\nLet ${\\mathbf u}_c^*$ the optimal allocation, and let us assume that ${u^*}_c^{r+1}>0$ It is sufficient to write the generic cost as $$U_c(b_c,b_{-c},{{\\mathbf u}_c})=\\sum_{i \\in I} {g_c^i}\\, e^{-\\pi r^2\\Lambda \\frac{N}{N_i}\\frac{{u_c^i}b_c}{b+\\delta}}+\\sum_{i \\not \\in I} {g_c^i}$$ from which it is immediate to see that a response ${\\mathbf u}_c$ identical to ${\\mathbf u}_c^*$ but where ${u_c^{r}}={u^*}_c^{r+1}$ and ${u_c^{r+1}}={u^*}_c^{r}$ is better off. ",
"In fact we can write $$\\begin{aligned}\n&& \\hskip-7mm \\Delta U= U_c(b_c,b_{-c},{{\\mathbf u}_c}^*) - U_c(b_c,b_{-c},{{\\mathbf u}_c}) \\nonumber \\\\\n&&\\hskip-7mm ={g_c^{r+1}} e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^{r+1}}}\\frac{{{u_c^{r+1}}}^* b_c}{b+\\delta}} \\hskip-2mm + {g_c^{r}} - {g_c^{r}} e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^{r}}}\\frac{{{u_c^{r+1}}}^* b_c}{b+\\delta}}-{g_c^{r+1}}\\nonumber \\\\\n&& \\hskip-7mm > {g_c^{r+1}} e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^{r}}}\\frac{{{u_c^{r}}}^* b_c}{b+\\delta}} + {g_c^{r}} - {g_c^{r}} e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^{r}}}\\frac{{{u_c^{r}}}^* b_c}{b+\\delta}}-{g_c^{r+1}}\\nonumber \\nonumber \\\\\n&& \\hskip-7mm > ({g_c^{r}} - {g_c^{r+1}})\\Big ( 1 - e^{-\\pi r^2\\Lambda \\frac{N}{{N_c^{r}}}\\frac{{{u_c^{r}}}^* b_c}{b+\\delta}} \\Big ) > 0 \\nonumber\\end{aligned}$$ which concludes the proof.",
"\n\nProof of Lemma \\[eq:utilzero\\]\n------------------------------\n\nOne only content type is cached if and only if $$\\begin{aligned}\n&&1={u_c^{[1]}} =\\frac{b_c+u_{-c}+\\delta}{{\\Lambda_c^{[1]}}}\\left(\\log(1/\\nu) -\\log(\\alpha_{[1]})\\right)\\nonumber\\\\\n&&\\log(1/\\nu) -\\log(\\alpha_{[i]})<0, \\forall i\\geq 1\\end{aligned}$$ After simple calculations, the above condition brings $$\\begin{aligned}\n&&1/\\nu=e^{\\frac{{\\Lambda_c^{[1]}}b_c}{b_c+u_{-c}+\\delta}}\\alpha_{[1]}< \\alpha_{[i]}, \\forall i>1\\nonumber\\end{aligned}$$ Which can hold true if and only if the exponential term is close enough to $1$. Finally, observe that the ordering of the $\\alpha_i$’s does not depend on $b_c$ and that the exponential converges to 1 for small $b_c$, which completes the proof.",
"\n\nProof of Lemma \\[lemma:lemma3\\]\n-------------------------------\n\nIf we assume $H$ and $f$ are both twice differentiable the proof is trivial. ",
"In the case of non differentiable functions, we can verify the convexity condition for $f(\\cdot)$. In fact, for every $0\\leq x_1 \\leq x_2$ and $t\\in (0,1)$: $$\\begin{aligned}\n\\label{eq:conv}\n&&f(tx_1+(1-t)x_2)=\\frac{H(tx_1+(1-t)x_2)}{tx_1+(1-t)x_2}\\\\\n&& \\leq \\frac{tH(x_1)+(1-t)H(x_2)}{tx_1+(1-t)x_2}=g(t)\\end{aligned}$$ Now, we observe that $g(0)=f(x_2)$ and $g(1)=f(x_1)$. Also, we note that $g$ is convex for $t\\in [0,1]$. In fact, $g$ is differentiable in $t$, and, by rewriting $g(t)=N(t)/D(t)$, a direct calculation provides $$\\ddot g(t)=\\frac{2x_1x_2(x_2-x_1)\\Big (\\frac{H(x_1)}{x_1}-\\frac{H(x_2)}{x_2} \\Big )}{(t\\,x_1+(1-t)\\,x_2)^3}\\geq 0$$ where the nonnegative sign is due to assumption that $f$ is non-increasing. ",
"Now, by convexity, we can write $$g(t)=g((1-t)\\cdot 0 +t\\cdot1)\\leq (1-t)g(0)+tg(1)$$ and replacing the above expression in , $f$ is seen to satisfy the claim of convexity.",
"\n\nProof of Lemma \\[lma:kellyform\\]\n--------------------------------\n\nFirst, we have to prove that the optimal cost can be expressed as $U_c(b_c,b_{-c})=V_c(b_c/(\\sum b_c + \\delta))$ where $V_c(x_c)$ is convex and continuously differentiable in $x_c=\\frac{b_c}{\\sum b_c + \\delta}$. In order to do so, for a given value of $b_{-c}$ we denote $\\mathcal B(b_{-c})=\\{b_{[1]}^\\star,\\ldots,b_{[M]}^\\star\\}$ the set of thresholds such that, for $b_{[k]}^\\star\\leq b_c <b_{[k+1]}^\\star$ it holds ${u_c^{[1]}},\\ldots,{u_c^{[k]}}>0$ and ${u_c^{[k+1]}}=\\ldots={u_c^{[M]}}=0$. Hereafter, let us simplify the notation and consider the indexes sorted according to $[\\cdot]$ as described in Sec.",
" \\[sec:contalloc\\]. ",
"From and accounting for the expression of the $\\alpha$s, it is immediate to see that the number of active content classes is a function of the type $k=k\\Big( \\frac{b_c}{\\sum b_c + \\delta}\\Big)$. Also, for $b^\\star(k)\\leq b_c< b^\\star(k+1)$, we can calculate the closed form\n\n$$\\begin{aligned}\n\\label{eq:optcostexpl}\nU(b_c,b_{-c})=B_k \\prod_{i=1}^k ({\\Lambda_c^i}{g_c^i})^{\\frac{1}{B_k{\\Lambda_c^i}}} e^{-\\frac{1}{B_k}\\frac{b_c}{b_c+b_{-c}+\\delta}}+\\sum_{i=k+1}^M {g_c^i}\\end{aligned}$$\n\nwhere $B_k=\\sum_{i=1}^k \\frac1{{\\Lambda_c^i}}$. Hence, by inspection, the right hand term is a function of $x_c=\\frac{b_c}{\\sum b_c + \\delta}$.\n\nNow, we have to prove that such function if continuously differentiable. ",
"Since $U(b_c,b_{-c})$ is smooth in $(b_c^\\star(k),b_c^\\star(k+1))$, we can restrict to the threshold points, in particular, we consider $b_{k+1}^\\star$ and verify that equality holds for the left and right derivative of . ",
"It holds $$\\label{eq:derivative}\n\\frac{d}{db_c} U(b_c,b_{-c})=-\\prod_{i=1}^k ({\\Lambda_c^i}{g_c^i})^{\\frac{1}{B_k{\\Lambda_c^i}}} e^{-\\frac{1}{B_k}\\frac{b_c}{b_c+b_{-c}+\\delta}}\\frac{d}{db_c} \\frac{b_c}{\\sum_v b_v+\\delta}$$ The value of threshold $b^\\star=b^\\star(k+1)$ is derived by the relation $\\log(1/\\nu)=\\log(\\alpha_{k+1})$ which writes\n\n$$\\begin{aligned}\n\\label{eq:bstarval}\n\\frac{b^\\star}{\\sum b^\\star + b_{-c} + \\delta}=-\\sum_{i=1}^k\\frac{\\log(\\alpha_i)}{{\\Lambda_c^i}}+A_k\\log \\Big ( \\frac{\\sum b^\\star + b_{-c} + \\delta}{{\\Lambda_c^{k+1}} {g_c^{k+1}} b^\\star }\\Big )\\end{aligned}$$\n\nWe can now replace and $\\alpha_{i}=\\frac{b^\\star+b_{-c}+\\delta}{{g_c^i}{\\Lambda_c^i}b^\\star}$ into for both the case $k$ and $k+1$. A direct calculation, which we omit for the sake of space, shows that the equality at $b^\\star$ is verified, concluding the statement.",
"\n\nProof of Theorem \\[lma:uniqueness\\]\n-----------------------------------\n\nThe proof of Theorem \\[lma:uniqueness\\] will require the result in the Lemma reported next. ",
"The Lemma itself is a technical continuity argument. ",
"We remark that, even in the unbounded case, the results of uniqueness of the Nash equilibrium for the Kelly mechanism [@basar], requires the cost function to be twice continuously differentiable.",
"\n\n\\[lemma:xFunction\\] For each player $c$ there exists a unique, continuous, decreasing function $x_c(p)$ such that $$\\label{eq:implicit}\n\\frac{d}{d x}V_c(x_c(p))(1-x_c(p))+p\\lambda_c=0,$$ where $V_c(x)$ is the function defined in the proof of Lemma \\[lma:kellyform\\].",
"\n\nSince we refer to player $c$, unless required for the sake of clearness, we shall hereafter identify $x:=x_c$ for the sake of notation. ",
"First, we need to have a closer look to the structure of the cost function. ",
"We know that there exist $n$, $n\\leq M-1$, intervals for $b_c$ such that in each interval the cost function is described as in (\\[eq:optcostexpl\\]). ",
"Now, let $x=x(b_c,b_{-c})=\\frac{b_c}{b_c+b_{-c}+\\delta}$. We want to characterize $x_k^\\star=\\frac{b^\\star_k}{b^\\star_k+b_{-c}+\\delta}$. By definition, $x^\\star_k$ is the threshold value above which the $k$-th content type will start to be cached.",
"\n\nNow, resorting to the water-filling formulation of the optimal allocation in (\\[eq:watersol1\\]), the $k$-th threshold is uniquely identified by the condition $$\\label{eq:condthrak}\n\\begin{cases}\n1/\\nu=\\alpha_k \\\\\n\\sum^{k-1}\\frac{1}{x^\\star_k\\Lambda_c^i}(\\log(\\frac{1}{x^\\star_k\\Lambda_c^kg_c^k})-\\log(\\frac{1}{x^\\star_k\\Lambda_c^ig_c^i}))=1\n\\end{cases}$$ The condition\n\n$$\\label{eq:criticx}\nx^\\star_k=\\sum^{k-1}\\frac{1}{\\Lambda_c^i}\\log \\left (\\frac{\\Lambda_c^i g_c^i}{\\Lambda_c^k g_c^k} \\right )$$\n\nIt is important to observe that the $x^\\star_k$s do not depend on $b_{-c}$: the $M$ critical values for $x$ are the values $x^\\star_k$ determined by such that $x^\\star_k\\leq 1$. At this point, we observe that the thresholds in $x$ for player $c$ depend on $c$’s parameters only, and they are naturally ordered increasing with the lag $k$ and. ",
"Incidentally, we observe that, since $x\\in[0,1]$, it is well possible that just some of the $x^\\star_k$ are smaller than one, and those that are bigger than one are not attained. ",
"In fact, this means that some content classes may not be cached, for any value of $b_c$.\n\nWe can now go on with the main proof of the Lemma. ",
"In [@basar] the cost function is assumed to be twice continuously differentiable, i.e., $C^2$. However, our cost function is only continuously differentiable in the variable $b_c$, i.e., $C^1$. More in detail, by direct inspection it is possible to verify that that the optimal missed cache rate is $C^2$ piecewise, with a finite number of points where the second order derivative is discontinuous: those correspond precisely the values $x_{k}^{\\star}$ discussed above.",
"\n\nThe argument proceeds as follows. ",
"Let $U_c(b_c,b_{-c}) +\\lambda_c(b_c)$ be the cost function of a simultaneous optimizer. ",
"The best response of the player $c$ must fulfill the following relation: $$\\label{eq:dU}\n\\frac{d}{d b_c}U(b_c,b_{-c})+\\lambda_c=0.$$ Now, define\n\n$$V(x)=B_k \\prod_{i=1}^k ({\\Lambda_c^i}{g_c^i})^{\\frac{1}{B_k{\\Lambda_c^i}}} e^{-\\frac{1}{B_k}x}+\\sum_{i=k+1}^M {g_c^i},\\ x\\in]x^\\star_k,x^\\star_{k+1}[.$$ We know that $V\\in C^2([0,1]\\setminus\\{x^\\star_1,...,x^\\star_M\\})\\cap C^1([0,1])$. Letting $x=\\frac{b_c}{b_c+b_{-c}+\\delta}, p=b_c+b_{-c}+\\delta$, we can rephrase (\\[eq:dU\\]) as $$\\label{eq:dUx}\n\\frac{d}{d x}V(x)(1-x)+p\\lambda_c=0,\\ x\\in]x^\\star_k,x^\\star_{k+1}[.$$ Now, in $]x^\\star_k,x^\\star_{k+1}[\\times \\mathbb{R}$ the left hand side is a $C^1$ function (indeed it is $C^\\infty$, but $C^1$ is sufficient for our argument), hence we can apply the implicit function theorem and, in the same fashion as in [@basar], we can derive the existence of a continuous decreasing function $x:]p_k,p_{k+1}[\\rightarrow]x_k,x_{k+1}[$, such that $\\frac{d}{d x}V(x(p))(1-x(p))+p\\lambda_c=0,\\ p\\in]p_k,p_{k+1}[$. Moreover, the monotonicity of $x$ implies $$\\lim_{p\\rightarrow p_{k}}x(p)=x^\\star_{k}, \\lim_{p\\rightarrow p_{k+1}}x(p)=x^\\star_{k+1}$$\n\nWe repeat the same argument on each interval $]x^\\star_k,x^\\star_{k+1}[$, and we finally glue together the $x$ functions defined over each interval obtaining a monotone surjective function. ",
"From the monotonicity of $V$, such function is well posed since forces same values of $x$ for same values of $p$. Also, continuity and monotonicity ensure that the the domain of $x$ is a connected set, i.e., the interval $\\cup ]p_k,p_{k+1}[=(0,\\delta+\\sum B_c)$.\n\nThus, we have defined a unique decreasing, continuous function $x(p):[0,\\sum B_c + \\delta]\\rightarrow[0,1]$ such that $(x(p),p)$ solves (\\[eq:dUx\\]).",
"\n\nWe can now prove Theorem \\[lma:uniqueness\\].\\\n\nIn order to characterize the existence of Nash equilibria of the game, it is sufficient to observe that:\n\n- the strategy set is a convex compact subset of $\\mathbb{R}^C$;\n\n- $U_c(b_c,b_{-c},{{\\mathbf u}_c})$ is convex conditionally to the opponents strategy;\n\nHence, the existence of Nash equilibria is a direct consequence of the result of Rosen [@rosen], originally formulated for $n$–persons concave games (here players minimize so convexity applies). ",
"Let ${{\\mathbf b}}^*$ is a Nash equilibrium: ${{\\mathbf b}}^* = {\\mathbf 0}$ and ${{\\mathbf b}}^* = \\mathbf B$ are always unique from Prop.",
" \\[thm:trivialNash\\]. ",
"Let us hence consider the remaining possible equilibria.",
"\n\nLet $x_c(p)$ the function defined at (\\[eq:implicit\\]). ",
"From Lemma \\[lma:bestresp\\], we can now write the best response in $x$ for each player as a function of $p$: $$\\label{eq:demand}\n\\hat x_c(p)=\\max(0,\\min(x_c(p),B_c/p)).$$ Since all functions in the definition of $\\hat x_c(p)$ are decreasing and continuous in $p$, so it is $\\hat x_c(p)$. Moreover, $\\hat x_c(0)=1, \\lim_{p\\rightarrow\\infty}\\hat x_c(p)=0$. Now, we observe that the actual best responses of players in a Nash equilibrium need to satisfy the condition\n\n$$\\label{eq:soldemand}\n\\sum \\hat x_c(p) = 1 - \\frac{\\delta}{p},\\ p\\in\\left[0,\\sum B_c+\\delta\\right].$$\n\nBut condition determines a unique $p$. In fact observe that the sum on the left-hand side is decreasing in $p$, its value at $0$ is $M$ and tends to $0$ as $p$ increases. ",
"The term on the right-hand side is increasing in $p$ and tends to 1 as $p$ increases. ",
"It follows that the two functions can be equal in no more than one point. ",
"This implies that the Nash equilibrium is unique and is determined by the unique $p^\\star$ such that the equality holds true.",
"\n\nWe can define $C_0(p)=\\{c \\in {\\mathcal C}| \\hat x_c(p)=0\\}$. Also, the set ${\\mathcal C}_B(p)=\\{c \\in {\\mathcal C}| p \\cdot \\hat x_c(p) \\geq B_c\\}$ is unique for every value of $p \\in [0,\\sum B_c)$. Finally, the Nash equilibrium ${{\\mathbf b}}^*$ is derived by the bijection ${{\\mathbf b}}=\\phi(p^*)$, where\\\ni. $\\phi_c(p^*) = 0$ for $c\\in {\\mathcal C}_0(p^*)$;\\\nii. ",
"$\\phi_c(p^*) = B_c$ for $c\\in {\\mathcal C}_B(p^*)$;\\\niii. ",
"the $\\phi_c(p^*)$s for $c\\in {\\mathcal C}'(p^*)={\\mathcal C}\\setminus ({\\mathcal C}_0(p^*)\\cup{\\mathcal C}_B(p^*))$ with the bijection induced from the full rank compatible linear system $$b_c^*(1-x_c^*)+\\sum_{v\\in {\\mathcal C}'(p^*)} b_v^* x_v^* =-\\delta x_c^* - |{\\mathcal C}'(p^*)| \\frac{B^2}{p} , c\\in {\\mathcal C}'(p^*)$$ which concludes the proof.",
"\n\nIt is worth observing that we proved that uniqueness holds despite the optimal cost function is not $C^2$ as required in [@basar]. ",
"In order to extend the argument of [@basar] to our case, we had to carefully adapt the implicit function theorem to the case of a piecewise-$C^1$ function. ",
"The uniqueness follows by continuity and monotonicity of the implicit function.",
"\n\n[^1]: $^\\diamond$Fondazione Bruno Kessler, via Sommarive, 18 I-38123 Povo, Trento, Italy; $^\\star$CERI/LIA, University of Avignon, 339, Chemin des Meinajaries, Avignon, France. ",
"This research received funding from the European Union’s H2020 Research and Innovation Action under Grant Agreement No.671596 (SESAME project).",
"\n\n[^2]: We refer to [@basarolsder] for an in depth discussion of the connection between mechanisms and fair share of resources of the type studied in this paper.",
"\n\n[^3]: Both the Python scripts and the dataset used for validation can be downloaded at <https://www.dropbox.com/s/mm1hja2dbp4tw0x/caching_scripts.tar.gz?dl=0>.",
"\n"
] |
{
"pile_set_name": "ArXiv"
}
|
[
0.0006197718903422356,
0.0007052852306514978,
0.0005645606433972716,
0.000596464378759265,
0.0006157453171908855,
0.0005594413378275931,
0.000601869192905724,
0.0006315308273769915,
0.000573422817979008,
0.0005721789202652872,
0.0006160070770420134,
0.0005267898086458445,
0.0008447780273854733,
0.0006653550663031638,
0.0006231973529793322,
0.0007070477586239576,
0.0009659707429818809,
0.0005677211447618902,
0.0008258085581474006,
0.0006579476757906377,
0.0007934916648082435,
0.0007517378544434905,
0.0006191080319695175,
0.0005942120333202183,
0.0007455762824974954,
0.0005866787396371365,
0.0006134940776973963,
0.0008000004454515874,
0.0005718381726182997,
0.0006777052185498178,
0.0006183614605106413,
0.0005656901630572975,
0.0005823488463647664,
0.0006004568422213197,
0.0005640214076265693,
0.0008463898557238281,
0.0005732605350203812,
0.0005508397007361054,
0.0005496489466167986,
0.0007872022106312215,
0.0005592209054157138,
0.0012736431090161204,
0.0006024902104400098,
0.0007872022106312215,
0.0007615631329827011,
0.0006075085257180035,
0.0012736431090161204,
0.002387573942542076,
0.0006268668221309781,
0.001186368172056973,
0.0010065415408462286,
0.0006264100084081292,
0.0006742795230820775,
0.0006110100075602531,
0.0005763106746599078,
0.0006863303715363145,
0.0006153439753688872,
0.0006228526472114027,
0.0005764482193626463,
0.000621012703049928,
0.0006359705585055053,
0.0008895246428437531,
0.0005864159902557731,
0.0008654056582599878,
0.0005637110443785787,
0.0006847150507383049,
0.0007665338343940675,
0.0005630084779113531,
0.0005577785195782781,
0.0006698029465042055,
0.0005666094366461039,
0.0005991109064780176,
0.0005789660499431193,
0.0005779507337138057,
0.022871194407343864,
0.0008486020960845053,
0.0006236652843654156,
0.0006164293736219406,
0.0008460693061351776,
0.0006403459701687098,
0.0007698716362938285,
0.007685421034693718,
0.0010134136537089944,
0.000964203616604209,
0.0009666073019616306,
0.0010378832230344415,
0.007515996228903532,
0.0007397301378659904,
0.021982597187161446,
0.0006972014089114964,
0.00419605290517211,
0.0010257282992824912,
0.006272823549807072,
0.0005916376248933375,
0.023180967196822166,
0.0010409411042928696,
0.0019055769080296159,
0.0008216355927288532,
0.0005651633837260306,
0.006988163106143475,
0.005698548164218664,
0.0005577105330303311,
0.01177934743463993,
0.0023506057914346457,
0.0005616548587568104,
0.0013274324592202902,
0.001286042737774551,
0.30873146653175354,
0.001704167341813445,
0.0006400127895176411,
0.0006877482519485056,
0.0006677508936263621,
0.0006709350273013115,
0.012605147436261177,
0.031376857310533524,
0.02285878360271454,
0.021398399025201797,
0.002296913880854845,
0.022939186543226242,
0.0008054145146161318,
0.006205787416547537,
0.012320551089942455,
0.000780776550527662,
0.000567454902920872,
0.00915998313575983,
0.05024776980280876,
0.0772056058049202,
0.010937033221125603,
0.005230878479778767,
0.001522539067082107,
0.007722537498921156,
0.0005224957130849361,
0.018220817670226097,
0.0005297836614772677,
0.010866392403841019,
0.001307942788116634,
0.0008690671529620886,
0.0008793766028247774,
0.0011382581433281302,
0.000700210512150079,
0.0008559055277146399,
0.0010736187687143683,
0.002818807726725936,
0.0011938875541090965,
0.0010470529086887836,
0.0013672690838575363,
0.0006679774960502982,
0.0010478845797479153,
0.0010647966992110014,
0.000527623516973108,
0.0007952663581818342,
0.00118984654545784,
0.0015748611185699701,
0.0008624462643638253,
0.01449207216501236,
0.0008287227828986943,
0.0022131020668894053,
0.0006404607556760311,
0.000599479884840548,
0.0007521255174651742,
0.0009526798967272043,
0.0008366912952624261,
0.0007015310111455619,
0.0005682703340426087,
0.0011436701752245426,
0.0005467974115163088,
0.005137431900948286,
0.0035951617173850536,
0.012446558102965355,
0.0010988315334543586,
0.0006153905997052789,
0.0006835486274212599,
0.002562321722507477,
0.0011604572646319866,
0.0005664633354172111,
0.0007297116098925471,
0.0005267250235192478,
0.00237978040240705,
0.0010414975695312023,
0.002562321722507477,
0.0005512509378604591,
0.0007648701430298388,
0.0006865289178676903,
0.0008762659272179008,
0.0005872012698091567,
0.0006592532736249268,
0.0006106048822402954,
0.001043237978592515,
0.0006151056732051075,
0.0006089052767492831,
0.000559890759177506,
0.0006866990006528795,
0.0006956662400625646,
0.00054566451581195,
0.000649717403575778,
0.0006853440427221358,
0.0005442812689580023,
0.0005958510446362197,
0.004270443692803383,
0.0006193095468915999,
0.0006627788534387946,
0.0010685494635254145,
0.000763444637414068,
0.0006072422256693244,
0.0009237336926162243,
0.0006146556115709245,
0.0005851703463122249,
0.0005747483810409904,
0.000889079412445426,
0.0006531846593134105,
0.000784624891821295,
0.0007773052784614265,
0.0034798607230186462,
0.0005581891164183617,
0.0007383468910120428,
0.0006813188083469868,
0.0006454920512624085,
0.0006433093803934753,
0.0006813188083469868,
0.0009970165556296706,
0.013343270868062973,
0.0014770608395338058,
0.0005765013047493994,
0.0006486077909357846,
0.0007442775531671941,
0.000668410852085799,
0.0006647155387327075,
0.0007560097728855908,
0.0018301341915503144,
0.0005788120906800032,
0.0005560420104302466,
0.0008043104317039251,
0.0007930706487968564,
0.0005744745139963925,
0.0007455702289007604,
0.0007076847832649946,
0.0005608628853224218,
0.0005957349203526974,
0.019774476066231728,
0.0007347314385697246,
0.0005566515028476715,
0.0006345232832245529,
0.0005834107869304717,
0.0005672016413882375,
0.03767819702625275,
0.0645277351140976,
0.004509499296545982,
0.001510842121206224,
0.005200146697461605,
0.006629917770624161,
0.003873692126944661,
0.0010033054277300835,
0.010987331159412861,
0.0010585079435259104,
0.016920162364840508,
0.0008087153546512127,
0.0006982260383665562,
0.0005831909365952015,
0.0021190461702644825,
0.0006700066151097417,
0.0005440919194370508,
0.0015285916160792112,
0.0031473415438085794,
0.008228759281337261,
0.0008412002352997661,
0.0006814866792410612,
0.0006336212973110378,
0.0006227648118510842,
0.0016194730997085571,
0.018625065684318542,
0.0012517506256699562,
0.003359984140843153,
0.002690691500902176,
0.002562321722507477,
0.0007915836176835,
0.0014787792460992932,
0.0024021512363106012,
0.0011293927673250437,
0.0006372795905917883,
0.0007862374186515808,
0.00819456111639738,
0.016310112550854683,
0.03545841574668884,
0.0005560049321502447,
0.0006179249030537903,
0.0005601592129096389,
0.0007424766663461924,
0.0005631611566059291,
0.0005223483312875032,
0.0007016205345280468,
0.001995444530621171
] | 0.004377 | 291 |
[
"The GOP’s inability to scrap ObamaCare this week means, among other things, that President Trump will end his first six months in office without a major legislative accomplishment. ",
"And one question is how much his supporters care.",
"\n\nRecent Wall Street Journal/NBC News polling gives the president a 40% job-approval rating among all voters, while 55% disapprove. ",
"In counties Mr. Trump won last year, however, voters still back him by 50% to 46%. ",
"Similar results come from a Washington Post/ABC News survey released Sunday, which found..."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0009560383623465896,
0.006440278142690659,
0.0006537947338074446,
0.0006709036533720791,
0.0006048549548722804
] | 0.001865 | 5 |
[
" In the\n\n United States Court of Appeals\n For the Seventh Circuit\n ____________________\nNo. ",
"18‐3402\nAUTO DRIVEAWAY FRANCHISE SYSTEMS, LLC,\n Plaintiff‐Appellee,\n v.\n\nAUTO DRIVEAWAY RICHMOND, LLC, and\nINNOVAUTO USA, LLC,\n Defendants,\n\n and\n\nJEFFREY CORBETT,\n Defendant‐Appellant.",
"\n ____________________\n\n Appeal from the United States District Court for the\n Northern District of Illinois, Eastern Division.",
"\n No. ",
"18 C 4971 — Manish S. Shah, Judge.",
"\n ____________________\n\n ARGUED FEBRUARY 4, 2019 — DECIDED JUNE 28, 2019\n ____________________\n\n Before WOOD, Chief Judge, and EASTERBROOK and ST. ",
"EVE,\nCircuit Judges.",
"\n WOOD, Chief Judge. ",
"This litigation presents a clash between\na franchisor and a franchisee who may (or may not) have\n\f2 No. ",
"18‐3402\n\nallowed their agreement to expire. ",
"Auto Driveaway Franchise\nSystems, LLC (“Auto Driveaway”) is a franchisor for commer‐\ncial vehicle transportation services; Jeffrey Corbett was one of\nits franchisees. ",
"Through his company, Auto Driveaway Rich‐\nmond, LLC (“AD Richmond”), Corbett ran Auto Driveaway\nfranchises in Richmond (Virginia), Nashville, and Cleveland.",
"\nThe arrangement was satisfactory for some time, but it went\ndownhill after Auto Driveaway heard that Corbett was open‐\ning businesses that competed with Auto Driveaway behind its\nback. ",
"Adding insult to injury, Corbett was also allegedly us‐\ning Auto Driveaway’s name to lend legitimacy to the new\nventures. ",
"Taking the position that Corbett’s actions breached\nthe non‐compete clauses of the franchise contracts and mis‐\nused Auto Driveaway’s trademarks, Auto Driveaway brought\nthis suit. ",
"The case has come to us on Corbett’s appeal from a\npreliminary injunction the district court entered. ",
"See 28 U.S.C.\n§ 1292(a)(1).",
"\n Before considering that injunction directly, we must ad‐\ndress several procedural problems that relate to our appellate\njurisdiction and the form of the injunction. ",
"We conclude that\nour jurisdiction is secure, but that the district court must re‐\nvisit both the form of the injunction and the amount of secu‐\nrity it required.",
"\n I\n Corbett’s three business locations were governed by sepa‐\nrate, but substantively identical, franchise agreements with\nAuto Driveaway. ",
"Corbett signed each one as the sole owner\nof AD Richmond. ",
"Each agreement included the following: a\nnon‐compete clause, a non‐disclosure clause, and a five‐year\nterm set to expire in 2016. ",
"Those expiration dates came and\nwent, but both parties initially continued dealing as though\n\fNo. ",
"18‐3402 3\n\nthe agreements were still in place. ",
"Not until November 2017\ndid Auto Driveaway mail a letter to Corbett offering formally\nto renew the franchise contracts for another five years begin‐\nning February 2018. ",
"Corbett never responded to the letter; in‐\nstead, he continued operating his franchises as before.",
"\n Some time after the November 2017 letter, Auto Drivea‐\nway learned that Corbett had been taking actions in apparent\nviolation of the franchise agreements. ",
"Corbett, it learned, was\nbuilding an app to compete against the app it had hired Cor‐\nbett to build for itself. ",
"Auto Driveaway also suspected that\nCorbett was using Auto Driveaway’s proprietary work prod‐\nuct as a starting point. ",
"To make matters worse, Corbett was\nset to launch his own app through a new company, Inn‐\novAuto, that also provided auto transportation services, in di‐\nrect competition with Auto Driveaway. ",
"Auto Driveaway\nquickly filed this lawsuit seeking to stop Corbett, InnovAuto,\nand sales or use of the app. ",
"One month later it formally termi‐\nnated its relationship with Corbett and AD Richmond.",
"\n In his initial answer to the complaint, Corbett admitted\nthat the franchise terms under his agreement with Auto Drive‐\naway were extended on a month‐to‐month basis after they ex‐\npired in 2016. ",
"He attempted to walk back that admission later\nin an amendment to his answer; the new version took the po‐\nsition that the franchise agreements expired and that the No‐\nvember 2017 letter from Auto Driveaway was a unilateral of‐\nfer that Corbett never accepted.",
"\n Several months later, Auto Driveaway discovered that\nCorbett had another competitive auto transport business, Tac‐\ntical Fleet. ",
"Though Tactical Fleet was not named in the origi‐\nnal complaint, Auto Driveaway asked the district court for a\npreliminary injunction to stop Corbett from operating that\n\f4 No. ",
"18‐3402\n\ncompany as well as InnovAuto and the app. ",
"After a brief hear‐\ning, the district court issued an order granting Auto Drivea‐\nway’s motion, based on evidence that Corbett was harming\nconsumer goodwill toward Auto Driveaway and was taking\nAuto Driveaway customers through his competing busi‐\nnesses. ",
"In broad strokes, the order states that Corbett may not\nengage in any conduct that might violate the non‐compete\nclause of the franchise agreement. ",
"The court required Auto\nDriveaway to post a $10,000 bond as security for the injunc‐\ntion; it did so.",
"\n II\n Before we can address the propriety of the injunction, we\nmust ensure that it is properly before this court and free of\nprocedural defects. ",
"There are potentially three problems with\nthis injunction: its timeliness, its scope, and its specificity. ",
"We\nreview each de novo. ",
"See Loertscher v. Anderson, 893 F.3d 386,\n392 (7th Cir. ",
"2018).",
"\n A\n The first question is whether this appeal is now moot.",
"\nWhile it was pending, the district court granted Corbett and\nAuto Driveaway’s request to amend their pleadings. ",
"Gener‐\nally, “[o]nce an amended pleading is interposed, the original\npleading no longer performs any function in the case.” ",
"Well‐\nness Cmty.‐Natʹl v. Wellness House, 70 F.3d 46, 49 (7th Cir. ",
"1995)\n(quoting 6 Charles Alan Wright, Arthur R. Miller, & Mary Kay\nKane, FEDERAL PRACTICE AND PROCEDURE § 1476 at 556–57,\n559 (1990)). ",
"If later developments in the case have removed\nthe legs on which the order under review stands, it is our duty\nas an appellate court to vacate the order and remand. ",
"See\nUnited States v. Munsingwear, Inc., 340 U.S. 36, 39–40 (1950).",
"\n\fNo. ",
"18‐3402 5\n\nThe way in which this rule applies to preliminary injunctions,\nhowever, depends on what the injunction covers: it might af‐\nfect the entire basis of the lawsuit, or it might affect only some\nof the claims or involve limited measures needed to preserve\nthe status quo pending final resolution of the case. ",
"Review of\nthe latter type of injunction normally leaves the underlying\ndispute undisturbed.",
"\n In order to avoid mootness, there must be a live contro‐\nversy in which the parties can obtain some relief from the\ncourt. ",
"Powell v. McCormack, 395 U.S. 486, 496 (1969). ",
"Practically\nspeaking, the question for us in this case is what might be\ngained by either party from our review of the challenged or‐\nder. ",
"If either factual developments or procedural steps in the\ndistrict court have left us with nothing meaningful to do, then\nwe must dismiss the appeal as moot. ",
"See Honig v. Students of\nCal. ",
"Sch. ",
"for the Blind, 471 U.S. 148, 149 (1985) (“No order of\nthis Court could affect the parties’ rights with respect to the\ninjunction we are called upon to review.”).",
"\n Either type of change—factual or procedural—can render\nan appeal from a grant or denial of a preliminary injunction\nmoot. ",
"For examples of cases in which the facts changed, see\nStotts v. Cmty. ",
"Unit Sch. ",
"Dist. ",
"No. ",
"1, 230 F.3d 989, 991 (7th Cir.",
"\n2000) (denial of preliminary injunction mooted by graduation\nfrom school); Henco, Inc. v. Brown, 904 F.2d 11, 13 (7th Cir.",
"\n1990) (preliminary injunction moot because injunction’s end\ndate passed while appeal was pending). ",
"The factual develop‐\nments in those cases erased the controversy because the rem‐\nedies originally ordered and under review by the court of ap‐\npeals no longer had any effect.",
"\n Similarly, procedural developments can moot an appeal\nfrom a preliminary injunction. ",
"The easiest example of this\n\f6 No. ",
"18‐3402\n\noccurs when the district court makes a final decision on the\nmerits while the interlocutory appeal is pending. ",
"See, e.g.,\nGarner v. Dreyer, 94 F. App’x 366 (7th Cir. ",
"2004) (citing United\nStates v. Estevez, 852 F.2d 239, 241 n.3 (7th Cir. ",
"1988)). ",
"In such\na case, the interim phase of the case is over and so there is\nnothing left to do or say about it. ",
"The proper course of action\nthen is to recognize that the interlocutory appeal is moot. ",
"That\noften occurs when the controversy over the preliminary in‐\njunction is overtaken by the entry of a permanent injunction.",
"\nThe rulings effectively “merge,” and so the earlier prelimi‐\nnary injunction no longer has any effect. ",
"Grupo Mexicano de\nDesarrollo S.A. v. Alliance Bond Fund, Inc., 527 U.S. 308, 317\n(1999). ",
"In some instances, however, an appeal can outlive its\ninjunction. ",
"Our review of a dissolved preliminary injunction\nmay continue if a party is seeking damages from the improper\nissuance of the injunction. ",
"N. Indiana Pub. ",
"Serv. ",
"Co. v. Carbon\nCnty. ",
"Coal Co., 799 F.2d 265, 268 (7th Cir. ",
"1986).",
"\n In this case, after the district court indicated that it was\ngranting a preliminary injunction, there were later procedural\nchanges (the revised pleadings) that we must examine to see\nif they affected the substantive basis for the district court’s or‐\nder. ",
"A quick look reveals that the new pleadings did no more\nthan to add Tactical Fleet to the list of parties; they had no\neffect on Auto Driveaway’s basic grievance. ",
"The preliminary\ninjunction is still in place, and it is still constraining the actions\nof Corbett and his companies. ",
"Real‐world consequences\nwould attend anything we were to do with it, whether affir‐\nmance, modification, or dissolution. ",
"That is the definition of a\nlive controversy. ",
"We note as well that preliminary injunctions\nby their nature are not set in stone. ",
"If circumstances change,\nthe parties are always free to return to the district court to ask\nfor changes.",
"\n\fNo. ",
"18‐3402 7\n\n B\n Corbett next argues that the preliminary injunction\nstrayed beyond the scope of the original complaint. ",
"He finds\nfault in Auto Driveaway’s failures to name Tactical Fleet in its\ncomplaint, to assert claims against him personally, and to in‐\nclude post‐termination breaches of contract. ",
"These quibbles,\nhowever, ignore the fact that the federal courts require notice\npleading, not fact pleading complete with all the minutiae. ",
"A\ncomplaint need only provide notice of a plausible claim; there\nis no rule requiring parties to plead legal theories or elements\nof a case. ",
"See generally Bell Atlantic Corp. v. Twombly, 550 U.S.\n544 (2007), and Ashcroft v. Iqbal, 556 U.S. 662 (2009). ",
"We are\nunpersuaded by Corbett’s attempt to portray the complaint\nas presenting anything other than allegations of breach of\ncontract and trademark infringement on the part of Corbett\nand his companies. ",
"Corbett was certainly on notice that this\nlawsuit challenged the practices that Auto Driveaway be‐\nlieved infringed on its business and good name. ",
"Any failure\nto include the specifics Corbett identifies does not offend the\nrequirements of Federal Rule of Civil Procedure 8(a)(2). ",
"We\nsee nothing covered by the preliminary injunction that went\nbeyond the case or controversy before the court or that could\nhave surprised Corbett. ",
"We note as well that Auto Driveaway\ncould not have been expected to know facts that Corbett was\ndeliberately keeping from it.",
"\n C\n Though the injunction falls within the scope of the com‐\nplaint and has not been rendered moot by subsequent pro‐\nceedings in the district court, it suffers from a different prob‐\nlem: failure to comply with Federal Rule of Civil Procedure\n65(d). ",
"That rule requires that “[e]very order granting an\n\f8 No. ",
"18‐3402\n\ninjunction … must: (A) state the reasons why it issued; (B)\nstate its terms specifically; and (C) describe in reasonable de‐\ntail—and not by referring to the complaint or other docu‐\nment—the act or acts restrained or required.” ",
"We interpret\nRule 65(d)(1)(C) to require that an injunction must be embod‐\nied in a standalone separate document. ",
"BankDirect Capital Fi‐\nnance, LLC v. Capital Premium Financing, Inc., 912 F.3d 1054,\n1057 (7th Cir. ",
"2019), citing Gunn v. Univ. ",
"Comm. ",
"to End the War,\n399 U.S. 383 (1970). ",
"While many injunctions are accompanied\nby separate opinions that explain the district court’s reason‐\ning, Rule 65(d) requires that the injunction itself contain\nenough information to render its scope clear. ",
"See Bethune\nPlaza, Inc. v. Lumpkin, 863 F.2d 525, 527 (7th Cir. ",
"1988). “",
"A ju‐\ndicial opinion is not itself an order to act or desist; it is a state‐\nment of reasons supporting the judgment.” ",
"Id. If the opinion\npurports to award declaratory relief, but the judgment does\nnot, then the opinion is reduced to dictum. ",
"Id.\n In this case, the district court issued a single order, styled\nas a “PRELIMINARY INJUNCTION ORDER,” which contained the\ncourt’s analysis and ended this way (after eight pages of ex‐\nplanation):\n For these reasons, this Court orders that:\n For the pendency of this litigation, until no later\n than September 30, 2020, defendants Auto Driveaway\n Richmond, LLC and Jeffrey Corbett are prohibited\n from engaging, directly or indirectly, as an owner, op‐\n erator, or in any managerial capacity, in any ‘for‐hire’\n motor carrier businesses operating as either a common\n carrier or a contract carrier or any business which op‐\n erates or grants franchises or licenses to others to oper‐\n ate a business that provides similar services and/or\n\fNo. ",
"18‐3402 9\n\n products as those offered by Auto Driveaway Fran‐\n chise Systems, LLC at or within a fifty mile radius of\n AD Richmond’s former offices or any other territory\n with an Auto Driveaway office other than as an author‐\n ized franchise owner of another Auto Driveaway of‐\n fice.",
"\n Because defendants are likely to incur some costs in\n ensuring compliance with this injunction and because\n it provides for a lengthy term, the risk of a wrongful\n injunction must be secured by Auto Driveaway. ",
"Plain‐\n tiff, through counsel Greensfelder, Hemker & Gale,\n P.C., shall deposit with the Court ten thousand dollars\n ($10,000.00), either cash, check, cashiers’ check, certi‐\n fied funds, or surety bond, as security to be held in the\n Court Registry. ",
"The $1,000 used to secure the earlier\n TRO may be applied toward the balance due for this\n preliminary injunction.",
"\n Plaintiff’s motion for a temporary restraining order\n and preliminary injunction, [55], is granted in part, de‐\n nied in part.",
"\nLike the order in BankDirect, this order says that it is an in‐\njunction. ",
"It reads like an injunction. ",
"But it is not a standalone\nseparate document that spells out within its four corners ex‐\nactly what the enjoined parties must or must not do. ",
"It there‐\nfore does not comply with Rule 65(d). ",
"The question is thus\nwhat consequences, if any, flow from that noncompliance.",
"\n Our initial question is whether the failure to comply with\nRule 65 affects our appellate jurisdiction under 28 U.S.C.\n§ 1292(a)(1). ",
"In the past, we have sometimes intimated that a\nfailure to comply with Rule 65(d) at least has the potential of\n\f10 No. ",
"18‐3402\n\ndepriving us of appellate jurisdiction. ",
"The logic is this: “there\nis no standing to seek relief in the form of an appellate judg‐\nment” from an order that “places the parties under no obliga‐\ntions.” ",
"Reich v. ABC/York‐Estes Corp., 64 F.3d 316, 320 (7th Cir.",
"\n1995); Original Great Am. ",
"Chocolate Chip Cookie Co., 970 F.2d at\n276. (“",
"An injunction that has no binding force at all simply\ncannot be appealed.”). ",
"Along those lines, we have said that\n“by reason of not complying with Rule 65(d) the order issued\nby the district court is not an injunction at all, it places the\ndefendant under no obligations; and an order that is not actu‐\nally or at least potentially coercive … does not impose the sort\nof tangible harm that Article III requires for standing to seek\njudicial relief, including relief in the form of an appellate judg‐\nment.” ",
"Chicago & N. W. Transp. ",
"Co. v. Ry. ",
"Labor Executivesʹ\nAssʹn, 908 F.2d 144, 149 (7th Cir. ",
"1990).",
"\n But a closer look at our cases reveals that we have not\nadopted a rigid rule rejecting jurisdiction in every case in\nwhich Rule 65 is violated. ",
"Instead, we have said that “whether\na purported injunction is appealable” depends on “whether it\nis in sufficient though not exact compliance with Rule 65(d)\n[such] that a violation could be punished by contempt or\nsome other sanction.” ",
"Id. at 276. ",
"In other words, we may re‐\nview those injunctions that contain enough content to permit\neffective enforcement. ",
"For example, in Chicago & North West‐\nern Transportation Company, we held that we had jurisdiction\nto review a “Memorandum Opinion and Order” since it was a\n“technical rather than substantial” violation of Rule 65(d). ",
"908\nF.2d at 150 (emphasis in original). ",
"But when injunctions fail\nthat specificity test, we have said that “by virtue of the failure to\ncomply with Rule 65(d), there is no injunction, and we lack ju‐\nrisdiction to hear [the] appeal.” ",
"Reich, 64 F.3d at 320 (emphasis\nadded).",
"\n\fNo. ",
"18‐3402 11\n\n The Supreme Court has confirmed that compliance with\nRule 65 and appellate jurisdiction are two different things,\nand that what matters for jurisdiction is the practical effect of\nthe order. ",
"It has discussed both appellate jurisdiction and\ncompliance with Rule 65(d) in a number of cases. ",
"One of the\nearliest was Gunn v. University Committee to End War in Viet\nNam, 399 U.S. 383 (1970), in which the Court found that it did\nnot have jurisdiction under 28 U.S.C. § 1253 to review an or‐\nder from a three‐judge district court holding that the parties\nwere entitled to injunctive relief but not ordering any relief.",
"\nId. at 389–90. ",
"It analyzed Rule 65(d) and section 1253 and\nacknowledged that both were concerned with clarity, but then\nit added the following in a footnote:\n This is not to suggest that lack of specificity in an in‐\n junctive order would alone deprive the Court of juris‐\n diction under § 1253. ",
"But the absence of any semblance\n of effort by the District Court to comply with Rule\n 65(d) makes clear that the court did not think that its\n per curiam opinion itself constituted an order granting\n an injunction.",
"\nId. at 389 n.4. ",
"This suggests a simple rule of “no relief, no in‐\njunction.”",
"\n An example of an order that sufficed for appellate juris‐\ndiction appears in Schmidt v. Lessard, 414 U.S. 473 (1974). ",
"The\npurported injunction at issue in Schmidt was similar to the one\nin Gunn, but it differed in a critical respect. ",
"As the Court put\nit, “[s]ince the opinion of the District Court by its own terms\nauthorizes the granting of injunctive relief … the judgment\nhere is sufficient to invoke our jurisdiction under 28 U.S.C.\n§ 1253.” ",
"Id. at 475. ",
"The Court then held that “although the or‐\nder below is sufficient to invoke our appellate jurisdiction, it\n\f12 No. ",
"18‐3402\n\nplainly does not satisfy the important requirements of Rule\n65(d).” ",
"Id. at 477.",
"\n The Court’s most recent word on the subject appears in\nAbbott v. Perez, 138 S. Ct. ",
"2305 (2018). ",
"There it reiterated that\nappellate jurisdiction and compliance with Rule 65 are differ‐\nent requirements, which call for different inquiries. ",
"It did so\nin the context of an appeal from a three‐judge district court\nunder 28 U.S.C. § 1253, rather than the more common inter‐\nlocutory appeal under 28 U.S.C. § 1292(a)(1). ",
"Importantly for\nour purposes, it stated that these are “textually interlocked”\nstatutes, with the “same purpose” and “nearly identical” “rel‐\nevant language.” ",
"Perez, 138 S. Ct. ",
"at 2320. ",
"The rules of con‐\nstruction and tests for the two, it confirmed, are the same. ",
"Id.\nPerez thus puts to rest whatever doubt anyone may have re‐\ntained about the applicability of Gunn and Schmidt to appel‐\nlate jurisdiction under section 1292(a)(1). ",
"Cf. ",
"BankDirect, 912\nF.3d at 1058 (asking whether Section 1253 and Sec‐\ntion 1292(a)(1) operate similarly with respect to appellate ju‐\nrisdiction over an order that does not comply with Rule\n65(d)).",
"\n The Perez Court began its analysis of the purported injunc‐\ntion with its jurisdiction, stating that:\n § 1253 must be strictly construed. ",
"But it also must be\n sensibly construed, and here the District Court’s or‐\n ders, for all intents and purposes, constituted injunc‐\n tions barring the State from conducting this year’s elec‐\n tions pursuant to a statute enacted by the Legislature.",
"\n Unless that statute is unconstitutional, this would seri‐\n ously and irreparably harm the State, and only an in‐\n terlocutory appeal can protect that State interest. ",
"As a\n result, § 1253 provides jurisdiction.",
"\n\fNo. ",
"18‐3402 13\n\nPerez, 138 S. Ct. ",
"at 2324 (citation omitted).",
"\n After confirming that it had jurisdiction, the Court turned\nto Rule 65(d). ",
"The Court recalled that “as explained in Gunn\nv. University Comm. ",
"to End War in Viet Nam, 399 U.S. 383, 389,\nn. 4 (1970), [it had] never suggested that a failure to meet the\nspecificity requirements of Rule 65(d) would ‘deprive the\nCourt of jurisdiction under § 1253.’” ",
"Id. at 2321. ",
"Furthermore,\nit emphasized that conflating the two doctrines would de‐\nprive an appellate court of jurisdiction to review an order that\nviolates Rule 65(d). ",
"Such a result, it said, would defeat the\npurpose of both the rule and appellate review:\n A contrary holding would be perverse. ",
"Rule 65(d)\n protects the party against which an injunction is issued\n by requiring clear notice as to what that party must do\n or refrain from doing. ",
"Where a vague injunction does\n not comply with Rule 65(d), the aggrieved party has a\n particularly strong need for appellate review. ",
"It would\n be odd to hold that there can be no appeal in such a\n circumstance.",
"\n For these reasons, we hold that we have jurisdiction\n under § 1253 to hear an appeal from an order that has\n the same practical effect as one granting or denying an\n injunction.",
"\nId. The “practical effects” test is in keeping with several im‐\nportant interests: (1) the purpose of appellate review to relieve\nparties of harmful erroneous orders; (2) the limits of standing\ngenerally to injured persons, and (3) the command to construe\nsection 1292(a)(1) narrowly such that the court of appeals will\nreview only those orders in need of immediate attention. ",
"See\n\f14 No. ",
"18‐3402\n\nGulfstream Aerospace Corp. v. Mayacamas Corp., 485 U.S. 271,\n287–88 (1988); Carson v. Am. ",
"Brands, Inc., 450 U.S. 79, 84 (1981).",
"\n The order in our case, as we already have pointed out, had\nthe practical effect of an injunction on the parties, despite the\ndistrict court’s failure to comply with the letter of Rule 65(d).",
"\nMissing only the self‐contained document that is required (a\nglitch that went unremarked by any of the parties), the district\ncourt’s order prevented Corbett from operating his business.",
"\nIt also required Auto Driveaway to secure that order with a\n$10,000 bond. ",
"See Rule 65(c). ",
"This is ample for purposes of\nappellate jurisdiction; there is thus no need to remand this\ncase to cure the Rule 65(d) defect.",
"\n III\n All that remains is for us to decide whether the district\ncourt abused its discretion when it entered the preliminary\ninjunction. ",
"See Ashcroft v. Am. ",
"Civil Liberties Union, 542 U.S.\n656, 664 (2004). ",
"Although we confess to having some misgiv‐\nings about this injunction, for the most part we conclude that\nit passes muster. ",
"The Supreme Court has held that “[a] plain‐\ntiff seeking a preliminary injunction must establish that he is\nlikely to succeed on the merits, that he is likely to suffer irrep‐\narable harm in the absence of preliminary relief, that the bal‐\nance of equities tips in his favor, and that an injunction is in\nthe public interest.” ",
"Winter v. Natural Res. ",
"Def. ",
"Council, Inc.,\n555 U.S. 7, 20 (2008). (",
"We have considered Corbett’s remaining\narguments, but none has merit.)",
"\n The district court should have said more about at least two\nthings. ",
"True, it found that Auto Driveaway was likely to suc‐\nceed on the merits on several key points: the enforceability of\nthe restrictive covenants in the agreement; the existence of an\n\fNo. ",
"18‐3402 15\n\nimplied‐in‐fact contract; and breach of such a contract. ",
"The\ncourt also found that harm to consumer goodwill and loss of\ncustomer relationships—both of which Auto Driveaway\nclaims—are irreparable harms. ",
"It further concluded that the\nharm to Corbett and his companies from the preliminary in‐\njunction was “minimal.” ",
"But it did not explain why a remedy\nat law—that is, an award of damages at the conclusion of the\nlawsuit—was inadequate. ",
"See Roland Mach. ",
"Co. v. Dresser In‐\ndus., ",
"Inc., 749 F.2d 380, 386 (7th Cir. ",
"1984). ",
"Perhaps Corbett\nwould not be able to pay any ultimate damages, but perhaps\nhe can do so easily: it is impossible to say on this record.",
"\n We also do not know why the district court chose such a\nmodest amount, $10,000, for Auto Driveaway to pay to protect\nCorbett against the harm he will incur during the pendency\nof the litigation, should he prevail at the end. ",
"When setting\nthe amount of security, we have instructed district courts to\n“err on the high side.” ",
"Mead Johnson & Co. v. Abbott Labs., ",
"201\nF.3d 883, 888 (7th Cir.), ",
"opinion amended on denial of rehʹg, 209\nF.3d 1032 (7th Cir. ",
"2000). ",
"In the second amended complaint,\nAuto Driveaway mentions that Corbett spent approximately\n$85,000 just on the development of software for InnovAuto.",
"\nThe $10,000 amount does not come close to securing even that\npotential loss for Corbett, not to mention his other predictable\nlosses from being barred from the business. ",
"In contrast to the\ninexplicably low bond amount, the injunction itself is a\nsweeping one. ",
"It forbids Corbett and AD Richmond “from en‐\ngaging, directly or indirectly, as an owner, operator, or in any\nmanagerial capacity, in any ‘for‐hire’ motor carrier businesses\noperating as either a common carrier or a contract carrier or\nany business which operates or grants franchises or license to\nothers to operate a business that provides similar services\nand/or products as those offered by Auto Driveaway\n\f16 No. ",
"18‐3402\n\nFranchise Systems, LLC at or within a fifty mile radius of AD\nRichmond’s former offices or any other territory with an Auto\nDriveaway office … .” ",
"The vague reference to “any other ter‐\nritory with an Auto Driveaway office” raises the potential of a\ngeographic scope far broader than one limited to Corbett’s\nRichmond operation, or the three locations he owned. ",
"Again,\nperhaps that is justifiable, but the scope of the injunction is\ndirectly related to the amount of the security required.",
"\n Accordingly, we AFFIRM the order of the district court in‐\nsofar as it preliminarily enjoins Corbett and AD Richmond\nfrom operating as a franchisee or de facto franchisee of Auto\nDriveaway, and insofar as it prohibits them from using any of\nthe contested technology, apps, or trademarks. ",
"On remand,\nthe district court should address the question whether to in‐\ncrease the security bond imposed on Auto Driveaway. ",
"Be‐\ncause the district court is better suited than this court to con‐\nsider the question of the adequacy of legal relief in the form\nof damages as a full substitute for the injunction, we leave that\nmatter undisturbed. ",
"Corbett and AD Richmond may, if they\nwish, ask the district court to reconsider that argument.",
"\n\n\n SO ORDERED.",
"\n\f"
] |
{
"pile_set_name": "FreeLaw"
}
|
[
0.0007701211143285036,
0.0006367086316458881,
0.001365765230730176,
0.0013785817427560687,
0.0007546418928541243,
0.0011868902947753668,
0.0008734737057238817,
0.0007557177450507879,
0.0007171168690547347,
0.0006117745651863515,
0.0007176528451964259,
0.0006838457193225622,
0.0006685395492240787,
0.009926057420670986,
0.0008392067975364625,
0.0006156293675303459,
0.0006742868572473526,
0.0005665626958943903,
0.0005652920808643103,
0.0006095198332332075,
0.0007236931123770773,
0.0005488016176968813,
0.0005936770467087626,
0.000633478513918817,
0.0007600311655551195,
0.0007996335043571889,
0.0006535875145345926,
0.0008485710131935775,
0.0007666248129680753,
0.0012155813165009022,
0.001204729313030839,
0.0006108033703640103,
0.0006193160661496222,
0.0011173125822097063,
0.0006835388485342264,
0.0007243844447657466,
0.0006389752379618585,
0.0007745882030576468,
0.0007003649952821434,
0.0009466092451475561,
0.0005769121926277876,
0.000698663352522999,
0.0005831386661157012,
0.0007418518653139472,
0.0007385615026578307,
0.0008426755666732788,
0.0007151073077693582,
0.0007650028564967215,
0.0008319747867062688,
0.0006132699199952185,
0.0006086348439566791,
0.000686484097968787,
0.0013785817427560687,
0.0005976471584290266,
0.0006086969515308738,
0.0011100559495389462,
0.0007778880535624921,
0.0007119590300135314,
0.0007838162709958851,
0.000724228098988533,
0.009731126949191093,
0.0012222687946632504,
0.0007382860640063882,
0.0006184244994074106,
0.015567278489470482,
0.0011276830919086933,
0.0013785817427560687,
0.0008317738538607955,
0.0007562721148133278,
0.0005980967544019222,
0.0006542518967762589,
0.0005845142295584083,
0.0006865397444926202,
0.0006692168535664678,
0.0007446950767189264,
0.0007655216031707823,
0.0008144570747390389,
0.0006365099106915295,
0.0007699651177972555,
0.000574945064727217,
0.000666275795083493,
0.0006819264963269234,
0.0005901963450014591,
0.0005902118282392621,
0.000859358231537044,
0.0012064696056768298,
0.0009112604311667383,
0.0009168927208520472,
0.0007728953496553004,
0.0005718722240999341,
0.0006140893674455583,
0.0005970846395939589,
0.0006116124568507075,
0.0007835362339392304,
0.0005855034105479717,
0.0005580973229371011,
0.0013785817427560687,
0.0006911313394084573,
0.0009358743554912508,
0.002143941819667816,
0.0006749893655069172,
0.0006261452217586339,
0.0008411601884290576,
0.0009766466682776809,
0.0006711895694024861,
0.0006414500530809164,
0.0007186647271737456,
0.0006913250545039773,
0.0013354886323213577,
0.0006731208995915949,
0.0005643561598844826,
0.0008071143529377878,
0.0008815444307401776,
0.0010744172614067793,
0.0008840207592584193,
0.0005796158220618963,
0.0010348412906751037,
0.0007389603415504098,
0.0009134589345194399,
0.0008693698327988386,
0.0007107529672794044,
0.0006871625082567334,
0.0006908472278155386,
0.0006459406577050686,
0.000567242968827486,
0.0007116554770618677,
0.0006351195042952895,
0.0007016035378910601,
0.0006702345563098788,
0.0007404247880913317,
0.0006786074372939765,
0.0006578320171684027,
0.0006316331564448774,
0.000671786314342171,
0.001354660140350461,
0.0008062142296694219,
0.0007411808473989367,
0.0006644190871156752,
0.0006163122016005218,
0.0006246506818570197,
0.0007068159757182002,
0.00150492659304291,
0.0008765878155827522,
0.0007575322524644434,
0.0005648343358188868,
0.000743204087484628,
0.12765930593013763,
0.000572014250792563,
0.0005744493682868779,
0.000619486381765455,
0.0006686392007395625,
0.0006904543261043727,
0.0013785817427560687,
0.0006008641794323921,
0.0005310529377311468,
0.0006914050900377333,
0.0013354135444387794,
0.000604893546551466,
0.000758232781663537,
0.0012314304476603866,
0.0006351688643917441,
0.0006634718738496304,
0.0006143709179013968,
0.001119143096730113,
0.148225337266922,
0.0007564786355942488,
0.0006904825568199158,
0.005077504552900791,
0.0006429079221561551,
0.0006943467888049781,
0.0005935316439718008,
0.0006923575419932604,
0.0005696960724890232,
0.0008615395054221153,
0.000748208025470376,
0.0006445530452765524,
0.0009745928691700101,
0.0007784119225107133,
0.0006507718353532255,
0.000608843460213393,
0.0007014035945758224,
0.001730379299260676,
0.0006288771983236074,
0.0013785817427560687,
0.0007741835433989763,
0.0006030693184584379,
0.0006264126859605312,
0.0008090895134955645,
0.0008552488288842142,
0.0017469157464802265,
0.0006812097271904349,
0.0007766921771690249,
0.0007445665542036295,
0.003949148580431938,
0.0006278459914028645,
0.0006272618775255978,
0.0006716198404319584,
0.0007175577338784933,
0.000684041588101536,
0.0006788522587157786,
0.0005954356747679412,
0.0007113201427273452,
0.0006587281823158264,
0.0005922954878769815,
0.0006253794999793172,
0.0006243872921913862,
0.0008175241528078914,
0.0006746799917891622,
0.0005649236845783889,
0.0008204111945815384,
0.0007554272306151688,
0.0012222665827721357,
0.0006411581416614354,
0.0006234943866729736,
0.0005317417671903968,
0.0007335071568377316,
0.0006589385448023677,
0.0011487751035019755,
0.0008433145703747869,
0.0007740292930975556,
0.000721542164683342,
0.0007729992503300309,
0.000810780911706388,
0.0007612597546540201,
0.0008553274674341083,
0.0008579431450925767,
0.0006865776376798749,
0.0006772787892259657,
0.0007895224844105542,
0.0007573654875159264,
0.0007551076705567539,
0.0006659348728135228,
0.0007507713162340224,
0.0006731895846314728,
0.0010273781372234225,
0.0006073921686038375,
0.000652652932330966,
0.0005768992705270648,
0.0006302855326794088,
0.000609086942858994,
0.0007908348925411701,
0.0006973868003115058,
0.0025783670134842396,
0.001995444530621171
] | 0.002077 | 244 |
[
"see deal Halo: The Master Chief Collection - Xbox One $29.99 on Gamestop\n\nThe National Entertainment Collectibles Association has confirmed its Master Chief\n\nFirst teased last June , the Halo-inspired headgear is completely street-legal and approved by the US Department of Transportation, with front air intakes to prevent fogging and rear vents to keep your head cool. ",
"There's also a reflective shield with UV protection and removable top and cheek pads.",
"Though the below images still aren't quite final, it's definitely come on a long way since we last saw it.",
"Back in November 2013, NECA announced a partnership with Halo developer 343 Industries to produce Halo-themed, action figures, mini figures, DOT-approved motorcycle helmets, prop replicas, board games, and HeroClix.",
"Now if only someone would get to work on a Ghost prototype...\n\nLuke Karmali is IGN's UK News Editor. ",
"You too can revel in mediocrity by following him on Twitter"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0009084420744329691,
0.0006230298313312232,
0.0005502572748810053,
0.0006625262321904302,
0.0006491244421340525,
0.07594332844018936
] | 0.013223 | 6 |
[
"The invention relates to a method for the preparation of samples for an analyzer and to a sample preparation station therefor.",
"\nFor the adsorption and/or sorption of analytes, it is known to use cartridges with packings located therein, through which respective sample material is induced to flow, in order to analyze the analytes qualitatively and/or quantitatively later by means of a respective analyzer, for example by means of a liquid or gas chromatograph. ",
"However, this requires complicated manual handling.",
"\nDE 102 19 790 C1 discloses a handling device for samples for an analyzer, the handling device comprising a gripper which is movable along three axes perpendicular to one another and by means of which different samplers, such as, for example, different syringes and also sample tubes equipped with transporting heads, can be handled."
] |
{
"pile_set_name": "USPTO Backgrounds"
}
|
[
0.0005401019006967545,
0.0008114165393635631,
0.0006163259386084974,
0.0005698660970665514
] | 0.000634 | 4 |
[
"Q:\n\nRichTextBox - How highlight end of line?",
"\n\nIf the searched word is at the beginning or end of the line of, I want to color it. ",
"If it's in the middle of the line not colorful. ",
"I tried many thing but it's not working right. ",
"\nSeems like beginning of the line is working. ",
"But end of the first line only can color. ",
"I want to color for all lines end. ",
"I think i need index of each line's beggining and loop but i can't do it.",
"\n\nHow can i fix it?",
"\n private void button1_Click(object sender, EventArgs e)\n {\n int wordLength = textBox1.Text.",
"Length;\n string word = textBox1.Text; \n for (int i = 0; i < richTextBox1.Lines.",
"Count(); i++)\n { \n int startIndex = richTextBox1.GetFirstCharIndexFromLine(i);\n richTextBox1.Find(word, startIndex, startIndex+wordLength, RichTextBoxFinds.",
"None);\n richTextBox1.SelectionColor = Color.",
"Red;\n richTextBox1.SelectionBackColor = Color.",
"Yellow;\n\n int newLineIndex = richTextBox1.Lines[i].Length;\n richTextBox1.Find(textBox1.Text, (newLineIndex - wordLength), newLineIndex, RichTextBoxFinds.",
"None);\n richTextBox1.SelectionColor = Color.",
"Red;\n richTextBox1.SelectionBackColor = Color.",
"Yellow;\n } \n\nA:\n\nI suggest to change your code a little bit. ",
"You'll notice why when the RichTextBox text length grows.",
"\nAsking for the Lines[] content is not exactly a good thing, much worse in a loop, when you access this Property probably many of times.",
"\nYou can see in the .Net Source Code what happens (each time - the Lines Property values are not cached and cannot be). ",
" \nGetLineFromCharIndex() and GetFirstCharIndexFromLine() use instead SendMessage to send the EM_LINEFROMCHAR and EM_LINEINDEX messages to the Edit control - which uses cached values - and are pretty fast. ",
" \n\nUse Regex.",
"Matches() to collect the indexes of the matched word(s) (you can use more than one word, separated by a pipe: \"|\", but here we handle just one word. ",
"When matching more than one word, use a List<Match> and the Match.",
"Length instead of searchWord.",
"Length) and extract just the Index position of each match. ",
" \nThen, loop the indexes and check whether the current index position meets the criteria. ",
" \nThe current line end is found with IndexOf(\"\\n\", [StartPosition]), using the first line index (which is also used for the selection) as the starting position. ",
" \n\nThe RichTextBox Control uses only \\n as line separator, so we don't need to worry about \\r. ",
"\nstring searchWord = \"John\";\nvar txt = richTextBox1.Text;\nint textLenght = txt.",
"Length;\n\n// the indexes list can be created with the alternative method (using IndexOf() in a loop) \nvar indexes = Regex.",
"Matches(txt, searchWord, RegexOptions.",
"Multiline)\n .OfType<Match>()\n .Select(m => m.Index).ToList();\n\nforeach (int index in indexes) {\n int currentLine = richTextBox1.GetLineFromCharIndex(index);\n int lineFirstIndex = richTextBox1.GetFirstCharIndexFromLine(currentLine);\n int lineLastIndex = txt.",
"IndexOf(\"\\n\", lineFirstIndex);\n\n if (index == lineFirstIndex ||\n index == lineLastIndex - searchWord.",
"Length ||\n index == textLenght - searchWord.",
"Length) {\n richTextBox1.Select(index, searchWord.",
"Length);\n richTextBox1.SelectionColor = Color.",
"Red;\n }\n}\n\nEdit: Since Regex.",
"Matches is not allowed, you can use IndexOf() in a loop: \nvar indexes = new List<int>();\nint wordPosition = -1;\ndo {\n if ((wordPosition = txt.",
"IndexOf(searchWord, wordPosition + 1)) >= 0) {\n indexes.",
"Add(wordPosition);\n }\n} while (wordPosition >= 0);\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0007089595310389996,
0.0005950567428953946,
0.0007075502653606236,
0.0006500011077150702,
0.0006620418280363083,
0.0007741952431388199,
0.0008414307958446443,
0.005795763339847326,
0.0008023882983252406,
0.001164837391115725,
0.000805408344604075,
0.001585364225320518,
0.0006352345226332545,
0.0006547680241055787,
0.0007946884143166244,
0.0006352345226332545,
0.0006547680241055787,
0.00109577807597816,
0.0005986117757856846,
0.0006376118981279433,
0.0005891636246815324,
0.001408871146850288,
0.0014247802319005132,
0.0006564923096448183,
0.0007345907506532967,
0.0006621226202696562,
0.0005968499463051558,
0.0007373979897238314,
0.0006264481926336884,
0.0008085338049568236,
0.0007232376956380904,
0.0007073716260492802,
0.0006566452793776989,
0.0011008232831954956,
0.0009237339836545289,
0.0006730676395818591,
0.0006796031957492232,
0.0006090460228733718,
0.0011069346219301224,
0.0008544400334358215,
0.0007829962414689362,
0.0007881851634010673
] | 0.00092 | 42 |
[
"BJP parliamentarian Tejasvi Surya asked the centre to implement NRC in Karnataka\n\nHighlights Jay Panda praised Tejasvi Surya for seeking a citizens' list in Karnataka\n\nSaid he was an \"impressive young man making waves in the Parliament\"\n\nCentre updating citizens' list in Assam to account for illegal migration\n\nA tweet by BJP spokesperson Baijayant Jay Panda praising his younger colleague from Karnataka, Tejasvi Surya, for seeking a citizens' list similar to the one being prepared in BJP-ruled Assam, received a glowing acknowledgement from the 28-year-old leader from Bengaluru South.",
"\n\nThe BJP's youngest parliamentarian, Tejasvi Surya, had on Wednesday asked the centre to run the National Register of Citizens (NRC) exercise in Karnataka, where he said illegal immigrants posed a threat to the state. \"",
"A terror module that operates from Bangladesh was busted in Bengaluru. ",
"I call upon the centre to extend NRC to Karnataka and Bengaluru to weed out Bangladeshis who have come here illegally,\" said Tejasvi Surya in the Lok Sabha.",
"\n\nThat comment was praised by Jay Panda, who parted ways with Odisha Chief Minister Naveen Patnaik's BJD in May last year.",
"\n\n\"This impressive yng man is making the right sort of waves in Parliament. ",
"I believe NRC is needed for Odisha as well. ",
"It has seen a huge influx of illegal immigrants, esp in the coastal districts. ",
"In my time in Parlmt i had sought (& got) coast guard coverage, but more needed now,\" Jay Panda tweeted, along with a new clip where the Tejasvi Surya is seen speaking on the citizens' list.",
"\n\nTejasvi Surya replied: \"Sir, it means a lot that you put out this tweet. ",
"Have been ardent follower of your parliamentary work from many years now. ",
"After Sardar Patel, India is now having great Home Minister in Sri Amit Shah Ji. ",
"I am sure he will do everything to protect our country's sovereign interests.\"",
"\n\nSir, it means a lot that you put out this tweet. ",
"Have been ardent follower of your parliamentary work from many years now\n\n\n\nAfter Sardar Patel, India is now having great Home Minister in Sri @AmitShah Ji. ",
"I am sure he will do everything to protect our country's sovereign interests https://t.co/ww8ohwoWoP — Tejasvi Surya (@Tejasvi_Surya) July 11, 2019\n\nThe Assam citizens' list is being updated for the first time since 1951 to account for illegal migration into Assam from neighbouring Bangladesh. ",
"The excluded people will have the chance to file their claims at the designated NRC help centres.",
"\n\nThe centre had extended the deadline to complete the ongoing exercise in Assam by one more month to July 30. ",
"The process had been extended in December last year by six months to June 30.",
"\n\nThe Assam citizens' list is being updated for the first time since 1951 to account for illegal migration into Assam from neighbouring Bangladesh\n\nOver 40 lakh people were not named in the draft citizens' list published on July 30 last year, creating a huge controversy. ",
"Lakhs of them have applied for re-verification. ",
"The draft list included the names of 2.9 crore people out of the total 3.29 crore applications.",
"\n\nMohammad Sanaulla, a retired Indian Army soldier, was declared an illegal immigrant by a tribunal and sent to a detention centre in Assam last month, before he was given bail by the Gauhati High Court.",
"\n\nIn another case of mistaken identity, which the Assam Police accepted, 59-year-old Madhubala Mondal was released last month after being held in detention for three years ago. ",
"In 2016, the Assam Police branded her a \"foreigner\" and arrested her; they were really looking for Madhumala Das, who lived in the same village but died at least 20 years ago."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0005842719692736864,
0.0007563924882560968,
0.000836057704873383,
0.007315949536859989,
0.0005402592360042036,
0.0006590968696400523,
0.0005267069791443646,
0.000869729439727962,
0.000575816782657057,
0.0006669832509942353,
0.000660330115351826,
0.0006011012592352927,
0.00069073197664693,
0.0012503701727837324,
0.0006383978761732578,
0.0007401277543976903,
0.0005399616784416139,
0.000536198727786541,
0.0005557328113354743,
0.0006124784122221172,
0.0006454453687183559,
0.000584461900871247,
0.0013004197971895337,
0.0008545535383746028,
0.0011156352702528238
] | 0.000986 | 25 |
[
"La parité précaire du dollar canadien vis-à-vis de la devise américaine est seulement l'un des problèmes au retour d'une équipe de baseball professionnel à Montréal.",
"\n\nL'interprétation faite par certains médias du rapport de la firme EY sur la viabilité d'un éventuel retour des Expos a de quoi frustrer un lecteur averti. ",
"Dans ce type d'analyse prospective, on veut satisfaire les attentes de relations publiques du client. ",
"On se rappellera un certain rapport de cabinet externe sur la rentabilité de l'Îlot Voyageur de l'UQAM...\n\nLa structure proposée dans le rapport est hybride. ",
"Règle générale, le secteur privé devient l'unique propriétaire de l'équipe professionnelle et les autorités (l'État ou la Ville) deviennent propriétaire à 100% du stade. ",
"Peu importe comment est présenté le financement du stade, l'équipe est l'actif ayant de la valeur, le stade représente le principal risque d'affaires. ",
"En somme, on nationalise les coûts et les risques d'affaires et l'on transfère au secteur privé les profits et la valeur de revente éventuelle de l'équipe.",
"\n\nLe public se met en situation de dépendance. ",
"Au terme d'un contrat initial, quelle position de négociation une autorité aura-t-elle lorsque l'unique locataire potentiel de l'infrastructure sera une équipe de baseball?",
"\n\nUne autre constatation a trait à la valeur du dollar. ",
"EY a choisi une valeur «pessimiste» de 0,90$US pour chaque dollar canadien alors que, dans le passé, des taux de moins de 0,70$US ont déjà été observés. ",
"Selon un sondage effectué auprès de la population par la firme Léger Marketing, on croit vendre en moyenne 28 080 billets par match. ",
"Cela représente un taux d'occupation jovialiste de 78%. ",
"Rappelons-nous que, contrairement au marché américain, le baseball n'est pas notre sport national.",
"\n\nDe plus, l'étude omet certains investissements en infrastructures et autres coûts connexes que le public devra assumer. ",
"Selon une étude de Judith Grant Long de Rutgers University, publiée dans le Journal of Sports Economics, les subventions réelles de l'État sont sous-évaluées en moyenne de 53 millions pour les projets de stades de la MLB.",
"\n\nPuis, on arrive avec la comparaison entre l'agglomération urbaine de Montréal et celle de Minneapolis-Saint Paul. ",
"On mentionne que cette région américaine, de taille comparable à celle de la métropole québécoise, accueille elle aussi d'autres équipes professionnelles. ",
"Par contre, à Minneapolis, le baseball n'entre pas autant en concurrence avec les autres sports professionnels. ",
"Au Minnesota, la NFL, la NBA et la LNH font relâche pendant l'été, laissant ainsi toute la place aux Twins.",
"\n\nÀ Montréal, les Alouettes (LCF) et l'Impact (MLS) concurrencent la plage horaire des matchs de baseball. ",
"L'arrivée d'une équipe dans un stade de 36 000 places risquerait de cannibaliser nos autres sports professionnels et les activités culturelles faisant notre force.",
"\n\nQuant aux retombées économiques, on semble oublier la notion de coût de renonciation. ",
"En somme, lorsqu'on analyse un projet d'investissement, on doit évaluer ce qu'on aurait pu faire avec ladite subvention de plusieurs centaines de millions (estimation de 335 millions). ",
"Est-ce que le rendement obtenu est maximisé?",
"\n\nFinalement, certains revenus pour «rentabiliser» la subvention auraient été générés, que les Expos reviennent ou non. ",
"Par exemple, la famille décidant d'assister à un match de baseball se divertit. ",
"Si elle ne va pas au baseball, elle se divertira ailleurs avec le même budget.",
"\n\nLe modèle de croissance des sports professionnels est maintenant basé sur le siphonnage de fonds publics. ",
"Peut-être que ce rapport a subjugué des analystes et des commentateurs sportifs, mais, désolé, un Québécois financièrement compétent ne devrait pas boire de ce Kool-Aid."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0010956153273582458,
0.0016447908710688353,
0.0009989524260163307,
0.0017199043650180101,
0.0022811617236584425,
0.002113446593284607,
0.0014614876126870513,
0.0007625819416716695,
0.0018686943221837282,
0.0008982713334262371,
0.022271858528256416,
0.001715916208922863,
0.001146363210864365,
0.001746466034092009,
0.0022326824255287647,
0.0008149306522682309,
0.0008360325009562075,
0.0007422302151098847,
0.0008057752856984735,
0.001054927590303123,
0.0006354125216603279,
0.0024444935843348503,
0.0011788246920332313,
0.00116700807120651,
0.003289963584393263,
0.0012567705707624555,
0.002340504201129079,
0.0036927899345755577,
0.0008660919265821576,
0.0062642632983624935
] | 0.002378 | 30 |
[
"- Select the smallest size available and in the \"special instructions\" let us know the size need. ",
"We'll take care of it at no charge.",
"\n- If you'd like the bracelet larger there may be additional cost and we will contact you before producing.",
"\n\n*Each bracelet chain comes with a lobster claw clasp.",
"\n*This Bracelet is Unisex and is made for a man or a woman.",
"\n*Bracelet has an id plate which is approximately 1 3/4 Inches Wide x 1/3\nInches Tall.",
"\n* This is made of Solid Sterling Silver.",
"\n* 7 Inches is standard size for a Woman\n* 8 Inches is standard size for a Man\n* If you need a custom size, let us know in the \"special instructions\" box upon checkout."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005720793851651251,
0.000748030433896929,
0.0005709169781766832,
0.0006233931053429842,
0.0030808085575699806,
0.0007737631094641984,
0.0006395396776497364,
0.0006980890175327659
] | 0.000963 | 8 |
[
"[Analysis of biologic changes in PSA blood concentration and free PSA percentage in patients with normal rectal digital examination].",
"\nTo study intra-individual variations in serum PSA and percent free PSA in patients with normal digital rectal examination. ",
"Analysis of changes in serum PSA levels and percent free PSA in two blood measurements conducted in 107 non-consecutive patients prior to prostate biopsy, over a period of time ranging from 23 to 60 days. ",
"Both total and free PSA were measured with two dual monoclonal antibody assays, Tandem-E and Tandem-R, Hybritech. ",
"Diagnosis was benign hyperplasia in 63 patients and cancer in 44. ",
"PSA variations ranged between -6.8 and +3.2 ng/ml in BPH patients, and between -2.8 and +9.0 when cancer was detected. ",
"The median coefficient of variation was 15.4 and 15.7, respectively. ",
"Variations in percent free PSA ranged between -30.7 and +40.9 in the BPH group and between -17.9 and +15.8 in the cancer group. ",
"The median coefficient of variation was 32.2 and 32.3%, respectively. ",
"Should prostate biopsy had been indicated when percent free PSA was equal to or lower than 25 in the 4 to 10 ng/ml PSA range, 15% patients would have exhibited discrepancies. ",
"Sensitivity would have ranged between 100 and 94.4%, with a reduction rate in negative biopsies between 16.6 and 19.4%. ",
"Intra-individual variations in serum PSA levels and percent free PSA may condition the decision of whether to perform a prostate biopsy."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.0006675800541415811,
0.0008223134209401906,
0.0006314474157989025,
0.0005959859117865562,
0.0008594712126068771,
0.0007432433776557446,
0.0006066781934350729,
0.0008034574566408992,
0.0006210452993400395,
0.00113282585516572,
0.0005702311755158007,
0.0011734532890841365
] | 0.000769 | 12 |
[
"Q:\n\napache not serving static content correctly\n\nI have been working on my own mvc framework to further my web app learning, but am having trouble serving static resources. ",
"I am trying to have a single entry point into the application, aka a front controller, so in my project / I have an .htaccess file that redirects all requests to the app/ folder where another .htaccess passes the request uri to index.php (in app/) who delegates the request to the appropriate controllers.",
"\nHowever, when I try to serve up static content, such as javascripts or cascading style sheets, I still get redirected through app/index.php. ",
"I am also getting \"favicon.ico does not exist in /var/www\" errors in /var/log/apache2/errors.log (maybe because of symlink to ~/www?). ",
"I do not expect to because of the following .htaccess file in the root directory of my project root:\n<IfModule mod_rewrite.c>\n Options -Indexes +FollowSymLinks\n RewriteEngine On\n\n RewriteBase /\n\n # ----------------------------------------------------------------------\n # Suppress the \"www.\" ",
"at the beginning of URLs\n # ----------------------------------------------------------------------\n # The same content should never be available under two different URLs - especially not with and\n # without \"www.\" ",
"at the beginning, since this can cause SEO problems (duplicate content).",
"\n # That's why you should choose one of the alternatives and redirect the other one.",
"\n RewriteCond %{HTTPS} !",
"=on\n RewriteCond %{HTTP_HOST} ^www\\.(.+)$ [NC]\n RewriteRule ^ http://%1%{REQUEST_URI} [R=301,L]\n\n #----------------------------------------------------------------------\n # Route static resources to respective files\n #----------------------------------------------------------------------\n RewriteCond %{REQUEST_FILENAME} !",
"-f\n RewriteCond public/$0 -f\n RewriteRule ^.+\\.(jpg|gif|png|ico|css|js)$ /public/$0 [L]\n\n #----------------------------------------------------------------------\n # Redirect all other requests to the app folder\n #----------------------------------------------------------------------\n RewriteRule ^$ app/ [L]\n RewriteRule (.*) ",
" app/$1 [L]\n</IfModule>\n\nand here is the .htaccess in my app/ folder:\n<IfModule mod_rewrite.c>\n RewriteEngine On\n\n # ensure request is not path to filename or directory\n RewriteCond %{REQUEST_FILENAME} !",
"-f\n RewriteCond %{REQUEST_FILENAME} !",
"-d\n\n # redirect all requests to index.php?url=PATHNAME\n RewriteRule ^(.*)$ index.php?url=$1 [QSA,L]\n</IfModule>\n\nWhy can't I serve static content correctly? ",
"This would make sense to me if I wasn't trying to sent all static requests to public/, which is where my css, jpg, png, js, etc files reside. ",
"But I have a RewriteCond rule in there to send the requests for such files to the public dir... Confusing?",
"\n\nA:\n\nAssuming, from what I understood, that your project structure is the following: \n\n/\n/.htaccess\n/app/.htaccess\n/app/index.php\n/public/static.js (for example)\n\nHere is what I come up with, hoping it'll solve your problem:\nthe .htaccess in the root folder:\n<IfModule mod_rewrite.c>\n Options -Indexes +FollowSymLinks\n RewriteEngine On\n\n RewriteBase /\n\n RewriteCond %{HTTPS} !",
"=on\n RewriteCond %{HTTP_HOST} ^www\\.(.+)$ [NC]\n RewriteRule ^ http://%1%{REQUEST_URI} [R=301,L]\n\n RewriteRule ^public/.+\\.(jpg|gif|png|ico|css|js)$ - [L]\n RewriteRule ^(.*)$ app/$1 [L]\n</IfModule>\n\nAnd the .htaccess in the app folder is unchanged.",
"\nEvery request starting with public and being a file with the listed extensions won't be redirected which is done with the dash character.",
"\nThe last rule allows to redirect a request to the app/index.php file.",
"\nI think the resulting behaviour is the expected one:\n\nstatic files in the public directory are not redirected,\nfiles with another extension in the public directory will be\nredirected to app/index.php (maybe for some error treatment),\nrequests not starting with public will be redirected to\napp/index.php.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0006220567738637328,
0.0006105178617872298,
0.0005688751698471606,
0.0007181033142842352,
0.0061878301203250885,
0.0009252256713807583,
0.0005887305596843362,
0.0006816737586632371,
0.0023100629914551973,
0.0013798375148326159,
0.0010185121791437268,
0.010840734466910362,
0.0013274988159537315,
0.0007844808860681951,
0.0006016675615683198,
0.0007588681764900684,
0.001000165124423802,
0.001115031773224473,
0.0006453320966102183,
0.0006059319130145013,
0.0006200230563990772,
0.001995444530621171
] | 0.001632 | 22 |
[
"Tuesday, March 14, 2017\n\nSaying things that now no longer make sense\n\nIn my podcast this week (which you need to hear and subscribe to already) I inadvertently mentioned turning off a “tape recorder.” ",
"A few of you good-naturedly razzed me for being so “last century.” ",
"The truth is I record the podcast digitally but the term “tape” recorder is ingrained in my brain. ",
"And in describing TV shows I recorded on my DVR I will still sometimes say I “taped” them.",
"\n\nSo it got me thinking about words and expressions we use in everyday speech that have since outlived their meaning but we still use anyway. ",
"Here are a few examples.",
"\n\n“The tube” – a popular synonym for a television. ",
"Once upon a time there were tubes in a TV set. ",
"No longer. ",
"I guess you could call it “the chip” but I don’t see that catching on.",
"\n\nPeople order additional phone “lines”. ",
"In this cellphone world there are no “lines” -- everything is wireless.",
"\n\n“Don’t touch that dial”. ",
"You’ll hear announcers still say that. ",
"At one time you did have a big dial on your radio or TV, which you twisted to change stations. ",
"When was the last time you saw one of those that wasn’t in the Smithsonian right next to Abe Lincoln’s log cabin?",
"\n\nAnd for that matter, no one “dials” a phone anymore. ",
"We’ve been pushing buttons for forty years. ",
"And we no longer “hang up on people” although we still say we do.",
"\n\nPeople still say “roll up your window” in a car even though crank handles are now relics.",
"\n\nGood photo opportunities are still referred to as “Kodak Moments”. ",
"Kodak made film for a thousand years. ",
"Today we have “Digital Nanoseconds”.",
"\n\nWe used to correspond with certain friends in distant locales by getting out the old Bic and writing letters. ",
"Today we email, text, or IM but still refer to them as “Pen Pals”.",
"\n\nRecording artists are still coming out with new “records”. ",
"That’s what they were in the old days – vinyl platters. ",
"You could even argue that CD’s are just an updated technological version. ",
"But now music is released on line (again, is there really a “line”?).",
"\n\nAnd folks use the expression \"But on the flip side,\" which refers to when vinyl records had two sides. ",
"45 rpm's had a song on each side. ",
"There was usually the hit and if you \"flipped\" the record over, a second song.",
"\n\nI hear TV weathermen (actually – hot babes) say “tomorrow will be a carbon copy of today.” ",
"When was the last time you used carbon paper to make a copy? ",
"How many of you have even heard of carbon paper?",
"\n\nMany years ago scripts were duplicated by a mimeograph machine. ",
"When a writing staff prepared a production draft of a script to be distributed to the actors, network, crew, etc. ",
"they would say, “time to put the script into mimeo.” ",
"That expression remained long after mimeograph machines were recycled into soda cans.",
"\n\nSo what are other examples? ",
"It’s kind of interesting isn’t it, to stop and think once in a while about just what the hell we’re saying?",
"\n\n67 comments\n:\n\nThe first expression that came to mind was 'drop a dime'as a way to describe when someone decides to tell the police the name of somebody they are looking for. ",
"When was the last time you saw a movie where a character searched for a pay phone?",
"\n\nStar Trek fans can attest to this. ",
"In some episodes of the series such as The Next Generation and Deep Space Nine they're still saying \"paperwork\" as in \"I'm just finishing up some paperwork.\" ",
"Surely they're not still producing and writing on paper in the 24th century, right? ",
"We all know they're tapping on their PADD devices or on computer screens, but they still refer to it as paperwork sometimes.",
"\n\nStar Trek fans can attest to this. ",
"In some of the episodes of The Next Generation and Deep Space Nine, they still say the word \"paperwork\" as in \"I'm just finishing up some paperwork.\" ",
"I guess they still have trees in the 24th century! ",
"Obviously they're not filling out paper forms or filing paper reports, but the term is still in use (at least in our fictional future).",
"\n\nWe still use carbon paper drafting orders in the Daley Center -- the Cook County Courthouse with the Picasso out front. ",
"Granted, it's really old carbon paper, usually, but with just enough ink remaining to tease you into believing it might make a legible copy.",
"\n\nHold a sheet up to the light and you may see Abe Lincoln's handwriting.",
"\n\nNow and again, someone brings nice, new carbon paper to court. ",
"The rest of us hate these showoffs. ",
"Unless they share with us.",
"\n\nOccasionally a courtroom will get a fresh supply -- but, sadly, it doesn't last. ",
"Word spreads among the attorneys and sheets are borrowed from that courtroom for a room down the hall. ",
"The sheets never come back. ",
"The courtroom deputies may try and stop smuggling, but so far they have refrained from using deadly force.",
"\n\nWhen I was but a child, I began reading television columnists in newspapers.",
"To a man (archaic usage; many were female), they all considered the new medium to be beneath them, and they took pride in how little they knew about the technical side of it all.",
"This persists to the present day.",
"Back then, all the \"critics\" used the words film and tape interchangeably.",
"Even today, many \"TV columnists\" use both of these words, which in our digital age are basically obsolete.",
"I've long believed that most news organizations give the media beat to the last guy in the newsroom who yells \"Not it!\"",
"\n\nFrom High School, I well remember the ditto machine (or to give it its real name, the hectograph).This was the mimeograph's \"red-headed stepchild\", famed for the blurry blue letters that we were supposed to try to read while doing tests.",
"Also for the pungent aroma of hectograph fluid, one of the earliest examples of a \"contact high\" that teens of my era experienced, if they were doing office duty and had to help print up exams.",
"The blessed Xerox came into use not a moment too soon.",
"\n\nSome other time, maybe we can get into how you can tell somebody's age by the money amounts he attaches to goods and services (\"Dime for a cup of coffee, mister?\").",
"\n\n- \"Dial it back\" still means turn down the volume, even though we don't have dials on loudspeakers any more.",
"\n\n- In Britain, as late as the 1980s \"put the fire on\" referred to turning on a gas heater (which might be situated in a fireplace formerly used to burn coal), even though it wasn't an actual fire. (",
"Of course, in Britain \"tube\" has never meant TV, but the London Underground, which Americans would call a \"subway\", which British people use to mean underground passages for pedestrians.)",
"\n\nOn a different note,\n\n\"Nuke it\" for microwaving something, despite the fact that microwave ovens are not nuclear-powered.",
"\n\nUnless you're watching Drew Carey present a special about water parks and jungle gyms across the country, you're not actually watching \"slides\". ",
"You can still buy slide film (aka \"reversal film\") but I can't remember the last time I saw a slide projector.",
"\n\nUsually when this sort of topic comes up, one of the first such words mentioned is \"clicker\" as in \"You know why we call them clickers? ",
"They used to make a click sound!\" ",
"But I don't know that anybody actually calls them clickers anymore.",
"\n\nI haven't mentioned what a \"clicker\" is yet so that if someone has no idea what one is, well, they will be puzzled and I will have made my point that nobody calls them that anymore.",
"\n\nBut just for the sake of people who don't know: A \"clicker\" is what some people used to call the remote control for the TV.",
"\n\nI have a 2008 Chevy pickup that has crank up windows and doesn't have keyless entry.",
"\n\nReproduction methods before Xerox or desktop printers were hectograph, spirit duplicator (AKA ditto), or mimeograph. ",
"Rex Rotary was a big maker of mimeo machines (IIRC, may be dittos), as was Gestetner. ",
"I used to publish a fanzine on my mimeo every month when I was a comics fanboy. ",
"I loved the smell of ink and the feel of Fibertone paper.",
"\n\nThe word \"FILE\" is used all the time in computerspeak and digital items incorporated because of paperwork\n\naccording the Merriam Webster \"FILE\" means \"a device (as a folder, case, or cabinet) by means of which papers are kept in order\" and \"a collection of papers or publications usually arranged or classified\"\n\nThen there are FOLDERS, SLIDESHOWS... all computer terms that have to do with actual physical things. ",
"The \"Enter\" key is still called the return button. ",
"But the typewriter carriage is gone.",
"\n\nWe still talk about Sunrise and Sunset (or Sundown in the old westerns) but we've known for centuries (if not for thousands of years) that it's the Earth's rotation that makes the Sun seem to move. ",
"But what are better words? ",
"Maybe Daybreak is OK but Nightfall is just as bad as Sunset. ",
"I can't imagine Tevye and Golde singing \"Light appears, Light leaves.\" ",
"Sometimes it's better to just leave the poetic words alone.",
"\n\nI cannot wait to see this. ",
"Gal Gadot is smokin hot. ",
"And the icing on the cake is that it will piss off anti-Semites that Wonder Woman is played by an Israeli Jewish babe. ",
"I just hope it's a better movie than Batman vs Superman.",
"\n\nWe still use \"telegraph\" as a verb to mean \"reveal something prematurely\" and \"crank it up\" even though hand cranking an engine died out with the Model T.\n\nOne that always fascinated me is using \"butt dial\" for accidentally calling someone by sitting on a cellphone. ",
"Not only does it use the term of an obsolete technology, but it describes an action that couldn't happen with that obsolete technology.",
"\n\nAgree with Matthew E about \"record\", which at least still refers to a recording.",
"\n\nBut \"album\" (as a set of several tunes packaged together) has been weirdly obsolete for over 60 years. ",
"Initially, it referred to an actual *book* that a series of 78s were placed in ... so an album could consist of, say, 5 or 6 Frank Sinatra records sold as a package, held in a dedicated case. ",
"Then when LP records came out in the mid-50s, they could hold as much music as an \"album\" -- so they were called albums.",
"\n\nI used to be a stickler about the difference between shows on tape and shows on film, but now everything is digital. ",
"You can give the same raw digital video a \"tape look\" or a \"film look\" just by changing a couple of equipment settings.",
"\n\nI still see a lot of TV critics -- and even some hosts -- use \"satellite\" as a catch-all for any remote link on television, but most of them are no longer done by satellite.",
"\n\nYou could even argue that the term \"live TV\" is no longer accurate. ",
"In the analog days, signals moved in their entirety at the speed of light, so the picture went from the TV station to your home instantaneously. ",
"Now, the digital signal is first compressed on the transmission end, and then decompressed at your set, and there may also be some buffering to deal with an unreliable line. ",
"This causes a delay of anywhere from a few seconds to a minute depending on what kind of system you're using, meaning that you never actually see an event on TV at the exact moment it is happening in real life anymore.",
"\n\nKen: What the Sam Hill are you doing bringing up antiquated expressions? ",
"Here’s one for you – when was the last time anyone “licked a stamp”? ",
"You peel ‘em off (if you even use the things anymore). ",
"Now doesn’t that beat all get out!",
"\n\n\"Clicker\" still lives on as the name for the thing that advances the slides when you're giving a Power Point presentation. ",
"I don't remember anyone calling the TV remote that though. ",
"Funny story, the first VCR my parents bought cost $800 and had a remote control -- that connected to it by a ten foot cable.",
"\n\nThe other day my 8 year old asked me when cell phones were invented. ",
"I mentioned that we used to have a car phone that plugged into the cigarette lighter, for emergencies. \"",
"Wait, WHAT?! ",
"Why would someone need a cigarette lighter in their car?\"",
"\n\nThe obsolete term \"car phone,\" of course, continues to exist in the name of the British company Carphone Warehouse.",
"\n\nMany people say \"Hot water heater\" - hot water doesn't need any heating.",
"\n\nI have a Chevy pickup from this millennium with crank windows and a vinyl floor. ",
"I bought it that way on purpose. ",
"I love it when I see people looking for the button. ",
"I get to say \"Grab that handle and rotate in a COUNTER CLOCKWISE\" direction to lower the window.",
"\n\nUnless heard in a period piece or re-runs of \"Real Time,\" it's likely we'll never hear the telephone time lady say, \"At the tone, the time will be...\" ever again given that Bill Maher removed it from his new main title. ",
"I was disappointed. ",
"It's familiarity was somehow comforting, and it served a purpose in the introduction. ",
"I'm sure the younger generation(s) don't have a clue about its history which is probably why it was dropped. ",
"Now it's gone. ",
"Sigh.",
"\n\nI remember a sitcom from the 80s or 90s, maybe Perfect Strangers, where leading into a commercial break one of the male leads said \"Don't touch that dial\" and the other said \"People don't have dials anymore!\", ",
"showing that dials have been moving toward obsolescence for a long time now.",
"\n\nThe most important award in the music industry is the Grammy, short for gramophone (the British term for a phonograph -- they wisely decided against calling it the Phony). ",
"How many recipients even know what that is?",
"\n\nIn 1956 my parents bought a 1955 Zenith TV with flash Matic remote control. ",
"Since we only had maybe four stations and the rest was snow and the resultant snow sound, and the remote control was light activated, it was important to close your curtains at night. ",
"When morning the TV came on, the volume turned all the way up, and it started changing channels rapidly but not rapidly enough that you missed the sound of the snow stations. ",
"After that my father disabled it. ",
"I've heard that a clicker is New England for remote control but I never heard that in my house. ",
"Probably because we never had a remote control after that first one. ",
"And the first remote control I ever had controlled my VCR which we used to change the channels on our television because my than husband and his mother had ruined the channel changing knob because they like to channel surf without a remote. ",
"When we got it set properly on one station we had to brace it up with a bunch of index cards under it, otherwise it would fall off the channel and just not come in good. ",
"So you set it to channel 3 and we used the VCR to change channels until we got a new TV\n\nOne day my mother was visiting and using the VCR remote and she asked me how to turn up the volume. ",
"It took every ounce of self-control I had to be respectful and not say, Get up, walk across the room, turn the dial.",
"\"Since the commercials were always louder then the programs they were in, we learned to just change the channel when a commercial came on.",
"\n\nSeveral months ago in an attempt to get our cable bill down, my roommate finally got a cable box and attached it to the TV in the living room. ",
"I am still box free but we don't know for how long. ",
"Our cable company was bought. ",
"Last night I was in the living room watching TV - I don't do that there - when the phone rang. ",
"It actually showed up on the television before it started ringing audibly. ",
"Anyway I thought it was pretty neat. ",
"They are going to drag me kicking and screaming into the decade before this one.;-)\n\n\"Reading the tea leaves\" ...how antiquated is that?Does ANYONE remember a time when tea wasn't in a bag?Can you read the leaves and predict the future through the bag?It's questions like these that made me a coffee drinker...\n\nAnd wile I'll accept RECORD as a collection, I also think of ALBUM that way:for music, a collection of songs for photos, a collection of picturesI use ALBUM all the time, and the format (LP, cassette, CD, MP3) is irrelevant.",
"\n\nAbout KEN LEVINE\n\nNamed one of the BEST 25 BLOGS by TIME Magazine. ",
"Ken Levine is an Emmy winning writer/director/producer/major league baseball announcer. ",
"In a career that has spanned over 30 years Ken has worked on MASH, CHEERS, FRASIER, THE SIMPSONS, WINGS, EVERYBODY LOVES RAYMOND, BECKER, DHARMA & GREG, and has co-created three series. ",
"He and his partner wrote the feature VOLUNTEERS. ",
"Ken has also been the radio/TV play-by-play voice of the Baltimore Orioles, Seattle Mariners, San Diego Padres. ",
"and Dodger Talk. ",
"He hosts the podcast HOLLYWOOD & LEVINE\n\nKen Being Social\n\nKen's Book Club\n\nA collection of long-form Levine\n\nMUST KILL TV: Ken's explosive and hilarious satire of the TV industry - now in paperback and Kindle"
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0007561287493444979,
0.026653768494725227,
0.0009442407172173262,
0.0005784053355455399,
0.000565216934774071,
0.0005983080482110381,
0.0021625286899507046,
0.000879510713275522,
0.0011803433299064636,
0.0007764161564409733,
0.00109741254709661,
0.0014463698025792837,
0.004782549571245909,
0.0012252423912286758,
0.0009096790454350412,
0.001381494919769466,
0.0015783995622768998,
0.0006416029063984752,
0.0008314334554597735,
0.009089103899896145,
0.0005918254028074443,
0.0006914812256582081,
0.0006840849528089166,
0.002958036493510008,
0.0007986443233676255,
0.0006667569396086037,
0.00403995718806982,
0.0008399427169933915,
0.0006240074289962649,
0.0006410329369828105,
0.0007254117517732084,
0.0006076321587897837,
0.0006762835546396673,
0.0008536383975297213,
0.0007577285869047046,
0.0006355006480589509,
0.0005614541587419808,
0.0006785650621168315,
0.0006558103486895561,
0.000712802167981863,
0.05920233950018883,
0.0006373916985467076,
0.0008440301171503961,
0.0006665390101261437,
0.0005349227576516569,
0.00063372275326401,
0.000658233358990401,
0.0006665390101261437,
0.0005619801813736558,
0.0006381359416991472,
0.0006292291218414903,
0.0005847365828230977,
0.0006154281436465681,
0.0008192428504116833,
0.0005806856206618249,
0.2667357921600342,
0.0007439963519573212,
0.000655479496344924,
0.000578348059207201,
0.012235856615006924,
0.0007835265714675188,
0.0007911541615612805,
0.000808810000307858,
0.0006568931858055294,
0.0006162269855849445,
0.0006961142062209547,
0.000770504237152636,
0.000791325350292027,
0.0007922064978629351,
0.0008569108322262764,
0.0006359420367516577,
0.0011885421117767692,
0.0006957437726669014,
0.0005989205092191696,
0.013782026246190071,
0.0006246276898309588,
0.0006540277972817421,
0.0008587230695411563,
0.0010122880339622498,
0.0021059236023575068,
0.0007816401775926352,
0.0008492330671288073,
0.000721024873200804,
0.0007386460201814771,
0.0007425732910633087,
0.0006780385738238692,
0.000660301186144352,
0.0006226639379747212,
0.0007686034659855068,
0.0007175488863140345,
0.000579273677431047,
0.00072540866676718,
0.0008602782618254423,
0.0009014063398353755,
0.000593845674302429,
0.0007036699098534882,
0.7360388040542603,
0.8878560066223145,
0.0006438237032853067,
0.0007861508638598025,
0.0008066676673479378,
0.0005565796163864434,
0.0006823077565059066,
0.0006610879208892584,
0.0006142731290310621,
0.0011445307172834873,
0.0006334214704111218,
0.0005914777284488082,
0.000766231503803283,
0.0005978081026114523,
0.0006585275987163186,
0.0006927915383130312,
0.0007292999653145671,
0.0409923791885376,
0.02824293076992035,
0.18730516731739044,
0.0008092772914096713,
0.0006728983717039227,
0.0006425664178095758,
0.00245025590993464,
0.0006245500408113003,
0.0022566025145351887,
0.002163789700716734,
0.0006646268884651363,
0.0006656959885731339,
0.0007424413342960179,
0.0006348819588311017,
0.0005906820297241211,
0.0008541261777281761,
0.0007198224775493145,
0.0006080594030208886,
0.0005801066290587187,
0.0006919646984897554,
0.0010260697454214096,
0.000985980499535799,
0.001037446316331625,
0.0006806292803958058,
0.0006369022885337472,
0.0006876319530420005,
0.000738579488825053,
0.000998346833512187,
0.000878913386259228,
0.004068790934979916,
0.0007020790944807231,
0.0006780392141081393,
0.0039694407023489475,
0.0007059368654154241,
0.0011428436264395714,
0.005987988319247961,
0.0005603218451142311,
0.0006818569381721318,
0.0006309162708930671,
0.0005963245639577508,
0.001037301612086594,
0.0008097103564068675,
0.0006035758997313678,
0.04325808584690094,
0.0006120603065937757,
0.0007445023511536419,
0.0007201472762972116,
0.0005638797883875668,
0.0006734680500812829,
0.0011031575268134475,
0.002415850991383195
] | 0.014972 | 164 |
[
"Q:\n\nScala Converting Each Array Element to String and Splitting\n\nI have an array loaded in, and been playing around in the REPL but can't seem to get this to work. ",
"\nMy array looks like this:\nrecord_id|string|FALSE|1|\noffer_id|decimal|FALSE|1|1,1\ndecision_id|decimal|FALSE|1|1,1\noffer_type_cd|integer|FALSE|1|1,1\npromo_id|decimal|FALSE|1|1,1\npymt_method_type_cd|decimal|FALSE|1|1,1\ncs_result_id|decimal|FALSE|1|1,1\ncs_result_usage_type_cd|decimal|FALSE|1|1,1\nrate_index_type_cd|decimal|FALSE|1|1,1\nsub_product_id|decimal|FALSE|1|1,1\ncampaign_id|decimal|FALSE|1|1,1\n\nWhen I run my command:\nfor(i <- 0 until schema.length){ \n val convert = schema(i).toString; \n convert.split('|').drop(2); \n println(convert);\n}\n\nIt won't drop anything. ",
"It also is not splitting it on the | \n\nA:\n\nStrings are immutable, and so split and drop don't mutate the string - they return a new one.",
"\nYou need to capture the result in a new val\nval split = convert.split('|').drop(2); \nprintln(split.mkString(\" \"));\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.000609664770308882,
0.0013014704454690218,
0.0010883389040827751,
0.0009579083998687565
] | 0.000989 | 4 |
[
"Lame Duck Terrorism\n\nJuly 30, 2012\n\nYou think all this caterwauling about the deficit is just a bunch of useless jibber-jabber that will never go anywhere? ",
"Well, we have millionaire Bill Keller basically telling non-millionaire baby boomers to cut their own throats and then “save” the next generation by cutting theirs. ",
"For the good of the country, dontcha know.",
"\n\nIn this report, we argue that the only way for Democrats to save progressive priorities like NASA, highway funding, and clean energy research is to reform entitlements. ",
"The lame duck offers Congress a “Now or Never” chance to set the terms of a budget deal that saves money on entitlements, raises revenue, and protects investments. ",
"And the heart of the Democratic brand is depending on it.",
"\n\nI agree that we need to destroy the village in order to save it, but I’m not talking about the same village.",
"\n\nThe entire political establishment is aligning to get this momentous change done at the moment of least accountability. ",
"And they will say anything to get it done, no matter how dishonest. ",
"This is not a choice between highways and clean energy and Social Security. ",
"The government can borrow at near zero interest rates to fund those kinds of investments. ",
"Social Security can pay out 100% of promised benefits for the next 20 years and if they want to extend that, they can raise the cap so that these millionaires who are so anxious for all of us to “sacrifice” can put some more money in that kitty.",
"\n\nThird Way is a terrible organization in so many ways. ",
"But this may be the most dishonest thing they’ve ever done. ",
"The idea of pitting future “investments” against future security for the American people is as low as it gets. ",
"I know the older folks won’t fall for it because they know very well that social security is what makes the difference between some of them living like animals and living like human beings when they are unable to work anymore. ",
"I trust the kids aren’t so dumb that they think cutting their own benefits will somehow help them.",
"\n\nWe need investment desperately. ",
"And there’s no reason we shouldn’t do what wealthy investors all over the world are dong right now: use cheap money to stimulate the economy and build for the future. ",
"This is a very, very big con. ",
"I wish I believed that re-electing Obama will insure that this would never be signed into law. ",
"Unfortunately, I think we have to depend on the Tea Party. ",
"I hate that.",
"\n\nRecent Stories by\n\nOver recent years, environmental policy makers have essentially defined \"the wealthy\" at the level of the nation state. ",
"The focus has been on the relationships between wealthy nations and developing nations still struggling to amass wealth. ",
"Wealthier nations, the climate change consensus has come to understand, have a responsibility to help poorer nations meet the environmental challenges ahead. ",
"But a new Civil Society Equity Review report — After Paris: Inequality, Fair Shares, and the Climate Emergency — argues that we need to expand our focus from inequality between nations to inequality within nations as well.",
"\n\nThe Republican tax law encourages outsourcing because it charges corporations just half the tax rate on foreign profits that it charges on domestic earnings. ",
"It’s hard to imagine a stronger lure for corporations to pack up their plant and equipment and ship them offshore. ",
"It’s right there in another part of the law: The more U.S. corporations shift factories and other sources of production overseas, the lower the U.S. taxes are on their foreign profits. ",
"It’s almost as if the GOP law was designed to promote outsourcing."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.1704685240983963,
0.18164938688278198,
0.0011797727784141898,
0.0010040417546406388,
0.0009455789695493877,
0.0006032317760400474,
0.008770975284278393,
0.0006463248864747584,
0.001064359676092863,
0.0006664310931228101,
0.0006678152130916715,
0.0009879062417894602,
0.008438984863460064,
0.011452881619334221,
0.001090825768187642,
0.001722449087537825,
0.17447705566883087,
0.0006850736681371927,
0.001276127528399229,
0.0030048100743442774,
0.0006930427625775337,
0.0006361417472362518,
0.30861303210258484,
0.0005437126383185387,
0.0006375225493684411,
0.0006116194417700171,
0.0005603677709586918,
0.0008728195098228753,
0.0005884527927264571,
0.0006876148981973529,
0.0008328695548698306
] | 0.028583 | 31 |
[
"// go run mksyscall.go -tags darwin,arm64,!go1.12 syscall_bsd.go syscall_darwin.go syscall_darwin_arm64.1_11.go syscall_darwin_arm64.go\n// Code generated by the command above; see README.md. ",
"DO NOT EDIT.",
"\n\n// +build darwin,arm64,!go1.12\n\npackage unix\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nvar _ syscall.",
"Errno\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getgroups(ngid int, gid *_Gid_t) (n int, err error) {\n\tr0, _, e1 := RawSyscall(SYS_GETGROUPS, uintptr(ngid), uintptr(unsafe.",
"Pointer(gid)), 0)\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc setgroups(ngid int, gid *_Gid_t) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETGROUPS, uintptr(ngid), uintptr(unsafe.",
"Pointer(gid)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc wait4(pid int, wstatus *_C_int, options int, rusage *Rusage) (wpid int, err error) {\n\tr0, _, e1 := Syscall6(SYS_WAIT4, uintptr(pid), uintptr(unsafe.",
"Pointer(wstatus)), uintptr(options), uintptr(unsafe.",
"Pointer(rusage)), 0, 0)\n\twpid = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc accept(s int, rsa *RawSockaddrAny, addrlen *_Socklen) (fd int, err error) {\n\tr0, _, e1 := Syscall(SYS_ACCEPT, uintptr(s), uintptr(unsafe.",
"Pointer(rsa)), uintptr(unsafe.",
"Pointer(addrlen)))\n\tfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc bind(s int, addr unsafe.",
"Pointer, addrlen _Socklen) (err error) {\n\t_, _, e1 := Syscall(SYS_BIND, uintptr(s), uintptr(addr), uintptr(addrlen))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc connect(s int, addr unsafe.",
"Pointer, addrlen _Socklen) (err error) {\n\t_, _, e1 := Syscall(SYS_CONNECT, uintptr(s), uintptr(addr), uintptr(addrlen))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc socket(domain int, typ int, proto int) (fd int, err error) {\n\tr0, _, e1 := RawSyscall(SYS_SOCKET, uintptr(domain), uintptr(typ), uintptr(proto))\n\tfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getsockopt(s int, level int, name int, val unsafe.",
"Pointer, vallen *_Socklen) (err error) {\n\t_, _, e1 := Syscall6(SYS_GETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(unsafe.",
"Pointer(vallen)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc setsockopt(s int, level int, name int, val unsafe.",
"Pointer, vallen uintptr) (err error) {\n\t_, _, e1 := Syscall6(SYS_SETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(vallen), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getpeername(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {\n\t_, _, e1 := RawSyscall(SYS_GETPEERNAME, uintptr(fd), uintptr(unsafe.",
"Pointer(rsa)), uintptr(unsafe.",
"Pointer(addrlen)))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getsockname(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {\n\t_, _, e1 := RawSyscall(SYS_GETSOCKNAME, uintptr(fd), uintptr(unsafe.",
"Pointer(rsa)), uintptr(unsafe.",
"Pointer(addrlen)))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Shutdown(s int, how int) (err error) {\n\t_, _, e1 := Syscall(SYS_SHUTDOWN, uintptr(s), uintptr(how), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc socketpair(domain int, typ int, proto int, fd *[2]int32) (err error) {\n\t_, _, e1 := RawSyscall6(SYS_SOCKETPAIR, uintptr(domain), uintptr(typ), uintptr(proto), uintptr(unsafe.",
"Pointer(fd)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc recvfrom(fd int, p []byte, flags int, from *RawSockaddrAny, fromlen *_Socklen) (n int, err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(p) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&p[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall6(SYS_RECVFROM, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(flags), uintptr(unsafe.",
"Pointer(from)), uintptr(unsafe.",
"Pointer(fromlen)))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc sendto(s int, buf []byte, flags int, to unsafe.",
"Pointer, addrlen _Socklen) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(buf) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&buf[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall6(SYS_SENDTO, uintptr(s), uintptr(_p0), uintptr(len(buf)), uintptr(flags), uintptr(to), uintptr(addrlen))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc recvmsg(s int, msg *Msghdr, flags int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_RECVMSG, uintptr(s), uintptr(unsafe.",
"Pointer(msg)), uintptr(flags))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc sendmsg(s int, msg *Msghdr, flags int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_SENDMSG, uintptr(s), uintptr(unsafe.",
"Pointer(msg)), uintptr(flags))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc kevent(kq int, change unsafe.",
"Pointer, nchange int, event unsafe.",
"Pointer, nevent int, timeout *Timespec) (n int, err error) {\n\tr0, _, e1 := Syscall6(SYS_KEVENT, uintptr(kq), uintptr(change), uintptr(nchange), uintptr(event), uintptr(nevent), uintptr(unsafe.",
"Pointer(timeout)))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc utimes(path string, timeval *[2]Timeval) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_UTIMES, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(timeval)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc futimes(fd int, timeval *[2]Timeval) (err error) {\n\t_, _, e1 := Syscall(SYS_FUTIMES, uintptr(fd), uintptr(unsafe.",
"Pointer(timeval)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc poll(fds *PollFd, nfds int, timeout int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_POLL, uintptr(unsafe.",
"Pointer(fds)), uintptr(nfds), uintptr(timeout))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Madvise(b []byte, behav int) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(b) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&b[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall(SYS_MADVISE, uintptr(_p0), uintptr(len(b)), uintptr(behav))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mlock(b []byte) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(b) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&b[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall(SYS_MLOCK, uintptr(_p0), uintptr(len(b)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mlockall(flags int) (err error) {\n\t_, _, e1 := Syscall(SYS_MLOCKALL, uintptr(flags), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mprotect(b []byte, prot int) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(b) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&b[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall(SYS_MPROTECT, uintptr(_p0), uintptr(len(b)), uintptr(prot))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Msync(b []byte, flags int) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(b) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&b[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall(SYS_MSYNC, uintptr(_p0), uintptr(len(b)), uintptr(flags))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Munlock(b []byte) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(b) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&b[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall(SYS_MUNLOCK, uintptr(_p0), uintptr(len(b)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Munlockall() (err error) {\n\t_, _, e1 := Syscall(SYS_MUNLOCKALL, 0, 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getattrlist(path *byte, list unsafe.",
"Pointer, buf unsafe.",
"Pointer, size uintptr, options int) (err error) {\n\t_, _, e1 := Syscall6(SYS_GETATTRLIST, uintptr(unsafe.",
"Pointer(path)), uintptr(list), uintptr(buf), uintptr(size), uintptr(options), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc pipe() (r int, w int, err error) {\n\tr0, r1, e1 := RawSyscall(SYS_PIPE, 0, 0, 0)\n\tr = int(r0)\n\tw = int(r1)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getxattr(path string, attr string, dest *byte, size int, position uint32, options int) (sz int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall6(SYS_GETXATTR, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), uintptr(unsafe.",
"Pointer(dest)), uintptr(size), uintptr(position), uintptr(options))\n\tsz = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc fgetxattr(fd int, attr string, dest *byte, size int, position uint32, options int) (sz int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall6(SYS_FGETXATTR, uintptr(fd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(dest)), uintptr(size), uintptr(position), uintptr(options))\n\tsz = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc setxattr(path string, attr string, data *byte, size int, position uint32, options int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_SETXATTR, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), uintptr(unsafe.",
"Pointer(data)), uintptr(size), uintptr(position), uintptr(options))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc fsetxattr(fd int, attr string, data *byte, size int, position uint32, options int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_FSETXATTR, uintptr(fd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(data)), uintptr(size), uintptr(position), uintptr(options))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc removexattr(path string, attr string, options int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_REMOVEXATTR, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), uintptr(options))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc fremovexattr(fd int, attr string, options int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(attr)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_FREMOVEXATTR, uintptr(fd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(options))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc listxattr(path string, dest *byte, size int, options int) (sz int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall6(SYS_LISTXATTR, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(dest)), uintptr(size), uintptr(options), 0, 0)\n\tsz = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc flistxattr(fd int, dest *byte, size int, options int) (sz int, err error) {\n\tr0, _, e1 := Syscall6(SYS_FLISTXATTR, uintptr(fd), uintptr(unsafe.",
"Pointer(dest)), uintptr(size), uintptr(options), 0, 0)\n\tsz = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc setattrlist(path *byte, list unsafe.",
"Pointer, buf unsafe.",
"Pointer, size uintptr, options int) (err error) {\n\t_, _, e1 := Syscall6(SYS_SETATTRLIST, uintptr(unsafe.",
"Pointer(path)), uintptr(list), uintptr(buf), uintptr(size), uintptr(options), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc fcntl(fd int, cmd int, arg int) (val int, err error) {\n\tr0, _, e1 := Syscall(SYS_FCNTL, uintptr(fd), uintptr(cmd), uintptr(arg))\n\tval = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc kill(pid int, signum int, posix int) (err error) {\n\t_, _, e1 := Syscall(SYS_KILL, uintptr(pid), uintptr(signum), uintptr(posix))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc ioctl(fd int, req uint, arg uintptr) (err error) {\n\t_, _, e1 := Syscall(SYS_IOCTL, uintptr(fd), uintptr(req), uintptr(arg))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc sysctl(mib []_C_int, old *byte, oldlen *uintptr, new *byte, newlen uintptr) (err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(mib) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&mib[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\t_, _, e1 := Syscall6(SYS_SYSCTL, uintptr(_p0), uintptr(len(mib)), uintptr(unsafe.",
"Pointer(old)), uintptr(unsafe.",
"Pointer(oldlen)), uintptr(unsafe.",
"Pointer(new)), uintptr(newlen))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc sendfile(infd int, outfd int, offset int64, len *int64, hdtr unsafe.",
"Pointer, flags int) (err error) {\n\t_, _, e1 := Syscall6(SYS_SENDFILE, uintptr(infd), uintptr(outfd), uintptr(offset), uintptr(unsafe.",
"Pointer(len)), uintptr(hdtr), uintptr(flags))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Access(path string, mode uint32) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_ACCESS, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Adjtime(delta *Timeval, olddelta *Timeval) (err error) {\n\t_, _, e1 := Syscall(SYS_ADJTIME, uintptr(unsafe.",
"Pointer(delta)), uintptr(unsafe.",
"Pointer(olddelta)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Chdir(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_CHDIR, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Chflags(path string, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_CHFLAGS, uintptr(unsafe.",
"Pointer(_p0)), uintptr(flags), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Chmod(path string, mode uint32) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_CHMOD, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Chown(path string, uid int, gid int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_CHOWN, uintptr(unsafe.",
"Pointer(_p0)), uintptr(uid), uintptr(gid))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Chroot(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_CHROOT, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Close(fd int) (err error) {\n\t_, _, e1 := Syscall(SYS_CLOSE, uintptr(fd), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Dup(fd int) (nfd int, err error) {\n\tr0, _, e1 := Syscall(SYS_DUP, uintptr(fd), 0, 0)\n\tnfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Dup2(from int, to int) (err error) {\n\t_, _, e1 := Syscall(SYS_DUP2, uintptr(from), uintptr(to), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Exchangedata(path1 string, path2 string, options int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path1)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(path2)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_EXCHANGEDATA, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), uintptr(options))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Exit(code int) {\n\tSyscall(SYS_EXIT, uintptr(code), 0, 0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Faccessat(dirfd int, path string, mode uint32, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_FACCESSAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), uintptr(flags), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchdir(fd int) (err error) {\n\t_, _, e1 := Syscall(SYS_FCHDIR, uintptr(fd), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchflags(fd int, flags int) (err error) {\n\t_, _, e1 := Syscall(SYS_FCHFLAGS, uintptr(fd), uintptr(flags), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchmod(fd int, mode uint32) (err error) {\n\t_, _, e1 := Syscall(SYS_FCHMOD, uintptr(fd), uintptr(mode), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchmodat(dirfd int, path string, mode uint32, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_FCHMODAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), uintptr(flags), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchown(fd int, uid int, gid int) (err error) {\n\t_, _, e1 := Syscall(SYS_FCHOWN, uintptr(fd), uintptr(uid), uintptr(gid))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fchownat(dirfd int, path string, uid int, gid int, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_FCHOWNAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(uid), uintptr(gid), uintptr(flags), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Flock(fd int, how int) (err error) {\n\t_, _, e1 := Syscall(SYS_FLOCK, uintptr(fd), uintptr(how), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fpathconf(fd int, name int) (val int, err error) {\n\tr0, _, e1 := Syscall(SYS_FPATHCONF, uintptr(fd), uintptr(name), 0)\n\tval = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fsync(fd int) (err error) {\n\t_, _, e1 := Syscall(SYS_FSYNC, uintptr(fd), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Ftruncate(fd int, length int64) (err error) {\n\t_, _, e1 := Syscall(SYS_FTRUNCATE, uintptr(fd), uintptr(length), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getdtablesize() (size int) {\n\tr0, _, _ := Syscall(SYS_GETDTABLESIZE, 0, 0, 0)\n\tsize = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getegid() (egid int) {\n\tr0, _, _ := RawSyscall(SYS_GETEGID, 0, 0, 0)\n\tegid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Geteuid() (uid int) {\n\tr0, _, _ := RawSyscall(SYS_GETEUID, 0, 0, 0)\n\tuid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getgid() (gid int) {\n\tr0, _, _ := RawSyscall(SYS_GETGID, 0, 0, 0)\n\tgid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getpgid(pid int) (pgid int, err error) {\n\tr0, _, e1 := RawSyscall(SYS_GETPGID, uintptr(pid), 0, 0)\n\tpgid = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getpgrp() (pgrp int) {\n\tr0, _, _ := RawSyscall(SYS_GETPGRP, 0, 0, 0)\n\tpgrp = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getpid() (pid int) {\n\tr0, _, _ := RawSyscall(SYS_GETPID, 0, 0, 0)\n\tpid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getppid() (ppid int) {\n\tr0, _, _ := RawSyscall(SYS_GETPPID, 0, 0, 0)\n\tppid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getpriority(which int, who int) (prio int, err error) {\n\tr0, _, e1 := Syscall(SYS_GETPRIORITY, uintptr(which), uintptr(who), 0)\n\tprio = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getrlimit(which int, lim *Rlimit) (err error) {\n\t_, _, e1 := RawSyscall(SYS_GETRLIMIT, uintptr(which), uintptr(unsafe.",
"Pointer(lim)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getrusage(who int, rusage *Rusage) (err error) {\n\t_, _, e1 := RawSyscall(SYS_GETRUSAGE, uintptr(who), uintptr(unsafe.",
"Pointer(rusage)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getsid(pid int) (sid int, err error) {\n\tr0, _, e1 := RawSyscall(SYS_GETSID, uintptr(pid), 0, 0)\n\tsid = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Getuid() (uid int) {\n\tr0, _, _ := RawSyscall(SYS_GETUID, 0, 0, 0)\n\tuid = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Issetugid() (tainted bool) {\n\tr0, _, _ := RawSyscall(SYS_ISSETUGID, 0, 0, 0)\n\ttainted = bool(r0 !",
"= 0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Kqueue() (fd int, err error) {\n\tr0, _, e1 := Syscall(SYS_KQUEUE, 0, 0, 0)\n\tfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Lchown(path string, uid int, gid int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_LCHOWN, uintptr(unsafe.",
"Pointer(_p0)), uintptr(uid), uintptr(gid))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Link(path string, link string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(link)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_LINK, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Linkat(pathfd int, path string, linkfd int, link string, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(link)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_LINKAT, uintptr(pathfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(linkfd), uintptr(unsafe.",
"Pointer(_p1)), uintptr(flags), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Listen(s int, backlog int) (err error) {\n\t_, _, e1 := Syscall(SYS_LISTEN, uintptr(s), uintptr(backlog), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mkdir(path string, mode uint32) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_MKDIR, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mkdirat(dirfd int, path string, mode uint32) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_MKDIRAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mkfifo(path string, mode uint32) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_MKFIFO, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Mknod(path string, mode uint32, dev int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_MKNOD, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), uintptr(dev))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Open(path string, mode int, perm uint32) (fd int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall(SYS_OPEN, uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), uintptr(perm))\n\tfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Openat(dirfd int, path string, mode int, perm uint32) (fd int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall6(SYS_OPENAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(mode), uintptr(perm), 0, 0)\n\tfd = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Pathconf(path string, name int) (val int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tr0, _, e1 := Syscall(SYS_PATHCONF, uintptr(unsafe.",
"Pointer(_p0)), uintptr(name), 0)\n\tval = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Pread(fd int, p []byte, offset int64) (n int, err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(p) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&p[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall6(SYS_PREAD, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Pwrite(fd int, p []byte, offset int64) (n int, err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(p) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&p[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall6(SYS_PWRITE, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc read(fd int, p []byte) (n int, err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(p) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&p[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(_p0), uintptr(len(p)))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Readlink(path string, buf []byte) (n int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 unsafe.",
"Pointer\n\tif len(buf) > 0 {\n\t\t_p1 = unsafe.",
"Pointer(&buf[0])\n\t} else {\n\t\t_p1 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall(SYS_READLINK, uintptr(unsafe.",
"Pointer(_p0)), uintptr(_p1), uintptr(len(buf)))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Readlinkat(dirfd int, path string, buf []byte) (n int, err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 unsafe.",
"Pointer\n\tif len(buf) > 0 {\n\t\t_p1 = unsafe.",
"Pointer(&buf[0])\n\t} else {\n\t\t_p1 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall6(SYS_READLINKAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(_p1), uintptr(len(buf)), 0, 0)\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Rename(from string, to string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(from)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(to)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_RENAME, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Renameat(fromfd int, from string, tofd int, to string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(from)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(to)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_RENAMEAT, uintptr(fromfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(tofd), uintptr(unsafe.",
"Pointer(_p1)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Revoke(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_REVOKE, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Rmdir(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_RMDIR, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Seek(fd int, offset int64, whence int) (newoffset int64, err error) {\n\tr0, _, e1 := Syscall(SYS_LSEEK, uintptr(fd), uintptr(offset), uintptr(whence))\n\tnewoffset = int64(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Select(nfd int, r *FdSet, w *FdSet, e *FdSet, timeout *Timeval) (n int, err error) {\n\tr0, _, e1 := Syscall6(SYS_SELECT, uintptr(nfd), uintptr(unsafe.",
"Pointer(r)), uintptr(unsafe.",
"Pointer(w)), uintptr(unsafe.",
"Pointer(e)), uintptr(unsafe.",
"Pointer(timeout)), 0)\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setegid(egid int) (err error) {\n\t_, _, e1 := Syscall(SYS_SETEGID, uintptr(egid), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Seteuid(euid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETEUID, uintptr(euid), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setgid(gid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETGID, uintptr(gid), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setlogin(name string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(name)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_SETLOGIN, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setpgid(pid int, pgid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETPGID, uintptr(pid), uintptr(pgid), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setpriority(which int, who int, prio int) (err error) {\n\t_, _, e1 := Syscall(SYS_SETPRIORITY, uintptr(which), uintptr(who), uintptr(prio))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setprivexec(flag int) (err error) {\n\t_, _, e1 := Syscall(SYS_SETPRIVEXEC, uintptr(flag), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setregid(rgid int, egid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETREGID, uintptr(rgid), uintptr(egid), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setreuid(ruid int, euid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETREUID, uintptr(ruid), uintptr(euid), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setrlimit(which int, lim *Rlimit) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETRLIMIT, uintptr(which), uintptr(unsafe.",
"Pointer(lim)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setsid() (pid int, err error) {\n\tr0, _, e1 := RawSyscall(SYS_SETSID, 0, 0, 0)\n\tpid = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Settimeofday(tp *Timeval) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETTIMEOFDAY, uintptr(unsafe.",
"Pointer(tp)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Setuid(uid int) (err error) {\n\t_, _, e1 := RawSyscall(SYS_SETUID, uintptr(uid), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Symlink(path string, link string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(link)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_SYMLINK, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(_p1)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Symlinkat(oldpath string, newdirfd int, newpath string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(oldpath)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\tvar _p1 *byte\n\t_p1, err = BytePtrFromString(newpath)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_SYMLINKAT, uintptr(unsafe.",
"Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.",
"Pointer(_p1)))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Sync() (err error) {\n\t_, _, e1 := Syscall(SYS_SYNC, 0, 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Truncate(path string, length int64) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_TRUNCATE, uintptr(unsafe.",
"Pointer(_p0)), uintptr(length), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Umask(newmask int) (oldmask int) {\n\tr0, _, _ := Syscall(SYS_UMASK, uintptr(newmask), 0, 0)\n\toldmask = int(r0)\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Undelete(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_UNDELETE, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Unlink(path string) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_UNLINK, uintptr(unsafe.",
"Pointer(_p0)), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Unlinkat(dirfd int, path string, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_UNLINKAT, uintptr(dirfd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(flags))\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Unmount(path string, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_UNMOUNT, uintptr(unsafe.",
"Pointer(_p0)), uintptr(flags), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc write(fd int, p []byte) (n int, err error) {\n\tvar _p0 unsafe.",
"Pointer\n\tif len(p) > 0 {\n\t\t_p0 = unsafe.",
"Pointer(&p[0])\n\t} else {\n\t\t_p0 = unsafe.",
"Pointer(&_zero)\n\t}\n\tr0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(_p0), uintptr(len(p)))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc mmap(addr uintptr, length uintptr, prot int, flag int, fd int, pos int64) (ret uintptr, err error) {\n\tr0, _, e1 := Syscall6(SYS_MMAP, uintptr(addr), uintptr(length), uintptr(prot), uintptr(flag), uintptr(fd), uintptr(pos))\n\tret = uintptr(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc munmap(addr uintptr, length uintptr) (err error) {\n\t_, _, e1 := Syscall(SYS_MUNMAP, uintptr(addr), uintptr(length), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc readlen(fd int, buf *byte, nbuf int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(unsafe.",
"Pointer(buf)), uintptr(nbuf))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc writelen(fd int, buf *byte, nbuf int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(unsafe.",
"Pointer(buf)), uintptr(nbuf))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc gettimeofday(tp *Timeval) (sec int64, usec int32, err error) {\n\tr0, r1, e1 := RawSyscall(SYS_GETTIMEOFDAY, uintptr(unsafe.",
"Pointer(tp)), 0, 0)\n\tsec = int64(r0)\n\tusec = int32(r1)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fstat(fd int, stat *Stat_t) (err error) {\n\t_, _, e1 := Syscall(SYS_FSTAT, uintptr(fd), uintptr(unsafe.",
"Pointer(stat)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fstatat(fd int, path string, stat *Stat_t, flags int) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall6(SYS_FSTATAT, uintptr(fd), uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(stat)), uintptr(flags), 0, 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Fstatfs(fd int, stat *Statfs_t) (err error) {\n\t_, _, e1 := Syscall(SYS_FSTATFS, uintptr(fd), uintptr(unsafe.",
"Pointer(stat)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc getfsstat(buf unsafe.",
"Pointer, size uintptr, flags int) (n int, err error) {\n\tr0, _, e1 := Syscall(SYS_GETFSSTAT, uintptr(buf), uintptr(size), uintptr(flags))\n\tn = int(r0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Lstat(path string, stat *Stat_t) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_LSTAT, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(stat)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Stat(path string, stat *Stat_t) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_STAT, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(stat)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n\n// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT\n\nfunc Statfs(path string, stat *Statfs_t) (err error) {\n\tvar _p0 *byte\n\t_p0, err = BytePtrFromString(path)\n\tif err !",
"= nil {\n\t\treturn\n\t}\n\t_, _, e1 := Syscall(SYS_STATFS, uintptr(unsafe.",
"Pointer(_p0)), uintptr(unsafe.",
"Pointer(stat)), 0)\n\tif e1 !",
"= 0 {\n\t\terr = errnoErr(e1)\n\t}\n\treturn\n}\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.005125494208186865,
0.00201672175899148,
0.0008175412658601999,
0.0016238319221884012,
0.003550231456756592,
0.0021274236496537924,
0.001180865685455501,
0.001448974828235805,
0.0006590503617189825,
0.0033725581597536802,
0.005848061293363571,
0.000629260903224349,
0.00325195025652647,
0.0017586766043677926,
0.001384509145282209,
0.0014871428720653057,
0.001376584405079484,
0.0027015332598239183,
0.004581518936902285,
0.001092111342586577,
0.0010226030135527253,
0.003612908534705639,
0.0014735851436853409,
0.004779561422765255,
0.000629260903224349,
0.0010497935581952333,
0.0057020424865186214,
0.000629260903224349,
0.0010497935581952333,
0.007224202621728182,
0.0014660876477137208,
0.0014178919373080134,
0.004648442380130291,
0.0008806930854916573,
0.0007794181001372635,
0.0009844417218118906,
0.0006144479266367853,
0.0017158712726086378,
0.0017322509083896875,
0.0008203443139791489,
0.0009703767136670649,
0.0007519477512687445,
0.0017415258334949613,
0.002551101613789797,
0.0030267543625086546,
0.00299945380538702,
0.0030267543625086546,
0.0014154978562146425,
0.0006387423491105437,
0.000973172893282026,
0.0012361123226583004,
0.002612494630739093,
0.0012967055663466454,
0.0006511097308248281,
0.000902126426808536,
0.009518725797533989,
0.000902126426808536,
0.003166370326653123,
0.0018134311540052295,
0.0020515574142336845,
0.0008395970799028873,
0.0007631180924363434,
0.001735753146931529,
0.0023435549810528755,
0.0008395970799028873,
0.0007631180924363434,
0.0038169610779732466,
0.00416150875389576,
0.002488504396751523,
0.0008395970799028873,
0.0007631180924363434,
0.001944915158674121,
0.0017570573836565018,
0.0008395970799028873,
0.0007631180924363434,
0.0014452353352680802,
0.003822240512818098,
0.0008395970799028873,
0.0007631180924363434,
0.003252950729802251,
0.004967121407389641,
0.002420069882646203,
0.0007111530867405236,
0.0009920926531776786,
0.0010735298274084926,
0.008786838501691818,
0.0037927294615656137,
0.003577444003894925,
0.0024734747130423784,
0.0006511097308248281,
0.0006410994683392346,
0.0011683388147503138,
0.009159083478152752,
0.004166711121797562,
0.0006511097308248281,
0.0011683388147503138,
0.0032779299654066563,
0.003577444003894925,
0.0021271088626235723,
0.0006511097308248281,
0.0006410994683392346,
0.0008568194461986423,
0.0033218690659850836,
0.001701359637081623,
0.0006511097308248281,
0.0008568194461986423,
0.005969367455691099,
0.003577444003894925,
0.0020294596906751394,
0.0006511097308248281,
0.0009568352834321558,
0.006168287247419357,
0.0018355769570916891,
0.000982100609689951,
0.003601230913773179,
0.0023377258330583572,
0.0006511097308248281,
0.0014843061799183488,
0.0022261906415224075,
0.0014843061799183488,
0.001460904604755342,
0.0007111530867405236,
0.0009492573444731534,
0.0010735298274084926,
0.008200856857001781,
0.019599325954914093,
0.0028221579268574715,
0.0015759785892441869,
0.0008205409394577146,
0.0007291064830496907,
0.0008723019273020327,
0.0006484554032795131,
0.0006657318444922566,
0.0009497812716290355,
0.00251481169834733,
0.0010587555589154363,
0.0010293605737388134,
0.0034070766996592283,
0.0010663961293175817,
0.001180532737635076,
0.0014968379400670528,
0.000617109821178019,
0.0010513979941606522,
0.00534854969009757,
0.001282784272916615,
0.0011377751361578703,
0.007869027554988861,
0.0012530991807579994,
0.001152889453805983,
0.005196935962885618,
0.001294255256652832,
0.001180532737635076,
0.0045379772782325745,
0.0009861016878858209,
0.0012453183298930526,
0.008392940275371075,
0.0013472808059304953,
0.0011377751361578703,
0.003981407731771469,
0.007702951319515705,
0.0038581385742872953,
0.004755892790853977,
0.0032287733629345894,
0.0009855128591880202,
0.0006511097308248281,
0.0009568352834321558,
0.012161420658230782,
0.025740856304764748,
0.0011897763470187783,
0.003250541165471077,
0.012228510342538357,
0.010514515452086926,
0.004998782183974981,
0.0016205983702093363,
0.0011897763470187783,
0.005540979094803333,
0.004438598174601793,
0.0014197821728885174,
0.0014779020566493273,
0.0025777784176170826,
0.006047359202057123,
0.004862114787101746,
0.005891643930226564,
0.015746958553791046,
0.01786833442747593,
0.003183807246387005,
0.0010009134421125054,
0.0016354814870283008,
0.0010792706161737442,
0.007014378905296326,
0.08205404877662659,
0.0048042479902505875,
0.005270303227007389,
0.001214685384184122,
0.0012453183298930526,
0.003213645191863179,
0.0032490426674485207,
0.0010934772435575724,
0.0006511097308248281,
0.0010182554833590984,
0.003515516873449087,
0.0032490426674485207,
0.0012256632326170802,
0.0007066375110298395,
0.0011174179380759597,
0.002576925093308091,
0.0043371981009840965,
0.001157055958174169,
0.001180532737635076,
0.0038769631646573544,
0.001260260003618896,
0.0011950669577345252,
0.005546186584979296,
0.0012833280488848686,
0.001180532737635076,
0.004554595798254013,
0.0011932202614843845,
0.0011992930667474866,
0.004990199580788612,
0.0015081254532560706,
0.0022397106513381004,
0.0039152177050709724,
0.0014714781427755952,
0.0029955320060253143,
0.005792997311800718,
0.0013020768528804183,
0.0026872199960052967,
0.0018452157964929938,
0.0008806930854916573,
0.0007794181001372635,
0.0033700603526085615,
0.0022463141940534115,
0.0008806930854916573,
0.0007794181001372635,
0.004202351439744234,
0.0017798362532630563,
0.0008806930854916573,
0.0007794181001372635,
0.004673299845308065,
0.004228562582284212,
0.0011659391457214952,
0.0009024710743688047,
0.0007157711661420763,
0.0007793174008838832,
0.005107515025883913,
0.003070073202252388,
0.0011659391457214952,
0.0009024710743688047,
0.0007157711661420763,
0.0008095676894299686,
0.0029438622295856476,
0.0036526117473840714,
0.006462791468948126,
0.0010331774828955531,
0.0006511097308248281,
0.0010182554833590984,
0.003418930806219578,
0.006462791468948126,
0.0011943920981138945,
0.000696702569257468,
0.0010897698812186718,
0.003662813687697053,
0.0013065059902146459,
0.0011377751361578703,
0.005021743010729551,
0.0012447235640138388,
0.0011377751361578703,
0.003089204430580139,
0.0022445162758231163,
0.0006353328935801983,
0.0006475331028923392,
0.0006412449292838573,
0.0016388718504458666,
0.003737633815035224,
0.0032151362393051386,
0.003847347339615226,
0.004274417646229267,
0.0012958173174411058,
0.0011377751361578703,
0.0038822023198008537,
0.0053005521185696125,
0.00274360878393054,
0.005294473376125097,
0.003247502027079463,
0.002988650230690837,
0.0010009134421125054,
0.005103598814457655,
0.0015010664938017726,
0.0012546422658488154,
0.0027328517753630877,
0.004205394070595503,
0.0032490426674485207,
0.0012047040509060025,
0.0006511097308248281,
0.0010182554833590984,
0.004450004082173109,
0.002582049695774913,
0.00135511951521039,
0.0007336018607020378,
0.0010857995366677642,
0.0024647978134453297,
0.005588218569755554,
0.0014024049742147326,
0.0012053422397002578,
0.0039378562942147255,
0.001347960322163999,
0.0011377751361578703,
0.0030350002925843,
0.0009857345139607787,
0.0011377751361578703,
0.004205553326755762,
0.0011042593978345394,
0.0011223305482417345,
0.004056524019688368,
0.0011806676629930735,
0.001152889453805983,
0.002170347375795245,
0.0008806930854916573,
0.0007794181001372635,
0.005545079242438078,
0.0015390027547255158,
0.00301420409232378,
0.002933360170572996,
0.004834867548197508,
0.003574503120034933,
0.004834867548197508,
0.0015799505636096,
0.0016778542194515467,
0.0023820989299565554,
0.0010537505149841309,
0.003500275546684861,
0.0014273917768150568,
0.0006511097308248281,
0.0012012063525617123,
0.0031125752720981836,
0.0010537505149841309,
0.003101325361058116,
0.0019969893619418144,
0.006167883984744549,
0.0012205935781821609,
0.0006511097308248281,
0.0010537505149841309,
0.004351878073066473,
0.0010622942354530096,
0.0006511097308248281,
0.0010537505149841309,
0.00514952652156353,
0.001073347288183868,
0.0006511097308248281,
0.0010537505149841309,
0.003061506897211075
] | 0.002829 | 351 |
[
"Q:\n\nupdate in procedure taking long time\n\ncreate or replace procedure Proc_1(P_IN_TABLE_NAME VARCHAR2)\nAS\nCURSOR T_FACT\nIS\nSELECT T_ID,T_VER,D_T_ID\nfrom O_T_FACT\nwhere T_ID is not null\nand T_VER is not null;\n\nTYPE call_tab IS TABLE OF O_T_FACT%rowtype;\n\nBEGIN\n IF P_IN_TABLE_NAME ='G_FACT' THEN\n\n OPEN T_FACT; \n LOOP \n\n EXIT WHEN T_FACT%NOTFOUND ; \n\n FETCH T_FACT BULK COLLECT INTO call_data_rec LIMIT no_of_rec; \n EXIT WHEN call_data_rec.count = 0;\n\n FOR j IN 1..call_data_rec.",
"COUNT\n loop\n UPDATE G_FACT GL set\n GL.T_ID = call_data_rec(j).T_ID, \n GL.T_VER =call_data_rec(j).T_VER,\n GL.TRANS_FLAG='Y'\n WHERE GL.G_T_ID = call_data_rec(j).D_T_ID\n AND GL.T_ID IS NULL \n AND GL.T_VER IS NULL; \n\n rec_count := rec_count + 1; \n if mod(rec_count,10000) = 0 then\n commit;\n end if; \n end loop; \n\n end loop;\n CLOSE T_FACT;\n END IF;\nEnd;\n\nThis particular procedure is taking long time, is there any other way to write this? ",
"Can this be done in a single update statement?",
"\nAs suggested below I have tired for all but its giving error as \nPLS-00436: implementation restriction: cannot reference fields of BULK In-BIND table of records\nNew Code with For all\ncreate or replace procedure Proc_update_T_ID(P_IN_TABLE_NAME VARCHAR2)\nAS\nno_of_rec number := 1000;\nCURSOR T_and_V_FACT\nIS\nSELECT O_T_FACT.T_ID, O_T_FACT.T_VER, O_T_FACT.Downstream_T_ID, G_FACT.rowid row_id,\nFrom O_T_FACT, G_FACT\nWHERE O_T_FACT.T_ID IS NOT NULL AND G_FACT.G_T_ID = O_T_FACT.Downstream_T_ID\nAND T_VER is not null\nAND G_FACT.T_VER IS NULL;\n\nTYPE call_tab IS TABLE OF T_and_V_FACT%rowtype index by binary_integer;\ncall_data_rec call_tab;\n\nBEGIN\n IF P_IN_TABLE_NAME ='G_FACT' THEN\n IF T_and_V_FACT%ISOPEN THEN\n CLOSE T_and_V_FACT;\n END IF; \n\n open T_and_V_FACT;\n\n LOOP\n\n FETCH T_and_V_FACT BULK COLLECT\n INTO call_data_rec LIMIT no_of_rec;\n\n FORALL j IN call_data_rec.",
"FIRST .. call_data_rec.",
"LAST \n UPDATE G_FACT GL set\n GL.T_ID = call_data_rec(j).T_ID, \n GL.T_VER =call_data_rec(j).T_VER,\n GL.TRANS_FLAG='Y'\n WHERE GL.rowid = call_data_rec(j).row_id; \n\n COMMIT; \n call_data_rec.",
"DELETE;\n EXIT WHEN T_and_V_FACT%NOTFOUND; \n END LOOP;\n\n CLOSE T_and_V_FACT;\n End if;\n\nEND Proc_1;\n\nA:\n\nIt looks to me like you could rewrite this into a single statement like so:\nupdate G_FACT GL\nset (GL.T_ID, GL.T_VER, GL.TRANS_FLAG) = \n (select T_ID,T_VER, 'Y'\n from O_T_FACT F\n where F.T_ID is not null\n and F.T_VER is not null\n and GL.G_T_ID = F.D_T_ID)\nwhere exists (select null\n from O_T_FACT F\n where F.T_ID is not null\n and F.T_VER is not null\n and GL.G_T_ID = F.D_T_ID)\nand GL.T_ID is null\nand GL.T_VER is null; \n\nIf this doesn't work, then you should be able to get significant gains by converting your for loop into a forall statement:\n FORALL j IN 1..call_data_rec.",
"COUNT\n UPDATE G_FACT GL set\n GL.T_ID = call_data_rec(j).T_ID, \n GL.T_VER =call_data_rec(j).T_VER,\n GL.TRANS_FLAG='Y'\n WHERE GL.G_T_ID = call_data_rec(j).D_T_ID\n AND GL.T_ID IS NULL \n AND GL.T_VER IS NULL; \n\nAlso, rethink whether you need that commit in the loop. ",
"Including this will:\n\nSlow your processing down\nIncrease the chance of hitting ORA-1555s\nPossibly leave your data in an inconsistent state\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.00183151348028332,
0.006911403965204954,
0.0006471231463365257,
0.0036940686404705048,
0.0007966748671606183,
0.0018487110501155257,
0.025738848373293877,
0.00382809154689312,
0.004504270851612091
] | 0.005533 | 9 |
[
"Kiki Palmer\n\nDaniela Palmer (1907–1949), better known by her stagename Kiki Palmer, was an Italian stage, film, and radio actress.",
"\n\nLife and career \nDaniela Palmer was born in Milan, Italy on July 11, 1907. ",
"Palmer became an actress and in 1931 began using the stagename \"Kiki Palmer\". ",
"Palmer was one of the most well known and highly regarded Italian stage actresses of her time, and came to be highly regarded outside of Italy as well. ",
"From 1938-1939, Palmer used the stagename \"Palma Palmer\", a name suggested to her by artist Gabriele D'Annunzio.",
"\n\nPalmer died in Rome on August 11, 1949.",
"\n\nPersonal life \nPalmer adopted Renzo Palmer who also became an actor.",
"\n\nSelected filmography \n\n The Wedding March (1936)\n La luce del mondo (1935)\n\nExternal links\n\nReferences \n\nCategory:1907 births\nCategory:1949 deaths\nCategory:Italian actresses\nCategory:Actresses from Milan\nCategory:20th-century Italian actresses\nCategory:Italian film actresses\nCategory:Italian stage actresses"
] |
{
"pile_set_name": "Wikipedia (en)"
}
|
[
0.0010944537352770567,
0.0006278285873122513,
0.0013225952861830592,
0.0010000079637393355,
0.0005944677395746112,
0.0010011603590101004,
0.0009486294002272189,
0.0006206200923770666
] | 0.000901 | 8 |
[
"Contemporary Cabinets in Maple\n\nWide open spaces are easily handled with good design elements like a peninsula that separates a work area from a gathering spot. ",
"Accenting the room's natural architecture with the same surface as the countertop even adds a tiny bar area as a transition. ",
"And, just to prove that is room isn't all work and no play, amping up the contemporary cabinets with glass doors and open shelving adds a little bit of fun to a fantastic storage space."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005680012400262058,
0.000622834893874824,
0.0006545846117660403
] | 0.000615 | 3 |
[
"Q:\n\nRouting traffic between two servers based on a cookie\n\nWe are presently rewriting an in-production Django site. ",
"We would like to deploy the new site in parallel with the old site, and slowly divert traffic from old to new using the following scheme:\n\nNew accounts go to the new site\nExisting accounts go to the old site\nExisting accounts may be offered the opportunity to opt in to the new site\nAccounts diverted to the new site may opt out and be returned to the old site\n\nIt's clear to me that a cookie is involved, and that Nginx is capable of rewriting requests based on a cookie:\n\nNginx redirect if cookie present\nHow do I run two rails apps behind the same domain and have nginx route requests based on cookie?",
"\n\nHow the cookie gets set remains a bit of a mystery to me. ",
"It seems like a chicken-and-egg problem. ",
"Has anyone successfully run a scheme like this? ",
"How did you do it?",
"\n\nA:\n\nI think the most suitable solution for you problem would be:\n\nNginx at every request should check for some specific cookie, route\nIf it's presented and equals old, request goes to a old site\nOtherwise request goes to the new site.",
"\nEvery site (new and old) should check request for that cookie (route)\nIf cookie isn't presented (or wrong), your app should set it to the right value, and if request is for that site, just proceed it.",
"\nIf not, it should send redirect, and we begin again with step 1\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0005914230714552104,
0.0006406554020941257,
0.0006148412940092385,
0.003305240534245968,
0.000804763927590102,
0.0008933885837905109,
0.0007507556583732367,
0.0005790098803117871,
0.0005643322365358472
] | 0.000972 | 9 |
[
"Press Releases\n\nUNECE International PPP Centre of Excellence wins Special Award for South-South Cooperation\n\nPublished: 07 November 2013\n\nThe UNECE International Public-Private Partnership (PPP) Centre of Excellence received the Special Award for South-South Cooperation at the closing ceremony of the Global South-South Development EXPO 2013 on 1 November in Nairobi, Kenya (see separate article on the EXPO).",
"\n\nEstablished in February 2012, the UNECE International PPP Centre of Excellence has become a global leader in preparing international PPP best practices and standards to guide governments in implementing PPPs successfully. ",
"The objectives of the International PPP Centre of Excellence are to significantly reduce the time, cost and inefficiency which currently tend to hamper the preparation, structuring and implementation of PPPs. ",
"It also aims at increasing significantly the proportion and scope of PPPs which can be considered as successful and as having achieved both their social and financial objectives.",
"\n\nIn addition to developing standards, the UNECE International PPP Centre of Excellence also helps governments to implement them. ",
"Regional hubs are being established to assist countries to contextualise and adapt the standards to their local conditions. ",
"Furthermore, a Business Advisory Board was recently established to support governments in implementing PPPs through high-level national and regional consultations."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005284607759676874,
0.000565066933631897,
0.0006483435863628983,
0.0005835329066030681,
0.0005415796185843647,
0.0005273052374832332,
0.0005403908435255289
] | 0.000562 | 7 |
[
"Pages\n\nFriday, March 13, 2015\n\nOrganizing your garage workshop prior to the spring is the perfect time to set it up for all the projects you’re planning when the weather gets nice. ",
"We’ve got some pro tips to get you started!",
"\n\nFirst of all, if you have not yet taken the time to install a peg board in your shop, now is the time to do it. ",
"Space savers are always essential for a busy workroom, and a peg board is one of the most inexpensive investments you can make. ",
"Use large sections that you can attach to the walls to keep large tools easily accessible. ",
"You can also make small peg board panels to hold your levels, hand saws and hammers. ",
"By nailing a few pieces of trim as guides underneath your workbench countertop, you can slide the panels in and out when you need a small tool.",
"\n\nClearing the Clutter\n\nGetting objects that occupy floor space out of your way can make your workshop seem larger than its actual size. ",
"Using the ceiling and the walls can accomplish this goal well. ",
"For example, the ladder, which is usually in the way, can be stored overhead with ceiling brackets. ",
"Unless you use the ladder regularly, this is a great way to use your space more wisely.",
"\n\nOverhead space is also a handy place to suspend storage bins for holiday items like decorations and strings of lights. ",
"Pick up some large plastic tubs from your home improvement store, and clear some space by moving them only one time. ",
"To incorporate wall space for organizing your yard tools, screw two rows of short lengths of two-inch PVC pipe to the wall. ",
"Place one row about one foot from the floor and the second row about two feet above it. ",
"You can stand your shovels, rakes, hoes and other garden tools there where they can dry.",
"\n\nLining up Your Drill Bits\n\nMount two magnetic strips on a length of 1 x 2 board. ",
"Then you can let your drill bits and screwdriver bits line up in a row where you can see them. ",
"The width of the board, when attached to a flat surface, allows you to pick and replace the ones that you need.",
"\n\nStoring Pipe\n\nWith two pieces of latticework suspended from the studs in your workshop, you have slots that are the perfect size for holding your copper or PVC pipe. ",
"You can see each length, and you can choose the one you want without moving the pieces that are in your way.",
"\n\nAnd there you have it! ",
"You’ve just provided yourself a large, easy and convenient space for working on whatever project you desire. ",
"So rev up your chainsaw and start working!",
"\n\nTuesday, March 10, 2015\n\nIf you’re one of our friends on the East Coast or in the Midwest, we do not envy the harsh Winter you've been having this year. ",
"While we can all keep our fingers crossed that Spring will show its sunny face any day now, there are certain things you can do to make the snow a little more bearable. ",
"Chief among them: snow removal! ",
"You may not have control over the weather, but that doesn’t mean you have to put up with cold, soggy feet and pants any time you want to walk out your door or use the driveway. ",
"Below are a few snow removal tips so you can keep your walkways, driveways, and home safe and snow-free.",
"\n\nUse the Proper Equipment\n\nDecide what equipment is best for your physical abilities as well as amount of snow and the size and type of your property. ",
"A manual shovel may be appropriate if you are healthy and the snowfalls in your area are fairly light; or if you only have a small pathway to clear up. ",
"An electric shovel, on the other hand, is a great choice for people with physical limitations and small properties in areas with light snowfalls.",
"\n\nLooking at some heavy-duty cleanup? ",
"Snow blowers come in various sizes and power levels based on the amount and heaviness of snow they can remove, and they are by far the best option for large driveways or walkways and heavy snowfall. ",
"Also, they’re pretty fun to use. ",
"Just make sure you get your earplugs out, and for the love of all that is sane, no 7am snow-blowing!",
"\n\nHow to Protect Yourself\n\nOnce you have the appropriate equipment, take the proper precautions to protect yourself, your neighbors and your property. ",
"If you have any physical limitations, use a snowblower instead of a shovel, or hire someone to clear your snow for you (even if you didn’t have physical limitations, we’d understand if you want to outsource this task to an enterprising young teenager). ",
"Other safety tips include:\n\nLook the part. ",
"Wear warm clothes and outerwear along with the proper gloves and boots to get the job done. ",
"A pair of thick worker’s gloves will help you stave off blisters, as the repetitive motion of shoveling snow can often create a few. ",
"Layer your outfit so that if you get too hot, you can remove a few layers as needed. ",
"And finally, wear sunglasses and sunscreen. ",
"It may sound a little torturous to slather yourself in that fresh, sunny sunscreen smell and remind yourself of the day at the beach you’re not having, but snow is highly reflective of UV rays; dangerous sunburns can and do happen. ",
"Similarly, it it’s sunny out and the snow is particularly reflective, then staring at it for prolonged periods of time can cause serious damage to your eyes. ",
"If it helps, grab a margarita and try to pretend you’re on a tropical vacation; if nothing else, your neighbors could use a little comic relief!",
"\n\nUse the right technique. ",
"The proper way to lift snow with a shovel is to bend at your knees and turn without twisting. ",
"Do not twist. ",
"Do not twist! ",
"This can seriously tweak your back.",
"\n\nLighten your load. ",
"Don't wait until the snow gets too deep or heavy. ",
"Shovel several times during the storm or in layers, and don't overload your shovel.",
"\n\nInspect your machinery. ",
"Make sure your snow blower is in optimal condition, and repair it if necessary. ",
"We happen to have a wide array of Tecumseh parts, a leading brand in snow blower engines.",
"\n\nHow to Be a Good Neighbor\n\nThese points should be fairly intuitive, but they’re worth mentioning. ",
"Make sure that as you perform your routine cleanup, you respect your neighbors and their needs by adhering to the following guidelines:\n\nObey the rules. ",
"If your community has a rule for removing snow within a certain time frame, follow it. ",
"Even if they don’t, use your good judgement on this one. ",
"We know you need to get out of your driveway, but early morning really isn’t a good time to bust out the snow blower. ",
"Plan ahead the evening before if you can; and if there was a fresh snowfall overnight and you absolutely must be at the office at 8am, see if you can make do with a shovel and take care of the rest later. ",
"Strategically park your car as close to the edge of the driveway as possible to make getting out easier.",
"\n\nKeep it to yourself. ",
"Never transfer snow from your property to your neighbors' properties, and avoid throwing it into the street or onto the sidewalk. ",
"Otherwise you’re likely to start a snow battle, which is only fun in Calvin and Hobbes cartoons. ",
"So where should the snow go, you ask? ",
"Unfortunately, into the parts of your yard that you’re not using. ",
"Don’t worry; you’ll get your yard back eventually.",
"\n\nTreat icy surfaces safely. ",
"Use de-icers that aren't toxic and won't hurt pets' paws. ",
"Gravel is a safe way to improve traction without chemicals, and Calcium magnesium acetate is a more environmentally-friendly choice than the popular, inexpensive rock salt. ",
"On an unrelated note, while we’re on the topic of pet safety: never, ever leave antifreeze outside. ",
"Both cats and dogs are drawn to the sweetness of this incredibly toxic substance.",
"\n\nGood luck! ",
"Spring is just around the corner, and we’ll be ready for it with plenty of fresh blog posts about fun outdoor projects and construction ideas. ",
"You’ll be trading in your snow blower for a lawn mower before you know it!",
"\n\nStay Connected\n\nGet These25 brilliant ideas for your Small Engine Business Success in our eBook: \"How to Add Revenue to Your Outdoor Power Equipment Store or Repair Shop\".",
"\n\nGet the whole 19 page ebook for free.",
"\n\nHope the ebook helps!",
"\n\nEmail Address\n\nFirst Name\n\nBy submitting this form, you are granting: HLSUPPLY, 873 Hull Rd, Unit 6, Ormond Beach, Florida, 32174, United States, permission to email you. ",
"You may unsubscribe via the link found at the bottom of every email. (",
"See our Email Privacy Policy for details.) ",
"Emails are serviced by Constant Contact."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006198430783115327,
0.000794047606177628,
0.0008125973399728537,
0.0006439528078772128,
0.0007268430781550705,
0.0020512393675744534,
0.000823677284643054,
0.0011256823781877756,
0.0006698814686387777,
0.0006669809808954597,
0.0006197477341629565,
0.0006996504962444305,
0.000934592098928988,
0.01242696214467287,
0.0015493924729526043,
0.03881976008415222,
0.0009193586884066463,
0.002989640459418297,
0.0006822964060120285,
0.001372825470753014,
0.0006774969515390694,
0.0010408606613054872,
0.0006166003295220435,
0.3247142732143402,
0.0007309239008463919,
0.0006122047198005021,
0.0010909956181421876,
0.0822736918926239,
0.0008189732325263321,
0.0011864060070365667,
0.0005440491368062794,
0.0006294220220297575,
0.0006407593027688563,
0.0012967600487172604,
0.0006378866382874548,
0.07410087436437607,
0.014788866974413395,
0.005747561808675528,
0.006542038172483444,
0.0012261302908882499,
0.002427686471492052,
0.002542284782975912,
0.0007137001375667751,
0.036389585584402084,
0.0036055175587534904,
0.0012138423044234514,
0.000956404663156718,
0.010134845040738583,
0.017170213162899017,
0.03389892354607582,
0.5203064680099487,
0.005065988749265671,
0.02131349965929985,
0.002232528291642666,
0.0009014432434923947,
0.003095214953646064,
0.000878295861184597,
0.0005238296580500901,
0.0007927461410872638,
0.0008595162071287632,
0.000777513487264514,
0.07309675216674805,
0.0007790089002810419,
0.012426458299160004,
0.02312825806438923,
0.0034696401562541723,
0.0579640157520771,
0.0012180865742266178,
0.05591391399502754,
0.4259461760520935,
0.000594697892665863,
0.003416510997340083,
0.0006240478833205998,
0.0011170214274898171,
0.002142340876162052,
0.0007107228739187121,
0.0005493440548889339,
0.25887975096702576,
0.0005466830334626138,
0.0012092693941667676,
0.000672749534714967,
0.0005664106574840844,
0.0005536410608328879,
0.0005604110192507505,
0.000612597563304007
] | 0.025675 | 85 |
[
"Brain tissue oxygenation and cerebral perfusion pressure thresholds of ischemia in a standardized pig brain death model.",
"\nNeurointensive care of traumatic brain injury (TBI) patients is currently based on intracranial pressure (ICP) and cerebral perfusion pressure (CPP) targeted protocols. ",
"Monitoring brain tissue oxygenation (BtipO2) is of considerable clinical interest, but the exact threshold level of ischemia has been difficult to establish due to the complexity of the clinical situation. ",
"The objective of this study was to use the Neurovent-PTO (NV) probe, and to define critical cerebral oxygenation- and CPP threshold levels of cerebral ischemia in a standardized brain death model caused by increasing the ICP in pig. ",
"Ischemia was defined by a severe increase of cerebral microdialysis (MD) lactate/pyruvate ratio (L/P ratio > 30). ",
"BtipO2, L/P ratio, Glucose, Glutamate, Glycerol and CPP were recorded using NV and MD probes during gradual increase of ICP by inflation of an epidural balloon catheter with saline until brain death was achieved. ",
"Baseline level of BtipO2 was 22.9 ± 6.2 mmHg, the L/P ratio 17.7 ± 6.1 and CPP 73 ± 17 mmHg. ",
"BtipO2 and CPP decreased when intracranial volume was added. ",
"The L/P ratio increased above its ischemic levels, (>30)when CPP decreased below 30 mmHg and BtipO2 to <10 mmHg. ",
"A severe increase of ICP leading to CPP below 30 mmHg and BtipO2 below 10 mmHg is associated with an increase of the L/P ratio, thus seems to be critical thresholds for cerebral ischemia under these conditions."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.015973873436450958,
0.0008562057046219707,
0.0006460065487772226,
0.007291534449905157,
0.0006793762440793216,
0.0027322189416736364,
0.0007633966743014753,
0.0006104963249526918,
0.0007854342693462968,
0.0007574137998744845
] | 0.00311 | 10 |
[
"Q:\n\nAngular RxJS - fail to make cold observable hot\n\nCode:\nconst cold = new Observable((observer: Observer<any>) => {\n observer.next(Math.random());\n});\n\nconst hot = cold.pipe(share());\nhot.subscribe(a => console.log('a: ' + a));\nhot.subscribe(b => console.log('b: ' + b));\n\n}\nExpected result - a and b has the same value:\n// a: 0.17919353301075858\n// b: 0.17919353301075858\nActual result - only get value of a in the browser console:\n// a: 0.07958207844185083\nAny idea?",
"\n\nA:\n\nYou could try shareReplay(1) to replay last value\nhttps://www.learnrxjs.io/learn-rxjs/operators/multicasting/sharereplay\nAlso, a good article: https://itnext.io/the-magic-of-rxjs-sharing-operators-and-their-differences-3a03d699d255\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0010634004138410091,
0.0007011921261437237
] | 0.000882 | 2 |
[
"Editor: This correspondence is in response to the cartoon...\n\nOctober 20, 1985\n\nEditor: This correspondence is in response to the cartoon which appeared on Sept. 15. ",
"Publishing this cartoon displayed a lack of sensitivity and knowledge about mental illness.",
"\n\nThe cartoon portrayed persons diagnozed as schizophrenic in a bizarre, misleading manner. ",
"Schizophrenia is a disease that is not characterized by a dual personality. ",
"Persons suffering from this illness do not appear different from other individuals.",
"\n\nI urge you to scrutinize more closely the material included in publications by The Orlando Sentinel. ",
"A greater degree of sensitivity will minimize the perpetuation of myths in our society that are detrimental to the image of minority groups."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006606895476579666,
0.005154955200850964,
0.016462044790387154,
0.004653959069401026,
0.0022316414397209883,
0.0006009635399095714,
0.001012010732665658
] | 0.004397 | 7 |
[
"Q:\n\n502 error after adding application to a Django project running on nginx and gunicorn\n\nI am trying to add an application to an existing Django project, but once I have done it I get a 502 error.",
"The server is running Ubuntu. ",
"I don't think it has to do with the applications code because I got it running on the django development server. ",
"It goes away when I take out the app's name from settings.py and restart gunicorn. ",
"\nHere's a part of the log\n2011/07/15 01:24:45 [error] 16136#0: *75593 connect() failed (111: Connection refused) while connecting to upstream, client: 24.17.8.152, server: staging.site.org, request: \"GET / HTTP/1.1\", upstream: \"http://127.0.0.1:8020/\", host: \"staging.site.org\"\n\nHere's the nginx config file.",
"\nNginx Config File\nI'm not sure what other information is needed. ",
"Not sure where the gunicorn logs are located. ",
"My server admin skills are kind of lacking.",
"\n\nA:\n\nNginx isn't able to connect to your backend (gunicorn) or gunicorn is refusing the connection. ",
"You provided no details about the configuration so that's all the help you'll get. ",
"You are correct that the application code has nothing to do with it. ",
"It's a configuration error on your part.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0008200476877391338,
0.0014832407468929887,
0.0005838257493451238,
0.002112980931997299,
0.0007911116117611527,
0.0008420635131187737,
0.001226249965839088,
0.003389755729585886,
0.0038959600497037172,
0.0006165945087559521,
0.0006684751715511084,
0.0017665656050667167,
0.001995444530621171
] | 0.001553 | 13 |
[
"EXTERNLIB\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.12458150833845139
] | 0.124582 | 1 |
[
"A comparative study of clinical signs in fibromyalgia/fibrositis syndrome, healthy and exercising subjects.",
"\nPain threshold to pressure, skinfold tenderness, reactive skin hyperemia and tissue compliance were assessed in 60 subjects with fibromyalgia (FS) and 60 pain free [total control, (TC)] subjects comprising 30 normal controls (NC) and 30 exercising fit (FC) subjects. ",
"Pain threshold was significantly lower in FS than in TC (p = < 0.001) and NC (P = < 0.001). ",
"Skinfold tenderness was present in 95% of FS and 33% of the NC but was absent in all FC. ",
"In patients this tenderness was present both in painful and nonpainful sites, and when positive was significantly (P = < 0.001) more painful than in controls. ",
"Reactive skin hyperemia to pressure was significantly (p = < 0.001) increased in patients with FS compared to TC, but not to NC. ",
"Tissue compliance at trapezius, thoracic and lumbar locations was significantly (p = < 0.001) lower in patients than in any other controls. ",
"The fit subjects significantly differed from the unfit for pain threshold (p = < 0.001), reactive skin hyperemia (p = < 0.001), tissue compliance at right trapezius (p = < 0.001) and right thoracic (p = < 0.001) levels, and for the skinfold test (p = < 0.01). ",
"These 4 clinical signs could differentiate patients from controls with a mean accuracy of 86%. ",
"Our study indicates that there are clinical signs, apart from the tender points, which are abnormal in FS that appear to be useful as objective signs in the assessment of patients with FS, whether for diagnostic, therapeutic or research purposes."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.000681823177728802,
0.0007916816393844783,
0.001069166581146419,
0.0007238613907247782,
0.0006634825840592384,
0.0006435803952626884,
0.0006630198913626373,
0.0007825430948287249,
0.0006057725404389203,
0.0005684678326360881
] | 0.000719 | 10 |
[
"“He wrote about stuff that touched people. ",
"He was able to make people laugh a lot and make people cry sometimes,” Batz Jr. said. “",
"There was something about his writing that did that.”",
"\n\nThe stories Batz pursued allowed him to experience the lofty and low – from piloting a Goodyear blimp, or spending a night in jail. ",
"After the death of his mother, Batz wrote a series of on Alzheimer’s disease that was nominated for the Pulitzer Prize. ",
"Based on the work he wrote “Long Goodbyes,” a play twice performed by the Brookville Community Theatre.",
"\n\nBatz also passed the craft forward, teaching journalism for more than 24 years as an adjunct professor at the University of Dayton.",
"\n\n“He really was a newspaperman’s newspaperman,” said Batz Jr., who followed his father’s footsteps and is now an editor and writer at the Pittsburgh Post-Gazette.",
"\n\n“When I was a kid, I saw how much fun he was having and how good he was at it,” said Batz Jr.\n\nFuneral arrangements are pending."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0006295812781900167,
0.0013044538209214807,
0.0006908521172590554,
0.0025958686601370573,
0.0009602174395695329,
0.0006515401764772832,
0.0006334414356388152,
0.0007544908439740539,
0.000584940891712904
] | 0.000978 | 9 |
[
"When President Donald Trump tapped Neil Gorsuch to replace the late Justice Antonin Scalia on the Supreme Court, liberal and conservative legal analysts scoured his record and determined the Colorado appellate judge – described as brilliant, genial, ambitious and really, really conservative – would definitely move the court to the right.",
"\n\nJudging by their reactions as the court adjourns for the summer, both the left and right agree: In roughly 11 weeks on the bench, Justice Gorsuch has exceeded that expectation. ",
"Whether that's a good thing, however, depends on where one stands.",
"\n\nLiberals, still seething that Senate Republicans blocked former President Barack Obama from replacing Scalia, say Gorsuch is further to the right than they expected, and far from the neutral jurist he claimed to be at his confirmation hearings. ",
"They note he's formed an early alliance with Justices Clarence Thomas and Samuel Alito, the court's two most conservative members, and has already planted his flag in arch-conservative positions on the death penalty, consumer rights gun rights and religious freedom.",
"\n\n\"Although Neil Gorsuch took part only in the final few cases argued this term, his presence was enough to confirm Americans' fears, even before those case opinions were released,\" People for the American Way argues in its year-end Supreme Court report.",
"\n\nConservatives, however, can barely contain their glee: Gorsuch, they say, has been a strong conservative and a \"textualist\" sticking to literal interpretations of the Constitution. ",
"What has them even more excited, however, is the probability that Trump could nominate at least one more justice like him, locking in an overwhelming, decades-long, 6-3 conservative majority.",
"\n\nHis early performance \"says a lot about both what Gorsuch will be like as a Supreme Court Justice and what the President can be counted on to do as more High Court vacancies occur,\" according to a report by the conservative Committee for Justice. \"",
"Conservatives hoping for a solid conservative majority on the Court in the near future had good reason to cheer today.\"",
"\n\nNeutral observers, however, have a warning when assessing the first two and a half months of the 49-year-old judge's lifetime tenure: Don't believe the hype.",
"\n\nWhile the justice's conservative philosophy is, as expected, in the mold of Scalia, and he'll be a reliable vote for the right, Gorsuch hasn't transformed the court into a safe haven for the right. ",
"Justice Anthony Kennedy, a relatively moderate conservative who occasionally tilts to the left on social issues, is still the court's lynchpin. ",
"For now.",
"\n\n\"He has done a wonderful job and lived up to the expectations of those, like me, who supported him,\" says Georgetown University constitutional law professor Randy T. Barnett, adding that Gorsuch's first written majority opinion, in a case that determined the boundaries of consumer rights and debt collection, was decided on a unanimous vote. \"",
"Yes, he's been very promising, but he hasn't changed the game.\"",
"\n\nRick Hasen, a law professor at University of California-Irvine and an esteemed Supreme Court analyst, has a more nuanced view.",
"\n\n\"The early signs from Justice Neil Gorsuch , who joined the Court in April, show that he will hew to the late Justice Scalia's brand of jurisprudence, both in his conservatism and his boldness,\" Hasen, who produces the Election Law blog, wrote in an essay published Tuesday in The Los Angeles Times.",
"\n\n\"Setting aside his emerging alliance with Thomas and Alito, Gorsuch has already staked out some positions just for himself,\" Hasen wrote. ",
"In the case of a man who witnessed his friend commit a murder but was convicted as an accomplice, Hasen wrote, Gorsuch \"found himself disagreeing with Thomas and Roberts and siding with a criminal defendant. '",
"A plain legal error infects this judgment – a man was wrongly sentenced to 20 years in prison under a defunct statute,' Gorsuch wrote.\"",
"\n\nAdam Feldman, who teaches law and political science at University of Southern California and writes the Empirical SCOTUS blog , says Gorsuch \"is almost exactly as advertised,\" a brilliant legal thinker who hews to conservative orthodoxy. \"",
"It seems to me people are making more of a fuss right now [about Gorsuch's influence] than maybe necessary.\"",
"\n\nThough the excitement on the right and dread on the left about the newest justice \"is probably going to be warranted\" in the long run, Feldman says, the conclusions reached about him so far seem \"based on small assumptions and small moves. ",
"There's an expectation that he will be this kind of furthest on the right of a conservative court. ",
"I just don't see the evidence for that yet.\"",
"\n\nGiven the politics surrounding his nomination and confirmation, analysts say, it's not surprising that Gorsuch's first few months on the bench have been the equivalent of a Rorschach test for the right and left.",
"\n\nThe justice was nominated for the seat after Senate Republicans kept former President Barack Obama from replacing Scalia, who died in February 2016, and pulling the court to the left. ",
"Then, when Senate Democrats objected to Gorsuch, Senate Majority Leader Mitch McConnell stripped them of the power to filibuster, ensuring Gorsuch would replace Scalia – but also preventing Democrats from stopping any of Trump's future nominees on the high court.",
"\n\nWith that as a backdrop, both progressive and conservative activists see Gorsuch as the template Trump will use to remake the high court, should he get the opportunity.",
"\n\nFor the right, that means the possibility the Supreme Court would become a conservative bulwark against legal challenges to their agenda, which includes lower taxes, strong national security, less government and more freedom. ",
"While the left fears the court is in danger of becoming a powerful tool that could dismantle legalized abortion, undo African-Americans' hard-won civil rights gains, and take apart gays and lesbians' fight for equal treatment.",
"\n\nThe conservative stands Gorsuch took this session, in cases involving gun control, campaign finance reform and use of a controversial drug cocktail in executions, \"likely was a foretaste of what lies ahead,\" according to the People for the American Way report. ",
"And with the court set to take up potentially explosive cases involving gay rights and political redistricting, PFAW warns, Gorsuch's early tenure \"was, with few exceptions, the calm before that storm.\"",
"\n\nAlliance for Justice, a progressive organization, saw warning signs in Gorsuch's opinion in Trinity Lutheran Church v. Comer, in which the court voted 5-4 to allow a Missouri church-based school participate in a state-funded grant program to refurbish playgrounds with recycled tires – a case that tested the Constitutional barrier between church and state.",
"\n\nNot only did Gorsuch vote for a ruling \"which could pave the way for the elimination of critical safeguards against diverting taxpayer money to private and religious schools,\" writes AFJ in its Supreme Court report, \"he even wrote a concurrence, joined only by Justice Thomas, claiming the Court should have gone further. ",
"This is a critical reminder that Supreme Court appointments have far-reaching consequences for our democracy.\"",
"\n\nBut Feldman, the Empirical SCOTUS blogger, says the left's view of Gorsuch as a wolf in wolf's clothing – and the right's view of him as a paragon of Supreme Court jurisprudence which should be replicated with the next vacancy – is premature.",
"\n\n\"We have information [about him] coming from a lot of different directions, that the court may be moving in a direction that we expected,\" he said. \"",
"I want to see more and to get a feel for who he is [as a justice]. ",
"Are the decisions swayed by personal preference or are they grounded in something that is visibly legal doctrine?\""
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.000716264417860657,
0.000570953416172415,
0.0006183163495734334,
0.010985657572746277,
0.0007270024507306516,
0.0005677969311363995,
0.00871081929653883,
0.0008121394203044474,
0.0006212421576492488,
0.000632399576716125,
0.0007192440098151565,
0.0007626604638062418,
0.0008780076168477535,
0.0006870047654956579,
0.000573862693272531,
0.000589552044402808,
0.000597881618887186,
0.0006161315250210464,
0.0006711863679811358,
0.0009027962223626673,
0.0012342133559286594,
0.0007568337023258209,
0.0005739745683968067,
0.0006065735360607505,
0.0008129230118356645,
0.0006541237817145884,
0.0007567352731712162,
0.0008774411398917437,
0.0025886637158691883,
0.0006164592923596501,
0.000977593008428812,
0.02693318948149681,
0.0006532235420309007,
0.0010221481788903475,
0.0007083294913172722,
0.0007763803005218506,
0.0006153279100544751,
0.0024324744008481503,
0.0005488952738232911,
0.0005769501440227032,
0.0006919940933585167
] | 0.001887 | 41 |
[
"Q:\n\nNumber of such five digit numbers formed of $0,1,2,3,4,5$ which are divisible by $6$ without repetition\n\nI came across the question in the picture on the net. ",
"I couldn't figure\nout the solution given. ",
"But what I got is total number of such $5$\ndigit numbers using the given digits will be $5.5!$. Half of them will\nbe divisible by $2$. And $1/3$ of them will be divisible by $3$. (Not sure though) What's next? ",
"I couldn't decipher what's written after that...\nPlease try to use the permutations and combinations approach if possible:\n\nA $5$-digit number is formed by using the digits $0$, $1$, $2$, $3$,\n $4$ & $5$ without repetition. ",
"The probability that the number is\n divisible by $6$ is:\n(A) $8\\%$\n(B) $17\\%$\n(C) $18\\%$\n(D) $36\\%$\nAns: (C)\nHint: Number should be divisible by $2$ and $3$.\n$n(S) = 5 \\cdot 5!$; $n(A)$: reject '$0$' $= 2 \\cdot 4!$\nreject '$3$' $= 4! ",
"+ 2 \\cdot 3 \\cdot 3!$\nTotal $n(A) = 3 \\cdot 4! ",
"+ 6 \\cdot 3! ",
"= 18 \\cdot 3!$\n$\\therefore p = \\frac{18 \\cdot 3!}{5 \\cdot 5!} ",
"= 18\\%$\n\nA:\n\nI. A number $n$ is divisible by $6$ if it is divisible by both $2$ and $3$.\nII. ",
"A number $n$ is divisible by $2$ if the rightmost digit is even.",
"\nIII. ",
"A number $n$ is divisible by $3$ if the sum of its digits is divisible by $3$. \nWe have access to six digits, $\\{0,1,2,3,4,5\\}$, which sum to $15$. We need a $5$-digit number. ",
"This means we must remove one digit such that the resulting digit-sum is divisible by $3$.\nWe can do this by either eliminating the $0$ (which results in the digit-sum $15$) or eliminating the $3$ (which results in the digit-sum $12$). ",
"This will allow us to create numbers that are divisible by $3$ no matter how we order the digits. ",
"\nYour picture/solution is counting up the possible even numbers for both cases after the divisibility-by-$3$ rule has been satisfied by rejecting a particular digit from the set.",
"\n\nA:\n\nWe try to count how many five-digit numbers formed with digits $0,1,2,3,4,5$ are divisible by six.",
"\nTo begin, we note three important facts:\n\nTo be a five-digit number, the first digit must not be a zero (otherwise it would technically be a four-digit number. ",
" $01234$ is a four digit number)\nTo be divisible by six, the number must be divisible by two, so the final digit must be either $0,2,$ or $4$\nTo be divisible by six, the number must be divisible by three, so the sum of the digits must add up to a multiple of three. ",
" The only way for this to occur with the desired digits and no repetition of digits is if exactly one of $0$ or $3$ is used. ",
" (the proof of which follows from modular arithmetic)\n\nSo, putting this information together, we start counting.",
"\nCase 1: $0$ is not used\n\nPick the final digit: It can either be a two or a four. ",
" - $2$ choices\nPick how the rest of the digits are arranged. ",
" - $4!$ choices\n\nCase 2a: $3$ is not used and $0$ is at the end\n\nPick how the rest of the digits are arranged. ",
" - $4!$ choices\n\nCase 2b: $3$ is not used and $0$ is not at the end\n\nPick the final digit: It can be either a two or a four. ",
" -$2$ choices\nPick the location of the zero. ",
" It cannot be at the start or the end. ",
" $3$ choices\nPick how the rest of the digits are arranged. ",
" $3!$ choices\n\nThere are then a total of $2\\cdot 4!+4!+2\\cdot 3\\cdot 3! ",
"= 108$ possible five-digit numbers satisfying the conditions.",
"\nThe total number of five-digit numbers that can be created with those available digits will be $5\\cdot 5!=600$. (Arrange all six digits in a row, the final digit is unused. ",
" Remove the \"bad\" arrangements where zero is the leading digit for $6!-5! ",
"= 5\\cdot 5!$)\nThe probability that a five-digit number formed from those digits is divisible by six is then $\\frac{108}{600}=0.18$\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0007361082243733108,
0.0006848777993582189,
0.00100016372743994,
0.0006954932468943298,
0.09826827794313431,
0.3411968946456909,
0.06994684785604477,
0.28792038559913635,
0.012245455756783485,
0.0016792045207694173,
0.0012429648777469993,
0.0014006691053509712,
0.0011548497714102268,
0.0007468106923624873,
0.0006563375354744494,
0.0007762378663755953,
0.0005692474660463631,
0.0008882987312972546,
0.0006732296897098422,
0.0005869499291293323,
0.0006873564561828971,
0.0006520815659314394,
0.0008502840064466,
0.0008692187839187682,
0.0008154518436640501,
0.0006977999582886696,
0.0006648565176874399,
0.04084654524922371,
0.0006516596768051386,
0.0007220174884423614,
0.0029370246920734644,
0.016614621505141258
] | 0.027815 | 32 |
[
"function init() {\n\n // use the defaults\n var stats = initStats();\n var renderer = initRenderer();\n var camera = initCamera();\n // position and point the camera to the center of the scene\n // camera.position.set(-80, 80, 80);\n // camera.lookAt(new THREE.Vector3(60, -60, 0));\n\n var scene = new THREE.Scene();\n initDefaultLighting(scene);\n var groundPlane = addLargeGroundPlane(scene)\n groundPlane.position.y = -30;\n\n // call the render function\n var step = 0;\n\n klein = function (u, v, optionalTarget) {\n\n var result = optionalTarget || new THREE.Vector3();\n\n u *= Math.",
"PI;\n v *= 2 * Math.",
"PI;\n\n u = u * 2;\n var x, y, z;\n if (u < Math.",
"PI) {\n x = 3 * Math.cos(u) * (1 + Math.sin(u)) + (2 * (1 - Math.cos(u) / 2)) * Math.cos(u) * Math.cos(v);\n z = -8 * Math.sin(u) - 2 * (1 - Math.cos(u) / 2) * Math.sin(u) * Math.cos(v);\n } else {\n x = 3 * Math.cos(u) * (1 + Math.sin(u)) + (2 * (1 - Math.cos(u) / 2)) * Math.cos(v + Math.",
"PI);\n z = -8 * Math.sin(u);\n }\n\n y = -2 * (1 - Math.cos(u) / 2) * Math.sin(v);\n\n return result.set( x, y, z );\n };\n\n radialWave = function (u, v, optionalTarget) {\n\n var result = optionalTarget || new THREE.Vector3();\n var r = 50;\n\n var x = Math.sin(u) * r;\n var z = Math.sin(v / 2) * 2 * r;\n var y = (Math.sin(u * 4 * Math.",
"PI) + Math.cos(v * 2 * Math.",
"PI)) * 2.8;\n\n return result.set( x, y, z );\n };\n\n // setup the control gui\n var controls = new function () {\n this.appliedMaterial = applyMeshNormalMaterial\n this.castShadow = true;\n this.groundPlaneVisible = true;\n this.slices = 50;\n this.stacks = 50;\n\n this.renderFunction = \"radialWave\"\n\n this.redraw = function () {\n redrawGeometryAndUpdateUI(gui, scene, controls, function() {\n switch (controls.renderFunction) {\n case \"radialWave\":\n var geom = new THREE.ParametricGeometry(radialWave, controls.slices, controls.stacks);\n geom.center();\n return geom;\n \n case \"klein\":\n var geom = new THREE.ParametricGeometry(klein, controls.slices, controls.stacks);\n geom.center();\n return geom;\n\n }\n });\n }\n };\n var gui = new dat.",
"GUI();\n gui.add(controls, 'renderFunction', [\"radialWave\", \"klein\"]).onChange(controls.redraw);\n gui.add(controls, 'appliedMaterial', {\n meshNormal: applyMeshNormalMaterial, \n meshStandard: applyMeshStandardMaterial\n }).onChange(controls.redraw)\n \n gui.add(controls, 'slices', 10, 120, 1).onChange(controls.redraw);\n gui.add(controls, 'stacks', 10, 120, 1).onChange(controls.redraw);\n gui.add(controls, 'castShadow').onChange(function(e) {controls.mesh.castShadow = e})\n gui.add(controls, 'groundPlaneVisible').onChange(function(e) {groundPlane.material.visible = e})\n\n var step = 0;\n controls.redraw();\n render();\n \n function render() {\n stats.update();\n controls.mesh.rotation.y = step+=0.005\n controls.mesh.rotation.x = step\n controls.mesh.rotation.z = step\n\n // render using requestAnimationFrame\n requestAnimationFrame(render);\n renderer.render(scene, camera);\n }\n}"
] |
{
"pile_set_name": "Github"
}
|
[
0.0008516888483427465,
0.00129497773014009,
0.009809720329940319,
0.11279550194740295,
0.061973948031663895,
0.0011467508738860488,
0.0008067211019806564,
0.0007856161682866514
] | 0.023683 | 8 |
[
"/*\n * Copyright 2018 Google LLC.",
"\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n * use this file except in compliance with the License. ",
"You may obtain a copy of\n * the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ",
"See the\n * License for the specific language governing permissions and limitations under\n * the License.",
"\n */\n\npackage com.test;\n\npublic class HelloWorld {\n public static void main(String[] args) {\n System.out.println(\"Hello world\");\n }\n}\n"
] |
{
"pile_set_name": "Github"
}
|
[
0.0007854207651689649,
0.0005905283032916486,
0.000559094303753227,
0.0005588483763858676,
0.0008580175926908851
] | 0.00067 | 5 |
[
"Just another WordPress.com site\n\nMain menu\n\nPost navigation\n\nThe Mortar that binds us together\n\nby Rowley, Mike on 2/7/2013 6:17 PM\nIt seems to me that when we act as a business we always come back to organizing ourselves in a hierarchical manner – a pyramid – echoing the stability and strength of those ancient structures. ",
"Let me offer an observation about such grand buildings: it is the mortar, not the bricks, which contains the true power. ",
"It fills the gaps, binds the bricks, and really holds the assembly together.",
"\nIn our organization, some of our top talent recognizes this. ",
"They act more like mortar than bricks. ",
"They socialize and network with as many people as they can, and really hold our organization together. ",
"These people can work across departments and boundaries to connect the blocks and bricks that support our company. ",
"The problem is that we don’t have enough of these people, especially at lower levels in our organization!",
"\nThink about it: who can order support, development, and sales to work together at the mid- and small-team levels in our organization? ",
"No one. ",
"If there is a problem between departments, even for a very small client concern, it has to be escalated to the highest levels to get any work done. ",
"Not only does this waste the talents of our leaders, it wastes their time, too. ",
"They can’t focus on building strong teams because they are always putting out fires.",
"\nMy idea would be to form many cross-functional teams between departments to become the mortar in our organization. ",
"They would work at the entry, mid, and enterprise levels of scope to foster efficient working relationships with other departments, break down the barrier of outmoded procedures and encourage personal responsibility across our service areas. ",
"We all have our specialties, but we are not using them as a team. ",
"In my mind every employee would remain part of a traditional department, but also be on a customer service team with members of other departments. ",
"Each team would address client issues together. ",
"These interdepartmental teams would be assigned to specific clients so they can grow the relationships to new levels."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005894337664358318,
0.0005799419013783336,
0.0005537659162655473,
0.0005546633619815111,
0.010917836800217628,
0.0006445883773267269,
0.0005724805523641407,
0.006138450000435114,
0.0005799606442451477,
0.00218493165448308,
0.0005499678081832826,
0.0027304603718221188,
0.0020668506622314453,
0.0005764905945397913,
0.0005806473782286048,
0.0006616204627789557,
0.0006480501615442336,
0.0005498050595633686,
0.0005698606837540865
] | 0.001697 | 19 |
[
"Our Story\n\nHow #walkthetalk came to be\n\nGreengrass and O2 were the two sponsors who were eager to work together on a meaningful challenge in the arena of gender equality. ",
"In September 2016 we took this challenge to marketing magazine The Drum’s Do It Day where some of the world’s biggest brands and charities came together with volunteers from the creative industry to prove that marketing can change the world.",
"\n\nThe challenge was how to engage men in the workplace to actively promote gender equality and understand the benefits it brings to both men and women. ",
"Our rallying cry became: ‘It’s not just a women’s issue, it’s an opportunity for all’.",
"\n\nWhat we hope to achieve\n\nStart small\n\nThe ambition for the campaign is to encourage men to raise their hand – or more accurately, bare their feet – and voice their wish for a more gender-equal workplace. ",
"To challenge the status quo. ",
"We recognised that many men understand that equality at work brings benefits for all, but unless they speak out about what they want, little progress will be made.",
"\n\nThink big\n\nThe hope is that the #walkthetalk campaign will be a catalyst for change and spur a movement of men who want to be champions of gender equality. ",
"This movement will trigger positive change for themselves and others in their place of work leading to a better work-life balance for both men and women. ",
"We’ll follow the tweeted feet of the campaign, in the hope that a year later we’ll be able to tell stories of change.",
"\n\nMen who know\n\nMen who’re aware that gender bias exists but don’t feel they can say or do much about it. ",
"The #walkthetalk campaign is a way to start the conversation, and get friends and colleagues talking about gender equality where they work and how they can tackle it.",
"\n\nMen who don’t know (yet)\n\nMen who’re unaware, or unsure of how gender equality benefits men as well as women. ",
"The #walkthetalk campaign raises the conversation on gender bias in their workplace giving them the opportunity to talk about it and explore what it means.",
"\n\nWomen\n\nThis campaign is designed to drive new conversations and deliver positive change for women with regard to gender equality in the workplace. ",
"It also raises awareness of the role men need to play in the debate and how they are able to benefit from a more equal working environment."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005842404789291322,
0.0005829455913044512,
0.0010402168845757842,
0.008042764849960804,
0.0016007785452529788,
0.0007794949342496693,
0.0005377744091674685,
0.0020913442131131887,
0.0008814146276563406,
0.0005913040949963033,
0.0011989440536126494,
0.0006539314636029303,
0.002229720586910844,
0.0006612807046622038,
0.0128121767193079,
0.0005516551318578422
] | 0.002177 | 16 |
[
"\"The mighty claws of these crabs are useful weapons to deter predators and competitors,\" say scientists from the Okinawa Churashima Foundation.",
"\n\n\"In summary, coconut crabs have the ability to exert the greatest force among almost all terrestrial animals.\"",
"\n\nCoconut crabs are well adapted to life on land.",
"\n\nUnlike most crabs, they only return to the sea to lay their eggs.",
"\n\nThey can also climb trees and cut coconuts down.",
"\n\nDespite their size and strength, little is known about coconut crabs and whether or not they are a threatened species.",
"\n\n'Monstrous'\n\nCharles Darwin described the coconut crab as of \"monstrous size\" when he saw them on the Cocos (Keeling Islands) in the Indian Ocean during the voyage of the Beagle.",
"\n\nHe wrote: \"To show the wonderful strength of the front pair of pincers, I may mention that Captain Moresby confined one in a strong tin box, which had held biscuits, the lid being secured with wire; but the crab turned down the edges and escaped.",
"\n\n\"In turning down the edges it actually punched many small holes quite through the tin!\""
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0008325136150233448,
0.000592739088460803,
0.0005945394514128566,
0.0025093930307775736,
0.016338633373379707,
0.0007141807582229376,
0.0006762384437024593,
0.0006887189811095595,
0.000920821912586689
] | 0.002652 | 9 |
[
"We are submitting this proposal in repsonse to PA-03-015, which uses the R21 mechanism. ",
"This program requires the utilization of existing human data, encourages new collaborations, does not require preliminary results, and limits the Research Plan to only 10 pages. ",
"Sudden cardiac arrest occurs approximately 250,000 times per year in the US, with most of these occurring in the out-of-hospital setting. ",
"The treatment of cardiac arrest follows guidelines established by the American Heart Association, known as advanced cardiac life support (ACLS). ",
"These guidelines use simplified universal treatment algorithms and have changed very little in the 30 years since their inception; and niether have survival rates. ",
"The focus of ACLS is on the treatment of ventricular fibrillation (VF), which was thought to be the predominant ECG rhythm but the incidence of which has been shown to be in decline. ",
"Pulseless electrical activity (PEA) and asystole are treated with the same algorithm. ",
"We believe that readily available, easily obtained clinical information can be useful in guiding clinical decision making. ",
"We will form a new collaboration between researchers at the University of Pittsburgh, the University of California, Los Angeles (UCLA), and the William Beaumont Hospital in Royal Oak, Michigan. ",
"Using existing data from each of the three centers, we will apply rigorous statistical model building techniques to explore new treatment schemes suggested by successful resuscitation outcomes. ",
"The specific aims of this proposal are to: (1) Derive prediction modeling of outcomes for victims of sudden cardiac death using readily available clinical information. (",
"2) Cross-validate the predictive modeling with a variety of techniques. ",
"These analyses will allow us to derive innovative treatment approaches to the treatment of out-of-hospital cardiac arrest, based on validated predictive modeling of successful outcomes. ",
"We will determine whether changes in the recommended sequence of resuscitation interventions can be ustified in certain clinical situations, and which should receive future prospective study."
] |
{
"pile_set_name": "NIH ExPorter"
}
|
[
0.0006460173171944916,
0.0005845649866387248,
0.0005686900112777948,
0.0006028356729075313,
0.0006317647057585418,
0.0010504517704248428,
0.0006248328718356788,
0.0005200528539717197,
0.000529994023963809,
0.0005350782885216177,
0.0005974062369205058,
0.0006296404171735048,
0.0005469030002132058,
0.0005344345117919147
] | 0.000614 | 14 |
[
"Mandarin Drive, Newbury\n\n£925 - Let Agreed\n\nAvailable at the end of April is this attractive coach house style apartment situated in a very popular residential area conveniently placed within walking distance to the town centre and train station. ",
"The accommodation comprises entrance hall with door leading into the garage with utility room. ",
"Stairs lead from the entrance hall up to a spacious lounge/diner with laminate flooring, kitchen with all appliances, inner hall, two double bedrooms one with fitted wardrobes and bathroom with shower over bath. ",
"EPC Rating C No HB, No DHSS, No Smoking, No Pets"
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0005399086512625217,
0.0006718058721162379,
0.001291341963224113,
0.027127500623464584
] | 0.007408 | 4 |
[
"So, the Republican Party elders had all weekend to digest what a Republican special counsel had to say about the conduct in office of a Republican President* of the United States without a Republican attorney general running interference for a Republican administration*. ",
"As you might have expected, many of them are Very Concerned. ",
"The most hilarious of them, as expected, was Susan Collins of Maine. ",
"From The Hill:\n\nSen. Susan Collins (R-Maine) said Friday that special counsel Robert Mueller's report gives an \"unflattering portrayal\" of President Trump, including an effort to oust the former FBI director from his special counsel role. “",
"He was not only very upset by the special counsel’s investigations, but tried several times through intermediaries to end it, and it is an unflattering portrayal of the President,\" Collins told Maine Public Radio.",
"\n\nStraight fire, that one.",
"\n\nSusan Collins strides bravely into the breach. ",
"Zach Gibson Getty Images\n\nAnd then there's John Kasich, who is terribly distressed about the whole situation and would like us to know that he told us so. ",
"Again, The Hill:\n\nKasich, who is mulling launching a Republican presidential primary challenge to Trump in 2020, tweeted that Trump's behavior in the Mueller report \"is more than disappointing.\" \"",
"It’s unacceptable & not behavior we should expect from our president. ",
"It's worse than I've seen in my career observing & working with presidents or public officials,\" he wrote.",
"\n\nI have a suggestion.",
"\n\nRun, dummy.",
"\n\nohn Kasich is saying much and doing little. ",
"Newsday LLC Getty Images\n\nThat there are not at least five Republican candidates challenging El Caudillo del Mar-a-Lago not only is a fine metric for judging the deep internal rot in that political party, but also a good measure of the limits of the Never Trumpers as allies in an election year. ",
"Let us stipulate the following two points: 1) It is the responsibility of the Democratic Party to do everything in its power to protect the institutions of our republic, and 2) it is distinctly not the Democratic Party's responsibility to save the Republican Party from itself, and from the political monster it has created over the past 40 years. ",
"For four decades, the party has flattered, and begged, and truckled to the very forces of which it is now terrified. ",
"Save yourselves, gang.",
"\n\nBut that isn't happening because, for all their brave talk, the Never Trumpers want to keep the political power that base gave them while distancing themselves from its obvious and inevitable product. ",
"So, instead of gathering forces behind a primary challenge, many of the Never Trumpers seem to be content with advising the Democratic Party on who it should nominate and what policies it should pursue. ",
"This, I believe, in preparation for a campaign to blame the Democratic nominee if the country determines that it wants to live six more years in the current gale-force dungwind.",
"\n\nIf the country re-elects this president*, it's because modern movement conservatism prepared the ground for it and used the Republican Party to do it.",
"\n\nLet us be clear: if the country re-elects this president*, it's because modern movement conservatism prepared the ground for it and used the Republican Party to do it. ",
"It hangs on all of them like a historical deadweight. ",
"They should disenthrall themselves from the policies and tactics that hung it from their necks before presuming to beg the other political party save them from their own monster.",
"\n\nWhich brings us to former Ohio Governor John Kasich, who's spent most of the winter walking the parapets of the Elsinore green room. ",
"He's been deploring hard, has Kasich, most recently on CNN. ",
"But he hasn't done anything besides that—and his endless pondering has frozen the field for other possible candidates, most of whom lack the stones to run anyway, but all of whom would like extra credit for at least thinking about it. (",
"Hi, Larry Hogan!)",
"\n\nSeth Moulton is the latest Democratic contender. ",
"Bill Clark Getty Images\n\nMeanwhile, of course, every Democratic politician except zombie Martin Van Buren has jumped in. ",
"Monday was Seth Moulton Day, and the Massachusetts congressman virtually sewed up the Seth Moulton vote almost instantly. ",
"The Seth Moulton vote is not to be confused with the Tim Ryan vote or the Pete Buttigieg vote, although I suspect some retired factory worker in Mishawaka is going to be very confused by the end of the summer especially if, as expected, Joe Biden leaps in this week, more than likely falling over his own feet in the process.",
"\n\nIt's already getting a bit...spirited...on the Democratic side. ",
"Republicans are just going to have to roll with it. ",
"Or they can help re-elect a Republican president*. ",
"Loyalty counts, after all.",
"\n\nRespond to this post on the Esquire Politics Facebook page here.",
"\n\nCharles P. Pierce Charles P Pierce is the author of four books, most recently Idiot America, and has been a working journalist since 1976.",
"\n\nThis content is created and maintained by a third party, and imported onto this page to help users provide their email addresses. ",
"You may be able to find more information about this and similar content at piano.io"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0006848540506325662,
0.000553891237359494,
0.0009000507416203618,
0.0006302933325059712,
0.0006235805340111256,
0.004843051079660654,
0.0010464306687936187,
0.0006194860325194895,
0.0006960253231227398,
0.0007283508311957121,
0.0010115066543221474,
0.0006388082983903587,
0.9011009931564331,
0.0011224577901884913,
0.002084866864606738,
0.0007672358187846839,
0.003842204576358199,
0.2562023997306824,
0.0010208177845925093,
0.000691474589984864,
0.0007549817091785371,
0.000616044329944998,
0.0006127169472165406,
0.0024674723390489817,
0.01869039796292782,
0.0006042796303518116,
0.0008143849554471672,
0.0006054334226064384,
0.0008307864773087204,
0.001520963036455214,
0.0011445023119449615,
0.000840997148770839,
0.0006633453886024654,
0.0019019164610654116,
0.12105993181467056,
0.0008520054398104548,
0.000992936547845602,
0.0006841240683570504,
0.10297572612762451,
0.0006096833967603743,
0.000534687249455601
] | 0.035112 | 41 |
[
"Q:\n\nTrying to find a way to incorporate the parse Int into my calculator\n\nThe GUI on the calculator is finished however it does not do any math. ",
"\nI heard about this command called \"parse Int\". ",
"With this I am trying to receive a string from the user and convert it into an integer. ",
"When I click an operator button I want it to receive input again and when i press the equals button I want java to register that string as the second number. ",
"\nDoes anyone know how I could approach this? ",
"\nI am new in Java and I am doing this for experience with no time limit so I am open to different ways to make the calculator. ",
"Below I provide the code...\nimport java.awt.",
"EventQueue;\n\nimport javax.swing.",
"JFrame;\nimport javax.swing.",
"JPanel;\nimport java.awt.",
"BorderLayout;\nimport javax.swing.",
"JButton;\nimport java.awt.",
"GridLayout;\nimport javax.swing.",
"JTextField;\nimport java.awt.event.",
"ActionListener;\nimport java.awt.event.",
"ActionEvent;\n\nimport java.util.",
"Scanner;\nimport javax.swing.",
"JSplitPane;\n\npublic class CalcGUI {\n\nprivate JFrame frame;\nprivate JTextField textField;\nprivate JTextField textField_1;\n\n/**\n * Launch the application.",
"\n */\npublic static void main(String[] args) {\n EventQueue.invokeLater(new Runnable() {\n public void run() {\n try {\n CalcGUI window = new CalcGUI();\n window.frame.setVisible(true);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n });\n}\n\n// parse (int)\n\n/**\n * Create the application.",
"\n */\npublic CalcGUI() {\n initialize();\n}\n\n/**\n * Initialize the contents of the frame.",
"\n */\nprivate void initialize() {\n frame = new JFrame();\n frame.setBounds(100, 100, 450, 300);\n frame.setDefaultCloseOperation(JFrame.",
"EXIT_ON_CLOSE);\n\n JPanel panel = new JPanel();\n frame.getContentPane().add(panel, BorderLayout.",
"NORTH);\n panel.setLayout(new BorderLayout(0, 0));\n\n JSplitPane splitPane = new JSplitPane();\n panel.add(splitPane);\n\n textField = new JTextField();\n splitPane.setLeftComponent(textField);\n textField.setColumns(10);\n\n //a = int.parse(int);\n\n textField_1 = new JTextField();\n splitPane.setRightComponent(textField_1);\n textField_1.setColumns(10);\n\n JPanel panel_1 = new JPanel();\n frame.getContentPane().add(panel_1, BorderLayout.",
"CENTER);\n panel_1.setLayout(new GridLayout(0, 3, 0, 0));\n\n JPanel panel_2 = new JPanel();\n panel_1.add(panel_2);\n\n JButton btnNewButton_01 = new JButton(\"1\");\n panel_2.add(btnNewButton_01);\n btnNewButton_01.addActionListener(new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"1\");\n }});\n\n JButton btnNewButton_04 = new JButton(\"4\");\n panel_2.add(btnNewButton_04);\n btnNewButton_04.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"4\");\n }});\n\n JButton btnNewButton_07 = new JButton(\"7\");\n panel_2.add(btnNewButton_07);\n btnNewButton_07.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"7\");\n }}); \n\n JButton btnNewButton_squared = new JButton(\"x^2\");\n panel_2.add(btnNewButton_squared);\n btnNewButton_squared.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"^2\");// NOT SURE YET\n }});\n\n JButton btnNewButton_root = new JButton(\"Sqr\");\n panel_2.add(btnNewButton_root);\n btnNewButton_root.addActionListener(new ActionListener() {\n public void actionPerformed(ActionEvent event) {\n //do whatever should happen when the button is clicked...\n }\n });\n\n JButton btnNewButton_clear = new JButton(\"clear\");\n btnNewButton_clear.addActionListener(new ActionListener() {\n public void actionPerformed(ActionEvent e) {\n }\n });\n panel_2.add(btnNewButton_clear);\n\n JPanel panel_3 = new JPanel();\n panel_1.add(panel_3);\n\n JButton btnNewButton_02 = new JButton(\"2\");\n panel_3.add(btnNewButton_02);\n btnNewButton_02.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"2\");\n }});\n JButton btnNewButton_05 = new JButton(\"5\");\n panel_3.add(btnNewButton_05);\n btnNewButton_05.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"5\");\n }});\n\n JButton btnNewButton_08 = new JButton(\"8\");\n panel_3.add(btnNewButton_08);\n btnNewButton_08.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"8\");\n }});\n\n JButton btnNewButton_09 = new JButton(\"9\");\n panel_3.add(btnNewButton_09);\n btnNewButton_09.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"9\");\n }});\n\n JButton btnNewButton_times = new JButton(\"x\");\n panel_3.add(btnNewButton_times);\n btnNewButton_times.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"x\");\n }});\n\n JButton btnNewButton_divide = new JButton(\"/\");\n panel_3.add(btnNewButton_divide);\n btnNewButton_divide.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"/\");\n }});\n\n JButton btnNewButton_delete = new JButton(\"delete\");\n panel_3.add(btnNewButton_delete);\n btnNewButton_delete.addActionListener(new ActionListener() {\n\n public void actionPerformed(ActionEvent event) {\n //do whatever should happen when the button is clicked...\n }\n });\n\n JPanel panel_4 = new JPanel();\n panel_1.add(panel_4);\n\n JButton btnNewButton_03 = new JButton(\"3\");\n btnNewButton_03.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"3\");\n }\n });\n panel_4.add(btnNewButton_03);\n\n JButton btnNewButton_06 = new JButton(\"6\");\n btnNewButton_06.addActionListener(new ActionListener() {\n public void actionPerformed(ActionEvent e) {\n }\n });\n panel_4.add(btnNewButton_06);\n btnNewButton_06.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"6\");\n }});\n\n JButton btnNewButton_00 = new JButton(\"0\");\n panel_4.add(btnNewButton_00);\n btnNewButton_00.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"0\");\n }});\n\n JButton btnNewButton_plus = new JButton(\"+\");\n panel_4.add(btnNewButton_plus);\n btnNewButton_plus.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n textField.setText(textField.getText() + \"+\");\n }});\n\n JButton btnNewButton_minus = new JButton(\"-\");\n panel_4.add(btnNewButton_minus);\n btnNewButton_minus.addActionListener(new ActionListener() {\n\n @Override\n public void actionPerformed(ActionEvent e) {\n\n textField.setText(textField.getText() + \"-\");\n }});\n\n JButton btnNewButton_equals = new JButton(\"=\");\n panel_4.add(btnNewButton_equals);\n btnNewButton_equals.addActionListener(new ActionListener() {\n\n public void actionPerformed(ActionEvent e) {\n }\n });\n}\n}\n\nA:\n\nCopying the whole code into the question is a bit too much, but let me suggest you a hint as more or less pseudocode:\nString numToConvert = textField.getText();\ntry {\n int num = new Integer(numToConvert);\n //sum up or ...\n} catch (Exception e) { //numToConvertIsNotAnInteger\n //-> must be an operator\n}\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0015765835996717215,
0.0006313695339486003,
0.0006509880186058581,
0.0007190024480223656,
0.0006979104364290833,
0.0010528037091717124,
0.0006989543908275664,
0.0007774907862767577,
0.0008148693013936281,
0.0009037257404997945,
0.0007368946098722517,
0.001127628842368722,
0.0008180259610526264,
0.00074202154064551,
0.0006942969048395753,
0.0009651037980802357,
0.0007585551356896758,
0.0008383283857256174,
0.0018465514294803143,
0.0007030006963759661,
0.0009477260755375028,
0.0006990929832682014,
0.0009720752714201808,
0.002316047204658389
] | 0.000945 | 24 |
[
"\n\nPlease Don't Google That for Me - tvalent2\nhttps://techblog.livingsocial.com/blog/2014/12/23/please-dont-google-that-for-me/\n\n======\njjgreen\nor, [http://justfuckinggoogleit.com/](http://justfuckinggoogleit.com/)\n\n"
] |
{
"pile_set_name": "HackerNews"
}
|
[
0.7495242953300476
] | 0.749524 | 1 |
[
"Q:\n\nHow can prove that $\\int_{0}^{\\infty}\\sum_{i=0}^{j}(-1)^{i +j}{j\\choose i}{e^{-x^{i +a}}\\over x}dx={j!\\gamma\\over a(a+1)(a+2)\\cdots(a+j)}?$\n\nWhere $\\gamma=0.5772156...$ is the Euler's constant and $j$ is an integer, $j\\ge 1.$\n$a\\in \\Re$\nHow can I show that\n\n$$\\int_{0}^{\\infty}\\sum_{i=0}^{j}(-1)^{i +j}{j\\choose i}{e^{-x^{i +a}}\\over x}dx=-(-1)^j\\color{red}{j!\\gamma\\over a(a+1)(a+2)\\cdots(a+j)}?\\tag1$$\n\nLet take a simple case, $a=1$ and $j=1$\n$$I=\\int_{0}^{\\infty}{e^{-x}-e^{-x^2}\\over x}dx=-\\color{blue}{\\gamma\\over 2}\\tag2$$\nSubstitution $u=\\ln{x}\\rightarrow xdu=dx$\n$x=\\infty\\rightarrow u=\\infty$ and $x=0\\rightarrow u=-\\infty$\n$$I=\\int_{-\\infty}^{\\infty}e^{-e^u}-e^{-e^{2u}}du=-{\\gamma\\over 2}\\tag3$$\nI am not sure how to integrate $(3)$. Help needed, thank you.",
"\n\nA:\n\nWe write $I(a,j)=\\int^\\infty_0\\sum_{i=0}^{j}(-1)^{i}\\binom{j}{i}\\frac{\\exp (-x^{a+i})}{x}\\,dx$. \nUsing $\\binom{j}{i}=\\binom{j-1}{i}+\\binom{j-1}{i-1}$, we conclude $I(a,j)=I(a,j-1)-I(a+1,j-1)$.\nIf we can prove $I(a,1)=\\frac{-\\gamma}{a(a+1)}$, the expected form for $I(a,j)$ follows from induction.",
"\n$\n\\begin{align*}\nI(a,1)&=\\int^\\infty_0\\frac{\\exp(x^{-a})-\\exp (-x^{a+1})}{x}\\,dx\\\\\n&=\\lim_{z\\to0}\\int^\\infty_z\\frac{\\exp(x^{-a})-\\exp (-x^{a+1})}{x}\\,dx\\\\\n&=\\lim_{z\\to0}\\left(\\int^\\infty_z\\frac{\\exp(x^{-a})}{x}\\,dx-\\int^\\infty_z\\frac{\\exp (-x^{a+1})}{x}\\,dx\\right)\\\\\n&=\\lim_{z\\to 0}\\left(-\\frac{Ei(-z^a)}{a}+\\frac{Ei(-z^{a+1})}{a+1}\\right)\\\\\n&=\\lim_{z\\to 0}\\left(-\\frac{\\gamma+\\log(z^a)+O(z^a)}{a}+\\frac{\\gamma+\\log(z^{a+1})+O(z^{a+1})}{a+1}\\right)\\\\\n&=\\frac{-\\gamma}{a(a+1)}.",
"\n\\end{align*}$ \n\nA:\n\nHint $$\\color{red}{\\int_{-\\infty }^{\\infty\n }{\\frac{{{e}^{-{{x}^{\\,\\alpha }}}}-{{e}^{-{{x}^{\\,\\beta \n }}}}}{x}}dx=\\gamma \\frac{\\alpha -\\beta }{\\alpha \\beta }}$$\n\nProof\nSet $t=x^\\alpha$ , $n=\\frac{\\beta}{\\alpha}$, so $dx=\\large {\\frac{1}{\\alpha x^{\\alpha-1}}}$$dt$ and\n$$I=\\int_{-\\infty }^{\\infty\n }{\\frac{{{e}^{-{{x}^{\\,\\alpha }}}}-{{e}^{-{{x}^{\\,\\beta \n }}}}}{x}}dx=\\frac{1}{\\alpha}\\int_{0}^{\\infty}\\frac{e^{-t}-e^{-t^{\\large n}}}{t} dt$$\ntherefore\n$$\\qquad I=\\frac{1}{\\alpha }\\left[ \\left( \\int_{0}^{1}{\\frac{{{e}^{-t}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-t}}-1}{t}dt}} \\right)-\\left( \\int_{0}^{1}{\\frac{{{e}^{-{{t}^{n}}}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-{{t}^{n}}}}-1}{t}dt}} \\right) \\right. ",
"$$\n$$=\\frac{1}{\\alpha }\\left[ \\left( \\int_{0}^{1}{\\frac{{{e}^{-t}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-t}}}{t}dt}} \\right)-\\left( \\int_{0}^{1}{\\frac{{{e}^{-{{t}^{n}}}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-{{t}^{n}}}}}{t}dt}} \\right) \\right].$$\nIndeed, we have \n$$I=-\\frac{1}{\\alpha }\\left[ \\color{red}\\gamma +\\left( \\int_{0}^{1}{\\frac{{{e}^{-{{t}^{n}}}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-{{t}^{n}}}}}{t}dt}} \\right) \\right]\\quad (1)$$\nset \n$$J=\\int_{0}^{1}{\\frac{{{e}^{-{{t}^{n}}}}-1}{t}dt+\\int_{1}^{\\infty }{\\frac{{{e}^{-{{t}^{n}}}}}{t}dt}}$$\nand let $u=t^n$, then\n$$J=\\frac{1}{n}\\int_{0}^{1}{\\frac{{{e}^{-u}}-1}{u}du+\\int_{1}^{\\infty }{\\frac{{{e}^{-u}}}{u}du}}=-\\frac{1}{n}\\color{red}\\gamma\\qquad\\quad(2)$$\n$(1)$ and $(2)$\n$$I=-\\frac{1}{\\alpha }( \\color{red}\\gamma -\\frac{1}{n}\\color{red}\\gamma)=-\\frac{1}{\\alpha }\\color{red}\\gamma\\left(1-\\frac{\\alpha}{\\beta}\\right)=\\color{red}{\\gamma \\frac{\\alpha -\\beta }{\\alpha \\beta }}$$\n\nNote $$\\color{blue}{\\gamma\n =\\int_{0}^{1}{\\frac{1-{{e}^{-y}}}{y}dy-\\int_{1}^{\\infty }{\\frac{{{e}^{-y}}}{y}dy}}}\\qquad\\qquad\\qquad\\qquad(3)$$\n\nA:\n\n$\\newcommand{\\angles}[1]{\\left\\langle\\,{#1}\\,\\right\\rangle}\n \\newcommand{\\braces}[1]{\\left\\lbrace\\,{#1}\\,\\right\\rbrace}\n \\newcommand{\\bracks}[1]{\\left\\lbrack\\,{#1}\\,\\right\\rbrack}\n \\newcommand{\\dd}{\\mathrm{d}}\n \\newcommand{\\ds}[1]{\\displaystyle{#1}}\n \\newcommand{\\expo}[1]{\\,\\mathrm{e}^{#1}\\,}\n \\newcommand{\\half}{{1 \\over 2}}\n \\newcommand{\\ic}{\\mathrm{i}}\n \\newcommand{\\iff}{\\Longleftrightarrow}\n \\newcommand{\\imp}{\\Longrightarrow}\n \\newcommand{\\Li}[1]{\\,\\mathrm{Li}}\n \\newcommand{\\ol}[1]{\\overline{#1}}\n \\newcommand{\\pars}[1]{\\left(\\,{#1}\\,\\right)}\n \\newcommand{\\partiald}[3][]{\\frac{\\partial^{#1} #2}{\\partial #3^{#1}}}\n \\newcommand{\\ul}[1]{\\underline{#1}}\n \\newcommand{\\root}[2][]{\\,\\sqrt[#1]{\\,{#2}\\,}\\,}\n \\newcommand{\\totald}[3][]{\\frac{\\mathrm{d}^{#1} #2}{\\mathrm{d} #3^{#1}}}\n \\newcommand{\\verts}[1]{\\left\\vert\\,{#1}\\,\\right\\vert}$\n\n$\\ds{j = 1,2,3,\\ldots}$. With\n $\\ds{\\epsilon > 0\\ \\mbox{and}\\ \\ul{a > 0},\\ }$ lets consider\n\n\\begin{align}\n&\\color{#f00}{\\int_{\\epsilon}^{\\infty}\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}{\\expo{-x^{k +a}} \\over x}\\,\\dd x} =\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}\n\\int_{\\epsilon}^{\\infty}{\\expo{-x^{k +a}} \\over x}\\,\\dd x\\tag{1}\n\\end{align}\nand\n\\begin{align}\n\\fbox{$\\ds{\\ \\int_{\\epsilon}^{\\infty}{\\expo{-x^{k +a}} \\over x}\\,\\dd x\\ }$} &\\\n\\stackrel{x^{k + a}\\phantom{aa}\\mapsto\\ x}{=}\\\n\\int_{\\epsilon}^{\\infty}{\\expo{-x} \\over x^{1/\\pars{k + a}}}\n\\,{1 \\over k + a}\\,x^{1/\\pars{k + a} - 1}\\,\\dd x =\n{1 \\over k + a}\\int_{\\epsilon^{k + a}}^{\\infty}{\\expo{-x} \\over x}\\,\\dd x\n\\\\[3mm] & =\n{1 \\over k + a}\\bracks{%\n-\\pars{k + a}\\ln\\pars{\\epsilon}\\expo{-\\epsilon^{k + a}} +\n\\int_{\\epsilon^{k + a}}^{\\infty}\\ln\\pars{x}\\expo{-x}\\,\\dd x}\n\\\\[3mm] & =\n-\\ln\\pars{\\epsilon}\\expo{-\\epsilon^{k + a}} +\n{1 \\over k + a}\\int_{\\epsilon^{k + a}}^{\\infty}\\ln\\pars{x}\\expo{-x}\\,\\dd x\n\\\\[3mm] & =\n-\\ln\\pars{\\epsilon}\\expo{-\\epsilon^{k + a}} +\n{1 \\over k + a}\\ \\underbrace{\\int_{0}^{\\infty}\\ln\\pars{x}\\expo{-x}\\,\\dd x}\n_{\\ds{-\\gamma}}\\ -\\\n{1 \\over k + a}\\int_{0}^{\\epsilon^{k + a}}\\ln\\pars{x}\\expo{-x}\\,\\dd x\n\\end{align}\n\nIn the $\\ds{\\epsilon \\to 0^{+}}$ limit, we'll have\n$\\ds{\\pars{~\\mbox{see expression }\\ \\pars{1}~}}$\n\\begin{align}\n&\\color{#f00}{\\int_{0}^{\\infty}\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}{\\expo{-x^{k +a}} \\over x}\\,\\dd x} =\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}\\pars{-\\,{\\gamma \\over k + a}}\n\\tag{2}\n\\\\[3mm] &\\\n\\mbox{because}\\quad\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k} = \\delta_{j0}\\quad\n\\mbox{and}\\quad j \\not= 0\n\\end{align}\n\n$\\pars{2}$ becomes\n\\begin{align}\n&\\color{#f00}{\\int_{0}^{\\infty}\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}{\\expo{-x^{k +a}} \\over x}\\,\\dd x} =\n-\\gamma\\,\\pars{-1}^{\\,j}\\sum_{k = 0}^{j}\\pars{-1}^{k}{j \\choose k}\n\\int_{0}^{1}x^{k + a - 1}\\,\\dd x\n\\\\[3mm] = &\\\n-\\gamma\\,\\pars{-1}^{\\,j}\\int_{0}^{1}x^{a - 1}\n\\sum_{k = 0}^{j}{j \\choose k}\\pars{-x}^{k}\\,\\dd x =\n-\\gamma\\,\\pars{-1}^{\\,j}\\int_{0}^{1}x^{a - 1}\\pars{1 - x}^{j}\\,\\dd x\n\\\\[3mm] = &\\\n-\\gamma\\,\\pars{-1}^{\\,j}\\,\n{\\Gamma\\pars{a}\\Gamma\\pars{j + 1} \\over \\Gamma\\pars{a + j + 1}} =\n-\\gamma\\,\\pars{-1}^{\\,j}\\,{j! ",
"\\over \\pars{a}_{j + 1}}\n\\end{align}\nwhere $\\ds{\\pars{a}_{j + 1}}$ is a Pochammer Symbol:\n$$\n\\pars{a}_{j + 1} = a\\pars{a +1}\\pars{a + 2}\\ldots\\pars{a + j}\n$$\n\nFinally,\n$$\n\\color{#f00}{\\int_{0}^{\\infty}\n\\sum_{k = 0}^{j}\\pars{-1}^{k + j}{j \\choose k}{\\expo{-x^{k +a}} \\over x}\\,\\dd x}\n=\n\\color{#f00}{%\n-\\gamma\\,\\pars{-1}^{\\,j}\\,{j! ",
"\\over a\\pars{a +1}\\pars{a + 2}\\ldots\\pars{a + j}}}\n$$\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.016840893775224686,
0.007035537157207727,
0.07544025033712387,
0.13643129169940948,
0.1187010109424591,
0.06872500479221344,
0.1084115132689476
] | 0.075941 | 7 |
[
"Q:\n\npre/code element with horizontal scrollbar breaks the flex layout on Firefox\n\nIn my flexbox based layout, I may have a <pre><code></code></pre> element (among other elements). ",
"As its content might be wider than the container, I made it overflow-x:auto.",
"\nIt works perfectly on Chrome:\n\nBut it's broken on Firefox:\n\nHow can I fix that without hard-coded dimensions ?",
"\n\ndiv,pre {\r\n padding: 5px;\r\n color: white;\r\n}\r\n.m {\r\n background: #222;\r\n display: flex;\r\n}\r\n.l, .r {\r\n background: #143;\r\n flex: 0 0 100px;\r\n}\r\n.c {\r\n background: #971;\r\n flex: 1;\r\n}\r\npre {\r\n white-space: pre;\r\n word-wrap: normal;\r\n overflow-x: auto;\r\n}\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>this must take the remaining space</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\r\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>\r\n <pre><code>The following line of code is long:\r\n This is the long line of code the previous line of code was referring to (no, it can't be 72 col, sorry for the inconvenience)</code></pre>\r\n Some other content in the c column.</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\n\nA:\n\nYou just need to set min-width:0 on your flex item, .c. ",
" See my answer on this similar question for more.",
"\nBackstory: The flexbox spec introduces a new sizing feature, min-width: auto, which forces flex items to be at least as large as their min-content width -- the minimum width that their contents need, to avoid overflow. ",
"Right now, Firefox is the only browser to have implemented this, which is why you only see it there.",
"\nIf you want to disable this behavior, just give the flex item min-width:0.",
"\n(You could also set overflow:hidden on the flex item, as described in the other answer here, but that's overkill. ",
" That only benefits you by forcing min-width:auto to resolve to 0, via a special case in the min-width:auto definition. ",
" The downside is that overflow:hidden also forces the browser to do extra work to manage an invisible scrollable area for the flex item, and that's got a nonzero cost in terms of memory & performance, so better to avoid it unless you actually are using overflow:hidden on the flex item. ",
"And you aren't, so it's better to avoid it.)",
"\n\ndiv,pre {\r\n padding: 5px;\r\n color: white;\r\n}\r\n.m {\r\n background: #222;\r\n display: flex;\r\n}\r\n.l, .r {\r\n background: #143;\r\n flex: 0 0 100px;\r\n}\r\n.c {\r\n background: #971;\r\n flex: 1;\r\n min-width: 0;\r\n}\r\npre {\r\n white-space: pre;\r\n word-wrap: normal;\r\n overflow-x: auto;\r\n}\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>this must take the remaining space</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\r\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>\r\n <pre><code>The following line of code is long:\r\n This is the long line of code the previous line of code was referring to (no, it can't be 72 col, sorry for the inconvenience)</code></pre>\r\n Some other content in the c column.</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\n\nA:\n\nAll you need to do here, is set the parent element of your code-block <pre>, in this case <div class=\"c\"> to overflow: hidden \n.c {\n background: #971;\n flex: 1;\n overflow: hidden;\n}\n\n.c is a block element, that is taking up all the space it gets here without allowing an overflow with this rule set. ",
"\npre as the child is overflowing its parent as it takes up more space because of its content, so overflow: auto will be set to scroll here, resulting in the scroll area appearing on the inner pre - element.",
"\nDemonstration :\n\ndiv,pre {\r\n padding: 5px;\r\n color: white;\r\n}\r\n.m {\r\n background: #222;\r\n display: flex;\r\n}\r\n.l, .r {\r\n background: #143;\r\n flex: 0 0 100px;\r\n}\r\n.c {\r\n background: #971;\r\n flex: 1;\r\n overflow: hidden;\r\n}\r\npre {\r\n white-space: pre;\r\n word-wrap: normal;\r\n overflow-x: auto;\r\n}\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>this must take the remaining space</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\r\n <div class=m>\r\n <div class=l>this must be 100px wide</div>\r\n <div class=c>\r\n <pre><code>The following line of code is long:\r\n This is the long line of code the previous line of code was referring to (no, it can't be 72 col, sorry for the inconvenience)</code></pre>\r\n Some other content in the c column.</div>\r\n <div class=r>this must be 100px wide</div>\r\n </div>\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.0006729394663125277,
0.0005864327540621161,
0.0006682220264337957,
0.0016645081341266632,
0.000560418760869652,
0.0007552432944066823,
0.0011305644875392318,
0.0008725670631974936,
0.0006539012538269162,
0.0008701762417331338,
0.0009965848876163363,
0.0008542897994630039,
0.0017536183586344123,
0.0008516832021996379,
0.0013119421200826764
] | 0.000947 | 15 |
[
"I thought I was in the clear... the video launched and was immediately monitized. ",
"All seemed to be going well, then this morning I woke up to find that the video had been DEMONITIZED.",
"\n\nI'm done trying to figure out \"why?\". ",
"It just seems to be the new norm. ",
"YouTube playing games with all the videos.",
"\n\nConspiracy theories say that YT is targeting smaller, \"wholesome\" channels especially those in the homesteading niche. ",
"I'm not sure about all that but it sure seems silly how many of us are getting hit with this.",
"\n\nIn the last few months I've found it very difficult to get any views as well. ",
"With almost 40,000 subscribers you'd think that it wouldn't be that hard to get a couple thousand views per video. ",
"That used to be the case, but lately most of my videos won't even hit 1000 views. ",
"Weird.",
"\n\nYouTube won't monitize the video until it gets 1000 views in 7 days. ",
"If you have time to watch and share this video it will be HUGELY appreciated!"
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.0006349470349960029,
0.0007323421305045485,
0.0006371268536895514,
0.0007082144147716463,
0.0012901372974738479,
0.0005851385649293661,
0.02911427430808544,
0.0005517027457244694,
0.0006723858532495797,
0.0008918275125324726,
0.03117980621755123,
0.0017733779968693852,
0.0005162009038031101
] | 0.00533 | 13 |
[
"---\nabstract: 'We define a generalized mass for asymptotically flat manifolds using some higher order symmetric function of the curvature tensor. ",
"This mass is non-negative when the manifold is locally conformally flat and the $\\sigma_k$ curvature vanishes at infinity. ",
"In addition, with the above assumptions, if the mass is zero, then, near infinity, the manifold is isometric to a Euclidean end.'",
"\nauthor:\n- 'YanYan Li [^1] and Luc Nguyen [^2]'\ntitle: A generalized mass involving higher order symmetric function of the curvature tensor\n---\n\nIntroduction\n============\n\nLet $(M,g)$ be an $n$-dimensional Riemannian manifold. ",
"Assume that $(M,g)$ is asymptotically flat, i.e. there is a compact set $K \\subset M$, some $R \\geq 1$ and a diffeomorphism $\\Phi: M\\setminus K \\rightarrow \\RR^n \\setminus B_R$ such that $$(\\Phi^* g)_{ij}(x) = \\delta_{ij} + o(|x|^{-\\tau}) \\text{ as } |x| \\rightarrow \\infty.$$ If $\\tau \\geq \\frac{n-2}{2}$ and the scalar curvature $R_g$ is integrable, then the so-called ADM mass of $(M,g)$ is defined by (see [@ADMMass; @Bartnik86]) $$m = \\int_{S_\\infty} (g_{ij,j} - g_{jj,i})dS^i,$$ where $g_{ij,k}$ denotes a partial derivative and $dS^i$ is the normal surface element of $S_\\infty$, the sphere at infinity.",
"\n\nThat $m$ is a geometric invariant of $(M,g)$ is a consequence of the following expansion of the Hilbert-Einstein action: $$R_g *1 = d(g^{ab}\\,\\omega_a{}^c \\wedge \\eta_{cb}) + g^{ab}\\,\\omega_d{}^c \\wedge \\omega_a{}^d \\wedge \\eta_{bc}\n \\label{Eq:HEDecomp}$$ where $R_g$ is the scalar curvature, $*1$ is the volume form, $\\omega_a{}^b$ is the Levi-Civita connection one-form with respect to a frame $\\{e_a\\}$ and $\\eta_{ab}= (e_a \\wedge e_b) \\rfloor *1$. See Bartnik [@Bartnik86] for more details.",
"\n\nMass and its properties have attracted much attention since it was introduced. ",
"One of the reason is its wide range of applications in mathematical relativity and in geometric analysis. ",
"For example, consider the Yamabe problem which asks to find on a compact Riemannian manifold a conformal metric with constant scalar curvature. ",
"Its solutions are critical point of the Hilbert-Einstein functional in a fixed conformal class. ",
"Thus, it is not too surprising that the notion mass is useful in the study of the Yamabe problem. ",
"In fact, it is *very important* in the solution of the Yamabe problem [@Schoen84] as well as in the resolution of compactness issue of the Yamabe problem [@Schoen91; @LiZhu99; @Druet04; @LiZhang05; @LiZhang07; @Marques05; @KMS09].",
"\n\nIn recent years, fully nonlinear versions of the Yamabe problem have received much attention after the work of Viaclovsky [@Viac00-Duke; @Viac00-TrAMS; @Viac02] and of Chang, Gursky and Yang [@CGY02-AnnM; @CGY02-JAM; @CGY03-IHES; @CGY03-IP]; see e.g. [@GW03-JRAM; @LiLi03; @LiLi05; @GeWang06; @GV07; @STW07; @TW09; @LiNg-arxiv; @TW10]. ",
"For a metric $g$, let $A_g$ be the Schouten tensor of $g$, i.e. $$A_g = \\frac{1}{n-2}\\Big(\\Ric_g- \\frac{1}{2(n-1)}\\,R_g\\,\ng\\Big),$$ where $\\Ric_g$ and $R_g$ denote the Ricci curvature and the scalar curvature of $g$. Let $\\lambda(A_g)=(\\lambda_1, \\cdots, \\lambda_n)$ denote the eigenvalues of $A_g$ with respect to $g$. For $1\\leq k \\leq n,$ let $\\sigma_k(\\lambda) = \\sum_{1\\leq i_1 <\\cdots <\ni_k\\leq n}\\lambda_{i_1}\\cdots \\lambda_{i_k}, \\lambda = (\\lambda_1,\n\\cdots, \\lambda_n) \\in \\Bbb R^n$, denote the $k$-th elementary symmetric function, and let $\\Gamma_k$ denote the connected component of $\\{\\lambda \\in \\Bbb R^n | \\sigma_k (\\lambda) > 0\\}$ containing the positive cone $\\{\\lambda \\in \\Bbb R^n|\\lambda_1, \\cdots, \\lambda_n >\n0\\}$.\n\n\\[MQuest\\] Let $(N,h)$ be a compact, smooth Riemannian manifold of dimension $n\\ge 3$ satisfying $\\lambda(A_h)\\in \\Gamma$ on $N$ and $1 \\leq k \\leq n$. Is there a smooth positive function $u$ on $N$ such that $\\hat h= u^{\\frac{4}{n-2}} h$ satisfies $$\\sigma_k(\\lambda(A_{\\hat h})) =1, \\quad \\lambda (A_{\\hat g}) \\in \\Gamma_k,\n\\quad \\mbox{ on } N?",
"\n\\label{9}$$\n\nEquation (\\[9\\]) is a second order fully nonlinear elliptic equation of $u$. The special case of Question \\[MQuest\\] for $k = 1$ is the Yamabe problem in the so-called positive case.",
"\n\nThe problem is in general not a variational one when $k \\geq 3$. Natural variants of equation (\\[9\\]) which are of variational form have been introduced by Chang and Fang [@ChangFang08]; see also a subsequent paper of Graham [@Graham09] on the algebraic structure of these equations under conformal transformations.",
"\n\nFrom the discussion on the relation between the ADM mass and the Yamabe problem, it is natural to ask if there is some notion of mass associated with the $\\sigma_k$ Yamabe problem. ",
"The main goal of this note is to give some generalization along this line. ",
"While we have not been able to identify such a notion that is directly related to the $\\sigma_k$ curvature, we are able to do so for a variant for $2 \\leq k < \\frac{n}{2}$, which coincides with the $\\sigma_k$ curvature when $(M,g)$ is locally conformally flat. ",
"This is motivated by a relation between the Pffafian and the $\\sigma_{n/2}$ curvature (see Viaclovsky [@Viac00-Duke]). ",
"See Theorem \\[Thm:MassDef\\] for a precise definition.",
"\n\nAfter our work was done, the Yanyan Li heard a talk by Guofang Wang in the conference on ‘Geometric PDEs’ in the trimester on ‘Conformal and Kähler Geometry’ at IHP in which he announced that he together with Yuxin Ge and Jie Wu had also developed a notion of higher order mass. ",
"After the talk, Yanyan informed Guofang that we had defined a mass by using an invariant of the $\\sigma_k$ curvature which agrees with the $\\sigma_k$ curvature when the manifold is locally conformally flat and proved that the mass is non-negative under the assumption that the manifold is locally conformally flat and the $\\sigma_k$ curvature is zero near infinity, together with a rigidity in that case.",
"\n\nThe rest of the paper is organized as follows. ",
"In Section \\[Sec:CurvInv\\], we define a curvature invariant $\\Lambda_k$ which coincides with the $\\sigma_k$ curvature when $(M,g)$ is locally conformally flat. ",
"We also provide a decomposition for $\\Lambda_k$ which is a generalization of the decomposition for the Hilbert-Einstein action. ",
"In Section \\[Sec:MassDef\\], we used the decomposition developed in Section \\[Sec:CurvInv\\] to define a mass, called the $k$-th mass. ",
"In Section \\[Sec:PosMass\\], we announce a very restrictive version of the positive mass theorem for the $k$-th mass.",
"\n\n[**Acknowledgment.**]{} ",
"The authors would like to thank Professor Deser for his remarks which help improve the presentation of the paper.",
"\n\nA curvature invariant {#Sec:CurvInv}\n=====================\n\nConsider an $n$-dimensional Riemannian manifold $(M,g)$. Let $\\{e_1, \\ldots, e_n\\}$ be a local orthonormal frame and $\\{\\theta^1, \\ldots, \\theta^n\\}$ its dual coframe. ",
"Let $(\\omega_i{}^j)$ be the skew-symmetric matrix of Levi-Civita connection one-forms: $$\\nabla_\\xi e_i = \\omega_i{}^j(\\xi)\\,e_j.$$ (Here and below, upper indices label rows while lower indices label columns.) ",
"The first structural equations read $$d\\theta^j = \\theta^i \\wedge \\omega_i{}^j.$$ The curvature tensor is viewed as a skew-symmetric matrix of two-forms, $$\\Omega_i{}^j(X,Y) = \\theta^j(R(X,Y)e_i).$$ The second structural equations read $$\\Omega_i{}^j = d\\omega_i{}^j - \\omega_i{}^k \\wedge \\omega_k{}^j.$$ Also, the first and second Bianchi identities read $$\\theta^i \\wedge \\Omega_i{}^j = 0 \\text { and } d\\Omega_i{}^j = -\\Omega_i{}^k \\wedge \\omega_k{}^j + \\omega_i{}^k \\wedge \\Omega_k{}^j.$$ For a multi-index $I = (i_1, \\ldots, i_m)$, let $\\theta^I = \\theta^{i_1} \\wedge \\ldots \\wedge \\theta^{i_m}$ and $\\theta^{[I]} = *\\theta^{I}$ where $*$ is the Hodge dual operator.",
"\n\nFor $1 \\leq k \\leq \\frac{n}{2}$, define the $n$-form $$\\Lambda_k = \\frac{1}{2^k\\,k!}\\sum_{I = (i_1, \\ldots, i_{2k}) \\in S_{n,2k}} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]},$$ where $$S_{n,2k} := \\Big\\{(i_1, \\ldots, i_{2k}): 1 \\leq i_p \\leq n, i_p \\neq i_q \\text{ whenever } p \\neq q\\Big\\}.$$ It is useful to observe that $$\\Lambda_k = \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}.$$ For $k = 1$, $*\\Lambda_1$ is half the scalar curvature. ",
"For $n$ even and $k = n/2$, $\\Lambda_{n/2}$ is the Pfaffian. ",
"Those quantities are frame independent. ",
"We claim that this is true for all $\\Lambda_k$’s. ",
"Indeed, let $P$ be an orthonormal matrix function, $\\tilde e_i = P_i{}^j\\,e_j$, $\\tilde\\theta^j = (P^{-1})_i{}^j\\,\\theta^i$. We have $$\\tilde\\omega_i{}^j = P_i{}^k\\,\\omega_k{}^l\\,(P^{-1})_l{}^j + P_i^{k}\\,d(P^{-1})_k{}^j \\text{ and } \\tilde\\Omega_i{}^j = P_i{}^k\\,\\Omega_k{}^l\\,(P^{-1})_l{}^j.$$ We then have $$\\begin{aligned}\n2^k\\,k!\\tilde\\Lambda_k \n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\tilde\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\tilde\\Omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\tilde\\theta^{[I]}\\\\\n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\big[P_{i_1}{}^{p_1}\\,(P^{-1})_{p_2}{}^{i_2} \\Omega_{p_1}{}^{p_2}\\big] \\wedge \\ldots \\wedge \\big[ P_{i_{2k-1}}{}^{p_{2k-1}}\\,(P^{-1})_{p_{2k}}{}^{i_{2k}} \\Omega_{p_{2k-1}}{}^{p_{2k}}\\big]\\\\\n &\\qquad\\qquad \\wedge *\\Big(\\big[(P^{-1})_{q_1}{}^{i_1}\\,\\theta^{q_1}\\big] \\wedge \\ldots \\wedge \\big[(P^{-1})_{q_{2k}}{}^{i_{2k}}\\,\\theta^{q_{2k}}\\big]\\Big)\\\\\n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} P_{i_1}{}^{p_1}\\,(P^{-1})_{q_1}{}^{i_1}\\,(P^{-1})_{p_2}{}^{i_2}\\,(P^{-1})_{q_2}{}^{i_2}\\ldots \\\\\n &\\qquad\\qquad \\ldots P^{-1}_{i_{2k-1}}{}^{p_{2k-1}}\\,(P^{-1})_{q_{2k-1}}{}^{i_{2k-1}}\\,(P^{-1})_{p_{2k}}{}^{i_{2k}}\\,(P^{-1})_{q_{2k}}{}^{i_{2k}}\\\\\n &\\qquad \\qquad \\Omega_{p_1}{}^{p_2} \\wedge \\ldots \\wedge \\Omega_{p_{2k-1}}{}^{p_{2k}} \\wedge *(\\theta^{q_1} \\wedge \\ldots \\wedge \\theta^{q_{2k}})\\\\\n &= \\sum_{1 \\leq p_1, \\ldots, p_{2k} \\leq n} \\Omega_{p_1}{}^{p_2} \\wedge \\ldots \\wedge \\Omega_{p_{2k-1}}{}^{p_{2k}} \\wedge *(\\theta^{p_1} \\wedge \\ldots \\wedge \\theta^{p_{2k}})\\\\\n &= 2^k\\,k!\\Lambda_k,\\end{aligned}$$ where in the second-to-last identity we have used the orthogonality of $P$.\n\nWhen $g$ is conformally flat, $*\\Lambda_k$ is proportional to the $\\sigma_k$-curvature. ",
"This was noticed by Viaclovsky [@Viac00-Duke] in case $k = n/2$. The argument for general $k$ is similar. ",
"We include it here for completeness. ",
"Recall that the Riemann curvature tensor $\\Riem$ admits the decomposition $$\\Riem = W_g + A_g \\odot g$$ where $\\odot$ is the Kulkarni-Nomizu product and $W_g$ is the Weyl tensor of $g$. When $(M,g)$ is locally conformally flat, $W_g \\equiv 0$. Fix a point $p \\in M$. The local orthonormal frame $\\{e_1, \\ldots, e_n\\}$ is chosen so that $A_g$ is diagonalized at $p$ with eigenvalue $\\lambda_1, \\ldots, \\lambda_n$; in particular, $A_i{}^j = \\lambda_i\\,\\delta_{ij}$. We have at $p$ that $$\\begin{aligned}\n\\Omega_i{}^j \n &= \\Riem_i{}^j{}_{kl}\\,\\theta^k\\wedge \\theta^l\\\\\n &= (A_g \\odot g)_i{}^j{}_{kl}\\,\\theta^k\\wedge \\theta^l\\\\\n &= (A_{ik}\\,\\delta_{jl} - A_{jk}\\,\\delta_{il} + A_{jl}\\,\\delta_{ik} - A_{il}\\,\\delta_{jk})\\,\\theta^k\\wedge \\theta^l\\\\\n &= 2(\\lambda_i + \\lambda_j)\\,\\theta^i \\wedge \\theta^j.\\end{aligned}$$ It follows that, also at $p$, $$\\begin{aligned}\n\\Lambda_k \n &= \\frac{1}{2^k\\,k!}\\sum_{I = (i_1, \\ldots, i_{2k}) \\in S_{n,2k}} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-1}}{}^{i_{2k-2}} \\wedge \\theta^{[I]}\\\\\n &= \\frac{1}{k!} ",
"\\sum_{I = (i_1, \\ldots, i_{2k}) \\in S_{n,2k}} (\\lambda_{i_1} + \\lambda_{i_2})\\ldots(\\lambda_{i_{2k-1}} + i_{2k}) \\underbrace{\\theta^I \\wedge \\theta^{[I]}}_{=dv_g}\\\\\n &= \\frac{1}{k!} ",
"\\sum_{I = (i_1, \\ldots, i_{2k}) \\in S_{n,2k}} (\\lambda_{i_1} + \\lambda_{i_2})\\ldots(\\lambda_{i_{2k-1}} + i_{2k}) dv_g\\\\\n &= \\frac{2^{k}(n-k)!}{k!(n-2k)!} ",
"\\sum_{J = (j_1, \\ldots, j_k) \\in S_{n,k}} \\lambda_{j_1}\\ldots \\lambda_{j_k}\\, dv_g\\\\\n &= \\frac{2^k(n-k)!}{(n-2k)!} ",
"\\sigma_k(A_g)\\,dv_g,\\end{aligned}$$ i.e. $\\Lambda_k$ is proportional to $\\sigma_k(A_g)\\,dv_g$.\n\nTo finish this section, we derive a decomposition of $\\Lambda_k$ which we will need later. ",
"By the second structural equations, $$\\begin{aligned}\n2^k\\,k!\\Lambda_k \n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge d\\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\\\\n &\\qquad - \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} d\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{p_{k}} \\wedge \\omega_{p_k}{}^{i_{2k}} \\wedge \\theta^{[I]}\\\\\n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} d\\Big(\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\Big)\\\\\n &\\qquad - \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} d\\Big(\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}}\\Big) \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\\\\n &\\qquad + \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge d\\theta^{[I]}\\\\\n &\\qquad - \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{p_{k}} \\wedge \\omega_{p_k}{}^{i_{2k}} \\wedge \\theta^{[I]}.\\end{aligned}$$ Note that, by symmetry, $$\\begin{aligned}\n&\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} d\\Omega_{i_1}{}^{i_2} \\wedge \\Omega_{i_3}{}^{i_4} \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\\\\n &\\qquad = \\ldots = \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots\\wedge \\Omega_{i_{2k-5}}{}^{i_{2k-4}} \\wedge d\\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]},\\end{aligned}$$ which, by the second Bianchi identity and anti-symmetry, is equal to $$\\begin{aligned}\n&\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-5}}{}^{i_{2k-4}} \\wedge\\\\\n &\\qquad\\qquad \\wedge (-\\Omega_{i_{2k-3}}{}^{r_{k-1}}\\wedge \\omega_{r_{k-1}}{}^{i_{2k-2}} + \\omega_{i_{2k-3}}{}^{r_{k-1}} \\wedge \\Omega_{r_{k-1}}{}^{i_{2k-2}}) \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\\\\n&= -2\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-5}}{}^{i_{2k-4}} \\wedge \\Omega_{i_{2k-3}}{}^{r_{k-1}} \\wedge \\omega_{r_{k-1}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}.\\end{aligned}$$\n\nNext, we compute $d\\theta^{[I]}$. Assume first that $I = (i_1, \\ldots, i_{2k}) \\in S_{n,2k}$. We supplement $I$ with $i_{2k+1}, \\ldots, i_n$ so that $(i_1, \\ldots, i_n)$ is a permutation of $(1,\\ldots, n)$. We have $$\\theta^{[I]} = \\delta_{1 \\ldots n}^{i_1\\ldots i_n} \\theta^{i_{2k+1}} \\wedge \\ldots \\wedge \\theta^{i_n}.$$ In view of the first structural equations, this implies that $$\\begin{aligned}\nd\\theta^{[I]} \n &= \\delta_{1 \\ldots n}^{i_1\\ldots i_n} \\sum_{s = 2k+1}^n \\sum_{t = 1}^{2k} (-1)^{s - 1}\\theta^{i_{2k+1}} \\wedge \\ldots \\wedge\\theta^{i_{s - 1}} \\wedge (\\theta^{i_t} \\wedge \\omega_{i_t}{}^{i_{s}}) \\wedge \\theta^{i_{s+1}} \\wedge \\ldots \\wedge \\theta^{i_n}\\\\\n &= \\delta_{1 \\ldots n}^{i_1\\ldots i_n}\\sum_{t = 1}^{2k} \\sum_{s = 2k+1}^n (-1)^s \\omega_{i_t}{}^{i_{s}} \\wedge \\theta^{i_t} \\wedge \\theta^{i_{2k+1}} \\wedge \\ldots \\wedge\\theta^{i_{s - 1}} \\wedge \\theta^{i_{s+1}} \\wedge \\ldots \\wedge \\theta^{i_n}\\\\\n &= \\sum_{t = 1}^{2k} \\sum_{s = 2k+1}^n \\omega_{i_t}{}^{i_{s}} \\wedge \\theta^{[I: i_t \\rightarrow i_s]}\\\\\n &= \\sum_{t = 1}^{2k} \\sum_{s = 1}^n \\omega_{i_t}{}^{s} \\wedge \\theta^{[I: i_t \\rightarrow s]},\\end{aligned}$$ where $I: i_t \\rightarrow i_s$ denotes $(i_1, \\ldots, i_{t-1}, i_s, i_{t+1}, \\ldots, i_{2k})$. This continues to holds when for general multi-index $I = (i_1, \\ldots, i_{2k}) \\in \\{1, \\ldots, n\\}^k$. Indeed, if $I \\notin S_{n,2k}$, we have $d\\theta^{[I]} = 0$ and $$\\begin{aligned}\n&\\sum_{t = 1}^{2k} \\sum_{s = 1}^n \\omega_{i_t}{}^{s} \\wedge \\theta^{[I: i_t \\rightarrow s]}\\\\\n &\\qquad = \\sum_{\\text{special }t's} \\sum_{s = 1}^n \\omega_{i_t}{}^{s} \\wedge \\theta^{[I: i_t \\rightarrow s]}\\\\\n &\\qquad = \\frac{1}{2}\\sum_{\\text{special }t's} \\sum_{s = 1}^n (\\omega_{i_t}{}^{s} \\wedge \\theta^{[I: i_t \\rightarrow s]} + \\omega_{i_{\\tilde t}}{}^{s} \\wedge \\theta^{[I: i_{\\tilde t} \\rightarrow s]})\\\\\n &\\qquad = 0.\\end{aligned}$$ where the set of special $t$’s are those such that there is a unique $\\tilde t \\neq t$ such that $i_t = i_{\\tilde t}$. It thus follows that $$\\begin{aligned}\n&\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge d\\theta^{[I]}\\\\\n &\\qquad = \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\sum_{t = 1}^{2k}\\sum_{s = 1}^n \\omega_{i_t}{}^{s} \\wedge \\theta^{[I: i_t \\rightarrow s]}\\\\\n &\\qquad = 2(k-1)\\sum_{1 \\leq i_1, \\ldots, i_{2k}, s \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\omega_{i_{2k-2}}{}^{s} \\wedge \\theta^{[I: i_{2k-2} \\rightarrow s]}\\\\\n &\\qquad\\qquad + 2\\sum_{1 \\leq i_1, \\ldots, i_{2k},s \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\omega_{i_{2k}}{}^{s} \\wedge \\theta^{[I: i_{2k} \\rightarrow s]}\\\\\n &\\qquad = -2(k-1)\\sum_{1 \\leq j_1, \\ldots, j_{2k},i_{2k-2} \\leq n} \\Omega_{j_1}{}^{j_2} \\wedge \\ldots \\wedge \\Omega_{j_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-2}}{}^{j_{2k-2}} \\wedge \\omega_{j_{2k-1}}{}^{j_{2k}} \\wedge \\theta^{[J]}\\\\\n &\\qquad\\qquad + 2\\sum_{1 \\leq j_1, \\ldots, j_{2k}, i_{2k} \\leq n} \\Omega_{j_1}{}^{j_2} \\wedge \\ldots \\wedge \\Omega_{j_{2k-3}}{}^{j_{2k-2}} \\wedge \\omega_{j_{2k-1}}{}^{i_{2k}} \\wedge \\omega_{i_{2k}}{}^{j_{2k}} \\wedge \\theta^{[J]}.\\end{aligned}$$\n\nWe thus get $$\\begin{aligned}\n2^k\\,k!\\Lambda_k \n &= \\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} d\\Big(\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}\\Big)\\\\\n &\\qquad + \\sum_{1 \\leq i_1, \\ldots, i_{2k}, p_k \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{p_{k}} \\wedge \\omega_{p_k}{}^{i_{2k}} \\wedge \\theta^{[I]}.\\end{aligned}$$\n\nSet $$\\begin{aligned}\n\\Lambda^1_k \n &= \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]},\\\\\n\\Lambda^2_k\n &= \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k}, p_k \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{p_{k}} \\wedge \\omega_{p_k}{}^{i_{2k}} \\wedge \\theta^{[I]}.\\end{aligned}$$ Then $\\Lambda_k = d\\Lambda^1_k + \\Lambda^2_k$. It should be noted that, unlike $\\Lambda_k$, $\\Lambda^1_k$ and $\\Lambda^2_k$ are frame dependent.",
"\n\nHigher order mass {#Sec:MassDef}\n=================\n\nLet $(M^n,g)$ be a Riemannian manifold and assume that there is a compact set $K \\subset M$ such that $M\\setminus K$ has an asymptotic flat structure of order $\\tau$: There are some $R \\geq 1$ and a diffeomorphism $\\Phi: M\\setminus K \\rightarrow \\RR^n \\setminus B_R$ such that $$(\\Phi^* g)_{ij}(x) = \\delta_{ij} + o_2(|x|^{-\\tau}) \\text{ as } |x| \\rightarrow \\infty,$$ where $x = (x^1, \\ldots, x^n)$ is the coordinate function with respect to $\\Phi$ and we write $f = o_l(|x|^{-\\tau})$ if $\\partial_{i_1} \\ldots \\partial_{i_p} f = o(|x|^{-\\tau - p})$ for any $1 \\leq p \\leq l$. We also assume that $$\\Lambda_k \\in L^1(M).$$ For simplicity, we only consider the case where $M$ has one end; the general case requires minor modification.",
"\n\nWith respect to the asymptotic structure $\\Phi$, let $e_i = \\partial_{x^i}$ and $\\theta^i = dx^i$. The connection one-forms and curvature two-forms are defined by $$\\nabla_X e_i = \\omega_i{}^j(X)\\,e_j \\text{ and } \\Omega_i{}^j(X,Y) = \\theta^j(R(X,Y)e_i).$$ We note that $\\omega_i{}^j$ and $\\Omega_i{}^j$ may not be skew-symmetric. ",
"Define the $(n-1)$-form $$\\Lambda^{1}_k(\\Phi) = \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\theta^{[I]}$$ and the associate “$k$-th order mass” $$m_k(\\Phi) = \\lim_{R \\rightarrow \\infty} \\int_{S_R} (-1)^k\\,\\Lambda^1_k(\\Phi).$$ Here $S_R$ denotes the coordinate sphere of radius $R$ centered at the origin.",
"\n\nTo show that $m_k(\\Phi)$ is well-defined, we use the decomposition of $\\Lambda_k$ which we derived earlier (in an orthonormal frame). ",
"We first use the Gram-Schmidt orthogonalization to construct an orthonormal frame: $$\\begin{aligned}\n\\tilde e_1 \n &= \\frac{e_1}{|e_1|},\\\\\n\\tilde e_2 \n &= \\frac{e_2 - g(e_2,\\tilde e_1)\\,\\tilde e_1}{|e_2 - g(e_2,\\tilde e_1)\\,\\tilde e_1|},\\\\\n\\ldots\\\\\n\\tilde e_n\n &= \\frac{e_n - g(e_n,\\tilde e_1)\\,\\tilde e_1 - \\ldots - g(e_n, \\tilde e_{n-1})\\tilde e_{n-1}}{|e_n - g(e_n,\\tilde e_1)\\,\\tilde e_1 - \\ldots - g(e_n, \\tilde e_{n-1})\\tilde e_{n-1}|}.\\end{aligned}$$ Evidently, $$\\tilde e_i = e_i + o_2(|x|^{-\\tau}).$$ Let $\\{\\tilde\\theta^i\\}$ be the dual frame to $\\{\\tilde e_i\\}$ and define the connection one-forms $\\tilde \\omega_i{}^j$ and curvature two-forms $\\tilde \\Omega_i{}^j$ accordingly. ",
"Set $$\\begin{aligned}\n\\tilde\\Lambda^1_k \n &= \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} \\tilde\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\tilde \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\tilde\\omega_{i_{2k-1}}{}^{i_{2k}} \\wedge \\tilde\\theta^{[I]},\\\\\n\\tilde\\Lambda^2_k\n &= \\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k}, p_k \\leq n} \\tilde\\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\tilde\\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\tilde\\omega_{i_{2k-1}}{}^{p_{k}} \\wedge \\tilde\\omega_{p_k}{}^{i_{2k}} \\wedge \\tilde\\theta^{[I]}.\\end{aligned}$$ Then $\\Lambda_k = d\\tilde\\Lambda^1_k + \\tilde\\Lambda^2_k$.\n\nTo relate $\\tilde \\omega_i{}^j$ and $\\tilde \\Omega_i{}^j$ to $\\omega_i{}^j$ and $\\Omega_i{}^j$, we write $$\\tilde e_i = P_i{}^j\\,e_j \\text{ and } \\tilde\\theta^j = (P^t)_i{}^j\\,\\theta^i$$ where the matrix $P$ satisfies $$P_i{}^j = \\delta_{ij} + o_2(|x|^{-\\tau}).$$ We have $$\\nabla_X \\tilde e_i = \\nabla_X (P_i{}^j\\,e_j) = (dP_i{}^j(X) + P_i{}^k\\,\\omega_k{}^j(X))e_j = (dP_i{}^j(X) + P_i{}^k\\,\\omega_k{}^j(X))(P^{-1})_j{}^l\\,\\tilde e_l,$$ which implies that $$\\tilde\\omega_i{}^j = \\omega_i{}^j + dP_i{}^j + o_1(|x|^{-2\\tau - 1}).$$ Likewise $$\\tilde \\Omega_i{}^j = \\tilde \\theta_j(R(X,Y)\\tilde e_i) = (P^t)_j{}^k P_i{}^l\\,\\theta_k(R(X,Y)e_l) = (P^t)_j{}^k P_i{}^l\\,\\Omega_k{}^l = \\Omega_i{}^j + o(|x|^{-2\\tau - 2}).$$ From the above computation, we see that $$\\tilde\\Lambda^2_k = O(|x|^{-(\\tau(k+1) + 2k)}) \\in L^1(M),$$ and $$\\begin{aligned}\n\\tilde \\Lambda^1_k - \\Lambda^1_k\n &= d\\Big(\\frac{1}{2^k\\,k!}\\sum_{1 \\leq i_1, \\ldots, i_{2k} \\leq n} [P_{i_{2k-1}}{}^{i_{2k}} - \\delta_{i_{2k-1}i_{2k}}] \\Omega_{i_1}{}^{i_2} \\wedge \\ldots \\wedge \\Omega_{i_{2k-3}}{}^{i_{2k-2}} \\wedge \\theta^{[I]}\\Big)\\\\\n &\\qquad+ o(|x|^{-(\\tau(k+1) + 2k) + 1}). ",
" \\end{aligned}$$ These lead to, for $R \\gg N \\gg R_0$, $$\\begin{aligned}\n\\int_{S_R} \\Lambda^1_k \n &= \\int_{S_R} \\tilde\\Lambda^1_k + o(R^{n - (\\tau(k+1) + 2k)})\\\\\n &= \\int_{S_{N}} \\tilde\\Lambda^1_k \n + \\int_{B_R \\setminus B_{N}} \\Big[\\Lambda_k + \\tilde\\Lambda^2_k\\Big]\n + o(R^{n - (\\tau(k+1) + 2k)}).\\end{aligned}$$ Hence, for $$\\tau > \\frac{n-2k}{k+1}$$ the mass $m_k(\\Phi)$ is well-defined.",
"\n\nIn fact, the argument above shows that if $D_j$ is an exhaustion of $M$ by closed sets such that $$R_j = \\inf\\{ |x|: x \\in \\partial D_k\\} \\rightarrow \\infty \\text{ and } R_j^{-(n-1)}|\\partial D_k| \\text{ remains bounded as } j \\rightarrow \\infty$$ then $$m_k(\\Phi) = \\lim_{j \\rightarrow \\infty } \\int_{S_j} (-1)^k\\,\\Lambda^1_k.$$ We show next that $m_k(\\Phi)$ is independent of the asymptotic structure $\\Phi$. Assume that $\\tilde \\Phi$ is another asymptotic structure of $(M,g)$ and let $\\tilde x = (\\tilde x^1, \\ldots, \\tilde x^n)$ denotes the coordinate function with respect to $\\tilde \\Phi$. To show that $m_k(\\Phi) = m_k(\\tilde \\Phi)$ we appeal to a theorem of Bartnik [@Bartnik86 Theorem 3.1] to find harmonic coordinates $y = (y^1, \\ldots, y^n)$ and $\\tilde y = (\\tilde y^1, \\ldots, \\tilde y^n)$ such that $$\\begin{aligned}\n&|x^i - y^i| + |\\tilde x^i - \\tilde y^i| = o(|x|^{1 - \\tau}) = o(|\\tilde x|^{1 - \\tau}),\\\\\n&|g(\\partial_{x^i}, \\partial_{x^j}) - g(\\partial_{y^i}, \\partial_{y^j})| + |g(\\partial_{\\tilde x^i}, \\partial_{\\tilde x^j}) - g(\\partial_{\\tilde y^i}, \\partial_{\\tilde y^j})| = o(|x|^{- \\tau}) = o(|\\tilde x|^{ - \\tau}),\\\\\n&y^i = A_j{}^i\\,\\tilde y^j + c^i,\\end{aligned}$$ where $A_j{}^i$ and $c^i$ are constants. ",
"Note that the second relation and that the metric $g$ is asymptotically flat implies that the matrix $A = (A_j{}^i)$ is orthonormal. ",
"Now the argument above show that in defining $m_k(\\Phi)$ we can use the coordinate functions $y^i$’s instead of the $x^i$’s. ",
"Likewise $m_k(\\tilde \\Phi)$ can be computed using $\\tilde y^i$’s instead of $\\tilde x^i$’s. ",
"But the frame $\\partial_{y^i}$ and $\\partial_{\\tilde y^i}$ differ from one another by a rigid rotation: $\\partial_{y_i} = A_i{}^j\\,\\partial_{\\tilde y^j}$. The argument proving that $\\Lambda_k$ is frame independent applies showing that $\\Lambda^1_k(\\partial_{y^i}) = \\Lambda^1_k(\\partial_{\\tilde y^i})$. This proves that $m_k = m_k(\\Phi)$ is independent of $\\Phi$.\n\nWe have thus shown that\n\n\\[Thm:MassDef\\] Let $(M,g)$ be a complete $n$-dimensional Riemannian manifold which is asymptotically flat of order $\\tau$, i.e. there is a compact set $K$ and a diffeomorphism $\\Phi: M \\setminus K \\rightarrow \\RR^n \\setminus B_{R_0}$ for some $R_0 > 0$ such that in such coordinate system the metric $g$ satisfies $g_{ij} = \\delta_{ij} + o_3(|x|^{-\\tau})$. Assume further that the curvature $\\Lambda_k$ belongs to $L^1(M)$. Fix $1 \\le k < \\frac{n}{2}$. If $\\tau > \\frac{n - 2k}{k + 1}$, then the mass $$m_k = \\lim_{R \\rightarrow \\infty} \\int_{S_R} (-1)^k\\,\\Lambda^1_k$$ is well-defined and is independent of the asymptotic structure at infinity.",
"\n\nTo finish this section, we give an example. ",
"Fix some $1 \\leq k < \\frac{n}{2}$. Consider an asymptotically flat manifold where the metric takes the following form at infinity $$g_{ij} = \\exp\\Big(\\frac{2m}{r^{\\frac{n-2k}{k}}}\\Big)\\delta_{ij} + o_2(r^{-\\frac{n-2k}{k}}).$$ The connection one-forms and the curvature two-forms are $$\\begin{aligned}\n\\omega_i{}^j \n &= \\Gamma_{ik}^j\\,dx^k\n = -\\frac{(n - 2k)}{k}\\,\\frac{m}{r^{\\frac{n}{k}}}(\\delta_{ij}\\,r\\,dr + x^i\\,dx^j - x^j\\,dx^i) + o(r^{1-\\frac{n}{k}}),\\\\\n\\Omega_i{}^j\n &= d\\omega_i{}^j - \\omega_i{}^t \\wedge \\omega_t{}^j \\\\\n &= \\frac{(n - 2k)n}{k^2}\\,\\frac{m}{r^{\\frac{n + k}{k}}}\\,dr \\wedge (x^i\\,dx^j - x^j\\,dx^i) -\\frac{2(n - 2k)}{k}\\,\\frac{m}{r^{\\frac{n}{k}}} \\,dx^i\\wedge dx^j + o(r^{-\\frac{n}{k}}).\\end{aligned}$$ Thus, $$\\Lambda_k^1 \\rfloor S_R = c(n,k)\\,\\frac{(-1)^k\\,m^k}{R^n} \\sum_{1 \\leq i, j \\leq n} (x^idx^j - x^j dx^i) \\wedge *(dx^i \\wedge dx^j)$$ and so $$m_k = c(n,k)\\,m^k.$$ where $c(n,k)$ is some positive constant.",
"\n\nThe above computation also shows that, for the time symmetric slice of the Schwarzschild spacetime in higher dimensions, only the first mass (which is the same as the ADM mass) is nonzero. ",
"All the higher order masses, if well-defined, vanish.",
"\n\nOn the non-negativity of the $k$-th mass {#Sec:PosMass}\n========================================\n\nIt is of interest to see if the $k$-th mass is non-negative under some assumption on either the $\\Lambda_k$ or the $\\sigma_k$ curvature. ",
"We are only able to do so under a very restrictive hypothesis that $(M,g)$ is locally conformally flat and that $\\lambda(A_g)$ is asymptotically on the boundary of the $\\Gamma_k$ cone. ",
"Of the two assumptions, we believe the local conformal flatness assumption is more severe. ",
"Note also that, in Schoen and Yau’s proof of the positive mass theorem [@SchoenYau79-CMP; @SchoenYau81-CMP], one can assume without loss of generality that the manifold is asymptotically scalar flat (i.e. $\\lambda(A_g) \\in \\partial \\Gamma_1$).",
"\n\n\\[PosMass\\] Let $(M,g)$ be a complete, asymptotically flat Riemannian manifold of dimension $n \\geq 3$ and let $2 \\leq k < \\frac{n}{2}$. If, near a given end, $g$ is locally conformally flat, $A_g$ belongs to the $\\bar\\Gamma_k$ cone and the $\\Lambda_k$ curvature vanishes, then the $k$-th mass of that end is non-negative. ",
"Furthermore, if the $k$-th mass is zero, then, near that end, $(M,g)$ is isometric to an Euclidean end.",
"\n\nThe proof of this theorem has a different flavor from what is presented in this paper and will be published elsewhere.",
"\n\n[10]{}\n\nRichard L. Arnowitt, Stanley Deser, and Charles W. Misner, *[Coordinate invariance and energy expressions in general relativity]{}*, Phys.",
"Rev. **122**, 997.",
"\n\nRobert Bartnik, *The mass of an asymptotically flat manifold*, Comm. ",
"Pure Appl. ",
"Math. **",
"39** (1986), no.",
" 5, 661–693.",
"\n\nSun-Yung A. Chang, Matthew J. Gursky, and Paul Yang, *An equation of [M]{}onge-[A]{}mpère type in conformal geometry, and four-manifolds of positive [R]{}icci curvature*, Ann. ",
"of Math. (",
"2) **155** (2002), no.",
" 3, 709–787.",
"\n\n[to3em]{}, *An a priori estimate for a fully nonlinear equation on four-manifolds*, J. Anal. ",
"Math. **",
"87** (2002), 151–186, Dedicated to the memory of Thomas H. Wolff.",
"\n\n[to3em]{}, *A conformally invariant sphere theorem in four dimensions*, Publ. ",
"Math. ",
"Inst. ",
"Hautes Études Sci. (",
"2003), no.",
" 98, 105–143.",
"\n\n[to3em]{}, *Entire solutions of a fully nonlinear equation*, Lectures on partial differential equations, New Stud. ",
"Adv. ",
"Math., ",
"vol.",
" 2, Int. ",
"Press, Somerville, MA, 2003, pp.",
" 43–60.",
"\n\nSun-Yung Alice Chang and Hao Fang, *A class of variational functionals in conformal geometry*, Int. ",
"Math. ",
"Res. ",
"Not. ",
"IMRN (2008), no.",
" 7, Art. ",
"ID rnn008, 16.",
"\n\nOlivier Druet, *Compactness for [Y]{}amabe metrics in low dimensions*, Int. ",
"Math. ",
"Res. ",
"Not. (",
"2004), no.",
" 23, 1143–1191.",
"\n\nYuxin Ge and Guofang Wang, *On a fully nonlinear [Y]{}amabe problem*, Ann. ",
"Sci. ",
"École Norm. ",
"Sup. (",
"4) **39** (2006), no.",
" 4, 569–598.",
"\n\nC. Robin Graham, *Extended obstruction tensors and renormalized volume coefficients*, Adv. ",
"Math. **",
"220** (2009), no.",
" 6, 1956–1985.",
"\n\nPengfei Guan and Guofang Wang, *A fully nonlinear conformal flow on locally conformally flat manifolds*, J. Reine Angew. ",
"Math. **",
"557** (2003), 219–238.",
"\n\nMatthew J. Gursky and Jeff A. Viaclovsky, *Prescribing symmetric functions of the eigenvalues of the [R]{}icci tensor*, Ann. ",
"of Math. (",
"2) **166** (2007), no.",
" 2, 475–531.",
"\n\nM. A. Khuri, F. C. Marques, and R. M. Schoen, *A compactness theorem for the [Y]{}amabe problem*, J. Differential Geom. **",
"81** (2009), no.",
" 1, 143–196.",
"\n\nAobing Li and YanYan Li, *On some conformally invariant fully nonlinear equations*, Comm. ",
"Pure Appl. ",
"Math. **",
"56** (2003), no.",
" 10, 1416–1464.",
"\n\n[to3em]{}, *On some conformally invariant fully nonlinear equations. [",
"II]{}. [",
"L]{}iouville, [H]{}arnack and [Y]{}amabe*, Acta Math. **",
"195** (2005), 117–154.",
"\n\nYanYan Li and Luc Nguyen, *A fully nonlinear version of the [Y]{}amabe problem on locally conformally flat manifolds with umbilic boundary*, (2009), http://arxiv.org/abs/0911.3366v1.",
"\n\nYanYan Li and Lei Zhang, *Compactness of solutions to the [Y]{}amabe problem. [",
"II]{}*, Calc. ",
"Var. ",
"Partial Differential Equations **24** (2005), no.",
" 2, 185–237.",
"\n\n[to3em]{}, *Compactness of solutions to the [Y]{}amabe problem. [",
"III]{}*, J. Funct. ",
"Anal. **",
"245** (2007), no.",
" 2, 438–474.",
"\n\nYanYan Li and Meijun Zhu, *Yamabe type equations on three-dimensional [R]{}iemannian manifolds*, Commun. ",
"Contemp. ",
"Math. **",
"1** (1999), no.",
" 1, 1–50.",
"\n\nFernando Coda Marques, *A priori estimates for the [Y]{}amabe problem in the non-locally conformally flat case*, J. Differential Geom. **",
"71** (2005), no.",
" 2, 315–346.",
"\n\nRichard Schoen, *Conformal deformation of a [R]{}iemannian metric to constant scalar curvature*, J. Differential Geom. **",
"20** (1984), no.",
" 2, 479–495.",
"\n\nRichard Schoen and Shing Tung Yau, *On the proof of the positive mass conjecture in general relativity*, Comm. ",
"Math. ",
"Phys. **",
"65** (1979), no.",
" 1, 45–76.",
"\n\n[to3em]{}, *Proof of the positive mass theorem. [",
"II]{}*, Comm. ",
"Math. ",
"Phys. **",
"79** (1981), no.",
" 2, 231–260. [",
"MR ]{}[612249 (83i:83045)]{}\n\nRichard M. Schoen, *On the number of constant scalar curvature metrics in a conformal class*, Differential geometry, Pitman Monogr. ",
"Surveys Pure Appl. ",
"Math., ",
"vol.",
" 52, Longman Sci. ",
"Tech., ",
"Harlow, 1991, pp.",
" 311–320.",
"\n\nWei-Min Sheng, Neil S. Trudinger, and Xu-Jia Wang, *The [Y]{}amabe problem for higher order curvatures*, J. Differential Geom. **",
"77** (2007), no.",
" 3, 515–553.",
"\n\nNeil S. Trudinger and Xu-Jia Wang, *On [H]{}arnack inequalities and singularities of admissible metrics in the [Y]{}amabe problem*, Calc. ",
"Var. ",
"Partial Differential Equations **35** (2009), no.",
" 3, 317–338.",
"\n\n[to3em]{}, *The intermediate case of the [Y]{}amabe problem for higher order curvatures*, Int. ",
"Math. ",
"Res. ",
"Not. ",
"IMRN (2010), no.",
" 13, 2437–2458.",
"\n\nJeff A. Viaclovsky, *Conformal geometry, contact geometry, and the calculus of variations*, Duke Math. ",
"J. **101** (2000), no.",
" 2, 283–316.",
"\n\n[to3em]{}, *Conformally invariant [M]{}onge-[A]{}mpère equations: global solutions*, Trans. ",
"Amer. ",
"Math. ",
"Soc. **",
"352** (2000), no.",
" 9, 4371–4379.",
"\n\n[to3em]{}, *Estimates and existence results for some fully nonlinear elliptic equations on [R]{}iemannian manifolds*, Comm. ",
"Anal. ",
"Geom. **",
"10** (2002), no.",
" 4, 815–846.",
"\n\n[^1]: Mathematics Department, Rutgers University. ",
"Partially supported by NSF Grant DMS-1203961\n\n[^2]: Mathematics Department, Princeton University\n"
] |
{
"pile_set_name": "ArXiv"
}
|
[
0.0006288907025009394,
0.0011375924805179238,
0.000615616503637284,
0.0012677176855504513,
0.01250169612467289,
0.0025522534269839525,
0.0005483381100930274,
0.0005922889686189592,
0.0007045452366583049,
0.0005919373943470418,
0.0006758898380212486,
0.0007012030691839755,
0.0008591318619437516,
0.052417781203985214,
0.0008431728347204626,
0.0008799939532764256,
0.0006568524986505508,
0.0005614404217340052,
0.000754169886931777,
0.0006414931267499924,
0.0006675937329418957,
0.0006009460776112974,
0.0006552358972840011,
0.0005669837701134384,
0.0008561747381463647,
0.0006369244074448943,
0.0048826709389686584,
0.0017702128970995545,
0.000679781602229923,
0.0005237340228632092,
0.0067032622173428535,
0.001046312041580677,
0.004292071796953678,
0.16720493137836456,
0.06378470361232758,
0.0006028793868608773,
0.009453196078538895,
0.19752609729766846,
0.0007949246792122722,
0.0005840784288011491,
0.012417894788086414,
0.19700036942958832,
0.17043568193912506,
0.1648401916027069,
0.0018036909168586135,
0.11076068878173828,
0.02140035107731819,
0.0014444174012169242,
0.020396655425429344,
0.0008735487353987992,
0.031614210456609726,
0.21700330078601837,
0.08183848857879639,
0.04044747352600098,
0.0009599887998774648,
0.0038039537612348795,
0.06497494876384735,
0.009550802409648895,
0.0005628603976219893,
0.08351611346006393,
0.0006651629810221493,
0.0007365530473180115,
0.015888025984168053,
0.0014117991086095572,
0.0005988542689010501,
0.0007945967372506857,
0.01324203610420227,
0.0018141692271456122,
0.0005877821822650731,
0.0006704540573991835,
0.001074502244591713,
0.000871542957611382,
0.002247717697173357,
0.0010769310174509883,
0.0007987383287400007,
0.00095939269522205,
0.000668986001983285,
0.0006706588319502771,
0.0007853478309698403,
0.0010230327025055885,
0.0007661569397896528,
0.0010769310174509883,
0.0006104913190938532,
0.000815008650533855,
0.0008406097185797989,
0.00112181156873703,
0.000644288316834718,
0.0007623948622494936,
0.0010113692842423916,
0.000930369715206325,
0.0011915506329387426,
0.0007826202781870961,
0.0008846513810567558,
0.0007993661565706134,
0.0006584808579646051,
0.0010468638502061367,
0.0008025098941288888,
0.0008406097185797989,
0.000981261720880866,
0.001033295993693173,
0.0006868799682706594,
0.0007670011254958808,
0.0023366729728877544,
0.0006549190729856491,
0.0008406097185797989,
0.000981261720880866,
0.0008151469519361854,
0.0007587214349769056,
0.0008470421307720244,
0.0008151830988936126,
0.0008689719252288342,
0.0007160904351621866,
0.0008119270787574351,
0.0007999963127076626,
0.0009574079886078835,
0.0007046869723126292,
0.0010769310174509883,
0.0007626586011610925,
0.0006365905865095556,
0.00068478420143947,
0.0010769310174509883,
0.0008329001138918102,
0.0007278596167452633,
0.0006706588319502771,
0.0007882497739046812,
0.0007481562788598239,
0.0007500848732888699,
0.0007574711926281452,
0.0008449023589491844,
0.0008250821847468615,
0.002247717697173357,
0.0010769310174509883,
0.0007661923882551491,
0.0008605475886724889,
0.0007397832814604044,
0.001079309731721878,
0.0007918291375972331,
0.0008585188770666718,
0.0006848556222394109,
0.0006445229519158602,
0.0008673151023685932,
0.0008100797422230244,
0.000652433664072305,
0.0008986959583126009,
0.000831758021377027,
0.0007747208001092076,
0.9633256793022156,
0.0007695378153584898,
0.0008942265994846821,
0.0006837023538537323,
0.0006541156908497214,
0.0010769310174509883,
0.0007433344726450741,
0.0009777112863957882,
0.0006619885098189116,
0.0007738784770481288,
0.0007700964924879372,
0.0007414807914756238,
0.0007857696036808193,
0.0007526915869675577,
0.0007836836739443243,
0.0008406097185797989,
0.0026141153648495674,
0.0008016656502149999,
0.0008516515954397619,
0.0007756430422887206,
0.0009946157224476337,
0.0008406097185797989,
0.0026141153648495674,
0.0008000889210961759,
0.0008408709545619786,
0.0007685935706831515,
0.0009489724761806428,
0.0007826202781870961,
0.0008846513810567558,
0.0007169060409069061,
0.0007395246648229659,
0.000666297972202301,
0.0007197849918156862,
0.0007116130436770618,
0.00079361378448084,
0.0008842358947731555,
0.0007725544273853302,
0.0008100797422230244,
0.0006487731589004397,
0.0007734873797744513,
0.0009567673550918698,
0.0008406097185797989,
0.000981261720880866,
0.001033295993693173,
0.0006814427906647325,
0.0009917945135384798,
0.0006574264843948185,
0.0008084067376330495,
0.000671437184792012,
0.0007538206991739571,
0.001252227695658803,
0.0008406097185797989,
0.0009180557681247592,
0.0007081800140440464,
0.0011814377503469586,
0.000733239809051156,
0.7230135798454285,
0.0009407229954376817,
0.0007645703153684735,
0.0008896284853108227,
0.0006388750043697655,
0.0006061606691218913
] | 0.017417 | 208 |
[
"Q:\n\nWhy doesn't my form submit automatically?",
"\n\nI don't see what is wrong, does submit() not work anymore? ",
"\n<html>\n<head>\n <title>This is the title</title>\n <script type = \"text/javascript\">\n\n function onLoad() {\n document.getElementById(\"input1\").value=\"text1\";\n document.getElementById(\"input2\").value=\"text2\";\n document.getElementById('form').submit();\n }\n\n </script>\n</head>\n<body onload=\"onLoad();\">\n<form method=\"post\" name=\"form\" id=\"form\" action=\"test.txt\">\n <label for=\"input1\">Input1</label> <input id=\"input1\" name=\"input1\" type=\"text\"/>\n <label for=\"input2\">Input2</label> <input id=\"input2\" name=\"input2\" type=\"text\"/>\n <input name=\"submit\" id=\"submit\" value=\"submit\" type=\"submit\"/>\n</form>\n</body>\n</html>\n\nA:\n\nYour problem is that the button is named submit and hs id submit. ",
" Change that and it works.",
"\nYou overwrote submit function with a submit button element.",
"\n\n"
] |
{
"pile_set_name": "StackExchange"
}
|
[
0.000736013927962631,
0.0007326478371396661,
0.0033365485724061728,
0.0006975422729738057,
0.0007025381783023477,
0.001995444530621171
] | 0.001367 | 6 |
[
"Iran’s Assyro-Chaldean churches have censured US officials’ “interventionist” claims about the situation of religious minorities in the Islamic Republic, calling on Washington to be concerned about its own poor human rights record at home and abroad instead of shedding “crocodile tears” for others.",
"\n\nIn a statement released on Tuesday, the churches rejected US accusations of rights violations against religious minorities in Iran, saying all divine religions in the country have their own representatives at the Iranian parliament (Majlis), who enjoy equal rights with fellow lawmakers.",
"\n\nWithin the Islamic establishment, the statement said, the churches feel free to hold religious ceremonies and cultural-sports festivals while preserving the Assyrian language. ",
"It added that a special budget has been allocated to Iranian religious communities.",
"\n\nThese are “just examples of the commitment of the Islamic Republic of Iran’s holy establishment to the issue of divine religions and their followers and to protecting their moral and social values,” the statement read.",
"\n\nIranian Christians attend Christmas rituals at the Saint Mary Chaldean- Assyrian Catholic church, in downtown Tehran, Iran. (",
"Photo by AP)\n\nThe “interventionist comments” by American statesmen “through official platforms and cyberspace, especially Twitter, about violations of religious minorities' rights in the Islamic Republic of Iran are no more than shedding crocodile tears,” the statement added.",
"\n\nThe Assyro-Chaldean churches further called on US officials to focus on their own domestic issues and engage in “effective and constructive relations with all governments” instead of interfering in their internal affairs.",
"\n\nThey also condemned Washington’s support for the warmongering regimes of Israel and Saudi Arabia, calling on the US to stop supporting the bloody wars in Syria and Yemen.",
"\n\nThey further noted that Iranian religious minorities need no “guardian” in their homeland and are able to defend their rights through their representatives at the parliament and related government institutions.",
"\n\nThe official religion of Iran is Shia Islam under the Constitution. ",
"The Islamic Republic recognizes Zoroastrian, Jewish, and Christian religious minorities, among others.",
"\n\nThe Constitution stipulates that “the investigation of individual beliefs is forbidden,” and that “no one may be molested or taken to task simply for holding a certain belief.”",
"\n\nThe US, however, has long been seeking to represent itself as a defender of the rights of Iranian religious minorities, accusing the Islamic establishment of intolerance towards them.",
"\n\nSuch accusations have seen a sharp rise since the inauguration of President Donald Trump.",
"\n\nIn late July, Secretary of State Mike Pompeo took to Twitter to attack Iran’s Islamic establishment again, claiming religious minorities, including Jews, Christians and Sunni Muslims, “live in fear” at home.",
"\n\nThe department under Pompeo’s watch also released its annual “religious freedom report\" in late May, in which it targeted Iran besides Washington’s other adversaries, including Russia and China.",
"\n\nThe Iran section of the report claimed that “non-Shia Muslims and those affiliated with a religion other than Islam” residing in the Islamic Republic faced “societal discrimination and harassment.”",
"\n\nTehran rejected that report as baseless."
] |
{
"pile_set_name": "OpenWebText2"
}
|
[
0.020213885232806206,
0.0006736721843481064,
0.0006049028015695512,
0.0005497101810760796,
0.0006306016002781689,
0.0007953622844070196,
0.001510321395471692,
0.0009010778740048409,
0.0010488313855603337,
0.0023912042379379272,
0.0008433347102254629,
0.0037234786432236433,
0.0009292198228649795,
0.002957400633022189,
0.0006824401789344847,
0.034211285412311554,
0.0010593982879072428,
0.001509925234131515,
0.0011506809387356043
] | 0.00402 | 19 |
[
"King: UA coach sending a message\n\nWednesday\n\nOct 30, 2013 at 5:30 AM\n\nBret Bielema’s straightforward message for high school athletes includes a subtle communication for Razorback fans.",
"\n\nThe Arkansas football coach recently quoted some in-house promotional material as saying, \"Are you going to be the next freshman to have a role in the season?\" ",
"and then added that a half-dozen or more Arkansas players are in line to make the All-Southeastern Conference Freshman Team.",
"\n\nFor Arkansas’ recruiting targets, the clear signal is that there will be an opportunity to start for Arkansas in 2014 and be among the few who are eligible for the All-SEC Freshman team. ",
"For fans, there is the warning, probably unintentional, that Arkansas is hurting at several positions — linebacker, wide receiver and defensive back come to mind — and that rebuilding Razorback football will take time.",
"\n\nThe thing is, Auburn, Ole Miss, Texas A&M and the established powers in the Western Division of the SEC are not sitting still, waiting on the Razorbacks. ",
"In my opinion, Bielema will need three recruiting classes to stockpile enough athletes that Arkansas fans can reasonably expect to be .500 in the SEC.",
"\n\nEight pure freshmen participated in the last game against Alabama and Bielema alluded to the need for immediate help when he said Arkansas might sign four or five junior college players.",
"\n\nBy the way, part of the equation for making the All-SEC Freshman Team is being in the right place at the right time. ",
"Guards Denver Kirkland and Dan Skipper are both likely to be on the team, but I don’t know how many other SEC teams are starting freshmen at guard. ",
"For instance, last year, A.J. Turner and Otha Peters tied for one of the linebacker spots on the All-Team in 2012. ",
"Turner started a half-dozen games, three more than Peters.",
"\n\nThis year, redshirt freshmen Darius Philon and Deatrich Wise could make the team and neither started a game until Philon replaced the injured Robert Thomas. ",
"Even though Jonathan Williams is the starter at running back, Alex Collins and tight end Hunter Henry are legitimate choices for the postseason honor, underscoring the point that it is easier for a freshman to shine at a skill position than it is for a first-year player to excel elsewhere.",
"\n\nAny Arkansas fan who applauded when junior college offensive tackle Jermaine Eluemunor turned his back on UCLA and embraced Arkansas cannot condemn the young man for changing his mind again and opting for Texas A&M.\n\nMoving on without complaint falls under the category of what’s good for the goose, is good for the gander.",
"\n\nThe Undefeated\n\nWith a month remaining in the college football season, eight teams, including six from major Bowl Championship Series conferences, are undefeated. ",
"At this time last year, there were 10 unbeatens and only Notre Dame finished the regular season without a blemish.",
"\n\nOne goes down this week when Miami is at Florida State. ",
"Ohio State has the easiest route to perfect, but the Buckeyes can’t get to the BCS title game unless two of the three teams in front of them lose. ",
"Chances are 50-50 that will happen and it’s not impossible that all three will stumble.",
"\n\nMiami has come from behind the last couple of weeks, an accomplishment that says something about character. ",
"And, even if Florida State wins this week, the Seminoles might have to beat Miami again in the Atlantic Coast Conference Championship Game.",
"\n\nMy pick for most likely loser is Oregon, which goes against Stanford on Nov. 7 — a Thursday night on which the Pac 12’s best will have an opportunity to impress, along unbeaten Baylor, which is up against Oklahoma. ",
"Two days later, LSU can beat Alabama — arguably a more complete unit than the national championship team of 2012 — if the good Zach Mettenberger is at quarterback."
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006471610977314413,
0.0006158429896458983,
0.0006358244572766125,
0.0005721039487980306,
0.0008559157140552998,
0.0007809793460182846,
0.0006607166142202914,
0.0006349790492095053,
0.0006227861740626395,
0.0006164234946481884,
0.0006276766071096063,
0.000854753889143467,
0.0008414567564614117,
0.000793140905443579,
0.003739365143701434,
0.0007067446131259203,
0.0012957154540345073,
0.000637043674942106,
0.0012420204002410173,
0.0007045462261885405,
0.0006232597515918314,
0.0008016239735297859,
0.010708159767091274,
0.0012285852571949363
] | 0.00131 | 24 |
[
"A wide variety of light emitting devices are known in the art including, for example, incandescent light bulbs, fluorescent lights, and semiconductor light emitting devices such as light emitting diodes (“LEDs”).",
"\nThere are a variety of resources utilized to describe the light produced from a light emitting device, one commonly used resource is 1931 CIE (Commission Internationale de l'Éclairage) Chromaticity Diagram. ",
"The 1931 CIE Chromaticity Diagram maps out the human color perception in terms of two CIE parameters x and y. The spectral colors are distributed around the edge of the outlined space, which includes all of the hues perceived by the human eye. ",
"The boundary line represents maximum saturation for the spectral colors, and the interior portion represents less saturated colors including white light. ",
"The diagram also depicts the Planckian locus, also referred to as the black body locus (BBL), with correlated color temperatures, which represents the chromaticity coordinates (i.e., color points) that correspond to radiation from a black-body at different temperatures. ",
"Illuminants that produce light on or near the BBL can thus be described in terms of their correlated color temperatures (CCT). ",
"These illuminants yield pleasing “white light” to human observers, with general illumination typically utilizing CCT values between 1,800K and 10,000K.\nColor rendering index (CRI) is described as an indication of the vibrancy of the color of light being produced by a light source. ",
"In practical terms, the CRI is a relative measure of the shift in surface color of an object when lit by a particular lamp as compared to a reference light source, typically either a black-body radiator or the daylight spectrum. ",
"The higher the CRI value for a particular light source, the better that the light source renders the colors of various objects it is used to illuminate.",
"\nLEDs have the potential to exhibit very high power efficiencies relative to conventional incandescent or fluorescent lights. ",
"Most LEDs are substantially monochromatic light sources that appear to emit light having a single color. ",
"Thus, the spectral power distribution (“SPD”) of the light emitted by most LEDs is tightly centered about a “peak” wavelength, which is the single wavelength where the spectral power distribution or “emission spectrum” of the LED reaches its maximum as detected by a photo-detector. ",
"LEDs typically have a full-width half-maximum wavelength range of about 10 nm to 30 nm, comparatively narrow with respect to the broad range of visible light to the human eye, which ranges from approximately from 380 nm to 800 nm.",
"\nIn order to use LEDs to generate white light, LED lamps have been provided that include two or more LEDs that each emit a light of a different color. ",
"The different colors combine to produce a desired intensity and/or color of white light. ",
"For example, by simultaneously energizing red, green and blue LEDs, the resulting combined light may appear white, or nearly white, depending on, for example, the relative intensities, peak wavelengths and spectral power distributions of the source red, green and blue LEDs. ",
"The aggregate emissions from red, green, and blue LEDs typically provide poor CRI for general illumination applications due to the gaps in the spectral power distribution in regions remote from the peak wavelengths of the LEDs.",
"\nWhite light may also be produced by utilizing one or more luminescent materials such as phosphors to convert some of the light emitted by one or more LEDs to light of one or more other colors. ",
"The combination of the light emitted by the LEDs that is not converted by the luminescent material(s) and the light of other colors that are emitted by the luminescent material(s) may produce a white or near-white light.",
"\nLED lamps have been provided that can emit white light with different CCT values within a range. ",
"Such lamps utilize two or more LEDs, with or without luminescent materials, with respective drive currents that are increased or decreased to increase or decrease the amount of light emitted by each LED. ",
"By controllably altering the power to the various LEDs in the lamp, the overall light emitted can be tuned to different CCT values. ",
"The range of CCT values that can be provided with adequate CRI values and efficiency is limited by the selection of LEDs.",
"\nThe spectral profiles of light emitted by white artificial lighting can impact circadian physiology, alertness, and cognitive performance levels. ",
"Bright artificial light can be used in a number of therapeutic applications, such as in the treatment of seasonal affective disorder (SAD), certain sleep problems, depression, jet lag, sleep disturbances in those with Parkinson's disease, the health consequences associated with shift work, and the resetting of the human circadian clock. ",
"Artificial lighting may change natural processes, interfere with melatonin production, or disrupt the circadian rhythm. ",
"Blue light may have a greater tendency than other colored light to affect living organisms through the disruption of their biological processes which can rely upon natural cycles of daylight and darkness. ",
"Exposure to blue light late in the evening and at night may be detrimental to one's health.",
"\nSignificant challenges remain in providing LED lamps that can provide white light across a range of CCT values while simultaneously achieving high efficiencies, high luminous flux, good color rendering, and acceptable color stability. ",
"It is also a challenge to provide lighting apparatuses that can provide desirable lighting performance while allowing for the control of circadian energy performance."
] |
{
"pile_set_name": "USPTO Backgrounds"
}
|
[
0.0006010748911648989,
0.0005626637721434236,
0.0006632060394622386,
0.0005529277841560543,
0.0006046010530553758,
0.0006082060281187296,
0.0006509821978397667,
0.0006383126601576805,
0.0006653473828919232,
0.0006483383476734161,
0.0007615714566782117,
0.0006246658740565181,
0.0006263270042836666,
0.0006052379030734301,
0.0006012906669639051,
0.0006121612386777997,
0.0006278899381868541,
0.000743595534004271,
0.0006321962573565543,
0.0005682291812263429,
0.0006534856511279941,
0.000626326072961092,
0.0005692108534276485,
0.0005627954378724098,
0.0006137455930002034,
0.0006893221288919449,
0.0006695035845041275,
0.0011168597266077995,
0.0005606319755315781,
0.0005897118826396763
] | 0.000642 | 30 |
[
"The long term goal is the elucidation of the atomic-level phenomena and mechanisms important to the understanding and ultimate modification of the biological occurrence, function and dysfunction of the apatite portion of dental hard tissue in vitro and in vivo. ",
"The differences between dental \"apatite\" and stoichiometric hydroxyapatite are recognized as being characteristics with particular biological interest and the studies are therefore focussed on them. ",
"The principal emphasis in the currently proposed work is on (1) defects, vacancies and disorder in apatites and human tooth enamel, TE, (2) calcium and hydroxyl ion deficiencies, (3) the structural locations, roles and interactions of chlorine, of carbonate, of acid phosphate, and of non-phosphate oxygen, and (4) atomistic mechanism of the diffusion process in apatite and TE, especially OH diffusion, all in human tooth enamel. ",
"In part (4), first Zr and then one or more of the elements Pb, Na, Mg, K, Zn, and Mn will be studied. ",
"The approach in the first three parts involves (1) the determination of some substitution-interaction features in analog systems with fewer parameters, (2) the deduction of plausible models for the structural locations and roles of the ions and vacancies producing the differences from pure hydroxyapatite, and (3) the selection of the most probable models on the basis of the stringent requirement that they simultaneously account for all known physical and chemical characteristics of the natural material, tooth enamel. ",
"Principal tools are x-ray and neutron diffraction, infrared and laser-Raman spectroscopy, deuterizability, and various chemical analysis methods. ",
"Particular strength is given to the model assessment and iterative improvement by the use of the powerful new pattern-fitting structure-refinement method applied to x-ray and neutron powder diffraction patterns of tooth enamel."
] |
{
"pile_set_name": "NIH ExPorter"
}
|
[
0.0005873545887880027,
0.0006102807819843292,
0.0006825698656029999,
0.000579988060053438,
0.0005875208880752325,
0.000588360009714961,
0.0005743656074628234
] | 0.000601 | 7 |
[
"Didaskalia (theatre)\n\nIn theatre studies, didaskalia is anything written within a play text that is not directly spoken by a character. ",
" The term is the modern re-use of the theatrical term of the classical antiquity διδασκαλία literally meaning \"teaching\", \"instruction\".",
"\n\nSee also\nDidascaliae\n\nReferences\n\nCategory:Theatre studies"
] |
{
"pile_set_name": "Wikipedia (en)"
}
|
[
0.0006532997940666974,
0.0006228075362741947,
0.0006084144697524607
] | 0.000628 | 3 |
[
"Ovarian abscess. ",
"A case report and review of the literature.",
"\nAn isolated ovarian abscess, unassociated with tubal lesions, is a rare occurrence. ",
"A case is described and the literature reviewed, with special consideration of the associated aetiological factors."
] |
{
"pile_set_name": "PubMed Abstracts"
}
|
[
0.48641860485076904,
0.0005525987362489104,
0.15819981694221497,
0.0005202305619604886
] | 0.161423 | 4 |
[
"535 U.S. 936\nNOLANv.",
"COCKRELL, DIRECTOR, TEXAS DEPARTMENT OF CRIMINAL JUSTICE, INSTITUTIONAL DIVISION.",
"\nNo. ",
"01-7635.",
"\nSupreme Court of the United States.",
"\nMarch 18, 2002.",
"\n\n1\nC. A. 5th Cir. ",
"Certiorari denied.",
"\n\n"
] |
{
"pile_set_name": "FreeLaw"
}
|
[
0.0009561227052472532,
0.0007488007540814579,
0.0013785817427560687,
0.0008514036890119314,
0.0009997845627367496,
0.0007234238437376916,
0.0011996100656688213,
0.0008755903108976781,
0.001995444530621171
] | 0.001081 | 9 |
[
"About Feiss\n\nRISK-FREE\n\nFormerly known as Murray Feiss, Feiss has offered a full line of high-quality, design-driven interior and exterior residential lighting for more than 60 years. ",
"Feiss delivers a fresh, heightened design approach to carefully crafted products across a wide variety of aesthetics to help you achieve your design vision.",
"\n\nAbout The Feiss Peyton Collection\n\nThe Peyton lighting collection is an unexpected contrast between the dramatic Black finish and the soft, romantic curves. ",
"The design flourishes and décorative details lend to the overall aesthetic of the dramatic light fixtures in the collection.",
"\n\nFREE Shipping\n\nAll Feiss products (including Freight) ship for FREE within the contiguous United States on orders over $50.",
"\n\nFREE Returns\n\nAll Feiss products that ship via UPS or FedEx Ground within the contiguous United States are FREE to return.",
"\n\nNO Restock Fee\n\nWe do not charge a restocking fee for any returnable Feiss products.",
"\n\nNO Sales Tax\n\nWe do not charge sales tax for Feiss products except those shipped to Pennsylvania.",
"\n\n110% Price Match Guarantee\n\nIf you find a Feiss product on another site for less than us, we will match it PLUS 10% of the difference.",
"\nLearn more"
] |
{
"pile_set_name": "Pile-CC"
}
|
[
0.0006282706162892282,
0.0005407535354606807,
0.0006446492043323815,
0.0005907309823669493,
0.0006645486573688686,
0.0006453804089687765,
0.002121698809787631,
0.0010622948175296187,
0.0006767145823687315,
0.0016971873119473457
] | 0.000927 | 10 |
[
"1. ",
"Field of the Invention\nThe present invention relates, in general, to a storage system such as automatic warehouses designed to take a great quantity of goods or many vehicles into or take them out of storage spaces on storage forks of racks in order to allow users to effectively store and manage goods or vehicles and, more particularly, to a palletless loading structure for a storage system for quickly and safely taking goods into and/or taking them out of a storage space on storage forks free of additional support pallets.",
"\n2. ",
"Description of the Prior Art\nAs well known to those skilled in the art, storage systems are a facility designed to store goods or other materials in a limited storage place and manage the stored goods or materials, effectively, which has been widely used as part of a large-scale material flow system or a warehouse in other industrial work places.",
"\nAs shown in FIG. ",
"1, a conventional storage system comprises a plurality of racks R having a vertical multistory configuration of a plurality of loading stages L, in which the racks R are arranged on a support surface spaced in an interval from each another to form a building structure and the loading stage L includes a movable support pallet (not shown) laid thereon to load goods, and a transporting unit T such as a lift or a stacker crane installed in an elevation space between the racks R to be vertically moved to put goods into or take goods out of a storage space on the loading stage L.\nThe transporting unit T carries a support pallet loaded with the goods W to an empty loading stage L of the rack R. Then, the goods-loaded support pallet is pulled over in a horizontal direction by a traction unit (not shown) to be placed onto the empty loading stage L and the goods shipment from the storage spaces vise versa.",
"\nIn the storage system, what is more important is the quick and accurate storage, shipment and inventory management of goods W. To it, the transporting unit T is under the control of a computer (not shown) to be automatically operated, so that goods W are automatically put into or taken out of the storage space on their loading stages L with particular inherent number or code being allotted to goods W and the loading stage L, respectively.",
"\nHowever, the conventional storage system needs a plurality of support pallets and at least one traction unit, separately, for the storage and shipment, so its loading configuration becomes complex. ",
"Further, a gross load imposed on the racks R as well as on the traction unit T during carrying goods W along with the support pallet is increased by a weight of a plurality of support pallets or one pallet and has to be reflected into the total configuration design of the storage system or the traction unit T. In case of the traction unit T, the support pallet has a bad effect on a power and time used up in carrying goods W.\nIf some goods-free or empty support pallets are placed on the loading stages S, it is necessary for the transporting unit T to remove the empty support pallet from the corresponding loading stage S in advance. ",
"For example, the transporting unit T is moved to the loading stage S to pull out the empty support pallet therefrom for next goods storage and then to a carrying-in position to be on standby. ",
"Otherwise, the traction unit T carries the empty support pallet to be put on another loading stage L, on which nothing is laid, according to a storage or shipment control signal before being moved along with the empty pallet to a standby position. ",
"Thereafter, the transporting unit T performs the normal operation for the storage or shipment that target goods W is stored in a predetermined loading stage L or taken out of its loading stage L along with the corresponding support pallet. ",
"For it, the conventional storage system has a disadvantage in that it takes much time in putting goods into or taking goods out of the storage spaces of the loading stages following by the separate dealing of the support pallet.",
"\nIn an effort to overcome the above-mentioned problems experienced in the conventional storage system using such support pallets, a palletless loading configuration without requiring support pallets in putting goods into or taking goods out of the storage spaces on loading stages has been proposed and used. ",
"A typical example of such palletless loading structures is disclosed in International Laid-open Publication No. ",
"WO 87/02405 entitled “Vertical Storage Apparatus and Control Method Thereof”.",
"\nAs shown in FIGS. ",
"2A and 2B, the vertical storage apparatus comprises a single rack unit including an elevation space and multi-storied storage racks provided on at least one side out of the left side, right side, front side and rear side of the lift space. ",
"The rack comprises a plurality of storage forks 1 normally arranged on every story thereof to form two rows spaced apart in a regular interval from each another. ",
"The elevation space defined between the storage spaces comprises a pair of elevation forks 2 mounted to be moved up and down therein to carry goods W in a vertical direction. ",
"The storage fork 1 reciprocates between a storage space and the elevation space by a drive unit (not shown) in a manner to be moved toward or away from a position above or under the fork bars of the elevation forks 2 according to the guidance of a horizontal guide beam 3 of the rack. ",
"The elevation fork 2 comprises a pair of elevation forks 2a and 2b faced to each other, fork bars of which are vertically passed through between fork bars of the storage fork 1 to be placed at a loading/unloading position in the elevation space, without interfering with the fork bars of the storage fork 1. ",
"In such a case, the paired forks 2a and 2b are synchronously moved.",
"\nIn a storage operation, the elevation fork 2 loaded with goods W on its fork bars are first moved upward in the elevation space to a desired position higher than that of a target empty storage fork 1. ",
"The target empty storage fork 1 is horizontally moved inward into the elevation space by the drive unit to a loading position under the fork bars of the elevation fork 2. ",
"The elevation fork 2 is moved downward to cross the fork bars of the storage fork 1 in order to load the goods W onto the storage fork 1. ",
"The storage fork 1 with the goods W is returned by the drive unit to its original position, so that goods W is taken into a storage space of the rack.",
"\nHowever, the vertical storage apparatus free of a pallet has a problem in that the moving distance of the elevation fork 2 is relatively longer, because the elevation fork 2 passes through or cross the storage fork 1, vertically, during a loading or unloading operation.",
"\nThat is, a target storage fork 1 must be horizontally moved to a loading or unloading position under or above an elevation fork 2 without causing any interference between goods W and any one of the storage and elevation forks 1 and 2. ",
"Therefore, a substantial travel of the elevation fork 2 is a sum of adding operational allowance gaps “g1” and “g2” to two heights h1+h2 of the storage fork 1 and the elevation fork 2. ",
"It takes a relative longer time for the storage and shipment of goods W, so that the vertical storage apparatus fails to reduce the time consumption during a loading or unloading operation.",
"\nAnother typical example of a loading structure for a storage system free of a pallet is referred to Japanese Patent Laid-open Publication No. ",
"Heisei. ",
"5-52058 entitled “Loading structure for stacker crane-type parking garages”.",
"\nAs shown in FIGS. ",
"3A and 3B, a loading structure for a stacker crane-type parking lot comprises two racks 4 installed on a support surface to be spaced apart at an interval from each other and a stacker crane (not shown) mounted between the racks 4 to enable a lift fork 7 to be moved up and down with being loaded with goods W. Multiple cantilever support bars 6 are provided on the right and left shelf members of each rack 4 to form a storage space inside horizontal support beams 5. ",
"The lift fork 7 includes a plurality of arm bars 9 provided on both sides of a body 8 of the stacker crane to cross the support bars 6 without any interference during being lifted or lowered in a protruded state.",
"\nIn a loading operation, the lift fork 7 loaded with goods W is first moved upward in an elevation space to a desired position higher than that of the support bar 6 and then horizontally to be entered into a target empty storage space of the racks 4. ",
"Thereafter, the lift fork 7 is moved downward to cross the support bar 6 of the rack 4. ",
"During the downward movement of the lift fork 7, the arm bars 9 pass through the spaces between the support bars 6 without any interference to load goods W onto the support bars 6. ",
"The lift fork 7 is, thereafter, laterally moved from the position under the support bars 6 to a position inside the elevation space, prior to being moved to a standby position where another goods W are loaded on the lift fork 7.",
"\nHowever, the loading structure is designed such that the lift fork 7 passes through the support bars 6 from above its upper portion to below its lower portion thereby to return to its original position, so it has a limitation to the time reduction in taking in or out of goods W due to a relatively longer traveling distance.",
"\nTherefore, a substantial travel of the lift fork 7 is a sum of adding allowance gaps “g1” and “g2” for entering into/retracting from the rack 4 to two heights h3+h4 of the support fork 6 and the lift fork 7. ",
"It has a limitation to the shortening of a vertical traveling distance of the lift fork 7.",
"\nIn addition, the support bars 6 are extended from both sides of the horizontal support beam 5 to a predetermined length to allow goods W to be placed thereon, because goods W has to have widths larger than that of a space defined between the support bars 6 in each storage space to be effectively stored on the support bars 6 without being dropped through the space. ",
"It has a limitation to a size of goods W that can be stored in the storage system."
] |
{
"pile_set_name": "USPTO Backgrounds"
}
|
[
0.0009391900966875255,
0.000569285184610635,
0.001185585861094296,
0.0005682175396941602,
0.0006297628278844059,
0.0006442060694098473,
0.0005585997132584453,
0.0005493367207236588,
0.000619428523350507,
0.0007083669770509005,
0.0006887383642606437,
0.0006276320200413465,
0.0006011617369949818,
0.000619817990809679,
0.0007328021456487477,
0.000638325756881386,
0.0006335201906040311,
0.0007309597567655146,
0.0006489889929071069,
0.0005703880451619625,
0.0006115084397606552,
0.0006966982618905604,
0.0006168995751067996,
0.0006477244314737618,
0.0006786520243622363,
0.0007443896029144526,
0.0007240770501084626,
0.0006936996360309422,
0.0007114255568012595,
0.0006895021069794893,
0.0006086406647227705,
0.0007430337718687952,
0.0019827131181955338,
0.0006232630112208426,
0.0006335201906040311,
0.0006147082895040512,
0.000715618662070483,
0.0006402174476534128,
0.0007166112773120403,
0.0007708299672231078,
0.0006503648473881185,
0.0006426025647670031,
0.00079730263678357,
0.0006573331775143743,
0.0006565668154507875,
0.000659321784041822
] | 0.000704 | 46 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.