Datasets:

tomekkorbak

/

detoxify-pile-chunk3-3000000-3050000

like 0

[ "Human Rights Watch recently reported that eight countries in Africa and the Middle East used forced anal exams to convict men and transwomen suspected of homosexuality. ", "These countries include Cameroon, Egypt, Kenya, Lebanon, Tunisia, Turkmenistan, Uganda, and Zambia, and the exams are basically a form of state-sponsored sexual assault and torture against suspected gays, bisexuals and transgender people.", "\n\nWhat are forced anal examinations like?", "\n\nThese forced anal exams are not like routine prostate examinations where patients willingly drop trou to let a kindly doctor stick in a gentle finger. ", "One 21-year-old man in Tunisia was pushed down onto his knees and bent over (his arms restrained) while another man undid his pants so a doctor could insert a finger and a tube into his anus. ", "Examining doctors do not have to introduce themselves and can allow anyone they want to into the room to assist or observe. ", "In some cases, the doctors take photographs while the victim’s buttocks are forcibly spread open.", "\n\nWhat are the exams looking for?", "\n\nOstensibly, the doctors are searching for “evidence” of homosexuality like a loose or funnel-shaped anus; lesions, redness, inflammation of anal tissue or traces of sperm, but lacking sperm, a loose anus isn’t proof of anything. ", "Independent Forensic Experts Group (IFEG), a group of 35 international forensic doctors have called the examinations useless, stating that at least 15 other medical conditions unrelated to anal sex can cause rectal conditions that supposedly “prove” a person’s homosexuality. ", "IFEG also says that the exams cause psychological damage that lasts for years beyond the exam itself.", "\n\nDo the exams really prove that a person had anal intercourse?", "\n\nTruth is that these examinations aren’t really to “confirm” a person’s suspected homosexuality so much as to humiliate and intimidate anyone suspected of having LGBT sympathies. ", "Refusing the anal examination can be seen as obstructing an investigation and used in cases as proof of a person’s guilt.", "\n\nWhat is gay life like in countries where these exams occur?", "\n\nCameroon punishes same-sex sexual activity with five years in prison and fines of $33 to $330. ", "In 2013 , two men were imprisoned simply for having “feminine” clothing and speech and ordering drinks with “cream-based” liquor.", "\n\nEven though homosexuality is not technically illegal in Egypt, in December 2014, 26 men were arrested in a raid on a Cairo bathhouse and charged with “debauchery”, a vague “public morals” law often used to persecute LGBT people. ", "The charges on all the men were later acquitted.", "\n\nIn Kenya, same-sex sexual activity is punishable by up to 14 years in prison and anti-LGBT mob violence is common with aggressors confident that they will face no punishments for killing or injuring known LGBT people.", "\n\nWhile Lebanon decriminalized same-sex intercourse in 2014, Article 534 of the country’s penal code still prohibits any sex that “contradict(s) the laws of nature”. ", "The law (and raids on gay meeting places) is used to harass gay, bisexual and trans people or to admit them into police custody for other forms of abuse and torture.", "\n\nTunisia punishes same-sex sexual activity with three years imprisonment. ", "In Turkmenistan, gay sex can get you two years in prison and even forced containment in a psychiatric facility to “cure” your homosexuality.", "\n\nUganda punishes same-sex intercourse with life imprisonment. ", "Zambia punishes it with 14 years in prison; LGBT people there report widespread discrimination, harassment and fear by anyone who would report them to the authorities." ]

{ "pile_set_name": "Pile-CC" }

[ 0.46864521503448486, 0.09979076683521271, 0.879462718963623, 0.5313311219215393, 0.5795187950134277, 0.0005927556776441634, 0.054481565952301025, 0.0008769588894210756, 0.5753433108329773, 0.07784554362297058, 0.0011640387820079923, 0.5333439111709595, 0.16136248409748077, 0.07196345925331116, 0.16186940670013428, 0.45208773016929626, 0.005598848685622215, 0.047432247549295425, 0.0006561492918990552, 0.1613529771566391, 0.029645150527358055, 0.12834331393241882, 0.26700708270072937, 0.9274816513061523, 0.5922642350196838, 0.01467541977763176 ]

[ "Q:\n\nselect from mysql with different key values\n\ni want to write some query which give me the product with specific key value\ntbl_product\n product_id field_id value\n 1 1 100\n 1 2 200\n\ni want to find all products that have (field_id = 1 and value = 100) and (field_id = 2 and value = 200 )\n\nA:\n\nYou can use where, group by, and having:\nselect product_id\nfrom t\nwhere (field_id = 1 and value = 100) or (field_id = 2 and value = 200 )\ngroup by product_id\nhaving count(*) = 2;\n\nIf duplicates are allowed, then you want count(distinct field_id) = 2.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0006944480701349676, 0.001995444530621171 ]

[ "Google introduced an updated Smart Display interface alongside the Nest Hub Max, and now you don't need that new hardware to see what the fuss is about. ", "The 9to5Google team has discovered that Google is rolling out the refreshed interface to the Nest Hub (formerly the Home Hub) and, presumably, third-party devices. ", "The new home screen ditches the all-white Material Design appearance in favor of a more personal carousel of cards that keeps your wallpaper in the background. ", "You won't see as much of the weather forecast, but you should have more overall info at a glance." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006344860885292292, 0.0007651066989637911, 0.0007916662725619972, 0.0005299872136674821 ]

[ "// cgo -godefs -- -fsigned-char types_openbsd.go | go run mkpost.go\n// Code generated by the command above; see README.md. ", "DO NOT EDIT.", "\n\n// +build arm64,openbsd\n\npackage unix\n\nconst (\n\tSizeofPtr = 0x8\n\tSizeofShort = 0x2\n\tSizeofInt = 0x4\n\tSizeofLong = 0x8\n\tSizeofLongLong = 0x8\n)\n\ntype (\n\t_C_short int16\n\t_C_int int32\n\t_C_long int64\n\t_C_long_long int64\n)\n\ntype Timespec struct {\n\tSec int64\n\tNsec int64\n}\n\ntype Timeval struct {\n\tSec int64\n\tUsec int64\n}\n\ntype Rusage struct {\n\tUtime Timeval\n\tStime Timeval\n\tMaxrss int64\n\tIxrss int64\n\tIdrss int64\n\tIsrss int64\n\tMinflt int64\n\tMajflt int64\n\tNswap int64\n\tInblock int64\n\tOublock int64\n\tMsgsnd int64\n\tMsgrcv int64\n\tNsignals int64\n\tNvcsw int64\n\tNivcsw int64\n}\n\ntype Rlimit struct {\n\tCur uint64\n\tMax uint64\n}\n\ntype _Gid_t uint32\n\ntype Stat_t struct {\n\tMode uint32\n\tDev int32\n\tIno uint64\n\tNlink uint32\n\tUid uint32\n\tGid uint32\n\tRdev int32\n\tAtim Timespec\n\tMtim Timespec\n\tCtim Timespec\n\tSize int64\n\tBlocks int64\n\tBlksize int32\n\tFlags uint32\n\tGen uint32\n\t_ Timespec\n}\n\ntype Statfs_t struct {\n\tF_flags uint32\n\tF_bsize uint32\n\tF_iosize uint32\n\tF_blocks uint64\n\tF_bfree uint64\n\tF_bavail int64\n\tF_files uint64\n\tF_ffree uint64\n\tF_favail int64\n\tF_syncwrites uint64\n\tF_syncreads uint64\n\tF_asyncwrites uint64\n\tF_asyncreads uint64\n\tF_fsid Fsid\n\tF_namemax uint32\n\tF_owner uint32\n\tF_ctime uint64\n\tF_fstypename [16]int8\n\tF_mntonname [90]int8\n\tF_mntfromname [90]int8\n\tF_mntfromspec [90]int8\n\t_ [2]byte\n\tMount_info [160]byte\n}\n\ntype Flock_t struct {\n\tStart int64\n\tLen int64\n\tPid int32\n\tType int16\n\tWhence int16\n}\n\ntype Dirent struct {\n\tFileno uint64\n\tOff int64\n\tReclen uint16\n\tType uint8\n\tNamlen uint8\n\t_ [4]uint8\n\tName [256]int8\n}\n\ntype Fsid struct {\n\tVal [2]int32\n}\n\nconst (\n\tPathMax = 0x400\n)\n\ntype RawSockaddrInet4 struct {\n\tLen uint8\n\tFamily uint8\n\tPort uint16\n\tAddr [4]byte /* in_addr */\n\tZero [8]int8\n}\n\ntype RawSockaddrInet6 struct {\n\tLen uint8\n\tFamily uint8\n\tPort uint16\n\tFlowinfo uint32\n\tAddr [16]byte /* in6_addr */\n\tScope_id uint32\n}\n\ntype RawSockaddrUnix struct {\n\tLen uint8\n\tFamily uint8\n\tPath [104]int8\n}\n\ntype RawSockaddrDatalink struct {\n\tLen uint8\n\tFamily uint8\n\tIndex uint16\n\tType uint8\n\tNlen uint8\n\tAlen uint8\n\tSlen uint8\n\tData [24]int8\n}\n\ntype RawSockaddr struct {\n\tLen uint8\n\tFamily uint8\n\tData [14]int8\n}\n\ntype RawSockaddrAny struct {\n\tAddr RawSockaddr\n\tPad [92]int8\n}\n\ntype _Socklen uint32\n\ntype Linger struct {\n\tOnoff int32\n\tLinger int32\n}\n\ntype Iovec struct {\n\tBase *byte\n\tLen uint64\n}\n\ntype IPMreq struct {\n\tMultiaddr [4]byte /* in_addr */\n\tInterface [4]byte /* in_addr */\n}\n\ntype IPv6Mreq struct {\n\tMultiaddr [16]byte /* in6_addr */\n\tInterface uint32\n}\n\ntype Msghdr struct {\n\tName *byte\n\tNamelen uint32\n\tIov *Iovec\n\tIovlen uint32\n\tControl *byte\n\tControllen uint32\n\tFlags int32\n}\n\ntype Cmsghdr struct {\n\tLen uint32\n\tLevel int32\n\tType int32\n}\n\ntype Inet6Pktinfo struct {\n\tAddr [16]byte /* in6_addr */\n\tIfindex uint32\n}\n\ntype IPv6MTUInfo struct {\n\tAddr RawSockaddrInet6\n\tMtu uint32\n}\n\ntype ICMPv6Filter struct {\n\tFilt [8]uint32\n}\n\nconst (\n\tSizeofSockaddrInet4 = 0x10\n\tSizeofSockaddrInet6 = 0x1c\n\tSizeofSockaddrAny = 0x6c\n\tSizeofSockaddrUnix = 0x6a\n\tSizeofSockaddrDatalink = 0x20\n\tSizeofLinger = 0x8\n\tSizeofIPMreq = 0x8\n\tSizeofIPv6Mreq = 0x14\n\tSizeofMsghdr = 0x30\n\tSizeofCmsghdr = 0xc\n\tSizeofInet6Pktinfo = 0x14\n\tSizeofIPv6MTUInfo = 0x20\n\tSizeofICMPv6Filter = 0x20\n)\n\nconst (\n\tPTRACE_TRACEME = 0x0\n\tPTRACE_CONT = 0x7\n\tPTRACE_KILL = 0x8\n)\n\ntype Kevent_t struct {\n\tIdent uint64\n\tFilter int16\n\tFlags uint16\n\tFflags uint32\n\tData int64\n\tUdata *byte\n}\n\ntype FdSet struct {\n\tBits [32]uint32\n}\n\nconst (\n\tSizeofIfMsghdr = 0xa8\n\tSizeofIfData = 0x90\n\tSizeofIfaMsghdr = 0x18\n\tSizeofIfAnnounceMsghdr = 0x1a\n\tSizeofRtMsghdr = 0x60\n\tSizeofRtMetrics = 0x38\n)\n\ntype IfMsghdr struct {\n\tMsglen uint16\n\tVersion uint8\n\tType uint8\n\tHdrlen uint16\n\tIndex uint16\n\tTableid uint16\n\tPad1 uint8\n\tPad2 uint8\n\tAddrs int32\n\tFlags int32\n\tXflags int32\n\tData IfData\n}\n\ntype IfData struct {\n\tType uint8\n\tAddrlen uint8\n\tHdrlen uint8\n\tLink_state uint8\n\tMtu uint32\n\tMetric uint32\n\tRdomain uint32\n\tBaudrate uint64\n\tIpackets uint64\n\tIerrors uint64\n\tOpackets uint64\n\tOerrors uint64\n\tCollisions uint64\n\tIbytes uint64\n\tObytes uint64\n\tImcasts uint64\n\tOmcasts uint64\n\tIqdrops uint64\n\tOqdrops uint64\n\tNoproto uint64\n\tCapabilities uint32\n\tLastchange Timeval\n}\n\ntype IfaMsghdr struct {\n\tMsglen uint16\n\tVersion uint8\n\tType uint8\n\tHdrlen uint16\n\tIndex uint16\n\tTableid uint16\n\tPad1 uint8\n\tPad2 uint8\n\tAddrs int32\n\tFlags int32\n\tMetric int32\n}\n\ntype IfAnnounceMsghdr struct {\n\tMsglen uint16\n\tVersion uint8\n\tType uint8\n\tHdrlen uint16\n\tIndex uint16\n\tWhat uint16\n\tName [16]int8\n}\n\ntype RtMsghdr struct {\n\tMsglen uint16\n\tVersion uint8\n\tType uint8\n\tHdrlen uint16\n\tIndex uint16\n\tTableid uint16\n\tPriority uint8\n\tMpls uint8\n\tAddrs int32\n\tFlags int32\n\tFmask int32\n\tPid int32\n\tSeq int32\n\tErrno int32\n\tInits uint32\n\tRmx RtMetrics\n}\n\ntype RtMetrics struct {\n\tPksent uint64\n\tExpire int64\n\tLocks uint32\n\tMtu uint32\n\tRefcnt uint32\n\tHopcount uint32\n\tRecvpipe uint32\n\tSendpipe uint32\n\tSsthresh uint32\n\tRtt uint32\n\tRttvar uint32\n\tPad uint32\n}\n\ntype Mclpool struct{}\n\nconst (\n\tSizeofBpfVersion = 0x4\n\tSizeofBpfStat = 0x8\n\tSizeofBpfProgram = 0x10\n\tSizeofBpfInsn = 0x8\n\tSizeofBpfHdr = 0x14\n)\n\ntype BpfVersion struct {\n\tMajor uint16\n\tMinor uint16\n}\n\ntype BpfStat struct {\n\tRecv uint32\n\tDrop uint32\n}\n\ntype BpfProgram struct {\n\tLen uint32\n\tInsns *BpfInsn\n}\n\ntype BpfInsn struct {\n\tCode uint16\n\tJt uint8\n\tJf uint8\n\tK uint32\n}\n\ntype BpfHdr struct {\n\tTstamp BpfTimeval\n\tCaplen uint32\n\tDatalen uint32\n\tHdrlen uint16\n\t_ [2]byte\n}\n\ntype BpfTimeval struct {\n\tSec uint32\n\tUsec uint32\n}\n\ntype Termios struct {\n\tIflag uint32\n\tOflag uint32\n\tCflag uint32\n\tLflag uint32\n\tCc [20]uint8\n\tIspeed int32\n\tOspeed int32\n}\n\ntype Winsize struct {\n\tRow uint16\n\tCol uint16\n\tXpixel uint16\n\tYpixel uint16\n}\n\nconst (\n\tAT_FDCWD = -0x64\n\tAT_SYMLINK_FOLLOW = 0x4\n\tAT_SYMLINK_NOFOLLOW = 0x2\n)\n\ntype PollFd struct {\n\tFd int32\n\tEvents int16\n\tRevents int16\n}\n\nconst (\n\tPOLLERR = 0x8\n\tPOLLHUP = 0x10\n\tPOLLIN = 0x1\n\tPOLLNVAL = 0x20\n\tPOLLOUT = 0x4\n\tPOLLPRI = 0x2\n\tPOLLRDBAND = 0x80\n\tPOLLRDNORM = 0x40\n\tPOLLWRBAND = 0x100\n\tPOLLWRNORM = 0x4\n)\n\ntype Sigset_t uint32\n\ntype Utsname struct {\n\tSysname [256]byte\n\tNodename [256]byte\n\tRelease [256]byte\n\tVersion [256]byte\n\tMachine [256]byte\n}\n\nconst SizeofUvmexp = 0x158\n\ntype Uvmexp struct {\n\tPagesize int32\n\tPagemask int32\n\tPageshift int32\n\tNpages int32\n\tFree int32\n\tActive int32\n\tInactive int32\n\tPaging int32\n\tWired int32\n\tZeropages int32\n\tReserve_pagedaemon int32\n\tReserve_kernel int32\n\tUnused01 int32\n\tVnodepages int32\n\tVtextpages int32\n\tFreemin int32\n\tFreetarg int32\n\tInactarg int32\n\tWiredmax int32\n\tAnonmin int32\n\tVtextmin int32\n\tVnodemin int32\n\tAnonminpct int32\n\tVtextminpct int32\n\tVnodeminpct int32\n\tNswapdev int32\n\tSwpages int32\n\tSwpginuse int32\n\tSwpgonly int32\n\tNswget int32\n\tNanon int32\n\tUnused05 int32\n\tUnused06 int32\n\tFaults int32\n\tTraps int32\n\tIntrs int32\n\tSwtch int32\n\tSofts int32\n\tSyscalls int32\n\tPageins int32\n\tUnused07 int32\n\tUnused08 int32\n\tPgswapin int32\n\tPgswapout int32\n\tForks int32\n\tForks_ppwait int32\n\tForks_sharevm int32\n\tPga_zerohit int32\n\tPga_zeromiss int32\n\tUnused09 int32\n\tFltnoram int32\n\tFltnoanon int32\n\tFltnoamap int32\n\tFltpgwait int32\n\tFltpgrele int32\n\tFltrelck int32\n\tFltrelckok int32\n\tFltanget int32\n\tFltanretry int32\n\tFltamcopy int32\n\tFltnamap int32\n\tFltnomap int32\n\tFltlget int32\n\tFltget int32\n\tFlt_anon int32\n\tFlt_acow int32\n\tFlt_obj int32\n\tFlt_prcopy int32\n\tFlt_przero int32\n\tPdwoke int32\n\tPdrevs int32\n\tPdswout int32\n\tPdfreed int32\n\tPdscans int32\n\tPdanscan int32\n\tPdobscan int32\n\tPdreact int32\n\tPdbusy int32\n\tPdpageouts int32\n\tPdpending int32\n\tPddeact int32\n\tUnused11 int32\n\tUnused12 int32\n\tUnused13 int32\n\tFpswtch int32\n\tKmapent int32\n}\n\nconst SizeofClockinfo = 0x14\n\ntype Clockinfo struct {\n\tHz int32\n\tTick int32\n\tTickadj int32\n\tStathz int32\n\tProfhz int32\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.002171107567846775, 0.00201672175899148, 0.017271922901272774 ]

[ "The present disclosure relates to a coupling for use in an irrigation system.", "\nSuch a coupling may be used between an irrigation pipe and a main distribution pipe from which it branches off.", "\nUS Patent Application No. ", "20070074776, the disclosure of which is incorporated herein by reference, describes that the walls of a pipe under internal hydrostatic pressure experience, under ideal conditions, twice the stress in the circumferential direction as they do in the longitudinal direction.", "\nIn some cases, this should be taken into account in the coupling." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0005332758883014321, 0.0006365402368828654, 0.0007085877587087452, 0.000580577936489135, 0.0005565620958805084 ]

[ "This week on Family Dick, we finally meet Lukas’ stepdad, an ex-con who has just been released from prison. ", "While Logan is on house arrest, little Lukas takes the opportunity to seduce his pop and show him just how much he missed him. ", "The sexy stud drills the kid’s tight hole before drowning him in creamy cum!", "\n\nSee more at Family Dick." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.6261708736419678, 0.0014806616818532348, 0.9853993654251099, 0.8584395051002502 ]

[ "Doctors in Wales Call for Breast Feed Law\n\nWelsh doctors are calling on the Welsh Assembly Government to introduce new laws to encourage breastfeeding.", "\n\nThe Welsh branch of The British Medical Association (BMA Cymru) says breastfeeding in places like restaurants, cafes and shops should be more widely and positively encouraged.", "\n\nIt says that breastfeeding is the best option for mothers and new laws would help change public attitudes.", "\n\nThe assembly government said it gave full support to breastfeeding mothers, and was reviewing the legislation.", "\nBMA Cymru said that despite the many health advantages to breastfeeding, in England and Wales over 28% of mothers still do not breastfeed.", "\n\nThe greatest obstacle appears to be the fear of embarrassment or of offending others. ", "This causes many mothers to either never begin breastfeeding or to stop breastfeeding prematurely.", "\n\nBreastfeeding protects against many childhood illnesses including gastro-intestinal and respiratory infections.", "\n\nIt is also said that women who have breastfed have lower risks of pre-menopausal breast cancer, ovarian cancer and hip fractures later in life.", "\n\nBack in May 2006, the assembly government launched the 'Breastfeeding Welcome Scheme', which asks businesses to make four promises aimed at making breastfeeding easier for mothers. ", "Those companies accepted on the scheme can display a window sticker showing they provide a welcome environment for mothers who want to breastfeed.", "\n\nHowever, BMA Cymru said laws are required to make it more acceptable for women to breastfeed in restaurants, cafes, shops and other public areas where children are allowed.", "\n\nA recent survey carried out by the National Childbirth Trust found that almost 80% of mothers would like to see a law that protects their right to breastfeed.", "\n\nThe Welsh secretary of the BMA, Richard Lewis, said: \"The assembly is looking for new legislation which it could support when it receives new powers in 2007.\"", "\n\"Legislation on breastfeeding would help to effect a change in public attitudes, as it would send out a strong message that it is acceptable for women to breastfeed and that it should be positively encouraged.\"", "\nDr Lewis added that mothers who choose not to breastfeed should also be \"supported in their choice\".", "\n\nThe BMA's initiative is supported by the Royal College of Nursing in Wales.", "\nIts director, Tina Donnelly, said: \"The fear of being offensive or embarrassed has caused mothers to either never begin breastfeeding or to prematurely wean their infants.\"", "\nThe chairman of the BMA's Welsh Council, Dr Tony Calland added: \"We are calling for the assembly to create an environment where women of all ethnic, social and cultural backgrounds are comfortable with discreetly feeding their babies anywhere and at any time.\"", "\nA spokesperson for the assembly government said: \"We give our full support to breastfeeding mothers as breast milk is best for babies.\"", "\n\"We welcome the BMA's comments and the legislation is under review.\"", "\n\nChicco has built a great foundation for creating wallet friendly baby and toddler equipment which doesn't necessarily wow on appearance but for safety and value for money has always ticked the box..... read more" ]

{ "pile_set_name": "Pile-CC" }

[ 0.005583861377090216, 0.0017387890256941319, 0.05016675218939781, 0.006521565839648247, 0.004765714053064585, 0.0021446775645017624, 0.11023880541324615, 0.0030670217238366604, 0.0768134593963623, 0.0022784911561757326, 0.0926106870174408, 0.06666956841945648, 0.007732665166258812, 0.000545315386261791, 0.013722816482186317, 0.018046677112579346, 0.0005447742878459394, 0.02133900672197342, 0.0015507983043789864, 0.006304176524281502, 0.0005282829515635967, 0.0007426550146192312 ]

[ "Waterways opening for the weekend raise concern for residents\n\nFRENCH SETTLEMENT - Water ways in Ascension, Livingston and St. James will all be open by Thursday at noon.", "\n\nBlind River is open in St. James Parish. ", "Parish officials in Livingston and Ascension Parishes said all water ways in their area will be deemed safe for recreational use by Thursday at noon.", "\n\nSome residents along the water say they still have concerns. ", "Logs and branches still litter the waterways and can't always be seen by boaters.", "\n\n\"I see trees, I see refrigerators, I see all type of debris that gets brought from the bank into the river whenever the waters getting high,\" said Jim Templet, at Templet Marine. \"", "I do see a lot of impact damages after floods, two weekends after a flood there's still things that are floating with the water some seen and some unseen and the damages can be very expensive up to five, six thousand dollars or more in some cases.\"", "\n\nOther homeowners said the high water can damage their property if boaters make wakes near their homes.", "\n\n\"As camp owners, the waves and the stuff like that, from all the joy riders, just tears up everybody else's property, you know, when the water's high and knocking boards lose off the warf and stuff like that,\" said Rhett Cornett Sideline Boat Repair." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005678875604644418, 0.0008545665768906474, 0.0005408136057667434, 0.0005969637422822416, 0.0010214030044153333, 0.0005766106769442558, 0.0005744241643697023, 0.0015279592480510473, 0.0010502042714506388 ]

[ "Field studies conducted by the U.S. Government have revealed that hydrofracking fluids are responsible for the deaths of four field workers since 2010.", "\n\nThe report, recently released by the National Institute for Occupational Safety, suggests that workers could be exposed to hazardous levels of toxic volatile hydrocarbons found in waste fracking fluids.", "\n\n“According to our information, at least four workers have died since 2010 from what appears to be acute chemical exposures during flow back operations at well sites in the Williston Basin (North Dakota and Montana),” government researchers wrote. “", "While not all of these investigations are complete, available information suggests that these cases involved workers who were gauging flow back or production tanks or involved in transferring flow back fluids at the well site.”", "\n\nThe institute is also assessing worker exposure to other chemicals mixed into fluids that are injected into the earth during fracking. ", "Those findings will be detailed in later publications, according to Max Kiefer, a NIOSH spokesperson.", "\n\n“Right now, the exposures of concern from a worker standpoint are from endogenous hydrocarbons that can be emitted from returned flow back fluids, not from other chemicals,” Kiefer told Bloomberg BNA.", "\n\nThe report highlights how little is known about the on-site health dangers associated with hydrofracking compared to well-researched knowledge about the worksite hazards of conventional oil and gas extraction.", "\n\nThe fracking boom has proceeded at such fast pace in the U.S. that regulators have struggled to keep up with monitoring all the potential hazards involved in the process. ", "The EPA has not been able to adequately keep track of how and where the fossil-fuel industry is disposing of fracking waste water. ", "As a consequence, countless gallons of partially treated waste water has ended up in the rivers and aquifers from which millions of Americans get their drinking water.", "\n\nA vast volume of water is needed to extract that natural gas, and the large amounts of wastewater generated during the process is causing increasing concern among geochemists, biologists, engineers, and toxicologists. ", "Initially, they focused their worries on leaks of drilling fluids and other contaminants from well casings, which could potentially pollute groundwater supplies. ", "But with engineering improvements that have reinforced well casings and reduced pollution from that source, experts now say fracking’s real pollution danger comes from wastewater.", "\n\nA Duke University study conducted last year showed that some Marcellus Shale waste water, tainted by high levels of radioactivity, flows downstream into water sources for Pittsburgh and other cities, with uncertain health consequences." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006840249407105148, 0.0010889978148043156, 0.0005701567279174924, 0.0005776924081146717, 0.0006748404121026397, 0.0006225081160664558, 0.0006142160855233669, 0.0005713783320970833, 0.0005660812021233141, 0.0023220465518534184, 0.0022650472819805145, 0.000661639089230448, 0.0006845183088444173, 0.0008681406616233289, 0.0008567598415538669 ]

[ "Long-term efficacy and safety of asenapine or olanzapine in patients with schizophrenia or schizoaffective disorder: an extension study.", "\nSafety and efficacy results, collected in schizophrenia and schizoaffective disorder patients treated for up to nearly 3 years, are presented for asenapine and olanzapine. ", "Patients completing a 52-week randomized double-blind core study on flexible-dose asenapine (5 or 10 mg BID) or olanzapine (10 or 20 mg QD) could continue treatment until study blind was broken.290 patients on asenapine and 150 on olanzapine continued treatment for variable lengths of time [mean ± SD (range) 311.0 ± 146.1 (10 - 653) d and 327.4 ± 139.6 (15 - 631) d, respectively]. ", "Adverse event (AE) incidence was lower during the extension (asenapine, 62%; olanzapine, 55%) than during the core study (78%, 80%). ", "In both groups, body weight increase and incidence of extrapyramidal AEs were negligible during the extension. ", "Mean PANSS total score changes during first year of treatment were - 37.0 for asenapine and - 35.3 for olanzapine, with further changes of 1.6 for asenapine and - 0.8 for olanzapine at the extension study endpoint. ", "Clinical stability on asenapine as well as olanzapine was maintained, with few recurrent or newly emerging AEs beyond 1 year of treatment." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.000843720103148371, 0.000746844511013478, 0.000593004107940942, 0.0006088736117817461, 0.0007351996027864516, 0.000675058807246387, 0.0005673987325280905 ]

[ "If we know anything about Tim it’s that he rarely loses his temper. ", "Tim is your monotone best friend. ", "Until you cross him.", "\n\nFor this episode’s challenge, the remaining six designers were asked to give makeovers to the Project Runway crew. ", "As Tim is doing his routine check-in, going table to table to mull over and critique each designer, he offers his usual constructive criticism, but you can already tell he’s annoyed.", "\n\nDesigner Merline made an oversized puffy-sleeved coat that Tim says is “swallowing” the model. ", "And most of the crew members are not in love with the early designs. ", "Tim says one outfit looks like it has camel toe. ", "While Tim gets increasingly upset, the designers are confused having to make outfits for everyday people instead of models.", "\n\nTim: “I have a fundamental lack of understanding about why this is so difficult for each of you.”" ]

{ "pile_set_name": "Pile-CC" }

[ 0.018389932811260223, 0.0019585813861340284, 0.05102013424038887, 0.0005888366140425205, 0.0026727060321718454, 0.0008956659585237503, 0.0007355223642662168, 0.0017865975387394428, 0.0010147308930754662, 0.0006279299850575626 ]

[ "With so much talk about a future filled with self-driving cars, it’s easy to forget that general advances in autonomous software technologies can also be applied to boats. ", "That being the case, Rolls Royce recently announced that it’s been working on technology that might someday make it possible for gargantuan cargo ships to sail themselves across oceans.", "\n\nIn a white paper published a few days ago, Rolls Royce explained how their vision of “remote and autonomous shipping” may become a reality as early as 2020. ", "The initiative is part of Rolls Royce’s Advanced Autonomous Waterborne Applications (AAWA) program.", "\n\nDON’T MISS: Video gives us a 15-min walkthrough of the Galaxy Note 7’s leaked next-gen software\n\nSpeaking on the matter, Rolls Royce VP of innovation Oskar Levander explained: “This is happening. ", "It’s not if, it’s when. ", "The technologies needed to make remote and autonomous ships a reality exist. ", "The AAWA project is testing sensor arrays in a range of operating and climatic conditions in Finland and has created a simulated autonomous ship control system which allows the behavior of the complete communication system to be explored. ", "We will see a remote controlled ship in commercial use by the end of the decade.”", "\n\nIndeed, as Rolls Royce envisions it, we’re just a few years away from an environment where a lone operator would be able to remotely control an entire fleet of ships from a central command console. ", "And because this is the future we’re talking about, Rolls Royce envisions the console being an advanced holographic display as evidenced by the renderings above and below.", "\n\nSome of the anticipated benefits of remote and autonomous shipping include an improved safety profile and the ability for crew members to focus on more pertinent tasks. ", "For instance, the company explains how these ships of the future would be able to use advanced sensors and companion drones that would effectively serve as advanced scouts capable of identifying important travel issues that humans might otherwise not notice.", "\n\nSo while Rolls Royce at the moment is working on decreasing the role of humans in the shipping process, the company eventually believes that fully autonomous shipping may be possible within two decades. ", "Before that, the company is confident that remote controlled ships will become operational by 2020.", "\n\nA few more photos from Rolls Royce’s press release can be viewed below." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006241576629690826, 0.0006154317525215447, 0.0005338538903743029, 0.000619827420450747, 0.001186678884550929, 0.001087246579118073, 0.0006811502971686423, 0.0005343166412785649, 0.0005880045937374234, 0.0006066830828785896, 0.0006091676186770201, 0.0005436346982605755, 0.0005433629848994315, 0.0005362521624192595, 0.000598810613155365, 0.0005429703160189092 ]

[ "//\n// Base styles\n//\n\n.attention {\n display: inline-block;\n min-width: rem(360px);\n max-width: rem(700px);\n}\n.attention-inner {\n display: flex;\n padding: $attention-padding;\n align-items: center;\n text-align: left;\n border: $attention-border-width solid transparent;\n border-radius: $attention-border-radius;\n}\n.attention-header {\n font-size: $attention-header-font-size;\n}\n.attention-body {\n padding: $attention-body-padding;\n flex: 1;\n font-size: $attention-body-font-size;\n line-height: $attention-body-line-height;\n}\n.attention-close {\n padding: $attention-close-padding;\n cursor: pointer;\n &:hover {\n text-decoration: underline;\n }\n &:active {\n opacity: 0.6;\n }\n}\n// Provide class for links that match attentions\n.attention-link {\n padding-left: rem(10px);\n text-decoration: underline;\n}\n// Dismissible attentions\n//\n// Expand the right padding and account for the close button's positioning.", "\n\n.attention-dismissible {\n padding-right: ($attention-padding + rem(20px));\n\n // Adjust close link position\n .close {\n position: relative;\n top: -2px;\n right: -21px;\n color: inherit;\n }\n}\n// Alternate styles\n//\n// Generate contextual modifier classes for colorizing the attention.", "\n\n.attention-success {\n @include attention-variant($brand-success);\n}\n.attention-primary {\n @include attention-variant($brand-primary);\n}\n.attention-warning {\n @include attention-variant($brand-warning);\n}\n.attention-danger {\n @include attention-variant($brand-danger);\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.0009546825313009322, 0.0009117876761592925, 0.0009636663016863167 ]

[ "Eight years ago, Google announced a $30 million prize for the first team or teams to land a privately funded rover on the moon before the end of 2017. ", "Sixteen teams have registered to compete for the Google Lunar XPRIZE, but now two teams have jumped out front of the rest with actual contracts to launch their probes in 2017.", "\n\nIsraeli team SpaceIL landed a contract with SpaceX in October to use a Falcon 9 rocket to launch its probe, making them the first team with a launch contract confirmed by XPRIZE. ", "Earlier that month, Moon Express CEO Bob Richards announced that his team had secured a launch contract; today XPRIZE confirmed that MoonEx has indeed struck a deal with Rocket Lab for three Lunar missions, using the Electron rocket to transport Moon Express's MX-1E lunar lander.", "\n\nConcept of SpaceIL's Lunar Lander SpaceIL\n\nIn addition to landing a rover on the moon, a team must have their vehicle travel 500 meters and transmit high-definition video and images back to Earth to win the grand prize of $20 million. ", "The second team to accomplish this will win $5 million, and the remaining $5 million will be divvied up between teams for \"further technical and scientific achievements, such as surviving the lunar night or visiting an Apollo landing site.\"", "\n\n\"We are extremely proud to officially confirm receipt and verification of Moon Express's launch contract,\" said senior director of the Google Lunar XPRIZE Chanda Gonzales. \"", "At XPRIZE, we believe that the spirit of competition brings about breakthroughs that once seemed unimaginable or impossible, and so it thrills us to now have two Google Lunar XPRIZE teams with verified launch contracts attempting missions to the moon in 2017. ", "The new space race is truly on!\"", "\n\nSource: Google Lunar XPRIZE via Ars Technica\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.0005875385249964893, 0.0005923219723626971, 0.0005894191563129425, 0.0006044507026672363, 0.0005932822241447866, 0.0005877577932551503, 0.0005323607474565506, 0.0005420968518592417, 0.0011313736904412508, 0.0005446452414616942, 0.000534687249455601 ]

[ "Ultimamente è diventato un logo di gran moda, soprattutto tra i più giovani. ", "Da dove nasce questo fenomeno? ", "Esiste una strategia precisa? ", "Lo abbiamo chiesto direttamente all'Agenzia spaziale americana\n\nUltimamente è difficile andare in giro senza incrociare qualcuno con la felpa della Nasa. ", "Ben lontani dall’essere astronauti o ingegneri aerospaziali, sono spesso ragazzi e ragazze, adolescenti o preadolescenti ad avere quel logo appiccicato da qualche parte.", "\n\nEppure non si tratta di un marchio di vestiario qualsiasi. ", "Non è la Nike o Gucci, è il logo della National Aeronautics and Space Administration (Nasa). ", "L’istituzione governativa statunitense che sovrintende il programma e la ricerca aerospaziale. ", "Possibile che di punto in bianco si siano tutti appassionati di esplorazioni lunari o di moduli orbitanti?", "\n\nIl fenomeno in realtà è più complesso e ha diverse componenti interessanti. ", "Non riguarda solo l’Italia, evidentemente, anzi. ", "Da noi è arrivato pure con un po’ di ritardo. “", "L’interesse per il marchio Nasa è aumentato dopo che, intorno al 2017, Coach [brand che si occupa di vestiti e accessori, ndr] ha creato una collezione dedicata allo Spazio”, racconta a Wired Bert Ulrich, il responsabile alla Nasa della gestione del marchio. “", "È stato allora che abbiamo iniziato a consentire l’utilizzo del logo worm della Nasa per i prodotti, oltre all’attuale (e originale meatball). ", "Prima di allora ci arrivava la richiesta di approvazione per l’uso del logo una o due volte la settimana. ", "Ora ne arrivano venti o trenta al giorno. ", "L’interesse è enorme”, continua entusiasta Ulrich.", "\n\nVerme e polpetta\n\nPer capire cosa intenda Bert Ulrich con worm (verme) e meatball (polpetta), vale la pena sapere qualcosa di più sulla storia del logo. ", "Prima della Nasa c’era la Naca: National Advisory Committee for Aeronautics. ", "Un’istituzione nata già nel 1915 che si occupava di trovare soluzioni scientifiche ai problemi legati al volo. ", "Nel 1958 confluì nella nuova agenzia, la Nasa, che alla sua nascita aveva un logo piuttosto complesso (che peraltro viene ancora usato in occasioni particolari). ", "Così chiese agli impiegati dell’ex Naca di ripensare a un nuovo simbolo. ", "Tra questi c’era James Modarelli. ", "Grazie anche alla sua formazione artistica, la sua proposta venne adottata come nuovo marchio.", "\n\nPur creando un logo dalle linee più pulite, Modarelli riuscì a infilarci un po’ di tutto. ", "Il cerchio blu rappresenta ovviamente un pianeta. ", "Che contiene pure delle stelle, per ricordare lo spazio più in generale. ", "L’ellisse che circonda il nome identifica i viaggi spaziali. ", "Senza dimenticare l’aeronautica, rappresentata dalla forma rossa a v, delle ali stilizzate.", "\n\nNon è un caso che la creazione fu ben presto soprannominata meatball, polpetta. ", "Complice forse anche il cognome italofono dell’autore. ", "Non solo questo nomignolo è sopravvissuto, ma anche il logo stesso. ", "Anzi, ufficialmente è il vero logo della Nasa.", "\n\nEsiste infatti un’altra versione, chiamata worm, verme. ", "Che però, pur essendo utilizzata nel merchandise, è stata adottata dalla Nasa come emblema solo tra il 1976 e il 1992. ", "Il soprannome deriva dalle linee a bastone che possono ricordare la sinuosità di un serpente. ", "O più prosaicamente di un verme, appunto. ", "Commissionato a un’agenzia grafica newyorkese, il nuovo logo dalle caratteristiche iper-semplificate destò il desiderio di un ritorno all’antico. ", "Così nel 1992 si decise di adottare nuovamente il meatball. ", "Nonostante i sedici anni di onorata carriera del worm. ", "Nonché di far parte ormai della storia del design, comprese le novanta pagine del bellissimo manuale di stile.", "\n\nLe ragioni dell’esplosione pop\n\nMa torniamo al successo pop che sembra avere ultimamente il logo. ", "C’è da dire innanzitutto che a differenza di quanto si possa pensare, la Nasa non ci sta facendo soldi a palate. ", "Il logo infatti non viene ceduto in licenza commerciale a soggetti esterni. ", "Potenzialmente tutti possono usarlo. ", "Una volta passato però il processo di approvazione che fa capo a precise linee guida. ", "Tra le molte regole da rispettare, non bisogna suggerire un rapporto di co-branding con la Nasa o che i prodotti facciano parte della sua attività. ", "In altre parole, se qualcuno vuole fare delle tazze col loro marchio non può sottintendere che siano adatte a bere il cappuccino nello spazio.", "\n\nMa come si spiega il passaggio dalle due richieste d’utilizzo alla settimana alle trenta al giorno? “", "Alcune delle nostre risorse più importanti sono le immagini e i social media. ", "Un ottimo modo per entusiasmare i nostri oltre 200 milioni di follower”, ci spiega Bert Ulrich. “", "L’anno scorso abbiamo anche lavorato a oltre 174 documentari, il nostro massimo storico. ", "I film sullo spazio come The Martian o Hidden Figures raccontano storie legate alla Nasa”.", "\n\nMa forse questo non basta. “", "Intanto è fondamentalmente un logo gratis, e ciò sicuramente aiuta”, ricorda Annamaria Testa, storica esperta di comunicazione pubblicitaria. “", "Ma poi non dimentichiamo le grandi celebrazioni del cinquantenario dell’allunaggio di quest’anno. ", "Inoltre c’è un’altra cosa fondamentale. ", "Si tratta di un bel logo, dalle linee grafiche che sono tornate di moda”.", "\n\nGià, ma si tratta pur sempre di un simbolo che fino a pochissimo tempo fa era di successo solo tra i nerd dello spazio. ", "Va detto che ultimamente si assiste al revival di marchi vintage svincolati dal settore modaiolo. ", "Un esempio su tutti è Atari, ma il successo di uno stemma così istituzionale tra i giovani è una novità.", "\n\nTra effimero e passione\n\nÈ umano: tendiamo a imitare i nostri idoli. ", "Se quindi c’è lo zampino di alcuni artisti che hanno iniziato a esibire toppe e magliette col simbolo della Nasa tutto è più facile. ", "Anche Urlich ammette che per esempio Ariana Grande ha dato il boost. ", "Ma tiene a precisare anche che la sua passione per lo spazio è autentica. ", "Ha addirittura lavorato direttamente con la Nasa per la sua collezione di abbigliamento.", "\n\nIn realtà tutto ciò non fa nemmeno parte di una precisa strategia di marketing dell’agenzia spaziale. ", "O meglio, fin dal cosiddetto Space Act del 1958, atto fondativo della Nasa, uno degli obiettivi è di raggiungere il più vasto pubblico possibile. ", "Il fine è infatti di stimolare l’entusiasmo della gente nei confronti delle loro missioni e programmi. ", "L’arte, l’intrattenimento e la moda sono ambiti essenziali dove operare, quindi.", "\n\n“Io per deformazione professionale tendo a non indossare vestiti con loghi, mi viene l’orticaria”, ci confessa Annamaria Testa, esperta di pubblicità, comunicazione e creatività. “", "Ma, pistola alla tempia, se dovessi mettermi qualcosa con un logo opterei sicuramente per quello della Nasa. ", "Rappresenta ancora il sogno americano puro, fatto di tecnologia e speranza. ", "Oltre che di quel senso di meraviglia e onnipotenza che ha rappresentato l’epopea dello sbarco sulla Luna del 1969”." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.021033596247434616, 0.006899644620716572, 0.007350856438279152, 0.013799465261399746, 0.10900426656007767, 0.032703906297683716, 0.0008434480405412614, 0.004032529424875975, 0.09000690281391144, 0.016214916482567787, 0.0009744392591528594, 0.01674492284655571, 0.006557020824402571, 0.01337822712957859, 0.04132040962576866, 0.02133219689130783, 0.0038162521086633205, 0.00832354836165905, 0.0006308429292403162, 0.03700786456465721, 0.008953139185905457, 0.07193626463413239, 0.003657669760286808, 0.06648468971252441, 0.2760063111782074, 0.09272162616252899, 0.013046208769083023, 0.03621647506952286, 0.0016953389858826995, 0.27996501326560974, 0.03738543391227722, 0.067904993891716, 0.001217720564454794, 0.2063903957605362, 0.01867121458053589, 0.05949580669403076, 0.018337836489081383, 0.037375014275312424, 0.04178456962108612, 0.22046980261802673, 0.0070137279108166695, 0.050899505615234375, 0.2702672481536865, 0.035137925297021866, 0.044395703822374344, 0.05317315459251404, 0.2464556246995926, 0.11161739379167557, 0.04243343323469162, 0.013187752105295658, 0.06431807577610016, 0.03252074494957924, 0.01994878426194191, 0.020712455734610558, 0.0019605099223554134, 0.06699493527412415, 0.010114826261997223, 0.03814971446990967, 0.36366286873817444, 0.05026615038514137, 0.040201522409915924, 0.017697710543870926, 0.5141382217407227, 0.053618427366018295, 0.0777759701013565, 0.023870795965194702, 0.04368293285369873, 0.006334463134407997, 0.059950750321149826, 0.006215326022356749, 0.013836248777806759, 0.024385536089539528, 0.07255580276250839, 0.042472682893276215 ]

[ "GB (supermarket)\n\nGB (Grand Bazar) was a Belgian supermarket chain, until 2000 owned by the GIB Group when it was taken over by the Carrefour Group.", "\n\nHistory\n\nIn 1958 the first Super GB is created and opened.", "\n\nIn 1961 the first GB hypermarkets are created under the name of Superbazar in Auderghem, Anderlecht and Bruges. ", "These are the first hypermarkets to open outside the united States. ", "The SuperBazar stores all were reorganized as Maxi GB in 1985.", "\n\nIn 1997 the first GB Express is opened in Berchem-Sainte-Agathe, in the same year, Super GB Partner and Contact GB are created.", "\n\nIn July 2000, Carrefour Group S.A. takes over the GIB Group and modernizes and rebrands all Maxi GB hypermarkets to Carrefour, the other GB stores stays under the GB brand, all those stores will also be renovated.", "\n\nIn 2007 Super GB, Super GB Partner and Contact GB all become Carrefour GB and GB Express stores become Carrefour Express.", "\n\nSince 2009, Carrefour GB stores in Belgium are re-branding to Carrefour Market, all GB stores will eventually be a Market store in Belgium in 2013/2014.", "\n\nIn 2010 some of these Carrefour supermarkets were closed in a reorganization, while a few of them in Brussels and Wallonia were sold to an independent franchise together with Champion supermarkets, which became re-branded, as Carrefour Market-Groupe Mestdagh.", "\n\nAs of May 2013, there are 58 GB supermarkets left in Belgium, 28 Champion stores in Wallonia, and 431 GB stores have already become Carrefour Market.", "\n\nStores \nGB Group had several different supermarket stores:\n\n Super GB, the main supermarket stores, became Carrefour GB in 2007.", "\n Super GB Partner, supermarkets, became Carrefour GB in 2007.", "\n Contact GB, smaller supermarkets before owned by the Laurus group, became Carrefour GB in 2007.", "\n GB Express, convenience stores created in 1997 in Berchem-Sainte-Agathe, became Carrefour Express in 2007.", "\n Maxi GB, hypermarkets, became Carrefour in 2001\n Bigg's Continent, hypermarkets, became Carrefour in 2001.", "\n\nReferences\n\nCategory:Supermarkets of Belgium\nCategory:Retail companies established in 1958\nCategory:1958 establishments in Belgium\nCategory:Evere\nCategory:Companies based in Brussels" ]

{ "pile_set_name": "Wikipedia (en)" }

[ 0.0007886776002123952, 0.0006258251378312707, 0.0006905667833052576, 0.0007630119798704982, 0.0006524971686303616, 0.0006796511588618159, 0.0007859900943003595, 0.0008301119087263942, 0.0006104442290961742, 0.000671449932269752, 0.0006785544101148844, 0.0006469593499787152, 0.0006232609157450497, 0.0006462750607170165, 0.0007566285785287619, 0.001003245241008699, 0.0005987067124806345 ]

[ "Modern20 and Supers20 author Charles Rice has a villain sourcebook on the way for Supers20 called U.S.H.E.R. Dossiers: Public Enemies!", "\n\nThe worst of the worst are incarcerated in U.S.H.E.R.'s Rock City prison on Alcatraz Island. ", "These are the 22 most dangerous men and women alive, criminals only one jail could hold.", "\n\nLearn the secrets behind Earth's Mightiest Villains and why your heroes should pray they never escape:\n\nArmory: a psychotic weapons master capable of forming any weapon from the power of mystic crystals brought to Earth by the dreaded Scion.", "\n\nAtrocity: the result of a failed WWII super-soldier program, he is raw savagery and unstoppable power wrapped in an immortal body.", "\n\nBrainstorm: one of the smartest men alive, a man who believes he is destined to use his genius to rule the world.", "\n\nGarotte: this hired killer uses his elastic form to enter any room and silently choke his target to death.", "\n\nEquinox: for decades a mad scientist conducted experiments on his four children to turn them into heroes, when he finally succeeded however, he was the first victim of children traumatized by a lifetime of painful tests and treatments. ", "They are masters and mistresses of the elements:\n\nBrimstone: her touch is a fiery death, her breath the poisonous smoke of an erupting volcano\n\nGale Force: a living creature of air, he can generate a wind to knock down a building or steal the breath from your lungs\n\nPermafrost: like the arctic she can kill you slowly or in minutes\n\nSculpture: the man of granite\n\nGround Zero: a great scientist turned into a living nuclear bomb by a freak accident, his uncontrollable powers led him to beg for incarceration in Rock City.", "\n\nThe Hollow Men: they claim they are heroes from a future where overpopulation has doomed the Earth but their proposed solution made them enemies of the world. ", "Led by super-genius Walter Frazier, this team of fanatics is determined to reduce Earth's population by 90% by any means necessary.", "\n\nLunatic: a man with the strength and ferocity of a feral beast, he hunts by night and humans are his favorite prey.", "\n\nThrottle: as fast and deadly as a bullet, anything he can't fly around he can fly through.", "\n\nAura: beautiful and deadly, this alien lives off the lifeforce of sentient creatures and Dr. Frazier has promised her more than she could ever consume in the bloated race of humanity.", "\n\nGrotesque: a gargoyle made flesh, this relentless killer claims to be a mystical creature. ", "Regardless, his sadistic pleasure in the death of the living makes him a terror no one wants to confront.", "\n\nDr. Walter Frazier: this time traveling genius from the future has concluded that only the most radical solution can save humanity from itself.", "\n\nOmega: she is the world's greatest assassin, armed with weapons, sensors and body armor of her own design. ", "She could be a great hero but she loves only money.", "\n\nShillelagh: The owner of a mystical Irish staff, this madman seeks to rend the veil between dimensions permanently, allowing the beasts of legend dominion over an earth that once was theirs.", "\n\nSkullcap: no one knows what the motivation of this silent killer is but his psychotic rages are legendary.", "\n\nStigma: once a great hero, this superhuman brute has sworn himself to Brainstorm, content to protect him until his inevitable conquest of Earth.", "\n\nStrongarm: not the brightest criminal in the world, still, his seemingly limitless might and invulnerability brought him within a hair of uniting half the world's organized crime families under his control.", "\n\nTower: the mightiest robot ever constructed, this relentless machine of terror was initially designed to serve as a new body for the Savant. ", "When the transfer of his consciousness was interrupted by USHER agents, the body somehow became self-aware and is determined to wipe out all organic \"viruses\" infesting Earth, replacing us with its new progeny. ", "First it will kill its creator, then the rest of humanity." ]

{ "pile_set_name": "Pile-CC" }

[ 0.002018305705860257, 0.0328654982149601, 0.06950072944164276, 0.01374251488596201, 0.011280791833996773, 0.0025634835474193096, 0.42297980189323425, 0.009951671585440636, 0.06355253607034683, 0.0012367806630209088, 0.0012336333747953176, 0.2806870937347412, 0.001716327853500843, 0.02030721679329872, 0.1344612091779709, 0.12859860062599182, 0.0008155780960805714, 0.0022968309931457043, 0.0009451606310904026, 0.0013321577571332455, 0.1183965802192688, 0.025883862748742104, 0.011885169893503189, 0.0035193406511098146, 0.0010997846256941557, 0.7470237612724304 ]

[ "Dear colleagues,\n\nIt has been a very eventful year, in my capacity as the Editor-in-Chief of the *Indian Journal of Radiology and Imaging* (IJRI) that, along with my team, I have tried to bring the best of latest in the field of Radiology, through our quarterly publications. ", "I would like to convey my sincere thanks to all of you for having been with me in helping sail the year smoothly.", "\n\nAs we have stepped into the New Year, it greets us with newer challenges and frontiers to conquer, for which I solicit your continued support.", "\n\nThe recently concluded 67^th^ National IRIA Congress at Agra was a mixture of scientific education, at the backdrop of the misty Taj Mahal, one of the Seven Wonders of the World. ", "The growing academic viewership along with workshops added newer dimensions to an awakening globe. ", "The various advances in imaging, coupled with the rich International faculty, gave the congress the much needed push in the arena.", "\n\nTwo important issues simmered up during the actual proceedings. ", "One of them is extremely relevant to the young writers about the order of authors in an article, as raised by one senior faculty member. ", "According to the Uniform Requirements for Manuscripts Submitted to Biomedical Journals,\\[[@ref1]\\] designation as an author must satisfy three conditions. ", "The author must have:\n\nContributed substantially to the conception and design of the study, the acquisition of data, or the analysis and interpretationDrafted or provided critical revision of the articleProvided final approval of the version to publish.", "\n\nAcquisition of funds, or general supervision of the group alone does not constitute authorship. ", "Many medical journals have abandoned the strict notion of author, with the flexible notion of *contributor*.\\[[@ref2]\\]\n\nIn scientific literature, the head or the principal investigator\\'s name is put last in the author\\'s list in order of their contribution. ", "However, this concept is much easier interpreted than practiced giving rise to conflict, more often than not. ", "A recent study published in the Canadian Medical Association Journal revealed that more than two-thirds of 919 corresponding authors disagreed with their co-authors regarding contributions of each author.\\[[@ref3]\\] While the scope for conflict keeps on increasing in the highly competitive academic world, with all contributors owning all credit for authorship, due care needs to be exercised by the Head of the department in ameliorating this situation.", "\n\nThe second issue that cropped up during the congress was modalities of Radiology are surely but steadily going out to other Clinicians/Physicians/Surgical colleagues and who\\'s to stop all this? ", "One of the leading vivid examples is Lung Sonography being actually practiced by Intensivists and not Radiologists! ", "In fact, the path seems to have assumed steeper dimensions with Emergency Medicine colleagues performing Sonography as well. ", "While all the hue and cry about the above two specialities of medicine making ways in using Sonography as the regular modality in their daily practice is being made, it looks rather strange and indigestible that Intensivists are teaching Lung Sonography! ", "Radiological and Diagnostic Imaging Modalities, right from X-rays to positron emission tomography and computed tomography (PET CT), are the birth right of any Radiologist, as we have received the due qualification in this regard, on the completion of the necessary training and examination conducted by the Medical Council of India. ", "A very pertinent question that comes to our mind is that are we incompetent in using our own modalities, despite having received the due certificate of practice to handle these equipment?", "\n\nOn the one hand, as this trespassing of other medical specialities into Radiological arena is creating waves, its quiet a elephant in the room situation, since, Obstetricians and Gynecologists have been practicing ultrasound for a fairly long time, now. ", "Bodies like Indian Federation of Ultrasound in Medicine and Biology (IFUMB), which comprises of Radiologists and Gynecologists, have Gynecologists who practice Sonography vehemently.", "\n\nThe apex body of Gynecologists in India, Federation of Obstetric and Gynaecological Societies of India (FOGSI), has a dedicated Imaging Sciences Committee, which takes care of imaging-related aspects. ", "The period of awakening and action at all governmental levels is needed; otherwise, we as Radiologists would actually face the danger of extinction.", "\n\nIn pursuit of offering specialized issues to our learned members, with colleagues acting as Guest Editors to dedicated issues, we begin Functional magnetic resonance imaging (MRI) segment in this issue, which is being edited by Dr. Santosh Gupta. ", "The issue features leading contributors with their latest articles. ", "The capability of the brain with its myriad problems can be assessed in a good measure by Functional MRI, thus paving the path for future research.", "\n\nOne of the important features of any IRIA Annual Congress is the swearing in of the new President. ", "Dr. Bhavin Jankharia has taken over as President, IRIA, at Agra. ", "His presidency assumes significance as he was the Immediate Past Editor of IJRI. ", "As a custom, his Presidential Address is featured in the journal.", "\n\nPlease keep writing to me on the areas of interest that you would like to concentrate upon, IJRI would delve into them, by bringing in newer research-based original articles, from edition to edition.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.0005135683459229767, 0.0005108139012008905, 0.0005687918746843934, 0.0005936431116424501, 0.0005432837642729282, 0.0005408527795225382, 0.0005706577212549746, 0.0005215390701778233, 0.000549338583368808, 0.0005291694542393088, 0.0005857096402905881, 0.0006161676719784737, 0.0005804567481391132, 0.0005636414862237871, 0.0008066119044087827, 0.0006509945960715413, 0.000673190166708082, 0.001027108053676784, 0.0005758510669693351, 0.0007458370528183877, 0.0033694342710077763, 0.0011454157065600157, 0.0041757491417229176, 0.0006544037605635822, 0.0005457739462144673, 0.0005951778730377555, 0.0005688965320587158, 0.0005840238882228732, 0.0006436567637138069, 0.0005666345241479576, 0.0005252009723335505, 0.000508087920024991, 0.001995444530621171 ]

[ "More Topics\n\nWeather Forecast\n\nFour injured in rollover east of Mitchell\n\nEmergency workers respond to a single-vehicle crash Monday afternoon on Interstate 90, about five miles east of Mitchell. ", "Four people were injured in the crash. (", "Chris Mueller/Republic)\n\nFour people were injured in a single-vehicle rollover Monday afternoon on Interstate 90, about five miles east of Mitchell.", "\n\nClete Greseth, 72, was driving westbound in a 2011 Ford F-150, with his wife, 54-year-old Catherine Greseth, in the front passenger seat and his son, 53-year-old Wade Greseth, and his son's wife, 51-year-old Shari Greseth, in the back seats.", "\n\nClete and Catherine Greseth are both from Santa Fe, N.M., and Wade and Shari Greseth are from Hermosa, a small town in western South Dakota.", "\n\nClete Greseth, the driver, apparently lost control of the vehicle, causing it enter the median, launch off a crossing and roll before coming to rest on its roof, according to South Dakota Highway Patrol Trooper Dan Podzimek.", "\n\nBob Rose, of Rapid City, was driving nearby and witnessed the crash.", "\n\n\"I saw the vehicle in the air,\" Rose said in an interview with The Daily Republic at the scene. \"", "It was completely in the air and then hit and started rolling.\"", "\n\nRose, who isn't a trained emergency responder, said he was one of about 20 people who saw the crash and stopped to help.", "\n\n\"People were there the minute that thing stopped rolling,\" he said.", "\n\nThe first ambulance arrived about five minutes after the crash, while bystanders were still trying to get the occupants out of the wrecked vehicle, Rose said.", "\n\nClete and Catherine Greseth were both wearing seatbelts and each suffered minor injuries in the crash, but Wade and Shari Greseth were not wearing seatbelts and each suffered serious, but non-life threatening injuries, Podzimek said. ", "All four were transported by ambulance to Avera Queen of Peace Hospital in Mitchell.", "\n\nNo citations have been issued, but the cause of the crash is still under investigation, Podzimek said.", "\n\nA dog, an Australian shepherd named Tucker, was also in the vehicle at the time of the crash but ran off and had not been located as of Monday evening, Podzimek said." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005831737071275711, 0.0007403154158964753, 0.0006154689472168684, 0.0011002550600096583, 0.0007916695903986692, 0.0011230530217289925, 0.0007314748363569379, 0.0006132491398602724, 0.001249933848157525, 0.0007636421942152083, 0.0006213330198079348, 0.0008088047034107149, 0.0010305149480700493, 0.0006393629591912031, 0.0007122348761186004, 0.0008329465053975582 ]

[ " a composite number?", "\nTrue\nIs 6663 a prime number?", "\nFalse\nIs 229715 prime?", "\nFalse\nIs 1941223 a prime number?", "\nFalse\nIs 164471 a composite number?", "\nFalse\nIs 7778 prime?", "\nFalse\nIs 66237 a prime number?", "\nFalse\nIs 128669 a composite number?", "\nFalse\nIs 16827397 prime?", "\nTrue\nIs 1371 a composite number?", "\nTrue\nIs 501 a prime number?", "\nFalse\nIs 851899 a composite number?", "\nFalse\nIs 441971 composite?", "\nFalse\nIs 26327 prime?", "\nFalse\nIs 139233 a prime number?", "\nFalse\nIs 2897 composite?", "\nFalse\nIs 2190091 a composite number?", "\nFalse\nIs 29789 prime?", "\nTrue\nIs 13989 composite?", "\nTrue\nIs 73001 a prime number?", "\nFalse\nIs 475949 a composite number?", "\nTrue\nIs 4525981 prime?", "\nTrue\nIs 54541 prime?", "\nTrue\nIs 2453 a composite number?", "\nTrue\nIs 6029 composite?", "\nFalse\nIs 1703783 prime?", "\nTrue\nIs 2203 a prime number?", "\nTrue\nIs 63223 prime?", "\nFalse\nIs 10453 a prime number?", "\nTrue\nIs 421607 a prime number?", "\nTrue\nIs 57643 a prime number?", "\nFalse\nIs 4703 prime?", "\nTrue\nIs 46091 a composite number?", "\nFalse\nIs 247669 a prime number?", "\nFalse\nIs 36082 a prime number?", "\nFalse\nIs 789187 composite?", "\nTrue\nIs 47459 composite?", "\nFalse\nIs 2837 prime?", "\nTrue\nIs 3843499 composite?", "\nTrue\nIs 461971 a composite number?", "\nFalse\nIs 361729 prime?", "\nFalse\nIs 25717 composite?", "\nFalse\nIs 512089 a prime number?", "\nFalse\nIs 3107 a composite number?", "\nTrue\nIs 81449 prime?", "\nFalse\nIs 916259 a composite number?", "\nFalse\nIs 200047 composite?", "\nTrue\nIs 21169 a prime number?", "\nTrue\nIs 163 a prime number?", "\nTrue\nIs 147029 prime?", "\nTrue\nIs 148978 prime?", "\nFalse\nIs 4109 a composite number?", "\nTrue\nIs 476347 a composite number?", "\nFalse\nIs 4201 prime?", "\nTrue\nIs 445 prime?", "\nFalse\nIs 3122443 a prime number?", "\nFalse\nIs 15815 a composite number?", "\nTrue\nIs 5158 a composite number?", "\nTrue\nIs 5645 a composite number?", "\nTrue\nIs 166147 prime?", "\nTrue\nIs 22807 prime?", "\nTrue\nIs 285823 composite?", "\nFalse\nIs 22901 a composite number?", "\nFalse\nIs 6449 a composite number?", "\nFalse\nIs 878489 a prime number?", "\nTrue\nIs 259 prime?", "\nFalse\nIs 379 composite?", "\nFalse\nIs 189547 prime?", "\nTrue\nIs 440843 a composite number?", "\nTrue\nIs 149921 a composite number?", "\nFalse\nIs 52781 prime?", "\nFalse\nIs 329131 composite?", "\nTrue\nIs 12451 composite?", "\nFalse\nIs 139361 composite?", "\nFalse\nIs 2778099 composite?", "\nTrue\nIs 184883 a composite number?", "\nTrue\nIs 40909 a prime number?", "\nFalse\nIs 2402 a prime number?", "\nFalse\nIs 98297 composite?", "\nFalse\nIs 5227 composite?", "\nFalse\nIs 132317 a prime number?", "\nFalse\nIs 481343 a composite number?", "\nFalse\nIs 4534 prime?", "\nFalse\nIs 38401 prime?", "\nFalse\nIs 47453 a prime number?", "\nFalse\nIs 1931 a prime number?", "\nTrue\nIs 230557 a composite number?", "\nTrue\nIs 101509 prime?", "\nFalse\nIs 654491 a composite number?", "\nFalse\nIs 180161 a composite number?", "\nFalse\nIs 2363359 composite?", "\nFalse\nIs 1171309 a prime number?", "\nFalse\nIs 188459 a composite number?", "\nFalse\nIs 9977 prime?", "\nFalse\nIs 1535 composite?", "\nTrue\nIs 208918 a prime number?", "\nFalse\nIs 32203 a prime number?", "\nTrue\nIs 950639 a composite number?", "\nFalse\nIs 5051 prime?", "\nTrue\nIs 7830577 a prime number?", "\nTrue\nIs 1949 a composite number?", "\nFalse\nIs 213881 a composite number?", "\nFalse\nIs 116995 composite?", "\nTrue\nIs 1630159 composite?", "\nFalse\nIs 5147 composite?", "\nFalse\nIs 468415 composite?", "\nTrue\nIs 2722 composite?", "\nTrue\nIs 14963 composite?", "\nTrue\nIs 11579 a composite number?", "\nFalse\nIs 112641 composite?", "\nTrue\nIs 52999 a prime number?", "\nTrue\nIs 1657 a composite number?", "\nFalse\nIs 17657 a prime number?", "\nTrue\nIs 20161 composite?", "\nFalse\nIs 492581 composite?", "\nTrue\nIs 4045 prime?", "\nFalse\nIs 183569 a prime number?", "\nTrue\nIs 2357 a prime number?", "\nTrue\nIs 29117 composite?", "\nTrue\nIs 103001 a composite number?", "\nFalse\nIs 15173 composite?", "\nFalse\nIs 13909 a prime number?", "\nFalse\nIs 11069 a composite number?", "\nFalse\nIs 229193 composite?", "\nTrue\nIs 7283 prime?", "\nTrue\nIs 8391073 a prime number?", "\nTrue\nIs 191 a prime number?", "\nTrue\nIs 228221 prime?", "\nFalse\nIs 52201 composite?", "\nFalse\nIs 328477 composite?", "\nTrue\nIs 320821 prime?", "\nTrue\nIs 7493 a prime number?", "\nFalse\nIs 47053 a prime number?", "\nFalse\nIs 30673 a composite number?", "\nTrue\nIs 71493 prime?", "\nFalse\nIs 2162543 a prime number?", "\nTrue\nIs 9069 prime?", "\nFalse\nIs 206177 prime?", "\nTrue\nIs 35797 a composite number?", "\nFalse\nIs 102385 composite?", "\nTrue\nIs 14857 prime?", "\nFalse\nIs 5703 a prime number?", "\nFalse\nIs 99377 a composite number?", "\nFalse\nIs 15527 a prime number?", "\nTrue\nIs 5891 a prime number?", "\nFalse\nIs 31091 prime?", "\nTrue\nIs 31303 composite?", "\nTrue\nIs 66919 a composite number?", "\nFalse\nIs 460969 a composite number?", "\nFalse\nIs 8609 a composite number?", "\nFalse\nIs 1282 a composite number?", "\nTrue\nIs 1739 a prime number?", "\nFalse\nIs 81097 a prime number?", "\nTrue\nIs 15959 composite?", "\nFalse\nIs 342647 a composite number?", "\nFalse\nIs 343031 prime?", "\nFalse\nIs 9643 composite?", "\nFalse\nIs 683 a composite number?", "\nFalse\nIs 369791 a prime number?", "\nTrue\nIs 269162 a prime number?", "\nFalse\nIs 2590721 composite?", "\nTrue\nIs 2101 a composite number?", "\nTrue\nIs 4757 a prime number?", "\nFalse\nIs 91505 prime?", "\nFalse\nIs 329 prime?", "\nFalse\nIs 1721 a composite number?", "\nFalse\nIs 112403 prime?", "\nTrue\nIs 617401 a prime number?", "\nTrue\nIs 16183 a composite number?", "\nFalse\nIs 72043 prime?", "\nTrue\nIs 104249 prime?", "\nFalse\nIs 2215277 a prime number?", "\nTrue\nIs 128543 a composite number?", "\nTrue\nIs 228679 a prime number?", "\nFalse\nIs 16943 composite?", "\nFalse\nIs 1889 composite?", "\nFalse\nIs 12097 prime?", "\nTrue\nIs 36983 prime?", "\nFalse\nIs 1744739 a prime number?", "\nFalse\nIs 3593 composite?", "\nFalse\nIs 3499 prime?", "\nTrue\nIs 990959 a composite number?", "\nTrue\nIs 61147 prime?", "\nFalse\nIs 74489 a composite number?", "\nFalse\nIs 10061 composite?", "\nFalse\nIs 185021 a prime number?", "\nTrue\nIs 2650421 a prime number?", "\nFalse\nIs 280409 prime?", "\nTrue\nIs 1277 prime?", "\nTrue\nIs 152617 a composite number?", "\nFalse\nIs 12209 composite?", "\nTrue\nIs 196723 a composite number?", "\nTrue\nIs 33997 a composite number?", "\nFalse\nIs 47473 a composite number?", "\nTrue\nIs 9311 composite?", "\nFalse\nIs 146279 a composite number?", "\nTrue\nIs 915683 prime?", "\nTrue\nIs 11147 composite?", "\nTrue\nIs 1194059 composite?", "\nFalse\nIs 663151 prime?", "\nFalse\nIs 2679479 composite?", "\nTrue\nIs 13643 a composite number?", "\nTrue\nIs 54541 a prime number?", "\nTrue\nIs 186071 composite?", "\nFalse\nIs 46201 a composite number?", "\nTrue\nIs 2999 composite?", "\nFalse\nIs 163919 prime?", "\nFalse\nIs 592271 prime?", "\nFalse\nIs 16669 a composite number?", "\nTrue\nIs 219665 a prime number?", "\nFalse\nIs 28293 composite?", "\nTrue\nIs 912298 a prime number?", "\nFalse\nIs 46571 a composite number?", "\nTrue\nIs 1533413 a composite number?", "\nTrue\nIs 1343627 a prime number?", "\nTrue\nIs 740965 composite?", "\nTrue\nIs 14657 composite?", "\nFalse\nIs 5669 a composite number?", "\nFalse\nIs 92405 composite?", "\nTrue\nIs 16041 composite?", "\nTrue\nIs 6805 composite?", "\nTrue\nIs 119039 composite?", "\nFalse\nIs 123889 composite?", "\nTrue\nIs 1083707 a prime number?", "\nTrue\nIs 1257 a prime number?", "\nFalse\nIs 138101 composite?", "\nFalse\nIs 865 composite?", "\nTrue\nIs 338833 a composite number?", "\nTrue\nIs 793469 a composite number?", "\nTrue\nIs 2819 composite?", "\nFalse\nIs 94291 composite?", "\nFalse\nIs 395 a prime number?", "\nFalse\nIs 28201 a prime number?", "\nTrue\nIs 60087 a prime number?", "\nFalse\nIs 500957 composite?", "\nFalse\nIs 2302 a composite number?", "\nTrue\nIs 43039 a composite number?", "\nTrue\nIs 20441 a prime number?", "\nTrue\nIs 295333 a prime number?", "\nTrue\nIs 2161 a composite number?", "\nFalse\nIs 41577 a composite number?", "\nTrue\nIs 736787 prime?", "\nTrue\nIs 422677 a composite number?", "\nTrue\nIs 20593 composite?", "\nFalse\nIs 316493 a prime number?", "\nTrue\nIs 347329 a composite number?", "\nFalse\nIs 20669 a composite number?", "\nTrue\nIs 337373 prime?", "\nFalse\nIs 116891 a composite number?", "\nTrue\nIs 8311 composite?", "\nFalse\nIs 91507 composite?", "\nTrue\nIs 458357 a composite number?", "\nFalse\nIs 1854487 composite?", "\nFalse\nIs 25147 prime?", "\nTrue\nIs 21799 a prime number?", "\nTrue\nIs 86003 prime?", "\nFalse\nIs 1191379 a composite number?", "\nTrue\nIs 360037 prime?", "\nTrue\nIs 145387 prime?", "\nFalse\nIs 179317 a prime number?", "\nTrue\nIs 31261 a prime number?", "\nFalse\nIs 10495 a prime number?", "\nFalse\nIs 49615 composite?", "\nTrue\nIs 140521 a composite number?", "\nFalse\nIs 107309 a prime number?", "\nTrue\nIs 2897 a prime number?", "\nTrue\nIs 6835 a prime number?", "\nFalse\nIs 57467 a composite number?", "\nFalse\nIs 99563 composite?", "\nFalse\nIs 2437 prime?", "\nTrue\nIs 3427 prime?", "\nFalse\nIs 159 a prime number?", "\nFalse\nIs 8443 a composite number?", "\nFalse\nIs 35419 composite?", "\nFalse\nIs 20039 a prime number?", "\nFalse\nIs 91183 composite?", "\nFalse\nIs 17077 a prime number?", "\nTrue\nIs 28759 prime?", "\nTrue\nIs 13042 prime?", "\nFalse\nIs 74821 a composite number?", "\nFalse\nIs 39643 a composite number?", "\nTrue\nIs 6469 prime?", "\nTrue\nIs 1640803 composite?", "\nFalse\nIs 312269 a composite number?", "\nFalse\nIs 649849 composite?", "\nFalse\nIs 41611 a composite number?", "\nFalse\nIs 2251 pri" ]

{ "pile_set_name": "DM Mathematics" }

[ 0.0008118898840621114, 0.0015346542932093143, 0.002531752921640873, 0.0021325447596609592, 0.0020042629912495613, 0.0038254971150308847, 0.002583286492154002, 0.0019931544084101915, 0.0016236456576734781, 0.0010900782654061913, 0.0016037487657740712, 0.0030226847156882286, 0.002803928218781948, 0.0011912250192835927, 0.002568970900028944, 0.0015991164837032557, 0.005380704998970032, 0.0024960176087915897, 0.0010374438716098666, 0.0011221428867429495, 0.0017910858150571585, 0.001177882426418364, 0.0009536858415231109, 0.00118580786511302, 0.0009091274114325643, 0.0029569717589765787, 0.001361732603982091, 0.0011453627375885844, 0.0021288737189024687, 0.0010427049128338695, 0.0013460814952850342, 0.001767024747096002, 0.0012452987721189857, 0.002230376238003373, 0.0030392534099519253, 0.0027930920477956533, 0.0009469529613852501, 0.0015977626899257302, 0.0011269163805991411, 0.0013480091001838446, 0.0022508285474032164, 0.001527875429019332, 0.0023898351937532425, 0.0016905368538573384, 0.0011484475107863545, 0.00273099634796381, 0.0013752923114225268, 0.0014763610670343041, 0.001216814387589693, 0.0010372002143412828, 0.0015271308366209269, 0.002038155449554324, 0.0012588780373334885, 0.0017437712522223592, 0.0010679649421945214, 0.0019441869808360934, 0.002294135745614767, 0.0009241068037226796, 0.001000855816528201, 0.0008585205068811774, 0.0012269311118870974, 0.0008834051550365984, 0.001860912307165563, 0.0014556186506524682, 0.0027042401488870382, 0.0008874487830325961, 0.003906103316694498, 0.0013951290166005492, 0.001184101216495037, 0.0013973894529044628, 0.002910373266786337, 0.0010585362324491143, 0.0009258153149858117, 0.0019049738766625524, 0.005128353834152222, 0.0011922544799745083, 0.0013215465005487204, 0.00305975042283535, 0.0017930424073711038, 0.001221421523950994, 0.0024874310474842787, 0.00208287057466805, 0.0023325823713093996, 0.002358880825340748, 0.002691839588806033, 0.0019959157798439264, 0.001105043338611722, 0.001180974766612053, 0.0029835861641913652, 0.002056865254417062, 0.0018222843063995242, 0.002793282037600875, 0.001462033367715776, 0.004133583512157202, 0.006906820461153984, 0.0012999331811442971, 0.0025071322452276945, 0.0010391774121671915, 0.0015352783957496285, 0.0012698541395366192, 0.0009399004047736526, 0.003440926782786846, 0.007091601379215717, 0.0008471341570839286, 0.001693213009275496, 0.0036274162121117115, 0.0008994455565698445, 0.001155249192379415, 0.0011292202398180962, 0.0014775651507079601, 0.0016285821329802275, 0.0013560925144702196, 0.0022319951094686985, 0.0008307960233651102, 0.002558284904807806, 0.0009667450212873518, 0.0025859849993139505, 0.0014867994468659163, 0.0009521105093881488, 0.001359372865408659, 0.0031242812983691692, 0.0030907215550541878, 0.0026104303542524576, 0.002028827089816332, 0.0011929855681955814, 0.0017818044871091843, 0.0013338970020413399, 0.001113625825382769, 0.001525079715065658, 0.0010793291730806231, 0.0010859448229894042, 0.0015495260013267398, 0.0019464569631963968, 0.00186021882109344, 0.0011686338111758232, 0.0025195791386067867, 0.0011491002514958382, 0.0020263572223484516, 0.001310037332586944, 0.0017819817876443267, 0.0009320977260358632, 0.0023389961570501328, 0.0032018213532865047, 0.002078202785924077, 0.0015149120008572936, 0.002044584369286895, 0.0009442470036447048, 0.0012661598157137632, 0.002909510163590312, 0.003588959341868758, 0.0018284163670614362, 0.0011652663815766573, 0.0028007712680846453, 0.0011929413303732872, 0.0016964419046416879, 0.0016753472154960036, 0.0024619705509394407, 0.0031286505982279778, 0.005086864344775677, 0.0013001274783164263, 0.001891203224658966, 0.0011586887994781137, 0.0013068874832242727, 0.0018838904798030853, 0.001580675016157329, 0.001438935985788703, 0.0019703523721545935, 0.0014774990268051624, 0.0011132524814456701, 0.0016267799073830247, 0.00116330711171031, 0.0024553837720304728, 0.0010609133169054985, 0.001552696106955409, 0.003616628237068653, 0.001344002434052527, 0.0028175855986773968, 0.0013541668886318803, 0.001860397751443088, 0.0031747978646308184, 0.004107433836907148, 0.0015228529227897525, 0.0011153866071254015, 0.0024173385463654995, 0.0028969570994377136, 0.003043387085199356, 0.001358967856504023, 0.0019227645825594664, 0.0010777669958770275, 0.001212231582030654, 0.0031727205496281385, 0.0010959707433357835, 0.0013015145668759942, 0.0023512891493737698, 0.0008456595242023468, 0.002121016616001725, 0.0012846947647631168, 0.0008833467145450413, 0.0009015785763040185, 0.0017666295170783997, 0.002548122312873602, 0.0010417064186185598, 0.0012499659787863493, 0.0008704387000761926, 0.002702932571992278, 0.0012510354863479733, 0.004077576100826263, 0.003683841321617365, 0.0020045749843120575, 0.0014112459030002356, 0.001830472145229578, 0.0014562078285962343, 0.0023645758628845215, 0.0012028550263494253, 0.0012919016880914569, 0.0009243904496543109, 0.0008629382937215269, 0.0030621967744082212, 0.0018439560662955046, 0.0009037843556143343, 0.0009350463515147567, 0.000829867844004184, 0.004159513395279646, 0.0013571641175076365, 0.0012978090671822429, 0.0013931028079241514, 0.003716893494129181, 0.0013021108461543918, 0.0013331554364413023, 0.0011057800147682428, 0.0015649705892428756, 0.0019825585186481476, 0.0017400657525286078, 0.0014714418211951852, 0.0014429332222789526, 0.0024650755804032087, 0.0008750978158786893, 0.0012293654726818204, 0.0014592369552701712, 0.001179146463982761, 0.002042102860286832, 0.001450484967790544, 0.0015016248216852546, 0.0009063761681318283, 0.0014825713587924838, 0.0014665289781987667, 0.002155375899747014, 0.000914722157176584, 0.0036893035285174847, 0.0009302230319008231, 0.0014356018509715796, 0.0012121346080675721, 0.00107207999099046, 0.002534563886001706, 0.0016087704570963979, 0.0012587124947458506, 0.0022430215030908585, 0.0010227232705801725, 0.0013225858565419912, 0.0020325358491390944, 0.0013939966447651386, 0.0030796180944889784, 0.0016722232103347778, 0.0011205699993297458, 0.0031987561378628016, 0.001322653261013329, 0.0012226490071043372, 0.0019495765445753932, 0.0027659274637699127, 0.0024861348792910576, 0.0009641571668908, 0.0028774477541446686, 0.00202952534891665, 0.0018530708039179444, 0.002279018284752965, 0.0023159028496593237, 0.0021806342992931604, 0.0009828368201851845, 0.0009708298603072762, 0.00266653741709888, 0.0030552290845662355, 0.0012153317220509052, 0.0008959600236266851, 0.0013554873876273632, 0.0017196021508425474, 0.0021906776819378138, 0.007744668051600456 ]

[ "It's upsetting that Mario Chalmers' reputation has made him the butt of almost all Heat-related jokes. ", "Despite being constantly yelled at by teammates, Chalmers has enjoyed a solid basketball pedigree.", "\n\nMario is an NCAA Champion in addition to being a two-time NBA champion. ", "Moreover, while certainly not basketball related, what other NBA player do you know who's been named to People's sexiest men alive list. ", "To say the least, Alaska's Sexiest man is a special player and has had his moments as a member of the Miami Heat, however he's declined significantly since the 2014 NBA Finals and thus it now appears as if his future with the Heat organization is in jeopardy.", "\n\nUpon reading Zach Lowe's \"Free Agency Winners/Losers\" piece, it's clear where Miami's stance is on Mario and why they may or may not be shopping him:\n\nBringing Wade back on a one-year, $20 million deal puts the Heat about $13 million over the projected tax line, and Miami wants no part of the harsh repeater penalties that would come with paying the tax for a fourth time in five seasons. ", "Mario Chalmers and Chris Andersen are available for nothing, per several league sources, and the Heat have even put out Shabazz Napier feelers with an eye on carving out extra cap room next summer.", "\n\nI can understand why the Heat would be shopping Birdman (he just turned 37) and Shabazz Napier (let's face it, he was really only drafted to make LeBron happy), however I do really believe that Mario has a role on this team even if it's shifted significantly since 2014.", "\n\nWhy he should stay:\n\nRight now Miami's depth chart at shooting guard is as follows:\n\nThis depth chart as is should frighten you, once you remove Mario Chalmers it becomes terrifying. ", "For Dwyane Wade it's not a question of \"if\" he will miss games to injury this season, but \"when\" and generally (or at least last season) when Wade is out, Mario performs at his best.", "\n\nIn the 18 games Mario started with Wade out he averaged 13.1 points, 5.8 assists, and shot 41% from the field, as per StatMuse. ", "These numbers are significantly better than the 9.3 points, 3.3 assists and the 39.8% field goal percentage he averaged when Wade did play. ", "With that being said, it's obvious that Miami needs Mario's output to be competitive with Wade on the bench.", "\n\nDespite some impressive Summer League play, Dragic and Richardson are simply not NBA ready at this time, and Miami would become a liability from the shooting guard position if Chalmers was dealt. ", "While Justise Winslow could spend time at that position as well, his skills seem to be more suited at the small forward position and will likely play behind Luol Deng in his rookie season.", "\n\nBe that as it may, Miami does have solid reasoning from a basketball standpoint to want to deal 'Rio.", "\n\nWhy he should go:\n\nMario makes questionable decisions\n\nSometimes I can't help but praise Chalmers as he drives recklessly and contorts his body to make a difficult shot, but other times I have to take a minute to understand what was going through his mind. ", "Mario has been in the league seven years, and can now be considered a veteran, so while he should be doing things like this:\n\nHe's usually doing things like this:\n\nHis shooting declined significantly\n\nWhile a lot can be attributed to a shift in role, various statistics shouldn't have changed drastically for Chalmers from 2014 to 2015. ", "In the 2013-2014 season Mario shot 38% from the three point line, however this year (when Miami desperately needed help from beyond the arc) he averaged 29%, a career worst for him. ", "I know he entered a shooting slump in the 2014 Finals, yet it's hard to believe it could last a whole year.", "\n\nHe's lost touch with his role\n\nPerhaps it's mental, but after the 2014 Finals, Mario seemed to lose confidence. ", "He didn't think he would be re-signed by the Heat, and when Norris Cole stole the starting spot from him he appeared to be at an all time low. ", "In April, Chalmers voiced his concerns explaining that he didn't really know what his role on the team was anymore and didn't improve as the season whined down. ", "While this could change with a Dragic run offense, there's really no telling if Mario will be able to get back to his old ways.", "\n\nFinal word:\n\nWhile it's understandable why Miami might want to get rid of Chalmers, they simply cannot do so with the depth chart the way it is at this moment in time. ", "Without Wade, there's nobody to pick up the scoring slack besides Mario, and thus he's essential to the team for the time being. ", "Mario is also a product of the Heat culture and has been part of numerous championship runs, so he really does have veteran knowledge -- though oftentimes he doesn't show it.", "\n\nThe only reason why Mario should be dealt, is if Miami signs a veteran shooting guard to backup Wade. ", "Other than that I don't think the Heat are in a position to part with him, especially for nothing." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.020401528105139732, 0.0010068916017189622, 0.0006954070413485169, 0.0022076976019889116, 0.0007907674880698323, 0.0014239799929782748, 0.0006261279922910035, 0.0006511183455586433, 0.0014401850057765841, 0.0009392249630764127, 0.0009376397356390953, 0.0008703516214154661, 0.000701259879861027, 0.0006574690924026072, 0.0006612756405957043, 0.0005579476128332317, 0.0006911309901624918, 0.0005963814328424633, 0.0014193354872986674, 0.0005521164857782423, 0.0007047756225802004, 0.0009351590415462852, 0.0006074749398976564, 0.00607764907181263, 0.0005532398936338723, 0.000758242909796536, 0.0007008660468272865, 0.001363046234473586, 0.001404028618708253 ]

[ "Agric Minister denies blowing ¢20M on wrong armyworms chemicals\n\nThe Food and Agriculture Minister has denied reports in the media that the Ministry had blown a whopping ¢20 million on chemicals in dealing with the recent Fall armyworms invasion.", "\n\nIn a rejoinder signed by the Secretary to the Minister, Isaah Alhassan said, “the story, which is sourced to the NDC MP for Bongo, Edward Bawa, is not only misleading but also full of propaganda.”", "\n\nThe statement added that it is a calculated attempt to smear the image and reputation of the Minister, Dr. Owusu Afriyie Akoto.", "\n\n“…the amount earmarked by government to fight the invasion of the armyworms is less than the one being quoted by the Minister. ", "The Finance Ministry released an amount of ¢16M out of which ¢15,815m was released to the ministry,” the statement said.", "\n\nAccording to the Ministry, the chemicals were approved after exhaustive consultations with sister countries, the CSIR, EPA and the PPRSD under the Ministry before orders were made for their purchase.", "\n\nThe Ministry, therefore, stated emphatically that reports from across the length and breadth of the country indicate massive progress in the fight against the armyworms.", "\n\n“Plans are also far advanced to support farmers whose farms were devastated by the armyworms,” the Ministry promised.", "\n\nRead the statement below:\n\nRe: Minister blows GH 20M on wrong chemicals\n\nThe attention of the Office of the Ministry of Food and Agriculture has been drawn to a news item under the above caption and wish to react accordingly.", "\n\nThe story, which is sourced to the NDC MP for Bongo, Edward Bawa, is not only misleading but also full of propaganda and a calculated attempt to indignify the image and reputation of the Minister of Food and Agriculture, Hon. ", "Dr. Owusu Afriyie Akoto.", "\n\nFirst of all, we would like to state emphatically that MOFA has not spent ¢20M on wrong chemicals as the story sought to portray.", "\n\nFor the information of the good people of Ghana, the amount earmarked by government to fight the invasion of the armyworms is less than the one being quoted by the Minister.", "\n\nThe Finance Ministry released an amount of ¢16M out of which ¢15,815m was released to the ministry.", "\n\nPart of this amount was to be used for the procurement of approved chemicals, sensitization and awareness creation, as well as procurement of logistics for the gang spraying team put in place by the National Taskforce and the Committee set up to oversee the fight against the pests.", "\n\nIt will interest everyone to know that these chemicals were approved after exhaustive consultations with sister countries, the CSIR, EPA and the PPRSD under the Ministry before orders were made for their purchase.", "\n\nMOFA will like to state emphatically that reports from across the length and breadth of the country indicate massive progress in the fight against the armyworms.", "\n\nIt must be pointed out that the progress being in the fight against these ‘alien’ pests cannot be limited to one, two or three districts but must rather be seen from a general perspective.", "\n\nMOFA is very hopeful that at the end of the day the country will witness bumper harvests in all the major crops including maize, sorghum, soyabean and rice.", "\n\nPlans are also far advanced to support farmers whose farms were devastated by the armyworms.", "\n\nIn order to prevent future occurrence, MOFA has signed an agreement with the University of Ghana to train personnel of the Plant Protection and Regulatory Division of MOFA.", "\n\nThis partnership with the academia, we hope, will help bolster the emergency response ability of the ministry in fighting all forms of diseases that affect crops and animals in the country.", "\n\nMeanwhile, MOFA will like to assure farmers that the National Surveillance and Monitoring Taskforce made up of personnel from NADMO, CSIR, FAO and PPRSD will continue to be on the ground to respond to distress calls of farmers as we deal with pockets of reports of infection.", "\n\nPOPULAR CATEGORY\n\nAdomOnline.com is your news, politics, business, sports, entertainment, lifestyle website. ", "We provide you with the latest breaking news and content straight from the motherland Ghana and other countries beyond." ]

{ "pile_set_name": "Pile-CC" }

[ 0.005157344974577427, 0.0007044589729048312, 0.0009094116394408047, 0.000736721558496356, 0.0005351703730411828, 0.0005038533126935363, 0.000605283712502569, 0.0007092576124705374, 0.0006209218990989029, 0.0007463052170351148, 0.0036624502390623093, 0.0005650562234222889, 0.0005953868967480958, 0.0005374723114073277, 0.0005718485335819423, 0.00049036048585549, 0.0006478482391685247, 0.0006862407317385077, 0.0007261427817866206, 0.0007689407793805003, 0.0005409541190601885, 0.0006132746348157525, 0.0006412859074771404, 0.0007204231806099415, 0.0005315603339113295 ]

[ "The industry will be forced to pay for their carbon emissions on all flights to and from, as well as within, Europe\n\nAirlines can be charged for their greenhouse gas emissions on flights to and from Europe, according to a landmark court ruling on Thursday.", "\n\nThe indicative ruling, by the advocate general of the European court of justice, is a blow to airlines and non-European governments that had hoped to escape from the extension of the European Union's emissions trading scheme to cover air transport from next year. ", "It was greeted with jubilation by environmental campaigners, who want to ensure that emissions from aviation are subject to the same controls as those of other industries.", "\n\nIf the ruling is followed, airlines will be forced from next year to pay for their carbon emissions on all flights to and from, as well as within, Europe.", "\n\nSarah Burt, staff attorney at the campaigning organisation Earthjustice, said: \"In the absence of an effective global measure for reining in greenhouse gases from aviation, the EU law is a necessary step to address this significant and rapidly expanding source of pollution. ", "We are pleased that the advocate general's opinion confirms the legality of this important action.\"", "\n\nThe UK's climate change minister, Greg Barker, said: \"We welcome today's legal opinion. ", "The UK and EU will continue to robustly defend our policy to bring aviation into the EU's emissions trading system and believe it is consistent with international law. ", "The aviation industry, in the same way as other industries, needs to play its part in reducing emissions.\"", "\n\nIf successful, Europe's move to include international flights in its emissions trading system will be the first time that emissions from flights – which make up about 2 to 3% of global greenhouse gases – have been regulated. ", "Aviation and maritime transport were explicitly excluded from the 1997 Kyoto protocol, the only international binding treaty on emissions reduction.", "\n\nAir industry bodies that helped bring the case to court vowed to fight on. ", "The Air Transport Association said: \"[We are] disappointed that Advocate General Kokott does not believe that the European Union is bound by the Chicago Convention, the treaty governing aviation, and that the unilateral application of the EU [emissions trading sytem] to international aviation otherwise does not violate law. ", "ATA's view that the extension of this unilateral, regional scheme to aviation violates international law is supported by more than 20 countries, including Brazil, Russia, India, China, Japan, the United States and many others, which recently reconfirmed their opposition to the EU.\"", "\n\nUnder the EU's plans, all flights to, from and within Europe will be subject to emissions trading, a system whereby companies must have permits to cover the carbon dioxide they produce. ", "A small number of permits are allocated to companies for free, while the rest must be paid for, and the proportion of free permits is reduced over time. ", "At present, the permits are changing hands for about €14 per tonne on the open market.", "\n\nThe trading system will add to airlines' costs, at a level of as much as €5-10 per passenger, according to some estimates. ", "All of the costs are likely to be passed on to passengers, raising ticket prices.", "\n\nAirlines based outside Europe have bitterly opposed the plans, arguing that the trading system amounts to a tax, which is illegal under international rules on aviation. ", "The US, China and other non-EU governments have taken up the cause, vowing to fight the plans in all legal forums available.", "\n\nThursday's ruling – an indicative and preliminary finding by one senior judge – was a severe setback to their legal challenges, but is not the end. ", "The governments, and airlines, will continue to fight against the EU in the courts and explore other options.", "\n\nThe ATA said: \"Today's action is an important step in the court process, but as it is a non-binding preliminary opinion it does not mark the end of this case. ", "The opinion will provide a basis on which the judges assigned to the case can further deliberate and come to a full and unanimous decision. ", "In complex cases such as this one, it would not be unusual for the full court's final opinion to vary from the preliminary opinion.\"", "\n\nOutside the international legal system, however, the opportunities for airlines are limited, as mooted alternatives such as stopping or refuelling outside the EU in order to avoid the charge are likely to cost more than paying it. ", "Analysts also regard it as extremely unlikely that the cost of trading permits will diminish the number of flights into and out of Europe.", "\n\nGovernments such as the US have argued that the International Civil Aviation Organisation should be in charge of reducing emissions from international aviation. ", "ICAO has discussed ways of cutting emissions from aviation for most of the last decade. ", "It has yet to come forward with binding plans that would reduce emissions.", "\n\nIn his legal opinion, the advocate general said: \"The EU institutions could not reasonably be required to give the ICAO bodies unlimited time in which to develop a multilateral solution.\"", "\n\nAnnie Petsonk, international counsel at the US-based Environmental Defense Fund, said: \"Airlines operate in a global market, and the reality is that those markets will be increasingly carbon-constrained. ", "It's time for the US airlines to provide leadership and demonstrate that we can compete in the carbon-limited markets of the 21st century. ", "No lawsuit will stop climate change or its effects, so it's time to move forward and implement the solutions already available: Europe's aviation directive.\"", "\n\nRichard Dyer, transport campaigner at Friends of the Earth, urged governments to spend more time considering lower carbon forms of transport. ", "He said: \"The aviation industry has consistently opposed measures to protect our economy and our environment from global warming – the EU must stand firm and force the sector to play its part. ", "Governments must also take action to make alternatives to short-haul flights, such as making long-distance rail travel cheaper and easier to use.\"" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006135809235274792, 0.0060853962786495686, 0.0008193427929654717, 0.0006460256408900023, 0.0005949895712547004, 0.0005231270915828645, 0.0005302405916154385, 0.000536952808033675, 0.0005565939354710281, 0.000583319051656872, 0.0005691148107871413, 0.0007430068799294531, 0.0005715136649087071, 0.0005690489197149873, 0.000548577809240669, 0.0005614857072941959, 0.0006513011176139116, 0.0005993399536237121, 0.0007519681821577251, 0.0007216858793981373, 0.0006720113451592624, 0.0006462516030296683, 0.0006302824476733804, 0.0005693668499588966, 0.0005731736891902983, 0.000590589945204556, 0.000640939746517688, 0.0007063369266688824, 0.000550082593690604, 0.0005658589652739465, 0.0006008693017065525, 0.0005647815996780992, 0.0005633941618725657, 0.0006069407681934536, 0.0005724499933421612, 0.0006038636201992631, 0.0007025442318990827, 0.0005522504798136652 ]

[ "The isolation and extreme natural conditions inherent in Alaska provide University of Alaska Fairbanks[unreadable] (UAF) neuroscientists and their collaborators an opportunity to explore a variety of health issues affecting[unreadable] the many unique Native Alaskan and arctic populations. ", "Focused on a theme of neuroprotection and[unreadable] adaptation, the SNRP I program approached neuroscience questions from a cellular and molecular[unreadable] perspective. ", "The SNRP II proposal seeks to continue and strengthen this theme by proposing projects that[unreadable] examine neural control at the system, cellular and molecular levels. ", "This SNRP II cooperative agreement[unreadable] proposal is based on the progress achieved by UAF SNRP I over the last 4 years. ", "The successful tenure of[unreadable] 2 neuroscience faculty members and the training provided to other faculty members validates the initial[unreadable] premise that high quality basic research leads to increased opportunities for faculty and students in the[unreadable] neurosciences at UAF. ", "Our four aims provide the framework for the continued growth of the UAF SNRP[unreadable] program: (1) To initiate new research programs strengthening the theme of neuronal adaptation and control[unreadable] at the system, cellular and molecular level. (", "2) To strengthen the administrative core thereby ensuring a[unreadable] more effective research environment. (", "3) To emphasize graduate neuroscience education by[unreadable] strengthening the educational infrastructure. (", "4) To expand undergraduate opportunities for neuroscience[unreadable] research.[unreadable] A new administrative structure consisting of a Scientific Director and Associate Director is proposed to[unreadable] counsel project leaders on proposal development. ", "Outstanding senior scientists will serve as advisors on[unreadable] Program Advisory Committee (PAC) and Scientific Advisory Committee (SAC) to provide recommendations[unreadable] regarding program and research direction. ", "Major projects explore the role of serotonin in homeostasis. ", "The[unreadable] expanded research opportunities offered by SNRP II will stimulate the active participation of Alaska Native[unreadable] students in the projects and will increase the number of Alaskan Native students active in hypothesis-based[unreadable] neuroscience research." ]

{ "pile_set_name": "NIH ExPorter" }

[ 0.0007682853029109538, 0.0008490502368658781, 0.0005317305913195014, 0.0005752459983341396, 0.0005231213290244341, 0.0005407779826782644, 0.0005601856391876936, 0.0005693795974366367, 0.0005571690853685141, 0.0005257687298581004, 0.0006186450482346117, 0.0005326881073415279 ]

[ "Transition-metal- and oxidant-free three-component reaction of quinoline N-oxides, sodium metabisulfite and aryldiazonium tetrafluoroborates via a dual radical coupling process.", "\nA convenient and straightforward three-component transformation of quinoline N-oxides, sodium metabisulfite and aryldiazonium tetrafluoroborates has been developed, providing the target products in moderate to good yields. ", "Compared with previous studies, the present methodology avoids the use of transition-metal catalysts and excess oxidants, providing a simple and practical alternative approach for the construction of 2-sulfonylquinolines. ", "Control experiments indicate that a dual radical coupling process is responsible for this reaction." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0008306230884045362, 0.0006172335706651211, 0.0006467729108408093, 0.0005554391536861658 ]

[ "Q:\n\nQuerying an Active Directory object property from ASP.NET application returns old results\n\nFor quite a few days now I have been trying to get some custom Active Directory based authentication to work. ", "It all works in theory but apparently my theory is wrong. ", "Users who are logged on to a domain write a string token (e.g. PIN code) to their own property field in Active Directory (doesn't really matter which one, but I used primaryInternationISDNNumber for this) upon logging on to the ASP.NET application This PIN is always generated and written programmatically. ", "\nTo explain it roughly, the web browser loads a Java applet which then loads a native DLL written in C++, which generates and writes the PIN to current user's Active Directory field. ", "That DLL then returns the generated PIN to the applet which then passes it to the browser, which performs an AJAX call with the data returned to initiate the authentication. ", "The application, which has got access to the AD, reads this field value for the connecting user object and checks if it matches with the one the user supplied. ", "If PIN codes match, the user is successfully authenticated.", "\nThis is the sample code the ASP.NET application used to read the AD:\n using (var de = new DirectoryEntry(\"LDAP://\" + domainName))\n {\n using (var adSearch = new DirectorySearcher(de))\n {\n // Get user from active directory.", "\n adSearch.", "Filter = \"(sAMAccountName=\" + userName.", "Trim().ToLower(CultureInfo.", "CurrentCulture) + \")\";\n var adSearchResult = adSearch.", "FindOne();\n var entry = adSearchResult.", "GetDirectoryEntry();\n var pinCodeProp = entry.", "Properties[\"primaryInternationISDNNumber\"];\n return pinCodeProp !", "= null ? ", "pinCodeProp.", "Value : string.", "Empty;\n }\n }\n\nThis works fine, often. ", "But often is not acceptable. ", "It needs to always be working.", "\nThe trouble is that the ASP.NET application sometimes gets the value which was previously in that field, not the actual value. ", "As if there is some kind of caching. ", "I have tried to add de.", "UsePropertyCache = false but that yielded the same results.", "\nI have created two Win32 console applications for test purposes. ", "One writes the PIN code, the other reads the PIN code. ", "They always work fine!", "\nI thought, this gotta be some problem with IIS application pool. ", "So I have created a native DLL which gets loaded by the ASP.NET application using Platform Invoke. ", "This DLL creates a new thread, calls CoInitialize and reads the PIN code. ", "This is the code:\n pszFqdn = argv[1];\n pszUserName = argv[2];\n pszPassword = argv[3];\n\n IADs *pObject = NULL;\n HRESULT hr = S_OK;\n\n hr = CoInitialize(NULL);\n if (SUCCEEDED(hr))\n {\n hr = ADsOpenObject(pszFqdn, pszUserName, pszPassword, ADS_SECURE_AUTHENTICATION, IID_IADs, (LPVOID*)&pObject);\n\n if (SUCCEEDED(hr) && pObject)\n {\n VARIANT var;\n VariantInit(&var);\n\n hr = pObject->Get(CComBSTR(\"primaryInternationalISDNNumber\"), &var);\n if ((SUCCEEDED(hr) && var.bstrVal) || hr == 0x8000500d)\n {\n if (hr !", "= 0x8000500d)\n {\n // convert the BSTR received to TCHAR array\n std::wstring wsValue(var.bstrVal, SysStringLen(var.bstrVal));\n // copy the received value to somewhere\n // ... not relevant\n }\n\n VariantClear(&var);\n }\n\n pObject->Release();\n }\n }\n\n CoUninitialize();\n\nTo my tremendous and unpleasant surprise, this code after a day of working properly, started returning the previous values, just like the managed code before!", "\nSo now I thought, alright, I wasn't able to escape the IIS application pool and since this gotta be a problem with IIS application pool, I will create a native Windows application which I will execute by using Process.", "Start method. ", "I will return my PIN code by means of process exit code (since it's an integer anyway). ", "The application uses the similar C++ code as the DLL above. ", "\nSo I start my application, wait for it to finish, read the exit code. ", "Returns the bad value!", "\nBut okay, I'd say, the process is started using the current user credentials, which is again IIS application pool. ", "So I start the application under different credentials. ", "And guess what..... it returns the old value again (?!?!?!).", "\nAnd I thought Java was hell... Anyone has got any idea about what could possibly be going on here?", "\n\nA:\n\nIt was the replication indeed. ", "As I didn't want to force the replication before reading the field (that would have been a time-expensive operation probably anyway), I came to an idea to read this field from each domain controller and check if any of them matches with the value supplied.", "\nAs it might prove helpful to someone, I did that using the following code.", "\n var ctx = new DirectoryContext(\n DirectoryContextType.", "DirectoryServer,\n ipAddress,\n userName, // in the form DOMAIN\\UserName or else it would fail for a remote directory server\n password);\n var domain = Domain.", "GetDomain(ctx);\n var values = new List<string>();\n foreach (DomainController dc in domain.", "DomainControllers)\n {\n using (var entry =\n new DirectoryEntry(\n \"LDAP://\" + dc.", "IPAddress,\n userName,\n password))\n {\n using (var search = new DirectorySearcher(entry))\n {\n search.", "Filter = \"(&(primaryInternationalISDNNumber=*)(sAMaccountName=\" + userName + \"))\";\n var result = search.", "FindOne();\n var de = result.", "GetDirectoryEntry();\n if (de.", "Properties[\"primaryInternationalISDNNumber\"].Value !", "= null)\n {\n values.", "Add(de.", "Properties[\"primaryInternationalISDNNumber\"].Value.", "ToString());\n }\n }\n }\n }\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0006004299502819777, 0.0006702096434310079, 0.0007028569816611707, 0.0006834082305431366, 0.0008807098492980003, 0.0006194745656102896, 0.0005906721344217658, 0.0007492739823646843, 0.0016845983918756247, 0.001092178514227271, 0.0006761043914593756, 0.0007535808254033327, 0.000714821508154273, 0.0010779508156701922, 0.0007715949905104935, 0.021808335557579994, 0.0016321541042998433, 0.0008139865240082145, 0.0009050282533280551, 0.0006263848626986146, 0.0006924344343133271, 0.0013898501638323069, 0.005532989278435707, 0.0006577759049832821, 0.0010119625367224216, 0.0005935389781370759, 0.0008253679843619466, 0.0008390884031541646, 0.000656994350720197, 0.0007110372534953058, 0.0007409415557049215, 0.0015096672577783465, 0.0011999444104731083, 0.0005738917388953269, 0.0006413625669665635, 0.0005965834716334939, 0.000662239093799144, 0.0006696528871543705, 0.0021110011730343103, 0.0005799139617010951, 0.0005845348932780325, 0.0007924889214336872, 0.06636853516101837, 0.0006806143210269511, 0.0005865459679625928, 0.0005695853033103049, 0.000765462638810277, 0.0007649529143236578, 0.0010139999212697148, 0.0008397235069423914, 0.0007232956122606993, 0.0008041805704124272, 0.0008009978919290006, 0.0008422654354944825, 0.0006573275313712656, 0.0014670862583443522, 0.0007713663508184254, 0.0006092117982916534, 0.0008268648525699973 ]

[ "Dr. Marcella Bujnovsky, MD\n\nObstetrics & Gynecology |\n\nFemale |\n\nAge 47\n\n4.1 based on 9 reviewsView this provider's reviews\n\nPatient satisfaction ratings and reviews are based on personal opinions. ", "Before you choose any doctor you should take into account their background, training, specialized experience AND their patient satisfaction to ensure they are the right fit for you.", "\n\nDr. Bujnovsky's Experience\n\nDr. Bujnovsky's experience matches your search based on the following criteria:\n\nBased on total number of patients treated over the last 12 months\n\nSpecializes in Obstetrics & Gynecology\n\nBoard certified in Obstetrics & Gynecology\n\nNo malpractice claims found\n\nNo sanctions found\n\nNo board actions found\n\n1\n\nSpecialties\n\nObstetrics & Gynecology\n\n1\n\nBoard Certifications\n\nWhy it matters: Dr. Bujnovsky's Board Certifications\n\nObstetrics & Gynecology\n\nAccredited by: American Board of Obstetrics & Gynecology*\n\n* This information is proprietary data maintained in a copyrighted database compilation owned by the American Board of Medical Specialties. ", "Copyright 2017 American Board of Medical Specialties. ", "All rights reserved.", "\n\n8\n\nConditions Treated\n\nAbdominal Disorders\n\nBone Disorders\n\nBreast Diseases\n\nBreast Pain\n\nOsteopenia\n\nOvarian Cysts\n\nUterine Diseases\n\nUterine Fibroids\n\n3\n\nProcedures\n\nOsteoporosis Screening\n\nPregnancy Ultrasound\n\nThyroid Screening\n\nBackground Check\n\n0 Malpractice Claims\n\nWhat is medical malpractice?", "\n\nNo malpractice history found for Florida.", "\n\n0 Sanctions\n\nWhat is a sanction or disciplinary action?", "\n\nNo sanctions history found for the years that Healthgrades collects data.", "\n\n0 Board Actions\n\nWhat are board actions?", "\n\nNo board actions found for the years that Healthgrades collects data.", "\n\nEducation\n\nMedical College Of Pennsylvania\n\nMedical School | Graduated 1996\n\nOrlando Reg Healthcare Sys\n\nResidency Hospital | Completed\n\nAwards & Recognition\n\nWhat is a recognized doctor?", "\n\nAwards & Honors\n\nHealthgrades Honor Roll\n\nMedia & Publications\n\nDr. Bujnovsky has no media or publications listed.", "\n\nLanguages Spoken\n\nEnglish\n\nSpanish\n\nMemberships & Professional Affiliations\n\nDr. Bujnovsky does not have any memberships or affiliations listed. ", "If you are Dr. Bujnovsky and would like to add memberships or affiliations, please update your profile." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0008209652150981128, 0.0005962878349237144, 0.0006541985785588622, 0.0006852783844806254, 0.0006133938441053033, 0.011936401017010212, 0.0008347088005393744, 0.0009482327732257545, 0.0006480526062659919, 0.0009363090503029525, 0.000668749155011028, 0.0006660373765043914, 0.0006391301867552102, 0.0006390851340256631, 0.0005731116980314255 ]

[ "BANGKOK — After deploying water cannons and drones to combat unhealthy smog that shows no sign of abating, Bangkok’s governor Thursday called an emergency expert meeting to discuss solutions to the surging pollution, saying “I don’t know what to do.”", "\n\nCity Hall this morning began flying 50 drones above the capital to spray water into the air in hope of decreasing levels of harmful ultrafine particles, a method that’s been repeated despite being dismissed as scientifically ineffective. ", "After releasing the drones this morning, Gov. Aswin Kwanmuang said he had invited experts in relevant fields to a meeting today to tell him what should be done\n\n“We thought it’s a good idea. ", "That’s why we have been doing this,” he said about spraying water. “", "If we hadn’t done anything, we’d still be criticized for inaction. ", "Should I do nothing if what we’ve done here doesn’t help at all?”", "\n\nHe then called out for ideas and suggestions.", "\n\n“I’m speaking through my platform. ", "All the experts out there, please come talk to me, give me suggestions. ", "I’m the one dealing with the problem,” he said. “", "I don’t know what to do, that’s why I’ve invited them. ", "Don’t just put your suggestions out in the wind.”", "\n\nYesterday, Aswin said the drones would spray molasses into the air, an idea so harshly ridiculed that City Hall backtracked hours later.", "\n\nAll schools in Bangkok and the metropolitan area have been ordered closed through Friday due to the heavy smog, which this morning was again at the high end of levels deemed unhealthy. ", "Some universities including Thammasat, Suan Dusit Rajabhat and Silpakorn also canceled classes today and tomorrow.", "\n\nOfficials said levels of so-called PM2.5 particles in 19 locations throughout metro Bangkok this morning exceeded the acceptable density of 61 to 93 micrograms per cubic meter, with the highest density in the Rama II Road area in Samut Sakhon province and Pathum Thani’s Khlong Luang district.", "\n\nRelated stories:\n\nBangkok Schools Ordered Closed Due to Smog\n\nSome Bangkok Schools Cancel Classes Due to Pollution\n\nRail Construction Halted, Drivers Fined as Smog Persists\n\nBangkok Pollution Has Always Been Bad – So Have the Solutions: Experts" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0008515732479281723, 0.000871493190061301, 0.000560660264454782, 0.0009163005743175745, 0.0006457704585045576, 0.0016346212942153215, 0.0005868739099241793, 0.0005902058910578489, 0.0005587730556726456, 0.0008437832002528012, 0.0006922549800947309, 0.0015057615237310529, 0.010652551427483559, 0.0021047063637524843, 0.0006841165595687926, 0.0006122125778347254, 0.0010992120951414108 ]

[ "Fighting for Schumacher's life and privacy By Imogen Foulkes\n\nBBC News, Geneva Published duration 26 June 2014\n\nimage copyright Getty Images image caption The Schumacher family's spokeswoman Sabine Kehm was often besieged by reporters in Grenoble\n\nSince the day last December when he suffered serious head injuries in a skiing accident, the slightest mention of Michael Schumacher has attracted worldwide attention.", "\n\nThe former Formula 1 star, the most successful racing driver in the world, has been in hospital ever since his crash into rocks just off the marked ski slopes, but information about his actual condition has been sparse.", "\n\nWhen news of his accident first emerged, hundreds of journalists and television crews from all over the world set up outside the hospital in Grenoble, crowding his family as they tried to visit him.", "\n\nSome members of the media managed to get rooms in the same hotel as the Schumacher family; one tabloid journalist even disguised himself as a priest in an attempt to gain access to the ward in which Michael Schumacher was being treated.", "\n\nThroughout, the family has pleaded for respect and privacy, while from time to time offering small nuggets of information.", "\n\nAt the beginning, the medical team in Grenoble gave terse press conferences, announcing that Michael's condition was life threatening, then that it had stabilised.", "\n\nHe was in an induced coma, and would, it was explained, gradually be woken from it at some point.", "\n\nNever, though, did his doctors offer a prognosis of what kind of recovery Michael Schumacher was likely to make, neither did his family comment.", "\n\nimage copyright Getty Images image caption There is a great hunger for information about the former F1 champion's condition\n\nFor his millions of fans around the world, the lack of information has been disappointing. ", "They all hope that such a vigorous and relatively young man will recover, but they would also like to know more about how he really is.", "\n\nJournalists, of course, wish him well too, but they are also frustrated: every mention of Schumacher trends on Twitter, every paper with him on the front page will increase its circulation, every news website featuring anything at all about him can guarantee thousands of hits.", "\n\nThe pressure to find something to say about him is huge.", "\n\nAnd then, although no one likes to talk about it, there are Michael Schumacher's many sponsors, from Mercedes to mineral water, who simply do not know whether their star ambassador will ever be able to represent them again.", "\n\nFilling the information hole\n\nNature abhors a vacuum, and, in the absence of any real information, speculation and rumour have been rife. ", "Many newspapers have turned to brain injury specialists, some very reputable, some rather less so, to interpret, from a distance, Michael Schumacher's situation.", "\n\nNone of them has treated him, nevertheless many suggest they know how he is, but their diagnoses differ widely. ", "Some forecast a good recovery, some a partial one, some no recovery at all.", "\n\nThe official news in April, after months of silence, that Michael Schumacher was showing some small signs of consciousness, simply fuelled the frenzy of speculation, which renewed pleas from his family and his agent could not stop.", "\n\nimage copyright AP image caption Media crews converged on the Swiss hospital soon after Schumacher's transfer there\n\nimage copyright Getty Images image caption The Schumachers live a few kilometres from Lausanne hospital\n\nIt is not surprising then, that the decision to move him from Grenoble to the University of Lausanne hospital in Switzerland was shrouded in secrecy, and planned, it seems, with all the careful precision of a battle.", "\n\nHis family clearly want him closer to home: the Schumachers live on the shores of lake Geneva, just a few kilometres from Lausanne hospital. ", "They will be able to visit him more easily, and the hospital has a renowned neurological unit, where, it was announced, Michael would continue \"his long phase of rehabilitation\".", "\n\nThe short statement telling the world that Michael Schumacher had changed hospitals also included the words \"he is not in a coma anymore\", adding that no further updates on his condition or his progress could be expected.", "\n\nThe Schumacher family clearly hoped to draw a line under the media interest, and finally get the privacy they have been requesting for six months.", "\n\nA vain hope; within hours of the transfer being announced the television trucks were set up outside Lausanne hospital, scores of journalists stood outside, speculating endlessly.", "\n\nMoney for information\n\nBehind the scenes, more unscrupulous methods of getting information seem to be operating. ", "Just two days after his transfer, a Swiss newspaper published a suspiciously detailed account of how Michael Schumacher had made the journey from France to Switzerland.", "\n\nNot by helicopter, as one might have expected, but by an ambulance from the remote alpine community of Visp. ", "Its crew were apparently asked to surrender their mobile phones before taking him on board, in order to prevent any pictures being taken.", "\n\nBut despite the precautions, \"information\" has seeped out: Michael's eyes were open for most of the journey, he seemed to respond to his wife.", "\n\nNo one knows who the source of these \"facts\" is, nevertheless they have been pounced on in yet more attempts to provide a spurious clarity about his condition.", "\n\nAnd then, this week, perhaps the lowest blow of all: medical records from Grenoble hospital in France have been stolen. ", "It is believed they are Michael Schumacher's, and that they consist of the first few pages of a much longer file, written by the doctors in Grenoble, and intended for the new medical team caring for him in Lausanne.", "\n\nThey are being offered for sale to media across Europe: for 50,000 euros (£40,000, $68,000) the details can be bought. ", "And despite threats of legal action from the Schumacher family, despite a police investigation in Grenoble, even if no established media ever publish it, it is probably only a matter of time before the information emerges.", "\n\nMedical records are supposed to be confidential, shared only between patient and doctor.", "\n\nBut not, it seems, if you are famous, not if your name is Michael Schumacher, and not in the 21st century digital age, where the perceived \"right to information\" seems to defeat every other consideration.", "\n\nMichael Schumacher\n\nimage copyright AP\n\nBorn: 3 January 1969\n\nFirst GP win: Belgium 1992\n\nLast GP win: China 2006\n\nRaces started: 303\n\nWins: 91 (155 podium finishes)\n\nChampionships: 7 (1994, 1995, 2000, 2001, 2002, 2003, 2004" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0007064106175675988, 0.0008277994347736239, 0.0006408520857803524, 0.0007280833669938147, 0.008035307750105858, 0.0007234704098664224, 0.0014541681157425046, 0.0007435795851051807, 0.0006298642256297171, 0.0005469402531161904, 0.0012790716718882322, 0.0014696703292429447, 0.0005588363856077194, 0.0011005590204149485, 0.0009083148906938732, 0.0008451688336208463, 0.0005840506637468934, 0.0006078745936974883, 0.0006236180197447538, 0.0007070537540130317, 0.0005546706961467862, 0.0006227689445950091, 0.0005430580349639058, 0.0006039697909727693, 0.0006924232002347708, 0.0005574521492235363, 0.0006177703035064042, 0.0007046245154924691, 0.0005828972207382321, 0.0006051608361303806, 0.03104547969996929, 0.0006386689492501318, 0.0005220038583502173, 0.0006476559210568666, 0.0005742516950704157, 0.0007462945650331676, 0.0006563490605913103 ]

[ "Q:\n\nThree-machine proportionate flow shop problem with unequal machine\n\nAs part of an academic project I wrote a code about dynamic programming that solves the \"Three-machine proportionate flow shop problem with unequal machine\".", "\n\nIn flow shop scheduling it is usually assumed that the processing\ntimes of the operations belonging to the same job are unrelated. ", "But\nwhen a job corresponds to producing a certain quantity of some good,\nthen it is likely that the processing times are related to this\nquantity, and hence are constant except for some factor that depends\non the speed of the machine. ", "In this paper, we consider this special\ncase of the flow shop problem, which we call the proportionate flow\nshop problem with unequal machine speeds. ", "This is a special case of\nthe flow shop problem with ordered processing times that has been\nstudied by Smith, Panwalkar, and Dudek. ", "Their results imply that\nmakespan minimization is easy if the first or last machine is slowest;\nif the second machine is slowest, then there exists an optimum\nschedule that is V-shaped. ", "We provide an algorithm that solves this\nproblem (and the more general problem with ordered processing times)\nto optimality in pseudopolynomial time, and we show that this is best\npossible by establishing NP-hardness in the ordinary sense.", "\nACM Digital Library\n\nMy major problem is that the code takes a lot of time to calculate big values (bigger than 10).", "\n\nWhat is the code efficiency?", "\nHow can I calculate it by myself?", "\nHow can I make this code specifically efficient?", "\n\nusing System;\nusing System.", "IO;\nusing System.", "Collections.", "Generic;\nusing System.", "Linq;\nusing System.", "Text;\nusing System.", "Data;\nusing Microsoft.", "Office.", "Core;\nusing Excel = Microsoft.", "Office.", "Interop.", "Excel;\nusing System.", "Windows.", "Forms;\n\nnamespace PF_with_one_deferent_machine\n{\n class Program\n {\n static void Main(string[] args)\n {\n double[] jobs=new double[0];\n double[] mashines_rates = new double[0];\n int num_of_jobs=0;\n double[][] examples;\n double[][] p;\n double[] sorted; \n //getting input from user\n //jobs = new double[3] { 2, 4, 7 };\n //mashines_rates = new double[4] { 1, 1, 0.5, 1 };\n\n Console.", "WriteLine(\"0 - auto 1 - manual\");\n Console.", "Write(\"Auto or manual input? \");", "\n Boolean manual=(Convert.", "ToInt32(Console.", "ReadLine())==1);\n if (manual)\n {\n #region Input manual\n Console.", "Write(\"How many jobs you have? \");", "\n num_of_jobs = Convert.", "ToInt32(Console.", "ReadLine());\n jobs = new double[num_of_jobs];\n for (int size = 1; size <= num_of_jobs; size++)\n {\n Console.", "Write(\"The process time of job number \" + size+\": \");\n jobs[size-1] = Convert.", "ToDouble(Console.", "ReadLine());\n }\n Console.", "WriteLine();\n Console.", "Write(\"How many machines you have? \");", "\n int num_of_machines = Convert.", "ToInt32(Console.", "ReadLine());\n mashines_rates = new double[num_of_machines];\n for (int size = 1; size <= num_of_machines; size++)\n {\n Console.", "Write(\"The rate time of the machine number \" + size + \": \");\n mashines_rates[size - 1] = Convert.", "ToDouble(Console.", "ReadLine());\n }\n #endregion\n manualRun(jobs, mashines_rates);\n\n sorted = jobs;\n MergeSort_Recursive(sorted, 0, jobs.", "Length - 1); //sort array from small to big\n Array.", "Reverse(sorted); //reverse array (from big to small in this case)\n p = MakeP(sorted, mashines_rates);\n DynamicProgramming(p);\n Console.", "ReadKey();\n }else{\n #region Auto input \n Console.", "Write(\"How many examples do you want to run? \");", "\n int num_of_ex= Convert.", "ToInt32(Console.", "ReadLine());\n Console.", "Write(\"How many jobs you have? \");", "\n num_of_jobs = Convert.", "ToInt32(Console.", "ReadLine());\n Console.", "Write(\"What is maximum job value? \");", "\n int maximum = Convert.", "ToInt32(Console.", "ReadLine());\n Console.", "Write(\"How many machines you have? \");", "\n int num_of_machines = Convert.", "ToInt32(Console.", "ReadLine());\n mashines_rates = new double[num_of_machines];\n for (int size = 1; size <= num_of_machines; size++)\n {\n Console.", "Write(\"The rate time of the machine number \" + size + \": \");\n mashines_rates[size - 1] = Convert.", "ToDouble(Console.", "ReadLine());\n }\n examples = new double[num_of_ex][];\n Random random = new Random();\n //int maximum = 10;\n int minimum = 1;\n\n for (int i = 0; i < num_of_ex; i++)\n {\n examples[i] = new double[num_of_jobs];\n for (int j = 0; j < num_of_jobs; j++)\n {\n //examples[i][j] = random.", "NextDouble() * (maximum - minimum) + minimum;\n examples[i][j] = random.", "Next(minimum,maximum);\n }\n }\n #endregion \n CreateOutputFile(autoRun(examples, mashines_rates));\n }\n }\n\n private static void DynamicProgramming(double[][] p)\n {\n\n int j = p[0].Length-1;\n int num_t1_options=Convert.", "ToInt32(p[1][1]-p[1][j]+1);\n int num_t2_options=Convert.", "ToInt32(p[3][1]-p[3][j]+1);\n\n double[][] f=new double [num_t1_options][];\n for (int i=0; i<num_t1_options; i++)\n f[i]=new double [num_t2_options];\n\n double dinamicMakeSpan;\n double t1 = p[1][1];\n double t2 = p[3][1];\n //DP(<current job #>,<t1>,<t2>,<ref to matrix P>)\n for (t1 = p[1][j]; t1 <= p[1][1]; t1++)\n for (t2 = p[3][j]; t2 <= p[3][1]; t2++)\n f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])] = DP(j, t1, t2, ref p);\n\n double[] minArray = new double[num_t1_options];\n for (int i = 0; i < num_t1_options; i++)\n minArray[i] = f[i].Min();\n dinamicMakeSpan = minArray.", "Min();\n\n //Print all answers\n /*\n int rowCount = num_t1_options;\n int colCount = num_t2_options;\n for (int row = 0; row < rowCount; row++)\n {\n Console.", "Write(\"MakeSpan: [\");\n for (int col = 0; col < colCount - 1; col++)\n Console.", "Write(String.", "Format(\"{0}, \", f[row][col]));\n Console.", "WriteLine(String.", "Format(\"{0}]\", f[row][colCount - 1]));\n }\n */\n\n Console.", "WriteLine(String.", "Format(\"Dynamic MakeSpan: {0}\", dinamicMakeSpan));\n }\n\n private static double DP(int j, double t1, double t2, ref double[][] p)\n {\n if (j==1) //stop condition\n {\n if (t1 == p[1][1] && t2 == p[3][1])\n return p[1][1] + p[2][1] + p[3][1];\n\n return 9999999999;\n }\n\n int num_t1_options = Convert.", "ToInt32(p[1][1] - p[1][j] + 1);\n int num_t2_options = Convert.", "ToInt32(p[3][1] - p[3][j] + 1);\n double[][] f = new double[num_t1_options][];\n for (int i = 0; i < num_t1_options; i++)\n f[i] = new double[num_t2_options];\n\n for (t1=p[1][j]; t1<=p[1][1]; t1++)\n for (t2=p[3][j]; t2<=p[3][1]; t2++)\n {\n\n if (t1>p[1][j] && t2>p[3][j]) //case 1\n f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])]= Math.", "Min( p[1][j]+DP(j-1,t1+p[2][j]-p[1][j], t2,ref p), p[3][j]+DP(j-1,t1, t2+p[2][j]-p[3][j],ref p));\n\n double [] left; double [] right;\n double min_job=p[1][p[0].Length-1];\n int i,size;\n\n if (t1==p[1][j] && t2>p[3][j]){ //case 2\n\n size =Convert.", "ToInt32(p[2][j]-min_job +1);\n left = new double[size];\n for (double t=min_job; t<=p[2][j]; t++){\n i = Convert.", "ToInt32(t-min_job);\n left[i]=p[1][j]+p[2][j]-t+DP(j-1,t,t2,ref p);\n }\n f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])]= Math.", "Min(left.", "Min(), p[3][j]+DP(j-1, p[1][j], t2+p[2][j]-p[3][j], ref p));\n }//case 2\n\n if (t1>p[1][j] && t2==p[3][j]){ //case 3\n min_job=p[3][p[0].Length-1];\n size =Convert.", "ToInt32(p[2][j]-min_job +1);\n right = new double[size];\n for (double t=min_job; t<=p[2][j]; t++){\n i = Convert.", "ToInt32(t-min_job);\n right[i]=p[3][j]+p[2][j]-t+DP(j-1,t1,t,ref p);\n }\n f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])]= Math.", "Min(right.", "Min(), p[1][j]+DP(j-1, t1+p[2][j]-p[1][j], t2, ref p));\n }//case 3\n\n if (t1==p[1][j] && t2==p[3][j]){ //case 4\n min_job=p[1][p[0].Length-1];\n size =Convert.", "ToInt32(p[2][j]-min_job +1);\n left = new double[size];\n for (double t=min_job; t<=p[2][j]; t++){\n i = Convert.", "ToInt32(t-min_job);\n left[i]=p[1][j]+p[2][j]-t+DP(j-1,t,p[3][j],ref p);\n }\n\n min_job=p[3][p[0].Length-1];\n size =Convert.", "ToInt32(p[2][j]-min_job +1);\n right = new double[size];\n for (double t=min_job; t<=p[2][j]; t++){\n i = Convert.", "ToInt32(t-min_job);\n right[i]=p[3][j]+p[2][j]-t+DP(j-1,p[1][j],t,ref p);\n }\n\n f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])]= Math.", "Min(right.", "Min(), left.", "Min()); \n }//case 4\n }// end for for\n double[] minArray = new double[num_t1_options];\n for (int i = 0; i < num_t1_options; i++)\n minArray[i] = f[i].Min();\n double dinamicMakeSpan = minArray.", "Min();\n return dinamicMakeSpan;\n }//end DP\n\n private static double[][] MakeP(double[] jobs, double[] mashines_rates) //return matrix with indexes starts from 1 and not from 0 \n {\n double[][] p;\n p = new double[mashines_rates.", "Length+1][];\n for (int i = 0; i <= mashines_rates.", "Length; i++)\n p[i] = new double[jobs.", "Length+1];\n\n for (int i = 0; i < mashines_rates.", "Length; i++)\n for (int j = 0; j < jobs.", "Length; j++)\n p[i+1][j+1] = jobs[j] / mashines_rates[i];\n return p;\n }\n\n private static void manualRun(double[] jobs, double[] mashines_rates)\n {\n int num_of_vars = Factorial(jobs.", "Length);\n int num_of_jobs = jobs.", "Length;\n double[] heuristics = jobs;\n double[] heuristics_left;\n double[] heuristics_right;\n MergeSort_Recursive(heuristics, 0, jobs.", "Length - 1);\n Array.", "Reverse(heuristics);\n heuristics_left = schedule_left(heuristics);\n heuristics_right = schedule_right(heuristics);\n double makeSpan_left = find_MakeSpan(heuristics_left, mashines_rates);\n double makeSpan_right = find_MakeSpan(heuristics_right, mashines_rates);\n double makeSpan_heuristics;\n if (makeSpan_left < makeSpan_right)\n {\n makeSpan_heuristics = makeSpan_left;\n heuristics = heuristics_left;\n }\n else\n {\n makeSpan_heuristics = makeSpan_right;\n heuristics = heuristics_right;\n }\n\n double[][] jobs_var = make_job_variables(jobs);\n\n for (int i = 0; i < num_of_vars; i++)\n {\n jobs_var[i][num_of_jobs] = find_MakeSpan(jobs_var[i], mashines_rates);\n }\n sort__array_by_makeSpan<double>(jobs_var, num_of_jobs);\n\n double lowerBound = calcLowerBound(jobs, mashines_rates);\n double OG = jobs_var[0][num_of_jobs] / lowerBound;\n double HO = makeSpan_heuristics / jobs_var[0][num_of_jobs];\n double HLB = makeSpan_heuristics / lowerBound;\n\n PrintAnswer(jobs_var);\n\n Console.", "WriteLine(String.", "Format(\"Lower Bound: {0}\", lowerBound));\n Console.", "WriteLine(String.", "Format(\"OG: {0}\", OG));\n Console.", "WriteLine(String.", "Format(\"HO: {0}\", HO));\n Console.", "WriteLine(String.", "Format(\"HLB: {0}\", HLB));\n\n /*\n Console.", "WriteLine(String.", "Format(\"makeSpan_heuristics: {0}\", makeSpan_heuristics));\n Console.", "WriteLine(String.", "Format(\"jobs_var[0][num_of_jobs]: {0}\", jobs_var[0][num_of_jobs]));\n Console.", "WriteLine(String.", "Format(\"makeSpan_left: {0}\", makeSpan_left));\n Console.", "WriteLine(String.", "Format(\"makeSpan_right: {0}\", makeSpan_right));\n */\n int colCount = heuristics.", "Length;\n Console.", "Write(String.", "Format(\"makeSpan_heuristics: {0}, flow: [\", makeSpan_heuristics));\n for (int col = 0; col < colCount-1 ; col++)\n Console.", "Write(String.", "Format(\"{0}, \", heuristics[col]));\n\n Console.", "WriteLine(String.", "Format(\"{0}]\", heuristics[colCount - 1]));\n\n }\n\n private static double [][] autoRun(double[][] examples, double[] mashines_rates)\n {\n int num_of_jobs = examples[0].Length;\n int num_of_machines = mashines_rates.", "Length;\n int num_of_vars = Factorial(num_of_jobs);\n double[] jobs;\n double[] heuristics;\n double[] heuristics_left;\n double[] heuristics_right;\n double makeSpan_left;\n double makeSpan_right;\n double makeSpan_heuristics;\n double makeSpan_optimum;\n double[][] jobs_var;\n double lowerBound;\n double OG;\n double HO;\n double HLB;\n double[][] answer_array = new double[examples.", "Length][];\n for (int i = 0; i < examples.", "Length; i++)\n {\n answer_array[i] = new double[6 + num_of_jobs*2];\n }\n\n for (int i = 0; i < examples.", "Length; i++)\n {\n jobs = new double[num_of_jobs];\n for (int job = 0; job < num_of_jobs; job++)\n {\n jobs[job] = examples[i][job];\n }\n\n #region Make heuristic answer\n heuristics = jobs;\n MergeSort_Recursive(heuristics, 0, jobs.", "Length - 1);\n Array.", "Reverse(heuristics);\n heuristics_left = schedule_left(heuristics);\n heuristics_right = schedule_right(heuristics);\n makeSpan_left = find_MakeSpan(heuristics_left, mashines_rates);\n makeSpan_right = find_MakeSpan(heuristics_right, mashines_rates);\n if (makeSpan_left < makeSpan_right)\n {\n makeSpan_heuristics = makeSpan_left;\n heuristics = heuristics_left;\n }\n else\n {\n makeSpan_heuristics = makeSpan_right;\n heuristics = heuristics_right;\n }\n #endregion\n\n #region Make optimum answer\n jobs_var = make_job_variables(jobs);\n for (int k = 0; k < num_of_vars; k++)\n {\n jobs_var[k][num_of_jobs] = find_MakeSpan(jobs_var[k], mashines_rates);\n }\n sort__array_by_makeSpan<double>(jobs_var, num_of_jobs);\n #endregion\n\n lowerBound = calcLowerBound(jobs, mashines_rates);\n makeSpan_optimum=jobs_var[0][num_of_jobs];\n OG = makeSpan_optimum/ lowerBound;\n HO = makeSpan_heuristics / makeSpan_optimum;\n HLB = makeSpan_heuristics / lowerBound;\n\n answer_array[i][0] = makeSpan_optimum;\n answer_array[i][1] = makeSpan_heuristics;\n answer_array[i][2] = lowerBound;\n answer_array[i][3] = OG;\n answer_array[i][4] = HO;\n answer_array[i][5] = HLB;\n for (int p = 0; p < num_of_jobs; p++)\n {\n answer_array[i][p + 6] = jobs_var[0][p];\n }\n for (int p = 0; p < num_of_jobs; p++)\n {\n answer_array[i][p + 6 + num_of_jobs] = heuristics[p];\n }\n\n //SaveExample(heuristics, makeSpan_heuristics, jobs, lowerBound);\n\n /*\n if (OG < 1) //if Lower Bound is fail\n {\n Console.", "WriteLine(\"LowerBound is fail!\");", "\n Console.", "WriteLine(String.", "Format(\"Optimum: {0}\", jobs_var[0][num_of_jobs]));\n Console.", "WriteLine(String.", "Format(\"lowerBound: {0}\", lowerBound));\n\n int colCount = jobs_var[0].Length - 1;\n Console.", "Write(String.", "Format(\"MakeSpan: {0}, flow: [\", jobs_var[0][colCount]));\n for (int col = 0; col < colCount - 1; col++)\n Console.", "Write(String.", "Format(\"{0}, \", jobs_var[0][col]));\n\n Console.", "WriteLine(String.", "Format(\"{0}]\", jobs_var[0][colCount - 1]));\n Console.", "ReadKey();\n } */\n }\n return answer_array;\n }\n\n private static double[] schedule_right(double[] heuristics)\n {\n double[] scheduled = new double[heuristics.", "Length];\n if (heuristics.", "Length % 2 == 0)\n {\n int place = heuristics.", "Length / 2 ;\n scheduled[place] = heuristics[0];\n int counter = 1;\n int job_counter = 1;\n for (int i = 1; i < heuristics.", "Length; i++)\n {\n scheduled[place - counter] = heuristics[i];\n job_counter++;\n if (job_counter < heuristics.", "Length)\n {\n scheduled[place + counter] = heuristics[i + 1];\n job_counter++;\n i++;\n }\n counter++;\n }\n }\n else\n {\n int counter = 1;\n int place = heuristics.", "Length / 2;\n scheduled[place] = heuristics[0];\n for (int i = 1; i < heuristics.", "Length; i++)\n {\n scheduled[place + counter] = heuristics[i];\n i++;\n scheduled[place - counter] = heuristics[i];\n counter++;\n }\n }\n return scheduled;\n }\n\n private static double calcLowerBound(double[] jobs, double[] mashines_rates)\n {\n double[] averages = new double[jobs.", "Length];\n for (int i = 0; i < jobs.", "Length; i++)\n {\n averages[i] = 0;\n for (int j = 0; j < mashines_rates.", "Length; j++)\n {\n averages[i] += jobs[i] / mashines_rates[j];\n }\n averages[i] = averages[i] / mashines_rates.", "Length;\n }\n //double answer = averages.", "Sum() + averages.", "Max() * (mashines_rates.", "Length - 1);\n double average = averages.", "Sum() / averages.", "Length;\n double lowerBound = average * averages.", "Length + average * (mashines_rates.", "Length - 1);\n //Console.", "Write(String.", "Format(\"Lower Bound: {0}\", lowerBound));\n return lowerBound;\n\n }\n\n private static void sort__array_by_makeSpan<T>(T[][] jobs_var, int col) \n {\n Comparer<T> comparer = Comparer<T>.Default;\n Array.", "Sort<T[]>(jobs_var, (x, y) => comparer.", "Compare(x[col], y[col])); \n }\n\n private static void PrintAnswer(double[][] jobs_var)\n {\n Console.", "WriteLine();\n Console.", "WriteLine();\n Console.", "WriteLine();\n int rowCount = Math.", "Min(40,jobs_var.", "Length);\n int colCount = jobs_var[0].Length-1;\n for (int row = 0; row < rowCount; row++)\n {\n Console.", "Write(String.", "Format(\"MakeSpan: {0}, flow: [\", jobs_var[row][colCount]));\n for (int col = 0; col < colCount-1; col++)\n Console.", "Write(String.", "Format(\"{0}, \", jobs_var[row][col]));\n\n Console.", "WriteLine(String.", "Format(\"{0}]\", jobs_var[row][colCount-1]));\n }\n }\n\n private static void PrintHeuristicAnswer(double[] jobs_var)\n {\n Console.", "WriteLine();\n Console.", "WriteLine();\n Console.", "WriteLine();\n\n int colCount = jobs_var.", "Length - 1;\n Console.", "Write(String.", "Format(\"MakeSpan: {0}, flow: [\", jobs_var[colCount]));\n for (int col = 0; col < colCount - 1; col++)\n Console.", "Write(String.", "Format(\"{0}, \", jobs_var[col]));\n Console.", "WriteLine(String.", "Format(\"{0}]\", jobs_var[colCount - 1]));\n }\n\n private static double find_MakeSpan(double[] jobs_array, double[] mashines_rates)\n {\n int num_of_jobs = jobs_array.", "Length;\n int num_of_machines = mashines_rates.", "Length;\n double[] flows = new double[num_of_machines];\n double makespan;\n for (int i = 0; i < num_of_machines; i++)\n {\n flows[i] = 0;\n }\n for (int i = 0; i < num_of_jobs; i++)\n {\n flows[0] += jobs_array[i] / mashines_rates[0];\n for (int j = 1; j < num_of_machines; j++)\n {\n flows[j] = Math.", "Max(flows[j - 1], flows[j]) + jobs_array[i] / mashines_rates[j];\n }\n }\n makespan = flows[num_of_machines - 1];\n return makespan;\n }\n\n private static int Factorial(int i)\n {\n if (i <= 1)\n return 1;\n return i * Factorial(i - 1); \n }\n\n private static double[][] make_job_variables(double[] jobs)\n {\n double[][] jobs_vars;\n int num_of_vars=Factorial(jobs.", "Length);\n jobs_vars = new double[num_of_vars][];\n for (int i=0; i<num_of_vars; i++){\n jobs_vars[i] = new double[jobs.", "Length + 1];\n jobs_vars[i][jobs.", "Length] = 0;\n }\n int count = 0;\n foreach (double[] permutation in Permutations<double>.AllFor(jobs))\n {\n for (int i = 0; i < jobs.", "Length; i++)\n {\n jobs_vars[count][i] = permutation[i];\n }\n count++;\n }\n return jobs_vars;\n }\n\n static public void DoMerge(double[] numbers, int left, int mid, int right)\n {\n double[] temp = new double[25];\n int i, left_end, num_elements, tmp_pos;\n left_end = (mid - 1);\n tmp_pos = left;\n num_elements = (right - left + 1);\n while ((left <= left_end) && (mid <= right))\n {\n if (numbers[left] <= numbers[mid])\n temp[tmp_pos++] = numbers[left++];\n else\n temp[tmp_pos++] = numbers[mid++];\n }\n while (left <= left_end)\n temp[tmp_pos++] = numbers[left++];\n while (mid <= right)\n temp[tmp_pos++] = numbers[mid++];\n for (i = 0; i < num_elements; i++)\n {\n numbers[right] = temp[right];\n right--;\n }\n }\n\n static public void MergeSort_Recursive(double[] numbers, int left, int right)\n {\n\n int mid;\n if (right > left)\n {\n mid = (right + left) / 2;\n MergeSort_Recursive(numbers, left, mid);\n MergeSort_Recursive(numbers, (mid + 1), right);\n DoMerge(numbers, left, (mid + 1), right);\n }\n }\n }\n\n public class Permutations<T>\n {\n public static System.", "Collections.", "Generic.", "IEnumerable<T[]> AllFor(T[] array)\n {\n if (array == null || array.", "Length == 0)\n {\n yield return new T[0];\n }\n else\n {\n for (int pick = 0; pick < array.", "Length; ++pick)\n {\n T item = array[pick];\n int i = -1;\n T[] rest = System.", "Array.", "FindAll<T>(\n array, delegate(T p) { return ++i !", "= pick; }\n );\n foreach (T[] restPermuted in AllFor(rest))\n {\n i = -1;\n yield return System.", "Array.", "ConvertAll<T, T>(\n array,\n delegate(T p)\n {\n return ++i == 0 ? ", "item : restPermuted[i - 1];\n }\n );\n }\n }\n }\n }\n }\n\nA:\n\nMissing methods \nThe posted code is missing the schedule_left() and CreateOutputFile() method. ", " \nStyle \n\nyou should always be consistent in the style you use. ", "Switching from not using braces {} to using them for single for loops should be avoided. ", "The same is true for single if statements. ", " \ndead code should be deleted \nif you decide to not using braces for single if statements you should indent your code. ", "See \n\nprivate static int Factorial(int i)\n{\n if (i <= 1)\n return 1;\n return i * Factorial(i - 1); \n}\n\nusing region's is discussed controversially, but using region's inside a method is a sign that this \"region\" should be extracted to its own method. ", " \n\nNaming \nReading and understanding is all about words we use e.g to explain a question and its solution. ", "These words needs to be meaningful to the reader as well as to the author.", "\nShortening these names to e.g p doesn't add readability but removes it. ", " \nBased on the naming guidelines methods should be named using PascalCase casing and should be made out of verbs or verb phrases. ", "Fields or variable should be named using camelCase casing. ", "snake_Case casing isn't used in C#. ", " \nGeneral \n\nyou shouldn't add references you don't use. -", "> using Excel = Microsoft.", "Office.", "Interop.", "Excel; \nyou have many magic numbers in your code. ", "You should consider to extract them into meaningful constants. ", " \nif you read input from the user, you need to add some sort of validation. ", "Instead of blindly calling Convert.", "ToInt32(Console.", "ReadLine()) you should use Int32.TryParse(). ", " \nyou should extract the reading of the users input to a separate method like for Int32 \nprivate static Int32 ReadInt32(String message, String errorMessage)\n{\n Console.", "WriteLine(message);\n Int32 input;\n while (!", "Int32.TryParse(Console.", "ReadLine(), out input))\n {\n Console.", "WriteLine(errorMessage);\n }\n return input;\n} \n\nwhich you then call like \nint num_of_ex = ReadInt32(\"How many examples do you want to run? \", \"", "You need to input a valid number, please try again.\"); ", " \n\nstarting a for loop by 1 for filling an array is strange. ", " \nfor (int size = 1; size <= num_of_jobs; size++)\n{\n Console.", "Write(\"The process time of job number \" + size+\": \");\n jobs[size-1] = Convert.", "ToDouble(Console.", "ReadLine());\n} \n\nit would be better by renaming the iteration variable and also by calling a ReadDouble() method like \nfor (int jobIndex = 0; jobIndex < num_of_jobs; jobIndex++)\n{\n jobs[jobIndex] = ReadDouble(String.", "Format(\"The process time of job number {0}: \", jobIndex + 1), \"You need to input a valid number, please try again.\");", "\n} \n\nDynamicProgramming() \n\nthis method is badly named because it isn't clear by this name what the method should do. ", " \nthe code of creating the jagged array f is the same as in the DP() method, so this should be extracted to a separate method to remove code duplication. ", " \nprivate static double[][] GetJaggedArray(int firstDimensionLength, int secondDimensionLength)\n{\n double[][] jaggedArray = new double[firstDimensionLength][];\n for (int i = 0; i < firstDimensionLength; i++)\n {\n jaggedArray[i] = new double[secondDimensionLength];\n }\n return jaggedArray;\n} \n\nthe declaration of the loop variables t1 and t2 should be done in the loop itself. ", " \nthe repeated use of p[1][j] and p[3][j] where j == p[0].Length - 1 asks for separate variables. ", " \nto get the upper bound of an array we can use the GetUpperBound() method.", "\nif we use Math.", "Min() we can omit the minArray and because this is used in DP() also, we extract it to its own method \nprivate static double GetMinimum(double[][] array)\n{\n double minimum = double.", "MaxValue;\n for (int i = 0; i < array.", "GetUpperBound(0); i++)\n {\n minimum = Math.", "Min(minimum, array[i].Min());\n }\n return minimum;\n}\n\nthere is no need to call for each iteration of the inner loop Convert.", "ToInt32(t1 - p[1][j]) because this won't change. ", "So better extract it to a variable which is set in the outer loop. ", " \n\nImplemented all above will lead to \nprivate static void DynamicProgramming(double[][] p)\n{\n\n int last = p[0].GetUpperBound(0);\n\n double pOneLast = p[1][last];\n double pThreeLast = p[3][last];\n\n int num_t1_options = Convert.", "ToInt32(p[1][1] - pOneLast + 1);\n int num_t2_options = Convert.", "ToInt32(p[3][1] - pThreeLast + 1);\n\n double[][] f = GetJaggedArray(num_t1_options, num_t2_options);\n\n for (double t1 = pOneLast; t1 <= p[1][1]; t1++)\n {\n int firstIndex = Convert.", "ToInt32(t1 - pOneLast);\n for (double t2 = pThreeLast; t2 <= p[3][1]; t2++)\n {\n f[firstIndex][Convert.", "ToInt32(t2 - pThreeLast)] = DP(last, t1, t2, ref p);\n }\n }\n\n Console.", "WriteLine(String.", "Format(\"Dynamic MakeSpan: {0}\", GetMinimum(f)));\n}\n\nDP() \n\nthe ref keyword is not necessary.", "\nmultiple declarations in one line should be avoided \nalso there is no rule for where to place the opening bracket { most place it on the new line. ", "If you choose one style you should be consistent. ", " \nbecause the element of f which is set is always the \"same\" f[Convert.", "ToInt32(t1 - p[1][j])][Convert.", "ToInt32(t2 - p[3][j])] we can extract these indices to separate variables to make the code more readable \ndouble pOneLast = p[1][j];\ndouble pThreeLast = p[3][j];\n\nint firstIndex = Convert.", "ToInt32(t1 - pOneLast);\nint secondIndex = Convert.", "ToInt32(t2 - pThreeLast);\n\nif we now take a look at the case 1's condition if (t1 > p[1][j] && t2 > p[3][j]) which is now if (t1 > pOneLast && t2 > pThreeLast) we can change it to if (firstIndex > 0 && secondIndex > 0). ", "This can be done for the other cases too. ", " \nIf we extract the processing of the different cases to separate methods like \nprivate static double ProcessBothNonZero(int j, double t1, double t2, double[][] p)\n{\n double pOneLast = p[1][j];\n double pThreeLast = p[3][j];\n\n double firstDP = DP(j - 1, t1 + p[2][j] - pOneLast, t2, ref p);\n double secondDP = DP(j - 1, t1, t2 + p[2][j] - pThreeLast, ref p);\n\n return Math.", "Min(pOneLast + firstDP, pThreeLast + secondDP);\n}\n\nprivate static double ProcessFirstIsZero(int j, double t1, double t2, double[][] p)\n{\n double pOneLast = p[1][j];\n double pTwoLast = p[2][j];\n double pThreeLast = p[3][j];\n\n double min_job = p[1][p[0].Length - 1];\n double result = double.", "MaxValue;\n\n for (double t = min_job; t <= pTwoLast; t++)\n {\n double firstDP = DP(j - 1, t, t2, ref p);\n result = Math.", "Min(result, pOneLast + pTwoLast - t + firstDP);\n }\n\n double secondDP = DP(j - 1, pOneLast, t2 + pTwoLast - pThreeLast, ref p);\n\n return Math.", "Min(result, pThreeLast + secondDP);\n}\nprivate static double ProcessSecondIsZero(int j, double t1, double t2, double[][] p)\n{\n double pOneLast = p[1][j];\n double pTwoLast = p[2][j];\n double pThreeLast = p[3][j];\n double result = double.", "MaxValue;\n double min_job = p[3][p[0].Length - 1];\n\n for (double t = min_job; t <= pTwoLast; t++)\n {\n double firstDP = DP(j - 1, t1, t, ref p);\n result = Math.", "Min(result, pThreeLast + pTwoLast - t + firstDP);\n }\n double secondDP = DP(j - 1, t1 + pTwoLast - pOneLast, t2, ref p);\n return Math.", "Min(result, pOneLast + secondDP);\n\n}\nprivate static double ProcessBothAreZero(int j, double t1, double t2, double[][] p)\n{\n double pOneLast = p[1][j];\n double pTwoLast = p[2][j];\n double pThreeLast = p[3][j];\n double min_job = p[1][p[0].Length - 1];\n double result = double.", "MaxValue;\n\n for (double t = min_job; t <= pTwoLast; t++)\n {\n double firstDP = DP(j - 1, t, pThreeLast, ref p);\n result = Math.", "Min(result, pOneLast + pTwoLast - t + firstDP);\n }\n\n min_job = p[3][p[0].Length - 1];\n\n for (double t = min_job; t <= p[2][j]; t++)\n {\n double secondDP = DP(j - 1, pOneLast, t, ref p);\n result = Math.", "Min(result, pThreeLast + pTwoLast - t + secondDP);\n }\n\n return result;\n} \n\nYes, I know they are named poorly but without having enough domain specific knowledge this can happen. ", " \nThe former DP() method will then look like \nprivate static double DP(int j, double t1, double t2, ref double[][] p)\n{\n\n if (j == 1)\n {\n if (t1 == p[1][1] && t2 == p[3][1])\n {\n return p[1][1] + p[2][1] + p[3][1];\n }\n return double.", "MaxValue;\n }\n\n double pOneLast = p[1][j];\n double pThreeLast = p[3][j];\n\n int num_t1_options = Convert.", "ToInt32(p[1][1] - pOneLast + 1);\n int num_t2_options = Convert.", "ToInt32(p[3][1] - pThreeLast + 1);\n\n double[][] f = GetJaggedArray(num_t1_options, num_t2_options);\n\n for (t1 = pOneLast; t1 <= p[1][1]; t1++)\n {\n int firstIndex = Convert.", "ToInt32(t1 - pOneLast);\n for (t2 = pThreeLast; t2 <= p[3][1]; t2++)\n {\n int secondIndex = Convert.", "ToInt32(t2 - pThreeLast);\n\n if (firstIndex > 0 && secondIndex > 0)\n {\n f[firstIndex][secondIndex] = ProcessBothNonZero(j, t1, t2, p);\n }\n\n if (firstIndex == 0 && secondIndex > 0)\n {\n f[firstIndex][secondIndex] = ProcessFirstIsZero(j, t1, t2, p);\n }\n\n if (firstIndex > 0 && secondIndex == 0)\n {\n f[firstIndex][secondIndex] = ProcessSecondIsZero(j, t1, t2, p);\n }\n\n if (firstIndex == 0 && secondIndex == 0)\n {\n f[firstIndex][secondIndex] = ProcessBothAreZero(j, t1, t2, p);\n }\n }\n }\n return GetMinimum(f);\n} \n\nMakeP() \nUsing the new GetJaggedArray() method, this can be simplified to \n/// <summary>\n/// return matrix with indexes starts from 1\n/// </summary>\nprivate static double[][] MakeP(double[] jobs, double[] mashines_rates)\n{\n double[][] p = GetJaggedArray(mashines_rates.", "Length + 1, jobs.", "Length + 1);\n\n for (int i = 0; i < mashines_rates.", "Length; i++)\n {\n for (int j = 0; j < jobs.", "Length; j++)\n {\n p[i + 1][j + 1] = jobs[j] / mashines_rates[i];\n }\n }\n return p;\n} \n\ncalcLowerBound() \nBy renaming the method to CalculateLowerBound() and extracting the calculation of the average to a separate method the former calcLowerBound() method is much more readable. ", " \nprivate static double CalculateLowerBound(double[] jobs, double[] mashines_rates)\n{\n double average = 0;\n for (int i = 0; i < jobs.", "Length; i++)\n {\n average += GetAverage(jobs[i], mashines_rates);\n }\n average = average / jobs.", "Length;\n return average * jobs.", "Length + average * (mashines_rates.", "Length - 1);\n}\nprivate static double GetAverage(double job, double[] maschineRates)\n{\n double average = 0;\n for (int j = 0; j < maschineRates.", "Length; j++)\n {\n average += job / maschineRates[j];\n }\n return average / maschineRates.", "Length;\n} \n\nfind_MakeSpan() \nBy removing the not needed initialisation for loop and directly returning the result this can be simplified to \n private static double Find_MakeSpan(double[] jobs, double[] machineRates)\n {\n int numberOfJobs = jobs.", "Length;\n int numberOfMachines = machineRates.", "Length;\n double[] flows = new double[numberOfMachines];\n for (int i = 0; i < numberOfJobs; i++)\n {\n flows[0] += jobs[i] / machineRates[0];\n for (int j = 1; j < numberOfMachines; j++)\n {\n flows[j] = Math.", "Max(flows[j - 1], flows[j]) + jobs[i] / machineRates[j];\n }\n }\n return flows[numberOfMachines - 1];\n } \n\nmake_job_variables() \nBy renaming the method to CreateJobVariables() and removing the not needed initialisation for loop and using the new GetJaggedArray() method, this can be simplified to \nprivate static double[][] CreateJobVariables(double[] jobs)\n{\n\n int num_of_vars = Factorial(jobs.", "Length);\n double[][] jobs_vars = GetJaggedArray(num_of_vars, jobs.", "Length + 1);\n\n int count = 0;\n foreach (double[] permutation in Permutations<double>.AllFor(jobs))\n {\n for (int i = 0; i < jobs.", "Length; i++)\n {\n jobs_vars[count][i] = permutation[i];\n }\n count++;\n }\n return jobs_vars;\n} \n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0006639462662860751, 0.0005700146430172026, 0.00062042404897511, 0.0006204906385391951, 0.0006754224305041134, 0.0006719556404277682, 0.0005838213255628943, 0.0009269574075005949, 0.0006845156894996762, 0.0007499511702917516, 0.0006753245834261179, 0.0010321233421564102, 0.0008144198218360543, 0.0008056002552621067, 0.0007576470379717648, 0.0008255469729192555, 0.0007333407993428409, 0.0006707080756314099, 0.0008958623511716723, 0.0006818192778155208, 0.0008958623511716723, 0.0007981547387316823, 0.0007711363141424954, 0.0009332639747299254, 0.0010993487667292356, 0.000689867592882365, 0.0006467121420428157, 0.0013329478679224849, 0.0007549500442110002, 0.0006587881944142282, 0.0008554852101951838, 0.000842863111756742, 0.0007549500442110002, 0.0009297339129261672, 0.0007724384195171297, 0.0008673890260979533, 0.0007321215816773474, 0.0006990643450990319, 0.0006655592587776482, 0.0007845467189326882, 0.0007549500442110002, 0.0007444158545695245, 0.0007459899061359465, 0.0008673890260979533, 0.0008031486067920923, 0.0006471934029832482, 0.0006763960118405521, 0.0007557659992016852, 0.0007409174577333033, 0.0009119209134951234, 0.0007549500442110002, 0.0006662335945293307, 0.0008554852101951838, 0.000842863111756742, 0.0007549500442110002, 0.0006662335945293307, 0.0006574493600055575, 0.0008221289026550949, 0.0007549500442110002, 0.0006662335945293307, 0.0006655592587776482, 0.0007845467189326882, 0.0007549500442110002, 0.0007444158545695245, 0.0007459899061359465, 0.0008673890260979533, 0.0009809419279918075, 0.0007161910180002451, 0.0009885559557005763, 0.0008643059409223497, 0.0023781894706189632, 0.000846242590341717, 0.0010469326516613364, 0.0012582654599100351, 0.0007781542371958494, 0.0033750368747860193, 0.0006363867432810366, 0.0011205688351765275, 0.000667304324451834, 0.0011205688351765275, 0.0010586829157546163, 0.0008643059409223497, 0.002607600064948201, 0.000846242590341717, 0.0009184959344565868, 0.002103312872350216, 0.002501186216250062, 0.0017400294309481978, 0.000846242590341717, 0.0009184959344565868, 0.0010071679716929793, 0.0014525384176522493, 0.002497447421774268, 0.001728270435705781, 0.000846242590341717, 0.0009184959344565868, 0.000907803128939122, 0.001511088921688497, 0.002501186216250062, 0.001633774139918387, 0.002497447421774268, 0.0023826712276786566, 0.000846242590341717, 0.0009184959344565868, 0.000907803128939122, 0.000833202968351543, 0.001240356476046145, 0.0008317298488691449, 0.0007880473858676851, 0.0009381624986417592, 0.0008752879220992327, 0.0009227211121469736, 0.0010648424504324794, 0.0006889454671181738, 0.0012784749269485474, 0.0006760493270121515, 0.0035875735338777304, 0.0011205688351765275, 0.0006096301949582994, 0.0011205688351765275, 0.0006335069192573428, 0.0011205688351765275, 0.0006478790892288089, 0.0011205688351765275, 0.0006159169715829194, 0.0011205688351765275, 0.0007025981321930885, 0.0011205688351765275, 0.0006591294659301639, 0.0011205688351765275, 0.0006694034673273563, 0.0011205688351765275, 0.0009058737196028233, 0.0006434604874812067, 0.0033750368747860193, 0.0007533822790719569, 0.0033750368747860193, 0.0006305201095528901, 0.0011205688351765275, 0.000755034270696342, 0.001461872598156333, 0.0008162996964529157, 0.0008609084179624915, 0.0011308558750897646, 0.0006760493270121515, 0.0021814382635056973, 0.0025250811595469713, 0.000783128256443888, 0.0011205688351765275, 0.0006055113044567406, 0.0011205688351765275, 0.0006367726600728929, 0.0033750368747860193, 0.0006546698277816176, 0.0033750368747860193, 0.0006416157120838761, 0.0011205688351765275, 0.0006533141131512821, 0.0011410008883103728, 0.0007755185361020267, 0.0011368212290108204, 0.00122735311742872, 0.0008981010760180652, 0.0010492001892998815, 0.0009989080717787147, 0.0009097916772589087, 0.0008566912147216499, 0.0007839985191822052, 0.000688384345266968, 0.000734396860934794, 0.0007480161730200052, 0.0007005232037045062, 0.0006821965798735619, 0.0006832408835180104, 0.0007086620316840708, 0.0006741163088008761, 0.0006640772917307913, 0.0033750368747860193, 0.0007831167313270271, 0.0007670865743421018, 0.0008450730820186436, 0.0006990643450990319, 0.0006990643450990319, 0.0008321646018885076, 0.0007701030699536204, 0.0010385281639173627, 0.0033750368747860193, 0.0006549421232193708, 0.0033750368747860193, 0.0006352993077598512, 0.0011205688351765275, 0.0008490024483762681, 0.0006990643450990319, 0.0006990643450990319, 0.0007807613001205027, 0.0006523901829496026, 0.0033750368747860193, 0.0006400286802090704, 0.0033750368747860193, 0.000637721037492156, 0.0011205688351765275, 0.0007049264386296272, 0.0006904098554514349, 0.0008075697696767747, 0.0009199927444569767, 0.001055765664204955, 0.0008908341987989843, 0.0019478840986266732, 0.0020831383299082518, 0.0008056002552621067, 0.004279029555618763, 0.003364221192896366, 0.0010542214149609208, 0.0011163454037159681, 0.0008800606010481715, 0.0022005559876561165, 0.0008501458796672523, 0.0008800606010481715, 0.0017375412862747908, 0.0008471736800856888, 0.0005968914483673871, 0.0006948876543901861, 0.0006951290997676551, 0.0013361023738980293, 0.000743966898880899, 0.0006190629210323095, 0.00051094003720209, 0.0007002474740147591, 0.0005810822476632893, 0.0006060959422029555, 0.0006900986772961915, 0.0006983917555771768, 0.0007083318778313696, 0.0008958623511716723, 0.0007981547387316823, 0.0009687841520644724, 0.0005590333021245897, 0.0005450854077935219, 0.0049302405677735806, 0.0007549500442110002, 0.0007231443887576461, 0.000817568157799542, 0.0009887150954455137, 0.0008212699904106557, 0.0006957145524211228, 0.0011541398707777262, 0.0005904216668568552, 0.0007594693452119827, 0.0011937374947592616, 0.0007724384195171297, 0.0008673890260979533, 0.0008757033501751721, 0.0005804998800158501, 0.0006815743399783969, 0.0005999496788717806, 0.0008993049850687385, 0.0007044237572699785, 0.0008273341809399426, 0.0006598487962037325, 0.0008198723080568016, 0.0010269319172948599, 0.001314906170591712, 0.0007981988019309938, 0.0006946476642042398, 0.0005956272943876684, 0.0013723111478611827, 0.0008293998544104397, 0.001354394480586052, 0.0012029324425384402, 0.0008491776534356177, 0.0011205688351765275, 0.0006328774616122246, 0.0006469732616096735, 0.0005931064370088279, 0.0009637856855988503, 0.000846242590341717, 0.0007804370252415538, 0.0008474834030494094, 0.0006418988923542202, 0.0005972383078187704, 0.0008228076621890068, 0.0018070877995342016, 0.0011627001222223043, 0.000967926112934947, 0.0011681519681587815, 0.0012915830593556166, 0.0008893093909136951, 0.0015506085474044085, 0.0010527098784223199, 0.001089105848222971, 0.0007112571038305759, 0.0023790255654603243, 0.0012802613200619817, 0.0008293998544104397, 0.0012580874608829618, 0.0012284897966310382, 0.0013458321336656809, 0.0006991546251811087, 0.000864944770000875, 0.0011748871766030788, 0.0007177027873694897, 0.00110622716601938, 0.0007585287094116211, 0.0006375414086505771, 0.0006741163088008761, 0.0023905765265226364, 0.0010899481130763888, 0.0008766705868765712, 0.0007932482403703034, 0.0009327217703685164, 0.0008451350731775165, 0.0009335885988548398, 0.001636955887079239, 0.0017775087617337704 ]

[ "The Mason Lions club met Tuesday, March 5th, for its monthly business meeting.", "\n\n\"Boss\" Lion Pat Reardon was responsible for the program and Secretary/Treasurer Gene Gamill read the minutes and gave the financial report.", "\n\nA Hamburger Lunch will be held April 5th on the west side of the Courthouse Square.", "\n\nJim Jeidelberg was inducted as a new member. ", "His sponsor, Nolan Donop, was unable to attend. ", "Lion Gaylon Thorn conducted the induction ceremony.", "\n\nThe club’s next meeting will be held next Tuesday, March 12th, at noon at Willow Creek Cafe. ", "The program chairman will be Mark Lehmberg.", "\n\nThe Mason Lion’s Club has an ongoing program to recycle used eyeglasses to people who need them. ", "Used eyeglasses may be given to any Lion or left in collection boxes at any of the local banks. ", "Also please contact any Mason Lion if you know of anyone in our community unable to afford appropriate eye care.", "\n\nReaders are solely responsible for the content of the comments they post here. ", "Comments do not necessarily reflect the opinion or approval of Mason County News. ", "Comments are moderated and will not appear immediately." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005769864073954523, 0.0006233806489035487, 0.001171672367490828, 0.0007656204979866743, 0.0007382723852060735, 0.0006267413846217096, 0.0006309186574071646, 0.0007197092054411769, 0.0007225237204693258, 0.0011014490155503154, 0.0006517982110381126, 0.0005962575087323785, 0.0006330343312583864, 0.000574875739403069 ]

[ "Are you bored with your regular white ear-buds that came with your iPod? ", "Want a more personalized or professional headphone design that is more in tune with your audiophile status? ", "Whether you want headphones for work or play, make a statement with them, especially if you are going to have it on 2 to 3 hours a day.", "\n\nIn this line-up, we have gathered 20 extremely cool and creative headphone designs. ", "Some are concepts, others ready for purchase, but all are colorful, bold and different. ", "You no longer need to compromise style for function. ", "Be hip, be seen, be admired.", "\n\n1. ", "Sound Like Chocolate Scented Headphones\n\n2. ", "HØR by Sigve Knutson\n\n3. ", "HALO by Jongha Lee\n\n4. ", "Wesc Franscois Dransart\n\n5. ", "APPLE HEADPHONES by Riccardo Fissore\n\n6. ", "Monster Diesel Vektr On-Ear Headphones\n\n7. ", "SOL REPUBLIC / TRACKS SERIES by Formant Studios\n\n8. ", "Ashcraft Aria by Ashcraft Design\n\n9. ", "Digital Design Tools by Alexander Knorr\n\n10. ", "JUNGHOLZ Kopfhörer by Kristina Düver\n\n11. ", "Porsche Design Headphones by jules parmentier\n\n12. ", "Headphones by Oscar Estrada\n\n13. ", "Nixon Headphones\n\n14. ", "Guitar Ear-O, Headphones by Carina Ostermayer\n\n15. ", "Limited Edition Headphones – Eurocase by Gimena Ochoa\n\n16. ", "Parra Headphones\n\n17. ", "i-Mego Headphones\n\n18. ", "Wooden Headphone by Etienne Coutable\n\n19. ", "Custom Headphone Design by Jonathan Marquez\n\n20. ", "Headphones “Sock” (Concept 2011) by Stefan Steevy Burlacu" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.007378436159342527, 0.0009373097564093769, 0.0006642370717599988, 0.000570396485272795, 0.0005629279767163098, 0.0006750858738087118, 0.006009295117110014, 0.0009391900966875255, 0.0006743893609382212, 0.00337198912166059, 0.0007598196971230209, 0.001097135478630662, 0.0007795848650857806, 0.0011157352710142732, 0.0006518004229292274, 0.0007587285945191979, 0.000644419458694756, 0.000741757801733911, 0.000627072702627629, 0.0008228867664001882, 0.0009858414996415377, 0.0008713370771147311, 0.0008264505304396152, 0.0007741207955405116, 0.0008226857171393931, 0.001072196988388896, 0.00061782420380041, 0.0015922095626592636 ]

[ "Dublin, Ireland– In an effort to curb spending and generate much-needed revenue, the Irish government has taken the drastic decision to sell County Longford, reducing the Irish republic from 26 counties to 25.", "\n\nThe move, which is expected to be formally announced on 28th January, was made following extensive discussions between representatives of the government and the EU-ECB-IMF troika.", "\n\n“It was a tough decision, but with the prospect of another EU-backed bailout uncertain the government needed to take decisive action” said Siobhan Reilly, a spokeswoman for the government. “", "Selling Longford is not something the government wished to do, but with such economic volatility it became necessary to sell some non-key state assets”.", "\n\nA provisional date for the transfer of the county to a yet to be determined buyer has been set for the 4th October. ", "While a guide price remains confidential, it’s hoped that the move will save the public finances in excess of €250 million per year.", "\n\nThe decision to select Longford was reached after an interdepartmental group concluded that the county would be the least missed amongst the Irish public. ", "James Masters, an advisor to the group, explained how the decision was reached.", "\n\n“We took into account various factors; tax revenue accrued; cost to the exchequer; value of infrastructure etc. ", "All of these were considered but with most counties running a deficit, what it ultimately came down to was county recognition”\n\nThe county holds the unfortunate distinction of satisfying the conditions of the ‘Belgian problem’, a popular political science theory that posits that area’s of relative insignificance and unpopularity are often the first to suffer in times of severe economic or political upheaval.", "\n\nDespite the severity of the situation, many Longford locals have been stoic about the sale. ", "James Nolan, a former councillor, said that while he found the news ‘wholly devastating’ , he was not overly surprised by it.", "\n\n“To be honest, if anywhere was to go it was probably Longford. ", "I was hoping for Roscommon or Leitrim but I always thought it would be us” said the 47-year-old solicitor from Granard.", "”Unfortunately we’re not known for a lot and visitors tend to forget the county in a hurry, kind of like a movie with J-Lo or your one off Friends”\n\nOthers, however, have expressed their shock and disgust at the decision to sell the county on the international market. ", "Many of whom have already speculated as to whether the government may have been pressured into the sale by powerful voices on the continent.", "\n\n“I’m shocked and appalled that we (Longford) have to go. ", "I think there were better options than us” said Margaret Coyne, a primary school teacher from Edgeworthstown, Longford. “", "They could have gone for Cork and done everyone a favour. ", "I believe it’s only on the recommendations of the French and Germans that were now the one’s to suffer”.", "\n\nCoyne’s sentiment has not fallen on deaf ears, with many members of the Opposition expressing their disapproval of the action.", "\n\n“This move is totally unjust, even if Longford’s not the best place in the world, it still deserves to be a part of this country”, said a spokesman for Fianna Fail.", "\n\nAlthough formal approaches will not permitted till late August, its been reported that the Chinese government have already registered an interest in procuring the county. ", "It’s believed that the Asian superpower would likely redesignate the county as a free trade zone (FTZ) and use it as a European manufacturing base for products such as Hello Kitty lunch boxes and Pandora the Explorer DVD’s.", "\n\nAs to how many residents of the county will remain after the transfer date in October will have to be seen. ", "One resident, however, did express an intention to stay regardless.", "\n\n“I’m a Longford man first, an Irish man second. ", "I’ll stay, even if the Chinese come” said Mark Murdoch, a carpenter from Longford town. “", "Sure, it wont be too bad. ", "I love Chinese food, especially the number 46 and 78, the old chicken balls and chips”\n\nIn spite of Murdoch’s intentions, it’s expected that a large portion of the county’s current population will locate elsewhere in the coming months.", "\n\nALSO IN THE NEWS: GOVT. ", "PLANS TO HURT ‘UGLY’ PEOPLE\n\nBrought to you by 2Wheels.ie , Ireland’s premier bike shop." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006529932143166661, 0.0005313348956406116, 0.0006518230657093227, 0.0008500005351379514, 0.000573171186260879, 0.0005961742135696113, 0.0005716588348150253, 0.000536968931555748, 0.0006056175334379077, 0.0007658131653442979, 0.0006576122832484543, 0.0005950882332399487, 0.0006559898029081523, 0.0007898780168034136, 0.0012465412728488445, 0.0005363784148357809, 0.002814626321196556, 0.0006714265909977257, 0.0006845134194009006, 0.03355225920677185, 0.0013659702381119132, 0.0010289032943546772, 0.0005238448502495885, 0.0008318884065374732, 0.0005642908508889377, 0.0005833847098983824, 0.001216462696902454, 0.0049385312013328075, 0.0016477995086461306, 0.0010044765658676624, 0.0006356250960379839, 0.18892782926559448 ]

[ "The Medical Data Base System of Owens-Corning Fiberglas Corporation.", "\nThe Medical Data Base System provides a mechanism for correlating industrial hygiene survey data with specific jobs and with the medical records of the individual employee. ", "An occupational survey groups jobs by departments or by location according to potential exposures. ", "Results of industrial hygiene surveys are correlated with the occupational survey to assign exposures. ", "Results of pre-placement health examinations, given to every employee and periodic examinations, given to those employees who are potentially exposed to harmful chemical or physical agents in their work environment, form the Medical Records File. ", "Development of the data collection and storage phase of this system was completed in 1972, and the system was implemented at that time. ", "The retrieval/analysis phase of the system is currently under development. ", "Although the present data base does not provide an adequate basis for true epidemiological studies, some trial evaluations have been completed successfully." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.000634315307252109, 0.0006219945498742163, 0.000579426996409893, 0.0005739242769777775, 0.000594472570810467, 0.0005479277460835874, 0.0005501630948856473, 0.0005470961332321167 ]

[ "While there is immense depth at the quarterback position in the Big 12, the running back position isn't nearly as strong, at least not on the surface. ", "It's certainly not for a lack of talent or ability at the position. ", "The problem is that most of the best players are very young and inexperienced. ", "In fact, Texas A&M is the only team on the Texas schedule that won't have a first-year starter this season.", "\n\nHere's a look at the top 10 running backs on the Longhorn schedule this season, based on past production, and how well they are expected to do this season.", "\n\nThe skinnyAfter Darren McFadden and Felix Jones both left Arkansas early to enter the NFL draft, all eyes have turned to the third running back from that 2005 class. ", "At only 5-7, 173 pounds, Smith is undersized as a running back so he will most likely split carries with fellow running backs Brandon Barnett, Chip Gregory, and highly regarded true freshman De'Anthony Curtis, but his speed and pass catching ability set him apart from other Razorback runners and should allow him to have a large role in Bobby Petrino's offense.", "\n\nThe skinny: After a season where he nearly caught as many passes (38) as he had rushing attempts (63) Rose is one of the most versatile backs that the longhorns will face this season. ", "The junior from Lutz, Florida has been used as a fullback, running back, and h-back in his three years with the owls and has proven to be a solid lead blocker and powerful runner. ", "Although only a fullback, Rose made this list because he is one of the top FBs in the nation and someone that is already highly regarded by many NFL scouts. ", "Rose is currently rated by some draft sites as a potential 4th-5th round NFL draft pick as a full back after scoring eight total touchdowns last season.", "\n\nThe skinny: With DeMarco Murray coming off of a knee cap injury he sustained late last season Calhoun should be able to receive playing time early in the season as Oklahoma brings Murray back slowly. ", "Calhoun is a big back at 6-0, 210 and like Scott he has very good speed for a player his size. ", "As a senior at Van high school Calhoun was the second-ranked player in the state of Texas and considered the second-best downhill runner in the nation by rivals and the number one ranked running back by scouts inc.", "\n\nThe skinny: To the casual football fan across the country, Lane looks more like a lineman than a running back, but over the past few seasons he has enjoyed great success as the thunder to Michael Goodson's lightning in the A&M rushing attack. ", "In his first three seasons at Texas A&M, Lane has already set the school record for career touchdowns with 44. ", "At 6-0 and a biscuit over 280 pounds, the junior from Lufkin displays very quick feet and above average speed for a player of his size. ", "New coach Mike Sherman has moved Lane to fullback this season, and he that the move not only gets Lane to the right position on the field, but it will prepare him for his future position in the NFL.", "\n\nThe skinny: Scott's name is not one that is unfamiliar to Longhorn fans. ", "The five-star running back from St. Bonaventure high school in southern California narrowed his favorites to Texas and Colorado, and on national signing day he made his decision to play for Colorado official on ESPN. ", "Scott possesses a rare blend of size and speed that allows him to run by, through, or around defenders. ", "Such skills have led some experts to compare the 6-2, 220-pound back to former Heisman trophy winner Eddie George.", "\n\nScott arrived to Colorado a little late as he had to take care of minor grade issues, but so far he has been just as impressive in boulder as he was in high school. ", "Darrell is the favorite right now to earn the starting tailback job week one thanks to the graduation of last year's starter Hugh Charles.", "\n\nThe skinny: While he's about 70 pounds lighter than Lane, Brown teams up with DeMarco Murray at Oklahoma to form a power-speed combo similar to the one in College Station. ", "Brown spent most of last season as the short-yardage and goal line back for the Sooners, and despite spending his first two seasons as the third guy on the OU depth chart, Brown has made the most of his opportunities thus far. ", "As a true freshman in 2006, Brown rushed for 170 yards against Baylor in only his second career start, and amassed at least 50 yards in seven games last season. ", "A powerful runner, Brown has above average speed and is just as likely to run by you as run over you, or he may do both.", "\n\nThe skinny: Despite playing behind 1,000-yard back Brandon McAnderson last season, Sharp was nearly able to tally 1,000 total yards himself running the ball and catching it out of the backfield. ", "Sharp is a little undersized, which is why the Kansas coaches haven't used him as their feature back yet, but with his speed and pass catching ability he was a very good compliment to McAnderson last year. ", "Brandon McAnderson is now gone after graduating last year, so Sharp will be competing with highly regarded Junior College transfer Jocques Crawford for the starting tailback job. ", "Even if Jake isn't listed as the starter on Saturdays, he'll get enough touches running and catching the ball that will allow him to be a difference maker for the Jayhawks this fall.", "\n\nThe skinny: The theme at the top of this list is speed, and Hunter is no different. ", "At 5-8 he may be a little undersized for the position, but he makes up for it with quickness, agility, and surprising strength for a player his size. ", "Like Murray and Goodson, Hunter will be a first-year starter this fall, but he played extensively last season, and is one of the rising stars in the big 12. ", "Only a sophomore from John Tyler high school in Tyler, Texas, Hunter is able to see the field very well and exhibits rare patience for a young runner.", "\n\nThe skinny: Blessed with exceptional quickness and open field moves, Goodson uses his speed and elusiveness to make defenders miss, and is a threat to score every time he touches the ball. ", "Goodson has proven to be a dependable receiver out of the backfield and new coach Mike Sherman will look to try to move him around to create the best mismatches against opposing defenses as he plans to make Goodson the focal point of the aggie offense this fall.", "\n\nGoodson has expressed that he didn't feel like he fit in Dennis Franchione's zone-read offense where he was taking the ball from the quarterback in a shotgun formation. ", "Coach Sherman is using the I-formation now and it should lend to Goodson having the breakout season as a junior that aggie fans have expected since he arrived to College Station.", "\n\nThe skinny: With lighting quick speed, this sophomore from Las Vegas isn't just one of the fastest players on his team, he is one of the fastest football players in the nation. ", "In a platoon role last season with senior Allan Patrick, Murray still had over 10 touchdowns, including a 65-yard touchdown run against the Longhorns in the Red River shootout. ", "With Murray now the unquestioned starter, and being fortunate enough to run behind one of the best offensive lines in college football, he has the potential to have a Heisman Trophy type of season for the Sooners this fall." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0007696896209381521, 0.0008068167953751981, 0.0030374249909073114, 0.0007431721896864474, 0.0005711583071388304, 0.01229571271687746, 0.0017628369387239218, 0.015260166488587856, 0.0009758170926943421, 0.006425106897950172, 0.0009877716656774282, 0.004398517310619354, 0.0017646552296355367, 0.0010479319607838988, 0.0012339144013822079, 0.0007072256412357092, 0.004269979428499937, 0.0006385892047546804, 0.002737699542194605, 0.0005954550579190254, 0.0007600119570270181, 0.0007326066843234003, 0.0005931632476858795, 0.000651878013741225, 0.001240880461409688, 0.0011128522455692291, 0.0007851378759369254, 0.0037329045590013266, 0.007237538695335388, 0.0009400599519722164, 0.001036858418956399, 0.000720846583135426, 0.001230065361596644, 0.0008400479564443231, 0.0007119607180356979, 0.0006130767869763076, 0.007929245941340923, 0.0019111060537397861, 0.0013667203020304441, 0.0010110967559739947, 0.0024387154262512922, 0.0006952473195269704, 0.0011266506044194102 ]