Datasets:

tomekkorbak

/

detoxify-pile-chunk3-3350000-3400000

like 0

[ "package com.nepxion.thunder.serialization.compression;\n\n/**\n * <p>Title: Nepxion Thunder</p>\n * <p>Description: Nepxion Thunder For Distribution</p>\n * <p>Copyright: Copyright (c) 2017-2050</p>\n * <p>Company: Nepxion</p>\n * @author Haojun Ren\n * @version 1.0\n */\n\nimport java.io.", "IOException;\n\nimport org.xerial.snappy.", "Snappy;\n\nimport com.nepxion.thunder.serialization.compression.quicklz.", "QuickLz;\n\npublic class CompressorExecutor {\n public static byte[] compress(byte[] bytes) {\n return compress(bytes, CompressorFactory.getCompressorType());\n }\n\n public static byte[] decompress(byte[] bytes) {\n return decompress(bytes, CompressorFactory.getCompressorType());\n }\n\n public static byte[] compress(byte[] bytes, CompressorType type) {\n if (type == CompressorType.", "QUICK_LZ_COMPRESSOR) {\n return QuickLz.compress(bytes, 1);\n } else if (type == CompressorType.", "SNAPPY_COMPRESSOR) {\n try {\n return Snappy.compress(bytes);\n } catch (IOException e) {\n throw new CompressorException(e);\n }\n } else {\n throw new CompressorException(\"Invalid compressor type : \" + type);\n }\n }\n\n public static byte[] decompress(byte[] bytes, CompressorType type) {\n if (type == CompressorType.", "QUICK_LZ_COMPRESSOR) {\n return QuickLz.decompress(bytes);\n } else if (type == CompressorType.", "SNAPPY_COMPRESSOR) {\n try {\n return Snappy.uncompress(bytes);\n } catch (IOException e) {\n throw new CompressorException(e);\n }\n } else {\n throw new CompressorException(\"Invalid compressor type : \" + type);\n }\n }\n}" ]

{ "pile_set_name": "Github" }

[ 0.0010340021690353751, 0.001120927045121789, 0.0019601162057369947, 0.0008861446985974908, 0.0008693918352946639, 0.001432846998795867, 0.0008558957488276064, 0.002546068746596575 ]

[ "3-Deacetoxy-7-(alpha-amino-1-cyclohexenylacetamido) cephalosporanic acid (SCE-100), a new semisynthetic cephalosporin. ", "I. Comparative in vitro antibacterial activities of SCE-100 and cephalexin (CEX).", "\n3-Deacetoxy-7(alpha-amino)-1-cyclohexenylacetamido) cephalosporanic acid (SCE-100) has a potent antibacterial activity against Gram-positive and Gram-negative bacteria. ", "The minimum inhibitory concentration of SCE-100 is 0.2 approximately 12.5 mug/ml against Gram-positive bacteria including penicillin G-resistant Staphylococcus aureus and 6.25 approximately 100 mug/ml against Gram-negative bacteria. ", "SCE-100 inhibits clinically isolated strains of penicillin G-resistant S. aureus and ampicillin-resistant Escherichia coli, as well as the corresponding sensitive strains. ", "The activity of SCE-100 is enhanced by decreasing the inoculum size and is only slightly influenced by medium pH, difference of medium composition and the addition of horse serum. ", "SCE-100 has bactericidal activity against S. aureus and E. coli. ", "There is a stepwise development of in vitro bacterial resistance to SCE-100 by serial transfer of organisms into a liquid medium containing SCE-100. ", "Cross resistance was observed between SCE-100 and other tested cephalosporins." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.002163430443033576, 0.0006288706208579242, 0.0016589645529165864, 0.0009956354042515159, 0.0006676958873867989, 0.0005956940003670752, 0.0015650130808353424, 0.0005959475529380143, 0.0007101192604750395 ]

[ "Q:\n\nWhy is \"❨╯°□°❩╯︵┻━┻\" with such an encoding used for a method name?", "\n\nI came across following method in sidekiq gem. ", "Its just invoked from test_sidekiq.rb.", "\ndef self.❨╯°□°❩╯︵┻━┻\n puts \"Calm down, bro\"\nend\n\nThis is the only link I was able to find on SO.", "\n\nGoogle can't understand ❨╯°□°❩╯︵┻━┻. ", "Why doesn't Ruby complain about this encoding?", "\nWhat is the purpose of this method (not much looking at its body)?", "\nWhy did author @mike-perham use this name? ", "Just for fun, or testing some boundaries?", "\n\nA:\n\nIf you really do not understand the sense of the method name, that is a (Japanese-style) facemark. ", "Whereas English facemarks are rotated 90 degrees counter-clockwise and are long in the vertical direction of the actual face, Japanese facemarks are to be read in the direction as is, and are long in the horizontal direction. ", "The author of this is likely to be either a Japanese, or someone who is influenced by Japanese culture like anime.", "\nIn this particular case, each character expresses a certain part. ", "From left to right:\n\n❨ The right edge of the face\n╯ The right arm raised\n° The right eye\n□ The mouth\n° The left eye\n❩ The left edge of the face\n╯ The left arm raised\n︵ An imaginary curve expressing the trace of a thrown table\n┻━┻ A thrown upside-down table (most likely a chabudai that used to be seen typically in Japanese homes until some decades ago)\n\nChabudai gaeshi used to happen often at some feudal Japanese homes until some decades ago. ", "The father had the absolute monarchic right at home, and whenever he was frustrated over something, he would flip the chabudai during dinner to show his anger, and the family (especially the mother) had to prepare the dinner again.", "\n\nHere are more variations.", "\n\nA:\n\nIt's a core part of the Sidekiq API. ", " Sidekiq is limited to only tables while Sidekiq Pro adds APIs to flip other types of furniture: chairs, ottomans, loveseats, etc.", "\n\nA:\n\nLooking at the commit that introduced it seems to be some funny sort way to make sure the file is encoded in UTF-8\nhttps://github.com/mperham/sidekiq/commit/c1127165f8157807e7855c60f9849d20fb9fec24\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0010228183818981051, 0.0005739619955420494, 0.0006348495953716338, 0.0027063563466072083, 0.003146251430734992, 0.0007563741528429091, 0.0006909493240527809, 0.000715490139555186, 0.0005893720081076026, 0.000613234587945044, 0.0006323722191154957, 0.0007170498720370233, 0.0006315636564977467, 0.0009010834619402885, 0.002369178691878915, 0.0006164305377751589, 0.0007552756578661501, 0.0010337431449443102, 0.0009009294444695115 ]

[ "A brief review of the Belmont report.", "\nThe Belmont Report is one of the leading works concerning ethics and health care research. ", "Its primary purpose is to protect subjects and participants in clinical trials or research studies. ", "This report consists of 3 principles: beneficence, justice, and respect for persons. ", "This article reviews the Belmont Report and these 3 principles as well as its importance to nurse researchers." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005588105996139348, 0.0005603499012067914, 0.0006013153470121324, 0.000558622065000236, 0.000544006354175508 ]

[ "In the upcoming vote on equal marriage legislation in the House of Lords, the Archbishop of Canterbury will call for concessions to be made for teachers and faith schools, as the Church of England has reportedly “resigned” itself to same-sex marriage becoming law.", "\n\nThe Sunday Times reports that Justin Welby, the Archbishop of Canterbury, plans to use his stand in the House of Lords to call for the bill to explicitly protect faith schools and teachers from prosecution, if they do not wish to promote marriage equality.", "\n\nLambeth Palace sources say he will call for the bill to be amended to prevent the prosecution of people whose faith conflicts with equal marriage, particularly teachers who do not wish to deal with the subject in school.", "\n\nSources in the Church of England have said that the institution is resigned to the legalisation of same-sex marriage. ", "Archbishop Welby is expected to push for concessions to make this more palatable to religious groups.", "\n\nIn a conciliatory gesture towards the government, the Archbishop is expected to acknowledge that, thanks to the efforts of politicians to ensure the quadruple lock legal protections are in place, Church of England ministers cannot be forced to perform same-sex marriages.", "\n\nArchbishop Welby is one of 86 peers who have requested to speak during the debate, which starts on Monday.", "\n\nSupporters of marriage equality were concerned that a drawn-out debate could damage the bill – leading to the decision that the vote will take place Tuesday daytime after a break.", "\n\nPeers are said to be set to stage a final attempt to thwart the bill from passing." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006726460414938629, 0.0006801131530664861, 0.0007997436914592981, 0.0014070355100557208, 0.0005763205699622631, 0.0007162245456129313, 0.0005857481155544519, 0.0008239210001192987, 0.0013070773566141725 ]

[ "College Amenities\n\nEach residential college is fully equipped with:\n\nAccommodation Room\n\nTo ensure that the students are comfortable living in the college, the university has made the effort to provide a wide range of room for the students to choose. ", "The rooms are stated as follows: Executive Room, Single Room with attached bathroom, Standard Room, Double Room, Double Room with balcony and Family Housing Unit.", "\n\nBasic Furniture\n\nEach room is furnished with a bed, a mattress, study desk, a chair, study lamp, cupboard, fan, dustbin and clothes hangers.", "\n\nShared Equipment\n\nThe university also supplies iron, ironing board, electric kettle and hot & cold water dispenser to each residential block for students’ convenience.", "\n\nSports Court, Multi-station Equipment\n\nIn order to be in tandem with the development of sports and recreation among students, the university provides each residential college with tennis court, multi- purpose court for volley ball, takraw, basketball, netball; mini field and indoor games.", "\n\nScenic Landscape\n\nThe preserved landscape is rich with variety of local trees such as cengal, meranti, resak, merbau and others so as to enrich their knowledge of our flora and fauna and to create awareness towards the importance of preserving nature.", "\n\nAdministrative Complex\n\nEach residential college has one administrative complex which consists of College Office, Computer Lab, Committee Room, Students’ Activity Centre and a Cafeteria.", "\n\nPrincipal’s and Fellow’s Residence\n\nBoth residence are built nearby and attached to students’ residential block. ", "The reason is to strengthen the family-like relation among the principal, the fellow and the students. ", "Such a practice will help both the principal and the fellow to manage the students’ welfare.", "\n\nStudents’ Lounge\n\nEach residence hall is provided with ample lounges for kicking back and watching TV. ", "The lounge is furnished with settee, newspapers, magazines, television and ASTRO.", "\n\nLandscape/Garbage/Sanitary Bin Cleaning Services\n\nThe appointed contractors are responsible for the cleaning job inside and outside the premises. ", "This includes foyer, toilets, prayer rooms, hall and around the office complex. ", "In addition, garbage collector and sanitary bin cleaning contractors are also present to ensure that the residents are living in a clean and comfy environment.", "\n\nThe appointed contractors are also responsible in cleaning the surrounding area, mowing the lawn, watering and fertilizing the trees, planting new trees and maintaining the landscape.", "\n\nCafeteria/Food Arcade\n\nThe university provides each residential college with a cafeteria and food arcade that prepares food and drinks. ", "The cafeteria and the arcade operate between 7.00 am till 12 midnight.", "\n\nLaundry Services\n\nThe university also provides coin-operated washing machines at students’ block i\n\nMinimart\n\nBesides that, the university provides minimart for students’ convenience.", "\n\nPhotocopying Services\n\nOffer printing, laminating, book binding and other services to students in each college.", "\n\nComputer Shop\n\nSelling computer parts and giving consultation service to students who want to buy computer.", "\n\nComputer Lab\n\nStudents can do their assignments and surf the internet in the air-conditioned computer lab.", "\n\nStudents’ Common Room\n\nStudents have the opportunity to run the programs or activities such as seminars in the common room that can be found in all residential colleges. ", "The Common Room consists of two units Multi-purpose Hall, Counseling Room, Meeting Room, Committee Room and Study Room.", "\n\nTransportation Services\n\nThere are 20 private buses and 8 university buses for return trips to lectures in the campus. ", "These services operate between 7.15 a.m. and 11.30 p.m. for the convenience of the students. ", "Bus services to Taman Universiti are provided only on Saturdays and Sundays.", "\n\nThe University Shuttle Service operates bus service from 7.15am. – ", "11.30 pm throughout the academic year (except during public holiday) providing safe, convenient transportation throughout the Skudai Campus. ", "All services are funded by a semester fee paid by students.", "\n\nOther Facilities\n\nOther facilities that can be found in the colleges are store room for keeping the students’ belonging during semester break, stationery shop, book shop, public phones, telecommunication shop, parking lot and gazebos." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005122650181874633, 0.0005713470163755119, 0.0007226579473353922, 0.0007081139483489096, 0.0006203088560141623, 0.0005236738943494856, 0.0006391432834789157, 0.0007281731814146042, 0.0005614404217340052, 0.0007134131155908108, 0.0012326614232733846, 0.0005786592955701053, 0.001242391881532967, 0.0006244244868867099, 0.005787144880741835, 0.0006566697265952826, 0.0005616944981738925, 0.0006635094759985805, 0.0009421765571460128, 0.0006725178682245314, 0.0010897611500695348, 0.0008823330281302333, 0.0006053633405826986, 0.000643822131678462, 0.0006710744346491992, 0.0006431542569771409, 0.0007415715954266489, 0.0006584460497833788, 0.0006303383852355182, 0.0006703275139443576, 0.0006524741183966398 ]

[ "Q:\n\nFake UINavigationController slide animation\n\nI'm creating an app, where I need to have so much navigation controllers and in every navcontroller I have all elements (buttons, images, etc.) ", "the same except two uilabels. ", "Customer wants to have \"sliding\" animaiton when switching between navcontrollers like instagram app has. ", "I was wondering if there is any possibility to \"simulate\" switch of two navigationcontrollers and just change uilabels\n\nA:\n\nIf a lot of UIViewControllers have the same UIBarButton items,I strongly suggest you to have a common superclass like \"BaseViewController\". ", "\nEvery UIViewController will be a subclass of BaseViewController and not of the standard UIViewController.", "\nWith this pattern you can configure your default UINavigationBar on BaseViewController by adding the buttons and images which are always present and customize it only when you need it (by adding the UILabels you are talking about)\nThe instagram animation is the default iOS animation you achieve by pushing a new UIViewController onto the navigationController stack with this:\n[self.navigationController pushViewController:controller animated:YES];\n\nTo reply to your question on the comment section:\nIt's already left to right,but if you want you can animate from right to left also.", "Check this out:\nYourViewController *pageView = [[YourViewController alloc] initWithNibName:@\"YourViewController\" bundle:nil];\n\nCATransition *transition = [CATransition animation];\ntransition.duration = 0.45;\ntransition.timingFunction = [CAMediaTimingFunction functionWithName:kCAMediaTimingFunctionDefault];\ntransition.type = kCATransitionFromLeft;\n[transition setType:kCATransitionPush];\ntransition.subtype = kCATransitionFromLeft;\ntransition.delegate = self;\n[self.navigationController.view.layer addAnimation:transition forKey:nil];\n[self.navigationController pushViewController:pageView animated:NO];\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0009799952385947108, 0.0006992581766098738, 0.00162403448484838, 0.0005992254009470344, 0.0008223334443755448, 0.0006383278523571789, 0.0008894954225979745 ]

[ "About Nokia X5-01 softwares\n\nWe have plenty of Nokia X5-01 softwares available for downloads, Nokia X5-01 are contributed by our members.", "\n\nTo download Nokia X5-01 softwares, simply click on any above software and then click on the download button. ", "You can also download Nokia X5-01 softwares to your mobile by visiting our wap site http://wap.mobiletoones.com You either need to have software in your wap folder or WAP ID. ", "WAP ID can be found on software details page." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005482602282427251, 0.0006050379597581923, 0.0006221540388651192, 0.0005972061771899462 ]

[ "The present invention related to a permanent magnetic work holder, or referred to hereinafter as a sucker, particularly a light-weight magnetic sucker with high strength and stability through application of fusion weld at high temperature for assembly of magnetic conductive disk and sucker in order to improve working efficiency and to prolong service life.", "\nConventionally permanent magnetic sucker is incorporated with a case iron base. ", "Hence, it is quite heavy, working efficiency is limited, particularly where a large sucker is required. ", "Prolonged use of such sucker would deteriorate machining precision. ", "Moreover, the cam for its operating lever is made of steel which is designed to keep constant contact with the base. ", "Such a design does not only make maintenance very difficult, and cause seizing of the operating lever at the base frequently. ", "Seizing is always a trouble to its operator for its is very difficult to maintain the contact for it is inside the base. ", "Furthermore, the sucker assembly of the prior art is formed by soldering, its bonding strength is weak, change of temperature can affect the levelness of the surface of the sucker, and consequently adversely affect the precision of machining.", "\nIn view of the above defects, the inventor has created a new structure of permanent magnetic sucker which makes use of aluminum alloy for making of the base to minimize its weight, two pads at the bottom of the base to facilitate use of large electromagnetic sucker, a copper alloy sleeve for the operating level to prevent from being seized, and fusion weld at high temperature for assembly of the magnetic conductive disk and sucker to eliminate impurities, to assure high bonding strength and stability for the highest possible machining precision." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0007982086972333491, 0.04580570384860039, 0.06829860061407089, 0.12718914449214935, 0.0007651698542758822, 0.0006338940002024174, 0.0007994125480763614, 0.0034790041390806437, 0.0006173038855195045 ]

[ "More New Products Added\n\nJuly 22, 2012\n\nLast week, my webhost Zenfolio added a few new products for printing. ", "They've added metal prints and more wall mounts. ", "The metal prints are printed on a 0.45\" thick aluminum photo panel with rounded corners and are coated with a gloss finish. ", "I recommend the Clear Gloss finish which gives the print a transparent metallic look. ", "Each print includes a hanging wall mount.", "\n\nThe other choice of wall mount is printed on a professional photographic paper and made to be wall mounted. ", "First, the wall brackets are mounted on the wall and then the prints attaches on to the brackets by magnets. ", "This will allow different prints to be easily changed on and off the wall brackets. ", "The prints will be rich in colors and details without glass, glare, mats or frame.", "\n\nSo far, I've added a few photos and selected the correct aspect ratio for availability from my website.", "\n\nMetal Prints choices: 12\"x18\", 16\"x24\", 20\"x30\" & 24\"x36\"\n\nNew Wall Mount choices: 15\"x10\", 22.5\"x15\" & 30\"x20\"\n\nI'm hoping to produce more photos with different aspect ratios. ", "This way I can have more products available." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006268540164455771, 0.0006117261364124715, 0.0006785867735743523, 0.0005495273508131504, 0.0006600563647225499, 0.0006035604164935648, 0.0010108299320563674, 0.0008734192233532667, 0.0006178427720442414, 0.0005218277219682932, 0.0005660248571075499, 0.0005624820478260517 ]

[ "Thursday, January 24, 2013\n\nHello dear stitching friends! ", "Can you believe that there are only a few days remaining of the first month of the new year? ", "And what have I been up to these past few weeks? ", "Well, I have a big announcement to make - after years of 'playing' around with designing, making sketches and dreaming of creating more of my own designs I am finally doing it!", "\n\nI am happy to announce the launch of Lady Lexi Designswith this 'Be My Valentine' design! ", "The ePattern is available in my new little Etsy Shop in pdf format!", "\n\nBut how can I launch a shop without a little gift to my friends? ", "Here is a 'True Love' freebie for Valentine's day - I finished it as a long pillow with red check fabric and it is trimmed with cotton lace, a red ribbon and a cute little heart charm.", "\n\nI used DMC 321 for this piece, but you can choose which ever fibers you like :) If you have any trouble saving the chart, or if you would like me to send it to you directly, please email me.", "\n\nIf you do stitch one of my designs, please feel free to email me some pictures - I would love to see your finishes! ", "You might also be wondering where the name 'Lady Lexi Designs' comes from? ", "For regular readers of my blog - you are right - it is named after my dog Lexi, who at almost two years old, is a real lady and also my sweet 'baby'!", "\n\nTuesday, January 8, 2013\n\nHello my dear stitching friends and a warm welcome to my new followers! ", "The last of my Christmas packages finally arrived in the new year! ", "This gift was sent to Lee in Brazil and included quite a few handmade gifts, as well as some Christmas labels, Christmas themed mini pegs, a souvenir teaspoon of South Africa and a Christmas card:\n\nI stitched this Christmas tree for Lee - it is a segment from 'Vintage Christmas' by Country Cottage Needleworks and finished as a hanging pillow ornament (also shown in a previous post):\n\nThe design for this needle painted pinkeep is from Trish Burr's book Needle Painting Embroidery: Fresh Ideas for Beginners and is backed with the pictured fabric (also shown in a previous post):\n\nThis gorgeous beaded doily was made by my mom especially for Lee! ", "The work is so delicate and I just love the 'pink-gold' colour of the beads! ", "Thank you mom for making this gift for my friend!", "\n\nHere is a pic of all the handmade gifts:\n\nI also included a little gift for Larissa. ", "She is a student at Lee's embroidery school and was kind enough to send me a gift last year. ", "Larissa also received some handmade gifts, Christmas labels, Christmas themed mini pegs and a Christmas card:\n\nThis sweet little 'Prancer' is by JBW designs and is stitched on 28ct blue linen and finished as a hanging pillow ornament - such a cutie!", "\n\nI also made these counting/marking pins and matching scissors fob for Larissa - I hope she likes them!", "\n\nWell, that 'wraps up' the Christmas gifts for last year - I am always so relieved when all the packages arrive safely at their new homes :)\n\nFriday, January 4, 2013\n\nHello dear stitching friends - I hope you have been enjoying the first few days of 2013! ", "I would like to share the last stitchy finishes of 2012 with you. ", "My mom and I finished our stitching on The Fairytale Advent Calender by The Little Stitcher before the end of the year! ", "This was such a fun stitch - here are some pics:\n\nThe backstitching is also complete and they are now ready to be finished into little hanging pillow ornaments.", "\n\nThey are stitched on self-dyed 28ct evenweave in the recommended DMC threads.", "\n\nSuch a lovely quick stitch - I have been trying to decide which one is my favourite - I do love the reindeer and sleigh motif (23)!", "\n\nI have really been enjoying the Christmas stitching (I have a few stitched ornaments from last year that still need finishing!) ", "and decided to kick the year off with an 'Ornament for January'. ", "Here is a pic of my first few stitches of 2013 - hopefully I will be able to share the finish soon :)" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006488077924586833, 0.0008593455422669649, 0.0006960942992009223, 0.0006487441132776439, 0.0005724737420678139, 0.0007439602049998939, 0.0007769398507662117, 0.0007271738722920418, 0.000554665457457304, 0.0005505345179699361, 0.0005446084542199969, 0.0011184376198798418, 0.0005689908866770566, 0.0013780449517071247, 0.0012819513212889433, 0.0005783069645985961, 0.005319534335285425, 0.0009090325911529362, 0.0005851452588103712, 0.007271146401762962, 0.0061969938687980175, 0.0005556591786444187, 0.0005442685214802623, 0.002958949189633131, 0.04016648977994919, 0.0006222189986146986, 0.0006352278287522495, 0.0005392107414081693, 0.0061720446683466434, 0.0007554283365607262 ]

[ "SIPA1L2, MIR4697, GCH1 and VPS13C loci and risk of Parkinson's diseases in Iranian population: A case-control study.", "\nParkinson's disease (PD) is the second most common neurodegenerative disorder. ", "Prevalence of PD increases steadily with age. ", "A recent meta-analysis of genome-wide association studies has identified six new loci to be linked with PD. ", "Here we investigated the association of four of these new loci, SIPA1L2, MIR4697, GCH1 and VPS13C with PD in an Iranian population. ", "Through a case-control study a total of 1800 subjects comprising 600 PD patients and 1200 unrelated healthy controls were recruited. ", "Rs10797576, rs329648, rs11158026 and rs2414739 related to SIPA1L2, MIR4697, GCH1 and VPS13C loci respectively, were genotyped in all subjects. ", "The difference of genotype and allele frequencies between case and control groups were investigated using chi-square test and logistic regression models with R software. ", "Genotype and allele frequencies were significantly different in PD patients and control group for rs329648, rs11158026 and rs2414739 (p-value=0.018, 0.025, and 0.009 respectively for allele frequency differences). ", "There was no difference in genotype nor allele frequencies between the two groups for rs10797576. ", "We replicated the association of three new loci which are proposed for PD. ", "More studies in other populations and also functional analysis are required to clear the role of these variants in PD." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0006596439052373171, 0.0044646416790783405, 0.0006170803681015968, 0.0006026648334227502, 0.0005850328598171473, 0.0005463715060614049, 0.0007051958236843348, 0.0006354863871820271, 0.0006086525390855968, 0.0006230625440366566, 0.0006125455838628113, 0.0005566143663600087 ]

[ "1. ", "Field of the Invention\nThe present invention relates to a heat resistant substrate incorporated circuit wiring board incorporating a heat resistant substrate and more particularly to a heat resistant substrate incorporating circuit wiring board preferable for a package board to be loaded with an IC chip.", "\n2. ", "Description of the Related Art\nJP 2002-344142 A has disclosed a multilayer printed wiring board in which interlayer resin insulation layer and conductive layer are placed alternately on a resin core substrate having through hole conductors while the conductive layers are connected with the via hole conductor, as a multilayer printed wiring board to be loaded with an IC chip.", "\nJP 2001-102479 A has disclosed an interposer for connecting an IC chip and a package board electrically. ", "An interposer main body 20 in FIG. ", "2 is made of silicon and the electrode of an IC chip is connected to a via conductor 27 passing through silicon while wiring layer is formed on a silicon substrate located on an opposite side to the IC. ", " [Prior Art 1] JP 2002-344142 A is incorporated herein by reference. ", " [Prior Art 2] JP 2001-102479 A is incorporated herein by reference." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0009391900966875255, 0.0005733343423344195, 0.001185585861094296, 0.000596744182985276, 0.0005895989597775042, 0.0006291826139204204, 0.0006612523575313389, 0.0005974046071060002, 0.0006061802851036191 ]

[ "/*\n * This file is part of the SDWebImage package.", "\n * (c) Olivier Poitrey <rs@dailymotion.com>\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.", "\n */\n\n#import <Foundation/Foundation.h>\n#import \"SDWebImageManager.h\"\n\n@class SDWebImagePrefetcher;\n\n@protocol SDWebImagePrefetcherDelegate <NSObject>\n\n@optional\n\n/**\n * Called when an image was prefetched.", "\n *\n * @param imagePrefetcher The current image prefetcher\n * @param imageURL The image url that was prefetched\n * @param finishedCount The total number of images that were prefetched (successful or not)\n * @param totalCount The total number of images that were to be prefetched\n */\n- (void)imagePrefetcher:(SDWebImagePrefetcher *)imagePrefetcher didPrefetchURL:(NSURL *)imageURL finishedCount:(NSUInteger)finishedCount totalCount:(NSUInteger)totalCount;\n\n/**\n * Called when all images are prefetched.", "\n * @param imagePrefetcher The current image prefetcher\n * @param totalCount The total number of images that were prefetched (whether successful or not)\n * @param skippedCount The total number of images that were skipped\n */\n- (void)imagePrefetcher:(SDWebImagePrefetcher *)imagePrefetcher didFinishWithTotalCount:(NSUInteger)totalCount skippedCount:(NSUInteger)skippedCount;\n\n@end\n\ntypedef void(^SDWebImagePrefetcherProgressBlock)(NSUInteger noOfFinishedUrls, NSUInteger noOfTotalUrls);\ntypedef void(^SDWebImagePrefetcherCompletionBlock)(NSUInteger noOfFinishedUrls, NSUInteger noOfSkippedUrls);\n\n/**\n * Prefetch some URLs in the cache for future use. ", "Images are downloaded in low priority.", "\n */\n@interface SDWebImagePrefetcher : NSObject\n\n/**\n * The web image manager\n */\n@property (strong, nonatomic, readonly) SDWebImageManager *manager;\n\n/**\n * Maximum number of URLs to prefetch at the same time. ", "Defaults to 3.", "\n */\n@property (nonatomic, assign) NSUInteger maxConcurrentDownloads;\n\n/**\n * SDWebImageOptions for prefetcher. ", "Defaults to SDWebImageLowPriority.", "\n */\n@property (nonatomic, assign) SDWebImageOptions options;\n\n@property (weak, nonatomic) id <SDWebImagePrefetcherDelegate> delegate;\n\n/**\n * Return the global image prefetcher instance.", "\n */\n+ (SDWebImagePrefetcher *)sharedImagePrefetcher;\n\n/**\n * Assign list of URLs to let SDWebImagePrefetcher to queue the prefetching,\n * currently one image is downloaded at a time,\n * and skips images for failed downloads and proceed to the next image in the list\n *\n * @param urls list of URLs to prefetch\n */\n- (void)prefetchURLs:(NSArray *)urls;\n\n/**\n * Assign list of URLs to let SDWebImagePrefetcher to queue the prefetching,\n * currently one image is downloaded at a time,\n * and skips images for failed downloads and proceed to the next image in the list\n *\n * @param urls list of URLs to prefetch\n * @param progressBlock block to be called when progress updates; \n * first parameter is the number of completed (successful or not) requests, \n * second parameter is the total number of images originally requested to be prefetched\n * @param completionBlock block to be called when prefetching is completed\n * first param is the number of completed (successful or not) requests,\n * second parameter is the number of skipped requests\n */\n- (void)prefetchURLs:(NSArray *)urls progress:(SDWebImagePrefetcherProgressBlock)progressBlock completed:(SDWebImagePrefetcherCompletionBlock)completionBlock;\n\n/**\n * Remove and cancel queued list\n */\n- (void)cancelPrefetching;\n\n\n@end\n" ]

{ "pile_set_name": "Github" }

[ 0.0007878325995989144, 0.0005720944027416408, 0.001384118222631514, 0.003698409767821431, 0.005060996860265732, 0.0005862921825610101, 0.0007256060489453375, 0.0007386952638626099, 0.0027041411958634853, 0.001238228753209114, 0.0009720390662550926, 0.0031816877890378237 ]

[ "G-CSF increases mesenchymal precursor cell numbers in the bone marrow via an indirect mechanism involving osteoclast-mediated bone resorption.", "\nDuring the course of studies to investigate whether MPC circulate in response to G-CSF, the agent most frequently used to induce mobilization of hematopoietic progenitors, we observed that while G-CSF failed to increase the number of MPC in circulation (assayed in vitro as fibroblast colony-forming cells, CFU-F), G-CSF administration nevertheless resulted in a time-dependent increase in the absolute number of CFU-F within the BM, peaking at Day 7. ", "Treatment of BM cells from G-CSF-treated mice with hydroxyurea did not alter CFU-F numbers, suggesting that the increase in their numbers in response to G-CSF administration is not due to proliferation of existing CFU-F. Given previous studies demonstrating that G-CSF potently induces bone turnover in mice, we hypothesized that the increase in CFU-F may be triggered by the bone resorption that occurs following G-CSF administration. ", "In accord with this hypothesis, administration of an inhibitor of osteoclast differentiation, osteoprotegerin (OPG), prevented the increase of CFU-F numbers induced by G-CSF. ", "In conclusion, these data indicate that the cytokine treatment routinely used to mobilize hematopoietic stem cells could provide a readily applicable method to induce in vivo expansion of MPC for clinical applications." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0023672408424317837, 0.0006563947536051273, 0.0008255415013991296, 0.0009574671857990324, 0.0006416729302145541 ]

[ "Every developed nation in the world has systems in place to detect the detonation of nuclear weapons. ", "There is no way we would have been able to do such a thing without detection or witnesses, and no way we would have taken such a risk.", "\n\nAll I'm saying is the theory that the US dropped nuclear weapons in Afghanistan is so far fetched, it's simply unbelievable. ", "Look at the proximity of the surrounding countries. ", "They have radiation detectors, other spy systems, and early warning systems.", "\n\nDo you honestly think, that CHINA would not be breathing down our throats if they thought, for 1 second, that the US employed a nuclear device that close to their country?", "\n\nOr India, Russia?", "\n\nPlease, this is the most unbelievable story I've ever read. ", "It's almost as bad as the \"holocaust\".", "\n\nAgreed.", "\n\nTake, for example, how the North Korean underground nuclear test was verified; isotopes in the atmosphere and the specific signature of a nuclear explosion on a seismograph. ", "So someone somewhere would have known we thumped a nuke. ", "And they would not have been happy about it one bit.", "\n\nBesides, the same objective can and was accomplished via penetrating bombs like the BLU-109 2000 pounder. ", "There was also a new type of explosive developed for this very reason (cave and bunker busting) called thermobaric.", "\n\nThere is one thing that the US does indeed leave behind radiation wise and that is the use of a depleted uranium round (as forumwarrior87 eluded to).", "\n\nIt's certainly possible, we all saw the wiki-leaks videos and were appalled. ", "If they can cover that up surely they could cover up a nuke in the mountains, how would these villagers know the difference between a distant bombing or a nuke and even if they did how would they report such an incident?", "\n\nmost of those villagers don't even know what 9/11 is all about let alone have knowledge of nuclear devices, they are truly living in a different age.", "\n\nThis cartoon is a true story and documented!", "\n\nThe Afghans are stone age primitives with no concept of modern technology.", "\n\nI beilve it's possable, I won't put it past the US/Jew gov that they would use a nuke.", "\n\nMaybe it was a Fusion bomb, from my very limited understand of nuclionic weapons is that a fusion bomb would do the same damage of a fission bomb but without as much radiation, I also hear tell that the US was salting their nukes with anti-matter?", "\n\nAll I know is that the US probable has some many black boxs of advanced weapons that they have on ice untill they are needed or that the Jewish scum decied that the US *Needs* to use them.", "\n\nAll I'm saying is the theory that the US dropped nuclear weapons in Afghanistan is so far fetched, it's simply unbelievable. ", "Look at the proximity of the surrounding countries. ", "They have radiation detectors, other spy systems, and early warning systems.", "\n\nDo you honestly think, that CHINA would not be breathing down our throats if they thought, for 1 second, that the US employed a nuclear device that close to their country?", "\n\nOr India, Russia?", "\n\nPlease, this is the most unbelievable story I've ever read. ", "It's almost as bad as the \"holocaust\".", "\n\nYeah, there's no way that such uses could have been hidden... I mean, we're talking about nuclear weapons here, even a test is widespread knowledge... actual combat usage would be all over the news. ", "It's the kind of thing that even if they tried to suppress would still eventually come out into the open. ", "The fact that we haven't heard about this until now from this one source leads me to believe that it's bogus.", "\n\nI beilve it's possable, I won't put it past the US/Jew gov that they would use a nuke.", "\n\nMaybe it was a Fusion bomb, from my very limited understand of nuclionic weapons is that a fusion bomb would do the same damage of a fission bomb but without as much radiation, I also hear tell that the US was salting their nukes with anti-matter?", "\n\nAll I know is that the US probable has some many black boxs of advanced weapons that they have on ice untill they are needed or that the Jewish scum decied that the US *Needs* to use them.", "\n\nYou don't seem to know much about nuclear weapons technology... only various conspiracies and hearsay with apparently no basis whatsoever." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0011095722438767552, 0.0008322781068272889, 0.0008492140332236886, 0.000614022312220186, 0.0007612151675857604, 0.027835750952363014, 0.0007465158123522997, 0.0005974427331238985, 0.04518568888306618, 0.0006538432789966464, 0.0006216801702976227, 0.17992031574249268, 0.0008655565325170755, 0.0008351463475264609, 0.0008515241788700223, 0.0006154043949209154, 0.0017310467083007097, 0.0011076898081228137, 0.0008029675809666514, 0.0006817458779551089, 0.001397590385749936, 0.24390263855457306, 0.001041376031935215, 0.22295692563056946, 0.0008492140332236886, 0.000614022312220186, 0.0007612151675857604, 0.027835750952363014, 0.0007465158123522997, 0.0005974427331238985, 0.04518568888306618, 0.0007428178214468062, 0.0011157618137076497, 0.0011941452976316214, 0.24390263855457306, 0.001041376031935215, 0.22295692563056946, 0.0009014565730467439 ]

[ "1. ", "Field of the Invention\nThe present invention relates to a golf club, particularly to an improvement of a construction of a club-head for a golf club having a hollow inner shell and an outer shell which covers the outer surface of the inner shell.", "\n2. ", "Description of the Related Arts\nJapanese Unexamined Patent Publication No. ", "60-122581 discloses a club-head for a golf club wherein the club-head body comprises a hollow inner shell and an outer shell which covers the outer surface of the inner shell. ", "The inner shell is in two substantially cup-shaped halves, which are joined at their peripheral openings. ", "After the inner shell joined in such a way is covered with the fiber-reinforced material over the outer surface thereof, the inner shell is received in a mold and is subjected to heat press molding, and thus the inner shell is integrally joined with the outer shell of fiber-reinforced material.", "\nIn the above-mentioned conventional construction of a club-head, since the compression strength of the hollow inner shell formed by joining two halves is comparatively weak against external force, particularly the external pressure applied to the outer surface of the inner shell during the heat press molding, the inner shell may fracture at the boundary surface thereof." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0009391900966875255, 0.0006225900142453611, 0.001185585861094296, 0.0006003286689519882, 0.0006973445997573435, 0.0006523366901092231, 0.0006347827147692442, 0.0006346394075080752 ]

[ "Colony-Stimulating Factor-1 Antibody Lacnotuzumab in a Phase 1 Healthy Volunteer Study and Mechanistic Investigation of Safety Outcomes.", "\nThe colony-stimulating factor-1 (CSF-1) receptor pathway has been implicated in a variety of diseases, and CSF-1-dependent mechanisms are also involved in bloodborne protein clearance. ", "Lacnotuzumab is a novel, high-affinity, humanized, anti-CSF-1 monoclonal antibody that prevents CSF-1-mediated receptor activation. ", "This phase 1, two-part, double-blind study in healthy volunteers assessed the safety and tolerability of lacnotuzumab and its pharmacokinetics (PK) and pharmacodynamic properties. ", "Part A (n = 36) was a single, ascending-dose assessment of eight lacnotuzumab doses (0.01-20 mg/kg); in part B (n = 16), lacnotuzumab was administered at either 5 or 10 mg/kg. ", "In each study cohort, individuals were randomized 3:1 to lacnotuzumab or placebo. ", "Lacnotuzumab was generally well tolerated. ", "At higher doses (10 and 20 mg/kg), creatine kinase (CK) elevations (>5× the upper limit of normal, but asymptomatic and reversible) and mild transient periorbital swelling were reported. ", "Most adverse events (AEs) were low-grade, no unexpected or novel AEs were observed, and there were no discontinuations for AEs. ", "Free, unbound lacnotuzumab serum concentration-time profiles showed nonlinear PK across doses from 0.01 to 20 mg/kg, with faster apparent elimination at lower doses or concentrations; this finding was consistent with apparent target-mediated drug disposition. ", "Lacnotuzumab also showed dose-dependent, on-target effects on multiple downstream biomarkers. ", "Preclinical investigations of the CK elevation and periorbital swelling observed after lacnotuzumab administration suggest that these are reversible, nonpathological events linked to inhibition of the CSF-1 pathway. ", "These data support further evaluation of lacnotuzumab in clinical studies." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005918321548961103, 0.0006387353059835732, 0.0010787853971123695, 0.000660904566757381, 0.000649588939268142, 0.0005679998430423439, 0.0006656023906543851, 0.0006897456478327513, 0.0006666991394013166, 0.0005877208313904703, 0.0006905457121320069, 0.0006140832556411624, 0.0005499172257259488 ]

[ "Dual diagnosis: prevalence of psychiatric disorders in a large state residential facility for individuals with mental retardation.", "\nThe prevalence of psychiatric disorders in a large residential population (N = 1,273) of individuals with mental retardation was examined. ", "We found that the point prevalence rate for dual diagnoses based on DSM-III-R criteria was 15.55% (n = 198). ", "Rates for specific psychiatric disorders were also provided by level of retardation and sex. ", "Results were compared to similar epidemiological studies and discussed in light of factors hypothesized to affect diagnosis of psychiatric disorders among individuals with mental retardation." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.4774024784564972, 0.12528780102729797, 0.000613889773376286, 0.39340558648109436, 0.15190985798835754 ]

[ "{-# OPTIONS_GHC -Wall #-}\n{-# LANGUAGE OverloadedStrings #-}\nmodule Develop.", "Generate.", "Index\n ( generate\n )\n where\n\n\nimport Control.", "Monad (filterM)\nimport qualified Data.", "ByteString.", "Builder as B\nimport qualified Data.", "List as List\nimport qualified Data.", "Map as Map\nimport qualified System.", "Directory as Dir\nimport System.", "FilePath ((</>), splitDirectories, takeExtension)\n\nimport qualified BackgroundWriter as BW\nimport qualified Develop.", "Generate.", "Help as Help\nimport qualified Elm.", "Details as Details\nimport qualified Elm.", "Outline as Outline\nimport qualified Elm.", "Package as Pkg\nimport qualified Elm.", "Version as V\nimport qualified Json.", "Encode as E\nimport Json.", "Encode ((==>))\nimport qualified Reporting\nimport qualified Stuff\n\n\n\n-- GENERATE\n\n\ngenerate :: FilePath -> IO B.Builder\ngenerate pwd =\n do flags <- getFlags pwd\n return $ Help.makePageHtml \"Index\" (Just (encode flags))\n\n\n\n-- FLAGS\n\n\ndata Flags =\n Flags\n { _root :: FilePath\n , _pwd :: [String]\n , _dirs :: [FilePath]\n , _files :: [File]\n , _readme :: Maybe String\n , _outline :: Maybe Outline.", "Outline\n , _exactDeps :: Map.", "Map Pkg.", "Name V.Version\n }\n\n\ndata File =\n File\n { _path :: FilePath\n , _runnable :: Bool\n }\n\n\n\n-- GET FLAGS\n\n\ngetFlags :: FilePath -> IO Flags\ngetFlags pwd =\n do contents <- Dir.getDirectoryContents pwd\n root <- Dir.getCurrentDirectory\n dirs <- getDirs pwd contents\n files <- getFiles pwd contents\n readme <- getReadme pwd\n outline <- getOutline\n exactDeps <- getExactDeps outline\n return $\n Flags\n { _root = root\n , _pwd = dropWhile (\".\" ", "==) (splitDirectories pwd)\n , _dirs = dirs\n , _files = files\n , _readme = readme\n , _outline = outline\n , _exactDeps = exactDeps\n }\n\n\n\n-- README\n\n\ngetReadme :: FilePath -> IO (Maybe String)\ngetReadme dir =\n do let readmePath = dir </> \"README.md\"\n exists <- Dir.doesFileExist readmePath\n if exists\n then Just <$> readFile readmePath\n else return Nothing\n\n\n\n-- GET DIRECTORIES\n\n\ngetDirs :: FilePath -> [FilePath] -> IO [FilePath]\ngetDirs pwd contents =\n filterM (Dir.doesDirectoryExist . (", "pwd </>)) contents\n\n\n\n-- GET FILES\n\n\ngetFiles :: FilePath -> [FilePath] -> IO [File]\ngetFiles pwd contents =\n do paths <- filterM (Dir.doesFileExist . (", "pwd </>)) contents\n mapM (toFile pwd) paths\n\n\ntoFile :: FilePath -> FilePath -> IO File\ntoFile pwd path =\n if takeExtension path == \".elm\" then\n do source <- readFile (pwd </> path)\n let hasMain = List.isInfixOf \"\\nmain \" source\n return (File path hasMain)\n else\n return (File path False)\n\n\n\n-- GET OUTLINE\n\n\ngetOutline :: IO (Maybe Outline.", "Outline)\ngetOutline =\n do maybeRoot <- Stuff.findRoot\n case maybeRoot of\n Nothing ->\n return Nothing\n\n Just root ->\n do result <- Outline.read root\n case result of\n Left _ -> return Nothing\n Right outline -> return (Just outline)\n\n\n\n-- GET EXACT DEPS\n\n\n-- TODO revamp how `elm reactor` works so that this can go away.", "\n-- I am trying to \"just get it working again\" at this point though.", "\n--\ngetExactDeps :: Maybe Outline.", "Outline -> IO (Map.", "Map Pkg.", "Name V.Version)\ngetExactDeps maybeOutline =\n case maybeOutline of\n Nothing ->\n return Map.empty\n\n Just outline ->\n case outline of\n Outline.", "App _ ->\n return Map.empty\n\n Outline.", "Pkg _ ->\n do maybeRoot <- Stuff.findRoot\n case maybeRoot of\n Nothing ->\n return Map.empty\n\n Just root ->\n BW.withScope $ \\scope ->\n do result <- Details.load Reporting.silent scope root\n case result of\n Left _ ->\n return Map.empty\n\n Right (Details.", "Details _ validOutline _ _ _ _) ->\n case validOutline of\n Details.", "ValidApp _ ->\n return Map.empty\n\n Details.", "ValidPkg _ _ solution ->\n return solution\n\n\n\n-- ENCODE\n\n\nencode :: Flags -> E.Value\nencode (Flags root pwd dirs files readme outline exactDeps) =\n E.object\n [ \"root\" ==> encodeFilePath root\n , \"pwd\" ==> E.list encodeFilePath pwd\n , \"dirs\" ==> E.list encodeFilePath dirs\n , \"files\" ==> E.list encodeFile files\n , \"readme\" ==> maybe E.null E.chars readme\n , \"outline\" ==> maybe E.null Outline.encode outline\n , \"exactDeps\" ==> E.dict Pkg.toJsonString V.encode exactDeps\n ]\n\n\nencodeFilePath :: FilePath -> E.Value\nencodeFilePath filePath =\n E.chars filePath\n\n\nencodeFile :: File -> E.Value\nencodeFile (File path hasMain) =\n E.object\n [ \"name\" ==> encodeFilePath path\n , \"runnable\" ==> E.bool hasMain\n ]\n" ]

{ "pile_set_name": "Github" }

[ 0.000792699633166194, 0.0006855655228719115, 0.0006589959957636893, 0.0007005178485997021, 0.0035401545464992523, 0.0006204172968864441, 0.0006238447967916727, 0.0006436426774598658, 0.0007452064892277122, 0.0006287702708505094, 0.0006855655228719115, 0.0005713669233955443, 0.0005740527994930744, 0.0005948316538706422, 0.0006180834025144577, 0.0007553383475169539, 0.0009484481415711343, 0.0007741496083326638, 0.0007265573949553072, 0.0021510780788958073, 0.0062318406999111176, 0.0034177061170339584, 0.0011615692637860775, 0.0008775104652158916, 0.0017798726912587881, 0.0006026776973158121, 0.0006882465677335858, 0.000651292153634131, 0.0021510780788958073, 0.0009129134123213589, 0.0007441856432706118, 0.009935358539223671, 0.0006808586185798049, 0.0007150201126933098, 0.0030514521058648825 ]

[ "Elementary recommendations from Jackie Chitwood and Patty Thiets, librarians in St. Paul Public Schoolswww.diversebooks.org\n\nFavorite titles from teachers\n\nMiddle and high school books\n“I am Malala” by Malala Yousafzai (YA and adult versions)\n“City of Djinns” by William Dalrymple\n“Beyond the Beautiful Forevers” by Katherine Boo\n“In the Country of Men” by Hisham Matar\n“American Smooth” by Rita Dove\n“The Bean Trees” by Barbara Kingsolver\n“The Kite Runner” and “A Thousand Splendid Suns” by Khaled Hosseini\n“One Hundred Years of Solitude” by Gabriel Garcia Marquez\n“Their Eyes Were Watching God” by Zora Neale Hurston\n“Kindred” by Octavia Butler\n“Fences” and “The Piano Lesson” by August Wilson\n“Americanah,” “Half A Yellow Sun” and “Purple Hibiscus” by Chimamanda Ngozi Adichie\n“The Latehomecomer” by Kao Kalia Yang\n“The Buddha in the Attic” by Julie Otsuka\n“A Different Pond” by Bao Phi\n“American Born Chinese” by Gene Luen Yang\n“Beloved” by Toni Morrison\n“The Autobiography of Malcolm X” by Alex Haley and Malcolm X\n“The Arrival” by Shaun Tan\n“Native Son” by Richard Wright\n“The Absolutely True Diary of a Part-Time Indian” by Sherman Alexie\n“In the Language of Miracles” by Rajia Hassib\n“The Undergrown Railroad” by Colson Whitehead\n“Homegoing” by Yaa Gyasi\n“Paradise of the Blind” by Dương Thu Hương\n“A Long Way Gone” by Ishmael Beah\n“The Farming of Bones” by Edwidge Danticat\n“Like Water for Chocolate” by Laura Esquivel\n“A Place Where the Sea Remembers” by Sandra Benitez\n“Born a Crime: Stories from a South African Childhood” by Trevor Noah\n“Everything I Never Told You” by Celeste Ng\n“LaRose” by Louise Erdrich\n\nNonfiction with great historical background\n“The Warmth of Other Suns” by Isabel Wilkerson\n“The New Jim Crow” by Michelle Alexander\n“Hidden Figures” by Margot Lee Shetterly\n“The Spirit Catches You and You Fall Down” by Anna Fadiman\n“The Beautiful Struggle,” “Between the World and Me” and “We Were Eight Years in Power” by Ta-Nehisi Coates\n“Nobody: Casualties of America's War on the Vulnerable, from Ferguson to Flint and Beyond” by Marc Lamont Hill" ]

{ "pile_set_name": "Pile-CC" }

[ 0.006045809015631676 ]

[ "Q:\n\njs.erb weird error when retrieving date\n\nI have a calendar setup where dates are displayed along a carousel and tasks can be assigned to each day. ", "I have setup a nice jquery dialog box for entering the task and I am now trying to create an ajax response. ", "Upon submitting it should send my data to the server and update the page via a create.js.erb page. ", "In order to do this I must extract the date from my @log_entry variable and use jquery to update and add that entry to the carousel entry for that specified date. ", "For some reason, however, I cannot seem to extract the date from my @log_entry variable used to save to the database. ", "When I do a simple test like alert(<%= @log_entry.date %>); it returns a weird number that Im asuming represents a year, 1978 which seems to decrease by one for every day I move forward on the carousel. ", "Here is the code in question: \nController:\ndef create\n @athlete = current_user\n @log_entry = @athlete.log_entries.create(params[:log_entry]) \n respond_to do |format|\n format.html { redirect_to log_entries_path }\n format.js\n end\nend\n\ncreate.js.erb\nalert(<%= @log_entry.date %>);\n\nI have no clue as to why it would alert somthing like 1978, where could it possibly get that number? ", "In the console after I save it and enter LogEntry.last.date.to_s I get \"2012-01-03\". ", "Watching the server everything seems to make sense as well. ", "This seems to be the only attribute that doesn't display properly because when I put this instead: alert(<%= @log_entry.id %>); I get the correct id for that entry. ", "If it helps at all I noticed up intill Dec 31st the year decreases by one untill finally reaching 1968 but then when I change to Jan 1st it jumps to 2010 and then continues to decrease by one each day. ", "\nAny Ideas? ", "I am using rails 3.0.0\nJust some further info if it helps the server log for saving an entry:\nParameters: {\"commit\"=>\"Save\", \"log_entry\"=>{\"workouts_attributes\"=>{\"0\"=>\n{\"time_of_day\"=>\"AM\", \"summary\"=>\"d\", \"workout_times_attributes\"=>{\"0\"=>\n{\"duration\"=>\"0:00\", \"zone\"=>\"1\", \"_destroy\"=>\"false\"}}}}, \"date\"=>\"Wed Dec 28 00:00:00\n -0700 2011\"}, \"authenticity_token\"=>\"yKFf4cWujAaNITVthwX9Y7StXJc9eVjdT2v8DStD1C8=\",\n \"utf8\"=>\"\\342\\234\\223\"}\n Athlete Load (0.3ms) SELECT \"users\".* ", "FROM \"users\" WHERE (\"users\".", "\"type\" = 'Athlete') \nAND (\"users\".", "\"id\" = 1) LIMIT 1\n SQL (0.5ms) INSERT INTO \"log_entries\" (\"athlete_id\", \"created_at\", \"date\", \"feel\", \n\"updated_at\") VALUES (1, '2011-12-29 03:22:36.337600', '2011-12-28', NULL, '2011-12-29 \n03:22:36.337600')\n\nThanks,\nG\n\nA:\n\nI think the alert function is confused about how to render the date properly. ", " Try first passing it into a JavaScript Date object:\nvar date = new Date(<%= @log_entry.date %>);\nalert(date);\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0007638882379978895, 0.000609008886385709, 0.0006727130385115743, 0.0005768242408521473, 0.0005915772053413093, 0.0007344931364059448, 0.0007924779783934355, 0.0006581678171642125, 0.0005675447755493224, 0.0006724277627654374, 0.0005516412202268839, 0.0007957352208904922, 0.0010681806597858667, 0.0006730711902491748, 0.000597963691689074, 0.0006155278533697128, 0.0007972793537192047 ]

[ "Don Harris (Australian footballer)\n\nDon Harris (27 June 1905 – 11 August 1979) was an Australian rules footballer who played with Richmond and Collingwood in the Victorian Football League (VFL).", "\n\nHarris, a defender, played in three successive grand finals for Richmond but was never a member of a premiership team. ", "The Burnley recruit was a back pocket in the 1926, 1927 and 1928 VFL Grand Finals.", "\n\nHe spent the last two seasons of his league career at Collingwood. ", "His seven votes in the 1932 Brownlow Medal were bettered by only one teammate, Syd Coventry. ", "The year ended with a preliminary final loss and he then retired for business reasons. ", "He however continued participating in amateur football, as the playing coach of Kew in the Sub-District Football Association.", "\n\nReferences\n\nCategory:1905 births\nCategory:Australian rules footballers from Victoria (Australia)\nCategory:Richmond Football Club players\nCategory:Collingwood Football Club players\nCategory:Kew Football Club players\nCategory:1979 deaths" ]

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

[ 0.0010052837897092104, 0.0009041817975230515, 0.0006497385329566896, 0.0009613462025299668, 0.0007010203553363681, 0.0012625494273379445, 0.000845600210595876, 0.000726021418813616 ]

[ "Today’s free nitrates in water testing announcement came from Benton County (in Minnesota) where a County agency has partnered with a State agency to offer free nitrate level testing to folks attending the Benton County fair in Sauk Rapids, MN.", "\n\nThe Benton Soil & Water Conservation District and Minnesota Department of Agriculture are conducting the nitrate clinic from 11:30 a.m.-7 p.m. Aug. 1 and 2. ", "The clinic will be at the SWCD’s fair booth in the Education Building.", "\n\nNitrate is a common contaminant, particularly in shallow wells, dug wells and wells with damaged or leaking casings. ", "Nitrates can come from fertilizers, animal waste and human sewage. ", "It is tasteless, odorless and colorless. ( ", "source )\n\nNitrates’ undetectable nature (except by testing. ", "see nitrate/nitrite test strips) makes it a potentially dangerous well and drinking water contaminant. ", "Unborn children, infants and small children can become very ill and possibly even die from prolonged exposure to elevated nitrate levels in their drinking water (see Blue Baby Syndrome).", "\n\nNitrate’s effects on older children and adults remains unclear at this time but some health experts have tentatively linked prolonged exposure to higher than normal nitrate levels with serious illnesses like lymphoma.", "\n\nMore free nitrate testing in Minnesota\n\nFor those not able to get out to the Benton County Fair to take advantage of the free nitrate testing the Benton Benton Soil & Water Conservation District located at 14 Second Ave. ", "W in Foley, MN offers local residents free nitrate testing during office hours during the week. ", "Interested parties may call 968-5300, Extension 3 or email Adam@soilandwater.org.", "\n\nTesting for nitrates elsewhere\n\nAs we learn of more free and/or discounted well water testing offers we will post them on the site. ", "In the meantime, if you would like to perform testing of your well water yourself we recommend the WaterWorks Nitrate & Nitrite Test Strips currently available in our Water Test Kit Store. ", "While not as awesome a deal as free testing, you can get 50 tests for around $14 and you can get the water test kit you need in just a few days.", "\n\nContributors\n\nMeta\n\nMultipure Water Filters\n\nOnce you have properly tested your drinking water and learned what quality issues may need attention, then you can begin your search for the right water treatment system to address your unique water quality concerns!" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006061037420295179, 0.0006153337308205664, 0.0007796059944666922, 0.0010700194397941232, 0.23553374409675598, 0.0017402754165232182, 0.000641773222014308, 0.00080574193270877, 0.027656789869070053, 0.0020849888678640127, 0.0006431748042814434, 0.0005544724990613759, 0.0005509202601388097, 0.0005400035879574716, 0.0005878538941033185, 0.0006553892744705081, 0.0006120597245171666 ]

[ "B. stood at the right side of Ezra, when the law was read to the people (1 Esdras 9:43). ", "Compare Maaseiah (Nehemiah 8:7). ", "the Valley of Rephaim where David obtained a signal victory over the Philistines; it was higher than Jerusalem for David asked, \"Shall I go up against the Philis?\" (", "2 Samuel 5:20; 1 Chronicles 14:11). ", "The exact site is unknown, but if the Vale of Rephaim is el Beka`a, the open valley between Jerusalem and Mar Elias, then Baal-perazim would probably be the mountains to the East near what is called the \"Mount of Evil Counsel\" (see JERUSALEM). ", "The Mount Perazim of Isaiah 28:21 would appear to be the same spot." ]

{ "pile_set_name": "Pile-CC" }

[ 0.000621831277385354, 0.0006831868668086827, 0.0013945106184110045, 0.0009678657515905797, 0.0008106225868687034, 0.0006668277783319354 ]

[ "Early childhood sexual abuse is an important public health problem that affects 16% of women before their 18th birthday and leads to chronic symptoms of posttraumatic stress disorder (PTSD) in as many as a third of women. ", "Preclinical and clinical research has established a network of brain regions that are sensitive to stress and mediate PTSD symptoms, including decreased function in the hippocampus and anterior cingulate/medial prefrontal cortex, and increased function in the amygdala. ", "During prior funding periods in women with early abuse related PTSD we have shown smaller hippocampal volume, a failure of hippocampal activation with declarative memory tasks, deficits in verbal declarative memory on neuropsychological testing, decreased anterior cingulate, medial prefrontal and hippocampal function, and increased amygdala function during fear acquisition, as well as smaller anterior cingulate volume. ", "Little is known about the effects of treatment for PTSD on the brain. ", "Such information may be useful in the development of better treatments for this disorder. ", "Studies in animals have shown that treatment with antidepressants, including selective serotonin reuptake inhibitors (SSRI), promote neurogenesis in the hippocampus, which may even represent the mechanism of treatment response for these medications. ", "Our pilot data has shown a 5% increase in hippocampal volume and improvements in neuropsychological testing of memory in patients with PTSD treated with paroxetine, as well as increases in medial temporal NAA. ", "The current project assesses the effects of paroxetine on memory, brain structure and function in women with early childhood abuse related PTSD. ", "Women with PTSD undergo baseline assessment with neuropsychological testing of memory, magnetic resonance imaging (MRI) for assessment of hippocampal volume and NAA, and high resolution positron emission tomography (PET) with PET O-15 water during verbal declarative memory and traumatic memory tasks. ", "Women are then treated in a randomized double- blind fashion with paroxetine or placebo on a flexible dose schedule for three months, followed by a repeat of these assessments. ", "All subjects then receive open label paroxetine for nine months followed by a repeat of all assessments. ", "We hypothesize that paroxetine will result in an improvement in memory function, increased hippocampal volume and NAA, and increased frontal and hippocampal function" ]

{ "pile_set_name": "NIH ExPorter" }

[ 0.03507738932967186, 0.0012418576516211033, 0.002646244829520583, 0.0009660719078965485, 0.0006845029420219362, 0.0011748065007850528, 0.0007384728523902595, 0.00227533676661551, 0.0030024966690689325, 0.006411714479327202, 0.0007210238836705685, 0.0014315376756712794 ]

[ "Distribution of Neuron Cell Bodies in the Intraspinal Portion of the Spinal Accessory Nerve in Humans.", "\nThe spinal accessory nerve is often identified as a purely motor nerve innervating the trapezius and sternocleidomastoid muscles. ", "Although it may contain proprioceptive neurons found in cervical spinal levels C2-C4, limited research has focused on the histology of the spinal accessory nerve. ", "The objective of the present study was to examine the spinal accessory nerve to determine if there are neuronal cell bodies within the spinal accessory nerve in humans. ", "Cervical spinal cords were dissected from eight cadavers that had previously been used for dissection in other body regions. ", "The segmental rootlets were removed to quantify the neuron cell bodies present at each spinal level. ", "Samples were embedded in paraffin; sectioned; stained with hematoxylin and eosin; and examined using a microscope at 4×, 10×, and 40× magnification. ", "Digital photography was used to image the samples. ", "Neuronal cell bodies were found in 100% of the specimens examined, with non-grossly visible ganglia found at spinal levels C1-C4. ", "The C1 spinal level of the spinal accessory nerve had the highest number of neuron cell bodies." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0007815917488187551, 0.001122591900639236, 0.0005922892596572638, 0.0006434604874812067, 0.0006224660319276154, 0.0006029049400240183, 0.0011095363879576325, 0.0005680117756128311, 0.0008615157566964626, 0.0007409559329971671 ]

[ "using System;\r\nusing System.", "Collections.", "Generic;\r\nusing System.", "Linq;\r\nusing System.", "Threading.", "Tasks;\r\nusing Microsoft.", "AspNetCore.", "Mvc;\r\n\r\nusing AspNetCorePostgreSQLDockerApp.", "Repository;\r\n\r\nnamespace AspNetCorePostgreSQLDockerApp.", "Controllers\r\n{\r\n public class HomeController : Controller\r\n {\r\n\r\n IDockerCommandsRepository _repo;\r\n\r\n public HomeController(IDockerCommandsRepository repo) {\r\n _repo = repo;\r\n }\r\n\r\n public async Task<IActionResult> Index()\r\n {\r\n //Call into PostgreSQL\r\n var commands = await _repo.", "GetDockerCommandsAsync();\r\n return View(commands);\r\n }\r\n\r\n public IActionResult About()\r\n {\r\n ViewData[\"Message\"] = \"Your application description page.\";", "\r\n\r\n return View();\r\n }\r\n\r\n public IActionResult Contact()\r\n {\r\n ViewData[\"Message\"] = \"Your contact page.\";", "\r\n\r\n return View();\r\n }\r\n\r\n // public IActionResult Error()\r\n // {\r\n // return View();\r\n // }\r\n }\r\n}\r\n" ]

{ "pile_set_name": "Github" }

[ 0.0010321233421564102, 0.0008056002552621067, 0.0007576470379717648, 0.0008255469729192555, 0.0009957521688193083, 0.0006249892176128924, 0.0011804905952885747, 0.0018639314221218228, 0.0014506004517897964, 0.0012730937451124191, 0.000860713655129075, 0.0006532534025609493, 0.0009218446211889386 ]

[ "Carl Jung’s contributions to the field of psychology still impact how psychologists, psychiatrists and other mental health workers perform their work today. ", "Born on July 26, 1975 in Switzerland, Jung was the only son of a Protestant minister and his wife and, ultimately, the only surviving child out of four children. ", "He described his childhood as lonely and spent most of his time observing people to try to understand their behavior. ", "Though a number of his family were clergymen, Jung decided not to travel that path. ", "Instead, he chased his intellectual pursuits at the University of Basel.", "\n\nEducation\n\nJung attended the university from 1895 and studied subjects ranging from archaeology, biology, paleontology, zoology and, of course, medicine. ", "He became an assistant physician in 1900 and obtained his MD in 1902 from the University of Zurich. ", "In his dissertation entitled “On the Psychology and Pathology of So-Called Occult Phenomenon”, he first presented his ideas on the wholeness of the psyche. ", "Over his lifetime, he wrote approximately 200 papers and several books. ", "He is considered one of the most prominent thinkers in the field of modern psychology.", "\n\nWord Association, Freud and Divergent Views\n\nJung’s first research study was conducted in 1904 on word association. ", "At this time, he coined the term “complex,” which refers to repressed psychic content. ", "The term is still widely used today. ", "As Jung continued his studies and wrote a number of papers, he confirmed many of Freud’s ideas. ", "In 1906 at the age of thirty, Jung sent Freud a copy of his papers on word association, and this sparked a friendship and collaboration between the two.", "\n\nThey met in 1907 and worked together for seven years until the relationship turned sour due to Jung’s divergent ideas on what drives a man to act. ", "Freud felt that men (and women) are driven by sexual impulses while Jung believed libido is not an exclusive diver in formation of human personality, while not denying the role of libido, he felt that there are other factors such as the fear of death and collective unconscious. ", "After Jung published “Psychology and the Unconscious,” which argued against some of Freud’s ideas, the two did not speak again. ", "At this time, Jung lost a number of friends and professional acquaintances. ", "Still, his time with Freud had a major impact on his later theories and fostered his fascination with the unconscious mind. ", "In 1921, he published his book “Psychological Types,” which further distinguished his ideas from those of Freud.", "\n\nPsyche: The Conscious and Unconscious Mind\n\nOne purpose of Jung’s research was to study the analogies between the contents of the conscious in Western man as compared to the cults, myths and rituals of more primitive societies. ", "His theory of symbols was based on his idea that symbols are the key to understanding human nature. ", "He found that humans used similar symbols across cultures and throughout time.", "\n\nJung proposed that the psyche exists in three parts: the ego (conscious mind), personal unconscious and collective unconscious. ", "The personal unconscious involves knowledge and concepts that we have acquired during our lifetime but have forgotten or repressed. ", "Collective unconscious refers to the collection of “memories” that are common to all mankind. ", "Jung coined the term individuation process to describe the full integration of the conscious and unconscious mind, which is essential to becoming a whole and fully developed person.", "\n\nArchetypes\n\nThese ideas concerning the psyche further formed his work on archetypes, which are the innate predispositions we have to experience and symbolize certain situations in a distinct way. (", "For example, finding a mate, having children and confronting death have elicited similar behaviors and symbols across cultures and over time). ", "These archetypes are found in all mythological and religious systems. ", "Jung also introduced an archetype of Self, which he defined as “archetype of archetypes”. ", "In his book “The stages of life” he introduced concept of individuation as the most fundamental concept defining person’s meaning of life – through individuation, which usually takes place in the second half of life, one finds his purpose in life and realizes Self archetype. ", "Jung also introduced core archetypal components affecting development of human personality and social life. ", "These archetypal components are ego, persona, shadow, anima, and animus.", "\n\nIntroversion and Extroversion\n\nThe terms introvert and extrovert also made their appearance in our everyday vernacular thanks to Jung. ", "He termed an introvert as one who is withdrawn and more interested in ideas over people. ", "Introverts prefer quiet isolated environment and take pleasure in solitary activities. ", "Extroverts are more socially-oriented people who are stimulated by other people and outside world. ", "While Jung and Jungians popularized terms introvert and extrovert, the concept was originated by French psychologist Alfred Binet, who called “knowledge we have of our inner world, our thoughts, our feelings” an introspection and “orientation of our knowledge toward the exterior world as opposed to knowledge of ourselves” an externospection.", "\n\nJung linked introversion and extraversion with four psychological functions such as thinking, feeling, intuition, and sensation to create 8 categories for psychological types. ", "He claimed that every person has one dominant psychological type (e.g. extravert thinking) that manifests in her persona and one secondary type (e.g. introvert feeling) that manifests in her shadow personality.", "\n\nThe Significance of Dreams\n\nJungian therapy deals with dreams and fantasies. ", "Dreams, Jung believed, compensate for the neglected parts of personality, specifically for secondary personality type associated with shadow and hidden in the unconscious. ", "His autobiography “Memories, Dreams, Reflections” offers deeper insight into his own dreams and the importance he feels they play in our personal development. ", "He also believed that we could ultimately understand humanity through our dreams, art, myths and philosophy.", "\n\nJung’s contributions can be found in many psychological disciplines today, with his influence far-reaching.", "\n\nAuthor Bio: Adrienne Erin is a writer interested in health, wellness, and well-being. ", "She enjoys researching the ways psychological ideas have real implications in therapy and rehab centers. ", "Follow her on Twitter at @adrienneerin to see more of her work.", "\n\nCarl Jung’s Contributions to Psychology was last modified: June 30th, 2014 by CPPN" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0013937638141214848, 0.00100212381221354, 0.000695802504196763, 0.0006325304857455194, 0.000632682116702199, 0.000613392039667815, 0.0006413745577447116, 0.0005829969886690378, 0.000675311719533056, 0.0007373926928266883, 0.0007398566813208163, 0.0007109976140782237, 0.0006141537451185286, 0.0006822427385486662, 0.0006629251292906702, 0.0006632923032157123, 0.007404303178191185, 0.0007729881326667964, 0.0006215270259417593, 0.001126665621995926, 0.0010284838499501348, 0.0008837676141411066, 0.000768448575399816, 0.0005848307628184557, 0.000854759244248271, 0.0007211142801679671, 0.0011770921992138028, 0.0006768251769244671, 0.00066931894980371, 0.0017250650562345982, 0.0006918678409419954, 0.0008250440587289631, 0.0006844980525784194, 0.000602190790232271, 0.00171580258756876, 0.033597275614738464, 0.024094050750136375, 0.13390867412090302, 0.30628833174705505, 0.0013248230097815394, 0.001897029229439795, 0.004081441089510918, 0.0006264622206799686, 0.0007444260991178453, 0.0005399982328526676, 0.0006217870977707207, 0.0005648523801937699, 0.0006815866800025105, 0.0007738132262602448, 0.0006185270613059402, 0.0006323146517388523 ]

[ "1. ", "Introduction {#sec1-sensors-15-21033}\n===============\n\nThe vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. ", "Proposed by Dantzig and Ramser in 1959, VRP is important to the fields of transportation, scheduling, distribution and logistics \\[[@B1-sensors-15-21033],[@B2-sensors-15-21033]\\]. ", "The problem involves many real-world considerations, such as time-window constraints, driver waiting costs, backhauls, layovers, *etc.* ", "The vehicle routing problem with time windows (VRPTW) has been extensively studied by many researchers from the fields of operational research, applied mathematics, network analysis, graph theory, computer applications, traffic transportation, *etc.* ", "Firstly, VRPTW is still one of the most difficult problems in combinatorial optimization, consequently presenting a great challenge. ", "Secondly, in a more practical aspect, study of this problem could provide a real opportunity to reduce the costs in the area of logistics \\[[@B3-sensors-15-21033]\\].", "\n\nThe VRPTW is a generalization of the VRP where the service for a customer starts within a given time interval, and it has been the subject of intensive research efforts for both heuristic and exact algorithms. ", "The actual solutions of VRP can be generally classified into two main categories: the exact algorithms and the heuristic algorithms. ", "The main approaches for solving VRPs are shown in [Table 1](#sensors-15-21033-t001){ref-type=\"table\"}.", "\n\nsensors-15-21033-t001_Table 1\n\n###### \n\nMain approaches for solving VRPs.", "\n\n Algorithms Remarks \n -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ------------------------------------------------------------------------------------------------------ --------------------------------------------------------------------------------------------------- -----------------------------------------------------\n The exact algorithms Branch and bound method \\[[@B4-sensors-15-21033],[@B5-sensors-15-21033]\\] The Efficiency depends on the depth of the branch and bound tree. ", " \n Set segmentation method \\[[@B6-sensors-15-21033],[@B7-sensors-15-21033]\\] Hard to determine the minimum cost for each solutions. ", " \n Dynamic programming method \\[[@B8-sensors-15-21033],[@B9-sensors-15-21033]\\] Effective to limited-size problems, hard to consider the concrete demands such as time windows. ", " \n Integer programming algorithm \\[[@B10-sensors-15-21033],[@B11-sensors-15-21033]\\] High precision, time consuming, complex. ", " \n The heuristic algorithms The traditional heuristic algorithms Savings algorithm \\[[@B12-sensors-15-21033],[@B13-sensors-15-21033]\\] Computes rapidly, hard to get the optimal solution.", "\n Sweep algorithm \\[[@B14-sensors-15-21033],[@B15-sensors-15-21033]\\] Suitable to the same number of customers for each route with few routes. ", " \n Two-phase algorithm \\[[@B16-sensors-15-21033],[@B17-sensors-15-21033]\\] Hard to get the optimal solution. ", " \n The meta-heuristic algorithms Tabu search algorithm \\[[@B18-sensors-15-21033],[@B19-sensors-15-21033],[@B20-sensors-15-21033]\\] Has the good ability of local search, but is time consuming, and depends on the initial solution. ", " \n Genetic algorithm \\[[@B13-sensors-15-21033],[@B21-sensors-15-21033]\\] Has the good ability of global search, computes rapidly, hard to obtain the global optimal solution. ", " \n Iterated local search \\[[@B22-sensors-15-21033],[@B23-sensors-15-21033]\\] Has the strength of fast convergence rate and low computational complexity. ", " \n Simulated annealing algorithm \\[[@B24-sensors-15-21033],[@B25-sensors-15-21033]\\] Slow convergence rates, carefully chosen tunable parameters. ", " \n Variable neighborhood Search \\[[@B26-sensors-15-21033],[@B27-sensors-15-21033]\\] Is suitable for large and complex optimization problems with constraints. ", " \n Ant colony algorithm \\[[@B28-sensors-15-21033],[@B29-sensors-15-21033],[@B30-sensors-15-21033]\\] Has good positive feedback mechanism, but is time consuming and prone to stagnation. ", " \n Neural network algorithm \\[[@B31-sensors-15-21033],[@B32-sensors-15-21033]\\] Computes rapidly, has slow convergence and can easily be trapped in a local optimum \n Artificial bee colony algorithm \\[[@B30-sensors-15-21033],[@B33-sensors-15-21033]\\] Achieves a fast convergence speed, is associated with the piecewise linear cost approximation. ", " \n Particle swarm optimization \\[[@B34-sensors-15-21033],[@B35-sensors-15-21033],[@B36-sensors-15-21033]\\] Is robust and has fast searching speed, brings easily premature convergence. ", " \n Hybrid algorithm \\[[@B2-sensors-15-21033],[@B8-sensors-15-21033],[@B12-sensors-15-21033],[@B20-sensors-15-21033],[@B28-sensors-15-21033],[@B37-sensors-15-21033],[@B38-sensors-15-21033]\\] Is simple with fast optimizing speed and less calculation. ", " \n\nThe exact algorithms can obtain the exact solution, but the computational effort required to solve this problem increases exponentially with the problem size. ", "The traditional heuristic algorithms often only get the approximate solution close to the optimal solution, and are limited to the smaller problems. ", "When the size of the problems increases, the solution precision of the traditional heuristic algorithms is often poor. ", "The traditional heuristic algorithms adapt to local optimization and combined with the meta-heuristic algorithms to improve the solutions \\[[@B39-sensors-15-21033]\\]. ", "For large, complex problems, only the meta-heuristic algorithms can be used due to their strong performance of global search \\[[@B18-sensors-15-21033],[@B40-sensors-15-21033],[@B41-sensors-15-21033]\\].", "\n\nThe VRPTW is a non-deterministic polynomial-time hard (NP-hard) problem. ", "Due to the complexity of the VRPTW, it is not easy to obtain an exact solution for a large problem in real time. ", "For such problems, optimal solutions are found quickly and are sufficiently accurate. ", "Usually this task is accomplished by using various meta-heuristic algorithms, which rely on some insights into the nature of the problem. ", "Particle swarm optimization (PSO) is not only superior in terms of high accuracy speed calculation, as well as its simple program, but it is also robust. ", "Nie and Yue integrated the concept of evolving individuals originally modeled by GA with the concept of self-improvement of PSO \\[[@B42-sensors-15-21033]\\]. ", "Hao *et al.* ", "proposed a modified particle swarm optimization which took the crossover between each particle's individual best position \\[[@B43-sensors-15-21033]\\]. ", "In \\[[@B44-sensors-15-21033]\\], dynamic parameterized mutation and crossover operators were combined with a PSO implementation individually and in combination to test the effectiveness of these additions. ", "In \\[[@B45-sensors-15-21033]\\], the proposed method used the concept of particles' best solution and social best solution in the PSO algorithm, followed by combining it with crossover and mutation of GA. ", "Considering the particle real encoding, linear decreasing inertia weight function and crossover operator of genetic algorithms, a combination of genetic algorithm and PSO for VRPTW is proposed that can improve the performance when computing speed to obtain the optimal solutions.", "\n\n2. ", "Vehicle Routing Problem with Time Windows (VRPTW) {#sec2-sensors-15-21033}\n====================================================\n\nIn the VRPTW, a fleet of $K$ identical vehicles supplies goods to $n$ customers. ", "All the vehicles have the same capacity $Q$. For each customer $i$, $i = 1,2,\\cdots,n$, the demand of goods $d_{i}$, the arrival time $t_{i}$, the service time $s_{i}$, the waiting time $w_{i}$ and the time window $\\lbrack b_{i},e_{i}\\rbrack$ to meet the demand in customer $i$ are all decision variables. ", "The component $s_{i}$ represents the loading or unloading service time for customer $i$, whereas $b_{i}$ describes the earliest time available for starting the service. ", "If any vehicle arrives at customer $i$ before $b_{i}$, it must wait. ", "The vehicle must start the customer service before $e_{i}$. This type of time window constraint is well known as a hard time window. ", "Each of the vehicle routes starts and finishes at the central depot. ", "Correspondingly, each customer must be visited once. ", "The locations of the depot and all customers, the minimal distance $c_{ij}$ and the travel time $t_{ij}$ between all locations are given.", "\n\nFrom the perspective of the graph theory, the VRPTW can be stated as follows: Let $G(V,A)$ be an undirected graph with a node set $V = (v_{0},v_{1},\\cdots,v_{n})$ and an arc set $A = \\left\\{ (c_{i},c_{j}):i \\neq j,c_{i},c_{j} \\in C \\right\\}$. In this graph model, $c_{0}$ is the depot, $c_{i}(i = 1,2,\\cdots,n)$ is a customer. ", "To each arc $(c_{i},c_{j})$ is associated a value $t_{ij}$ representing the travel time from $c_{i}$ to $c_{j}$. A route is defined as starting from the depot, going through a number of customers and ending at the depot; each customer $c_{i}(i = 1,2,\\cdots,n)$ must be visited exactly once. ", "There are $K$ vehicles, $V_{e} = \\left\\{ 0,1,\\cdots,K - 1 \\right\\}$. The number of routes cannot exceed $K$. Each vehicle serves a subset of customers on the route. ", "The vehicles have the same capacity $Q$. The total sum of demands of customers served by a vehicle on a route cannot exceed $Q$. The additional constraints are that the service beginning time at each node $c_{i}(i = 0,1,\\cdots,n)$ must be greater than or equal to $b_{i}$, the beginning of the time window, and the arrival time at each node $c_{i}$ must be lower than or equal to $e_{i}$, *i.e.*, the end of the time window. ", "In case the arrival time is less than $b_{i}$, the vehicle has to wait until the beginning of the time window before starting servicing the customer. ", "The goal is to find a set of routes which can guarantee each customer to be served by one vehicle within a given time interval and then satisfy the vehicle capacity constraints. ", "Furthermore, the size of the set should be less than the number of vehicles needed and the total travel distance should be minimized. ", "Moreover, the mathematical formulation of the VRPTW is presented as follows \\[[@B4-sensors-15-21033],[@B46-sensors-15-21033]\\]: $$Min\\begin{matrix}\n \\\\\n\\end{matrix}z = {\\sum\\limits_{i = 0}^{n}{\\sum\\limits_{j = 0}^{n}{\\sum\\limits_{k = 0}^{K - 1}{c_{ij}x_{ijk}}}}}$$ Subject to: $${\\sum\\limits_{k = 0}^{K - 1}{\\sum\\limits_{j = 1}^{n}x_{ijk}}} \\leq K\\begin{matrix}\n & \\\\\n\\end{matrix}(i = 0)$$ $${\\sum\\limits_{k = 0}^{K - 1}{\\sum\\limits_{j = 0}^{n}x_{ijk}}} = 1\\begin{matrix}\n & \\\\\n\\end{matrix}(i = 1,2,\\cdots n;i \\neq j)$$ $${\\sum\\limits_{i = 0}^{n}d_{i}}{\\sum\\limits_{j = 0}^{n}x_{ijk}} \\leq Q\\begin{matrix}\n & \\\\\n\\end{matrix}(i \\neq j,\\forall k \\in \\lbrack 0,K - 1\\rbrack)$$ $$t_{0} = 0$$ $$t_{i} + t_{ij} + s_{i} - M(1 - x_{ijk}) \\leq t_{j}\\begin{matrix}\n & \\\\\n\\end{matrix}(i,j \\in \\lbrack 1,n\\rbrack;i \\neq j;k \\in \\lbrack 0,K - 1\\rbrack)$$ $$b_{i} \\leq t_{i} \\leq e_{i}$$ $${\\sum\\limits_{i = 0}^{n}x_{ihk}} - {\\sum\\limits_{j = 0}^{n}x_{hjk}} = 0\\begin{matrix}\n & \\\\\n\\end{matrix}(j \\in V,k \\in V_{e})$$ where $x_{ijk}$ is 1 if vehicle $k$ travels from customer $i$ to customer $j$, and 0 otherwise. ", "$t_{i}$ denotes the time a vehicle starts services at customer $i$; $M$ is an arbitrary large constant. ", "Objective function states that the total cost is to be minimized. ", "Constraint (2) specifies that there are no more than $K$ routes going out of the depot. ", "Constraint (3) ensures that one vehicle goes into and out of a customer exactly. ", "Equation (4) is the capacity constraint. ", "The time window is assured in Equation (5), Equation (6) and Equation (7). ", "Equation (8) is the flow conservation constraints that describe the vehicle path.", "\n\n3. ", "Particle Swarm Optimization (PSO) {#sec3-sensors-15-21033}\n====================================\n\nPSO is a population-based stochastic optimization technique developed by Eberhart and Kennedy in 1995, inspired by social behavior of bird flocking or fish schooling \\[[@B34-sensors-15-21033]\\] and was first intended for simulating these organisms' social behavior. ", "It is best to imagine a swarm of birds that are searching for food. ", "When one of them finds the food, some of them will follow the first bird, while others will find other food. ", "Initially, the birds do not know where the food is, but they know at each time how far the food is. ", "Each bird will follow the one that is nearest to the food. ", "Throughout the course of preying, a bird will use its own experiences and collective information to search for food.", "\n\nIn particle swarm optimization, the particles are moved around in the search space according to a few simple formulae. ", "The position of a particle represents a candidate solution to the optimization problem at hand. ", "Each particle searches for better positions in the search space by changing its velocity according to rules originally inspired by behavioral models of flocking. ", "The movements of the particles are guided by their own best-known position in the search space as well as the entire swarm's best-known position. ", "When improved positions are discovered, these will then come to guide the movements of the swarm. ", "The process is repeated and by doing so it is hoped, but not guaranteed, that a satisfactory solution will eventually be discovered. ", "Compared with other intelligence optimization algorithms such as ant colony optimization, genetic algorithm, simulated annealing algorithm, neural network algorithm and artificial immune algorithm, PSO retains the global search strategy based on the swarm and has no individuals as in crossover and mutation. ", "In PSO, through adjusting the velocities and positions of the particles which fly through the problem space by following the current optimum particles, the optimal solution can be obtained. ", "Due to its simplicity, strong robustness, and fast optimization speed, PSO is suitable for very large and complex optimization problems with constraints. ", "At first, PSO was applied to solve continuous optimization problems; however, several applications were proposed during these years in the area of combinatorial optimization problems including shop scheduling \\[[@B47-sensors-15-21033],[@B48-sensors-15-21033]\\], project scheduling \\[[@B49-sensors-15-21033]\\], travelling sales force \\[[@B50-sensors-15-21033]\\], partitional clustering \\[[@B51-sensors-15-21033]\\], and vehicle routing \\[[@B34-sensors-15-21033],[@B52-sensors-15-21033]\\].", "\n\nPSO is one of the evolution algorithms with the characteristics of evolutionary computing and swarm intelligence. ", "Similar to other evolutionary algorithms, PSO searches for optima by evaluating individual fitness based on cooperation and competition between individuals. ", "In PSO, each individual is considered as a particle without weight and volume in $n$-dimensional search space and flies through the space with a certain speed. ", "The speed is adjusted dynamically by the individual's experience and the entire swarm's experience.", "\n\nPSO is initialized with a population of random solutions and searches for the optimal solution by updating the particle's position. ", "Each particle is the feasible solution and is designated a fitness value by the objective function. ", "Each particle keeps the track of its coordinates in the problem space which are associated with the best solution (fitness) it has achieved so far. ", "The fitness value is called $p_{best}$. When a particle takes all the population as its topological neighbors, the best position is a global best and is called $g_{best}$. Through $p_{best}$ and $g_{best}$, particles update themselves to produce the next generation of swarms.", "\n\nThe selection of fitness function depends on the research goals. ", "The fitness function to evaluate the individuals is always related to the objective function. ", "For a VRPTW, the total cost can be viewed as the fitness value. ", "The inverse of the total cost is used to represent the fitness of the individuals, and then the fitness function is defined as follows: $$f_{fitness} = \\frac{1}{z}$$\n\nIn a PSO algorithm the particles represent potential solutions to the problem, and the swarm consists of $P$ particles. ", "Each particle $p$ can be represented through $n$-dimensional vectors: the first one is defined by $X_{p}^{t} = (x_{p1}^{t},x_{p2}^{t},\\cdots,x_{pn}^{t})$ with $p = (1,2,\\cdots,P)$ that indicates the position of the particle $p$ in the searching space at the iteration $t$. The second one is $V_{p}^{t} = (v_{p1}^{t},v_{p2}^{t},\\cdots,v_{pn}^{t})$ that represents the velocity with which the particle $p$ moves. ", "The third one is $P_{best_{p}}^{t} = (p_{best_{p1}}^{t},p_{best_{p2}}^{t},\\cdots,p_{best_{pn}}^{t})$ that denotes the best position of the *p*th particle and the last one is $G_{best_{t}}^{t} = (g_{best_{p1}}^{t},g_{best_{p2}}^{t},\\cdots,g_{best_{pn}}^{t})$ that represents the global best position in the swarm until *t*th iteration. ", "The swarm is updated by the following equations: $$\\left\\{ \\begin{matrix}\n{{v^{t + 1}}_{pn} = {v^{t}}_{pn} + k_{1} \\times rand1() \\times ({p^{t}}_{best_{pn}} - {x^{t}}_{pn}) + k_{2} \\times rand2() \\times ({g^{t}}_{best_{pn}} - {x^{t}}_{pn})} \\\\\n{{x^{t + 1}}_{pn} = {x^{t}}_{pn} + {v^{t + 1}}_{pn}} \\\\\n\\end{matrix} \\right.$$ where $k_{1}$ and $k_{2}$ are acceleration coefficients, which are respectively called cognitive and social parameter; $rand1()$ and $rand2()$ are two random numbers uniformly distributed in $\\lbrack 0,1\\rbrack$. Acceleration coefficients $k_{1}$ and $k_{2}$ are positive constants to control how far a particle will move in a single iteration. ", "Low values allow particles to roam far from target regions before being tugged back, while high values result in abrupt movement towards, or past, target regions. ", "Typically, these are both set to a value of 2.0, although assigning different values to $k_{1}$ and $k_{2}$ sometimes leads to an improved performance.", "\n\nA constant, $v_{\\max}$, is used to arbitrarily limit the velocities of the particles ${v^{t}}_{pn}$ and improve the resolution of the search. ", "When $v_{\\max}$ is large $( \\geq 5)$, the velocity of the particle is large, too; it is conducive to a global search, though it may fly through the optimal solution \\[[@B53-sensors-15-21033],[@B54-sensors-15-21033],[@B55-sensors-15-21033]\\]. ", "When $v_{\\max}$ is small $( \\leq 0.3)$, the velocity of the particle is also small; it leads to a fine search in a specific region, but it is easy to fall to local optimum \\[[@B53-sensors-15-21033],[@B54-sensors-15-21033],[@B55-sensors-15-21033]\\]. ", "In a word, the search efficiency depends on $v_{\\max}$.\n\nEach particle moves in the search space with a velocity according to its own previous best solution and its group's previous best solution. ", "In Equation (10), the velocity ${v^{t + 1}}_{pn}$ consists of three parts---momentum, cognitive and social parts---respectively each term of the right side of Equation (10). ", "The momentum part denotes the previous velocity of the particle, which improves the ability of the global search. ", "The cognitive part denotes the process of learning from an individual's experience. ", "The social part denotes the process of learning from others' experience, which represents the information sharing and social cooperation between particles. ", "The balance among these parts determines the performance of a PSO algorithm. ", "Without the momentum part, the particle then moves in each step without knowledge of the past velocity. ", "Without the cognitive part, the convergence speed is fast, but can easily fall into a local optimum for a large problem size. ", "Without the social part, it is hard to get the optimal solution due to the lack of the communications among individuals.", "\n\n4. ", "The Proposed Algorithm {#sec4-sensors-15-21033}\n=========================\n\n4.1. ", "Particle Encoding {#sec4dot1-sensors-15-21033}\n----------------------\n\nEncoding is a bridge connecting a problem with an algorithm. ", "Encoding method and initial solution have a great impact on the VRP problem. ", "It is the key step to finding the appropriate encoding method for the particles and the corresponding solutions. ", "In brief, the encoding methods of PSO include real encoding, binary-encoding and integer encoding. ", "Integer encoding is easy to decode and convenient for the fitness function calculation, but it requires a lot of computing resources and tends toward premature convergence. ", "In addition, binary encoding is hard to decode. ", "Therefore, real encoding is adopted in the proposed method.", "\n\n4.2. ", "Inertia Weight Function {#sec4dot2-sensors-15-21033}\n----------------------------\n\nIn order to better control the searching and exploring abilities and improve the convergence of particle swarm algorithm, the inertia weight $\\omega$ is introduced into the velocity function. ", "Therefore, ${v^{t + 1}}_{pn}$ is changed into the following form: $${v^{t + 1}}_{pn} = \\omega{v^{t}}_{pn} + k_{1} \\times rand1() \\times ({p^{t}}_{best_{pn}} - {x^{t}}_{pn}) + k_{2} \\times rand2() \\times ({g^{t}}_{best_{pn}} - {x^{t}}_{pn})$$\n\nThe inertia weight $\\omega$ is employed to control the impact of the previous history of velocities on the current one. ", "Accordingly, the parameter $\\omega$ regulates the trade-off between the global and the local exploration abilities. ", "If $\\omega$ is high, particles can hardly change their direction and turn around, which consequently implies a larger area of exploration as well as a reluctance against convergence towards optimum. ", "On the other hand, If $\\omega$ is small, only little momentum is presented from the previous time-step, thereby leading to quick changes of direction. ", "A suitable value for the inertia weight usually contributes the balance between global and local exploration abilities and consequently results in a reduction of the number of iterations required to obtain the optimum solution.", "\n\nConsidering whether the inertia weight $\\omega$ is changed or not, the calculation methods of the inertia weight $\\omega$ include three categories: fixed-weight method, time-varying weight method and adaptive inertia weight method. ", "The fixed-weight method selects a constant value as the inertia weight $\\omega$ and is kept unchanged. ", "The fixed-weight method was originally introduced by Shi and Eberhart in \\[[@B56-sensors-15-21033]\\]. ", "The time-weight method selects an iterative relationship as the inertia weight $\\omega$ according to a selected range, which is defined as a function of time or iteration number. ", "In \\[[@B57-sensors-15-21033],[@B58-sensors-15-21033],[@B59-sensors-15-21033],[@B60-sensors-15-21033]\\], time-varying inertia weight strategies were introduced and shown to be effective in improving the fine-tuning characteristic of the PSO. ", "In \\[[@B61-sensors-15-21033],[@B62-sensors-15-21033],[@B63-sensors-15-21033]\\], the adaptive inertia weight methods used a feedback parameter to monitor the state of the algorithm and adjusted the value of the inertia weight.", "\n\nIn order to better balance the global search ability and local search capabilities, kinds of inertia weight are often used. ", "At first, a higher $\\omega$ is selected to expand the search space and converge to a region. ", "Then a smaller $\\omega$ is selected to explore the local region to obtain high accuracy solutions. ", "In this paper, the definition of inertia weight is a linear decreasing function of the number of iterations. ", "$\\omega$ is given as follows: $$\\omega = \\omega_{0} - \\frac{\\omega_{0} - \\omega_{e}}{\\eta_{\\max}}\\eta$$ where $\\omega_{0}$ is the initial value of inertia weight, $\\omega_{e}$ is the final value of inertia weight, $\\eta_{\\max}$ is the maximum number of iterations, $\\eta$ is the current number of iterations. ", "From Equation (12), by the linear function decreasing inertia weight, it is easy to obtain better global search ability and make particles enter the area around the optimal value early in the iteration process, and it is easy to obtain better local search ability and the solutions close to the optimum value late in the iteration process. ", "Since the value of the inertia weight is mainly determined based on the iteration number, this strategy is relatively simple and has fast convergence compared to other methods.", "\n\n4.3. ", "Crossover Operator of Genetic Algorithm {#sec4dot3-sensors-15-21033}\n--------------------------------------------\n\nIn order to expand the search space to obtain the optimum solution and enhance the diversity of particles, the idea of genetic algorithm is integrated into the PSO to avoid the premature convergence and local minimum value. ", "Crossover operator of genetic algorithm is introduced. ", "The crossover operators of the particle's velocity and position are given as follows: $$p_{child}^{1}({x^{t}}_{pn}) = p_{c} \\times p_{parent}^{1}({x^{t}}_{pn}) + (1 - p_{c}) \\times p_{parent}^{2}({x^{t}}_{pn})$$ $$p_{child}^{2}({x^{t}}_{pn}) = p_{c} \\times p_{parent}^{2}({x^{t}}_{pn}) + (1 - p_{c}) \\times p_{parent}^{1}({x^{t}}_{pn})$$ $$p_{child}^{1}({v^{t}}_{pn}) = \\frac{p_{parent}^{1}({v^{t}}_{pn}) + p_{parent}^{2}({v^{t}}_{pn})}{\\left| {p_{parent}^{1}({v^{t}}_{pn}) + p_{parent}^{2}({v^{t}}_{pn})} \\right|}\\left| {p_{parent}^{1}({v^{t}}_{pn})} \\right|$$ $$p_{child}^{2}({v^{t}}_{pn}) = \\frac{p_{parent}^{1}({v^{t}}_{pn}) + p_{parent}^{2}({v^{t}}_{pn})}{\\left| {p_{parent}^{1}({v^{t}}_{pn}) + p_{parent}^{2}({v^{t}}_{pn})} \\right|}\\left| {p_{parent}^{2}({v^{t}}_{pn})} \\right|$$ where $p_{child}$ represents the offspring of the particle, $p_{parent}$ represents the parent of the particle, $p_{c}$ represents the crossover probability. ", "$p_{c}$($p_{c} \\in \\lbrack 0,1\\rbrack$) is a random number. ", "Based on the trial and error, 0.2 was found to be a suitable value for $p_{c}$. The two parents are combined to produce two new offspring. ", "If the fitness of offspring is more than the fitness of parents, the offspring will be selected to replace the parents; otherwise, the offspring are discarded.", "\n\n4.4. ", "The Proposed Algorithm Flow {#sec4dot4-sensors-15-21033}\n--------------------------------\n\nThe flow of the proposed algorithm is shown in [Figure 1](#sensors-15-21033-f001){ref-type=\"fig\"}. ", "In this flow, the parameters are set in step (1), and the particles are initialized in step (2). ", "Its position is decoded in step (3), its corresponding fitness value is evaluated in step (4), its cognitive and social information is updated in step (5), and then moved by step (6). ", "Step (7) is the controlling step for repeating or stopping the iteration. ", "Step (8) generates a new set of the population. ", "Note that the improvements of this flow from the original PSO take place in step (3), which uses the real encoding method to decode the route in addition to step (6), which introduces a linear decreasing function of the number of iterations, and step (8), which is combined with the crossover operator of genetic algorithm. ", "The proposed algorithm steps are given as follows:\n\n{#sensors-15-21033-f001}\n\n1. ", " Parameters setting. ", "Define the parameters: acceleration coefficients $k_{1}$ and $k_{2}$, the maximum number of iterations $\\eta_{\\max}$, the initial value of inertia weight $\\omega_{0}$, the final value of inertia weight $\\omega_{e}$, a random number $p_{c}$, the number of the particles $P$, the maximum velocities of the particles $v_{\\max}$.\n\n2. ", " Population initiation. ", "Initialize $P$ particles as a population, generate the *p*th particle with random position ${x^{0}}_{pn}$, velocity ${v^{0}}_{pn}$, and personal best $p_{best_{pn}}^{0} = {x^{0}}_{pn}$. Set iteration $\\eta = 0$.\n\n3. ", " Particle encoding. ", "According to the particle encoding rules, for $i = 1,2,\\cdots,p$, decode ${x^{t}}_{pn}$ to a set of route ${R^{t}}_{pn}$.\n\n4. ", " Fitness evaluation. ", "According to Equation (1), compute $z$, and then evaluate $f_{fitness}$ through Equation (9).", "\n\n5. ", " $p_{best}$ and $g_{best}$ updating. ", "Compute $p_{best_{pn}}^{t}$ and $g_{best_{pn}}^{t}$. If $p_{best_{pn}}^{t} < p_{best}$, update $p_{best} = p_{best_{pn}}^{t}$. If $g_{best_{pn}}^{t} < g_{best}$, update $g_{best} = g_{best_{pn}}^{t}$.\n\n6. ", " Particles updating. ", "Update the velocity and the position of each *p*th particle according to Equation (10).", "\n\n7. ", " Termination judgment. ", "If the stopping criterion is met, go to step (9). ", "Otherwise, $\\eta = \\eta + 1$ and go to step (8). ", "The stopping criterion is that $\\eta \\geq \\eta_{\\max}$ or finding a better solution. ", "A better solution means that the hierarchical cost objective value is better than that of the best solution found so far.", "\n\n8. ", " Crossover operator. ", "Generate random number $p_{c}$. According to Equations (13)--(16), generate a new set of population. ", "Then return to step (3).", "\n\n9. ", " Outputting the optimal solution. ", "Decode $g_{best}$ as the best set of vehicle route $R$ and output the optimal solution $R$.\n\n5. ", "Experimental Results {#sec5-sensors-15-21033}\n=======================\n\nIn order to evaluate the performance of the proposed algorithm, we implemented the algorithm in Visual C\\# under Microsoft Windows-XP on a PC with Intel P4 4 GHz CPU and 2 GB RAM. ", "The VRPTW benchmark problems of Solomon, which have been the most commonly chosen to evaluate and compare all algorithms, are tested in this paper.", "\n\n5.1. ", "Solomon Benchmark Problems {#sec5dot1-sensors-15-21033}\n-------------------------------\n\nIt is well known that Solomon Benchmark problems are the widely used standard test set for VRPTW. ", "Solomon Benchmark derives from the website \\[[@B64-sensors-15-21033]\\]. ", "The Solomon test set consists of 56 problem instances for each dimension category problem, *i.e.*, 25, 50 and 100 customers. ", "Each of these instances comprises 100 customers. ", "The location of the depot and the customers are given as integer values from the range $0,1,\\cdots,100$ in a Cartesian coordinate system. ", "The distance between two customers is the simple Euclidean distance. ", "It is assumed that the travel times are equal to the corresponding Euclidean distances between the customer locations. ", "One unit of time is necessary to run one unit of distance by any vehicle. ", "Different capacity constraints are considered for the vehicle in each class of instance, as well as the demands from the customers.", "\n\nThe test problems are grouped into six problem types: R1, R2, RC1, RC2, C1, and C2, each containing 8 to 12 instances. ", "In R1 and R2, the customer locations are generated randomly in a given area according to a uniform distribution. ", "C1 and C2 have customers located in clusters. ", "RC1 and RC2 contain a mix of randomly distributed and clustered customers. ", "R1, C1 and RC1 have narrow time windows and the vehicles have only small capacities. ", "Therefore, each vehicle serves only a few customers. ", "In contrast, R2, C2 and RC2- have wider windows and the vehicles have higher capacities. ", "Each vehicle supplies more customers and therefore, compared to the type 1 problems, fewer vehicles are needed. ", "Because the Solomon's test set represents relatively well different kinds of scenarios, it has often been chosen to evaluate many solution proposals in the literature.", "\n\n5.2. ", "Evaluation of the Results {#sec5dot2-sensors-15-21033}\n------------------------------\n\nIn order to compare the solutions, four evaluation indexes are presented: the total traveled distance, the average total traveled distance, the CPU runtime and the quality of the solutions. ", "The total traveled distance and the average total traveled distance are the main criteria in the VRPTW and determines the algorithm merits. ", "The CPU runtime describes the algorithm efficiency. ", "The quality of the solutions is the comprehensive index, which denotes the percentage of deviation from the best-known solution. ", "The formula for calculating the percentage of deviation is as follows: $$z_{dev} = \\frac{z - z_{best}}{z_{best}} \\times 100\\%$$ where $z_{dev}$ is the percentage of deviation from the best-known solution, $z$ is the cost of the current solution, $z_{best}$ is the cost of the best-known solution.", "\n\n5.3. ", "Analysis of the Results {#sec5dot3-sensors-15-21033}\n----------------------------\n\nEach of 56 Solomon Benchmark problems is performed by some of the best-reported methods for VRPTW, namely, the genetic algorithm, ant colony optimization \\[[@B29-sensors-15-21033]\\], PSO \\[[@B65-sensors-15-21033]\\] and the proposed algorithm. ", "Each problem involves 100 customers, randomly distributed over a geographical area. ", "For each problem, 10 replications of the algorithm are attempted. ", "According to Equation (1), we have adopted a formulation in which the total traveled distance is the optimized objective. ", "Results displayed in the following tables contain the total traveled distance and the number of vehicles used in order to facilitate the comparison of our results with those obtained by hierarchical approaches in which the total traveled distance is the primary objective and, for the same total traveled distance, the secondary objective is number of vehicles, and also with multi-objective formulations that simultaneously consider both objectives \\[[@B66-sensors-15-21033]\\]. ", "It compares the total traveled distance (TD), the average total traveled distance, the CPU runtime and the quality of the solutions for each of the problems. ", "Both best and average results are presented.", "\n\n### 5.3.1. ", "The Total Traveled Distance {#sec5dot3dot1-sensors-15-21033}\n\nThe results of TD and the number of vehicles (NV) are shown in [Table 2](#sensors-15-21033-t002){ref-type=\"table\"}. ", "The published best-known solutions are not obtained by one or a particular class of methods \\[[@B15-sensors-15-21033],[@B67-sensors-15-21033],[@B68-sensors-15-21033],[@B69-sensors-15-21033],[@B70-sensors-15-21033],[@B71-sensors-15-21033]\\]. ", "Results emphasized in bold in [Table 2](#sensors-15-21033-t002){ref-type=\"table\"} represent the new best solutions reached by the proposed algorithm: 1 out of 56 (1.79%). ", "Results emphasized in bold and italic in [Table 2](#sensors-15-21033-t002){ref-type=\"table\"} represent the previously best-known solutions that cannot be reached by this algorithm. ", "The results show that many previously best-known solutions from the proposed algorithm have been reached: 31 out of 56 (55.4%). ", "Globally, the TD average results are close to the optimal solutions known in the proposed algorithm. ", "This comparison shows that the results from the proposed algorithm are competitive with other published results. ", "In the genetic algorithm, 27 out of 56 (48.2%) have reached the previously best-known solutions. ", "In PSO, 28 out of 56 (50%) have reached the previously best-known solutions. ", "In ACO, 26 out of 56 (46.4%) have reached the previously best-known solutions. ", "It can be seen that the proposed algorithm is better than the genetic algorithms, ACO and PSO. ", "The efficiency is improved and the results are close to the best-known solutions. ", "It is possible to see that the proposed algorithm continues to be very competitive in terms of total TD.", "\n\nsensors-15-21033-t002_Table 2\n\n###### \n\nThe results of the total traveled distance for Solomon's 100 customers set Problems.", "\n\n No. ", " Problem Best-Known Solution Genetic PSO ACO The Proposed Algorithm \n -------- ----------- --------------------- --------- --------------- ----- ------------------------ ------- --------------- ---- --------- ------- --------------- ---- --------- ------- --------------- ------- --------- -------\n **1** **C101** 828.94 10 828.94 10 856.26 10.20 828.94 10 842.60 10.10 828.94 10 842.60 10.10 828.94 10 842.60 10.10\n **2** **C102** 828.94 10 828.94 10 828.94 10.00 828.94 10 828.94 10.00 828.94 10 857.82 10.10 828.94 10 828.94 10.00\n **3** **C103** 828.06 10 828.06 10 859.88 10.00 828.06 10 828.06 10.00 828.06 10 828.06 10.00 828.06 10 828.06 10.00\n **4** **C104** 824.78 10 824.78 10 824.78 10.00 824.78 10 824.78 10.00 824.78 10 849.79 10.10 824.78 10 824.78 10.00\n **5** **C105** 828.94 10 828.94 10 854.25 10.20 828.94 10 866.91 10.30 828.94 10 904.88 10.60 828.94 10 841.60 10.10\n **6** **C106** 828.94 10 828.94 10 851.78 10.10 828.94 10 897.46 10.30 828.94 10 943.14 10.50 828.94 10 874.62 10.20\n **7** **C107** 828.94 10 828.94 10 856.47 10.20 828.94 10 842.70 10.10 828.94 10 870.23 10.30 828.94 10 842.70 10.10\n **8** **C108** 828.94 10 828.94 10 865.99 10.00 828.94 10 841.29 10.00 828.94 10 853.64 10.00 828.94 10 841.29 10.00\n **9** **C109** 828.94 10 828.94 10 910.27 10.30 828.94 10 856.05 10.10 828.94 10 883.16 10.20 828.94 10 828.94 10.00\n **10** **C201** 591.56 3 591.56 3 602.53 3.30 591.56 3 606.18 3.40 591.56 3 609.84 3.50 591.56 3 598.87 3.20\n **11** **C202** 591.56 3 591.56 3 656.01 3.20 591.56 3 623.78 3.10 591.56 3 623.78 3.10 591.56 3 591.56 3.00\n **12** **C203** 591.17 3 591.17 3 606.19 3.00 591.17 3 604.69 3.00 591.17 3 618.20 3.00 591.17 3 604.69 3.00\n **13** **C204** 590.60 3 590.60 3 704.28 3.30 590.60 3 666.39 3.20 590.60 3 742.17 3.40 590.60 3 628.49 3.10\n **14** **C205** 588.88 3 588.88 3 619.27 3.30 588.88 3 599.01 3.10 588.88 3 609.14 3.20 588.88 3 599.01 3.10\n **15** **C206** 588.49 3 588.49 3 620.28 3.20 588.49 3 604.38 3.10 588.49 3 636.17 3.30 588.49 3 588.49 3.00\n **16** **C207** 588.29 3 588.29 3 610.49 3.00 588.29 3 632.69 3.00 588.29 3 621.59 3.00 588.29 3 599.39 3.00\n **17** **C208** 588.32 3 588.32 3 622.73 3.00 588.32 3 599.79 3.00 588.32 3 611.26 3.00 588.32 3 599.79 3.00\n **18** **R101** 1483.57 16 ***1642.87*** 20 1645.83 19.50 ***1642.87*** 20 1645.33 19.50 ***1645.79*** 19 1647.29 19.00 ***1642.87*** 20 1645.83 19.50\n **19** **R102** 1355.93 14 ***1482.74*** 18 1483.75 17.70 ***1472.62*** 18 1477.95 17.80 ***1480.73*** 18 1482.21 17.80 ***1472.62*** 18 1477.14 17.80\n **20** **R103** 1133.35 12 ***1292.85*** 15 1248.88 14.40 ***1213.62*** 14 1239.30 14.40 ***1213.62*** 14 1247.22 14.30 ***1213.62*** 14 1239.01 13.80\n **21** **R104** 968.28 10 ***982.01*** 10 995.05 9.60 ***1007.24*** 9 1007.30 9.00 ***982.01*** 10 1000.11 9.40 ***982.01*** 10 992.52 9.70\n **22** **R105** 1262.53 12 ***1360.78*** 15 1366.87 14.80 ***1360.78*** 15 1374.14 14.70 ***1360.78*** 15 1369.99 15.30 ***1360.78*** 15 1366.42 15.00\n **23** **R106** 1201.78 12 ***1249.40*** 13 1251.48 12.20 ***1241.52*** 13 1249.39 12.40 ***1251.98*** 12 1252.00 12.00 ***1241.52*** 13 1247.29 12.60\n **24** **R107** 1051.92 11 ***1076.13*** 11 1094.18 10.70 ***1076.13*** 11 1094.19 10.50 ***1076.13*** 11 1096.08 10.70 ***1076.13*** 11 1088.49 10.70\n **25** **R108** 948.57 10 ***963.99*** 9 965.42 9.90 ***963.99*** 9 965.10 9.70 ***948.57*** 10 960.92 9.60 948.57 10 955.82 9.60\n **26** **R109** 1110.40 12 ***1151.84*** 13 1181.86 11.60 ***1151.84*** 13 1186.15 11.40 ***1151.84*** 13 1190.44 11.20 ***1151.84*** 13 1164.71 12.40\n **27** **R110** 1080.36 11 1080.36 11 1112.79 10.30 1080.36 11 1105.14 10.50 ***1080.36*** 11 1107.72 10.50 1080.36 11 1098.14 10.70\n **28** **R111** 987.80 10 ***1053.50*** 12 1086.43 10.80 ***1053.50*** 12 1083.13 11.60 ***1088.48*** 12 1095.07 10.40 ***1053.50*** 12 1069.14 11.60\n **29** **R112** 953.63 10 ***982.14*** 9 995.33 10.80 953.63 10 965.03 10.00 953.63 10 987.40 10.60 ***960.68*** 10 968.58 9.90\n **30** **R201** 1148.48 9 1148.48 9 1208.94 7.70 ***1179.79*** 9 1231.20 5.50 ***1148.48*** 9 1212.51 7.30 1148.48 9 1178.39 8.40\n **31** **R202** 1049.74 7 1049.74 7 1086.62 5.70 1049.74 7 1100.68 5.00 ***1079.36*** 6 1142.69 4.10 1049.74 7 1081.57 5.70\n **32** **R203** 900.08 5 900.08 5 930.23 4.60 ***932.76*** 7 939.72 3.80 ***939.54*** 3 941.70 3.00 900.08 5 922.71 4.60\n **33** **R204** 772.33 4 ***807.38*** 4 828.06 2.40 772.33 4 817.42 2.80 772.33 4 823.17 2.80 772.33 4 801.47 3.40\n **34** **R205** 959.74 4 ***970.89*** 6 982.66 4.50 ***970.89*** 6 980.30 4.80 ***970.89*** 6 989.71 3.60 ***970.89*** 6 977.95 5.10\n **35** **R206** 898.91 5 898.91 5 906.06 3.40 ***906.14*** 3 910.24 3.00 ***906.14*** 3 912.29 3.00 898.91 5 903.89 4.00\n **36** **R207** 814.78 3 814.78 3 844.73 3.40 814.78 3 868.25 2.60 814.78 3 876.51 2.60 814.78 3 836.67 3.00\n **37** **R208** 715.37 3 ***725.75*** 2 726.61 2.00 ***725.42*** 4 725.77 3.20 ***725.75*** 2 726.71 2.00 ***723.61*** 3 725.50 2.50\n **38** **R209** 879.53 6 879.53 6 892.08 5.40 879.53 6 891.00 5.40 879.53 6 903.21 4.20 879.53 6 891.82 5.10\n **39** **R210** 932.89 7 ***954.12*** 3 955.06 6.60 ***954.12*** 3 954.64 5.00 ***939.34*** 3 952.94 4.78 932.89 7 937.89 6.20\n **40** **R211** 761.10 4 ***885.71*** 2 892.31 2.30 ***885.71*** 2 889.53 4.40 ***888.73*** 5 867.07 2.90 ***808.56*** 4 824.99 3.90\n **41** **RC101** 1481.27 13 ***1660.10*** 16 1689.57 14.40 ***1623.58*** 15 1658.18 15.10 ***1639.97*** 16 1687.56 14.40 ***1623.58*** 15 1645.18 15.10\n **42** **RC102** 1395.25 13 ***1466.84*** 14 1493.53 13.50 ***1482.91*** 14 1497.28 13.60 ***1477.54*** 13 1539.85 12.30 ***1466.84*** 14 1487.10 13.50\n **43** **RC103** 1221.53 10 ***1261.67*** 11 1263.56 11.00 ***1262.02*** 11 1262.29 11.00 ***1262.02*** 11 1264.17 11.00 ***1261.67*** 11 1262.04 11.00\n **44** **RC104** 1135.48 10 1135.48 10 1135.50 10.00 1135.48 10 1135.50 10.00 1135.48 10 1135.51 10.00 1135.48 10 1135.49 10.00\n **45** **RC105** 1354.20 12 ***1518.60*** 16 1601.17 15.40 ***1518.60*** 16 1593.35 14.80 ***1629.44*** 13 1633.29 13.00 ***1618.55*** 16 1621.16 15.40\n **46** **RC106** 1226.62 11 ***1377.35*** 13 1396.59 11.80 ***1384.92*** 12 1417.25 11.20 ***1377.35*** 13 1416.49 11.30 ***1377.35*** 13 1392.80 12.30\n **47** **RC107** 1150.99 10 ***1230.48*** 11 1254.98 12.60 ***1212.83*** 12 1240.50 12.30 ***1230.48*** 11 1258.04 12.80 ***1212.83*** 12 1226.01 12.00\n **48** **RC108** 1076.81 10 ***1117.53*** 11 1135.32 10.30 ***1117.53*** 11 1127.41 10.90 ***1117.53*** 11 1128.55 10.80 ***1117.53*** 11 1126.40 10.70\n **49** **RC201** 1134.91 6 ***1406.91*** 4 1391.43 7.20 ***1406.91*** 4 1406.91 4.00 ***1286.83*** 9 1397.23 6.00 ***1387.55*** 8 1391.43 7.20\n **50** **RC202** 1113.53 8 ***1365.57*** 4 1250.18 3.60 1113.53 8 1162.75 7.60 1113.53 8 1204.86 6.30 ***1148.84*** 9 1173.34 7.90\n **51** **RC203** 945.96 5 945.96 5 1034.30 3.40 945.96 5 1032.14 3.40 ***1049.62*** 3 1052.87 3.00 945.96 5 990.67 4.20\n **52** **RC204** 796.11 4 ***798.41*** 3 798.69 3.20 ***798.41*** 3 799.18 3.60 ***798.46*** 3 799.43 3.80 ***798.41*** 3 798.67 3.20\n **53** **RC205** 1168.22 8 ***1270.69*** 7 1276.08 6.40 1168.22 8 1282.01 4.70 1168.22 8 1263.14 6.80 **1161.81** **7** 1187.56 6.90\n **54** **RC206** 1059.89 7 1059.89 7 1105.75 5.80 ***1084.30*** 8 1139.24 4.00 1059.89 7 1135.44 4.00 ***1059.89*** 7 1092.22 6.00\n **55** **RC207** 976.40 7 ***999.26*** 6 1060.37 3.60 976.40 7 1011.75 5.70 ***1053.58*** 6 1064.28 3.90 976.40 7 995.65 6.40\n **56** **RC208** 785.93 4 ***816.10*** 5 824.93 3.60 ***816.10*** 5 822.41 4.00 ***806.87*** 5 819.64 4.00 ***795.39*** **5** 807.27 4.78\n\n### 5.3.2. ", "The Average Total Traveled Distance {#sec5dot3dot2-sensors-15-21033}\n\nThe results of the average total traveled distance are shown in [Table 3](#sensors-15-21033-t003){ref-type=\"table\"}. ", "Each entry refers to the best performance obtained with a specific technique over a particular data set. ", "Rows C1, C2, R1, R2, RC1 and RC2 present the average number of vehicles and average total distance with respect to the six problem groups. ", "The last row refers to the cumulative number of routes and traveled distance over all problem instances. ", "The first column describes the various data sets and corresponding measures of performance defined by the average number of routes (or vehicles), and the total traveled distance. ", "The following columns refer to particular problem-solving methods. ", "The performance of the proposed algorithm is depicted in the last column. ", "The results indicate that the proposed algorithm can match the best-known solutions, and it performs better than other algorithms. ", "In addition, the proposed algorithm is the only method that found the minimum number of tours and the comparable traveled distance consistently for all problem data sets.", "\n\nsensors-15-21033-t003_Table 3\n\n###### \n\nThe results of the average total traveled distance.", "\n\n Problem Best-Known Solution Genetic PSO ACO The Proposed Algorithm \n -------------- --------------------- ----------- ----------- ----------- ------------------------ ----------- ----------- ----------- ----------- --------\n **C1-type** **NV** 10.00 10.00 10.11 10.00 10.10 10.00 10.21 10.00 10.06\n **TD** 828.38 828.38 856.51 828.38 847.64 828.38 870.37 828.38 839.28 \n **C2-type** **NV** 3.00 3.00 3.16 3.00 3.11 3.00 3.19 3.00 3.05\n **TD** 589.86 589.86 630.22 589.86 617.11 589.86 634.02 589.86 601.29 \n **R1-type** **NV** 11.67 13.00 12.69 12.92 12.63 12.92 12.57 13.08 12.78\n **TD** 1128.18 1193.22 1202.32 1184.84 1199.35 1186.16 1203.04 1182.04 1192.76 \n **R2-type** **NV** 5.18 4.73 4.36 4.91 4.14 4.55 3.66 5.36 4.72\n **TD** 893.90 912.31 932.12 915.56 937.16 914.99 940.77 899.98 916.62 \n **RC1-type** **NV** 11.13 12.75 12.38 12.63 12.36 12.25 11.95 12.75 12.50\n **TD** 1255.27 1346.01 1371.28 1342.23 1366.47 1358.73 1382.93 1351.73 1362.02 \n **RC2-type** **NV** 6.13 5.13 4.60 6.00 4.63 6.13 4.73 6.38 5.82\n **TD** 997.62 1082.85 1092.72 1038.73 1082.05 1042.13 1092.11 1034.28 1054.60 \n **All** **NV** 449 465 452.40 472 448.70 466 441.88 483 466.68\n **TD** 53,568.46 55,959.11 57,143.53 55,511.30 56,854.75 55,679.89 57,490.75 55,346.67 56,092.75 \n\n### 5.3.3. ", "The Average Central Processing Unit (CPU) Runtime {#sec5dot3dot3-sensors-15-21033}\n\nThe results of the average CPU runtime are listed in [Table 4](#sensors-15-21033-t004){ref-type=\"table\"}. ", "Rows C1, C2, R1, R2, RC1 and RC2- present the average CPU runtime with respect to the six problem groups. ", "From [Table 4](#sensors-15-21033-t004){ref-type=\"table\"}, for the same instance, ACO is almost the most time consuming; the genetic algorithm takes second place; the PSO takes third place; and the proposed algorithm is last. ", "The result shows that the proposed algorithm is highly efficient and suitable to be used in real-life problems to generate good solutions for further improvement. ", "The average CPU runtime required to solve each type of problem set is between 62 and 149 milliseconds by the proposed algorithm, which is much faster than other algorithms. ", "It can be seen that the proposed algorithm is very effective. ", "This happened because crossover in GA is done between random chromosomes, whereas in the proposed algorithm, crossover is done between a particle's chromosome and best chromosome. ", "Therefore, the proposed algorithm does not only give a better result, but it also reaches convergence results faster than other methods.", "\n\nsensors-15-21033-t004_Table 4\n\n###### \n\nThe results of the average CPU runtime.", "\n\n Problem Genetic PSO ACO The Proposed Algorithm\n --------- --------- ----- ----- ------------------------\n C1e 98 85 111 62\n C2 312 231 338 135\n R1 112 81 124 60\n R2 309 273 553 182\n RC1 79 80 82 58\n RC2 297 257 333 149\n\n### 5.3.4. ", "The Quality of the Solutions {#sec5dot3dot4-sensors-15-21033}\n\nAccording to Equation (17), the quality of the solutions is shown in [Table 5](#sensors-15-21033-t005){ref-type=\"table\"}. ", "Here $z$ is the average total traveled distance. ", "Rows C1, C2, R1, R2, RC1 and RC2 present the average $z_{dev}$ with respect to the six problem groups. ", "The last row refers to the cumulative $z_{dev}$ over all problem instances. ", "It can be seen that, with the proposed method, the quality of the results is between 1.32% and 8.17% with average quality equal to 4.07%; in the ACO, the quality of the solutions is between 5.07% and 9.75% with average quality equal to 6.95%; in PSO, the quality of the solutions is between 2.32% and 8.53% with average quality equal to 5.63%; in the genetic algorithm, the quality of the solutions is between 3.39% and 8.96% with average quality equal to 6.29%. ", "The improvement in the quality of the solutions was achieved with the addition of the crossover operator of genetic algorithm. ", "The reason is that, now, the particles moved in a more fast and efficient way to their local optimum or to the global optimum solution (to the best particle in the swarm). ", "It is proved that the addition of the evolution of the population phase before the individuals used in the next generation improves the results of the algorithm, especially in the large-scale vehicle routing instances which are more difficult and time consuming.", "\n\nsensors-15-21033-t005_Table 5\n\n###### \n\nThe result of $z_{dev}$.\n\n Problem Genetic PSO ACO The Proposed Algorithm\n ---------- --------- ------- ------- ------------------------\n C1-type 3.39% 2.32% 5.07% 1.32%\n C2-type 6.84% 4.62% 7.48% 1.94%\n R1-type 6.28% 5.98% 6.33% 5.36%\n R2-type 4.44% 4.93% 5.29% 2.62%\n RC1-type 8.89% 8.53% 9.75% 8.17%\n RC2-type 8.96% 7.92% 8.95% 5.30%\n All 6.29% 5.63% 6.95% 4.07%\n\nFrom the results shown in [Table 2](#sensors-15-21033-t002){ref-type=\"table\"}, [Table 3](#sensors-15-21033-t003){ref-type=\"table\"}, [Table 4](#sensors-15-21033-t004){ref-type=\"table\"} and [Table 5](#sensors-15-21033-t005){ref-type=\"table\"}, it is observed that the proposed algorithm is fast and produces good solutions, which are only slightly less accurate than the best-known results. ", "This comparison also shows that the results from the proposed algorithm are competitive with other published results. ", "The experimental results reveal that the proposed algorithm is highly capable at minimizing the total travel distance. ", "In particular, it is obvious that the proposed algorithm has great advantages for the solved problem size over the genetic algorithm, PSO and ACO. ", "The reason is that, now, the particles moved in a more fast and efficient way to their local optimum or to the global optimum solution (to the best particle in the swarm). ", "After each environment change (peak movement), the particles are placed on a point far from the optimum through the inertia weight function. ", "The particles take few iterations to reach this point. ", "At the same time, the particle's coding can be ensured that a particle is always able to generate a new feasible solution.", "\n\n6. ", "Conclusions {#sec6-sensors-15-21033}\n==============\n\nThis paper proposes a genetic and PSO algorithm for VRPTW. ", "Moreover, this algorithm was applied to the Solomon Benchmark problems and produced satisfactory results. ", "Compared to other approaches, experimental results indicate that the proposed algorithm is fast and possesses a relatively accurate results. ", "The proposed algorithm has proved to be an effective and competitive algorithm for the optimization problems due to its easy implementation, inexpensive computation and low memory requirements. ", "Three major contributions are as follows: (1)The real encoding method avoids the complex encoding and decoding computation burden.(2)A linear decreasing function of the number of iterations in PSO have a flexible and well-balanced mechanism to enhance and adapt to the global and local exploration abilities, which can help find the optimal solution with the least number of iterations.(3)The crossover operator of the genetic algorithm is introduced to generate a new population guaranteeing that the offspring inherits good qualities from this parent. ", "The crossover operator avoids premature convergence and local minimum value and increases the diversity of particles.", "\n\nAlthough the combination of the genetic algorithm and PSO for VRPTW obtains satisfactory achievements, there is still some room for improvement, such as how to effectively construct the initial solution and how to precisely judge the local optimal solution. ", "Further research applying the proposed algorithm to other VRPTW variants will be carried out in our future work.", "\n\nThis research was funded by National High Technology Research and Development Program of China (863 Program) under grant No. ", "2013AA122003 and No. ", "2012AA12A402, National Science & Technology Pillar Program under grant No. ", "2012BAB16B01, National Natural Science Foundation of P.R. China under grant No. ", "40901195, Special Fund for Quality Supervision, Inspection and Quarantine Research in the Public Interest under grant No. ", "201410308, and the Basic Research Fund of CASM.", "\n\nShenghua Xu and Jiping Liu conceived of and designed the study. ", "Shenghua Xu and Liang Wang analyzed the data and performed the experiments. ", "Shenghua Xu, Fuhao Zhang and Lijian Sun wrote and revised the paper extensively. ", "All of the authors have read and approved the final manuscript.", "\n\nThe authors declare no conflict of interest.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.0009391900966875255, 0.000748935213778168, 0.0005892975023016334, 0.0007262974977493286, 0.0005951610510237515, 0.0006938645383343101, 0.0005777913029305637, 0.0006578310276381671, 0.0006126816151663661, 0.0005662209587171674, 0.0006683547981083393, 0.0015193015569821, 0.0006339293904602528, 0.0006768661551177502, 0.0006803549476899207, 0.0007434622966684401, 0.000609979557339102, 0.000672614318318665, 0.0006145431543700397, 0.0006450821529142559, 0.0006784309516660869, 0.0006253130850382149, 0.0006384425214491785, 0.001058376394212246, 0.0007042928482405841, 0.0006242016679607332, 0.00067382917040959, 0.0005858103977516294, 0.0006944560445845127, 0.0010894408915191889, 0.0006251378799788654, 0.0006279012886807323, 0.0013766716001555324, 0.0006392109207808971, 0.000567466311622411, 0.0006630704738199711, 0.0006153973517939448, 0.0006082552717998624, 0.0009281747625209391, 0.0006104561616666615, 0.0006004974711686373, 0.0005857687792740762, 0.0005635396810248494, 0.001185585861094296, 0.005598036572337151, 0.0020345498342067003, 0.0006274678744375706, 0.0006106994696892798, 0.0007104814285412431, 0.0005486360751092434, 0.0005559807759709656, 0.0006138868629932404, 0.001798388664610684, 0.0008626315975561738, 0.005565275903791189, 0.0008056985097937286, 0.0006483309553004801, 0.0005696097505278885, 0.0005800157086923718, 0.02836477942764759, 0.0009835903765633702, 0.000670759822241962, 0.005274046212434769, 0.0006565767689608037, 0.0006061773747205734, 0.0005648741498589516, 0.0006009116768836975, 0.00117425003554672, 0.0007825650973245502, 0.0006753682973794639, 0.0007393209962174296, 0.0006334012723527849, 0.000691414694301784, 0.0006533315754495561, 0.0005917289527133107, 0.0005953843356110156, 0.0006502628675661981, 0.0005770623101852834, 0.0006143372738733888, 0.0005643161130137742, 0.000620453676674515, 0.0006011958466842771, 0.0006183140212669969, 0.0006286051357164979, 0.0007347090286202729, 0.000714715279173106, 0.0008021527901291847, 0.0005880286917090416, 0.0006384005537256598, 0.000617282697930932, 0.0005802606465294957, 0.0006957411533221602, 0.0005753482691943645, 0.0005567886983044446, 0.0007102448143996298, 0.0008804438402876258, 0.002647578017786145, 0.002951624570414424, 0.005969257093966007, 0.0006552668637596071, 0.0006421292782761157, 0.0009380780393257737, 0.0007722919690422714, 0.0007917024195194244, 0.0007025589584372938, 0.0006224351818673313, 0.0005429635639302433, 0.0005837490316480398, 0.0005447104340419173, 0.0005907475715503097, 0.0006007705233059824, 0.0006146579398773611, 0.0007340416777879, 0.0012900278670713305, 0.00078816112363711, 0.0009093947010114789, 0.0005790959694422781, 0.0005379446083679795, 0.0005680829635821283, 0.0005750571144744754, 0.0006404741434380412, 0.0005550637142732739, 0.0012962599284946918, 0.000685259175952524, 0.002793203806504607, 0.0006500704330392182, 0.0006298570660874248, 0.0006005486939102411, 0.0005800881190225482, 0.0006907362840138376, 0.0006655282340943813, 0.0006196714821271598, 0.0006051063537597656, 0.0006412516231648624, 0.0006382642895914614, 0.0006115562282502651, 0.0005658692098222673, 0.0005798134370706975, 0.0006703163380734622, 0.0014139491831883788, 0.0005395965999923646, 0.00059232342755422, 0.0013141067465767264, 0.0006498945294879377, 0.0005879541859030724, 0.017667340114712715, 0.011127494275569916, 0.000609999056905508, 0.000670435547363013, 0.0014217023272067308, 0.0006149670225568116, 0.0005741430795751512, 0.0005571239162236452, 0.0006859134882688522, 0.0008436152129434049, 0.0005923733697272837, 0.0006899869185872376, 0.0005971270729787648, 0.0006413821829482913, 0.0007389765814878047, 0.0006909216172061861, 0.01072546374052763, 0.0007716178079135716, 0.001820670790039003, 0.0006552696577273309, 0.0006008025375194848, 0.0013671480119228363, 0.0007588316220790148, 0.0013435718137770891, 0.0006026705377735198, 0.006063683424144983, 0.0013101339573040605, 0.0007527112611569464, 0.0006130562978796661, 0.0013158959336578846, 0.0012483912287279963, 0.000585852307267487, 0.0014581186696887016, 0.000704815611243248, 0.0010409881360828876, 0.000758179638069123, 0.00135024543851614, 0.0006395043455995619, 0.0007856868905946612, 0.000652184069622308, 0.0005586532060988247, 0.0011089013423770666, 0.0006682895473204553, 0.0006243394454941154, 0.0006121871992945671, 0.0006170038832351565, 0.0006542128976434469, 0.0006438622949644923, 0.0005789282149635255, 0.0006298546795733273, 0.0005208776565268636, 0.0006217799382284284, 0.0006325675058178604, 0.0005844312836416066, 0.0006122146151028574, 0.0007063533994369209, 0.0006711608148179948, 0.0007364892517216504, 0.0006329640164040029, 0.0005228553782217205, 0.001290704938583076, 0.0005585624021477997, 0.0005839643417857587, 0.0005895009380765259, 0.0005499229882843792, 0.000784842821303755, 0.0012786532752215862, 0.0006292480393312871, 0.0007619732641614974, 0.0006299294182099402, 0.0005503172869794071, 0.0005359879578463733, 0.0005653454572893679, 0.0005665060016326606, 0.004475330002605915, 0.0005696743610315025, 0.0006258702487684786, 0.0005658187437802553, 0.0005604129401035607, 0.0005599908181466162, 0.0005625994526781142, 0.0005606479826383293, 0.0005997238913550973, 0.0006124606006778777, 0.00061038724379614, 0.0006112511618994176, 0.0005418967339210212, 0.0005284584476612508, 0.0006646394613198936, 0.0013785817427560687, 0.011944006197154522, 0.0005749061820097268, 0.0005510056507773697, 0.0006137953023426235, 0.0006173654110170901, 0.0005528287147171795, 0.0005859321681782603, 0.0005587389459833503, 0.0005601496668532491, 0.0005846889107488096, 0.000593970762565732, 0.007401237729936838, 0.0006068349466659129, 0.0006383659201674163, 0.0005974594969302416, 0.0005544605664908886, 0.0007052838918752968, 0.0005536687094718218, 0.0006546033546328545, 0.0006173150613903999, 0.0006407726905308664, 0.0012182658538222313, 0.0005722937057726085, 0.004933493677526712, 0.0006448283093050122, 0.0007323738536797464, 0.0005815919721499085, 0.0005331536522135139, 0.0005724543589167297, 0.0005454827332869172, 0.0009392689098604023, 0.0005549658089876175, 0.0005556544056162238, 0.000568090588785708, 0.0005724543589167297, 0.0006097028381191194, 0.000562247761990875, 0.0005749225965701044, 0.001202064217068255, 0.0007907568942755461, 0.0005582494777627289, 0.0005674901185557246, 0.0005584346945397556, 0.0005519586848095059, 0.0005518563557416201, 0.0005394853069446981, 0.0005437087966129184, 0.0006009804201312363, 0.0009278070647269487, 0.0006574713042937219, 0.0006144476355984807, 0.0006308555020950735, 0.0006116349250078201, 0.0006113021518103778, 0.0005827167187817395, 0.0006497210706584156, 0.0005269492394290864, 0.0006131045520305634, 0.001995444530621171 ]

[ "Q:\n\nConvert string in javascript using moment\n\ni try convert string to moment and check is same.", "\n protected showEvent(event: IEvent, hour: Moment): boolean {\n let formatDate: Moment = moment(event.futureDate);\n console.log('--> formatDate', formatDate);\n console.log('--> hour', hour);\n\n return formatDate.isSame(hour, \"hour\"); // return true is same\n } \n\nthis console result\n--> formatDate: Moment {_isAMomentObject: true, _i: \"07-24-2017 07:00:00.000\", _isUTC: false, _pf: Object, _locale: Locale…}_d: Mon Jul 24 2017 07:00:00 GMT+0200 (CEST)_i: \"07-24-2017 07:00:00.000\"}\n\n--> hour: Moment {_isAMomentObject: true, _isUTC: false, _pf: Object, _locale: Locale, _d: Tue Jul 25 2017 07:00:00 GMT+0200 (CEST)…}\n\nHow can I convert the date to see if the time is the same?", "\nedit: the whole looks like this\nprotected showEvent(event: IEvent, hour: Moment): boolean {\n return moment(event.futureDate).hour() == hour.hours()\n}\n\nA:\n\nTry comparing the hour value alone. ", "\nreturn formatDate.hours() == hour.hours()\nIf you are looking to compare the entire date you can compare the other values e.g. minutes()\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.00074629025766626, 0.0007436436717398465, 0.0010707275941967964, 0.0005837295320816338 ]

[ "Saints running back Darren Sproles expected to be released from the team on Tuesday, after the team reportedly informed him that he would be free to pursue opportunities with other clubs. ", "Sproles even posted a goodbye note to fans on Twitter last Friday.", "\n\nThank you New Orleans for your support over the past 3 years! ", "I will always be forever grateful. #", "WhoDat — Darren Sproles (@DarrenSproles) March 8, 2014\n\nThe Saints did not release Sproles right away, however, and the team traded him to the Eagles on Thursday.", "\n\nWOW! \"", "@ESPNNFL: THIS JUST IN: Saints now plan to trade RB Darren Sproles due to heavy interest. ", "He will not be released. — ", "Darren Sproles (@DarrenSproles) March 11, 2014\n\nThe stuff u find out on twitter — Darren Sproles (@DarrenSproles) March 11, 2014\n\nSproles’ wife, Michel, posted a message on Instagram blasting the organization Wednesday.", "\n\nDarren Sproles’ wife has a few things she’d like to say about the Saints. ", "pic.twitter.com/jibrlGpw2U — Bart Hubbuch (@HubbuchNYP) March 13, 2014\n\nLast weekend, Michel Sproles posted a thank you note to Saints fans.", "\n\nhttp://instagram.com/p/lTXuMyKTP8/\n\nWe’ve got calls, texts, comments, & emails from friends, family, & fans regarding the release. ", "It’s always bitter sweet to experience something like this but we understand it’s apart of the business and I’m certain God has great things in store for the Sproles Family.", "\n\n(Thanks to Black Sports Online for bringing this to our attention.)" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0008355466998182237, 0.0006373263895511627, 0.0005596666596829891, 0.0005793267046101391, 0.0007560040103271604, 0.0008792224107310176, 0.0007084145327098668, 0.0011545269517228007, 0.0007251656497828662, 0.0007336311391554773, 0.0006335276993922889, 0.0006371323252096772, 0.0007044646772556007, 0.0023681125603616238 ]

[ "I work in a large community hospital Emergency Center and I review medical records for disability claims at a nation-wide disability insurer. ", "I also serve as a Deputy Sheriff on the SWAT team for a local county, as the medical asset.", "\n\nMonday, August 01, 2005\n\nThis 75 year old man presented to the Urgent Care one evening after a day of golfing. ", "A very unusual presentation, in that he had no history of any significant medical problems, was on no medications and had no history of any significant injuries.", "\n\nHe presented about 7pm with 3 hours of low back pain. ", "He stated that he felt somewhat embarassed about coming in for something so trivial, but that his wife had made him. ", "How many times have we heard that?", "\n\nHe had spent the early afternoon golfing, as was his usual habit. ", "Again, as usual, he went for a soak in the hot tub. ", "As he was getting out, he twisted to place his foot down and felt a sudden onset of sharp low back pain. ", "He pointed to his left lower back area.", "\n\nOn exam, his vital signs were normal and stable. ", "He appeared comfortable and in no distress. ", "He did use his hands on the arms of the chair when asked to stand and was slow to step up onto the exam table.", "\n\nHe was tender to palpation across the low back, especially on the left and there was moderate muscular spasm.", "\n\nThe young doctor, only about 6 months out of internship, was moonlighting in the Urgent Care. ", "She felt comfortable with this presentation and ordered a lumbar spine series, confident she would see degenerative changes.", "\n\nAnd she did. ", "What 75 year-old man doesn't have degenerative changes on an LS spine xray?", "\n\nShe informed the patient and his family of her diagnosis: lumbar strain with muscle spasm. ", "She advised the use of Tylenol #3 and robaxin. ", "The patient seemed comfortable with this diagnosis and advice and prepared to leave.", "\n\nHowever, the patient's son asked to speak with the doc outside the room. ", "He told her of his concern for his father. \"", "He never complains of pain. ", "You need to understand that for this man to come to the doctor, especially at night, he would have to be in a great amount of pain. ", "More than he would get from a lumbar sprain. ", "And he didn't tell he threw up on the patio as he got out of the hot tub. ", "Are you sure it's OK to go home?\"", "\n\nUpon further interview, the patient admitted that he had been nauseated since the time the back pain began. ", "He also described vague diffuse abdominal discomfort, but no pain.", "\n\nThe doc looked at the x-rays again. ", "Was there something there that she had missed? ", "Were those whitish irregular arcs significant? ", "They measured about 14cm apart at greatest distance.", "\n\nShe went back for further exam. ", "The patient had good distal pulses and no bruit over the abdomen or femorals. ", "No history of claudication. ", "No pulsatile mass in this moderately obese man.", "\n\nShe called the vascular surgeon on call for her group. ", "He scoffed when she told him of her concern and the distance between the arcs on the x-ray. \"", "No aneurysm could be 14cm, it would have ruptured long before that!\" ", "he exclaimed. ", "Nonetheless, he agreed to accept the patient for transfer to the ER.", "\n\nShe advised the patient and his family of her concerns. ", "She advised them to drive straight to the ER and not stop at McDonald's on the way there.", "\n\nOn her way home, the inexperienced doc found herself in the middle of a panic attack. ", "She suddenly realized how foolish it had been to send the patient by private vehicle and not by ambulance. ", "What if they went home instead of to the hospital? ", "What if he died in the car on the way? ", "Am I good enough to be doing this?", "\n\nOne week later she got a call from an unusually polite vascular surgeon. ", "Somewhat abashed, he apologized and explained what had been the result of her transfer.", "\n\nThe ER doc had performed a CT scan of the abdomen and called the vascular surgeon about a 10cm abdominal aortic aneurysm. ", "Remember that plain films magnify about 40%? ", "Well, 14cm is 140% of 10cm, isn't it?", "\n\nAfter evaluating the patient in the ER, the surgeon decided to postpone surgery until the morning, given the stable condition. ", "As he was leaving the ER, he reconsidered. ", "He called his partner to come in to assist and went to the OR.", "\n\nThey were standing outside the operating room as the elevator door opened and the nurse and the tech wheeled the stretcher down the hall. ", "As they passed the two surgeons, the patient passed out and became very pale.", "\n\nThey threw the pulseless patient onto the OR table, opened the chest and cross-clamped the aorta. ", "Four days later he walked out of the hospital, already planning his next golf date." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005988037446513772, 0.0006690191803500056, 0.002208082005381584, 0.0007325522601604462, 0.008502386510372162, 0.0006730875466018915, 0.0006865180912427604, 0.0009381459094583988, 0.0022864975035190582, 0.011763493530452251, 0.07052791118621826, 0.0006131828995421529, 0.0007232983480207622, 0.004700508434325457, 0.0011787742841988802, 0.0005735630984418094, 0.0005887117586098611, 0.0021202818024903536, 0.032464731484651566, 0.0007971616578288376, 0.0006907760980539024, 0.0006051795789971948, 0.0006410146015696228, 0.000643899489659816, 0.0032339077442884445, 0.004152994602918625, 0.01480888295918703, 0.0012720997910946608, 0.000774783140514046, 0.0008826765115372837, 0.0005945791490375996, 0.000630675524007529, 0.0008047646842896938, 0.0006178088951855898, 0.0006484195473603904, 0.0006058080471120775, 0.000867612601723522, 0.0007379428134299815, 0.6796307563781738, 0.0007712134975008667, 0.0005845800042152405, 0.0021721450611948967, 0.0011663512559607625, 0.0005969227640889585, 0.0005725024384446442, 0.001376843429170549, 0.00887617003172636, 0.045867130160331726, 0.0014558854745700955, 0.01972118951380253, 0.0008937151287682354, 0.0005996235413476825, 0.0006561658228747547, 0.0009700990049168468, 0.0010684054577723145, 0.000995049369521439, 0.0006143642240203917, 0.0006596721359528601, 0.0006221747607924044, 0.0012270145816728473, 0.0032210219651460648, 0.01259863842278719, 0.0016542964149266481 ]

[ "{*\n\n/**\n *\n * SugarCRM Community Edition is a customer relationship management program developed by\n * SugarCRM, Inc. Copyright (C) 2004-2013 SugarCRM Inc.\n *\n * SuiteCRM is an extension to SugarCRM Community Edition developed by SalesAgility Ltd.\n * Copyright (C) 2011 - 2018 SalesAgility Ltd.\n *\n * This program is free software; you can redistribute it and/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by the\n * Free Software Foundation with the addition of the following permission added\n * to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED WORK\n * IN WHICH THE COPYRIGHT IS OWNED BY SUGARCRM, SUGARCRM DISCLAIMS THE WARRANTY\n * OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.", "\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. ", "See the GNU Affero General Public License for more\n * details.", "\n *\n * You should have received a copy of the GNU Affero General Public License along with\n * this program; if not, see http://www.gnu.org/licenses or write to the Free\n * Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n * 02110-1301 USA.", "\n *\n * You can contact SugarCRM, Inc. headquarters at 10050 North Wolfe Road,\n * SW2-130, Cupertino, CA 95014, USA. ", "or at email address contact@sugarcrm.com.", "\n *\n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.", "\n *\n * In accordance with Section 7(b) of the GNU Affero General Public License version 3,\n * these Appropriate Legal Notices must retain the display of the \"Powered by\n * SugarCRM\" logo and \"Supercharged by SuiteCRM\" logo. ", "If the display of the logos is not\n * reasonably feasible for technical reasons, the Appropriate Legal Notices must\n * display the words \"Powered by SugarCRM\" and \"Supercharged by SuiteCRM\".", "\n */\n\n\n\n\n*}\n\n\n{literal}\n<style type='text/css'>\n .slot\n {\n border-width:1px;border-color:#999999;border-style:solid;padding:0px 1px 0px 1px;margin:2px;cursor:move;\n }\n\n .slotB\n {\n border-width:0;cursor:move;\n }\n div.moduleTitle\n {\n margin-bottom: 5px;\n }\n</style>\n{/literal}\n\n<table width=\"100%\" border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n\t<tr>\n\t\t<td>\n {$title}\n<table cellspacing=\"2\">\n <tr>\n <td colspan=\"3\">{$MOD.LBL_RENAME_MOD_SAVE_HELP}</td>\n </tr>\n <tr><td>&nbsp;</td></tr>\n <tr>\n <td colspan=\"3\">\n <input type=\"button\" class=\"button primary\" value=\"{$MOD.LBL_BTN_SAVE}\" id=\"renameSaveBttn\" onclick='validateForm();'name=\"{$MOD.LBL_BTN_SAVE}\" />\n <input type=\"button\" class=\"button\" value=\"{$MOD.LBL_BTN_CANCEL}\" id=\"renameCancelBttn\" name=\"{$MOD.LBL_BTN_CANCEL}\" onclick=\"document.editdropdown.action.value='index'; document.editdropdown.module.value='Administration';document.editdropdown.submit()\" />\n </td>\n </tr>\n</table>\n<div style=\"height:10px\">&nbsp;</div>\n<table width=\"100%\" border=\"0\" cellspacing=\"0\" cellpadding=\"0\" class='edit view' >\n<tr>\n <td>\n <span class='error'>{$error}</span>\n <table>\n <tr>\n <td colspan='2'>\n <form method='post' action='index.php' name='dropdownsform'>\n <input type='hidden' name='action' value='wizard'>\n <input type='hidden' name='wizard' value='RenameModules'>\n <input type='hidden' name='option' value='EditDropdown'>\n <input type='hidden' name='module' value='Studio'>\n <input type='hidden' name='dropdown_name' value='{$dropdown_name}'>\n {$MOD.LBL_TABGROUP_LANGUAGE} &nbsp;\n {html_options name='dropdown_lang' options=$dropdown_languages selected=$dropdown_lang onchange=\"document.dropdownsform.submit();\"}\n {sugar_help text=$MOD.LBL_LANGUAGE_TOOLTIP}\n </form>\n </td>\n </tr>\n </table>\n </td>\n</tr>\n<tr>\n <td>\n<form method='post' action='index.php' name='editdropdown'>\n<input type='hidden' name='action' value='wizard'>\n<input type='hidden' name='wizard' value='RenameModules'>\n<input type='hidden' name='option' value='SaveDropDown'>\n<input type='hidden' name='module' value='Studio'>\n<input type='hidden' name='dropdown_lang' value='{$dropdown_lang}'>\n<input type='hidden' name='dropdown_name' value='moduleList'>\n\n<table name='tabDropdown' id='tabDropdown'>\n\n{counter start=0 name=\"rowCounter\" print=false assign=\"rowCounter\"}\n{foreach from=$dropdown item=\"value\" key=\"key\"}\n<tr>\n <td>\n <span id='slot{$rowCounter}b' >\n <span onclick='prepChangeDropDownValue({$rowCounter}, document.getElementById(\"slot{$rowCounter}_value\"));'>{$editImage}</span>\n &nbsp;\n <span id ='slot{$rowCounter}_value' onclick='prepChangeDropDownValue({$rowCounter}, this);'>{$value.lang}</span>\n <span id='slot{$rowCounter}_textspan' style='display:none;'>{$value.user_lang}\n <table style=\"margin-left:15px;\">\n <tr>\n <td align=\"right\">{$MOD.LBL_SINGULAR}</td>\n <td align=\"left\"><input id='slot{$rowCounter}_stext' value=\"{$value.singular}\" onchange='setSingularDropDownValue({$rowCounter});' type='text'></td>\n </tr>\n <tr>\n <td align=\"right\">{$MOD.LBL_PLURAL}</td>\n <td align=\"left\"><input id='slot{$rowCounter}_text' value=\"{$value.lang}\" type='text' onchange='setDropDownValue({$rowCounter}, this.value, true)' ></td>\n </tr>\n </table>\n <input name='slot_{$rowCounter}' id='slot_{$rowCounter}' value='{$rowCounter}' type = 'hidden'>\n <input type='hidden' name='key_{$rowCounter}' id='key_{$rowCounter}' value='{$key|default:\"BLANK\"}'>\n <input type='hidden' id='delete_{$rowCounter}' name='delete_{$rowCounter}' value='0'>\n <input type='hidden' id='slot{$rowCounter}_key' name='slot{$rowCounter}_key' value='{$key}'>\n <input name='value_{$rowCounter}' id='value_{$rowCounter}' value='{$value.lang}' type = 'hidden'>\n <input name='svalue_{$rowCounter}' id='svalue_{$rowCounter}' value='{$value.singular}' type = 'hidden'>\n </span>\n </span>\n </td>\n</tr>\n{counter name=\"rowCounter\"}\n{/foreach}\n\n</table>\n</table>\n\n{sugar_getscript file=\"include/javascript/yui/build/dragdrop/dragdrop-min.js\"}\n{literal}\n<script>\n\n var lastField = '';\n var lastRowCount = -1;\n var inputsWithErrors = [];\n function prepChangeDropDownValue(rowCount, field)\n {\n var tempLastField = lastField;\n if(lastRowCount !", "= -1)\n {\n //Check for validation errors first\n if(checkForErrors(lastRowCount))\n return true;\n\n collapseRow(lastRowCount);\n }\n if(tempLastField == field)\n return;\n lastField = field;\n lastRowCount = rowCount;\n\n field.style.display=\"none\";\n\n var textspan = document.getElementById('slot' + rowCount + '_textspan');\n var text = document.getElementById(\"slot\" + rowCount + \"_text\");\n textspan.style.display='inline'\n text.focus();\n }\n\n function checkForErrors(rowCount)\n {\n var foundErrors = false;\n var el1 = document.getElementById(\"slot\" + rowCount + \"_text\");\n var el2 = document.getElementById(\"slot\" + rowCount + \"_stext\");\n\n if( YAHOO.lang.trim(el1.value) == \"\")\n {\n add_error_style('editdropdown', el1, SUGAR.language.get('app_strings', 'ERR_MISSING_REQUIRED_FIELDS'),true);\n foundErrors = true;\n }\n if( YAHOO.lang.trim(el2.value) == \"\")\n {\n add_error_style('editdropdown', el2, SUGAR.language.get('app_strings', 'ERR_MISSING_REQUIRED_FIELDS'),true);\n foundErrors = true;\n }\n\n return foundErrors;\n }\n\n /*\n scrub input for bug 50607: able to enter HTML/JS and execute through module renaming.", "\n */\n function cleanModuleName(val)\n {\n return YAHOO.lang.escapeHTML(val);\n }\n\n /*\n pulled out routine to keep scrubbing from being called multiple times\n */\n function collapseRow(rowCount)\n {\n var text = document.getElementById('slot' + rowCount + '_text');\n var textspan = document.getElementById('slot' + rowCount + '_textspan');\n var span = document.getElementById('slot' + rowCount + '_value');\n textspan.style.display = 'none';\n span.style.display = 'inline';\n lastField = '';\n lastRowCount = -1;\n }\n\n function setSingularDropDownValue(rowCount)\n {\n document.getElementById('svalue_'+ rowCount).value = document.getElementById('slot' + rowCount + '_stext').value;\n }\n\n function setDropDownValue(rowCount, val, collapse)\n {\n //Check for validation errors first\n if(checkForErrors(rowCount))\n return true;\n\n document.getElementById('value_' + rowCount).value = val;\n\n var span = document.getElementById('slot' + rowCount + '_value');\n if(collapse)\n {\n span.innerHTML = cleanModuleName(val);\n collapseRow(rowCount);\n }\n\n setSingularDropDownValue(rowCount);\n }\n\n var slotCount = {/literal}{$rowCounter}{literal};\n var yahooSlots = [];\n\n function validateForm()\n {\n for(i=0;i<slotCount;i++)\n {\n if( checkForErrors(i) )\n {\n //Highlight dropdown value if we find an error.", "\n prepChangeDropDownValue(i, document.getElementById(\"slot\"+i+\"_value\"));\n return;\n }\n }\n\n if(check_form(\"editdropdown\"))\n {\n document.editdropdown.submit();\n }\n\n }\n</script>\n{/literal}\n\n\n<div id='logDiv' style='display:none'>\n</div>\n\n<input type='hidden' name='use_push' value='1'>\n</form>\n</td></tr>\n</table>" ]

{ "pile_set_name": "Github" }

[ 0.0007882114732638001, 0.000617687008343637, 0.000562920467928052, 0.0005847992724739015, 0.0006325144204311073, 0.0006286222487688065, 0.0005959185655228794, 0.0005985013558529317, 0.0005805339314974844, 0.0011596285039559007, 0.0014675683341920376, 0.0030007788445800543, 0.0009276010096073151 ]

[ "Q:\n\nnebular issue in the modules of nebular like 'nb-card', 'nb-stripper'\n\nI'm using nebular in angular, nb-card always not working, he always give me this.", "\nAny advice please ?", "\nERROR in src/app/kyc/documentverification/documentverification.component.html:2:1 - error NG8001: 'nb-card' is not a known element:\n1. ", "If 'nb-card' is an Angular component, then verify that it is part of this module.", "\n2. ", "If 'nb-card' is a Web Component then add 'CUSTOM_ELEMENTS_SCHEMA' to the '@NgModule.schemas' of this component to suppress this message.", "\n2 \n\nsrc/app/kyc/documentverification/documentverification.component.ts:5:16\n 5 templateUrl: './documentverification.component.html',\n ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n Error occurs in the template of component DocumentverificationComponent.", "\nsrc/app/kyc/documentverification/documentverification.component.html:3:5 - error NG8001: 'nb-card-header' is not a known element:\n1. ", "If 'nb-card-header' is an Angular component, then verify that it is part of this module.", "\n2. ", "If 'nb-card-header' is a Web Component then add 'CUSTOM_ELEMENTS_SCHEMA' to the '@NgModule.schemas' of this component to suppress this message.", "\n\n3 <nb-card-header></nb-card-header>\n ~~~~~~~~~~~~~~~~\n\nsrc/app/kyc/documentverification/documentverification.component.ts:5:16\n 5 templateUrl: './documentverification.component.html',\n ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n Error occurs in the template of component DocumentverificationComponent.", "\nsrc/app/kyc/documentverification/documentverification.component.html:4:1 - error NG8001: 'nb-card-body' is not a known element:\n1. ", "If 'nb-card-body' is an Angular component, then verify that it is part of this module.", "\n2. ", "If 'nb-card-body' is a Web Component then add 'CUSTOM_ELEMENTS_SCHEMA' to the '@NgModule.schemas' of this component to suppress this message.", "\n\n4 <nb-card-body>\n~~~~~~~~~~~~~~\n\nsrc/app/kyc/documentverification/documentverification.component.ts:5:16\n 5 templateUrl: './documentverification.component.html',\n ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n Error occurs in the template of component DocumentverificationComponent.", "\n\nA:\n\nimport NbCardModule in the module which has DocumentVerificationComponent\nimport { NbCardModule } from 'nebular/themes'\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0008471334003843367, 0.0006551522528752685, 0.0006850384525023401, 0.0006109471432864666, 0.001185585861094296, 0.0008606032934039831, 0.0008532883366569877, 0.0006698278011754155, 0.0006220965296961367, 0.001185585861094296, 0.0008077726233750582, 0.0010560437804087996, 0.0006567247910425067, 0.0006129856337793171, 0.001185585861094296, 0.0007820298196747899, 0.0008540998096577823, 0.0007216443191282451 ]

[ "---\r\nID: \"709c05c5-0439-4e1a-9d47-11e824c87b39\"\r\nParent: \"b87cd5f0-4e72-429d-90a3-b285f1d038ca\"\r\nTemplate: \"a87a00b1-e6db-45ab-8b54-636fec3b5523\"\r\nPath: /sitecore/layout/Models/Feature\r\nDB: master\r\nSharedFields:\r\n- ID: \"06d5295c-ed2f-4a54-9bf2-26228d113318\"\r\n Hint: __Icon\r\n Value: applications/32x32/folder_cubes.png\r\nLanguages:\r\n- Language: en\r\n Versions:\r\n - Version: 1\r\n Fields:\r\n - ID: \"25bed78c-4957-4165-998a-ca1b52f67497\"\r\n Hint: __Created\r\n Value: 20150824T183828Z\r\n - ID: \"5dd74568-4d4b-44c1-b513-0af5f4cda34f\"\r\n Hint: __Created by\r\n Value: |\r\n sitecore\\admin\r\n" ]

{ "pile_set_name": "Github" }

[ 0.0013418524758890271 ]

[ "I have hashimotos thyroiditis, PCOS, Severe allergies all year, b12 deficiency (they don't know why), They are also having a hard time getting my b12 levels to raise.. On a shot every 2 weeks they could only get me to 471. ", "I also get migraines in relation to sinus headaches Anyway - I'm always tired. ", "can sleep forever and never feel like I have slept. ", "My neurologist did 3 sleep studies and an MRI and found nothing. ", "He could only confirm that when doing a sleep latency test for narcolepsy that I did not appear to be narcoleptic buy I fell asleep betwee 2-4 minutes on every nap. ", "He finally found the b12 deficiency and that has helped some. ", "But I don't know what to do any more. ", "Its making it really hard to keep a job and if I don't have a job I have no insurance and can't afford to keep seeing all the doctors. ", "I'm foggy all the time and walk into things a lot. ", "for awhile they thought it was MS but fortunately that came back negative. ", "actually I think they have probably tested me for me for almost everything and except for what I've listed it was all negative. ", "anyone have any suggestions?", "\n\nGreetings,\nI have Chronic Fatigue, hypothyriodism, metabolic syndrome, IC, Mild Adrenal Hyperplasia, Raynauds, ADD, yeast, grass, weed, dust, birch, oak and orange allergies and it seems like every year I get some more added to the list.", "\nI have been trying to figure why I have so many illnesses, since I no longer take Dexamethsone for Hyperplasia, things have gotten worse and I can barely stay awake. ", "I stopped because I was told I may not have the Adrenal Hyperplasia. ", "I was happy and lost a ton of weight off the Dex. ", "I was recently going through my lab work and CAT Scan, all point to Adrenal Hyperplasia. ", "I feel that it is most likely that 0.75 mg of Dex was a very high dosage and that may have been what was causing the weight gain. ", "I didn't have any allergies and wasn't nearly so tired as I am now. ", "Maybe you should have your adrenal gland looked at for adrenal deficancy, cortisol levels checked to make sure they aren't too low, that can effect your immune system.", "\nAlso, I can't convert T4 to T3, so I have to take a T3 medication and since I was told to stop for now, I am falling asleep at my desk withing 3 hours after waking up, even though I take 30 mg of XR Adderall, imagine that. ", "I have to take short acting Adderall just so I can pay attention to the kids. ", "I also had a sleep study test done and was told I am sleeping fine, yet I could have swore I didn;t sleep all night. ", "I am hoping that I can find a doctor here in Georgia that is good with Adrenal stuff. ", "Well, I hope that helps some, let me know how things are progressing with your recovery. ", "Please have that adrenal gland checked out, if anything it will be something you can check off your list.", "\n\nThe coincidence of Hashimoto Thyreoiditis and Typ A Gastritis with vitamin B deficiency might be a distinct syndrome that is called \"polyglandular autoimmune syndrome\" (Typ III). ", "Some of the patients might get Diabetes as well. ", "If this diagnosis is right, can be checked by your internist also by gene test. ", "Ask if that has be done." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0018294546753168106, 0.03512119874358177, 0.0036754515022039413, 0.0014484517741948366, 0.0016969642601907253, 0.0006555553991347551, 0.000932428112719208, 0.0013105265097692609, 0.0018221603240817785, 0.0005685014184564352, 0.0005991411744616926, 0.0006970761460252106, 0.0022262618876993656, 0.0014332127757370472, 0.007000218145549297, 0.0011540596606209874, 0.0016036141896620393, 0.0006512533291243017, 0.0018787500448524952, 0.5358991026878357, 0.001196974073536694, 0.002709930296987295, 0.001178288017399609, 0.00942528247833252, 0.0005893278867006302, 0.08727197349071503, 0.0011657965369522572, 0.0009169045370072126, 0.0006090158130973577, 0.0008139469427987933 ]

[ "Q:\n\nPrinting MIGS ( Mastercard Internet Gateway Service ) Successful payment response on the redirected page\n\nI have a WordPress photo selling website where I have created password protected galleries. ", "I send gallery password to specific users only. ", "After entering the password they're able to buy any of the gallery image.", "\nI'm using the MIGS ( Mastercard Internet Gateway Service ) in the site. ", "Where user submits the form that includes amount to be paid. ", "Upon entering the amount and clicking \"Pay now\" button we are sent to the mastercard payment site. ", "Once the payment is successful user is redirected to the thank you page of the site.", "\nIsn't there a way to not only redirect upon successful payment but also print response like \"payment successful\" in the thank you page?", "\nI want something like this so that the links to download the images only shows up in the thank you page if the payment was successful.", "\nIf a payment is unsuccessful the user is redirected back to the checkout page with the response \"Declined\" in my site. ", "But it does nothing except redirecting to the thank you page when a payment is successful. ", "How will I know that the user is redirected from the payment site and the payment was successful? ", "I want to have something like that in the thank you page.", "\nPlease help me guys!", "\n\nA:\n\nIsn't there a way to not only redirect upon successful payment but also print response like \"payment successful\" in the thank you page?", "\n\nIsn't the thank you page on your site? ", "Can't you add any text you like to that page?", "\n\nHow will I know that the user is redirected from the payment site and the payment was successful? ", "I want to have something like that in the thank you page.", "\n\nUsually when the payment completes and the user is redirected, you can make a completePurchase() (Omnipay call) to the gateway to confirm the purchase data. ", " You should call supportsCompletePurchase() on the gateway first to determine whether it supports such a call.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0006154193542897701, 0.0006008727359585464, 0.0006106141954660416, 0.0006125858053565025, 0.0007571373716928065, 0.000581469270400703, 0.0005521833663806319, 0.0005917977541685104, 0.0005653325351886451, 0.000668495602440089, 0.0006439114222303033, 0.0006738886004313827, 0.0005408654105849564, 0.0005963535513728857, 0.0005962711293250322, 0.0007753722602501512, 0.0009825999150052667, 0.0006738886004313827, 0.0005408654105849564, 0.0005684745847247541, 0.0006352681084536016, 0.001995444530621171 ]

[ "/* Test for C99 __func__. ", " */\n/* Origin: Joseph Myers <jsm28@cam.ac.uk> */\n/* { dg-do run } */\n/* { dg-options \"-std=iso9899:1999 -pedantic-errors\" } */\n\nextern void abort (void);\nextern int strcmp (const char *, const char *);\nextern void exit (int);\n\nint\nmain (void)\n{\n if (strcmp (__func__, \"main\") || sizeof (__func__) !", "= 5)\n abort ();\n else\n exit (0);\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.0009184341179206967, 0.007705350406467915, 0.003349003614857793 ]

[ "Solution structure of LCI, a novel antimicrobial peptide from Bacillus subtilis.", "\nLCI, a 47-residue cationic antimicrobial peptide (AMP) found in Bacillus subtilis, is one of the main effective components that have strong antimicrobial activity against Xanthomonas campestris pv Oryzea and Pseudomonas solanacearum PE1, etc. ", "To provide insight into the activity of the peptide, we used nuclear magnetic resonance spectroscopy to determine the structure of recombinant LCI. ", "The solution structure of LCI has a novel topology, containing a four-strand antiparallel β-sheet as the dominant secondary structure. ", "It is the first structure of the LCI protein family. ", "Different from any known β-structure AMPs, LCI contains no disulfide bridge or circular structure, suggesting that LCI is also a novel β-structure AMP." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005738813197240233, 0.0008606832707300782, 0.0005216663703322411, 0.0006051487289369106, 0.0006349727045744658, 0.0007391240797005594 ]