Datasets:

tomekkorbak

/

detoxify-pile-chunk3-5600000-5650000

like 0

[ "package pflag\n\nimport \"strconv\"\n\n// -- uint8 Value\ntype uint8Value uint8\n\nfunc newUint8Value(val uint8, p *uint8) *uint8Value {\n\t*p = val\n\treturn (*uint8Value)(p)\n}\n\nfunc (i *uint8Value) Set(s string) error {\n\tv, err := strconv.", "ParseUint(s, 0, 8)\n\t*i = uint8Value(v)\n\treturn err\n}\n\nfunc (i *uint8Value) Type() string {\n\treturn \"uint8\"\n}\n\nfunc (i *uint8Value) String() string { return strconv.", "FormatUint(uint64(*i), 10) }\n\nfunc uint8Conv(sval string) (interface{}, error) {\n\tv, err := strconv.", "ParseUint(sval, 0, 8)\n\tif err !", "= nil {\n\t\treturn 0, err\n\t}\n\treturn uint8(v), nil\n}\n\n// GetUint8 return the uint8 value of a flag with the given name\nfunc (f *FlagSet) GetUint8(name string) (uint8, error) {\n\tval, err := f.getFlagType(name, \"uint8\", uint8Conv)\n\tif err !", "= nil {\n\t\treturn 0, err\n\t}\n\treturn val.(uint8), nil\n}\n\n// Uint8Var defines a uint8 flag with specified name, default value, and usage string.", "\n// The argument p points to a uint8 variable in which to store the value of the flag.", "\nfunc (f *FlagSet) Uint8Var(p *uint8, name string, value uint8, usage string) {\n\tf.VarP(newUint8Value(value, p), name, \"\", usage)\n}\n\n// Uint8VarP is like Uint8Var, but accepts a shorthand letter that can be used after a single dash.", "\nfunc (f *FlagSet) Uint8VarP(p *uint8, name, shorthand string, value uint8, usage string) {\n\tf.VarP(newUint8Value(value, p), name, shorthand, usage)\n}\n\n// Uint8Var defines a uint8 flag with specified name, default value, and usage string.", "\n// The argument p points to a uint8 variable in which to store the value of the flag.", "\nfunc Uint8Var(p *uint8, name string, value uint8, usage string) {\n\tCommandLine.", "VarP(newUint8Value(value, p), name, \"\", usage)\n}\n\n// Uint8VarP is like Uint8Var, but accepts a shorthand letter that can be used after a single dash.", "\nfunc Uint8VarP(p *uint8, name, shorthand string, value uint8, usage string) {\n\tCommandLine.", "VarP(newUint8Value(value, p), name, shorthand, usage)\n}\n\n// Uint8 defines a uint8 flag with specified name, default value, and usage string.", "\n// The return value is the address of a uint8 variable that stores the value of the flag.", "\nfunc (f *FlagSet) Uint8(name string, value uint8, usage string) *uint8 {\n\tp := new(uint8)\n\tf.Uint8VarP(p, name, \"\", value, usage)\n\treturn p\n}\n\n// Uint8P is like Uint8, but accepts a shorthand letter that can be used after a single dash.", "\nfunc (f *FlagSet) Uint8P(name, shorthand string, value uint8, usage string) *uint8 {\n\tp := new(uint8)\n\tf.Uint8VarP(p, name, shorthand, value, usage)\n\treturn p\n}\n\n// Uint8 defines a uint8 flag with specified name, default value, and usage string.", "\n// The return value is the address of a uint8 variable that stores the value of the flag.", "\nfunc Uint8(name string, value uint8, usage string) *uint8 {\n\treturn CommandLine.", "Uint8P(name, \"\", value, usage)\n}\n\n// Uint8P is like Uint8, but accepts a shorthand letter that can be used after a single dash.", "\nfunc Uint8P(name, shorthand string, value uint8, usage string) *uint8 {\n\treturn CommandLine.", "Uint8P(name, shorthand, value, usage)\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.0012338138185441494, 0.00904450099915266, 0.0010641138069331646, 0.004345966503024101, 0.007569306995719671, 0.0016262215794995427, 0.0006880872533656657, 0.0015414116205647588, 0.0013469657860696316, 0.0006880872533656657, 0.0010614106431603432, 0.0008009704179130495, 0.0009201426873914897, 0.000676745839882642, 0.0007186993025243282, 0.0016399800078943372, 0.0015015582321211696, 0.0007186993025243282, 0.0011249406961724162, 0.0007713112281635404, 0.0010435087606310844, 0.0007595652132295072 ]

[ "Exercise for Neck Pain Relief\n\n05/17/2016\n\nWhen we hurt, we usually want someone else to just take the\npain away. ", "Do something for us to remove the pain. ", "Does that work? ", "Not often. ", "Experience\nteaches us – sometimes over and over – the lesson that we must be involved in\nhelping ourselves. ", "This is truth when it comes to neck pain. ", "Atiyeh Chiropractic and Functional Neurology is\nyour partner on your journey toward neck\npain relief. ", "Atiyeh Chiropractic and Functional Neurology is prepared to set the proper Plymouth\nchiropractic treatment plan for neck pain relief that combines the doctor\neffort of spinal manipulation (and knowledge and diagnosis) and patient effort\nof exercise (and appointment keeping and exercise).", "\n\nSo this combined effort of spinal manipulation and exercise\nis a well-studied and continually studied topic in neck pain research. ", "The\ncombination’s outcomes are gauged by the amount of pain relief as well as\nthe amount of functional improvement/quality of life.", "\n\nIn one study, spinal manipulation was statistically\nsignificantly better compared to medication for neck pain relief early on in\ncare (8 to 52 weeks) while home exercise was notably better at week 26 over\nmedication. (", "1) It seems that patients also appreciate supervised strengthening\nexercise mixed with home exercise and spinal manipulation. (", "2) Atiyeh Chiropractic and Functional Neurology\ndefinitely sees the advantage of supervising our Plymouth\nchiropractic patients when they first start doing their neck exercises to be\nsure they are doing them properly and setting up a proper routine that will\nhelp them toward their goal of neck pain relief.", "\n\nStudies report that a combination of manual therapy and\nexercise for neck pain relief is common. ", "The neck exercise program that is most\neffective is always under debate and highly individualized. ", "That’s where\nPlymouth neck pain patients can turn to and rely on their\nPlymouth chiropractor to help. ", "Atiyeh Chiropractic and Functional Neurology has many options for\nneck pain exercise approaches and makes sure the one for you is right for you.", "\nKnowing that a comparison of two neck exercise approaches – stretching exercise\ntraining and sling exercise training for stabilization – shows that both\neffectively improve cervical spine range of motion while sling stabilization\nimproved cervical spine angles more may influence your prescribed exercise plan.", "\n(3) Knowing that in an extensive review of the literature about the\ncombination of manual therapy and exercise for neck pain reports that together\nis more effective for pain reduction and improved quality of life for chronic\nneck pain patients may well also influence your individualized neck pain relief\nexercise plan. ", "Know that, even for whiplash patients, greater short-term pain\nreduction is found with manual therapy and exercise versus traditional care\ncertainly will influence the Plymouth chiropractic treatment plan set\nfor you. (", "4)\n\nSo how do you know which type of exercise or combination of\nspinal manipulation and exercise suits you best for maximal neck pain relief\nand maintenance of that relief? ", "A chat with your chiropractor! ", "Contact\nAtiyeh Chiropractic and Functional Neurology. ", "Together, your Plymouth chiropractor and you will\ndesign the proper exercise program to support and maintain the pain\nrelief you attain with your chiropractic treatment plan for neck pain relief.", "\n\n\"This information and website content is not intended to diagnose, guarantee results, or recommend specific treatment or activity. ", "It is designed to educate and inform only. ", "Please consult your physician for a thorough examination leading to a diagnosis and well-planned treatment strategy. ", "See more details on the DISCLAIMER page.\"", "\n\nAbout Us\n\nCall us to set up an appointment: 734-455-2145\n\nAbout Our Plymouth chiropractic Practice\n\nOur practice at Atiyeh Chiropractic and Functional Neurology focuses on chiropractic wellness as well as relief of pain, especially spine pain and its related conditions. ", "We offer comprehensive care for back pain, neck pain, headaches, shoulder pain, arm pain, leg pain, and injuries to the body from a car accident, sports injury or other cause. ", "Our chiropractic practice respectfully serves the Plymouth area. ", "We pride ourselves on being patient-oriented and active to fulfilling your needs be they about insurance filing or appointment making or your health and healing. ", "We administer individualized treatment plans to accommodate your exact needs. ", "If you're in need of a chiropractor in the Plymouth area, contact us today!" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0018157545709982514, 0.002514224499464035, 0.0008915271027944982, 0.0006916183046996593, 0.0006446153274737298, 0.0096738925203681, 0.01503702625632286, 0.000817177991848439, 0.0007634189096279442, 0.0005282273632474244, 0.0005969091434963048, 0.0005583290476351976, 0.0009228847338818014, 0.0010661386186257005, 0.0007932364824227989, 0.0038294228725135326, 0.007424744311720133, 0.0006454262766055763, 0.0008586698677390814, 0.0008204873302020133, 0.0009724652045406401, 0.02372261881828308, 0.0011474359780550003, 0.001695078331977129, 0.0006300884415395558, 0.0006098069134168327, 0.0005521596758626401, 0.000577086815610528, 0.0006927598151378334, 0.0020089976023882627, 0.0006810585036873817, 0.0008612042875029147, 0.0006357426755130291, 0.00224269088357687 ]

[ "794 F.2d 788\n58 A.F.T.R.2d 86-5377, 55 USLW 2053, 86-2USTC P 9511\nUNITED STATES of America, Appellee,v.Alan HEYMAN, Defendant-Appellant.", "\nNo. ", "1377, Docket 86-1129.", "\nUnited States Court of Appeals,Second Circuit.", "\nSubmitted June 5, 1986.Decided June 27, 1986.", "\n\nRichard Rosenberg, New York City, for defendant-appellant.", "\nLinda Imes, Asst. ", "U.S. Atty. ", " (Rudolph Giuliani, U.S. Atty. ", "for S.D.N.Y., and Bruce Green, Asst. ", "U.S. Atty., ", "of counsel), for appellee.", "\nBefore KAUFMAN, VAN GRAAFEILAND and MINER, Circuit Judges.", "\nIRVING R. KAUFMAN, Circuit Judge:\n\n\n1\nWe are asked to determine whether a statute proscribing certain conduct by financial institutions was properly applied in prosecuting an employee who caused his brokerage firm to unwittingly violate the statute. ", " We have previously held that one who causes another to commit a crime may be punished as a principal pursuant to federal law, although the substantive criminal statute does not apply to him by its terms. ", " Accordingly, we affirm the conviction.", "\n\n\n2\nAlan Heyman, an account executive with Merrill Lynch, Pierce, Fenner & Smith, Inc. (\"Merrill Lynch\"), shared responsibility for several customer accounts with another account executive, Martin Leyton. ", " One of them, jointly held by Sam Silber and his wife, Evelyn, was opened on July 21, 1981. ", " In February 1982, the Silbers sought to deposit a large amount of cash into their account with Merrill Lynch. ", " Having failed to report the cash as income to the Internal Revenue Service, however, the Silbers also did not wish Merrill Lynch to report the deposit to the IRS.1 Federal law provides that a financial institution must file a Currency Transaction Report (\"CTR\") with the IRS for all transactions involving amounts over $10,000. ", " 31 U.S.C. Sec. ", "5313.2\n\n\n3\nTo avoid the filing of a CTR, Heyman and Leyton devised a scheme to circumvent the requirements of Secs. ", "5313 and 5322 of the Bank Secrecy Act, 31 U.S.C. Sec. ", "5311 et seq. ", " (the \"Act\"). ", " On February 11, 1982, Leyton opened two new accounts, one in the name of Sam Silber and the other in the name of Evelyn Silber. ", " Less than one week later, Heyman opened an account bearing the name of the Silbers' daughter, Pearl Schmutter. ", " On February 16, Heyman deposited $9,900 into each of these three accounts as well as into the Silbers' joint account. ", " Accordingly, the total cash invested in these four accounts on February 16 was $39,600.", "\n\n\n4\nOn May 5, 1982, Heyman deposited $9,000 into the joint account of Evelyn and Sam Silber, and $8,000 into Sam Silber's individual account, again avoiding the submission of a CTR with respect to these transactions. ", " A few days later, Heyman transferred the $8,000 from Sam Silber's account to the account Sam held jointly with his wife.", "\n\n\n5\nHeyman undertook his most flagrant attempt to sidestep the reporting requirements on July 26, 1982. ", " On that day, he received a briefcase from Sam Silber containing $70,000 in cash and brought it to his office at Merrill Lynch. ", " There Heyman opened the following joint and individual accounts in the names of Silber and his relatives:\n\nSusan Mark/Pearl Schmutter\nSam Silber/Susan Mark\nEvelyn Silber/Susan Mark\nSam Silber/Pearl Schmutter\nEvelyn Silber/Pearl Schmutter\nSusan Mark\n\n6\nHeyman deposited $7,000 into each of the six new accounts and the four pre-existing accounts. ", " The following day, at Heyman's instructions, all of the money was transferred into the joint account of Sam and Evelyn Silber. ", " Because each of the deposits on July 26 involved amounts less than $10,000, Merrill Lynch did not file CTRs for the transactions.", "\n\n\n7\nAs a result of these deposits and a similar transaction structured by Heyman and Leyton for another client,3 the two account executives were questioned by counsel for Merrill Lynch in March 1983. ", " Leyton was subsequently dismissed by Merrill Lynch, and he agreed to testify for the Government pursuant to a cooperation agreement. ", " Heyman was indicted on charges of conspiracy, 18 U.S.C. Sec. ", "371, and for causing a financial institution to fail to file a Currency Transaction Report for domestic currency transactions involving more than $100,000 in a twelve-month period. ", " 31 U.S.C. Secs. ", "5313(a) and 5322(b).4 After a five-day jury trial, Heyman was convicted on both counts, and he was sentenced to concurrent terms of unsupervised probation for three years.", "\n\nDISCUSSION\n\n8\nConcerned that the nation's financial institutions were serving a larger and increasingly important role in the laundering of unreported income or illegally obtained funds, Congress enacted the Bank Secrecy Act in 1971. ", " The Act provides for \"certain reports or records where they have a high degree of usefulness in criminal, tax, or regulatory investigations or proceedings.\" ", " The Secretary of the Treasury is authorized to prescribe by regulation specific recordkeeping and reporting requirements for financial institutions. ", " California Bankers Ass'n v. Schultz, 416 U.S. 21, 94 S.Ct. ", "1494, 39 L.Ed.2d 812 (1974). ", " Pursuant to that authority, the Secretary implemented 31 C.F.R. Sec. ", "103.22, requiring all financial institutions to file a report for every currency transaction over $10,000.", "\n\n\n9\nOn appeal, Heyman contends that 31 U.S.C. Sec. ", "5313 and the regulations promulgated thereunder proscribe only certain conduct by financial institutions, and that an individual cannot be convicted of violating the terms of the Act. ", " The Government counters that Heyman's conviction is firmly supported by 18 U.S.C. Sec. ", "2(b), which provides that one who willfully causes another to commit a crime is punishable as a principal.", "\n\n\n10\nIn weighing the merits of these arguments, we acknowledge, and the Government concedes, that Heyman did not have a legal duty to file CTRs in his capacity as an account executive at Merrill Lynch. ", " The cashier's department carried that responsibility. ", " We agree with the Government, however, that criminal liability may attach to Heyman's actions through the operation of 18 U.S.C. Sec. ", "2(b), which provides:\n\n\n11\nWhoever willfully causes an act to be done which if directly performed by him or another would be an offense against the United States, is punishable as a principal.", "\n\n\n12\nThe proper application of Sec. ", "2(b) has been the subject of considerable discussion and debate. ", " We have previously held that pursuant to Sec. ", "2(b) an individual can be held culpable for causing a third person to commit a criminal act where the defendant lacks the legal capacity to commit the substantive crime. ", " United States v. Ruffin, 613 F.2d 408 (2d Cir.1979); United States v. Wiseman, 445 F.2d 792 (2d Cir.1971), cert. ", "denied, 404 U.S. 967, 92 S.Ct. ", "346, 30 L.Ed.2d 287 (1972). ", " In Ruffin, the defendant was a personal friend of Olga Defreitas, the director of a federal agency. ", " Ruffin persuaded Defreitas fraudulently to procure approval for the agency to continue renting defendant's unfit premises. ", " The defendant was convicted of fraud in obtaining federal financing, although the relevant statute proscribed certain acts only if committed by a \"director\" or an \"employee\" of a federal agency. ", " Although Defreitas was acquitted of all counts, Ruffin was found guilty pursuant to Sec. ", "2(b). ", " In affirming the conviction, Judge Mansfield noted that Sec. ", "2(b), as amended in 1951, represented an effort by Congress to expand the scope of criminal liability \"so that a person who operates from behind the scenes may be convicted even though he is not expressly prohibited by the substantive statute from engaging in the acts made criminal by Congress.\" ", " 613 F.2d at 413.", "\n\n\n13\nRuffin reaffirmed our previous holding in United States v. Wiseman, supra, that an individual could be found guilty of willfully causing an innocent intermediary to commit a crime, where the intermediary had the legal capacity to commit the offense but the defendant did not. ", " In Wiseman, two private process servers had willfully caused the Clerk of the New York City Civil Court to enter default judgments against parties who in fact had not been properly served. ", " The applicable criminal statute made such acts a crime only if committed \"under color of ... law,\" a category which included the Court Clerk but not the defendants. ", " This Court affirmed the convictions, reasoning that \"if defendants 'willfully caused' the Clerk to enter such judgments, defendants would be culpable to the same extent as the Clerk would be assuming the Clerk had the same knowledge as was possessed by defendants as to the falsity of the papers.\" ", " 445 F.2d at 795.", "\n\n\n14\nOur holdings in both Ruffin and Wiseman relied on the 1951 amendment of Sec. ", "2(b), which broadened the scope of criminal liability. ", " Before the amendment, Sec. ", "2(b) provided:\n\n\n15\nWhoever willfully causes an act to be done which if directly performed by him would be an offense against the United States, is punishable as a principal.", "\n\n\n16\nIn 1951, Congress amended Sec. ", "2(b) to impute criminal liability to anyone who \"willfully causes an act to be done which if directly performed by him or another would be an offense against the United States.\" ", " (emphasis added). ", " Both Ruffin and Wiseman held that the addition of the words \"or another\" reflected a desire by Congress to hold criminally liable those who cause others to commit crimes, without regard to the guilt or innocence of the intermediary or the legal capacity of the defendant to commit the crime.", "\n\n\n17\nThe application of this principle is dispositive in this case. ", " Heyman himself had no legal responsibility to file CTRs. ", " By structuring his customers' deposits so that no single transaction involved an amount greater than $10,000, however, Heyman willfully caused Merrill Lynch to fail to file the appropriate CTRs. ", " Had Merrill Lynch, a financial institution, structured the transactions as Heyman did, it would have violated federal law. ", " Because Sec. ", "2(b) holds liable as a principal any person who willfully causes an act to be done which if directly performed by another (here, Merrill Lynch) would be a federal offense, Heyman is criminally liable for violating 31 U.S.C. Secs. ", "5311 and 5322.", "\n\n\n18\nHeyman nonetheless cites cases in which courts have determined that a bank customer cannot be prosecuted pursuant to Secs. ", "5313 and 5322 of the Bank Secrecy Act. ", "See, e.g., United States v. Anzalone, 766 F.2d 676 (1st Cir.1985) (defendant purchased twelve cashier's checks from bank over a two-week period); United States v. Varbel, 780 F.2d 758 (9th Cir.1986) (defendant purchased six cashier's checks from different banks); United States v. Dela Espriella, 781 F.2d 1432 (9th Cir.1986) (defendant's agents purchased cashier's checks from 19 different banks). ", " We find these cases inapposite to Heyman, and therefore unpersuasive. ", " The defendants in Anzalone, Varbel, and Dela Espriella were bank customers who purchased several cashier's checks, all for sums less than $10,000 individually but with cumulative totals exceeding $10,000. ", " The checks in Varbel and Dela Espriella, however, were purchased from several different banks. ", " Because each of the banks was involved in a currency transaction of less than $10,000, no single financial institution could have been guilty of violating the Act. ", " Similarly, in Anzalone, most of the transactions occurred on different days, albeit with the same bank. ", " Because transactions occurring on different days are not considered to be a single transaction, the bank would not have been required to file a CTR. ", " Accordingly, there was no reason to impute liability to the defendants pursuant to Sec. ", "2(b).5\n\n\n19\nBy contrast, Heyman structured his customers' deposits by dividing large sums into smaller portions and depositing them into newly-created accounts on the same day. ", " Because Merrill Lynch would have been required to file a CTR for cumulative deposits in a single day, this case is distinguishable from those cited by Heyman. ", " See Anzalone, 766 F.2d at 683-84 (Aldrich, J., concurring ).6\n\n\n20\nFinally, the requirement of Sec. ", "2(b) that a defendant's acts be \"willful\" provides adequate protection for individuals who might unwittingly stumble into a violation of federal law. ", " Village of Hoffman Estates v. The Flipside, Hoffman Estates, Inc., 455 U.S. 489, 499, 102 S.Ct. ", "1186, 1193, 71 L.Ed.2d 362 reh'g denied, 456 U.S. 950, 102 S.Ct. ", "2023, 72 L.Ed.2d 476 (1982) (a scienter requirement may mitigate a law's vagueness with respect to adequacy of notice that specified conduct is proscribed); Boyce Motor Lines v. United States, 342 U.S. 337, 342, 72 S.Ct. ", "329, 331, 96 L.Ed. ", "367 (1952) (\"requirement of the presence of culpable intent as a necessary element of the offense does much to destroy any force in the argument that application of the Regulation would be so unfair that it must be held invalid\"). ", " We believe this lends persuasive support to the large number of cases holding that any individual, including a customer, may be held criminally liable for willfully causing a financial institution to fail to file CTRs. ", " See e.g., United States v. Sans, 731 F.2d 1521, 1531-32 & n. 12 (11th Cir.1984), cert. ", "denied, --- U.S. ----, 105 S.Ct. ", "791, 83 L.Ed.2d 785 (1985); United States v. Puerto, 730 F.2d 627, 632-33 (11th Cir.1984), cert. ", "denied, --- U.S. ----, 105 S.Ct. ", "162, 83 L.Ed.2d 98 (1985); United States v. Tobon-Builes, 706 F.2d 1092, 1099-1101 (11th Cir.1983); United States v. Massa, 740 F.2d 629, 645 (8th Cir.1984), cert. ", "denied, --- U.S. ----, 105 S.Ct. ", "2357, 86 L.Ed.2d 258 (1985); United States v. Richter, 610 F.Supp. ", "480, 487-90 (D.C.Ill.1985); United States v. Konefal, 566 F.Supp. ", "698 (N.D.N.Y.1983).", "\n\nCONCLUSION\n\n21\nAccordingly, the judgment of the district court is affirmed.", "\n\n\n\n1\n This practice is often described as \"money laundering\"--\"[a] process by which one conceals the existence, illegal source, or illegal application of income, and then disguises that income to make it appear legitimate.\" ", " Organized Crime and Money Laundering, Record of Hearing v. President's Commission on Organized Crime (March 14, 1984)\n\n\n2\n The back of each Currency Transaction Report form contained the following statement:\nMultiple transactions by or for any person which in any one day total more than $10,000 should be treated as a single transaction, if the institution is aware of them.", "\n\n\n3\n In March 1982, Heyman created a new account in the name of Henry Cohen and deposited $9,500 into that account. ", " Another $9,500 was deposited into a pre-existing joint account of Henry and Carolyn Cohen. ", " The following day, the $9,500 in the Henry Cohen account was transferred to the joint account, the net effect being a deposit of $19,000 into the joint Cohen account. ", " No CTR was filed in this transaction\n\n\n4\n Title 31 U.S.C. Sec. ", "5313 provides in relevant part:\nWhen a domestic financial institution is involved in a transaction for the payment, receipt, or transfer of United States coins or currency (or other monetary instruments the Secretary of the Treasury prescribes), in an amount, denomination, or under circumstances the Secretary prescribes by regulation, the institution and any other participant in the transaction the Secretary may prescribe shall file a report on the transaction at the time and in the way the Secretary prescribes.", "\n31 U.S.C. Sec. ", "5322 provides in relevant part:\n(b) A person willfully violating this subchapter or a regulation prescribed under this subchapter ... while violating another law of the United States or as part of a pattern of illegal activity involving transactions of more than $100,000 in a 12-month period, shall be fined not more than $500,000, imprisoned for not more than 5 years, or both.", "\n\n\n31\n C.F.R. Part 103.22(a) (1982) provides:\nEach financial institution shall file a report of each deposit, withdrawal, exchange of currency or other payment or transfer, by, through or to such financial institution, which involves a transaction in currency of more than $10,000. ", " Such reports shall be made on forms prescribed by the Secretary and all information called for in the forms shall be furnished.", "\n\n\n5\n Three of the cashier's checks in Anzalone were purchased on the same day from the same bank. ", " The total value of the three checks was more than $25,000, thereby requiring the bank to file a CTR. ", " The government, however, did not distinguish between the single-day purchases and the checks obtained over a period of several days. ", " The court, in turn, did not address the issue whether a conviction based only on the single-day purchases would have been proper. ", " 766 F.2d at 684 (Aldrich, J., concurring )\n\n\n6\n One circuit has held that employees, as distinguished from customers, of financial institutions have a legal and fiduciary duty to disclose the true nature of the transactions to the institution. ", " United States v. Thompson, 603 F.2d 1200 (5th Cir.1979). ", " We find it unnecessary, however, to distinguish between a customer and an employee for the purpose of determining criminal liability pursuant to the Act. ", " The plain language of Sec. ", "2(b) gives notice that one who willfully causes another to commit a crime is punishable as a principal, regardless whether he himself would be considered a principal pursuant to the relevant criminal statute\n\n\n" ]

{ "pile_set_name": "FreeLaw" }

[ 0.0007686319877393544, 0.0013787426287308335, 0.000750678707845509, 0.0008588882628828287, 0.0006330268224701285, 0.0006019847933202982, 0.2908988893032074, 0.0019783098250627518, 0.0007737192208878696, 0.12498162686824799, 0.0009351577027700841, 0.0006574694416485727, 0.0007908797706477344, 0.0007597513031214476, 0.0006623605731874704, 0.0005349474959075451, 0.0006228784914128482, 0.0005840414669364691, 0.0006534975254908204, 0.0006861890433356166, 0.001057964051142335, 0.0008164155879057944, 0.0007773615652695298, 0.0007768317591398954, 0.0006420072168111801, 0.0006535893771797419, 0.0015442123403772712, 0.0006181823555380106, 0.0006322444532997906, 0.0006048765499144793, 0.0006825122982263565, 0.0007032579742372036, 0.0006448421045206487, 0.0006987686501815915, 0.0007196241640485823, 0.0006163068464957178, 0.0005579037242569029, 0.0005919362884014845, 0.0010310880606994033, 0.0006931190728209913, 0.00099873635917902, 0.0009922250173985958, 0.0005908920429646969, 0.0006178210023790598, 0.0005842203972861171, 0.46224796772003174, 0.0007277587428689003, 0.0006499840528704226, 0.0006317105144262314, 0.000886974623426795, 0.000760205730330199, 0.000797809159848839, 0.001989378361031413, 0.0005934473592787981, 0.0007929043495096266, 0.0006903716712258756, 0.0015178453177213669, 0.0007283116574399173, 0.0005969036719761789, 0.000605987326707691, 0.0009972426341846585, 0.0009747814619913697, 0.0007238328107632697, 0.0006796835223212838, 0.000599767838139087, 0.0013388002989813685, 0.000771768856793642, 0.0015989617677405477, 0.0007575296331197023, 0.000683831050992012, 0.0006664215470664203, 0.0008274485007859766, 0.0007008737302385271, 0.0007711444632150233, 0.0007214854122139513, 0.0007163705886341631, 0.0008804607205092907, 0.0007501252694055438, 0.0007040291675366461, 0.0007822485058568418, 0.0016916284803301096, 0.0007214389625005424, 0.002575924154371023, 0.00061280548106879, 0.0007235975936055183, 0.0005824540858156979, 0.0008466584258712828, 0.0009416003013029695, 0.0006892222445458174, 0.0012720016529783607, 0.0018009551567956805, 0.0007738103158771992, 0.0006802142015658319, 0.0006878124549984932, 0.0006628000410273671, 0.0006309099844656885, 0.0007231274503283203, 0.0006415347452275455, 0.0007232903735712171, 0.0006114725838415325, 0.0005883059347979724, 0.0008339611231349409, 0.0006538694724440575, 0.0005735176964662969, 0.000668730353936553, 0.0009669772116467357, 0.0008499584509991109, 0.0019461354240775108, 0.0007875139126554132, 0.0006915300036780536, 0.000754883571062237, 0.0006986064254306257, 0.0007418281165882945, 0.0007884732913225889, 0.0008951980271376669, 0.0007884732913225889, 0.0008681811159476638, 0.0007884732913225889, 0.0009705990669317544, 0.0010465801460668445, 0.0007607750012539327, 0.0006332005723379552, 0.0007078308262862265, 0.0005657586152665317, 0.0006489033112302423, 0.0006265470292419195, 0.0006934157572686672, 0.0007996651693247259, 0.0005470390315167606, 0.001057964051142335, 0.0006601752829737961, 0.0006192030268721282, 0.0005467966548167169, 0.0006597661995328963, 0.000664949300698936, 0.0005969955818727612, 0.000679304008372128, 0.0006647614063695073, 0.0008033568155951798, 0.0006269567529670894, 0.0007926838006824255, 0.0010765355546027422 ]

[ "Q:\n\nIs it a good idea to put content access logic in a BaseController?", "\n\nI'm developing an ASP.NET MVC application where the content for any page can be pulled from the database, if it exists, and displayed on the page.", "\nThis is to make it possible for non-technical persons to edit the content without having to go into the source code (e.g. views) and change things.", "\nThe way I'm doing this is, each controller derives from a base controller. ", "The base controller overloads 'OnActionExecuted' and takes this opportunity to pull any content assigned to the current Action/Controller.", "\nIf the action returns a ViewModel that derives from 'ContentViewModel', it populates the 'Text' property of the ViewModel with the text from the database.", "\nAnd then the text gets rendered by the View.", "\nCan you see any weakness to this design?", "\nWould it be better if, rather than having a base controller, I had HtmlHelper extensions for pulling content, which I call from the View?", "\nOne reason I'm asking this is, having my own base controller seems to interfere with calling 'Html.", "RenderAction', which seems to expect the specified controller to directly inherit from 'System.", "Web.", "Mvc.", "Controller'.", "\n\nA:\n\nActionFilters should not be used to pull the content.", "\nControllers should not be used to pull the content but only to dispatch the incoming requests by applying simple logic.", "\nHTML helpers should not be used to pull any content. ", "They are meant to render UI elements prefilled with the supplied data.", "\n\napplication where the content for any page can be pulled from the database\n\nThat's basically how most applications operate.", "\n\nThis is to make it possible for non-technical persons to edit the content without having to go into the source code (e.g. views) and change things.", "\n\nFor non-technical persons to edit content there should be an appropriate UI. ", "Independently of the project underlying technology, non-technical personal is never supposed to edit the code.", "\nI suggest you don't make anything weird but keep things clear. ", "Implement your business layer that will supply the data to models which the view will render. ", "Create a UI for other people to edit the content.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0007478950428776443, 0.000570919131860137, 0.0005776753532700241, 0.0006147293606773019, 0.0006661450024694204, 0.0006104026106186211, 0.0005911968182772398, 0.0010812784312292933, 0.0006101316539570689, 0.0007062284857966006, 0.0006547793163917959, 0.0009731189929880202, 0.0008915416547097266, 0.0010311552323400974, 0.0009243449894711375, 0.0005978260305710137, 0.000751522951759398, 0.0006336424266919494, 0.0006125292857177556, 0.0005776753532700241, 0.0005532311624847353, 0.0006287085125222802, 0.0008546834578737617, 0.0007627600571140647, 0.0006791075575165451, 0.001994825666770339 ]

[ "Note: Javascript is disabled or is not supported by your browser. ", "For this reason, some items on this page will be unavailable. ", "For more information about this message, please visit this page:\nAbout CDC.gov\n\nPROBLEM/CONDITION: The U.S. population continues to diversify, and certain racial/ethnic minorities are growing at a substantially more rapid pace than the majority population. ", "Limited large-scale population-based surveys and surveillance systems are designed to monitor the health status of minority populations. ", "The Racial and Ethnic Approaches to Community Health (REACH) 2010 Risk Factor Survey is conducted annually in minority communities in the United States. ", "The survey focuses on four minority populations (blacks, Hispanics, Asians/Pacific Islanders [A/PIs], and American Indians). ", "REPORTING PERIOD COVERED: 2001-2002. ", "DESCRIPTION OF SYSTEM: Telephone (n = 18 communities) and face-to-face (n = 3 communities) interviews were conducted in 21 communities located in 14 states (Alabama, California, Georgia, Illinois, Louisiana, Massachusetts, Michigan, New York, North Carolina, Oklahoma, South Carolina, Tennessee, Texas, and Washington). ", "An average of 1,000 minority residents aged >/=18 years in each community was sampled. ", "Interviews were administered in English, Spanish, Vietnamese, Khmer, or Mandarin Chinese. ", "The median response rate for household screenings was 74.0% for households that were reached and 72.0% for family members interviewed. ", "The self-reported data from the community were compared with data derived from the Behavioral Risk Factor Surveillance System (BRFSS) for the metropolitan/micropolitan statistical area (MMSA) or the state where the community was located and compared with national estimates from BRFSS. ", "RESULTS: Reported education level and household income were markedly lower in minority communities than the general population living in the comparison MMSA or state. ", "More minorities reported being in fair or poor health, but they did not see a doctor because of the cost. ", "Substantial variations were observed in the prevalence of health-risk factors and selected chronic conditions among minority populations and in communities within the same racial/ethnic minority. ", "The median prevalence of obesity among A/PI men and women was 2.9% and 3.6%, respectively, whereas 39.2% and 37.5% of American Indian men and women were obese, respectively. ", "Cigarette smoking was common in American Indian communities, with a median of 42.2% for men and 36.7% for women. ", "Compared with the national level, fewer minority adults reported eating >/=5 fruits and vegetables daily and met recommendations for moderate or vigorous leisure-time physical activity. ", "American Indian communities had a high prevalence of self-reported cardiovascular disease, hypertension, high blood cholesterol, and diabetes. ", "A high prevalence of hypertension and diabetes was also observed in black communities (32.0% and 10.9%, respectively, for men and 40.4% and 14.3%, respectively, for women). ", "Compared with the general U.S. population, a substantially lower percentage of Hispanics and A/PIs had reported receiving preventive services (e.g., cholesterol screenings; glycosylated hemoglobin tests and foot examinations for patients with diabetes; mammograms and Papanicolaou smear tests; and vaccination for influenza and pneumonia among adults aged >/=65 years). ", "INTERPRETATION: Data from the REACH 2010 Risk Factor Survey demonstrate that residents in the minority communities bear greater risks for disease compared with the general population living in the same MMSA or state. ", "Substantial variations in the prevalence of risk factors, chronic conditions, and use of preventive services among different minority populations and in communities within the same racial/ethnic population provide opportunities for public health interventions. ", "These variations also indicate that different racial/ethnic populations and different communities should have different priorities in eliminating health disparities. ", "PUBLIC HEALTH ACTIONS: The continuous surveillance of health status in minority communities is necessary so that culturally sensitive prevention strategies can be tailored to these communities and program interventions evaluated.", "\n\nNational Center for Chronic Disease Prevention and Health Promotion (U.S.), Racial and Ethnic Approaches to Community Health.. Centers for Disease Control and Prevention (U.S.).", "\n\nPublished:\n\n2007\n\nDescription:\n\nEliminating racial and ethnic disparities in health has become a focal point in the prevention of unnecessary illness, disability, premature death, and the promotion of quality years of life for all persons. ", "The Centers for Disease Control and Preven...\n\nCenters for Disease Control and Prevention (U.S.). ", "Office of Minority Health and Health Equity.", "\n\nPublished:\n\nApril 18, 2014\n\nSeries:\n\nMMWR. ", "Morbidity and mortality weekly report ; v. 63, suppl. ", "no. ", "1\n\nDescription:\n\nIn public health, a key challenge is moving from accurate monitoring to effective intervention. ", "Selected findings for health determinants and outcomes were reported in the CDC Health Disparities and Inequalities Report—United States, 2011; a second...\n\nThe HIV epidemic continues to disproportionately affect ethnic minority youth. ", "These disconcerting health disparities indicate that although existing HIV preventive strategies for ethnic minority youth have been efficacious, they have not significant..." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0008608666248619556, 0.0005748883704654872, 0.000706619000993669, 0.0010694483062252402, 0.0007198608363978565, 0.0033225922379642725, 0.0005850811139680445, 0.0005522312130779028, 0.0013557766797021031, 0.0005641163443215191, 0.0006133809802122414, 0.0005592227098532021, 0.0005883414996787906, 0.0740562304854393, 0.0007004023063927889, 0.01616646535694599, 0.0072964816354215145, 0.0007926358375698328, 0.0010845290962606668, 0.001270363456569612, 0.0011305666994303465, 0.0005825326079502702, 0.0006354246288537979, 0.0008190610096789896, 0.0005859726225025952, 0.0006384647567756474, 0.0018341175746172667, 0.0006422153091989458, 0.0013944933889433742, 0.0006306574214249849, 0.005035026464611292, 0.0013787426287308335, 0.0005621376913040876, 0.0011664502089843154, 0.005684214178472757 ]

[ "[Research progress of the atypical kinetic profiles of cytochrome P450 enzymes].", "\nCytochrome P450 enzymes are composed of many isozymes and involved in the biotransformation of both exogenous and endogenous substances. ", "A growing number of studies have found that the P450 enzymes do not always follow the classical Michaelis-Menten kinetics, but show atypical kinetic behavior, which is also the current research hotspot. ", "In this paper, the category and mechanisms of atypical kinetics of the P450 enzyme were reviewed, providing theoretical basis for the research of enzyme kinetics." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005877140793018043, 0.0007518793572671711, 0.0005905030411668122, 0.0005446738214232028 ]

[ "Hydro-mechanical steering differential systems are popularly employed in large track-type tractors and the like to provide smooth, equal and uninterrupted power and torque flow to both tracks at all times, including turns. ", "A hydro-mechanical steering differential system is powered by a mechanical input and a hydraulic input. ", "The mechanical input is typically from the transmission, while the hydraulic input is received from an engine driven variable displacement pump. ", "One such hydro-mechanical steering differential is disclosed in U.S. Pat. ", "No. ", "4,434,680 for a Planetary Steering Differential, issued Mar. 6, 1984 to Craig W. Riediger, et al and assigned to the assignee hereof. ", "Such patent discloses the use of three separate planetary mechanisms. ", "While suitable for large tractors, the three planetary mechanisms make the system not only complex and costly, it requires a large amount of space to contain all of the components.", "\nThus what is desired is a truly compact hydro-mechanical steering differential which is less complex, less costly and adaptable to smaller tractors.", "\nThe present invention is directed to overcoming the shortcomings of the prior attempts at providing a such a hydro-mechanical steering differential for smaller tractors." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0005956911481916904, 0.0006659904611296952, 0.0005830639274790883, 0.00060122279683128, 0.0013787426287308335, 0.0006136794690974057, 0.0006115201395004988, 0.00057776621542871, 0.0006599768530577421, 0.0007445189985446632 ]

[ "Q:\n\nHow is MEF calculated for Canadian VNC?", "\n\nAccording to the VNC, the MEF represents the highest feature in each quadrangle. ", "It refers to \n\nAIM RAC 5.4 and CAR 602.15(2b) which basically says \"lower than 500 AGL (CAR 602.14(2b)) ok, when for aerial application or aerial inspection, photography, ...\"\nAIM AIR 1.5 which is about \"Pressure Altitude\" which I guess is because the heights are ASL\n\nNow, the sample quadrangle here shows a MEF of 2700'. ", "Looking at that quadrangle, the highest obstacle I would say is the mountain in the very east, north of 50°35' which is 2290' high. ", "I wonder where that difference comes from.", "\nI think that both figures, 2700' MEF and 2290' are ASL. ", "Therefore it can't be the difference between ASL and AGL.", "\nIt always seems to be ~400' more than the highest feature.", "\n\nA:\n\nAccording to Aeronautical Information Circular 26/11 VFR Navigation Charts—Clarification of the Maximum Elevation Figure the \n\nThe MEF is calculated by taking the higher value of:\n\nthe top elevation of the highest obstacle plus the vertical accuracy (variable) of the terrain\n source data; or\nthe elevation of the highest terrain plus 328 feet plus vertical accuracy of the terrain source\n data.", "\n\nSo the 2700' could come from 2290' plus 328' rounded up to next hundred feet. ", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0007225081790238619, 0.0006099269376136363, 0.0005971600185148418, 0.0006405488820746541, 0.0006140515906736255, 0.0007663409924134612, 0.0007608014857396483, 0.0006328069139271975, 0.0005521170096471906, 0.0006916749989613891, 0.001994825666770339 ]

[ "List of graduates of the Japanese Imperial Military Academies\n\nThis is a select list of graduates from the Japanese Imperial Military Academies (1891–1934). ", "It is not complete.", "\n\nGraduates from the Imperial Japanese Army Academy (Military Academy)\n\n1891 Class\nKazushige Ugaki: 1891\n\n1897 Class\nSadao Araki: November\nJinsaburo Mazaki: November\n\n1904 Class\nTetsuzan Nagata: October\n\n1905 Class\nMichitarō Komatsubara\n\n1906 Class\nHiroshi Ōshima\n\n1908 Class\nNaruhiko Higashikuni\n\n1912 Class\nTorashirō Kawabe: May\n\n1915 Class\nKitsuju Ayabe: May\n\n1921 Class\nAkira Mutō: assigned to Military Academy, April\n\n1922 Class\nTakushiro Hattori: July\n\n1923 class\nHiromichi Yahara\n\nGraduates from the Japanese Army War College\nThe following were notable graduates of the Army War College:\n\n1903 Class\nHisaichi Terauchi: December\n\n1909 Class\nOtozō Yamada: December\n\n1910 Class\nToshizō Nishio: graduated from War College, assigned to Military Affairs Bureau, November\nKoiso Kuniaki: November\nGen Sugiyama: November\nShunroku Hata: graduated with top scholarly rank, November\n\n1911 Class\nYoshijirō Umezu: November\nTetsuzan Nagata: November\n\n1912 Class\nKenji Doihara: November\n\n1913 Class\nYasuji Okamura: November\n\n1914 Class\nRikichi Andō: December\nKeisuke Fujie: November\nNaruhiko Higashikuni\n\n1915 Class\nHiroshi Ōshima\nHideki Tōjō: December\nMasaharu Homma: December\nShōjirō Iida: December\nHitoshi Imamura: December\nMasakazu Kawabe\n\n1916 Class\nSeishirō Itagaki: November\nTomoyuki Yamashita: November\nShizuichi Tanaka\nShigenori Kuroda: November\nHeitarō Kimura: November\n\n1917 Class\nRenya Mutaguchi: November\nJun Ushiroku: November\nTeiichi Suzuki: November\nKenryo Sato (Chief, Military Affairs Section, War Ministry; Chief, Military Affairs Bureau, same Ministry)\nSeizo Arisue (Chief, Second Bureau-Intelligence, Army General Staff)\nTan Nukata (Chief, Third Bureau—Logistics, Army General Staff; Chief, General Affairs Bureau, do; Chief, Personnel Bureau, War Ministry)\nGoro Isoya (Chief, Third Bureau-Logistics, Army General Staff)\n\n1918 Class\nKorechika Anami: November\nKiichiro Higuchi: November\nKanji Ishiwara: November\n\n1919 Class\nHideyoshi Obata: December\nSōsaku Suzuki: November\n\n1920 Class\nHidemitsu Nakano: November\nKingoro Hashimoto\nAkira Mutō\n\n1921 Class\nTorashirō Kawabe: November\nHarukichi Hyakutake: December\n\n1922 Class\nKiyotake Kawaguchi: November\nHatazō Adachi: November\nTakushiro Hattori (Chief, Second Section operations, Army General Staff)\nSusumu Nishiura (Chief, Army Affairs Section, War Ministry)\nAkiho Ishii (Chief, Military Affairs Section, War Ministry)\n\n1923 Class\nTadamichi Kuribayashi: November\nHong Sa-ik\nOkikatsu Arao (Koko) (Chief, Shipping Section, Army General Staff; senior Staff Officer, Army Affairs Section, War Ministry; Chief, Third Section—Organization and Mobilization, Army General Staff)\nHiroo Sato (Chief, War Materiel Section, War Ministry; and an officer who, like Col Arao, had the confidence of War Minister Anami)\nYozo Miyama (Chief, Third Section-Organization and Mobilization, Army General Staffs post which he held before the author assumed it; and Senior Adjutant, War Ministry)\nMakoto Matsutani (Chief, 20th Group-War Coordination, Army General Staff; Military Secretary to Prime Minister Suzuki)\n\n1925 Class\nShizuo Yokoyama: November\n\n1927 Class\nTakeshi Mori: December\n\n1929\nHiromichi Yahara: returned as an instructor 1937-1940\n\n1930 Class\nTakushiro Hattori: November\nMasutaro Nakai: December\n\n1931 Class\nMasanobu Tsuji\n\n1944 Class\nTakagi Masao (3rd President of South Korea, also known as Park Chung-hee)\n\nGraduates in Military Overseas Studies\nShunroku Hata: Military Student, Germany, March 1912\nHisaichi Terauchi: Military Student, Germany, February 1913\nYoshijirō Umezu: Military Student, Germany, April 1913\nMasaharu Homma: Military Student, England, August 1918 (and served as observer with British forces in France)\nHitoshi Imamura: Military Student, England, April 1918; Assistant Military Attaché, England, October 1918\nNaruhiko Higashikuni: Resident Officer, France, studying military tactics, April 1920\nTomoyuki Yamashita: Military Student. ", "Germany, July 1921\nHideyoshi Obata: Military Student, England, April 1923; Major, March 1926\nMinoru Sasaki: Military Student, U.S.S.R., September 1927; same for Poland and U.S.S.R., August 1928\nTorashirō Kawabe: Resident Officer, Riga, Latvia (studying Soviet military affairs), January 1926-September 1928\n\nStudents in Army Cavalry School\nKitsuju Ayabe: Equitation Student, October 1917\n\nGraduates from Artillery and Engineering School\nTakeo Yasuda: July 1916\n\nGraduates from the Imperial Japanese Naval Academy\nKantarō Suzuki: 1887\nMitsumasa Yonai: 1901\nShigetarō Shimada: November 1904\n\nGraduates from the Naval War College\nKantarō Suzuki: 1898\nShigetarō Shimada: Class \"A\" Student, December 1913\nMitsumasa Yonai: 1913\n\nJapanese Imperial Military Academies\nImperial Military Academies\nCategory:Military history of Japan\nCategory:Japanese military-related lists" ]

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

[ 0.0005818714271299541, 0.00072306307265535, 0.0010290747741237283, 0.0007540768128819764 ]

[ "Concentrations of endogenous digitalis-like factors (EDLF) that inhibit Na pump activity are elevated in hypertensive humans and laboratory animals, but their chemical structures, the causes of these elevations, and their role in the development of hypertension remain to be clarified. ", "EDLF include a ouabain-like compound (OLC) that is primarily of adrenal origin, and a more recently discovered bufodienolide (i.e. a marinobufagenin-like compound or MBG), so-called since it was first isolated in toad venom. ", "Studies in our laboratory have shown that MBG is a more rapidly acting and more potent constrictor of rat aorta than OLC, that plasma concentrations of MBG are stimulated during (a) expansion on plasma volume of dogs, (b) conditioned respiratory suppression that increases pCO2 in micropigs, and (c) intervals of voluntary hypoventilation by humans. ", "During the current year, administration of adrenocorticotrophic hormone (which stimulates adrenocortical activity) for seven days was found to increase concentrations of MBG in plasma and inhibit Na pump activity in vascular smooth muscle of rats. ", "This study showed that changes in Na,K-ATPase activity in vascular smooth muscle cannot necessarily be inferred from changes in erythrocyte Na,K-ATPase activity. ", "In addition, MBG administration was found to have a greater inhibitory effect on alpha-1 isoforms of Na,K-ATPase, which predominate in vascular smooth muscle, than administration of ouabain, while ouabain had a greater inhibitory effect on alpha-3 isoforms of Na,K-ATPase, which predominate in neural tissues The ability of cells to increase genetic expression of Na,K-ATPase to compensate for inhibitory effects of sodium pump inhibitors remains to be clarified, as do the effects on vascular tone and blood pressure of sustained elevations in MBG." ]

{ "pile_set_name": "NIH ExPorter" }

[ 0.0006008641794323921, 0.0012589102843776345, 0.0011034869821742177, 0.0007062533986754715, 0.0007496335310861468, 0.0006594754522666335 ]

[ "A few hours back, Microsoft made a move by not accepting bitcoin deposits that certainly left the bitcoin community scrambled. ", "The “Redeem bitcoin” link on Microsoft’s website, Account.Microsoft.com had been removed. ", "But the tech giant took a step back and has resumed the bitcoin deposits.", "\n\n\nThe users of cryptocurrencies are used to see the adoption of these exchange instruments by companies. ", "Though, time to time there are setbacks, just like the software giant did by reversing its position on bitcoin.", "\n\nWhen Microsoft stopped accepting bitcoin deposits\n\nIt all started when the technology giant canceled its bitcoin funding method for clients. ", "Even an email has been sent to all of the clients of Microsoft that could have affected by the bitcoin funding issue. ", "There has been a lot of speculation on the community forums and social media regarding the same that got settled by Microsoft’s statement.", "\n\nAs per media sources, on asking if they have stopped accepting bitcoin as a currency, Microsoft answered:\n\n“Thank you for bringing this to our attention. ", "We understand how important this is for you. ", "Since you have me here now, we’ll be more than happy to help you. ", "To clarify this, Last December 26, Microsoft is no longer accepting bitcoin in exchange for credit on the customer’s account. ", "The Redeem bitcoin link on Account.Microsoft.com has been removed, so customers like you will no longer see the option. ", "Previous redeem error information has been removed from this post.”", "\n\nThough the support staff of Microsoft is not at liberty to disclose their reasons for such a move the discussion in different forums with their employees revealed that it was because of operational issues. ", "This can be understood by their retract on not accepting bitcoin decision.", "\n\n\nMicrosoft’s Retract from “not accepting bitcoin”\n\nNow, Microsoft has resumed accepting bitcoins as a payment after halting the transactions only temporarily.", "\n\nA Microsoft spokesperson confirmed the suspension and that it has been restored:\n\n“We’ve restored bitcoin as a payment option in our store after working with our provider to ensure lower bitcoin amounts would be redeemable by customers”.", "\n\nIn another interesting event, JP Morgan boss Jamie Dimon said that he regretted calling bitcoin a fraud, the mirroring responses in the market can be felt. ", "Also, the long transaction wait times and skyrocketing fees, are making the use of bitcoin network a bit difficult.", "\n\nSurmising the Microsoft Bitcoin Controversy\n\nThis isn’t anything new! ", "Since 2014, Microsoft has allowed its users to add money to their Microsoft account by making use of bitcoin. ", "However, once in 2015 and 2016, both the years, the software giant stopped supporting the bitcoin, but temporarily. ", "So, it was just a temporary measure of Microsoft’s to accept lower redeemable bitcoin amounts!", "\n\nLet us know your thoughts on bitcoin the comments below or write to us at [email protected]\n\nThe presented content may include the personal opinion of the author and is subject to market condition. ", "Do your market research before investing in cryptocurrencies. ", "The author or the publication does not hold any responsibility for you personal financial loss.", "\n\nTo get the daily price analysis, Follow us on TradingView" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0007624838617630303, 0.002535176230594516, 0.0019880542531609535, 0.000682120502460748, 0.0008163459715433419, 0.0008683429332450032, 0.0007252136711031199, 0.000541915011126548, 0.000668357009999454, 0.0005538339028134942, 0.0005981797003187239, 0.0007074939785525203, 0.0017046963330358267, 0.0006140533951111138, 0.0005879090749658644, 0.0008302111527882516, 0.0009014880051836371, 0.0007232976495288312, 0.00132885726634413, 0.0009503673063591123, 0.0018090412486344576, 0.0009564930223859847, 0.0007136636995710433, 0.0010972138261422515, 0.0007242298452183604, 0.0014073577476665378, 0.0025186578277498484, 0.000637931632809341 ]

[ "The park consists of 76,679 acres (119.811 sq mi; 31,031 ha; 310.31 km2) of high desert located on the Colorado Plateau.[5] The highest elevation in the park is 5,653 feet (1,723 m) at Elephant Butte, and the lowest elevation is 4,085 feet (1,245 m) at the visitor center. ", "The park receives an average of less than 10 inches (250 mm) of rain annually.", "\n\nAdministered by the National Park Service, the area was originally named a national monument on April 12, 1929, and was redesignated as a national park on November 12, 1971.[6] The park received more than 1.6 million visitors in 2018.[2]\n\nContents\n\nThe national park lies above an underground evaporite layer or salt bed, which is the main cause of the formation of the arches, spires, balanced rocks, sandstonefins, and eroded monoliths in the area. ", "This salt bed is thousands of feet thick in places, and was deposited in the Paradox Basin of the Colorado Plateau some 300 million years ago (Mya) when a sea flowed into the region and eventually evaporated. ", "Over millions of years, the salt bed was covered with debris eroded from the Uncompahgre Uplift to the northeast. ", "During the Early Jurassic (about 210 Mya), desert conditions prevailed in the region and the vast Navajo Sandstone was deposited. ", "An additional sequence of stream-laid and windblown sediments, the Entrada Sandstone (about 140 Mya), was deposited on top of the Navajo. ", "Over 5,000 feet (1,500 m) of younger sediments were deposited and have been mostly eroded away. ", "Remnants of the cover exist in the area including exposures of the CretaceousMancos Shale. ", "The arches of the area are developed mostly within the Entrada formation.[7]\n\nThe weight of this cover caused the salt bed below it to liquefy and thrust up layers of rock into salt domes. ", "The evaporites of the area formed more unusual \"salt anticlines\" or linear regions of uplift.[7]Faulting occurred and whole sections of rock subsided into the areas between the domes. ", "In some places, they turned almost on edge. ", "The result of one such 2,500-foot (760 m) displacement, the Moab Fault, is seen from the visitor center.", "\n\nAs this subsurface movement of salt shaped the landscape, erosion removed the younger rock layers from the surface. ", "Except for isolated remnants, the major formations visible in the park today are the salmon-colored Entrada Sandstone, in which most of the arches form, and the buff-colored Navajo Sandstone. ", "These are visible in layer-cake fashion throughout most of the park. ", "Over time, water seeped into the surface cracks, joints, and folds of these layers. ", "Ice formed in the fissures, expanding and putting pressure on surrounding rock, breaking off bits and pieces. ", "Winds later cleaned out the loose particles. ", "A series of free-standing fins remained. ", "Wind and water attacked these fins until, in some, the cementing material gave way and chunks of rock tumbled out. ", "Many damaged fins collapsed. ", "Others, with the right degree of hardness and balance, survived despite their missing sections. ", "These became the famous arches.", "\n\nAlthough the park's terrain may appear rugged and durable, it is extremely fragile. ", "More than 1 million visitors each year threaten the fragile high-desert ecosystem.[8] The problem lies within the soil's crust, which is composed of cyanobacteria, algae, fungi, and lichens that grow in the dusty parts of the park. ", "Factors that make Arches National Park sensitive to visitor damage include being a semiarid region, the scarce, unpredictable rainfall, lack of deep freezing, and lack of plant litter, which results in soils that have both a low resistance to, and slow recovery from, compressional forces such as foot traffic. ", "Methods of indicating effects on the soil are cytophobic soil crust index, measuring of water infiltration, and t-tests that are used to compare the values from the undisturbed and disturbed areas.[9]\n\nHumans have occupied the region since the last ice age 10,000 years ago. ", "Fremont people and ancestral Puebloans lived in the area until about 700 years ago. ", "Spanish missionaries encountered Ute and Paiute tribes in the area when they first came through in 1775, but the first European-Americans to attempt settlement in the area were the Mormon Elk Mountain Mission in 1855, who soon abandoned the area. ", "Ranchers, farmers, and prospectors later settled Moab in the neighboring Riverine Valley in the 1880s. ", "Word of the beauty of the surrounding rock formations spread beyond the settlement as a possible tourist destination.", "\n\nThe Arches area was first brought to the attention of the National Park Service by Frank A. Wadleigh, passenger traffic manager of the Denver and Rio Grande Western Railroad. ", "Wadleigh, accompanied by railroad photographer George L. Beam, visited the area in September 1923 at the invitation of Alexander Ringhoffer, a Hungarian-born prospector living in Salt Valley. ", "Ringhoffer had written to the railroad in an effort to interest them in the tourist potential of a scenic area he had discovered the previous year with his two sons and a son-in-law, which he called the Devils Garden (known today as the Klondike Bluffs). ", "Wadleigh was impressed by what Ringhoffer showed him, and suggested to Park Service director Stephen T. Mather that the area be made a national monument.", "\n\nA succession of government investigators examined the area, in part due to confusion as to the precise location. ", "In the process, the name Devils Garden was transposed to an area on the opposite side of Salt Valley that includes Landscape Arch, the longest arch in the park. ", "Ringhoffer's original discovery was omitted, while another area nearby, known locally as the Windows, was included. ", "Designation of the area as a national monument was supported by the Park Service from 1926, but was resisted by President Calvin Coolidge's Interior Secretary, Hubert Work. ", "Finally, in April 1929, shortly after his inauguration, President Herbert Hoover signed a presidential proclamation creating Arches National Monument, consisting of two comparatively small, disconnected sections. ", "The purpose of the reservation under the 1906 Antiquities Act was to protect the arches, spires, balanced rocks, and other sandstone formations for their scientific and educational value. ", "The name Arches was suggested by Frank Pinkely, superintendent of the Park Service's southwestern national monuments, following a visit to the Windows section in 1925.", "\n\nIn late 1938, President Franklin D. Roosevelt signed a proclamation that enlarged Arches to protect additional scenic features and permit development of facilities to promote tourism. ", "A small adjustment was made by President Dwight Eisenhower in 1960 to accommodate a new road alignment.", "\n\nIn early 1969, just before leaving office, President Lyndon B. Johnson signed a proclamation substantially enlarging Arches. ", "Two years later, President Richard Nixon signed legislation enacted by Congress, which significantly reduced the total area enclosed, but changed its status to a national park.", "\n\nClimbing Balanced Rock or any named or unnamed arch in Arches National Park with an opening larger than 3 ft (0.9 m) is banned by park regulations. ", "Climbing on other features in the park is allowed, but regulated; in addition, slacklining and BASE jumping are banned parkwide.[12]\n\nClimbing on named arches within the park had long been banned by park regulations, but following Dean Potter's successful free climb on Delicate Arch in May 2006, the wording of the regulations was deemed unenforceable by the park attorney. ", "In response, the park revised its regulations later that month,[13]\neventually imposing the current ban on arch climbing in 2014.[14]\n\nApproved recreational activities include auto touring,[15] hiking,[16] bicycling,[17] camping at the Devils Garden campground,[18] backpacking,[19] canyoneering,[20] and rock climbing,[21] with permits required for the last three activities. ", "Guided commercial tours[22] and ranger programs are also available.[23]\n\nAstronomy is also popular in the park due to its dark skies, despite the increasing light pollution from towns such as Moab.[24][25]\n\nDelicate Arch is the subject of the third 2014 quarter of the U.S. Mint'sAmerica the Beautiful Quarters program commemorating national parks and historic sites. ", "The Arches quarter had the highest production of the five 2014 national park quarters, with more than 465 million minted.[26]\n\nBiological soil crust consisting of cyanobacteria, lichen, mosses, green algae, and microfungi is found throughout southeastern Utah. ", "The fibrous growths help keep soil particles together, creating a layer that is more resistant to erosion. ", "The living soil layer readily absorbs and stores water, allowing more complex forms of plant life to grow in places with low precipitation levels.[32]\n\n^Cannon, Kate (September 29, 2014). \"", "Activities on Arches Determination - Arches National Park\". ", "NPS.gov. ", "National Park Service. ", "Retrieved January 13, 2018. ", "In accordance with the provisions of 36 CFR 1.5, and the requirements of NPS Management Policies 2006 Sections 1.5 and 8.2, it is my professional judgment that it is necessary to prohibit climbing, scrambling, or walking upon, wrapping webbing or rope around, or rappelling from any arch with an opening greater than 3 feet in Arches and Canyonlands National Parks, except for Washer Woman Arch in the Island in the Sky District of Canyonlands." ]

{ "pile_set_name": "Pile-CC" }

[ 0.000696183240506798, 0.000607623194810003, 0.0005958899273537099, 0.0007116412161849439, 0.0006374825024977326, 0.0005557613912969828, 0.0006033784011378884, 0.0006209132843650877, 0.0005558260018005967, 0.0006358962855301797, 0.0007201113039627671, 0.0007303366437554359, 0.0006732832407578826, 0.0006863758317194879, 0.0006340924883261323, 0.0006789587205275893, 0.0005963396397419274, 0.005065553821623325, 0.0006422547157853842, 0.0006018514395691454, 0.0008674745331518352, 0.012308702804148197, 0.0005560396239161491, 0.0007135341293178499, 0.0005978947156108916, 0.0008007269934751093, 0.0008054636418819427, 0.0006149608525447547, 0.0006782182608731091, 0.0007881569908931851, 0.0007412483100779355, 0.000536362815182656, 0.0006361266132444143, 0.0006480649462901056, 0.0006443294696509838, 0.0006340789259411395, 0.0005330611602403224, 0.0006667687557637691, 0.0006578323082067072, 0.0005424687988124788, 0.0005770694697275758, 0.0005414931802079082, 0.000571070471778512, 0.0005967888282611966, 0.0005482861306518316, 0.0006183667574077845, 0.0006213395390659571, 0.000703072699252516, 0.0006527798250317574, 0.0006657156045548618, 0.0006123252678662539, 0.0006631112191826105, 0.0007253750809468329, 0.0006104608764871955, 0.0005670834798365831, 0.0007787810172885656, 0.0007701030699536204, 0.0006518913432955742, 0.0006134204450063407 ]

[ "Cheap Jerseys Free Shipping\n\nIf you find this behavior changes in your children, it is the high time that you get the services of a Child behavioral therapist.", "As is evident by the information in this article, affiliate marketing isn’t quite as complex as it seems at first glance. ", "Choices! ", "Don絫 be scared, Cheap Jerseys , within five minutes you can master your Blackberry Bold 9700 thanks to a couple of easy and logical decisions. ", "The walk and play times not only give you the exercise you need but the very important break for your eyes. ", "Whether or not or not oneself can retain the services of the around talked about absolutely free associate monitoring computer software, yourself are however prompt toward Deliver an associate software program some principle. ", "Its Gross State Product of nearly USD 2 trillion is the biggest among the states. ", "These come in various sizes from your hand scrapper that is just a couple of inches broad to the half a dozen inch scrapper making speed up. ", "Cheap Jerseys China Wholesale . ", "Security should be one of your top considerations when buying a new bag for travel. ", "And So I want to get my blade from following your work is thru as well as dry it well and then leave out regarding my own scrapper until the subsequent work. ", "The second choice is to register for in a phlebotomy program featured by one of the phlebotomy coaching schools in California. ", "Wholesale Jerseys From China . ", "Also, the delivery system is not as efficient. ", "When you complete your dissertation, you need to have something specific to explain.", "\nVisit my site：http://www.cheapwholesalesportsnfljerseys.com/" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0036514056846499443, 0.0005851968307979405, 0.0012053066166117787, 0.01112937368452549, 0.0011274704011157155, 0.0006334833451546729, 0.0007387142977677286, 0.0024354453198611736, 0.0008704138454049826, 0.0007827317458577454, 0.002796177752315998, 0.0005906873266212642, 0.0006353622302412987, 0.0007351810927502811, 0.0006778088863939047, 0.0006951853865757585 ]

[ "Den internationella flyktingkrisen lämnar knappast någon oberörd. ", "Sverige har tagit ett stort ansvar genom att erbjuda en fristad åt människor på flykt. ", "Under 2015 sökte nästan 163 000 asyl här, följt av ytter­ligare nästan 29 000 förra året. ", "Långt ifrån alla dessa asylsökande kommer att stanna, men utfallet blir ändå en kraftig befolkningsökning." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.01676655001938343, 0.21920956671237946, 0.14412996172904968, 0.21956640481948853 ]

[ "import javascript\nimport semmle.javascript.security.", "IncompleteBlacklistSanitizer\n\nfrom IncompleteBlacklistSanitizer sanitizer\nselect sanitizer,\n \"This \" + sanitizer.getKind() + \" sanitizer does not sanitize \" +\n describeCharacters(sanitizer.getAnUnsanitizedCharacter())\n" ]

{ "pile_set_name": "Github" }

[ 0.001128919655457139, 0.008319880813360214 ]

[ "Nardò Cathedral\n\nNardò Cathedral () is a Roman Catholic cathedral in the town of Nardò, province of Lecce, region of Apulia, Italy, dedicated to the Assumption of the Virgin Mary. ", "Formerly the seat of the bishops of Nardò, since 1986 it has been the episcopal seat of the diocese of Nardò-Gallipoli.", "\n\nHistory\nThe present cathedral probably stands on the site of a Byzantine church. ", "In 1080, a church was built here by the conquering Normans, which was elevated to the status of a cathedral in the early 15th century.", "\n\nThe building has undergone a number of refurbishments. ", "The present façade dates to 1710–1725. ", "The interior contains both medieval frescoes and 19th-century frescoes by Cesare Maccari.", "\n\nReferences\n\nCategory:Cathedrals in Apulia\nCategory:Roman Catholic cathedrals in Italy\nCathedral\nCategory:11th-century Roman Catholic church buildings\nCategory:Roman Catholic churches completed in 1725\nCategory:Churches in the province of Lecce" ]

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

[ 0.0008750827983021736, 0.0007033823058009148, 0.0006495694979093969, 0.0007236803648993373, 0.0006466474151238799, 0.0006252406747080386, 0.0006379747646860778, 0.0006079432205297053 ]

[ "Street price: $550; deal price $480\n\nClip the on-page coupon to bring this Chromebook down to $480, a surprising $10 drop from the pricing we saw during Prime Day.", "\n\nThe Asus Chromebook Flip C434TA is the top pick in our guide to the best Chromebook. ", "Wirecutter Editor Kimber Streams wrote, \"With solid performance, a great keyboard and trackpad, excellent battery life, and a 14-inch screen squeezed into a compact laptop, the C434 is one of the best Chromebooks ever made.\"", "\n\nStreet price: $700; deal price $550\n\nAvailable unlocked for $550, this deal price is still good for Prism Black, Prism Blue, and Prism White. ", "Many Samsung phones have seen a drop this Prime Day, including the regular S10, but our guide writers like the value this option offers.", "\n\nThe Samsung Galaxy S10e is the runner-up pick in our guide to the best Android phone. ", "Ryan Whitwam wrote, \"The Galaxy S10e offers the most important features of the 10 and 10+ for less, including the best display technology of any phone and a camera that's almost as good as that of the Pixel 3. ", "But it has too many redundant apps and a worse software update policy.\"", "\n\nStreet price: $190; deal price $140\n\nDown to $140 from around $190, this is a new low for this recommended drip coffee maker. ", "Stylish and programmable, our testers loved the quality of the coffee this machine made for the price.", "\n\nThe OXO Brew 9 Cup is the top pick in our guide to the best drip coffee maker. ", "Cale Guthrie Weissman and Liz Clayton wrote, \"This stylish brewer makes consistently good coffee, and unlike our runner-up, it can be programmed to brew automatically before you wake up.\"", "\n\nPolk Audio Command Soundbar\n\nStreet price: $250; deal price $200\n\nAn Alexa-enabled 2.1 soundbar pick in our guide, this model is back down to $200, albeit with a wait of up to a few weeks. ", "It has only seen pricing like this during deal holidays so far.", "\n\nThe Polk Audio Command Soundbar is the smart soundbar pick in our guide to the best soundbar. ", "Wirecutter Editor Adrienne Maxwell wrote, \"The Polk Command Bar is a well-performing, full-featured soundbar that also offers built-in Alexa support.\"", "\n\nAmazonBasics USB Type-C to USB-A Cable\n\nStreet price: $10; deal price $7\n\nDown to $7 from a street price just under $10, the AmazonBasics USB Type-C to USB-A Cable is conservatively but nicely discounted.", "\n\nThe AmazonBasics USB Type-C to USB-A Cable is the faster USB-C to A cable pick in our guide to the best USB-C cables and adapters. ", "Wirecutter Senior Staff Writer Nick Guy wrote, \"This USB-A–to–USB-C cable is good both for transferring data and charging from devices with legacy USB ports, but it's only 3 feet long.\"", "\n\nBecause great deals don't just happen on Prime Day, sign up for our daily deals email and we'll send you the best deals we find every weekday. ", "Also, deals change all the time, and some of these may have expired. ", "To see an updated list of current deals, please go here." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006381718558259308, 0.0006271276506595314, 0.0006299933302216232, 0.0006158641190268099, 0.0005769056151621044, 0.0006789296166971326, 0.0006822837167419493, 0.0014534150250256062, 0.0006751929176971316, 0.0006013450911268592, 0.0006332059274427593, 0.0010178199736401439, 0.0005769688286818564, 0.0005904557183384895, 0.0006486736820079386, 0.0006284030387178063, 0.0005966037278994918, 0.0006218105554580688, 0.0006581932539120317, 0.0006679125363007188, 0.000628845184110105, 0.0005391750019043684 ]

[ "In this reporting period publications appeared in the following areas: 1. ", "Single-molecule fluorescence spectroscopy; 2. ", "Single-molecule force spectroscopy; 3. ", "Enzyme catalysis. ", "These are discussed below in turn. ", "Single-molecule Forster resonance energy transfer (FRET) between fluorescent donor and acceptor labels attached to a protein or nucleic acid is widely used to probe intramolecular distances and study the structure, dynamics and function of macromolecules. ", "In these experiments, a molecule is illuminated by a laser, and the donor fluorophore is excited. ", "The donor can emit a photon or transfer the excitation to an acceptor which then can emit a photon of a different color. ", "The rate of transfer depends on the interdye distance and this is why there is information about conformational dynamics. ", "The output of these experiments is a sequence of photons with recorded colors and arrival times. ", "When a single molecule is excited by a pulsed laser, it is also possible to detect the time interval between the laser pulse and the photon. ", "This so-called delay time is related to the fluorescence lifetime of the donor fluorophore. ", "The distances between fluorescence labels attached to a molecule fluctuate due to conformational dynamics on a wide range of time scales. ", "Extracting information about the dynamics is particularly challenging when the fluctuations are as fast as the time between photons. ", "Previously, we developed methods of analyses of single-molecule photon sequences with recorded colors, arrival times, and delay times. ", "The utility of these methods has been demonstrated on several fast-folding proteins, in collaboration with Dr. H.S. Chung from LCP. ", "During this reporting period, in collaboration with Dr. H.S. Chung, we applied these and more challenging methods of three-color FRET to the oligomerization of the tetramerization domain (TD) of the tumor suppressor protein p53 (reference 1). ", "TD exists as a monomer at subnanomolar concentrations and forms a dimer and a tetramer at higher concentrations. ", "Because the dissociation constants of the dimer and tetramer are very close, as we determine in this paper, it is not possible to characterize different oligomeric species by ensemble methods. ", "However, by combining two- and three-color single-molecule FRET spectroscopy with 2D FRET efficiencylifetime analysis, it is possible to determine structural information for individual oligomers at equilibrium and to determine the dimerization kinetics. ", "From these analyses, we show that the monomer is intrinsically disordered and that the dimer conformation is very similar to that of the tetramer but the C terminus of the dimer is more flexible. ", "The rate of energy transfer depends not only on the distance between the attached dyes but also on their relative orientation. ", "Because one is interested in distances, this is a complication in using FRET to get conformational information. ", "In order to develop a quantitative theory to address this problem, in reference 2, we derived a diffusion equation i for the time evolution of the orientational factor in the Forster energy transfer rate. ", "The orientation-dependent diffusion coefficient is obtained in three different ways: (1) by requiring the orientational auto correlation function, calculated using the our one dimensional diffusion equation, to be single-exponential with the exact characteristic time; (2) by projecting the multidimensional diffusion equation for the transition dipoles using the local equilibrium approximation; and (3) by requiring exact and approximate trajectories to be as close as possible using a Bayesian approach. ", "Within the framework of this theory, the distance dependence of the fluorescence resonance energy transfer (FRET) efficiency can be calculated for all values of the ratio of the rotational correlation time of the transition dipoles to the lifetime of the donor excited state. ", "The theoretical predictions are in excellent agreement with the exact values obtained from Brownian dynamics simulations of the reorientation of the donor and acceptor transition dipoles. ", "In single molecule force spectroscopy the response of an individual molecule to applied forces is probed using atomic force microscopes and laser tweezers. ", "In reference 3, we solved the problem of how to interpret such experiments to yield information on the mechanical properties of biomolecules. ", "Recall that ductile materials can absorb sudden spikes in mechanical force, whereas brittle ones fail catastrophically. ", "Here we develop a theory to quantify the kinetic ductility of single molecules from force spectroscopy experiments, relating force-spike resistance to the differential responses of the intact protein and the unfolding transition state to an applied mechanical force. ", "We introduce a class of unistable one-dimensional potential surfaces that encompass previous models as special cases and continuously cover the entire range from ductile to brittle. ", "Compact analytic expressions for force-dependent rates and rupture-force distributions allow us to analyze force-clamp and force-ramp pulling experiments. ", "We find that the force-transmitting protein domains of filamin and titin are kinetically ductile when pulled from their two termini, making them resistant to force spikes. ", "For the mechanostable muscle protein titin, a highly ductile model reconciles data over 10 orders of magnitude in force loading rate from experiment and simulation. ", "Enzymes are biological catalysts that play a fundamental role in all living systems by supporting the selectivity and the speed for almost all cellular processes. ", "While the general principles of enzyme functioning are known, the specific details of how they work at the microscopic level are not always available. ", "Simple Michaelis-Menten kinetics assumes that the enzyme-substrate complex has only one conformation that decays as a single exponential when the substrate dissociates. ", "As a consequence, the enzymatic velocity decreases as the dissociation (off) rate constant of the complex increases. ", "Recently, it was shown by a research group in Israel showed that it is possible for the enzymatic velocity to increase when the off rate becomes higher, if the enzyme-substrate complex has many conformations which dissociate with the same off rate constant. ", "This was done using complicated formal mathematical arguments, without specifying the nature of the dynamics of the enzyme-substrate complex. ", "In order to provide a physical basis for this unexpected result, in reference 4, we derive an analytical expression for the enzymatic velocity assuming that the enzyme-substrate complex has multiple states and its conformational dynamics is described by rate equations with arbitrary rate constants. ", "By applying our formalism to a complex with two conformations, we show that the unexpected off rate dependence of the velocity can be readily understood: If one of the conformations is unproductive, the system can escape from this trap by dissociating, thereby giving the enzyme another. ", "chance to form the productive enzyme-substrate complex.", "We also demonstrate that the nonmonotonic off rate dependence of the enzymatic velocity is possible not only when all off rate constants are identical, but even when they are different. ", "We show that for typical experimentally determined rate constants, the nonmonotonic off rate dependence can occur for micromolar substrate concentrations. ", "Finally, we discuss the relation of this work to the problem of optimizing the flux through singly occupied membrane channels and transporters." ]

{ "pile_set_name": "NIH ExPorter" }

[ 0.0005749347037635744, 0.0006618576589971781, 0.0006106648361310363, 0.0008506232406944036, 0.0005650631501339376, 0.0005759572959505022, 0.0007521878578700125, 0.0007114787586033344, 0.000581126834731549, 0.0005697422311641276, 0.0006087979418225586, 0.0009262008243240416, 0.0006188632105477154, 0.0005336160538718104, 0.0005445043789222836, 0.0005612537497654557, 0.0007838790188543499, 0.0008431209716945887, 0.0005830364534631371, 0.000630331807769835, 0.0006192874279804528, 0.0006444308091886342, 0.0007931050495244563, 0.0005453938501887023, 0.0005930605693720281, 0.0005944847362115979, 0.0005726903909817338, 0.0006223509553819895, 0.0005555762909352779, 0.0011831528972834349, 0.0005839145742356777, 0.0006472323439083993, 0.000619322236161679, 0.0007808937807567418, 0.0006592607824131846, 0.0006032478413544595, 0.0005487451562657952, 0.0006644339882768691, 0.0006285955896601081, 0.0005980520509183407, 0.0006061730673536658, 0.0005580898723565042, 0.0006270102458074689, 0.000628702575340867, 0.0006776419468224049, 0.0005928560276515782, 0.0005353816086426377 ]

[ "¿Qué país tiene los mejores técnicos del mundo?" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.009050554595887661 ]

[ "Bedford Men’s Bike by Brooklyn Cruiser\n\nA true modern day hipster would go buy a used bike frame and attempt to assemble his own fixie or cruiser to ride around the city. ", "The problem is, most of these hipsters would end up with a living room full of parts as they tried to figure out what they hell they were doing. ", "Now we know you probably could assemble a simple one gear ride, but for one already done for you with just as many style points and a two-speed kick shift hub, drop 5-hundo on the Bedford bike from Brooklyn Cruiser. ", "The leather saddle and grips along with the cream colored tires add a bit of sophistication to your city-friendly ride. ", "Basically you’ll be riding around town looking like Jay Gatsby (if all his cars broke).", "\n\nWant to skip Costanza-sized billfolds and traditional leather wallet options in favor of something with more durability and RFID-protection? ", "Check out The Ridge Wallet. ", "Made with carbon fiber, titanium or aluminum, and available in a number of different colorways and styles, The Ridge Wallet is a slim, front pocket wallet perfect for your everyday carry that’s built to last and guaranteed for life. ", "Re-evaluate your everyday carry and ditch the bulky wallet in favor of something sleek and stylish from Ridge Wallet." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0008965880842879415, 0.29634734988212585, 0.0006419044220820069, 0.0006853828672319651, 0.028566770255565643, 0.0008620946318842471, 0.001116716070100665, 0.0010400067549198866, 0.002658161800354719 ]

[ "/***\n * Copyright (c) 2009 Caelum - www.caelum.com.br/opensource All rights reserved.", "\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n * use this file except in compliance with the License. ", "You may obtain a copy of\n * the License at\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ", "See the\n * License for the specific language governing permissions and limitations under\n * the License.", "\n */\npackage br.com.caelum.vraptor.http.ognl;\n\nimport java.lang.reflect.", "Type;\nimport java.util.", "List;\nimport java.util.", "Map;\nimport java.util.", "ResourceBundle;\n\nimport ognl.", "MethodFailedException;\nimport ognl.", "NoSuchPropertyException;\nimport ognl.", "Ognl;\nimport ognl.", "OgnlContext;\nimport ognl.", "OgnlException;\nimport ognl.", "OgnlRuntime;\n\nimport org.slf4j.", "Logger;\nimport org.slf4j.", "LoggerFactory;\n\nimport br.com.caelum.vraptor.converter.", "ConversionError;\nimport br.com.caelum.vraptor.core.", "Converters;\nimport br.com.caelum.vraptor.http.", "InvalidParameterException;\nimport br.com.caelum.vraptor.ioc.", "RequestScoped;\nimport br.com.caelum.vraptor.proxy.", "Proxifier;\nimport br.com.caelum.vraptor.validator.annotation.", "ValidationException;\n\nimport com.google.common.collect.", "Maps;\n\n/**\n * Trying to hide all OGNL ugliness\n *\n * @author Lucas Cavalcanti\n * @author Douglas Campos\n * @since 3.4.0\n *\n */\n@RequestScoped\npublic class OgnlFacade {\n\n\tprivate static final Logger logger = LoggerFactory.getLogger(OgnlFacade.class);\n\n\tprivate final Proxifier proxifier;\n\tprivate final Converters converters;\n\tprivate final EmptyElementsRemoval removal;\n\tprivate final Map<Object, OgnlContext> contexts = Maps.newHashMap();\n\n\tpublic OgnlFacade(Converters converters, EmptyElementsRemoval removal, Proxifier proxifier) {\n\t\tthis.converters = converters;\n\t\tthis.removal = removal;\n\t\tthis.proxifier = proxifier;\n\t\tOgnlRuntime.setNullHandler(Object.class, new ReflectionBasedNullHandler(proxifier));\n\t\tOgnlRuntime.setPropertyAccessor(List.class, new ListAccessor(converters));\n\t\tOgnlRuntime.setPropertyAccessor(Object[].class, new ArrayAccessor());\n\t}\n\n\tpublic void startContext(String name, Type type, Object root, ResourceBundle bundle) {\n\n\t\tOgnlContext context = createOgnlContext(root);\n\n\t\tcontext.setTraceEvaluations(true);\n\t\tcontext.put(\"rootType\", type);\n\t\tcontext.put(\"removal\", removal);\n\t\tcontext.put(\"nullHandler\", nullHandler());\n\t\tcontext.put(ResourceBundle.class, bundle);\n\tcontext.put(\"proxifier\", proxifier);\n\n\t\tOgnl.setTypeConverter(context, createAdapter(bundle));\n\n\t\tcontexts.put(name, context);\n\t}\n\n\tprotected VRaptorConvertersAdapter createAdapter(ResourceBundle bundle) {\n\t\treturn new VRaptorConvertersAdapter(converters, bundle);\n\t}\n\n\tprotected OgnlContext createOgnlContext(Object root) {\n\t\treturn (OgnlContext) Ognl.createDefaultContext(root);\n\t}\n\n\tprotected NullHandler nullHandler() {\n\t\treturn new GenericNullHandler(removal);\n\t}\n\n\tpublic void setValue(String name, String key, String[] values) {\n\t\ttry {\n\t\t\tOgnlContext ctx = contexts.get(name);\n\t\t\tOgnl.setValue(key, ctx, ctx.getRoot(), values.length == 1 ? ", "values[0] : values);\n\t\t\tcontexts.put(ctx.getRoot(), ctx);\n\t\t} catch (MethodFailedException e) { // setter threw an exception\n\n\t\t\tThrowable cause = e.getCause();\n\t\t\tif (cause.getClass().isAnnotationPresent(ValidationException.class)) {\n\t\t\t\tthrow new ConversionError(cause.getLocalizedMessage());\n\t\t\t} else {\n\t\t\t\tthrow new InvalidParameterException(\"unable to parse expression '\" + key + '\\'', e);\n\t\t\t}\n\n\t\t} catch (NoSuchPropertyException ex) {\n\t\t\t// TODO optimization: be able to ignore or not\n\t\t\tlogger.debug(\"cant find property for expression {} ignoring\", key);\n\t\t\tlogger.trace(\"Reason:\", ex);\n\t\t} catch (OgnlException e) {\n\t\t\t// TODO it fails when parameter name is not a valid java\n\t\t\t// identifier... ignoring by now\n\t\t\tlogger.debug(\"unable to parse expression '{}'. ", "Ignoring.\", ", "key);\n\t\t\tlogger.trace(\"Reason:\", e);\n\t\t}\n\t}\n\n\tpublic Object get(String name) {\n\t\tObject root = contexts.remove(name).getRoot();\n\n\t\tremoval.removeExtraElements();\n\n\t\tif (root.getClass().isArray()) {\n\t\t\treturn removal.removeNullsFromArray(root);\n\t\t}\n\n\t\treturn root;\n\t}\n\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.000723386590834707, 0.0005905947764404118, 0.00055921875173226, 0.0005587378400377929, 0.0008143251179717481, 0.0008345827809534967, 0.0008456312352791429, 0.0008427439024671912, 0.0009533405536785722, 0.0012703895336017013, 0.002227089134976268, 0.003920457791537046, 0.0011418245267122984, 0.0018509112996980548, 0.0017435869667679071, 0.002400543075054884, 0.0018700227374210954, 0.0022453130222857, 0.0014588888734579086, 0.0014425767585635185, 0.0011485836002975702, 0.0013293852098286152, 0.0006906194612383842, 0.027363914996385574, 0.004865066614001989, 0.001332678715698421, 0.003603306831791997 ]

[ "The effect of Thole functions on the simulation of ionic liquids with point induced dipoles at various densities.", "\nPoint-induced dipoles are used to mimic electronic degrees of freedom in molecular dynamics simulations. ", "Ultrashort distance interactions of these induced dipoles are damped by the so-called Thole functions to avoid the \"polarization catastrophe.\" ", "This study aims at the overall impact of Thole functions on structure as well as single-particle and collective dynamics of the ionic liquid 1-ethyl-3-methylimidazolium trifluoromethylsulfonate and thereby extends common studies of the effect of Thole functions on energy minimized geometries." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0007227719179354608, 0.0006569686229340732, 0.0009262110106647015, 0.0005697368178516626 ]

[ "Kansas prison health care provider falling short\n\nThe company that provides health care for Kansas prison inmates frequently did not meet standards of care required by its contract with the state, according to an analysis of hundreds of pages of data.", "\n\nThe Kansas City Star reported that Corizon Health’s performance documents from July 2015 to December 2018 showed inmates regularly didn’t see a medical professional even after complaining several times about the same ailments. ", "It also showed almost 20 percent of the 10,000 inmates in Kansas prisons are on psychotropic medications but many prisons didn’t report hours worked by psychiatrists for several months.", "\n\nIn the same three years, the state fined Corizon $1 million in performance-based penalties, and another $6.4 million for not meeting staffing requirements, particularly for psychiatrists.", "\n\nThe mother of one inmate, Marques Davis, alleges in a lawsuit filed against Corizon that her son’s complaints about headaches and muscle weakness were ignored for months while he was held at the Hutchinson Correctional Facility. ", "Davis eventually died of a fungal infection in his brain that was undetected by prison medical staff.", "\n\n“It’s showing a clear and consistent pattern of delaying, postponing or not providing necessary medical treatment,” said Leland Dempsey, the lawyer for Davis’ mother, Shermaine Walker. “", "That’s what this is showing (and) that’s what our whole lawsuit is about.”", "\n\nKansas is one of the only states in the country that requires an independent third party to observe its inmate health care contractor. ", "As part of the contract with the Tennessee-based Corizon, a team from the University of Kansas Medical Center provides monthly reviews of a sample of health care records at Kansas’ prisons.", "\n\nKansas pays Corizon about $70 million to $80 million a year, depending on the prison population. ", "Jeanny Sharp, a spokeswoman for the corrections department, said the agency levies fines whenever Corizon falls below 90 percent compliance in a month.", "\n\n“I would hope the people of Kansas and their representatives would have a strong interest in whether that $70 million (a year) is being well spent and whether they were getting their money’s worth,” said Eric Balaban, a senior staff attorney with the American Civil Liberties Union’s National Prison Project.", "\n\nBalaban said Corizon is writing off the fines as the cost of doing business in Kansas without doing anything meaningful to improve its care.", "\n\nCorizon spokeswoman Eve Hutcherson said in an email that the company stands by the care it provides in Kansas. ", "She noted during the last five years no court rulings or settlements related to patient care have gone against the company or the Kansas Department of Corrections.", "\n\nShe said she couldn’t comment on the Davis case but “we will defend our care strongly in court.”", "\n\nKansas Gov. Laura Kelly’s administration audited Corizon’s 2018 performance after she took office and found several problems. ", "Keith Bradshaw, the head of the corrections department’s finance division, told lawmakers in February that the administration was tentatively planning to extend the contract one more year, and then re-bid it if Corizon’s performance doesn’t improve.", "\n\nCorizon, the nation’s largest for-profit medical provider for prisons and jails, has faced issues in other states. ", "In December, Idaho’s state Board of Correction voted to extend its $46 million-plus-a-year contract with Corizon for two years, but the board also voted to immediately launch a process to take the contract out to bid at the end of the two-year extension, The Idaho Press-Tribune reported. ", "Idaho has faced multiple lawsuits and court orders over inmate health care.", "\n\nA federal judge in Oregon in December approved a $10 million judgment against Corizon and other defendants, settling a lawsuit brought by the parents of a 26-year-old woman who died pleading for medical help while detoxing from heroin in an Oregon jail." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0008120284182950854, 0.0009074493427760899, 0.0017496977234259248, 0.0006535268039442599, 0.0010336022824048996, 0.005419695284217596, 0.0007068173144944012, 0.0048139700666069984, 0.0009551361436024308, 0.0005384940304793417, 0.0011619089636951685, 0.0007894280715845525, 0.0005661672912538052, 0.0007887193933129311, 0.0006409522611647844, 0.0006551234982907772, 0.0005872944020666182, 0.0006523777265101671, 0.0006656654877588153, 0.0007560754311271012, 0.0005987235927022994, 0.0007722140289843082, 0.0026885310653597116 ]

[ "Fois\n\nFois may refer to:\n Foix, France\n Giovanni Melis Fois (1916–2009), Italian Roman Catholic prelate\n Marcello Fois (born 1960), Italian writer\n Valentino Fois (1973–2008), Italian cyclist\n\nSee also \n FOI (disambiguation)" ]

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

[ 0.0005714349681511521 ]

[ "Think you’ll never win at weeknight meals? ", "Think again. ", "This plan requires a little sacrifice—two hours on a weekend—but the payoff is huge: a mix-and-match stash of building blocks to create easier, faster dinners all week long.", "\n\nSubscribe\n\nAll products and services featured are selected by our editors. ", "Real Simple may receive compensation for some links to products and services in this email on this website. ", "Offers may be subject to change without notice." ]

{ "pile_set_name": "Pile-CC" }

[ 0.001157980877906084, 0.00342639465816319, 0.0007614314090460539, 0.0006353507633320987, 0.000540069246198982, 0.0005616585840471089 ]

[ "/****************************************************************************\n**\n** Copyright (C) 1992-2009 Nokia. ", "All rights reserved.", "\n**\n** This file is part of Qt Jambi.", "\n**\n** $BEGIN_LICENSE$\n** GNU Lesser General Public License Usage\n** This file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. ", " Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.", "\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. ", "These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.", "\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. ", " Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http://www.gnu.org/copyleft/gpl.html.", "\n** $END_LICENSE$\n\n**\n** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE\n** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.", "\n**\n****************************************************************************/\n\n//! [", "0]\npackage com.trolltech.examples.tutorial;\n\nimport com.trolltech.qt.gui.*;", "\n//! [", "0]\n\n//! [", "1]\npublic class HelloWorld\n{\n//! [", "2]\n public static void main(String args[])\n {\n//! [", "2] //! [", "3]\n QApplication.initialize(args);\n//! [", "3]\n\n//! [", "4]\n QPushButton hello = new QPushButton(\"Hello World!\");", "\n//! [", "4] //! [", "5]\n hello.resize(120, 40);\n//! [", "5] //! [", "6]\n hello.setWindowTitle(\"Hello World\");\n//! [", "6] //! [", "7]\n hello.show();\n//! [", "7]\n\n//! [", "8]\n QApplication.execStatic();\n QApplication.shutdown();\n//! [", "8] //! [", "9]\n }\n//! [", "9]\n}\n//! [", "1]\n" ]

{ "pile_set_name": "Github" }

[ 0.07345066964626312, 0.0006133032729849219, 0.0016816722927615047, 0.0006788370665162802, 0.0005716258892789483, 0.0005993650411255658, 0.0006432453519664705, 0.0006664148531854153, 0.0005748848197981715, 0.0006423475570045412, 0.7634863257408142, 0.0009602705831639469, 0.001808704691939056, 0.002371398499235511, 0.0009705006377771497, 0.0009665046818554401, 0.0018386879237368703, 0.0008421722450293601, 0.0019395013805478811, 0.005648720543831587, 0.001808704691939056, 0.00211310270242393, 0.0012342364061623812, 0.0022867119405418634, 0.0007248678593896329, 0.0020562568679451942, 0.0008926602313295007, 0.002466675592586398, 0.03815067186951637, 0.0024873872753232718, 0.0021709133870899677, 0.0021709133870899677, 0.0008337973849847913 ]

[ "\"I took a visit there this past week and I talked with Nick Saban,\" he explained about his trip. \"(", "I) met the offensive coordinator and defensive coordinator and some of the players. ", "It was a great experience.\"", "\n\nBurgess-Becker plans on waiting till signing day his senior season to commit." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005405095289461315, 0.0006321624969132245, 0.0005655273562297225, 0.0007984449621289968 ]

[ "[Measurement of the temporary auditory threshold shift (TTS) for evaluation of the degree of noise hazard].", "\nLong-term investigations of noise in coal mines enhanced the need to take measurements at work stations posing high risk of methane explosion. ", "To facilitate evaluation of noise hazard at the workplace in coal mines, attempts have been made to apply TTS measurements. ", "Measurements of TTS taken within 3 to 5 minutes after cessation of noise exposure in industrial conditions made it possible to evaluate equivalent sound level." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005449134623631835, 0.0007239831611514091, 0.0005723428330384195, 0.0005830533336848021 ]

[ "Serrano's homeless photos pop up in NYC\n\nUla Ilnytzky Associated Press\n\nPosted:\n05/23/2014 10:16:18 AM MDT\n\nClick photo to enlarge\n\nA woman cranes her neck as she passes by some of photographer Andres Serrano's portraits of homeless New Yorkers currently on display at the West 4th Street subway station in New York, Wednesday, May 21, 2014. ", "Best known for his controversial image of a crucifix dunked in his own urine, Serrano chose to show his portraits in some of the very places his unassuming subjects often populate&mdash;a subway station, a park and a church. (", "AP Photo/Kathy Willens)\n\nNEW YORK (AP) — Best known for his provocative images, photographer Andres Serrano has turned his attention to putting a very public face on New York City's skyrocketing homeless population.", "\n\nHis stark portraits of individuals who live on the street appear in some of the very locations that his subjects often populate — a subway station, a park, a church. ", "They're also inside 50 phone booths and bus stop shelters around Manhattan.", "\n\n\"I wanted to pay homage to them and put them somewhere visible where people could actually see the faces of the people you encounter on the street that you normally don't look at,\" Serrano explained.", "\n\nNew Yorker Andi Porzio looks at Andres Serrano's photographs of homeless people displayed at the West 4th Street subway station in New York, Wednesday, May 21, 2014. ", "Best known for his controversial image of a crucifix dunked in his own urine, Serrano's portraits put a very public face on New York City?s skyrocketing homeless population. ", "The pictures appear in some of the very locations that his unassuming subjects often populate, the subway, pay phones, and bus stops. (", "AP Photo/Kathy Willens) (Kathy Willens/AP)\n\n\"Residents of New York\" is his first public art project. ", "It runs through June 15.", "\n\nIt's a departure from Serrano's most well-known work, which have involved photos of corpses and the use of bodily fluids. ", "An image of his unveiled in 1989 featuring a crucifix dunked in his own urine thrust him into the middle of the culture wars, drawing outrage from Christian conservatives and lawmakers.", "\n\nWith the homelessness exhibit, Serrano returns to a subject he addressed some 20 years earlier in a series of studio-style photographs of homeless people titled \"Nomads.\"", "\n\nThis time, \"I wanted to record and document them the way I found them on the street,\" said Serrano, who shot with film for six weeks in January and February.", "\n\nAdvertisement\n\nThe native New Yorker said he had never seen more homeless people on the city's streets.", "\n\nThe number of people without permanent homes has skyrocketed in recent years and as of last week more than 53,000 people slept in city shelters, according to city officials, who this week unveiled a multimillion-dollar program to address the problem.", "\n\nThe most dramatic display in \"Residents of New York\" is at the West Fourth Street subway station in Greenwich Village, where all 35 poster-sized photographs line two corridors and the entrance. ", "Among the many faces is that of a 27-year-old man who posed with his wife and died of liver complications two weeks after the photo was taken.", "\n\n\"Serrano captures the direct gaze of these men and women, which we too often attempt to avert our eyes from,\" said Mary Brosnahan, president and CEO of the Coalition for the Homeless.", "\n\nSerrano said he got no resistance about taking the pictures, saying the homeless \"were happy to be asked to be a part of something. ", "Normally, they're ignored.\"", "\n\nSubway rider Andri Prozio called the installation powerful.", "\n\n\"It kind of gives you a feeling that you should have a conscience, that you should be able to do something to help homeless people,\" she said.", "\n\nThe subjects are not identified in the photos but all their names appear in a panel at the subway station.", "\n\nThe installation is sponsored by More Art, a nonprofit group dedicated to the development of socially engaged public art projects.", "\n\n\"The idea was to create something between an art exhibition and an awareness campaign,\" said its executive director, Micaela Martegani. \"", "We hope it will spur debate about homelessness in New York.\"", "\n\nNEW YORK (AP) — Viewers said farewell to Amy Poehler and the gang of Pawnee, Indiana, bureaucrats on NBC's \"Parks and Recreation,\" in a finale that made more of a dent online than on television. ", "Full Story" ]

{ "pile_set_name": "Pile-CC" }

[ 0.001165319001302123, 0.042107582092285156, 0.0007642855052836239, 0.0009417254477739334, 0.0007842062041163445, 0.0006264305557124317, 0.0005651211249642074, 0.18915660679340363, 0.0006501209572888911, 0.0006414252566173673, 0.0006688011344522238, 0.004587751813232899, 0.26354533433914185, 0.0006209342973306775, 0.0005754039157181978, 0.0007856105803512037, 0.0006480069132521749, 0.0005818653153255582, 0.001554566086269915, 0.0005941423587501049, 0.0005834578187204897, 0.0008028854499571025, 0.000653857656288892, 0.000819729408249259, 0.0005607614875771105, 0.0006451670196838677, 0.0006262485403567553, 0.0006012594676576555, 0.000604771077632904, 0.0006499477894976735 ]

[ "// Copyright (c) 2012 The Chromium Authors. ", "All rights reserved.", "\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.", "\n\n#include \"media/base/audio_renderer.h\"\n\nnamespace media {\n\nAudioRenderer::AudioRenderer() {}\nAudioRenderer::~AudioRenderer() {}\n\n} // namespace media\n" ]

{ "pile_set_name": "Github" }

[ 0.0006887708441354334, 0.0006133032729849219, 0.0006345806759782135, 0.0006940130260773003 ]

[ "// /***************************************************************************\n// Aaru Data Preservation Suite\n// ----------------------------------------------------------------------------\n//\n// Filename : DiskCopy42.cs\n// Author(s) : Natalia Portillo <claunia@claunia.com>\n//\n// Component : Disk image plugins.", "\n//\n// --[ Description ] ----------------------------------------------------------\n//\n// Manages Apple DiskCopy 4.2 disk images, including unofficial modifications.", "\n//\n// --[ License ] --------------------------------------------------------------\n//\n// This library is free software; you can redistribute it and/or modify\n// it under the terms of the GNU Lesser General Public License as\n// published by the Free Software Foundation; either version 2.1 of the\n// License, or (at your option) any later version.", "\n//\n// This library is distributed in the hope that it will be useful, but\n// WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. ", "See the GNU\n// Lesser General Public License for more details.", "\n//\n// You should have received a copy of the GNU Lesser General Public\n// License along with this library; if not, see <http://www.gnu.org/licenses/>.", "\n//\n// ----------------------------------------------------------------------------\n// Copyright © 2011-2020 Natalia Portillo\n// ****************************************************************************/\n\nusing System.", "Collections.", "Generic;\nusing System.", "Diagnostics.", "CodeAnalysis;\nusing System.", "IO;\nusing Aaru.", "CommonTypes.", "Enums;\nusing Aaru.", "CommonTypes.", "Interfaces;\nusing Aaru.", "CommonTypes.", "Structs;\n\nnamespace Aaru.", "DiscImages\n{\n // Checked using several images and strings inside Apple's DiskImages.framework\n [SuppressMessage(\"ReSharper\", \"InconsistentNaming\")]\n public sealed partial class DiskCopy42 : IWritableImage, IVerifiableImage\n {\n /// <summary>Bytes per tag, should be 12</summary>\n uint bptag;\n /// <summary>Start of data sectors in disk image, should be 0x58</summary>\n uint dataOffset;\n /// <summary>Disk image file</summary>\n IFilter dc42ImageFilter;\n /// <summary>Header of opened image</summary>\n Dc42Header header;\n ImageInfo imageInfo;\n /// <summary>Start of tags in disk image, after data sectors</summary>\n uint tagOffset;\n bool twiggy;\n byte[] twiggyCache;\n byte[] twiggyCacheTags;\n FileStream writingStream;\n\n public DiskCopy42() => imageInfo = new ImageInfo\n {\n ReadableSectorTags = new List<SectorTagType>(),\n ReadableMediaTags = new List<MediaTagType>(),\n HasPartitions = false,\n HasSessions = false,\n Version = \"4.2\",\n Application = \"Apple DiskCopy\",\n ApplicationVersion = \"4.2\",\n Creator = null,\n Comments = null,\n MediaManufacturer = null,\n MediaModel = null,\n MediaSerialNumber = null,\n MediaBarcode = null,\n MediaPartNumber = null,\n MediaSequence = 0,\n LastMediaSequence = 0,\n DriveManufacturer = null,\n DriveModel = null,\n DriveSerialNumber = null,\n DriveFirmwareRevision = null\n };\n\n ~DiskCopy42() => Close();\n }\n}" ]

{ "pile_set_name": "Github" }

[ 0.001845740363933146, 0.0007353012915700674, 0.0007457819301635027, 0.0006173739093355834, 0.0005851075984537601, 0.0005633963155560195, 0.008086352609097958, 0.000805516610853374, 0.0007577104843221605, 0.0011083564022555947, 0.0007470896816812456, 0.0010099996579810977, 0.0006490625673905015, 0.0009395795059390366, 0.0006490625673905015, 0.0008129175403155386, 0.0006490625673905015, 0.0008271986152976751, 0.0016033273423090577 ]

[ "Q:\n\nWhy is the local variable ks declared in the HashMap.keySet()?", "\n\nI looked at the source code java.util.", "HashMap and saw the following code:\npublic Set<K> keySet() {\n Set<K> ks;\n return (ks = keySet) == null ? (", "keySet = new KeySet()) : ks;\n}\n\n(Windows, java version \"1.8.0_111\")\nOn my MacBook it looks like this:\npublic Set<K> keySet() {\n Set<K> ks = keySet;\n if (ks == null) {\n ks = new KeySet();\n keySet = ks;\n }\n return ks;\n}\n\n(MacOs X Sierra, java version \"1.8.0_121\")\nWhy do both variants declare a local variable ks? ", "Why is it not written like this:\npublic Set<K> keySet() {\n if (keySet == null) {\n keySet = new KeySet();\n }\n return keySet;\n}\n\nor\npublic Set<K> keySet() {\n return keySet == null ? (", "keySet = new KeySet()) : keySet;\n}\n\nA:\n\nJavaDoc has the answer:\n/**\n * Since there is no synchronization performed while accessing these fields,\n * it is expected that java.util.", "Map view classes using these fields have\n * no non-final fields (or any fields at all except for outer-this). ", "Adhering\n * to this rule would make the races on these fields benign.", "\n *\n * It is also imperative that implementations read the field only once,\n * as in:\n *\n * public Set<K> keySet() {\n * Set<K> ks = keySet; // single racy read\n * if (ks == null) {\n * ks = new KeySet();\n * keySet = ks;\n * }\n * return ks;\n * }\n *}\n */\ntransient Set<K> keySet;\n\nA:\n\nAs far as I can tell this is an optimization that is pretty neat. ", "\nThis was previously written like this:\nif (keySet == null) { // volatile read\n keySet = new AbstractSet<K>() { // volatile write\n ....\n\nreturn keySet; // volatile read\n\nThese operations can not be re-ordered because there are memory barriers that are inserted here. ", "So it would look like this:\n [StoreLoad]\n // volatile read\n [LoadLoad]\n [LoadStore]\n\n [StoreStore]\n [LoadStore]\n // volatile write\n [StoreLoad]\n\n [StoreLoad] // there's probably just one barrier here instead of two\n // volatile read\n [LoadLoad]\n [LoadStore]\n\nThere are lots of barriers here and the most expensive would be the StoreLoad that is emitted on x86.", "\nSuppose we drop the volatile here. ", "Since there are no barriers inserted these operations can be re-ordered in any way they please and there are two racy reads here of the keySet variable. ", "\nWe can have a single racy read and store the variable into a local field(since they are local, they are thread safe - no one can change the reference that is locally declared), the only problem as far as I can see is that multiple threads might see a null reference at the same time and initialize it with an empty KeySet and potentially doing too much work; but that is most probably cheaper than the barriers.", "\nOn the other hand if some threads sees a non-null reference, it will 100% see a fully initialized object and that is the comment about final fields. ", "If all objects are final the JMM guarantees a \"freeze\" action after the constructor; or in simpler words (IMO) if all fields are final and initialized in the constructor there are two barriers inserted after it: LoadStore and LoadLoad; thus achieving the same effect.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.000625091081019491, 0.0007290109060704708, 0.0026927730068564415, 0.0010176774812862277, 0.004513722378760576, 0.0007911903667263687, 0.0007015845039859414, 0.0006524178315885365, 0.0042050741612911224, 0.0010102157248184085, 0.0006776399677619338, 0.0008291569538414478, 0.0006148433894850314, 0.0007599373930133879, 0.0006856693653389812, 0.0006720395176671445, 0.001994825666770339 ]

[ "Heat Stroke Could Be Deadly! ", "Know The Signs & How To Deal With Heat Stroke In Dogs\n\nHeat Stroke Could Be Deadly! ", "Know The Signs & How To Deal With Heat Stroke In Dogs\n\nGlobal warming has increased many folds and we have already witnessed the hottest February. ", "God knows how higher the temperature could increase in the coming months. ", "Summer has already hit many parts of the world. ", "The heat is intolerable for us and the poor dogs may not stand well in the heat.", "\n\nDogs are vulnerable for heat stroke faster than us and they need special care. ", "The heat stroke is a deadly fact and the pet owners should be well aware of the signs and know exactly what to do and what not to do to ease the heat from their body.", "\n\nWhat Is Heat Stroke In Dogs?", "\n\nDogs also get heated up in the high temperature outside. ", "What makes them vulnerable is that they do not sweat like we do. ", "Sweating is the body mechanism to cool down the temperature. ", "The heat built up in the dog’s body stays inside unless it sweats through their paws, which is lesser. ", "It happens during lengthy exposure to the heated sun. ", "Immediate action is required when the heat stroke hits the dog. ", "The risks are higher in the short nosed breeds and the heavily coated ones. ", "The dogs that are sick from respiratory issues could also be at the same risk.", "\n\nThe Signs Of Heat Stroke\n\nThe dog will be panting too much and too fast. ", "That is their way to expelling heat from the body.", "\n\nAnother significant sign is that their tongue would be darker shade and the gums looks paler. ", "The gum might even turn purple colored.", "\n\nExcessive drooling also hints to heat stroke. ", "The saliva would be thicker and stickier.", "\n\nIn severe cases the dog gets an upset stomach and shows vomiting or diarrhea.", "\n\nThe heart beat would be much faster\n\nIf you check the body temperature it would be above 40 degrees C.\n\nPaws burning of the dog will also happen. ", "If you notice that he dog is not being reasonable and is fidgety and trying to get your attention while you are busy window shopping, do know that the poor thing is burning its paws and that they have difficulty walking on the hot pavement.", "\n\nWhat to do?", "\n\nShade: Immediately get the dog out of sun and inside the home or in a shaded area. ", "whatever you do, DO NOT USE ICE OR ICE COLD WATER to cool the dog. ", "The cold can constrict their blood vessels and cause damage than relief. ", "Use only a wet wash cloth and use it to cover the head and neck of the dog.", "\n\nWash cloths: Covering the dog completely in a wet towel could cause the heat to retain inside the body. ", "Keep changing the cloth. ", "Cover the head, paws, abdomen, and their arm pits to cool them.", "\n\nWater to drink: Offer them cold water to drink or some ice to lick. ", "If the dog is taking water, do not let him take too much water at a time.", "\n\nWhat if the results are negative? ", "Is their a return policy available even if the packaging is removed? ", "When will the order arrive and what is the contact number of Pet Wellbeing? ", "Search and check for all these answers…\n\n“Can Nettle Eyebright Gold for Dogs with Allergies used by pregnant dogs or animals that are intended for breeding? ", "What if the animals condition worsens by taking this? ", "Is there any prior examination needed by the Vet. ", "Just checkout!", "\n\nCheck their body temperature and if it has come down to 38-39 degrees C, leave them alone to cool it off on their own. ", "The danger is gone. ", "Cooling to much could lead to hypothermia in dogs that is another problem.", "\n\nIn severe cases, keep the wet wash cloths to cool them and immediately take them to the vet.", "\n\nPrevention Against Heat Stroke\n\nUse dog shoes to protect their paw pads from the heat.", "\n\nDo not let them stay in the direct sunlight for longer.", "\n\nNever leave the dogs inside a locked car. ", "The inside temperature of the car can increase rapidly and could cause heat stroke even if it is not summer outside.", "\n\nCarry some iced treats for them to lick occasionally. ", "This will prevent the heating up of their body. ", "It would also give some time out from the sun.", "\n\nCooling collars are available in the market. ", "If you are planning to be out for longer carry those collars and use them when the dog seems tired from the heat." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0012742613907903433, 0.0022167882416397333, 0.0008325501694343984, 0.0007163750124163926, 0.0011714190477505326, 0.036475300788879395, 0.005736050195991993, 0.0010631572222337127, 0.0011586523614823818, 0.0021387902088463306, 0.025211142376065254, 0.0010211087064817548, 0.004675636067986488, 0.000717170478310436, 0.00996991153806448, 0.0023416089825332165, 0.0036070665810257196, 0.011848719790577888, 0.03701994940638542, 0.0005723147769458592, 0.000684253522194922, 0.0008730191038921475, 0.0015131544787436724, 0.40170717239379883, 0.0015214375453069806, 0.009530489332973957, 0.0012233788147568703, 0.005152588710188866, 0.004850431345403194, 0.014021790586411953, 0.017261039465665817, 0.004825602751225233, 0.0010944376699626446, 0.055458687245845795, 0.15730053186416626, 0.006798082031309605, 0.0008126898901537061, 0.0007254321244545281, 0.0009130581747740507, 0.0025013480335474014, 0.00146016466896981, 0.0005984959425404668, 0.0009013132657855749, 0.0010409114183858037, 0.0019443886121734977, 0.01954810693860054, 0.0017105280421674252, 0.000865573063492775, 0.0008502256823703647, 0.027798013761639595, 0.0006774714565835893, 0.11513169854879379, 0.012407823465764523, 0.0007757642888464034, 0.0005800798535346985, 0.0021206240635365248 ]

[ "---\nabstract: |\n We give a fixed-parameter tractable () approximation algorithm computing the pathwidth of a tournament, and more generally, of a semi-complete digraph. ", "Based on this result, we prove the following.", "\n\n - The problem is on semi-complete digraphs. ", "More precisely, given a semi-complete $n$-vertex digraph $T$ and a digraph $H$, one can check in time $f(|H|)n^3\\log n$, where $f$ is some elementary function, whether $T$ contains a subdivision of $H$ as a subgraph. ", "The previous known algorithm for this problem was due to Fradkin and Seymour and was of running time $n^{m(|H|)}$, where $m$ is a quadruple-exponential function.", "\n\n - The problem is on semi-complete digraphs. ", "The complexity of this problem was left open by Fradkin and Seymour. ", "Our algorithm solves it in time $g(|H|)n^4\\log n$, for some elementary function $g$.\n\n - Vertex deletion distance to every immersion-closed class of semi-complete digraphs is fixed-parameter tractable. ", "More precisely, for every immersion-closed class $\\Pi$ of semi-complete digraphs, there exists an algorithm with running time $h(k)n^3\\log n$ that checks, whether one can remove at most $k$ vertices from a semi-complete $n$-vertex digraph to obtain a digraph from class $\\Pi$. Here, $h$ is some function depending on the class $\\Pi$.\n\nauthor:\n- 'Fedor V. Fomin [^1]'\n- 'Michał Pilipczuk $^*$'\nbibliography:\n- 'flat\\_tournament-containment.bib'\ntitle: 'Jungles, bundles, and fixed parameter tractability'\n---\n\nIntroduction {#sec:introduction}\n============\n\n**Graph Minors Theory** of Robertson and Seymour [@RobertsonS_GM] significantly reshaped the modern way of thinking about graphs. ", "Apart from being a beautiful mathematical concept, the theory offers a number of fundamental algorithmic applications [@RS95; @RobertsonS2]. ", "Arguably, the most fruitful of these is based on obstructions to admitting tree decompositions of small width. ", "The structure of obstructions allows one to use the following WIN/WIN approach. ", "If the treewidth of the input graph turns out to be small, it is possible to solve the problem efficiently, e.g., by applying dynamic programming. ", "However, if the treewidth is large, we can find a sufficiently large obstruction, whose structure can be used either to immediately provide an answer, or to identify a vertex or an edge that is irrelevant to the solution, and hence can be safely removed from the graph. ", "This approach is the corner stone of Robertson and Seymour seminal fixed-parameter tractable () algorithm checking, whether the input (undirected) graph $G$ contains some fixed graph $H$ as a minor [@RS95]. ", "As a consequence, various graph problems have been shown to have polynomial-time algorithms, some of which were previously not even known to be decidable [@FellowsL88].", "\n\nIn combination with algorithms for computing the treewidth of a graph [@Amir10; @Bodlaender96] and powerful logic tools formalizing graph properties [@ArnborgLS91; @Courcelle90; @Courcelle92a], the WIN/WIN paradigm became ubiquitous in (undirected) graph algorithms. ", "Applications of this approach include the algorithm of Robertson and Seymour for the disjoint paths problem [@RS95], decidability of Hadwiger’s conjecture [@KawarabayashiR09], model-checking [@DawarGK07], bidimensionality [@DFHT05; @FominLRS10; @F.V.Fomin:2010oq], graph embeddings [@Grohe01; @KawarabayashiMR08], minor ideals [@AGK08], and topological minor containment [@GroheKMW11] among many others.", "\n\n**Directed graphs.** ", "It is a very natural and important question, whether techniques and results of Graph Minors can be applied in the world of *directed* graphs or digraphs. ", "In spite of many attempts, we are still very far from the right answer. ", "Even to capture a good analogue for treewidth in digraphs is a non-trivial task and several notions like directed treewidth [@JohnsonRST01-Di], DAG-width [@BerwangerDHK06; @Obdrzalek06-DA] or Kelly-width [@KreutzerH07-Di] can be found in the literature. ", "However, none of them shares all the “nice\" properties of undirected treewidth. ", "In fact this claim can be formalized and proved; Ganian et al. ", "argued that “[any reasonable]{} algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph\" [@GanianHKMORS10].", "\n\nThe notion of graph minor is crucial in defining obstructions to small treewidth in an undirected graph. ", "There are several ways to generalize this definition to digraphs and, as in case of treewidth, it is unclear which of them is the most natural. ", "One approach is to consider topological embeddings or immersions. ", "A graph $H$ is a *topological subgraph* (or *topological minor*) of graph $G$ if $H$ can be obtained from a subgraph of $G$ by subdividing some of its edges. ", "In other words, graph $H$ can be embedded into graph $G$ in such a way that edges of $H$ correspond to vertex-disjoint paths in $G$. An *immersion* of a graph $H$ into a graph $G$ is defined like a topological embedding, except that edges of $H$ correspond to edge-disjoint paths in $G$. Long standing open questions were to decide if a graph $H$ can be topologically embedded (immersed) into $G$ is fixed-parameter tractable, when parameterized by the size of $H$. Both questions were answered positively only very recently by Grohe, Kawarabayashi, Marx, and Wollan [@GroheKMW11]. ", "Unfortunately, the work of Grohe et al. ", "cannot be extended to directed graphs. ", "By the classical result of Fortune, Hopcroft, and Wyllie [@FortuneHW80] the problem of testing whether a given digraph $G$ contains $H$ as a (directed) topological subgraph is -complete even for very simple digraphs $H$ of constant size. ", "Similar results can be easily obtained for immersions. ", "Therefore, the most important two special cases of *rooted* topological embedding and immersions, namely problems, were studied intensively on different classes of directed graphs. ", "For example if we constrain the input digraphs to be acyclic, then both variants still remain -complete [@EvenIS76], but are polynomial-time solvable for every constant number of terminal pairs $k$ [@FortuneHW80], which was not the case in the general setting [@FortuneHW80]. ", "Slivkins showed that both problems are in fact -hard when parameterized by $k$ [@Slivkins10], thus completing the picture of their parameterized complexity in this restricted case.", "\n\n**Tournaments** form an interesting and mathematically rich subclass of digraphs. ", "Many algorithmic problems were studied on tournaments, including problems strongly related to our work: and problems. ", "In particular, problems remain NP-complete on tournaments when $k$ is a part of the input. ", "However, they were known to be solvable in polynomial time for the case $k=2$ on a superclass of tournaments called semi-complete graphs [@Bang-Jensen91; @Bang-JensenT92]. ", "Different algorithmic aspects of the problem are discussed in [@AilonCN08; @Alon06; @AlonLS09; @BessyFGPPST09; @CharbitTHY07; @Moon:1971xz; @RamanS06].", "\n\nRecent work of Chudnovsky, Fradkin, Scott, and Seymour [@ChudnovskyFS2011; @ChudnovskySS2011; @ChudnovskyS11; @fradkin-seymourEDP; @fradkin-seymour] drastically advanced the study of minor-related problems in tournaments. ", "One of the main tools in this novel approach is the cutwidth of a digraph, which in tournament setting plays a similar role to the treewidth of undirected graphs. ", "The main algorithmic advantage of cutwidth is that there is an -approximation algorithm that in time either finds a vertex ordering of width at most $f(k)$, or constructs an obstruction for cutwidth $k$, for some function $f$ [@fradkin-seymourEDP]. ", "By making use of cutwidth, Fradkin and Seymour gave an algorithm for the problem in tournaments. ", "Similarly, for every digraph $H$ of size $k$ and an $n$-vertex tournament $T$, deciding if $H$ has immersion in $T$ can be done in time $f(k)n^{4}$, for some function $f$ [@fradkin-seymourEDP].", "\n\nThe main limitation of cutwidth is that this parameter is not robust subject to even small changes in the digraph. ", "For example, the cutwidth of an acyclic tournament with $n$ vertices is zero, but adding just one vertex to this tournament can increase its cutwidth up to $\\lfloor n/2 \\rfloor$. In order to circumvent this limitation, Fradkin and Seymour in [@fradkin-seymour] obtained an obstruction theorem for pathwidth of a tournament, by showing that tournaments of large pathwidth always contain structures called jungles, and more refined objects called triples. ", "Fradkin and Seymour also gave an algorithm that either computes a path decomposition of a tournament of width at most $f(k)$, or outputs a triple of size $k$, for some function $f$. The running time of their algorithm is $n^{m(k)}$ for some function $m$; algorithms with such running times are often referred as algorithms, see the book of Flum and Grohe [@FlumGrohebook] for the formal definition of class . ", "Pathwidth is a more general width parameter than cutwidth, so the Fradkin-Seymour obstruction theorem can be used to tackle more general problems. ", "For example, this brings Fradkin and Seymour to an algorithm that for every digraph $H$ of size $k$ and $n$-vertex semi-complete digraph $T$, decides if $H$ is topologically contained in $T$ in time $n^{m(k)}$, which is polynomial for fixed $k$ [@fradkin-seymour]. ", "The only obstacle for using pathwidth as a tool for obtaining algorithms on tournaments was that there were no algorithms known constructing or approximating the pathwidth of a tournament in time.", "\n\n**Our results.** ", "We eliminate the existing limitations of pathwidth and show that it is possible in FPT time either to construct a path decomposition of “small\" width, or to find a “large\" triple, which topologically contains all “small\" digraphs and is an obstruction for pathwidth $k$. Our algorithm is based on structural theorems of Fradkin and Seymour [@fradkin-seymour] but requires several new ideas. ", "More precisely, we prove the following theorem. (", "In Section \\[sec:prelim\\] we define semi-complete digraphs — a superclass of tournaments, pathwidth, jungles and triples)\n\n\\[thm:bundle\\] There is an algorithm that for a given semi-complete graph $T=(V,E)$ and an integer $k$, in time $2^{O(k\\log{k})}|V|^3 \\log{|V|}$ outputs\n\n- either a path decomposition $W$ of width at most $4k^2+7k$,\n\n- or a $k$-jungle ${\\ensuremath{\\mathcal{J}}}$.\n\nFradkin and Seymour prove that if a semi-complete digraph contains a $f(k)$-jungle, then it contains also a $k$-triple, in which every digraph of size $k$ can be topologically embedded. ", "From a close examination of their proof one can extract an algorithm with running time $O(|V|^3 \\log |V|)$. Thus, if the digraph has large pathwidth, then every small enough digraph can be topologically embedded into it. ", "On the other hand, it easy to show that the cliquewidth of a semi-complete digraph is always at most its pathwidth plus $2$. Since topological minor containment problem is expressible in ${\\ensuremath{\\mathbf{MSO}}}_1$, the results of Courcelle, Makowsky and Rotics [@CourcelleMR00] immediately give an algorithm parameterized by the width of the obtained path decomposition and the size of the embedded digraph. ", "This implies that <span style=\"font-variant:small-caps;\">Topological containment</span> (we give precise definition of the parameterized problem <span style=\"font-variant:small-caps;\">Topological containment</span> in Section \\[sec:prelim\\]) in semi-complete digraphs is , which substantially improves the algorithm of Fradkin and Seymour [@fradkin-seymour]. ", "We remark that it is also possible to construct an explicit dynamic programming algorithm working on path decomposition, thus circumventing the usage of tools from logic.", "\n\n\\[thm:main\\] There exists an algorithm, which given a digraph $H$ and a semi-complete digraph $T=(V,E)$, checks whether $H$ is topologically contained in $T$ in time $g(|H|)|V|^3 \\log{|V|}$ for some elementary function $g$.\n\nNext application of Theorem \\[thm:bundle\\] shows that the *rooted* immersion, which is a common generalization of immersion and the Edge Disjoint Paths problem, is on semi-complete digraphs.", "\n\n\\[thm:immersion\\] There exists an algorithm, which given a rooted digraph $(H;v_1,v_2,\\ldots,v_t)$ and a semi-complete rooted digraph $(T;w_1,w_2,\\ldots,w_t)$, checks whether $H$ can be immersed into $T$ while preserving roots in time $g(|H|)|V(T)|^4\\log |V(T)|$ for some elementary function $g$.\n\nThe complexity of this problem was left open by Fradkin and Seymour in [@fradkin-seymourEDP], where they showed that its close relative, rooted infusion, is on semi-complete digraphs. ", "As rooted infusion generalizes the problem as well, the complexity of $k$-<span style=\"font-variant:small-caps;\">Edge Disjoint Paths</span> was already established by Fradkin and Seymour; however, the approach presented in [@fradkin-seymourEDP] is much more complicated than ours. ", "Our proof is based on a non-trivial application of the irrelevant vertex technique, which allows to identify a vertex in semi-complete digraphs of large pathwidth, whose removal does change the answer to the problem. ", "It is possible to use the ideas of Ganian et al.", " [@GanianHO11] for the [<span style=\"font-variant:small-caps;\">Edge Disjoint Paths</span>]{} problem to prove that <span style=\"font-variant:small-caps;\">Rooted Immersion</span> is expressible in ${\\ensuremath{\\mathbf{MSO}}}_1$, which in combination with the irrelevant vertex procedure and Theorem \\[thm:bundle\\] shows that [Rooted Immersion]{} is on semi-complete digraphs. ", "Unfortunately, the formula obtained in this way has unbounded quantifier alternation, so a direct application of the framework of Courcelle, Makowsky and Rotics [@CourcelleMR00] gives a non-elementary dependence on $|H|$, i.e., the tower of height depending on $|H|$ in the exponent of the bound on the running time. ", "To overcome this we give an explicit dynamic programming algorithm.", "\n\nFinally, we observe that our framework can be used to prove meta-theorems of more general nature. ", "Let $\\Pi$ be a class of digraphs and denote by $\\Pi+kv$ the class of digraphs, from which one can delete at most $k$ vertices to obtain a member of $\\Pi$. We study the following problem:\n\n[ ]{}\n\nWe are interested in classes $\\Pi$ which are closed under immersion. ", "For example the class of acyclic digraphs, or digraphs having cutwidth at most $c$, where $c$ is some constant, are of this type. ", "In particular, the parameterized in directed graphs is equivalent to for $\\Pi$ being the class of acyclic digraphs. ", "Chudnovsky and Seymour [@ChudnovskyS11] showed that immersion order on semi-complete digraphs is a well-quasi-order. ", "Based on this result and Theorem \\[thm:bundle\\], we are able to prove the following meta-theorem. ", "Note that it seems difficult to obtain the results of this flavor using cutwidth, as cutwidth can decrease dramatically even when one vertex is deleted from the digraph.", "\n\n\\[thm:immersionclosed\\] Let $\\Pi$ be an immersion-closed class of semi-complete digraphs. ", "Then is on semi-complete digraphs.", "\n\nTo complete the picture of the presented framework, we investigate the possibilities of proving logical meta-theorems yielding algorithms working on path decomposition of semi-complete digraphs. ", "As pathwidth resembles treewidth in the undirected case, one could conjecture that, similarly to Courcelle’s Lemma, ${\\ensuremath{\\mathbf{MSO}}}_2$ model checking should be also fixed-parameter tractable, when the pathwidth of the given semi-complete digraph and length of the formula are parameters. ", "The following result shows that this is unfortunately not true.", "\n\n\\[thm:mso-main\\] There exists a constant-size ${\\ensuremath{\\mathbf{MSO}}}_2$ formula $\\psi$, such that checking whether $\\psi$ is true in a semi-complete digraph of constant cutwidth and pathwidth is -hard.", "\n\n**Outline.** ", "The remaining part of the paper is organized as follows. ", "In Section \\[sec:prelim\\] we introduce all the necessary notions and recall various tools that will be used. ", "Section \\[sec:main\\] contains descriptions of the proofs of Theorems \\[thm:bundle\\], \\[thm:main\\], \\[thm:immersion\\] and \\[thm:immersionclosed\\]. ", "Finally, in Section \\[sec:conclusion\\] we gather conclusions and deliberate on new challenges arising from the current work. ", "The proof of Theorem \\[thm:mso-main\\] has been deferred to Appendix \\[sec:mso\\], which contains a detailed description of tools from logic applicable in our setting.", "\n\nPreliminaries {#sec:prelim}\n=============\n\nLet $G=(V,E)$ be a finite digraph. ", "Digraphs can have loops and multiple edges. ", "We refer to the book of Bang-Jensen and Gutin [@BangG089_book] for an introduction to directed graphs. ", "We use $V(G)$ and $E(G)$ to represent the vertex set and arc set of $G$, respectively. ", "By the size of $G$ we denote $|G|=|V|+|E|$. Given a subset $V'\\subseteq\nV(G)$ of $G$, let $G[V']$ denote the digraph induced by $V'$. A vertex $u$ of $G$ is an [*in-neighbour*]{} ([*out-neighbour*]{}) of a vertex $v$ if $(u,v)\\in E$ ($(v,u)\\in E$, respectively). ", "The [*in-degree*]{} $d^-(v)$ ([*out-degree*]{} $d^+(v)$) of a vertex $v$ is the number of its in-neighbours (out-neighbours). ", "We denote by $N^-(v)$ and by $N^+(v)$ the set of all in-neighbours and out-neighbours of $v$ correspondingly.", "\n\nA digraph is *simple* if it has no loops, and for every pair of distinct vertices $u,v$ there is at most one arc $(u,v)$. A digraph is *semi-complete* if it is simple and for every pair of distinct vertices $u,v$ there is at least one arc with endpoints $u,v$. A digraph is a *tournament* if it is simple and for every pair of distinct vertices $u,v$ there is exactly one arc with endpoints $u,v$.\n\n**Topological containment and immersions.** ", "Let $H,G$ be digraphs. ", "We say that mapping $\\eta : V(H)\\cup E(H) \\to V(G)\\cup E(G)$ is a [*[model]{}*]{} of $H$ in $G$, if the following conditions are satisfied:\n\n- $\\eta(V(H))\\subseteq V(G)$;\n\n- for every edge $(u,v)\\in E(H)$, $\\eta((u,v))$ is a directed path leading from $\\eta(u)$ to $\\eta(v)$;\n\n- for every loop $(u,u) \\in E(H)$, $\\eta((u,u))$ is a directed cycle passing through $\\eta(u)$.\n\nBy imposing further conditions on the model we obtain various notions of containment for digraphs. ", "If we require that $\\eta$ is surjective on $V(H)$ and the paths in $\\eta(E(H))$ are internally vertex-disjoint, we obtain the notion of [*topological containment*]{}; in this case we say that $\\eta$ is an [*expansion*]{} of $H$ in $G$. If we relax the condition of paths being internally vertex-disjoint to being edge-disjoint, we arrive at the notion of [*immersion*]{}; then $\\eta$ is an [*immersion*]{}[^2] of $H$ into $G$. In our setting we are given digraph $H$ (with possible loops and multiple edges) and a semi-complete digraph $T$. We ask whether $H$ is topologically contained (immersible) in $T$. Observe that without changing the answer for these questions we can subdivide once every loop in $H$. Thus we may assume that $H$ does not contain any loops; though, it may have multiple edges.", "\n\nWe say that $(G;v_1, \\dots, v_h)$ is a *rooted* digraph if $G$ is digraph and $v_1, \\dots, v_h$ are distinct vertices of $V(G)$. The notion of immersion can be generalized to rooted graphs. ", "Immersion $\\eta$ is an immersion from rooted digraph $\\mathbf{H}=(H;u_1, \\dots, u_h)$ to rooted digraph $\\mathbf{G}=(G;v_1, \\dots, v_h)$ if $\\eta(u_i)=v_i$ for $i\\in \\{1,\\dots, h\\}$. Such an immersion is called an *$\\mathbf{H}$-immersion* or a *rooted immersion*.", "\n\nWe study the following parameterized topological containment and immersion problems.", "\n\n[ ]{}\n\n[ ]{}\n\n**Separations and pathwidth.**", "\n\n\\[def:partition\\] Let $T=(V,E)$ be a digraph. ", "For $A, B \\subseteq V$, the pair $(A,B)$ is a separation of order $k$, if\n\n- $A\\cup B=V$,\n\n- $|A\\cap B|\\leq k$, and\n\n- there are no edges from $A\\setminus B$ to $B\\setminus A$.", "\n\nThe set $A \\cap B$ is the *cut* corresponding to the separation $(A, B)$. Two separations $(A, B$) and $(C,D)$ *cross* unless one of the following holds:\n\n- $C\\subseteq A$ and $B\\subseteq D$\n\n- $ A \\subseteq C$ and $D \\subseteq B$.\n\nA set of separations is *cross-free* if no two of its members cross.", "\n\nThe following lemma is due to Fradkin and Seymour [@fradkin-seymour (1.2)].", "\n\n\\[lem:order\\] Let $G$ be a digraph and $t \\geq 0$ be a integer. ", "Let $S$ be a cross-free set of separations with $|S| = t$. Then the members of $S$ can be ordered $(A_1,B_1),\\dots,(A_t,B_t)$ such that $A_1 \\subseteq \\cdots \\subseteq A_t $ and $B_t \\subseteq \\cdots \\subseteq B_1$.\n\n\\[def:pw\\] Given a digraph $G=(V,E)$, a sequence $W = (W_1, \\dots , W_r)$ of subsets of $V$ is a *path decomposition of $G$* if the following conditions are satisfied:\n\n- $\\bigcup_{1\\leq i\\leq r} W_i = V $;\n\n- $W_i \\cap W_k \\subseteq W_j$ for $1 \\leq i < j < k \\leq r$;\n\n- $\\forall$ $(u,v)\\in E$, either $u,v\\in W_i$ for some $i$ or $u\\in W_i$, $v\\in W_j$ for some $i>j$.\n\nWe call $W_1,\\dots , W_r$ the *bags* of the path decomposition. ", "The *width* of a path decomposition is equal to $\\max_{1\\leq i \\leq r} (|W_i| - 1)$; the *pathwidth* of $G$ is the minimum width over all path decompositions of $G$.\n\n**Jungles and triples.** ", "For a semi-complete digraph $T$, a set $Z\\subseteq V(T)$ is called a [*$k$-jungle*]{} if $|Z|=k$ and for every $x,y\\in Z$ there does not exist a separation $(A,B)$ of order smaller than $k$ that [*separates*]{} $y$ from $x$, i.e., such that $x\\in A\\setminus B$ and $y\\in B\\setminus A$. ", "A triple of disjoint subsets $(A,B,C)$ is called a $k$-triple if $|A|=|B|=|C|=k$ and there exist orderings $(a_1,\\ldots,a_k)$, $(b_1,\\ldots,b_k)$, $(c_1,\\ldots,c_k)$ of $A,B,C$, respectively, such that for all indices $1\\leq i,j\\leq k$ we have $(a_i,b_j),(b_i,c_j)\\in E(G)$ and for each index $1\\leq i\\leq k$ we have $(c_i,a_i)\\in E(G)$. The following result is an algorithmic version of the result of Fradkin and Seymour [@fradkin-seymour (2.6)]. ", "The proof closely follows the lines of their argumentation; however, for the sake of completeness we include it in Appendix \\[sec:proofs\\].", "\n\n\\[lem:jungle\\_triple\\_algo\\] There exists an elementary function $f$, such that for every $k\\geq 1$ and every semi-complete graph $T$ given together with its $f(k)$-jungle, it is possible to construct a $k$-triple in $T$ in time $O(|V(T)|^3\\log |V(T)|)$.\n\nIt is easy to check that both a $k$-triple and a $k$-jungle are obstacles to admitting a path decomposition of width less than $k-1$; there must be a bag containing the whole part $B$ or the whole jungle, respectively. ", "The following simple observation is also due to Fradkin and Seymour [@fradkin-seymour].", "\n\n\\[lem:triple-model\\] Every digraph $H$ is topologically contained in a $|H|$-triple.", "\n\n**Tools from logic.** ", "We gather a detailed discussion on the applicability of tools from logic in our setting in Appendix \\[sec:mso\\]. ", "Essentially, we observe that as on semi-complete graphs cliquewidth can be bounded by a function of pathwidth, and model checking of formulas of the logic ${\\ensuremath{\\mathbf{MSO}}}_1$ can be done by a fixed-parameter algorithm, parameterized by the length of the formula and cliquewidth, we get the following powerful meta-tool for constructing algorithms on path decomposition. ", "For appropriate definitions we invite an interested reader to Appendices \\[sec:parameters\\] and \\[sec:mso\\].", "\n\n\\[thm:MC\\] There exist an algorithm with running time $f(||{\\ensuremath{\\varphi}}||,p)|V(T)|^2$ that given an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula ${\\ensuremath{\\varphi}}$ checks whether ${\\ensuremath{\\varphi}}$ is satisfied in a semi-complete digraph $T$, given together with a path decomposition of width $p$.\n\nMain results {#sec:main}\n============\n\nApproximation of pathwidth: proof of Theorem \\[thm:bundle\\]\n-----------------------------------------------------------\n\nIn this section we give an approximation algorithm computing the pathwidth of a semi-complete digraph. ", "As the algorithm makes use of the same concepts as the technique of Fradkin and Seymour [@fradkin-seymour], we need to introduce the essential terminology.", "\n\nLet $(A,B)$, $(C,D)$ be separations of $G$ that do not cross and suppose they have orders $ i,j$, respectively. ", "Without loss of generality, suppose that $A \\subseteq C$ and $D \\subseteq B$. We say that $(A, B)$ and $(C,D)$ are *$k$-close* if $(B\\setminus A)\\cap(C\\setminus D)<k |i-j|$. The notion of a [*bundle*]{} is crucial for computing the pathwidth of a semi-complete digraph.", "\n\n\\[def:bundle\\] For an integer $k > 0$, a *bundle* in $G$ of order $k$ is a cross-free set ${\\ensuremath{\\mathcal{B}}}$ of separations of $G$, each of order $<k$, such that\n\n- no two members of ${\\ensuremath{\\mathcal{B}}}$ are $k$-close;\n\n- if $(A, B)$ is a separation of $G$ of order $i < k$, then one of the following holds: (a) $(A,B)\\in {\\ensuremath{\\mathcal{B}}}$ (b) $(A,B)$ crosses some $(C,D) \\in {\\ensuremath{\\mathcal{B}}}$ of order $\\leq i$ (c) $(A,B)$ is $k$-close to some $(C,D) \\in {\\ensuremath{\\mathcal{B}}}$ of order $\\leq i$.\n\nA separation $(A,B)$ of $G$ is an *$\\ell$-separator of $U\\subseteq V(H)$* if $|U\\setminus A|$, $|U\\setminus B| \\geq \\ell$. We say that $U$ is *$(k, \\ell)$-separable* if there exists an $\\ell$-separator of $U$ of order at most $k$.\n\nThe following proposition implicitly follows from the proof of (2.11) in [@fradkin-seymour].", "\n\n\\[lem:maximality\\_bundle\\] Let ${\\ensuremath{\\mathcal{B}}}$ be a bundle of order $k$ and let $(A_1,B_1),(A_2,B_2),\\ldots,(A_m,B_m)$ be the members of ${\\ensuremath{\\mathcal{B}}}$ ordered such that $A_1\\subseteq \\cdots \\subseteq A_m$ and $B_m\\subseteq \\cdots \\subseteq B_1$. If for some $1\\leq j \\leq m$, $|A_{j+1}\\cap B_j|>4k^2+7k$, then the set $(A_{j+1}\\setminus B_{j+1})\\cap (B_j\\setminus A_j)$ is not $(k,k^2)$-separable.", "\n\nWe are now ready to prove Theorem \\[thm:bundle\\].", "\n\nThe first steps of ours are similar to the approach of Fradkin and Seymour [@fradkin-seymour]; however, we need to use new techniques to obtain a substantially better running time. ", "First we construct a bundle ${\\ensuremath{\\mathcal{B}}}$ of order $k$. Let $(A_1,B_1),(A_2,B_2),\\ldots,(A_m,B_m)$, $A_1=B_m=\\emptyset$ and $A_m=B_1=V(T)$, be the ordering of the separations in ${\\ensuremath{\\mathcal{B}}}$ given by Lemma \\[lem:order\\]. ", "We construct a path decomposition $W= (W_1, \\dots , W_{m-1})$ consisting of bags $W_i=A_{i+1}\\cap B_i$ for $i\\in \\{1,2,\\ldots,m-1\\}$. If the width of $W$ is at most $4k^2+7k$, then the algorithm outputs $W$ and terminates. ", "Otherwise, there is such an index $j$, for which $|A_{j+1}\\cap B_j|>4k^2+7k$. As $|A_j\\cap B_j|, |A_{j+1}\\cap B_{j+1}|<k$, then $|(A_{j+1}\\setminus B_{j+1})\\cap (B_j\\setminus A_j)|>4k^2+5k$. By Lemma \\[lem:maximality\\_bundle\\], $(A_{j+1}\\setminus B_{j+1})\\cap (B_j\\setminus A_j)$ is not $(k,k^2)$-separable. ", "Then we find a $k$-jungle ${\\ensuremath{\\mathcal{J}}}$ inside $(A_{j+1}\\setminus B_{j+1})\\cap (B_j\\setminus A_j)$.\n\nTherefore, to prove the theorem, it is sufficient to show how to\n\n- Construct a bundle of order $k$ in time $2^{O(k\\log k)}|V|^3\\log |V|$, and\n\n- Construct in time $O(|W|^2)$ a $k$-jungle from a set $W$ of cardinality at least $5k+4\\ell$, providing it is not $(k,\\ell)$-separable.", "\n\n[**[(a) Construction of a bundle.]{}**]{} ", "We will inductively construct a sequence of more and more refined cross-free families of separations ${\\ensuremath{\\mathcal{B}}}_1,{\\ensuremath{\\mathcal{B}}}_2,\\ldots,{\\ensuremath{\\mathcal{B}}}_k$, such that following conditions are satisfied:\n\n- ${\\ensuremath{\\mathcal{B}}}_i$ is a cross-free family of separations of order $<i$;\n\n- ${\\ensuremath{\\mathcal{B}}}_i\\subseteq {\\ensuremath{\\mathcal{B}}}_j$ for $i\\leq j$;\n\n- no two separations in ${\\ensuremath{\\mathcal{B}}}_i$ are $k$-close;\n\n- for every $i\\leq k$, every separation of $T$ of order $<i$ either belongs to ${\\ensuremath{\\mathcal{B}}}_i$, crosses some separation from ${\\ensuremath{\\mathcal{B}}}_i$ or is $k$-close to some separation from ${\\ensuremath{\\mathcal{B}}}_i$.\n\nThese conditions imply that ${\\ensuremath{\\mathcal{B}}}_k$ is a bundle of order $k$. Note that families ${\\ensuremath{\\mathcal{B}}}_i$ are not necessarily bundles of order $i$ for $i<k$, as the closeness conditions refer to the value of $k$ instead of $i$.\n\nWe begin with constructing the family ${\\ensuremath{\\mathcal{B}}}_1$ consisting of separations of order $0$. In $O(|V|^2)$ time we partition $T$ into strongly connected components; as $T$ is a tournament, the acyclic digraph of strongly connected components is a linear order. ", "Let $F_1,F_2,\\ldots,F_h$ be these components, ordered with respect to this linear order. ", "As ${\\ensuremath{\\mathcal{B}}}_1$ we take the family of separations of order $0$ defined as follows: ${\\ensuremath{\\mathcal{B}}}_1:=\\{(\\bigcup_{i=1}^j F_j,\\bigcup_{i=j+1}^h F_j): j\\in\\{0,1,2,\\ldots,h\\}\\}$. It is easy to check that conditions imposed on ${\\ensuremath{\\mathcal{B}}}_1$ are satisfied.", "\n\nNow we present an algorithm that given family ${\\ensuremath{\\mathcal{B}}}_i$ constructs family ${\\ensuremath{\\mathcal{B}}}_{i+1}$. We take ${\\ensuremath{\\mathcal{B}}}_{i+1}:={\\ensuremath{\\mathcal{B}}}_i$ and greedily incorporate new separations of order $i$ into ${\\ensuremath{\\mathcal{B}}}_{i+1}$, such that every new separation does not cross older ones and is not $k$-close to any of them. ", "Having obtained such a maximal family ${\\ensuremath{\\mathcal{B}}}_{i+1}$, i.e., one, into which no new separation can be incorporated, we conclude that all the conditions imposed on ${\\ensuremath{\\mathcal{B}}}_{i+1}$ are satisfied.", "\n\nLet $(A_1,B_1),\\ldots,(A_h,B_h)$ be the separations at some step of the construction of ${\\ensuremath{\\mathcal{B}}}_{i+1}$ ordered by an ordering obtained from Lemma \\[lem:order\\]. ", "Note that $(A_1,B_1)=(\\emptyset,V(T))$ and $(A_h,B_h)=(V(T),\\emptyset)$; therefore, every new separation has to be inserted between two consecutive separations that are already in ${\\ensuremath{\\mathcal{B}}}_{i+1}$. We try to insert the new separation between $(A_j,B_j)$ and $(A_{j+1},B_{j+1})$ for every $j\\in \\{1,2,\\ldots,h-1\\}$. If we do not succeed for any $j$, we conclude that ${\\ensuremath{\\mathcal{B}}}_{i+1}$ is already maximal.", "\n\nConsider inserting a new separation $(C,D)$ between $(A_j,B_j)$ and $(A_{j+1},B_{j+1})$. We have the following simple claim:\n\n\\[cl:trivial\\] If $(C,D)$ is neither $k$-close to $(A_j,B_j)$ nor to $(A_{j+1},B_{j+1})$, then it is not $k$-close to any separation $(A_r,B_r)\\in {\\ensuremath{\\mathcal{B}}}_{i+1}$.\n\nThe proof of Claim \\[cl:trivial\\] uses standard triangle inequality properties of set operations, and can be found in Appendix \\[sec:proofs\\]. ", "Hence, we can only check that the new separation is not $k$-close to $(A_j,B_j)$ nor to $(A_{j+1},B_{j+1})$. Consider $S=T[B_j\\cap A_{j+1}]$. In this semi-complete digraph we have two sets of terminals: $X=A_j\\cap B_j$ and $Y=A_{j+1}\\cap B_{j+1}$. We need to determine, whether there exists a separation $(C',D')$ of $S$ of order $i$ that separates $X$ from $Y$, is not $k$-close to the separation $(X,V(S))$ nor to the separation $(V(S),Y)$, and is distinct from both of them. ", "Every such a separation $(C',D')$ corresponds to an objective separation $(C,D)=(C'\\cup A_j,D'\\cup B_{j+1})$ and vice versa: every objective separation $(C,D)$ induces such a separation $(C',D')=(C\\cap V(S),D\\cap V(S))$ in $S$. Therefore, we need to solve the following problem in the subdigraph $S=T[B_j\\cap A_{j+1}]$, for $X=A_j\\cap B_j$, $Y=A_{j+1}\\cap B_{j+1}$, $a=\\min(k(i-|X|),1)$, $b=i$ and $c=\\min(k(i-|Y|),1)$.\n\n[ ]{}\n\nWe show an algorithm that solves in time $2^{O(\\min(a+c,b)\\log (a+b+c))}|V(S)|^2\\log |V(S)|$. Before we proceed to its presentation, let us shortly discuss why it will finish the proof of Theorem \\[thm:bundle\\]. ", "We only need to show that the number of applications of this subroutine is bounded by $O(k|V(T)|)$, as for each call we have $|V(S)|\\leq |V(T)|$ and $O(\\min(a+c,b)\\log (a+b+c))=O(k\\log k)$. Note that the number of calls with a positive result, i.e., those that finished with finding a feasible separation, is bounded by $O(|V(T)|)$ for the whole run of the algorithm, as each such result implies incorporating one new separation to the constructed path decomposition. ", "Moreover, for every considered $i$ the number of calls with negative results obtained while considering $i$ is bounded by the size of the bundle after this step, thus also by $O(|V(T)|)$. It follows that the total number of calls is bounded by $O(k|V(T)|)$ and we are done.", "\n\nThe algorithm for is based on the technique of [*color coding*]{}, a classical tool in parameterized complexity introduced by Alon et al.", " [@AlonYZ95]. ", "Although the intuition behind color coding is probabilistic, it is well-known that almost all algorithms designed using this approach can be derandomized using the technique of [*splitters*]{} of Naor et al.", " [@naor-schulman-srinivasan-derandom]. ", "We find it more convenient to present our algorithm already in the derandomized version. ", "We will use the following folklore abstraction of derandomization of random coloring; for the sake of completeness, the proof can be found in Appendix \\[sec:proofs\\].", "\n\n\\[lem:derandomize\\] There exists an algorithm, which given integers $p,q$ and universe $U$, in time $2^{O(\\min(p,q)\\log (p+q))}|U| \\log |U|$ returns a family ${\\ensuremath{\\mathcal{F}}}$ of subsets of $U$ of size $2^{O(\\min(p,q)\\log (p+q))} \\log |U|$ with the following property: for every subsets $A,B\\subseteq U$, such that $A\\cap B=\\emptyset$, $|A|\\leq p$ and $|B|\\leq q$, there exists a set $R\\in {\\ensuremath{\\mathcal{F}}}$ such that $A\\subseteq R$ and $B\\cap R=\\emptyset$.\n\nFirst, using Lemma \\[lem:derandomize\\] in time $2^{O(\\min(a+c,b)\\log (a+b+c))} |V(S)|\\log |V(S)|$ we generate a family ${\\ensuremath{\\mathcal{F}}}$ for universe $U=V(S)$ and constants $p=a+c$, $q=b$; note that $|{\\ensuremath{\\mathcal{F}}}|\\leq 2^{O(\\min(a+c,b)\\log (a+b+c))} \\log |V(S)|$. Properties of ${\\ensuremath{\\mathcal{F}}}$ ensure that for every separation $(C,D)$ that satisfies properties given in the problem statement, there exists a set $R\\in {\\ensuremath{\\mathcal{F}}}$ such that $|(C\\setminus D)\\cap R|\\geq a$, $|(D\\setminus C)\\cap R|\\geq c$ and $(C\\cap D)\\cap R=\\emptyset$. In such a situation we say that $R$ is [*compatible*]{} with separation $(C,D)$. We iterate through the family ${\\ensuremath{\\mathcal{F}}}$, for each $R\\in{\\ensuremath{\\mathcal{F}}}$ trying to find a separation that is compatible with it; by Lemma \\[lem:derandomize\\], for at least one choice we are able to find a feasible separation.", "\n\nConsider the subdigraph $S_R=S[R]$. In $O(|V(S)|^2)$ time partition $S_R$ into strongly connected components. ", "As $S_R$ is semi-complete, they can be naturally arranged in a linear order, such that the arcs between different components are directed only to the one lower in the order. ", "Let us denote this order of the components by $(F_1,F_2,\\ldots,F_g)$. Assume there exists a feasible separation $(C,D)$ that is compatible with $R$. As $R$ is disjoint with $C\\cap D$, we infer that there exists an index $h$ such that $\\bigcup_{i=1}^{h} V(F_i)\\subseteq C\\setminus D$ and $\\bigcup_{i=h+1}^{g} V(F_i)\\subseteq D\\setminus C$, i.e., a prefix of the order is entirely contained in one side of the separation, and the corresponding suffix is entirely contained in the second side. ", "Let $h_1$ be the smallest index such that $|\\bigcup_{i=1}^{h_1} V(F_i)|\\geq a$ and $X\\subseteq \\bigcup_{i=1}^{h_1} V(F_i)$. Clearly, $h_1\\leq h$ as otherwise either there would be less than $a$ vertices in the intersection of $R$ and $C\\setminus D$, or there would be a vertex of $X$ in $D\\setminus C$. ", "Similarly, if by $h_2$ we denote the largest index such that $|\\bigcup_{i=h_2}^{g} V(F_i)|\\geq c$ and $Y\\subseteq \\bigcup_{i=h_2}^{g} V(F_i)$, then $h_2\\geq h$. Note that $h_1,h_2$ can be computed in $O(|V(S)|)$ time and if $h_2<h_1$, then we may terminate the computation for this particular choice of $R$. On the other hand, if $h_2\\geq h_1$ then every separation $(C,D)$ with $|C\\cap D|\\leq b$, such that $\\bigcup_{i=1}^{h_1} V(F_i) \\subseteq C\\setminus D$ and $\\bigcup_{i=h_2}^{g} V(F_i)\\subseteq D\\setminus C$, is sufficient for our needs. ", "Therefore, all we need is to find the minimum vertex cut from $\\bigcup_{i=1}^{h_1} V(F_i)$ to $\\bigcup_{i=h_2}^{g} V(F_i)$, where vertices from $R$ have infinite capacity, while vertices from $V(S)\\setminus R$ have unit capacities. ", "This can be done in $O(b|V(S)|^2)$ time using the classical Ford-Fulkerson algorithm: note that once $b+1$ paths are found, we may terminate further computation, as no cut of small enough size can be found.", "\n\n[**[(b) Constructing a jungle.]{}**]{} ", "Assume we have a set $W$, such that $|W|\\geq 5k+4\\ell$ and $W$ is not $(k,\\ell)$-separable. ", "Our construction mimics the proof of (2.8) in [@fradkin-seymour].", "\n\nLet $S=T[W]$. In time $O(|W|^2)$ we construct a set $Z=\\{w\\in W\\ |\\ d_S^{+}(w)\\geq k+\\ell \\wedge d_S^{-}(w)\\geq k+\\ell\\}$. Note that for any semi-complete digraph and any integer $d$, the number of vertices of outdegree at most $d$ is bounded by $2d+1$, as otherwise already in the subdigraph induced by them there would be a vertex of higher outdegree. ", "The same holds for indegrees. ", "Hence, we infer that $|Z|\\geq |W|-(2(k+\\ell)-1)-(2(k+\\ell)-1)\\geq k$. Take any $x,y\\in Z$. For the sake of contradiction, assume that there is a separation $(A,B)$ of order less than $k$ that separates $x$ from $y$. As $W$ is not $(k,\\ell)$-separable, either $|(A\\setminus B)\\cap W|\\leq \\ell-1$ or $|(B\\setminus A)\\cap W|\\leq \\ell-1$. However, this means that either $x$ or $y$ has in-degree or out-degree in $S$ bounded by $k+\\ell-1$, a contradiction with $x,y\\in Z$. Therefore, every subset of $Z$ of cardinality $k$ is the desired $k$-jungle ${\\ensuremath{\\mathcal{J}}}$.\n\nIrrelevant vertex procedure for rooted immersion\n------------------------------------------------\n\nIn this section we show the crucial ingredient needed for the application of the framework to Theorem \\[thm:immersion\\]. ", "As we consider the rooted version of the problem, in the case of finding a large obstacle we cannot immediately provide an answer. ", "Instead, we make use of the so-called [*irrelevant vertex technique*]{}: we identify a vertex in the obstacle that can be safely removed from the digraph. ", "In Section \\[subsec:sketches\\] we show how the following result can be used in the proof of Theorem \\[thm:immersion\\].", "\n\n\\[thm:irrelevant\\] Let ${\\ensuremath{\\mathcal{I}}}=((H;u_1,u_2,\\ldots,u_t),(T;v_1,v_2,\\ldots,v_t))$ be an instance of the [[$\\mathbf{H}$]{}]{} problem, where $T$ is a semi-complete graph containing a $p(k)$-triple $(A,B,C)$ disjoint with $\\{v_1,v_2,\\ldots,v_t\\}$ and $k=|H|$. Then it is possible in time $O(p(k)^2|V(T)|^2)$ to identify a vertex $x\\in B$ such that ${\\ensuremath{\\mathcal{I}}}$ is a YES instance of [[$\\mathbf{H}$]{}]{} if and only if ${\\ensuremath{\\mathcal{I}}}'=((H;u_1,u_2,\\ldots,u_t),(T\\setminus\\{x\\};v_1,v_2,\\ldots,v_t))$ is a YES instance.", "\n\nIn our proof $p(x)= 80x^2+80x+5$. The proof is quite long and technical, so here we present only a brief, intuitive sketch. ", "The full, formal version can be found in Appendix \\[sec:irrelevant\\].", "\n\nRecall that in the triple $(A,B,C)$ we have arcs from every vertex of $A$ to every vertex of $B$, from every vertex of $B$ to every vertex of $C$, and there exists a matching between $C$ and $A$ that consists of arcs directed from $C$ to $A$. ", "Let us assume that ${\\ensuremath{\\mathcal{I}}}$ is a YES instance and let $\\eta$ be the corresponding rooted immersion of $H$ such that ${\\ensuremath{\\mathcal{Q}}}=\\eta(E(H))$, the family of paths between corresponding images of vertices of $H$, has minimum total sum of lengths. ", "To ease the presentation, we assume that none of vertices of the triple is in $\\eta(V(H))$. The goal is to find a vertex $x$ in the part $B$, such that all the paths going through $x$ can be rerouted around — thus we prove that if there exists some solution, then there exists also a solution that does not use $x$. We first observe some structural properties of the family ${\\ensuremath{\\mathcal{Q}}}$ that follow from its minimality. ", "The intuition is that if a path from ${\\ensuremath{\\mathcal{Q}}}$ visits one of the parts $A,B,C$ multiple times, then one can use some unused parts of the triple to create a shortcut between the first and the last visit. ", "All in all, one can show that at most $4k$ vertices from $B$ are visited by some path from ${\\ensuremath{\\mathcal{Q}}}$, and at most $O(k^2)$ arcs of the matching between $C$ and $A$ have an endpoint visited by some path of ${\\ensuremath{\\mathcal{Q}}}$. Thus, by choosing the size of the triple to be sufficiently large, one may assume that we are given an arbitrary large reservoir of [*free*]{} vertices from $B$ and [*free*]{} arcs of the matching between $C$ and $A$ that can be used for rerouting.", "\n\nConsider vertex $x\\in B$. The goal is to modify the family ${\\ensuremath{\\mathcal{Q}}}$ to ${\\ensuremath{\\mathcal{Q}}}''$ so that [*(i)*]{} if a path enters $x$, then it enters $x$ from $A$; [*(ii)*]{} if a path leaves $x$, then it leaves $x$ to $C$. ", "Once both properties are satisfied, we can rerout all the paths going through $x$ to some other free vertex from $B$. Of course, this can be not possible for all vertices $x$. We find a vertex for which this is possible in two phases. ", "First, we find a sufficiently large set $X\\subseteq B$, such that for each $x\\in X$ one can find an intermediate family ${\\ensuremath{\\mathcal{Q}}}'$ for which just [*(i)*]{} is satisfied. ", "Second, inside $X$ we find a single vertex $x$, for which ${\\ensuremath{\\mathcal{Q}}}'$ can be further modified to ${\\ensuremath{\\mathcal{Q}}}''$ satisfying both [*(i)*]{} and [*(ii)*]{}. ", "Note that we have to keep track of the number of free vertices and free edges used during the first phase so that the second phase has still enough space for reroutings. ", "We now explain only how the first phase can be performed — the second phase follows the same scheme.", "\n\nFor each $b\\in B$, we partition the inneighbors of $b$ outside $A$ into two sets. ", "One set, denoted $R_b$, contains these inneighbors, which have a sufficiently large number of outneighbors in $B$. We observe that every path entering $b$ from $R_b$ can be easily rerouted, because each vertex of $R_b$ must have a large number of free outneighbors in $B$, so we can redirect the path via a free outneighbor in $B$ and around the whole triple back to $b$, using one free arc of the matching between $C$ and $A$. ", "The second set, denoted $G_b$, contains vertices that have small number of outneighbors in $B$ and are hence problematic. ", "However, if sufficiently many vertices $b$ have empty $G_b$, we can already output these vertices as a feasible $X$.\n\nOtherwise, we consider the vertices with nonempty $G_b$ and we know that we have a large number of them. ", "We define an auxiliary digraph $S$ on the set of vertices $b\\in B$ with nonempty $G_b$. We put $(b,b')\\in E(S)$ iff for every $v\\in G_b$ either $v\\in G_{b'}$ or there exists $v'\\in G_{b'}$ such that $(v,v')\\in E(T)$. Here comes the main trick of the proof: the fact that $T$ is semi-complete implies that so do $S$. Now consider a vertex $b\\in B$ with high outdegree in $S$. We show how a path entering $b$ from $v\\in G_b$ can be rerouted so that it enters $b$ from $A$. ", "As $b$ has large outdegree in $S$, for many $b'\\in B$ which are still free we can access some $v'\\in G_{b'}$ either by staying in $v$ (if $v\\in G_{b'}$) or using one arc. ", "If $v=v'$ for some $b'$, we can follow the same strategy as for the sets $R_b$. Otherwise, we need to check that some of the arcs accessing vertices $v'$ are not yet used by other paths; this can be problematic as vertices $v'$ are not necessarily distinct. ", "However, we know that each of them belongs to some $G_{b'}$, so they can appear only in limited number of copies as they have only limited number of outneighbors in $B$. Hence, we can distinguish sufficiently many pairwise distinct ones to be sure that one of the arcs accessing them is not yet used. ", "Therefore, we can replace usage of the arc $(v,b)$ with first accessing some other $G_{b'}$, then the free vertex $b'$, and then moving around the triple using a free arc of the matching between $C$ and $A$ (see Figure \\[fig:irrelevant\\] in Appendix \\[sec:irrelevant\\] for an illustration). ", "As $S$ is semi-complete and sufficiently large, there exists a sufficiently large number of vertices $b$ with sufficiently large outdegree in $S$, from which the set $X$ can be formed.", "\n\nSketches of proofs of Theorems \\[thm:main\\], \\[thm:immersion\\] and \\[thm:immersionclosed\\] {#subsec:sketches}\n------------------------------------------------------------------------------------------\n\nIn this Section we sketch how Theorems \\[thm:main\\], \\[thm:immersion\\] and \\[thm:immersionclosed\\] follow from an application of the WIN/WIN approach. ", "The proofs are essentially arranging already known pieces together, so we just discuss the main ideas. ", "Fully formal descriptions can be found in Appendix \\[sec:main-proofs\\].", "\n\nTheorem \\[thm:main\\] follows almost directly from Theorems \\[thm:bundle\\], \\[thm:MC\\] and Lemmas \\[lem:jungle\\_triple\\_algo\\], \\[lem:triple-model\\]. ", "We first run approximation of pathwidth. ", "If pathwidth is too large, we are guaranteed that the digraph contains a sufficiently large triple, which topologically contains every digraph of given size. ", "Hence, we may provide a positive answer. ", "Otherwise, we have a path decomposition of small width, on which we can run the algorithm given by Theorem \\[thm:MC\\]. ", "One just needs to observe that containing $H$ topologically can be expressed in ${\\ensuremath{\\mathbf{MSO}}}_1$: the formula existentially quantifies over images of vertices of $H$, and then checks existence of disjoint paths as disjoint subsets of vertices in which endpoints cannot by separated by separation of order $0$. We remark that the quantifier alternation of this formula is constant, so the obtained running time dependence on the size of $H$ is elementary.", "\n\nFor Theorems \\[thm:immersion\\] and \\[thm:immersionclosed\\] it will be convenient to use the following surprising result of Ganian et al.", " [@GanianHO11]: for every $\\ell$ there exists an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula $\\pi_\\ell(s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell)$ that for a digraph with distinguished vertices $s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell$ (some of which are possibly equal) asserts whether there exists a family of edge-disjoint paths $P_1,P_2,\\ldots,P_\\ell$ such that $P_i$ begins in $s_i$ and ends in $t_i$ for $i=1,2,\\ldots,\\ell$. For Theorem \\[thm:immersion\\] we proceed similarly as before. ", "After approximating pathwidth, we either obtain a large triple, in which using Theorem \\[thm:irrelevant\\] we can find an irrelevant vertex that can be safely removed, or obtain a path decomposition of small width, on which we can run algorithm given by Theorem \\[thm:MC\\] for an appropriate adaptation of formula $\\pi_{|E(H)|}$. We obtain an additional $O(|V(T)|)$ overhead in the running time, as we may $O(|V(T)|)$ time run the approximation algorithm and remove one vertex. ", "Unfortunately, the quantifier alternation of formula $\\pi_\\ell$ depends on $\\ell$, so we do not obtain elementary dependence of the running time on the size of immersed graph. ", "However, one can explicitly construct a dynamic program on path decomposition with elementary dependence. ", "We provide such an algorithm in Appendix \\[sec:app-DP\\]. ", "Using the same technique one can also obtain a dynamic program for topological containment with similar running time bounds; we omit the details. ", "We remark that application of the formulas $\\pi_\\ell$ in the context of immersion in semi-complete digraphs has been already observed by Ganian et al.", " [@GanianHO11].", "\n\nTheorem \\[thm:immersionclosed\\] follows from combining this approach with the result of Chudnovsky and Seymour that immersion order on semi-complete tournaments is a well-quasi-order [@ChudnovskyS11]. ", "By [@ChudnovskyS11], class $\\Pi$ can be characterized by a finite set of forbidden immersions $\\{H_1,H_2,\\ldots,H_r\\}$. By a simple adaptation of formulas $\\pi_\\ell$, for each $H_i$ we can construct an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula with one free monadic variable $X$ that asserts that after removing $X$ the graph does not admit $H_i$ as an immersion. ", "By taking conjunction of these formulas and quantifying $X$ existentially we obtain an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula that asserts belonging to $\\Pi+kv$. In order to finish the proof it suffices to observe that the digraphs from the class $\\Pi+kv$ have bounded pathwidth: a digraph with large pathwidth contains a big triple, which after removing at most $k$ vertices still contains every sufficiently small graph as an immersion. ", "We run the algorithm from Theorem \\[thm:bundle\\]. ", "If we obtain a large obstacle, we provide a negative answer; otherwise, we run the algorithm given by Theorem \\[thm:MC\\].", "\n\nConclusions and open problems {#sec:conclusion}\n=============================\n\nIn this paper we showed that <span style=\"font-variant:small-caps;\">Topological containment</span> and $\\mathbf{H}$-<span style=\"font-variant:small-caps;\">immersion</span> are FPT on semi-complete graphs. ", "A natural common generalization of <span style=\"font-variant:small-caps;\">Topological containment</span> and $k$-<span style=\"font-variant:small-caps;\">Vertex Disjoint Paths</span> is the rooted version of <span style=\"font-variant:small-caps;\">Topological containment</span>, where specified vertices of $H$ should be mapped into specified vertices of $G$. The obvious next step of research would be to try to extend the results to rooted topological containment. ", "Chudnovsky, Scott and Seymour in [@ChudnovskySS2011] proved that $k$-<span style=\"font-variant:small-caps;\">Vertex Disjoint Paths</span> is in class on semi-complete, i.e., solvable in polynomial time for fixed $k$. This also implies that the rooted version of topological containment is in on semi-complete graphs.", "\n\nUnfortunately, our approach used for rooted immersion does not apply to this problem. ", "Dynamic programming on path decomposition works fine but the problem is with the irrelevant vertex arguments. ", "Even for $k=2$ there exist tournaments that contain arbitrarily large triples, but in which every vertex is relevant; we provide such an example in Appendix \\[sec:app-counter\\]. ", "This suggests that a possible way to obtaining an algorithm for problem requires another width parameter admitting more powerful obstacles.", "\n\nOmitted proofs from the main body {#sec:proofs}\n=================================\n\nFor an integer $k$, let $R(k,k)$ denote the Ramsey number, that is the smallest integer such that every red-blue coloring of the edges of the complete graph on $R(k,k)$ vertices contains a monochromatic clique of size $k$. By the theorem of Erd[ö]{}s and Szekeres [@ErdosS35], $R(k,k)\\leq (1+o(1))\\frac{4^{k-1}}{\\sqrt{\\pi k}}$. For $k\\geq 1$, we define function the function $f$ as $$f(k)=2^{12\\cdot 2^{R(2k,2k)}}.$$ Moreover, let $r=R(2k,2k)$, $s=2^r$, and $m=2^{12s}=f(k)$.\n\nWe say that a semi-complete digraph is [*transitive*]{} if it contains a transitive tournament as a subdigraph. ", "Every tournament with $m$ vertices contains a transitive tournament with $\\log_{2}{m}$ vertices. ", "Also an induced acyclic subdigraph of an oriented (where there is at most one directed arc between a pair of vertices) $m$-vertex digraph with $\\log_{2}{m}$ vertices can be found in time $O(m^2\\log m)$ [@RamanS06]. ", "This algorithm can be modified into an algorithm finding a transitive semi-complete digraph in semi-complete digraphs by removing first all pairs of oppositely directed arcs, running the algorithm for oriented graphs, and then adding some of the deleted arcs to turn the acyclic digraph into a transitive semi-complete digraph. ", "Thus $T$ contains as a subdigraph a transitive semi-complete digraph, whose vertex set $X$ is a $12s$-jungle in $T$; moreover, such a set $X$ can be found in time $O(|V(T)|^2\\log |V(T)|)$.\n\nThe next step in the proof of Fradkin and Seymour is to partition the set $X$ into parts $X_1$ and $X_2$ of size $6s$ each such that $X_1$ is complete to $X_2$, i.e., for each $x_1\\in X_1$ and $x_2\\in X_2$ we have $(x_1,x_2)\\in E(T)$. Such a partition of the vertex set of the transitive semi-complete digraph can be easily found in time $O(|X|^2)$. Because $X$ is a $12s$-jungle in $T$, there are at least $6s$ internally vertex-disjoint paths from $X_2$ to $X_1$ in $T$. Let $R$ be a minimal induced subdigraph of $T$ such that $X \\subseteq V(R)$ and there are $6s$ vertex-disjoint paths from $X_2$ to $X_1$ in $R$. Such a minimal subgraph $R$ can be found in time $O(|V(T)|^3\\log |V(T)|)$ by repeatedly removing vertices $v\\in V(T)\\setminus X$ if there are $6s$ vertex-disjoint paths from $X_2$ to $X_1$ in $V(T)\\setminus \\{v\\}$. As the subroutine for finding the paths we use the classical Ford-Fulkerson algorithm, where we finish the computation after finding $6s$ paths. ", "Hence, the running time is $O(s|V(T)|^2)$. As we make at most $|V(T)|$ tests, and $s=O(\\log |V(T)|)$, the claimed bound on the runtime follows.", "\n\nLet $P_1, P_2, \\dots, P_{6s}$ be vertex-disjoint paths from $X_2$ to $X_1$ in $R$. Fradkin and Seymour proved that the set of vertices $Q$ formed by the first two and the last two vertices of these $6s$ paths contains a $k$-triple. ", "Thus, by checking every triple of subsets of $Q$ of size $k$ in time polynomial in $k$, we can find a $k$-triple. ", "This step takes time $O\\left(\\binom{24s}{k}^3k^{O(1)}\\right)=|V(T)|^{o(1)}$, as $s=O(\\log |V(T)|)$ and $k=O(\\log\\log |V(T)|)$.\n\nWe are to prove that if the new separation $(C,D)$ inserted between $(A_j,B_j)$ and $(A_{j+1},B_{j+1})$ is not $k$-close to $(A_j,B_j)$ nor to $(A_{j+1},B_{j+1})$, then it is not $k$-close to any separation $(A_r,B_r)\\in {\\ensuremath{\\mathcal{B}}}_{i+1}$. By symmetry we assume that $r<j$. Let us recall that $A_r\\subseteq A_j\\subseteq C\\subseteq A_{j+1}$ and $B_r\\supseteq B_j\\supseteq D\\supseteq B_{j+1}$. As no separations already inside ${\\ensuremath{\\mathcal{B}}}_{i+1}$ are $k$-close, we have that $$\\begin{aligned}\n|(B_r\\setminus A_r)\\cap (A_j\\setminus B_j)| & \\geq & k\\left| |A_r\\cap B_r| - |A_j\\cap B_j| \\right|;\\\\\n|(B_j\\setminus A_j)\\cap (C\\setminus D)| & \\geq & k\\left| |A_j\\cap B_j| - |C\\cap D| \\right|.\\end{aligned}$$ Note that $$\\begin{aligned}\n\\left((B_r\\setminus A_r)\\cap (A_j\\setminus B_j)\\right) \\cup \\left((B_j\\setminus A_j)\\cap (C\\setminus D)\\right) & \\subseteq & \\left((B_r\\setminus A_r)\\cap (C\\setminus D)\\right), \\\\\n\\left((B_r\\setminus A_r)\\cap (A_j\\setminus B_j)\\right) \\cap \\left((B_j\\setminus A_j)\\cap (C\\setminus D)\\right) & = & \\emptyset.\\end{aligned}$$ Therefore, $$\\begin{aligned}\n|(B_r\\setminus A_r)\\cap (C\\setminus D)| & \\geq & |(B_r\\setminus A_r)\\cap (A_j\\setminus B_j)|+|(B_j\\setminus A_j)\\cap (C\\setminus D)| \\\\\n& \\geq & k\\left| |A_r\\cap B_r| - |A_j\\cap B_j| \\right|+k\\left| |A_j\\cap B_j| - |C\\cap D| \\right| \\\\\n& \\geq & k\\left| |A_r\\cap B_r| - |C\\cap D| \\right|.\\end{aligned}$$ This proves that $(A_r,B_r)$ and $(C,D)$ are not $k$-close.", "\n\nWithout loss of generality we may assume that $p\\leq q$, as we can always replace every set in the constructed family with its complement, thus switching roles of $p$ and $q$. An $(n,r,r')$[*-splitter*]{} $\\mathcal{S}$ is a family of functions from a universe $U$ of size $n$ to the set $\\{1,2,\\ldots,r'\\}$ such that for every $X\\subseteq U$, $|X|=r$, there exists $f\\in \\mathcal{S}$ that is injective on $X$. Naor et al.", " [@naor-schulman-srinivasan-derandom] gave an explicit construction of $(n,r,r^2)$-splitter of size $O(r^6\\log r\\log n)$ in time $O(poly(r)\\cdot n\\log n)$. Using the algorithm of Naor et al. ", "we construct a $(n,z,z^2)$-splitter $\\mathcal{S}$ on $U$, where $z=\\min(p+q,n)$. Then, for every $f\\in \\mathcal{S}$ and every $Z\\subseteq \\{1,2,\\ldots,z^2\\}$, $|Z|=p$, we add to the constructed family ${\\ensuremath{\\mathcal{F}}}$ the set $f^{-1}(Z)$. Assume now that we have $A,B\\subseteq U$ such that $|A|\\leq p$ and $|B|\\leq q$. Obtain $A'$ and $B'$ by adding arbitrary elements of $U\\setminus (A\\cup B)$ to $A$ and $B$ so that $|A'|+|B'|=z$. By definition of the splitter, there exists $f\\in \\mathcal{S}$ that is injective on $A'\\cup B'$. To finish the proof one needs to observe that if we take $R=f^{-1}(f(A'))$, then $A\\subseteq R$ and $B\\cap R=\\emptyset$. The bounds on the time complexity of the algorithm and on the size of ${\\ensuremath{\\mathcal{F}}}$ follow from the bounds given by Naor et al. ", "and from the fact that the number of subsets of $\\{1,2,\\ldots,z^2\\}$ of size $p$ is bounded by $2^{O(p\\log z)}\\leq 2^{O(p\\log (p+q))}$.\n\nFull proofs of Theorems \\[thm:main\\], \\[thm:immersion\\] and \\[thm:immersionclosed\\] {#sec:main-proofs}\n===================================================================================\n\nLet $f$ be the function given by Lemma \\[lem:jungle\\_triple\\_algo\\] and denote $k=f(|H|)$. We first apply the algorithm from Theorem \\[thm:bundle\\], which in $2^{O(k\\log{k})}|V|^3 \\log{|V|}$ time finds either a $k$-jungle in $T$, or returns a path decomposition of width at most $4k^2+7k$. In the first case, by Lemma \\[lem:jungle\\_triple\\_algo\\] we know that $T$ contains a $|H|$-triple. ", "Lemma \\[lem:triple-model\\] asserts that we may safely provide a positive answer. ", "Otherwise, we can observe that we can easily construct an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula ${\\ensuremath{\\varphi}}_H$ that checks, whether $H$ can is topologically contained in $T$. First, we existentially quantify over the images of vertices of $H$. Then, for every $(u,v)\\in E(H)$ we quantify existence of a set $X_{(u,v)}$, such that all the sets $X_{(u,v)}$ are vertex disjoint and $X_{(u,v)}\\cup \\{\\eta(u),\\eta(v)\\}$ does not admit a separation of order $0$ that separates $\\eta(v)$ from $\\eta(u)$. This asserts existence of required paths between vertices. ", "We can conclude the proof by applying Theorem \\[thm:MC\\] to formula ${\\ensuremath{\\varphi}}_H$ and semi-complete digraph $T$. In order to show that the obtained running time is elementary, one can to observe that the formula ${\\ensuremath{\\varphi}}_H$ has constant quantifier alternation, so the dependence on $||{\\ensuremath{\\varphi}}_H||$ and width of the decomposition of the running time of the algorithm given by Theorem \\[thm:MC\\] is elementary. ", "Alternatively, one can construct the dynamic program on path decomposition by hand in a similar manner as the dynamic program for rooted immersion, given in Appendix \\[sec:app-DP\\].", "\n\nThe algorithm performs at most $|V(T)|$ iterations. ", "In each iteration we either delete one vertex from the graph so that the answer does not change, or resolve the problem completely. ", "The complexity of each step is $h(|H|)|V(T)|^3\\log |V(T)|$, which gives a $h(|H|)|V(T)|^4\\log |V(T)|$ bound on the total running time.", "\n\nIn each step we run algorithm from Theorem \\[thm:bundle\\] for $k=f(p(|H|))$ and semi-complete digraph $T\\setminus \\{v_1,v_2,\\ldots,v_t\\}$, which in time $2^{O(k\\log k)}|V(T)|^3\\log |V(T)|$ either outputs a path decomposition of $T\\setminus \\{v_1,v_2,\\ldots,v_t\\}$ of width at most $O(k^2)$, or a $k$-jungle in $T\\setminus \\{v_1,v_2,\\ldots,v_t\\}$. If we find a jungle using Theorem \\[lem:jungle\\_triple\\_algo\\] in $O(|V(T)|^3\\log |V(T)|)$ time we can find a $p(k)$-triple in $T\\setminus\\{v_1,v_2,\\ldots,v_t\\}$ and, by further usage of Theorem \\[thm:irrelevant\\], an irrelevant vertex in it. ", "Theorem \\[thm:irrelevant\\] ensures that removal of this very vertex yields an equivalent instance.", "\n\nHowever, if we obtain a decomposition, we can include all the excluded roots into every bag (note that there are at most $|V(H)|$ of them) to obtain a decomposition of $T$. Then we may proceed in two ways. ", "Firstly, let us recall the result of Ganian et al.", " [@GanianHO11], that for every $\\ell$ there exists an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula $\\pi_\\ell(s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell)$ that for a digraph with distinguished vertices $s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell$ (some of which are possibly equal) asserts whether there exists a family of edge-disjoint paths $P_1,P_2,\\ldots,P_\\ell$ such that $P_i$ begins in $s_i$ and ends in $t_i$, for $i=1,2,\\ldots,\\ell$. We take formula $\\pi_{|E(H)|}(s_1,s_2,\\ldots,s_{|E(H)|}, t_1,t_2,\\ldots,t_{|E(H)|})$, additionally quantify existentially images of vertices of $H$ that are not roots, and replace variables $s_i,t_i$ with corresponding roots or quantified images. ", "Thus we obtain a new formula ${\\ensuremath{\\varphi}}_\\mathbf{H}$ that asserts that $\\mathbf{H}$ is a rooted immersion of $\\mathbf{T}$. We may now use Theorem \\[thm:MC\\] to obtain the algorithm. ", "Unfortunately, as the formula constructed by Ganian et al.", " [@GanianHO11] has quantifier alternation depending on $|\\mathbf{H}|$, the guarantees on the running time obtained in this manner are non-elementary. ", "However, it is possible to construct a dynamic program on path decomposition by hand, which has elementary dependence on the width and $|\\mathbf{H}|$. We provide the details in Appendix \\[sec:app-DP\\].", "\n\nAs $\\Pi$ is immersion-closed, by the result of Chudnovsky and Seymour [@ChudnovskyS11] that immersion order on semi-complete tournaments is a well-quasi-order, we infer that $\\Pi$ can be characterized by admitting none of a family of semi-complete digraphs $\\{H_1,H_2,\\ldots,H_r\\}$ as an immersion, where $r=r(\\Pi)$ depends only on the class $\\Pi$. Let us recall the result of Ganian et al.", " [@GanianHO11], that for every $\\ell$ there exists an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula $\\pi_\\ell(s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell)$ that for a digraph with distinguished vertices $s_1,s_2,\\ldots,s_\\ell, t_1,t_2,\\ldots,t_\\ell$ (some of which are possibly equal) asserts whether there exists a family of edge-disjoint paths $P_1,P_2,\\ldots,P_\\ell$ such that $P_i$ begins in $s_i$ and ends in $t_i$ for $i=1,2,\\ldots,\\ell$. For every $i\\in \\{1,2,\\ldots,r\\}$ we construct an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula ${\\ensuremath{\\varphi}}_i(X)$ that is true if digraph $G\\setminus X$ contains $H_i$ as an immersion: we simply quantify existentially over the images of vertices of $H_i$, use the appropriate formula $\\pi_{|E(H)|}$ for quantified variables to express existence of paths, and at the end relativize the whole formula to the subdigraph induced by $V(T)\\setminus X$. Hence, if we denote by $\\psi_k(X)$ the assertion that $|X|\\leq k$ (easily expressible in the first order logic by a formula, whose length depends on $k$), the formula ${\\ensuremath{\\varphi}}=\\exists_X \\psi_k(X) \\wedge \\bigwedge_{i=1}^r \\neg{\\ensuremath{\\varphi}}_i(X)$ is true exactly in semi-complete digraphs, from which one can delete at most $k$ vertices in order to obtain a semi-complete digraphs belonging to $\\Pi$.\n\nObserve that class $\\Pi$ has bounded pathwidth, as by Theorem \\[thm:main\\] and Lemma \\[lem:jungle\\_triple\\_algo\\], a semi-complete digraph of large enough pathwidth contains a sufficiently large triple, in which one of the graph $H_i$ is topologically contained, so also immersed. ", "It follows that if pathwidth of $\\Pi$ is bounded by $c_\\Pi$, then pathwidth of $\\Pi+kv$ is bounded by $c_\\Pi+k$. Therefore, we can apply the WIN/WIN approach. ", "Using Theorem \\[thm:bundle\\] in time $g(k,c_\\Pi)|V(T)|^3\\log |V(T)|$ we either find a $c_\\Pi+k+2$-jungle, which is sufficient to provide a negative answer (recall that a $c_\\Pi+k+2$-jungle is an obstacle for admitting pathwidth less than $c_\\Pi+k+1$), or a path decomposition of width $O((c_\\Pi+k)^2)$, on which we can run the algorithm given by Theorem \\[thm:MC\\] applied to formula ${\\ensuremath{\\varphi}}$.\n\nWidth parameters of semi-complete digraphs {#sec:parameters}\n==========================================\n\nIn this section we gather results on the relations between width parameters of semi-complete digraphs.", "\n\nDefinitions\n-----------\n\nIn this subsection we formally define cutwidth and cliquewidth.", "\n\nLet $D$ be a digraph and let $(v_1,v_2,\\ldots,v_n)$ be an ordering of $V(D)$. By *cutwidth* of this ordering we mean the value defined as $\\max_{\\ell=1,\\ldots,n-1} |\\{(v_j,v_i)\\ |\\ (v_j,v_i)\\in E(D) \\wedge i\\leq \\ell <j\\}$. In other words, for every cut between two consecutive vertices we measure the number of edges directed back, and take maximum of these values. ", "By [*cutwidth*]{} of the digraph $D$, ${\\mathbf{ctw}}(D)$, we denote the minimum cutwidth among all possible orderings of vertices.", "\n\nLet $D$ be a digraph and $k$ be a positive integer. ", "A *$k$-digraph* is a digraph whose vertices are labeled by integers from $\\{1,2,\\dots,k\\}$. We call the $k$-digraph consisting of exactly one vertex labeled by some integer from $\\{1,2,\\dots,k\\}$ an initial $k$-digraph. ", "The *clique-width* ${\\mathbf{cw}}(D)$ is the smallest integer $k$ such that $G$ can be constructed by means of repeated application of the following four operations on $k$-digraphs: [*$(1)$ introduce*]{}: construction of an initial $k$-graph labeled by $i$ and denoted by $i(v)$ (that is, $i(v)$ is a $k$-digraph with $v$ as a single vertex and label $i$), [*$(2)$ disjoint union*]{} (denoted by $\\oplus$), [*$(3)$ relabel*]{}: changing all labels $i$ to $j$ (denoted by $\\rho_{i\\to\nj}$), and [*$(4)$ join*]{}: connecting all vertices labeled by $i$ with all vertices labeled by $j$ by arcs (denoted by $\\eta_{i,j}$). ", "Using the symbols of these operations, we can construct well-formed expressions. ", "An expression is called *$k$-expression* for $D$ if the digraph produced by performing these operations, in the order defined by the expression, is isomorphic to $G$ when labels are removed, and ${\\mathbf{cw}}(D)$ is the minimum $k$ such that there is a $k$-expression for $D$.\n\nComparison of the parameters\n----------------------------\n\n\\[lem:ctw-pw\\] For every digraph $D$, ${\\mathbf{pw}}(D)\\leq 2{\\mathbf{ctw}}(D)$. Moreover, given an ordering of $V(D)$ of cutwidth $c$, one can in $O(|V(D)|^2)$ time compute a path decomposition of width at most $2c$.\n\nWe provide a method of construction of a path decomposition of width at most $2c$ from an ordering of $V(D)$ of cutwidth $c$.\n\nLet $(v_1,v_2,\\ldots,v_n)$ be the ordering of $V(D)$ of cutwidth $c$. Let $F\\subseteq E(D)$ be the set of edges $(v_j,v_i)$ such that $j>i$; edges from $F$ will be called [*back edges*]{}. ", "We construct a path decomposition $W=(W_1,W_2, \\dots , W_{n-1},W_n)$ of $D$ by setting $$W_\\ell=\\{v_\\ell\\}\\cup \\bigcup \\{ \\{v_i,v_j\\}\\ |\\ i\\leq \\ell<j \\wedge (v_j,v_i)\\in E(D)\\}.$$ In other words, for each cut between two consecutive vertices in the order (plus one extra at the end of the ordering) we construct a bag that contains endpoints of all the back edges that are cut by this cut plus the last vertex. ", "Observe that $|W_\\ell|\\leq 2c+1$ for every $1\\leq \\ell\\leq n-1$. It is easy to construct $W$ in $O(|V(D)|^2)$ time using one scan through the ordering $(v_1,v_2,\\ldots,v_n)$ and maintaining the number of back edges incident to every vertex at each point. ", "We are left with arguing that $W$ is a path decomposition. ", "Clearly $\\bigcup_{i=1}^n W_i=V(D)$.\n\nConsider any vertex $v_\\ell$ and an index $j\\neq \\ell$, such that $v_\\ell\\in W_j$. Assume first that $j<\\ell$. By the definition of $W$, there exists an index $i\\leq j$ such that $(v_\\ell,v_i)\\in E(D)$. Existence of this arc implies that $v_\\ell$ has to be contained in every bag between $W_j$ and $W_\\ell$. A symmetrical reasoning works also for $j\\geq \\ell$. We infer that for every vertex $v_\\ell$ the set of bags it is contained in form an interval in the path decomposition. ", "The claim that $W_i\\cap W_k\\subseteq W_j$ for every $1\\leq i<j<k\\leq n$ follows directly from this observation.", "\n\nTo finish the proof, consider any edge $(v_i,v_j)\\in E(G)$. If $i>j$ then $\\{v_i,v_j\\}\\subseteq W_j$, whereas if $i<j$ then $v_i\\in W_i$, $v_j\\in W_j$ and we are done.", "\n\n\\[lem:pw-cw\\] For every semi-complete digraph $T$, ${\\mathbf{cw}}(T)\\leq {\\mathbf{pw}}(T)+2$. Moreover, given a path decomposition of width $p$, one can in $O(|V(T)|^2)$ time compute a $p+2$-expression constructing $T$.\n\nWe provide a method of construction of a $p+2$-expression from a path decomposition of width $p$.\n\nLet $(W_1,W_2,\\ldots,W_r)$ be a path decomposition of $T$ of width $p$. By standard means we can assume that the given path decomposition is a [*nice*]{} path decomposition, i.e., $W_1=W_r=\\emptyset$ and $|W_i\\setminus W_{i-1}|+|W_{i-1}\\setminus W_i|=1$ for every $i=2,3,\\ldots,r$. If $W_i=W_{i-1}\\cup \\{v\\}$, we say that $W_i$ [*introduces*]{} $v$; if $W_{i-1}=W_i\\cup\\{v\\}$, we say that $W_i$ [*forgets*]{} $v$. Every path decomposition can be easily turned into a nice one of the same width in $O(|V(T)|^2)$ time. ", "Intuitively, between every two bags of the given decomposition we firstly forget the part that needs to be forgotten, and then introduce the part that needs to be introduced. ", "As every vertex is introduced and forgotten exactly once, we have that $r=2|V(T)|$.\n\nWe now build a $p+2$-expression that constructs the semi-complete digraph $T$ along the path decomposition. ", "Intuitively, at each step of the construction, every vertex of the bag $W_i$ is assigned a different label between $1$ and $p+1$, while all forgotten vertices are assigned label $p+2$. If we proceed in this manner, we will end up with the whole digraph $T$ labeled with $p+2$, constructed for the last bag. ", "As we begin with an empty graph, we just need to show what to do in the introduce and forget vertex steps.", "\n\n[**[Introduce vertex step.]{}**]{}", "\n\nAssume that $W_i=W_{i-1}\\cup \\{v\\}$, i.e., bag $W_i$ introduces vertex $v$. Note that this means that $|W_{i-1}|\\leq p$. As labels from $1$ up to $p+1$ are assigned to vertices of $W_{i-1}$ and there are at most $p$ of them, let $q$ be a label that is not assigned. ", "We perform following operations; their correctness is straightforward.", "\n\n- perform $\\oplus q(v)$: we introduce the new vertex with label $q$;\n\n- for each $w\\in W_{i-1}$ with label $q'$, perform join $\\eta_{q,q'}$ if $(v,w)\\in E(D)$ and join $\\eta_{q',q}$ if $(w,v)\\in E(D)$;\n\n- perform join $\\eta_{q,p+2}$ if the new vertex has an outgoing arc to every forgotten vertex.", "\n\n[**[Forget vertex step.]{}**]{}", "\n\nAssume that $W_i=W_{i-1}\\cup \\{v\\}$, i.e., bag $W_i$ introduces vertex $v$. Let $q\\in \\{1,2,\\ldots,p+1\\}$ be the label of $v$. We just perform relabel operation $\\rho_{q\\to p+2}$, thus moving $v$ to forgotten vertices.", "\n\nMonadic Second-Order logic and tournaments {#sec:mso}\n==========================================\n\nIn this section we recall the definitions of Monadic Second-Order logic and discuss its links to the current work on semi-complete digraphs.", "\n\n${\\ensuremath{\\mathbf{MSO}}}_1$ is Monadic Second-Order Logic with quantification over subsets of vertices but not of arcs. ", "The syntax of ${\\ensuremath{\\mathbf{MSO}}}_1$ of digraphs includes the logical connectives $\\vee$, $\\land$, $\\neg$, $\\Leftrightarrow $, $\\Rightarrow$, variables for vertices, and sets of vertices, the quantifiers $\\forall$, $\\exists$ that can be applied to these variables, and the following three binary relations:\n\n1. ", " $u\\in U$ where $u$ is a vertex variable and $U$ is a vertex set variable;\n\n2. ", " $\\mathbf{A}(u,v)$, where $u,v$ are vertex variables, and the interpretation is that there exists an arc $(u,v)$ in the graph;\n\n3. ", " equality of variables representing vertices and sets of vertices.", "\n\n${\\ensuremath{\\mathbf{MSO}}}_2$ is the natural extension of ${\\ensuremath{\\mathbf{MSO}}}_1$ with quantification also over arcs and subsets of arcs; here, one can additionally check incidency relation between arcs and vertices, i.e., whether a vertex is the head/tail of a given arc. ", "In undirected setting, it is widely known that model checking of formulas of ${\\ensuremath{\\mathbf{MSO}}}_2$ is fixed-parameter tractable, when the parameters are the length of the formula and the treewidth of the graph. ", "As far as ${\\ensuremath{\\mathbf{MSO}}}_1$ is concerned, model checking of formulas of ${\\ensuremath{\\mathbf{MSO}}}_1$ is fixed-parameter tractable, when the parameters are the length of the formula and the cliquewidth of the graph. ", "These results in fact hold not only for undirected graphs, but for structures with binary relations in general, in particular for digraphs. ", "The following result follows from the work of Courcelle, Makowsky and Rotics [@CourcelleMR00]; we remark that the original paper treats of undirected graphs, but in fact the results hold also in the directed setting (cf.", " [@dam-GanianH10; @GanianHO11; @abs-0709-1433]).", "\n\nThere exist an algorithm with running time $f(||{\\ensuremath{\\varphi}}||,k)|V(T)|^2$ that given an ${\\ensuremath{\\mathbf{MSO}}}_1$ formula ${\\ensuremath{\\varphi}}$ checks whether ${\\ensuremath{\\varphi}}$ is satisfied in a semi-complete digraph $T$, given together with a $k$-expression constructing it.", "\n\nLemma \\[lem:pw-cw\\] assert that cliquewidth of a tournament is bounded its pathwidth plus $2$. Moreover, the proof gives explicit construction of the corresponding expression. ", "Hence, Theorem \\[thm:MC\\] follows as an immediate corollary. ", "We note that as Lemmas \\[lem:ctw-pw\\] and \\[lem:pw-cw\\] show essentially the same for cutwidth, the analogous result holds also for cutwidth.", "\n\nIt is tempting to conjecture that the tractability for ${\\ensuremath{\\mathbf{MSO}}}_1$ and pathwidth or cutwidth could be extended also to ${\\ensuremath{\\mathbf{MSO}}}_2$, as the decompositions resemble treewidth in the undirected setting. ", "We use the following lemma to shows that this is unfortunately not true.", "\n\n\\[thm:mso2-niet\\] There exists a constant-size ${\\ensuremath{\\mathbf{MSO}}}_2$ formula $\\psi$ over a signature enriched with three unary relations on vertices, such that checking whether $\\psi$ is satisfied in a transitive tournament is -hard.", "\n\nBefore we prove the lemma, let us shortly deliberate on how Theorem \\[thm:mso-main\\] follows from it. ", "Observe that one can replace each vertex with a constant size subdigraph that encodes satisfaction of unary relations. ", "In $\\psi$ we then replace the unary relations with constant size tests, thus obtaining a constant size formula $\\psi'$, whose model checking on semi-complete digraphs of constant pathwidth and cutwidth is -hard.", "\n\nWe provide a polynomial-time reduction from the problem. ", "We are given a boolean formula ${\\ensuremath{\\varphi}}$ with $n$ variables $x_1,x_2,\\ldots,x_n$ and $m$ clauses $C_1,C_2,\\ldots,C_m$. We are to construct a transitive tournament $T$ with three unary relations on vertices such that ${\\ensuremath{\\varphi}}$ is satisfiable if and only if $\\psi$, the constant size ${\\ensuremath{\\mathbf{MSO}}}_2$ formula that will be constructed while describing the reduction, is true in $T$. Intuitively, the unary relations in $T$ will encode the whole formula ${\\ensuremath{\\varphi}}$, while $\\psi$ is simply an ${\\ensuremath{\\mathbf{MSO}}}_2$-definable check that nondeterministically guesses the evaluation of variables and checks it.", "\n\nWe will use three unary relations on vertices, denoted $P$, $B$ and $C$. ", "The tournament consists of $m(2n+1)+1$ vertices $v_0,v_1,\\ldots,v_{m(2n+1)}$, where the edge set is defined as $E(T)=\\{(v_i,v_j)\\ |\\ i>j\\}$. We define $B$ (border) to be true in $v_i$ if and only if $2n+1|i$. Thus, the whole tournament is divided into $m$ intervals between consecutive vertices satisfying $B$, each of size $2n$. Each of these intervals will be responsible for checking one of the clauses. ", "The $2n$ vertices in each interval correspond to literals of variables of ${\\ensuremath{\\varphi}}$. We define $P$ (parity) to be satisfied in every second vertex of each interval, so that $P$ is satisfied in the first vertex of each interval. ", "The first pair of vertices corresponds to literals $x_1,\\neg x_1$, the second to $x_2,\\neg x_2$ etc. ", "In the $i$-th interval we make the $C$ (check) relation true in vertices corresponding to literals appearing in the clause $C_i$. This concludes the construction.", "\n\nWe now build the formula $\\psi$ that checks existence of an assignment satisfying ${\\ensuremath{\\varphi}}$. The correctness of the reduction will follow directly from the construction of $\\psi$.\n\nFirstly, we quantify existentially over a subset of edges $M$ and subset of vertices $X$. $X$ will be a set of all vertices corresponding to literals that are true in the assignment. ", "We will construct $\\psi$ in such a manner that $M$ will be exactly the set of arcs $\\{(v_{i+2n+1},v_i)\\ |\\ 0\\leq i\\leq(m-1)(2n+1)\\}$. We use $M$ to transfer information on the assignment between consecutive intervals.", "\n\nFormally, in $\\psi$ we express following properties of $X$ and $M$ (their expressibility in ${\\ensuremath{\\mathbf{MSO}}}_2$ by formulas of constant size is straightforward):\n\n1. ", " $(v_{2n+1},v_0)\\in M$ (note that $v_0$ and $v_{2n+1}$ can be defined as the first and second vertex satisfying $B$).", "\n\n2. ", " For every two pairs of consecutive vertices $v_i,v_{i+1}$ and $v_j,v_{j+1}$, if $(v_j,v_i)\\in M$ then $(v_{j+1},v_{i+1})\\in M$.\n\n3. ", " For every subset $N\\subseteq M$, if $N$ satisfies (1) and (2) then $N=M$.\n\n4. ", " Vertices satisfying $B$ are not in $X$.\n\n5. ", " For every two consecutive vertices $v_i,v_{i+1}$, such that $v_i,v_{i+1}\\notin B$, $v_i\\in P$ and $v_{i+1}\\notin P$, exactly one of the vertices $v_i,v_{i+1}$ belongs to $X$ (exactly one literal of every variable is true).", "\n\n6. ", " For every $(v_i,v_j)\\in M$, $v_i\\in X$ if and only if $v_j\\in X$.\n\n7. ", " For every interval between two subsequent vertices satisfying $B$, at least one of the vertices satisfying $C$ belongs to $X$.\n\nProperties (1), (2) and (3) assert that $M=\\{(v_{i+2n+1},v_i)\\ |\\ 0\\leq i\\leq(m-1)(2n+1)\\}$. Properties (4) and (5) assert that in each interval $X$ corresponds to some valid assignment, while property (6) asserts that the assignments in all the intervals are equal. ", "Property (7) checks whether each of the clauses is satisfied.", "\n\nIrrelevant vertex in a triple for [[$\\mathbf{H}$]{}]{} {#sec:irrelevant}\n======================================================\n\nIn this section we show how to identify a vertex that is irrelevant for [[$\\mathbf{H}$]{}]{}problem, in a semi-complete graph containing a sufficiently large triple. ", "Let $p(x)= 80x^2+80x+5$. We prove the following lemma.", "\n\n\\[thm:irrelevant-app\\] Let ${\\ensuremath{\\mathcal{I}}}=((H;u_1,u_2,\\ldots,u_t),(T;v_1,v_2,\\ldots,v_t))$ be an instance of the [[$\\mathbf{H}$]{}]{} problem, where $T$ is a semi-complete graph containing a $p(k)$-triple $(A,B,C)$ disjoint with $\\{v_1,v_2,\\ldots,v_t\\}$ and $k=|H|$. Then it is possible in time $O(p(k)^2|V(T)|^2)$ to identify a vertex $x\\in B$ such that ${\\ensuremath{\\mathcal{I}}}$ is a YES instance of [[$\\mathbf{H}$]{}]{} if and only if ${\\ensuremath{\\mathcal{I}}}'=((H;u_1,u_2,\\ldots,u_t),(T\\setminus\\{x\\};v_1,v_2,\\ldots,v_t))$ is a YES instance.", "\n\nBefore we proceed to the proof of Lemma \\[thm:irrelevant-app\\], we need to make several auxiliary observations.", "\n\nLet $\\eta$ be a solution to [[$\\mathbf{H}$]{}]{} instance and let ${\\ensuremath{\\mathcal{P}}}$ be the family of paths being images of all the edges in $H$, i.e., ${\\ensuremath{\\mathcal{P}}}=\\eta(E(H))$. We call an edge (a vertex) [*[used by ${\\ensuremath{\\mathcal{P}}}$]{}*]{}, if it belongs to some path from ${\\ensuremath{\\mathcal{P}}}$. We omit the family ${\\ensuremath{\\mathcal{P}}}$ whenever it is clear from the context. ", "An edge (a vertex) which is not used is called a [*[free]{}*]{} edge (vertex).", "\n\n\\[lem:bound-deg\\] If ${\\ensuremath{\\mathcal{P}}}$ is a family of paths containing simple paths only, then every vertex in $T$ is adjacent to at most $k$ used ingoing edges and at most $k$ used outgoing edges.", "\n\nOtherwise, there is a path in the solution that visits that vertex at least two times. ", "Therefore, there is a cycle in this path, which contradicts its simplicity.", "\n\nLet ${\\ensuremath{\\mathcal{Q}}}=\\eta(E(H))$ be the family of paths, where $\\eta$ is the solution to [[$\\mathbf{H}$]{}]{}instance ${\\ensuremath{\\mathcal{I}}}$ that minimizes the total sum of paths lengths. ", "Firstly, we observe some easy properties of ${\\ensuremath{\\mathcal{Q}}}$.\n\n\\[lem:bound-match\\] Every path from ${\\ensuremath{\\mathcal{Q}}}$ uses at most $2$ edges from the matching between $C$ and $A$.", "\n\nAssume otherwise, that there is a path $P\\in {\\ensuremath{\\mathcal{Q}}}$ that uses three edges of the matching: $(c_1,a_1)$, $(c_2,a_2)$, $(c_3,a_3)$, appearing in this order on the path. ", "By Observation \\[lem:bound-deg\\], for at most $k$ vertices $v\\in B$ the edge $(a_1,v)$ is used. ", "For the same reason, for at most $k$ vertices $v\\in B$ the edge $(v,c_3)$ is used. ", "As $|B|>2k$, there exists $v\\in B$ such that $(a_1,v)$ and $(v,c_3)$ are not used. ", "Now replace the part of $P$ appearing between $a_1$ and $c_3$ with $a_1\\to v\\to c_3$. We obtain an immersion with smaller sum of lengths of the paths, a contradiction.", "\n\n\\[lem:boundA\\] Every path from ${\\ensuremath{\\mathcal{Q}}}$ uses at most $2k+4$ vertices from $A$.", "\n\nAssume otherwise, that there is a path $P\\in {\\ensuremath{\\mathcal{Q}}}$ passing through at least $2k+5$ vertices from $A$. ", "By Observation \\[lem:bound-match\\], at most $2k$ of them are endpoints of used edges of the matching between $C$ and $A$. ", "Therefore, there are at least $5$ visited vertices, which are endpoints of an unused edge of the matching. ", "Let us denote any $5$ of them by $a_1,a_2,a_3,a_4,a_5$ and assume that they appear on $P$ in this order. ", "Let $(c_5,a_5)$ be the edge of the matching between $C$ and $A$ that is adjacent to $a_5$. By the same reasoning as in the proof of Observation \\[lem:bound-match\\], there exists a vertex $v\\in B$, such that $(a_1,v)$ and $(v,c_5)$ are unused edges. ", "Substitute the part of the path $P$ between $a_1$ and $a_5$ by the path $a_1\\to v\\to c_5\\to a_5$, which consists only of unused edges. ", "We obtain an expansion with smaller sum of lengths of the paths, a contradiction.", "\n\nA symmetrical reasoning yields the following observation.", "\n\n\\[lem:boundC\\] Every path from ${\\ensuremath{\\mathcal{Q}}}$ uses at most $2k+4$ vertices from $C$.", "\n\nFinally, we prove a similar property for $B$.\n\n\\[lem:boundB\\] Every path from ${\\ensuremath{\\mathcal{Q}}}$ uses at most $4$ vertices from $B$.\n\nAssume otherwise, that there is a path $P\\in {\\ensuremath{\\mathcal{Q}}}$ such that it passes through at least $5$ vertices from $B$. Let us denote any $5$ of them by $b_1,b_2,b_3,b_4,b_5$ and assume that they appear on $P$ in this order. ", "By Observation \\[lem:bound-deg\\] there are at most $k$ ingoing edges adjacent to $b_1$ used, and there are at most $k$ outgoing edges adjacent to $b_5$ used. ", "Moreover, by Observation \\[lem:bound-match\\] there are at most $2k$ edges of the matching between $C$ and $A$ used. ", "As $p(k)>4k$, we conclude that there is an unused edge of the matching $(c,a)$, such that edges $(b_1,c)$ and $(a,b_5)$ are also unused. ", "Substitute the part of the path $P$ between $b_1$ and $b_5$ with the path $b_1\\to c\\to a\\to b_5$. We obtain an immersion with smaller sum of lengths of the paths, a contradiction.", "\n\nFrom Observations \\[lem:boundA\\]-\\[lem:boundB\\] we obtain the following corollary.", "\n\n\\[lem:free\\] In the set $B$ there are at least $5k$ vertices free from ${\\ensuremath{\\mathcal{Q}}}$. Moreover, within the matching between $C$ and $A$ there are at least $4k$ edges having both endpoints free from ${\\ensuremath{\\mathcal{Q}}}$.\n\nWe note that the Corollary \\[lem:free\\] holds also for much larger values than $5k$, $4k$, respectively; we choose to state it in this way to show how many free vertices from $B$ and free edges of the matching we actually use in the proof of Lemma \\[thm:irrelevant-app\\]. ", "We need one more auxiliary lemma that will prove itself useful.", "\n\n\\[lem:bitour\\] Let $T=(V_1\\cup V_2,E)$ be a semi-complete bipartite graph, i.e., a directed graph, where edges are only between $V_1$ and $V_2$, however, for every $v_1\\in V_1$ and $v_2\\in V_2$ at least one of the edges $(v_1,v_2)$ and $(v_2,v_1)$ is present. ", "Then at least one of the assertions is satisfied:\n\n- for every $v_1\\in V_1$ there exists $v_2\\in V_2$ such that $(v_1,v_2)\\in E$;\n\n- for every $v_2\\in V_2$ there exists $v_1\\in V_1$ such that $(v_2,v_1)\\in E$.\n\nAssume that (a) does not hold. ", "That means that there is some $v_0\\in V_1$ such that for all $v_2\\in V_2$ we have $(v_2,v_0)\\in E$. Then we can always pick $v_0$ as $v_1$ in the statement of (b), so (b) holds.", "\n\nObserve that by reversing all the edges we can obtain a symmetrical lemma, where we assert existence of in-neighbours instead of out-neighbours.", "\n\nWe are now ready to prove Lemma \\[thm:irrelevant-app\\]. ", "Whenever we will refer to the [*[matching]{}*]{}, we mean the matching between $C$ and $A$.", "\n\nWe give an algorithm that outputs a vertex $x\\in B$, such that if there exists a solution to the the given instance, then there exists also a solution in which no path passes through $x$. The algorithm will run in time $O(p(k)^2|V(T)|^2)$.\n\nWe proceed in three steps. ", "The first step is to identify in $O(p(k)^2|V(T)|^2)$ time a set $X\\subseteq B$, $|X|\\geq 16k^2+16k+1$, such that if ${\\ensuremath{\\mathcal{I}}}$ is a YES instance, then for every $x\\in X$ there is a solution $\\eta$ with ${\\ensuremath{\\mathcal{P}}}=\\eta(E(H))$ having following properties:\n\n- at least $3k$ vertices of $B$ are free from ${\\ensuremath{\\mathcal{P}}}$;\n\n- at least $2k$ edges of the matching have both endpoints free from ${\\ensuremath{\\mathcal{P}}}$;\n\n- if $x$ is accessed by some path $P\\in {\\ensuremath{\\mathcal{P}}}$ from a vertex $v$, then $v\\in A$.", "\n\nThe second step of the proof is to show that one can identify in $O(p(k)^2|V(T)|^2)$ time a vertex $x\\in X$ such that if ${\\ensuremath{\\mathcal{I}}}$ is a yes instance, then there is a solution with ${\\ensuremath{\\mathcal{P}}}=\\eta(E(H))$ having following properties:\n\n- at least $k$ vertices of $B$ are free from ${\\ensuremath{\\mathcal{P}}}$;\n\n- if $x$ is accessed by some path $P\\in {\\ensuremath{\\mathcal{P}}}$ from a vertex $v$, then $v\\in A$;\n\n- if $x$ is left by some path $P\\in {\\ensuremath{\\mathcal{P}}}$ to a vertex $v$, then $v\\in C$.", "\n\nThe final, concluding step the proof of the lemma, is to show that there is a solution ${\\ensuremath{\\mathcal{P}}}=\\eta(E(H))$ such that\n\n- No path from ${\\ensuremath{\\mathcal{P}}}$ is using $x$.\n\nWe proceed with the first step. ", "Let ${\\ensuremath{\\mathcal{Q}}}=\\eta(E(H))$, where $\\eta$ is the solution for the [[$\\mathbf{H}$]{}]{} instance with the minimum sum of lengths of the paths.", "\n\nFor every vertex $b\\in B$, we identify two sets: $G_b$, $R_b$. The set $R_b$ consists of those in-neighbours of $b$ outside $A$, which are in-neighbours of at least than $6k$ vertices from $B$, while $G_b$ consists of the rest of in-neighbours of $b$ outside $A$. ", "Formally, $$\\begin{aligned}\nR_b=\\{v\\in V(T)\\setminus A: (v,b)\\in E \\wedge |N^{+}(v)\\cap B|\\geq 6k\\},\\\\\nG_b=\\{v\\in V(T)\\setminus A: (v,b)\\in E \\wedge |N^{+}(v)\\cap B|< 6k\\}. ", "\\end{aligned}$$ Note that $R_b,G_b$ can be distinguished for all $b$ in $O(p(k)^2|V(T)|)$ time. ", "Let $B_\\emptyset$ be the set of those vertices $b\\in B$, for which $G_b=\\emptyset$. We claim that if $|B_\\emptyset|\\geq 16k^2+16k+1$, then we can set $X=B_\\emptyset$.\n\nTake any $b\\in B_\\emptyset$. We argue that we can reroute the paths of ${\\ensuremath{\\mathcal{Q}}}$ that access $b$ from outside $A$ in such a manner, that during rerouting each of them we use at most one additional free vertex from $B$ and at most one additional edge from the matching. ", "We reroute the paths one by one. ", "Take a path $P$ that accesses $b$ from outside $A$, and let $v$ be the previous vertex on the path. ", "As $G_b=\\emptyset$, $v\\in R_b$. Therefore, $v$ has at least $6k$ out-neighbours in $B$. Out of them, at most $4k$ are not free with respect to ${\\ensuremath{\\mathcal{Q}}}$, due to Observation \\[lem:boundB\\], while at most $k-1$ were used by previous reroutings. ", "Therefore, there is a vertex $b'\\in B\\cap N^{+}(v)$, such that $b'$ is still free. ", "Thus we can substitute usage of the edge $(v,b)$ on $P$ with the path $v\\to b'\\to c\\to a\\to b$, where $(c,a)$ is an arbitrary edge of the matching that still has both endpoints free, which exists due to using at most $k-1$ of them so far.", "\n\nWe are now left with the case, when $|B_\\emptyset|<16k^2+16k+1$. Let $B_g=B\\setminus B_\\emptyset$. Then $|B_g|\\geq 4(16k^2+16k+1)$. We construct a semi-complete digraph $S=(B_g,L)$ as follows. ", "For every $b_1,b_2\\in B_g$, $b_1\\neq b_2$, we put arc an $(b_1, b_2)$ if for every $v\\in G_{b_1}$, either $v\\in G_{b_1}\\cap G_{b_2}$, or $v$ has an out-neighbour in $G_{b_2}$. Similarly, we put arc $(b_2, b_1)$ if for every $v\\in G_{b_2}$, either $v\\in G_{b_1}\\cap G_{b_2}$, or $v$ has an out-neighbour in $G_{b_1}$. By Lemma \\[lem:bitour\\], for every pair of distinct $b_1,b_2\\in B_g$, there is at least one arc with endpoints $b_1$ and $b_2$, hence $S$ is semi-complete. ", "The definition of $S$ gives raise to a straightforward algorithm constructing it in $O(p(k)^2|V(T)|^2)$ time.", "\n\n![", "Rerouting strategy for a path accessing vertex $b$ from $G_b$.[]{data-label=\"fig:irrelevant\"}](triple_reroute_a.pdf){width=\"10cm\"}\n\nLet $X$ be the set of vertices of $B_g$ that have out-degree at least $6k^2+6k$ in $S$; note that $X$ can be constructed in $O(p(k)^2)$ time. ", "Observe that $|X|\\geq 16k^2+16k+1$, as otherwise the sum of the out-degrees in $S$ would be at most $(16k^2+16k)(|B_g|-1) + (|B_g|-16k^2-16k)(6k^2+6k-1)$, which is smaller than $\\binom{|B_g|}{2}$ for $|B_g|\\geq 4(16k^2+16k+1)$. We now claim that for every $b\\in X$, every path of ${\\ensuremath{\\mathcal{Q}}}$ using vertex $b$ can be rerouted at the cost of using at most two free vertices of $B$ and at most two edges from the matching that have still both endpoints free. ", "We perform reroutings one by one. ", "Assume that there is a path $P\\in {\\ensuremath{\\mathcal{Q}}}$ accessing $b$ from outside $A$. ", "Let $v$ be the predecessor of $b$ on $P$. If $v\\in R_b$, then we use the same rerouting strategy as in the case of large $B_\\emptyset$. Assume then that $v\\in G_b$. As $b\\in X$, its out-degree in $S$ is at least $6k^2+6k$. This means that there are at least $6k^2+6k$ vertices $b'$ in $B_g$ and corresponding vertices $v_{b'}\\in N^{-}(b')$, such that for every $b'$ either $v_{b'}=v$ or $(v,v_{b'})\\in E$. Out of these $6k^2+6k$ vertices $b'$, at most $4k$ are not free due to Observation \\[lem:boundB\\], at most $2k-2$ were used in previous reroutings, which leaves us with at least $6k^2$ vertices $b'$ still being free. ", "If for any such $b'$ we have $v_{b'}=v$, we follow the same rerouting strategy as in the case of large $B_\\emptyset$. Assume then that these $6k^2$ vertices $v_{b'}$ are all distinct from $v$; note that, however, they are not necessarily distinct from each other. ", "As each $v_{b'}$ belongs to $G_{b'}$, $v_{b'}$ can have at most $6k-1$ out-neighbours in $B$. Hence, each vertex of $V(T)$ can occur among these $6k^2$ vertices $v_{b'}$ at most $6k-1$ times, so we can distinguish at least $k+1$ pairwise distinct vertices $v_{b'}$. We have that edges $(v,v_{b'})$ and $(v_{b'},b')$ exist, while $b'$ is still free. ", "By Observation \\[lem:bound-deg\\], at most $k$ edges $(v,v_{b'})$ are used by some paths, which leaves us at least one $v_{b'}$, for which edge $(v,v_{b'})$ is free. ", "We can now substitute the edge $(v,b)$ in $P$ by the path $v\\to v_{b'}\\to b'\\to c\\to a\\to v$, where $(c,a)$ is an arbitrarily chosen edge from the matching that still has both endpoints free that was not yet used, which exists due to using at most $2k-2$ of them so far. ", "See Fig.", " \\[fig:irrelevant\\]. ", "After rerouting, remove all loops that could be created on the paths, so that Observation \\[lem:bound-deg\\] still holds. ", "Observe that in this manner we use additional vertex $b'$ that was free, additional one edge $(c,a)$ from the matching, whereas passing the path through $v_{b'}$ can spoil at most one edge of the matching that still has both endpoints free, and at most one free vertex from $B$. This concludes the construction of the set $X$.\n\nWe proceed with the second step of the proof. ", "We mimic the rerouting arguments from the first step to obtain a vertex $x\\in X$ with the following property: the rerouted family of paths ${\\ensuremath{\\mathcal{P}}}$ obtained from previous arguments that can access $x$ only from $A$, can be further rerouted so that every path can only leave $x$ by accessing some vertex from $C$.", "\n\nFor every $b\\in X$ consider sets $R_b'$ and $G_b'$ defined similarly as before (again, they can be computed in $O(p(k)^2|V(T)|)$ time): $$\\begin{aligned}\nR_b'=\\{v\\in V(T)\\setminus C: (b,v)\\in E \\wedge |N^{-}(v)\\cap B|\\geq 8k\\}, \\\\\nG_b'=\\{v\\in V(T)\\setminus C: (b,v)\\in E \\wedge |N^{-}(v)\\cap B|< 8k\\} \\end{aligned}$$ Assume first that there is some $y\\in X$, such that $G_y'=\\emptyset$. We argue that we can in such a case set $x=y$. Firstly, reroute the solution that minimizes the total sum of lengths of the paths obtaining a solution with the family of paths ${\\ensuremath{\\mathcal{P}}}$ that uses at most $2k$ additional free vertices from $B$ and at most $2k$ additional edges free edges from the matching, but does not access $y$ from outside $A$. ", "One by one we reroute paths using $y$. Each rerouting will cost at most one free vertex from $B$ and at most one edge from the matching that has still both endpoints free. ", "Let $P$ be a path from the solution that passes through $y$ and let $v\\in R_y'$ be the next vertex on $P$. The vertex $v$ has at least $8k$ in-neighbours in $B$; at most $4k$ of them could be used by the original solution, at most $2k$ of them could be used in rerouting during the first phase and at most $k-1$ of them could be used during previous reroutings in this phase. ", "Therefore, we are left with at least one vertex $y'\\in B$ that is still free, such that $(y',v)\\in E(T)$. We can now substitute the edge $(y,v)$ in $P$ by the path $y\\to c\\to a\\to y'\\to v$, where $(c,a)$ is an arbitrarily chosen edge from the matching that was not yet used, which exists due to using at most $3k-1$ of them so far.", "\n\nWe are left with the case, when $G_y'$ is nonempty for all $y\\in X$. Construct a digraph $S'=(X,L')$ in a symmetrical manner to the previous construction: we put an edge $(b_1,b_2)\\in L'$ iff for every $v_{b_2}\\in G_{b_2}'$ there exists $v_{b_1}\\in G_{b_1}'$ such that $v_{b_1}=v_{b_2}$ or $(v_{b_1},v_{b_2})\\in E$. The remark after Lemma \\[lem:bitour\\] ensures that $S'$ is semi-complete. ", "Again, $S'$ can be computed in $O(p(k)^2|V(T)|^2)$ time.", "\n\nAs $|X|\\geq 16k^2+16k+1$, there exists $x\\in X$, which has in-degree at least $8k^2+8k$ in $S'$; note that $x$ can be found in $O(p(k)^2)$ time. ", "As before, we argue that after the first rerouting phase for $x$, we can additionally reroute the paths so that every path can leave $x$ only into $C$. ", "We reroute the paths one by one; each rerouting uses at most two vertices free vertices from $B$ and at most two edges from the matching. ", "As the in-degree of $x$ in $S'$ is at least $8k^2+8k$, we have at least $8k^2+8k$ vertices $x'\\in X$ and corresponding $v_{x'}\\in G_{x'}'$, such that $v_{x'}=v$ or $(v_{x'},v)\\in E$. At most $4k$ of them were used in ${\\ensuremath{\\mathcal{Q}}}$, at most $2k$ were used in previous phase of rerouting, and at most $2k-2$ of them were used in this phase of rerouting. ", "This leaves at least $8k^2$ vertices $x'$ which are still free. ", "If for any of them we have $v_{x'}=v$, we can make the rerouting similarly as in the previous case: we substitute the edge $(x,v)$ with the path $x\\to c\\to a\\to x'\\to v$, where $(c,a)$ is an arbitrary edge of the matching that still has both endpoints free, which exists due to using at most $4k-2$ of them so far. ", "Assume then, that all vertices $v_{x'}$ are distinct from $v$; note that, however, they are not necessarily distinct from each other. ", "As every for every $x'$ we have $v_{x'}\\in G_{x'}'$, by the definition of $G_{x'}'$ the vertices $v_{x'}$ can have at most $8k-1$ in-neighbours in $X$. This means that every vertex of $V(T)$ can occur among vertices $v_{x'}$ at most $8k-1$ times, which proves that there are at least $k+1$ pairwise distinct vertices among them. ", "By Observation \\[lem:bound-deg\\], for at most $k$ of them the edge connecting to $v$ can be already used, which leaves us with a single vertex $x'$, such that edges $(x',v_{x'})$ and $(v_{x'},v)$ exist and are not yet used, whereas $x'$ is still free. ", "Now we can perform the rerouting as follows: we substitute the edge $(x,v)$ in $P$ by the path $x\\to c\\to a\\to x'\\to v_{x'}\\to v$, where $(c,a)$ is an arbitrary edge from the matching that was still has both endpoints free, which exists due to at most $4k-2$ of them so far. ", "Similarly as before, we use one additional free vertex $x'$ from $B$, one additional edge $(c,a)$ from the matching, whereas usage of $v_{x'}$ can spoil at most one free vertex from $B$ and at most one edge from the matching. ", "After this, we delete all the possible loops created on the paths in order to make Observation \\[lem:bound-deg\\] still hold. ", "This concludes the construction of the vertex $x$.\n\nTo finish the proof, we need to show that after performing two phases of rerouting obtaining a solution $\\eta$, whose paths can access and leave $x$ only from $A$ and into $C$, we can reroute every path so that it does not pass through $x$ at all. ", "Note that so far we have used at most $4k$ vertices from $B$, so we still have at least $k$ vertices unused.", "\n\nIf $x\\in \\eta(u)$ for some $u\\in V(H)$, then we can simply move the image $u$: we consider $\\eta'$ that differs from $\\eta$ by substituting $x$ for $x'$, where $x'$ is any free vertex from $B$ that is not in $\\eta(V(H))$ ($k\\geq |V(H)|$, so such a vertex exists). ", "Note that we can make this move as $x$ is not a root vertex: the triple does not contain any root vertices. ", "In case when $x\\notin \\eta(V(H))$, we can perform the same rerouting scheme for any $x'$ that is still free in $B$. Now, no path uses $x$, so ${\\ensuremath{\\mathcal{I}}}'=((H,u_1,u_2,\\ldots,u_t),(T\\setminus\\{x\\},v_1,v_2,\\ldots,v_t))$ is a YES instance if ${\\ensuremath{\\mathcal{I}}}$ was.", "\n\nDynamic programming routine for rooted immersion {#sec:app-DP}\n================================================\n\nIn this subsection we present a dynamic programming routine that for rooted digraph $(H;v_1,v_2,\\ldots,v_t)$, rooted semi-complete digraph $(T;w_1,w_2,\\ldots,w_t)$, and path decomposition of $T$ computes whether there exists an immersion $\\eta$ of $H$ into $T$ such that $\\eta(v_i)=w_i$ for all $i\\in\\{1,2,\\ldots,t\\}$. First, we explain the terminology used to describe the constructed parts of immersion model. ", "Then, we proceed to the dynamic programming routine itself. ", "But before all of these, let us give some intuition behind the algorithm.", "\n\nThe main idea of our routine is as follows: we will encode the interaction of the model of $H$ with all the already introduced vertices as sequences of paths. ", "Every such path has to end in the separator, but can begin in any forgotten vertex as it may be accessed from a vertex not yet introduced. ", "In general setting the dynamic program would need to remember this very vertex in order to check whether it can be indeed accessed; that would yield an algorithm and, in essence, this is exactly the idea behind the Fradkin and Seymour algorithm. ", "However, if the digraph is semi-complete, then between every not yet introduced vertex and every forgotten vertex there is an edge. ", "Therefore, we do not need to remember the forgotten vertex itself to check accessibility; a marker saying [*forgotten*]{}, together with information about which markers in fact represent the same vertices, will suffice.", "\n\nWe hope that a reader well-familiar with construction of dynamic programs on various decompositions already has a crude idea about how the computation will be performed. ", "Let us proceed with the details in the next subsections.", "\n\nTerminology\n-----------\n\nIn the definitions we use two special symbols: ${\\ensuremath{\\mathfrak{F}}},{\\ensuremath{\\mathfrak{U}}}$; the reader can think of them as an arbitrary element of $A\\setminus B$ ([*forgotten*]{}) and $B\\setminus A$ ([*unknown*]{}), respectively. ", "Let $\\iota:V(T)\\to (A\\cap B)\\cup \\{{\\ensuremath{\\mathfrak{F}}},{\\ensuremath{\\mathfrak{U}}}\\}$ be defined as follows: $\\iota(v)=v$ if $v\\in A\\cap B$, whereas $\\iota(v)={\\ensuremath{\\mathfrak{F}}}$ for $v\\in A\\setminus B$ and $\\iota(v)={\\ensuremath{\\mathfrak{U}}}$ for $v\\in B\\setminus A$.", "\n\nLet $P$ be a path. ", "A sequence of paths $(P_1,P_2,\\ldots,P_h)$ is a [*[trace]{}*]{} of $P$ with respect to $(A,B)$, if $P_i$, $i\\in\\{1,2,\\ldots,h\\}$ are all maximal subpaths of $P$ that are fully contained in $A$, while the indices in the sequence reflect their ordering on the path $P$.\n\nLet $(P_1,P_2,\\ldots,P_h)$ be the [trace]{} of $P$ with respect to $(A,B)$. An [*signature*]{} of $P$ on $(A,B)$ is a sequence of pairs $((b_1,e_1),(b_2,e_2),\\ldots,(b_h,e_h))$, where $b_h,e_h\\in (A\\cap B)\\cup\\{{\\ensuremath{\\mathfrak{F}}}\\}$, such that for every $i\\in\\{1,2,\\ldots,h\\}$:\n\n- $b_i$ is the beginning of path $P_i$ if $b_i\\in A\\cap B$, and ${\\ensuremath{\\mathfrak{F}}}$ otherwise;\n\n- $e_i$ is the end of path $P_i$ if $e_i\\in A\\cap B$, and ${\\ensuremath{\\mathfrak{F}}}$ otherwise.", "\n\nIn other words, $b_i,e_i$ are images of the beginning and the end of the path $P_i$ in the mapping $\\iota$. Observe following properties of the introduced notion:\n\n- Signature of path $P$ on separation $(A,B)$ depends only on its [trace]{}; therefore, we can also consider signatures of [traces]{}.", "\n\n- It can happen that $b_i=e_i\\neq {\\ensuremath{\\mathfrak{F}}}$ only if $P_i$ consists of only one vertex $b_i=e_i$.\n\n- From the definition of separation it follows that only for $i=h$ it can happen that $e_i={\\ensuremath{\\mathfrak{F}}}$, as there is no arc from $A\\setminus B$ to $B\\setminus A$.", "\n\n- The empty signature corresponds to $P$ entirely contained in $B\\setminus A$.", "\n\n- The signature consisting of one term $({\\ensuremath{\\mathfrak{F}}},{\\ensuremath{\\mathfrak{F}}})$ corresponds to $P$ entirely contained in $A\\setminus B$.\n\nFinally, we are able to encode relevant information about a given model of $H$.\n\nLet $\\eta$ be an immersion of a digraph $H$ in $T$. An [*immersion signature*]{} of $\\eta$ on $(A,B)$ is a mapping $\\rho$ together with equivalence relation $\\equiv$ on the set of all the pairs of form $({\\ensuremath{\\mathfrak{F}}},e)$ appearing in the image of $\\rho$, such that:\n\n- for every $v\\in V(H)$, $\\rho(v)=\\iota(\\eta(v))$;\n\n- for every $e\\in E(H)$, $\\rho(e)$ is a signature of $\\eta(e)$.\n\n- $({\\ensuremath{\\mathfrak{F}}},e_1)\\equiv ({\\ensuremath{\\mathfrak{F}}},e_1)$ if and only if markers ${\\ensuremath{\\mathfrak{F}}}$ in both pairs correspond to the same forgotten vertex before being mapped by $\\iota$.\n\nWe remark that the same pair of form $({\\ensuremath{\\mathfrak{F}}},e)$ can appear in different signatures; in this case we consider all the appearances as different pairs. ", "The sole purpose of introducing the relation $\\equiv$ is forbidding reusage of edges jumping into the forgotten region. ", "We denote the set of possible immersion signatures on separation $(A,B)$ by ${\\mathcal{E}_{(A,B)}}$.\n\nWe now show that the number of possible immersion signatures is bounded, providing the separation is of small order.", "\n\n\\[lem:etrace-bound\\] If $|V(H)|=k, |E(H)|=\\ell, |A\\cap B|=m$, then the number of possible different immersion signatures on $(A,B)$ is bounded by $$(m+2)^k \\cdot ((m+2)^m\\cdot m!\\cdot (m+2))^\\ell\\cdot B_{(m+1)\\ell}=2^{O(k\\log m+m\\ell(\\log \\ell+\\log m))}.$$ Moreover, all of them can be enumerated in $2^{O(k\\log m+m\\ell(\\log \\ell+\\log m))}$ time.", "\n\nThe consecutive terms correspond to:\n\n1. ", " the choice of mapping $\\rho$ on $V(H)$;\n\n2. ", " for every edge $e\\in E(H)$ the complete information about the signature $\\rho(e)$:\n\n - for every element of $A\\cap B$, whether it will be the end of some path in the signature, and in this case, the value of corresponding beginning (a vertex from $A\\cap B$ or ${\\ensuremath{\\mathfrak{F}}}$),\n\n - the ordering of pairs along the signature,\n\n - and whether to append a pair of form $(b,{\\ensuremath{\\mathfrak{F}}})$ at the end of the signature $\\rho(e)$, and in this case, the value of $b$ (a vertex from $A\\cap B$ or ${\\ensuremath{\\mathfrak{F}}}$);\n\n3. ", " partition of at most $(m+1)l$ pairs in all the signatures from $\\rho(E(H))$ into equivalence classes with respect to $\\equiv$.\n\nIn the last term we made use of Bell numbers $B_n$, for which a trivial bound $B_n\\leq n^n$ applies.", "\n\nIt is easy to check that using all these information one can reconstruct the whole signature. ", "For every object constructed in the manner above we can check in time polynomial in $k,l,m$, whether it corresponds to a possible signature. ", "This yields the enumeration algorithm.", "\n\nDynamic programming routine\n---------------------------\n\nWe are now ready to prove the main theorem of this section.", "\n\n\\[thm:dpe\\] There exists an algorithm that given a distinctly rooted digraph $(H;v_1,v_2,\\ldots,v_t)$ with $k$ vertices and $\\ell$ edges and a semi-complete distinctly rooted digraph $(T;w_1,w_2,\\ldots,w_t)$ together with its path decomposition of width $p$, checks in time $2^{O(k\\log p + p\\ell(\\log \\ell+\\log p))}|V(T)|$, whether $H$ can be immersed into $T$ while preserving roots.", "\n\nLet $W = (W_1, \\dots , W_r)$ be a path decomposition of $T$ of width $p$. We can assume that $W$ is a *nice* decomposition, i.e. $W_1=W_r=\\emptyset$ and for every $i\\in \\{2, \\dots, r\\}$, $|W_i \\setminus W_{i-1}|+|W_{i-1} \\setminus W_{i}|=1$. If $W_i=W_{i-1}\\cup\\{v\\}$, we say that $W_i$ [*introduces*]{} $v$; if $W_{i-1}=W_i\\cup\\{v\\}$, we say that $W_i$ [*forgets*]{} $v$. Via standard arguments, it is easy to check that every path decomposition can be adjusted to be nice in linear time. ", "Intuitively, between every two bags of the given decomposition we firstly forget the part that needs to be forgotten, and then introduce the part that needs to be introduced. ", "We also note remark that for every $i\\in \\{1, \\dots, r\\}$, the sets $A=W_1\\cup \\cdots \\cup W_{i}$ and $B=W_i\\cup \\cdots \\cup W_{r}$ form a separation of $T$ with separator $W_i$.\n\nThe number of possible signatures on any separation $(A,B)$ from the decomposition is bounded by $2^{O(k\\log p + pl(\\log \\ell+\\log p))}$ by Lemma \\[lem:etrace-bound\\]. ", "We show how to compute the values of a binary table $D_{(A,B)}:{\\mathcal{E}_{(A,B)}}\\to \\{\\bot,\\top\\}$ with the following meaning. ", "For $\\rho\\in {\\mathcal{E}_{(A,B)}}$, $D_{(A,B)}[\\rho]$ tells, whether there exists a mapping $\\overline{\\rho}$ with following properties:\n\n- for every $v\\in V(H)$, $\\overline{\\rho}(v)=\\rho(v)$ if $\\rho(v)\\in (A\\cap B)\\cup \\{{\\ensuremath{\\mathfrak{U}}}\\}$ and $\\overline{\\rho}(v)\\in A\\setminus B$ if $\\rho(v)={\\ensuremath{\\mathfrak{F}}}$;\n\n- for every $i=1,2,\\ldots,t$, $\\overline{\\rho}(v_i)=w_i$ if $w_i\\in A$ and $\\overline{\\rho}(v_i)={\\ensuremath{\\mathfrak{U}}}$ otherwise;\n\n- for every $e=(v,w)\\in E(H)$, $\\overline{\\rho}(e)$ is a correct path trace with signature $\\rho(e)$, beginning in $\\overline{\\rho}(v)$ if $\\overline{\\rho}(v)\\in A$ and anywhere in $A$ otherwise, ending in $\\overline{\\rho}(w)$ if $\\overline{\\rho}(w)\\in A$ and anywhere in $A\\cap B$ otherwise;\n\n- path traces $\\overline{\\rho}(e)$ are edge disjoint.", "\n\nSuch mapping $\\overline{\\rho}$ will be called a [*partial immersion*]{} of $H$ on $(A,B)$.\n\nFor the first separation $(\\emptyset,V(T))$ we have exactly one signature with value $\\top$, being the signature which maps all the vertices into ${\\ensuremath{\\mathfrak{U}}}$ and all the edges into empty signatures. ", "The result of the whole computation should be the value for the signature for the last separation $(V(T),\\emptyset)$, which maps all vertices into ${\\ensuremath{\\mathfrak{F}}}$ and edges into signatures consisting of one pair $({\\ensuremath{\\mathfrak{F}}},{\\ensuremath{\\mathfrak{F}}})$. Therefore, it suffices to show how to fill the values of the table for [**[introduce vertex]{}**]{} step and [**[forget vertex]{}**]{} step.", "\n\n[**[Introduce vertex step.]{}**]{}", "\n\nLet us introduce vertex $v\\in B\\setminus A$ to the separation $(A,B)$, i.e., we consider the new separation $(A\\cup\\{v\\},B)$. Let $\\rho\\in {\\mathcal{E}_{(A\\cup\\{v\\},B)}}$, we need to show how to compute $D_{(A\\cup\\{v\\},B)}[\\rho]$ by careful case study of how the signature $\\rho$ interferes with the vertex $v$. If $v=w_i$ for some $i\\in \\{1,2,\\ldots,t\\}$, then we consider only such $\\rho$ for which $\\rho(v_i)=v$; for all the others we fill false values.", "\n\n- $v\\notin \\rho(V(H))$, that is, $v$ is not being mapped on by any vertex of $H$. For every $e\\in E(H)$ we consider, how $v$ interferes with $\\rho(e)$. We argue that $D_{(A\\cup\\{v\\},B)}[\\rho]=\\bigvee_{\\rho'\\in {\\ensuremath{\\mathcal{G}}}} D_{(A,B)}[\\rho']$ for some set ${\\ensuremath{\\mathcal{G}}}$; for every $\\rho'\\in {\\ensuremath{\\mathcal{G}}}$ we require that $\\rho'|_{V(H)}=\\rho|_{V(H)}$ and for every $e\\in E(H)$ we list the possible values of $\\rho'(e)$. The set ${\\ensuremath{\\mathcal{G}}}$ consists of all the possible signatures on $(A,B)$ that have one of the proper values for every $e\\in E(H)$ and also satisfy some additional constraints regarding equivalence relation $\\equiv$ that are described further.", "\n\n - $b_i=v=e_i$ for some pair $(b_i,e_i)\\in \\rho(e)$. That means, that the signature of $e$ truncated to separation $(A,B)$ must look exactly like $\\rho(e)$, but without this subpath of length one. ", "Thus we have one possible value for $\\rho'(e)$, being $\\rho(e)$ with this pair deleted.", "\n\n - $b_i=v\\neq e_i$ for some pair $(b_i,e_i)\\in \\rho(e)$ and some $e\\in E(H)$. That means that the signature $\\rho(e)$ truncated to separation $(A,B)$ has to look the same but for the path corresponding to this very pair, which needs to be truncated by vertex $v$. The new beginning has to be either a vertex in $A\\cap B$, or a forgotten vertex from $A\\setminus B$. As $T$ is semi-complete and $(A,B)$ is a separation, there is an edge between $v$ and every vertex of $A\\setminus B$. Therefore, in $\\rho'(e)$ the pair $(b_i,e_i)$ has to be replaced with $(b_i',e_i)$, where $b_i'={\\ensuremath{\\mathfrak{F}}}$ or $b_i'$ is any vertex of $A\\cap B$ such that there is an arc $(v,b_i')$. All the vertices $b_i'\\neq {\\ensuremath{\\mathfrak{F}}}$ obtained in this manner have to be pairwise different; moreover, we impose a condition that for all $e\\in E(H)$ for which some pair of form $(v,e_i)$ has been truncated to $({\\ensuremath{\\mathfrak{F}}},e_i)$, these pairs have to be pairwise non-equivalent with respect to $\\equiv$, in order forbid multiple usage of edges going to the forgotten vertices.", "\n\n - $b_i\\neq v=e_i$ for some pair $(b_i,e_i)\\in \\rho(e)$ and some $e\\in E(H)$. Similarly as before, signature $\\rho(e)$ truncated to separation $(A,B)$ has to look the same but for the path corresponding to this very pair, which needs to be truncated by vertex $v$. As $(A,B)$ is a separation, the previous vertex on the path has to be in the separator $A\\cap B$. Therefore, in ${\\ensuremath{\\mathcal{G}}}$ we take into consideration all signatures $\\rho'$ such that in $\\rho'$ the pair $(b_i,e_i)$ is replaced with $(b_i,e_i')$, where $e_i'$ is any vertex of $A\\cap B$ such that there is an arc $(e_i',v)$. Also, all vertices $e_i'$ used in this manner have to be pairwise different.", "\n\n - $v$ is not contained in any pair in $\\rho(e)$. Either $v$ lies in the interior of some subpath from $\\overline{\\rho}(e)$, or it is not used by $\\overline{\\rho}(e)$ at all. ", "In the first case the corresponding path in partial immersion on $(A\\cup\\{v\\},B)$ has to be split into two subpaths when truncating the immersion to $(A,B)$. Along this path, the edge that was used to access $v$ had to go from inside $A\\cap B$, due to $(A\\cup\\{v\\},B)$ being a separation. ", "However, the edge used to leave $v$ can go to $A\\cap B$ as well as to any forgotten vertex from $A\\setminus B$, as $(A,B)$ is a separation and $T$ is a semi-complete digraph. ", "In the second case, the signature of the truncated immersion stays the same. ", "Therefore, in ${\\ensuremath{\\mathcal{G}}}$ we take into consideration signatures $\\rho'$ such that they not differ from $\\rho$ on $e$, or in $\\rho'(e)$ exactly one pair $(b_i,e_i)$ is replaced with two pairs $(b_i,e_i')$ and $(b_i',e_i)$, where $e_i'\\in A\\cap B$ with $(e_i',v)\\in E(T)$, whereas $b_i'={\\ensuremath{\\mathfrak{F}}}$ or $b_i'\\in A\\cap B$ with $(v,b_i')\\in E(T)$. Similarly as before, all vertices $b_i'\\neq {\\ensuremath{\\mathfrak{F}}}$ used have to be pairwise different and different from those used in case $1.2$, all vertices $e_i'$ used have to be pairwise different and different from those used in case $1.3$, and all the pairs $({\\ensuremath{\\mathfrak{F}}},e_i)$ created in this manner have to be pairwise non-equivalent and non-equivalent to those created in case $1.2$.\n\n- $v=\\rho(u)$ for some $u\\in V(H)$. For every $(u,u')\\in E(H)$, $v$ has to be the beginning of the first pair of $\\rho((u,u'))$; otherwise, $D_{(A\\cup\\{v\\},B)}=\\bot$. Similarly, for every $(u',u)\\in E(H)$, $v$ has to be the end of the last pair of $\\rho((u',u))$; otherwise, $D_{(A\\cup\\{v\\},B)}=\\bot$. Therefore, into ${\\ensuremath{\\mathcal{G}}}$ we take all signatures $\\rho'$ such that: [*(i)*]{} $\\rho'$ differs on $V(H)$ from $\\rho$ only by having $\\rho'(u)=v$ where $\\rho(u)$ must be equal to ${\\ensuremath{\\mathfrak{U}}}$; [*(ii)*]{} the first pairs of all $\\rho((u,u'))$ are truncated as in the case $1.2$ for all $(u,u')\\in E(H)$ (or as in case $1.1$, if the beginning and the end coincide); [*(iii)*]{} the last pairs of all $\\rho((u',u))$ are truncated as in the case $1.3$ for all $(u',u)\\in E(H)$ (or as in case $1.1$, if the beginning and the end coincide); [*(iv)*]{} for all the other edges $e$ we proceed as in the case $1.4$.\n\n[**[Forget vertex step.]{}**]{}", "\n\nLet us forget vertex $w\\in A\\setminus B$ from the separation $(A\\cup \\{w\\},B)$, i.e., we consider the new separation $(A,B)$. Let $\\rho\\in {\\mathcal{E}_{(A,B)}}$; we argue that $D_{(A,B)}[\\rho]=\\bigvee_{\\rho'\\in {\\ensuremath{\\mathcal{G}}}} D_{(A\\cup\\{w\\},B)}[\\rho']$ for some set ${\\ensuremath{\\mathcal{G}}}\\subseteq {\\mathcal{E}_{(A\\cup\\{w\\},B)}}$, which corresponds to possible extensions of $\\rho$ to the previous, bigger separation. ", "We now discuss, which signatures $\\rho'$ are needed in ${\\ensuremath{\\mathcal{G}}}$ by considering all the signatures $\\rho'\\in {\\mathcal{E}_{(A\\cup\\{w\\},B)}}$ partitioned with respect to behaviour of the vertex $w$. For every signature $\\rho'$ and every $e\\in E(H)$ we examine the interaction between $\\rho'(e)$ and $w$; in each case we decide, which behaviour of $\\rho'(e)$ is correct. ", "In ${\\ensuremath{\\mathcal{G}}}$ we take into the account all signatures $\\rho'$ behaving properly on all $e\\in E(H)$.\n\n- $w\\notin \\rho'(V(H))$, that is, $w$ is not an image of a vertex of $H$. In this case we require $\\rho'|_{V(H)}=\\rho'_{V(H)}$.\n\n - $b_i=w=e_i$ for some pair $(b_i,e_i)\\in \\rho'(e)$. That means that in the corresponding partial immersions $w$ had to be left to $B\\setminus A$; however, in $T$ there is no edge from $w$ to $B\\setminus A$ as $(A,B)$ is a separation. ", "Therefore, in ${\\ensuremath{\\mathcal{G}}}$ we consider no signatures $\\rho'$ behaving in this manner.", "\n\n - $b_i=w\\neq e_i$ for some pair $(b_i,e_i)\\in \\rho'(e)$. This means that $w$ prolongs some path from the signature $\\rho$ in such a manner, that $w$ is its beginning. ", "After forgetting $w$ the beginning of this path belongs to the forgotten vertices; therefore, in ${\\ensuremath{\\mathcal{G}}}$ we consider only signatures $\\rho'$ in which $\\rho'(e)$ differs from $\\rho(e)$ on exactly one pair: in $\\rho'(e)$ there is $(w,e_i)$ instead of $({\\ensuremath{\\mathfrak{F}}},e_i)$ in $\\rho$. Moreover, all such pairs $({\\ensuremath{\\mathfrak{F}}},e_i)$ that were extended by $w$ have to form one whole equivalence class with respect to $\\equiv$ in $\\rho$.\n\n - $b_i\\neq w=e_i$ for some pair $(b_i,e_i)\\in \\rho'(e)$. That means that $w$ prolongs some path from the signature $\\rho$ in such a manner, that $w$ is its end. ", "As $w\\notin\\rho'(V(H))$ the path should continue further into $B\\setminus A$; however, as $(A,B)$ is a separator, there is no edge between $w$ and $B\\setminus A$. ", "We obtain a contradiction; therefore, we take no such signature into account in the set ${\\ensuremath{\\mathcal{G}}}$.\n\n - $w$ is not contained in any pair in $\\rho'(e)$. In this case $w$ has to be either unused by $\\rho'(e)$, or used inside some subpath of $\\rho'(e)$. Therefore, we take into consideration in ${\\ensuremath{\\mathcal{G}}}$ exactly signatures in which $\\rho'(e)=\\rho(e)$.\n\n- $w=\\rho'(u)$ for some $u\\in V(H)$. We consider in ${\\ensuremath{\\mathcal{G}}}$ signatures $\\rho'$ that differ from $\\rho$ in following manner: [*(i)*]{} $\\rho'(u)=w$ where $\\rho(u)$ has to be equal to ${\\ensuremath{\\mathfrak{F}}}$; [*(ii)*]{} for all edges $(u,u')\\in E(H)$ the first pair of $\\rho'((u,u'))$ is of form $(w,e_1)$, whereas the first pair of $\\rho((u,u'))$ is of form $({\\ensuremath{\\mathfrak{F}}},e_1)$; [*(iii)*]{} for all edges $(u',u)\\in E(H)$ the last pair of $\\rho'((u',u))$ is of form $(b_h,w)$, whereas the last pair of $\\rho((u,u'))$ is of form $(b_h,{\\ensuremath{\\mathfrak{F}}})$; [*(iv)*]{} for all edges $e\\in E(H)$ non-incident with $u$ we follow the same truncation rules as in cases $1.1$-$1.4$. Moreover, all pairs in which $w$ has been replaced with ${\\ensuremath{\\mathfrak{F}}}$ marker have to form one whole equivalence class with respect to $\\equiv$.\n\nSince updating the table $D_{(A,B)}$ for every separation $(A,B)$ requires at most $O(|{\\mathcal{E}_{(A,B)}}|^2)= 2^{O(k\\log p + p\\ell(\\log \\ell+\\log p))}$ steps, while the number of separations in the pathwidth decomposition is $O(|V(T)|)$, the theorem follows.", "\n\nCounterexample for the irrelevant vertex technique for\\\n$k$-<span style=\"font-variant:small-caps;\">Vertex Disjoint Paths</span> {#sec:app-counter}\n=======================================================================\n\nWe construct a semi-complete digraph $T_n$ with two pairs $(s_1,t_1)$, $(s_2,t_2)$ with the following properties:\n\n- $T_n$ contains an $(n/2-1)$-triple;\n\n- there is exactly one solution to instance $(T_n,\\{(s_1,t_1),(s_2,t_2)\\})$ in which all the vertices of $V(T_n)$ lie on one of the paths.", "\n\nThis example shows that even though a graph can be complicated from the point of view of path decompositions, all the vertices can be relevant.", "\n\nLet $V(T_n)=\\{a_i,b_i: 1\\leq i\\leq n\\}$, where $s_1=a_1$, $t_1=a_n$, $s_2=b_n$ and $t_2=b_1$. Construct following edges:\n\n- for every $i\\in\\{1,2,\\ldots,n-1\\}$ create an edge $(a_i,a_{i+1})$;\n\n- for every $i,j\\in\\{1,2,\\ldots,n\\}, i<j-1$ create an edge $(a_j,a_i)$;\n\n- for every $i\\in\\{1,2,\\ldots,n-1\\}$ create an edge $(b_{i+1},b_i)$;\n\n- for every $i,j\\in\\{1,2,\\ldots,n\\}, i>j+1$ create an edge $(b_j,b_i)$;\n\n- for every $i\\in\\{1,2,\\ldots,n\\}$ create an edge $(a_i,b_i)$;\n\n- for every $i,j\\in\\{1,2,\\ldots,n\\}, i\\neq j$ create an edge $(b_j,a_i)$.\n\nTo see that $T_n$ satisfies (a), observe that $$(\\{b_1,b_2,\\ldots,b_{n/2-1}\\},\\{a_{n/2+1},a_{n/2+2},\\ldots,a_{n}\\},\\{a_1,a_2,\\ldots,a_{n/2-1}\\})$$ is a $(n/2-1)$-triple. ", "To prove that (b) is satisfied as well, observe that there is a solution to problem containing two paths $(a_1,a_2,\\ldots,a_n)$ and $(b_n,b_{n-1},\\ldots,b_1)$ which in total use all the vertices of $T_n$. Assume that there is some other solution and let $k$ be the largest index such that the path connecting $a_1$ to $a_n$ begins with prefix $(a_1,a_2,\\ldots,a_k)$. As the solution is different from the aforementioned one, it follows that $k<n$. Therefore, the next vertex on the path has to be $b_k$, as this is the only unused outneighbor of $a_k$ apart from $a_{k+1}$. But if the path from $a_1$ to $a_n$ already uses $\\{a_1,a_2,\\ldots,a_k,b_k\\}$, we see that there is no edge going from $\\{a_{k+1},a_{k+2},\\ldots,a_n,b_{k+1},b_{k+2},\\ldots,b_n\\}$ to $\\{b_1,b_2,\\ldots,b_{k-1}\\}$, so we are already unable to construct a path from $b_n$ to $b_1$. This is a contradiction.", "\n\n[^1]: Department of Informatics, University of Bergen, Bergen, Norway, {fomin,michal.pilipczuk}@ii.uib.no\n\n[^2]: Sometimes in the literature this notion is called a [*weak immersion*]{}. ", "We remark that all our results can be easily extended to strong immersions as well.", "\n" ]

{ "pile_set_name": "ArXiv" }

[ 0.000644165207631886, 0.0005821124650537968, 0.0009109179372899234, 0.0011670615058392286, 0.000759979011490941, 0.0009109179372899234, 0.0006251953891478479, 0.0008547682082280517, 0.0011379122734069824, 0.0005468348972499371, 0.00065085687674582, 0.000674888608045876, 0.0006365557201206684, 0.0007931613363325596, 0.0006704223342239857, 0.0005960148992016912, 0.000742887204978615, 0.0007153476472012699, 0.0009525601053610444, 0.0006717942887917161, 0.0008988107438199222, 0.0007954213651828468, 0.0009425783064216375, 0.0006159481126815081, 0.0006837658584117889, 0.0007849385146982968, 0.0006158661562949419, 0.0005791398580186069, 0.001643188763409853, 0.0007832607952877879, 0.0007460570777766407, 0.0006261998205445707, 0.0007755898404866457, 0.000615712720900774, 0.0005660868482664227, 0.0006525950157083571, 0.0008275983855128288, 0.0009310534223914146, 0.0005713862483389676, 0.0007575412164442241, 0.0006311568431556225, 0.0009262855746783316, 0.0006697978242300451, 0.0006532294792123139, 0.001032499480061233, 0.0008241714676842093, 0.001683430396951735, 0.0008066226728260517, 0.0022705334704369307, 0.0006972338887862861, 0.0007406160584650934, 0.0010044235968962312, 0.0009235954494215548, 0.0007436341256834567, 0.0010536876507103443, 0.0005891956388950348, 0.0027090476360172033, 0.0005949399201199412, 0.0007119539077393711, 0.0006382031715475023, 0.0005786261754110456, 0.0009592440910637379, 0.0008084414293989539, 0.0006714527844451368, 0.0006580615299753845, 0.0006539928144775331, 0.0007947985432110727, 0.0006285865674726665, 0.0005669103120453656, 0.0005694010760635138, 0.004985184874385595, 0.0009430992649868131, 0.00173079629894346, 0.0007736536208540201, 0.0006057283608242869, 0.0006476228591054678, 0.005185290705412626, 0.0007651931373402476, 0.0005429014563560486, 0.0007558333454653621, 0.0006270388839766383, 0.0034488283563405275, 0.0008310034172609448, 0.0005646109348163009, 0.0005822994862683117, 0.0009393374202772975, 0.0005531267961487174, 0.0006061068852432072, 0.021587304770946503, 0.000648398301564157, 0.0006089911912567914, 0.0007613958441652358, 0.008805176243185997, 0.0016694075893610716, 0.0026562849525362253, 0.0013998675858601928, 0.08062653243541718, 0.004862762987613678, 0.0008912023040466011, 0.0009613718139007688, 0.0027857902459800243, 0.0005450744647532701, 0.0019902910571545362, 0.016094006597995758, 0.031251050531864166, 0.004316253121942282, 0.0006415539537556469, 0.07482516765594482, 0.0323498472571373, 0.006894474383443594, 0.04431458190083504, 0.007988893426954746, 0.0006087851361371577, 0.011853153817355633, 0.0005667476798407733, 0.0031367377378046513, 0.0008470515022054315, 0.0005415959167294204, 0.0006294627673923969, 0.0005450391327030957, 0.003535135416314006, 0.0005483122658915818, 0.0018162151100113988, 0.007632478140294552, 0.01782057248055935, 0.063018798828125, 0.0006906550261192024, 0.0005827503046020865, 0.004313264507800341, 0.0041941325180232525, 0.018538888543844223, 0.011450824327766895, 0.0008938742685131729, 0.0075981998816132545, 0.02097291499376297, 0.004913076292723417, 0.0031894221901893616, 0.0009026048355735838, 0.0037692112382501364, 0.004474463406950235, 0.0009919519070535898, 0.0010205610888078809, 0.010551211424171925, 0.0009103973279707134, 0.000944755447562784, 0.0006231875740922987, 0.001072260900400579, 0.0006191723514348269, 0.0009243762469850481, 0.0005452041514217854, 0.0006155525334179401, 0.01926439255475998, 0.001702849636785686, 0.0008171452209353447, 0.0028319412376731634, 0.014487109147012234, 0.006232101004570723, 0.0035635840613394976, 0.0007189349853433669, 0.0018133120611310005, 0.004368989262729883, 0.0006231688312254846, 0.009001671336591244, 0.0008794022141955793, 0.006895751226693392, 0.0005843749968335032, 0.0005787864211015403, 0.0007492111180908978, 0.035665616393089294, 0.0005840645753778517, 0.000615609809756279, 0.001160012325271964, 0.0010817745933309197, 0.000926862470805645, 0.0008110482594929636, 0.003112811828032136, 0.004612638149410486, 0.0005727673415094614, 0.0029258537106215954, 0.001441308530047536, 0.0005586926126852632, 0.0005776866455562413, 0.010038821026682854, 0.0010686146561056376, 0.0009996597655117512, 0.0013535189209505916, 0.0023114096838980913, 0.004904928617179394, 0.0007176774088293314, 0.0008392675663344562, 0.0007345035555772483, 0.0030990855302661657, 0.0012151002883911133, 0.0005500115221366286, 0.0005655704881064594, 0.0023714550770819187, 0.0006086279172450304, 0.0009909674990922213, 0.0005149737698957324, 0.0007268895278684795, 0.0007822683546692133, 0.0006403554580174387, 0.01048985868692398, 0.000905644497834146, 0.0008021547109819949, 0.0005565385217778385, 0.000602563435677439, 0.0005523120635189116, 0.0008934698416851461, 0.0008215439738705754, 0.0006888289353810251, 0.003437280422076583, 0.001157000195235014, 0.0006868040072731674, 0.0006981505430303514, 0.0007977209752425551, 0.0006422483129426837, 0.0007038127514533699, 0.0005828069988638163, 0.0006550252437591553, 0.0006690740119665861, 0.0006019460852257907, 0.006134276743978262, 0.0010009562829509377, 0.0008367630071006715, 0.0007724307361058891, 0.011934197507798672, 0.001377841574139893, 0.00262502022087574, 0.0016163713298738003, 0.04173220694065094, 0.005719536449760199, 0.0033025071024894714, 0.02378983236849308, 0.030169229954481125, 0.0006511480896733701, 0.002909416100010276, 0.0011173929087817669, 0.000575121259316802, 0.0007848675595596433, 0.0006840119604021311, 0.0014134248485788703, 0.009976206347346306, 0.0008678754675202072, 0.0007172002224251628, 0.0006127779488451779, 0.019486401230096817, 0.0015478042187169194, 0.0006380550912581384, 0.0006882006418891251, 0.0005627995124086738, 0.0013736127875745296, 0.023392265662550926, 0.0020449210423976183, 0.005358719266951084, 0.0007341753807850182, 0.0036616013385355473, 0.0009995198342949152, 0.02435421571135521, 0.01988285966217518, 0.0059849293902516365, 0.0005323766963556409, 0.027546904981136322, 0.0018008806509897113, 0.0024910897482186556, 0.00946351233869791, 0.008095238357782364, 0.030230706557631493, 0.005456994287669659, 0.015365643426775932, 0.0005687756347469985, 0.0009018466807901859, 0.0009808532195165753, 0.0005802041850984097, 0.0007048185798339546, 0.021577946841716766, 0.0005402041133493185, 0.001515396754257381, 0.0012219080235809088, 0.03628002107143402, 0.0008620634325779974, 0.001503298059105873, 0.008665041998028755, 0.008557748049497604, 0.0011723136994987726, 0.0005788542912341654, 0.0008914329227991402, 0.0007211018237285316, 0.0009022695012390614, 0.000598348502535373, 0.0005951599450781941, 0.0009091803221963346, 0.002033362165093422, 0.0009152936399914324, 0.0009969918755814433, 0.002301320666447282, 0.0007769279764033854, 0.0006873825914226472, 0.0019524297676980495, 0.0006653797463513911, 0.0008062975248321891, 0.001199089689180255, 0.0005668295198120177, 0.003217830089852214, 0.0006861177971586585, 0.0011424936819821596, 0.0009841617429628968, 0.010981819592416286, 0.0016991178272292018, 0.0010347437346354127, 0.000949824636336416, 0.0007247835746966302, 0.0012351778568699956, 0.0011860732920467854, 0.0009685105178505182, 0.004319644067436457, 0.002600553212687373, 0.002725826343521476, 0.0012023155577480793, 0.01088543888181448, 0.0010059864725917578, 0.000681679230183363, 0.011994928121566772, 0.0019356136908754706, 0.03345109894871712, 0.000619055237621069, 0.004873079247772694, 0.000733113382011652, 0.0026073807384818792, 0.0005898524541407824, 0.0006072326796129346, 0.004041162319481373, 0.0008435738272964954, 0.002069176873192191, 0.0011453115148469806, 0.0037888900842517614, 0.0024282510858029127, 0.0037238344084471464, 0.0070518315769732, 0.019041942432522774, 0.0008533265790902078, 0.0006339873652905226, 0.0008508432656526566, 0.0011597388656809926, 0.001395662548020482, 0.0006494347471743822, 0.0005438500083982944, 0.004079819656908512, 0.0016673648497089744, 0.0012114131823182106, 0.0009089888189919293, 0.000869547133333981, 0.0021752859465777874, 0.0008121688733808696, 0.0010919704800471663, 0.0007266404572874308, 0.004190605133771896, 0.001891549676656723, 0.002583086024969816, 0.0006892393575981259, 0.0007779084844514728, 0.0006665803375653923, 0.0007723692688159645, 0.004431526176631451, 0.002129301195964217, 0.0011985261226072907, 0.0031676830258220434, 0.0021737143397331238, 0.03228837624192238, 0.005211728159338236, 0.00576375937089324, 0.0006954756681807339, 0.020522482693195343, 0.0016660462133586407, 0.002233067061752081, 0.0012355572544038296, 0.004593490622937679, 0.00820142775774002, 0.001081156893633306, 0.0019054226577281952, 0.0008545035379938781, 0.0015376630472019315, 0.0010317424312233925, 0.017777925357222557, 0.01139269769191742, 0.0011153924278914928, 0.001196581870317459, 0.001219539437443018, 0.0012271368177607656, 0.0007073207525536418, 0.000949090113863349, 0.0007722636801190674, 0.0007038402836769819, 0.0009616590104997158, 0.010478821583092213, 0.0008101213607005775, 0.0034258412197232246, 0.0024794754572212696, 0.005536844488233328, 0.00946368183940649, 0.0011149606434628367, 0.0006449257489293814, 0.0006660145008936524, 0.0017903901170939207, 0.0007898855255916715, 0.0008780411444604397, 0.0007734412793070078, 0.0011503065470606089, 0.0009143893257714808, 0.0010602115653455257, 0.0007261538994498551, 0.0007682618452236056, 0.0007163160480558872, 0.0007281131111085415, 0.003187401918694377, 0.000841267523355782, 0.005837123375386, 0.001700457651168108, 0.0005777259939350188, 0.0005917616072110832, 0.0006132337148301303, 0.0005843248218297958, 0.0005504279397428036, 0.0006150792469270527, 0.000573128869291395, 0.0005151399527676404, 0.0005494228680618107, 0.00243891729041934, 0.2922106385231018, 0.13898350298404694, 0.040206428617239, 0.0021288562566041946, 0.03835021331906319, 0.0016288947081193328, 0.005823784973472357, 0.000993736321106553, 0.0005958626861684024, 0.010314904153347015, 0.0005838461220264435, 0.0008217220311053097, 0.0024661230854690075, 0.002281550085172057, 0.0005483527202159166, 0.000604257162194699, 0.0006332171615213156, 0.0006912894896231592, 0.002199395326897502, 0.024845441803336143, 0.0005687756347469985, 0.017137983813881874, 0.0007812193944118917, 0.10108640789985657, 0.007305370178073645, 0.001411548932082951, 0.0007048185798339546, 0.007090749219059944, 0.017975205555558205, 0.009781054221093655, 0.0011791515862569213, 0.010601108893752098, 0.007765648420900106, 0.007384613621979952, 0.0010557621717453003, 0.007385245990008116, 0.0005881497636437416, 0.03813331574201584, 0.02076173759996891, 0.0027537003625184298, 0.01364216674119234, 0.0018428110051900148, 0.032880332320928574, 0.014872617088258266, 0.01343660056591034, 0.019220657646656036, 0.0039024814032018185, 0.0005568903288803995, 0.12341789901256561, 0.0066585843451321125, 0.0005910274921916425, 0.0005234914715401828, 0.001994825666770339 ]

[ "$settings: (\n columns: 12,\n margin: 0.5em,\n breakpoints: (\n sm: \"only screen and (min-width : 48em)\",\n md: \"only screen and (min-width : 62em)\",\n lg: \"only screen and (min-width : 65em)\"\n )\n);\n\n@mixin renderGridStyles($settings){\n [str-row] {\n box-sizing: border-box;\n display: -webkit-box;\n display: -webkit-flex;\n display: -ms-flexbox;\n display: flex;\n flex-direction: row;\n flex-wrap: wrap;\n margin-right: map-get($settings, \"margin\") * -1;\n margin-left: map-get($settings, \"margin\") * -1;\n -moz-box-sizing: border-box;\n -ms-flex-direction: row;\n -ms-flex-wrap: wrap;\n -webkit-box-orient: horizontal;\n -webkit-box-direction: normal;\n -webkit-flex-direction: row;\n -webkit-flex-wrap: wrap;\n }\n [str-row-vertical] {\n box-sizing: border-box;\n display: -webkit-box;\n display: -webkit-flex;\n display: -ms-flexbox;\n display: flex;\n flex-direction: column;\n flex-wrap: wrap;\n margin-top: map-get($settings, \"margin\") * -1;\n margin-bottom: map-get($settings, \"margin\") * -1;\n -moz-box-sizing: border-box;\n -ms-flex-direction: row;\n -ms-flex-wrap: wrap;\n -webkit-box-orient: vertical;\n -webkit-box-direction: normal;\n -webkit-flex-direction: column;\n -webkit-flex-wrap: wrap;\n }\n $breakpoints: map-get($settings, \"breakpoints\");\n @include renderCommon(\"xs\", $settings);\n @include renderColumns(\"xs\", $settings);\n @include renderOffsets(\"xs\", $settings);\n @include renderOrder(\"xs\", $settings);\n @include renderFlex(\"xs\", $settings);\n @each $key, $breakpoint in $breakpoints {\n @include media($breakpoint) {\n @include renderCommon($key, $settings);\n @include renderColumns($key, $settings);\n @include renderOffsets($key, $settings);\n @include renderOrder($key, $settings);\n @include renderFlex($key, $settings);\n }\n }\n}\n\n@mixin renderCommon($key, $settings) {\n $i: 1;\n $end: map-get($settings, \"columns\") - 1;\n $list: ();\n $list: append($list, unquote(\"[str-#{$key}]\"),comma);\n @while $i <= map-get($settings, \"columns\") {\n $list: append(\n $list,\n unquote(\"[str-#{$key}='#{$i}']\"),\n comma\n );\n $i: $i+1;\n }\n #{$list} {\n box-sizing: border-box;\n display: flex;\n display: -webkit-box;\n display: -webkit-flex;\n display: -ms-flexbox;\n flex-direction: column;\n flex-grow: 0;\n flex-shrink: 0;\n padding-right: map-get($settings, \"margin\");\n padding-left: map-get($settings, \"margin\");\n -moz-box-sizing: border-box;\n -ms-flex-direction: column;\n -ms-flex-positive: 0;\n -ms-flex-negative: 0;\n -webkit-box-flex: 0;\n -webkit-flex-grow: 0;\n -webkit-box-orient: vertical;\n -webkit-box-direction: normal;\n -webkit-flex-direction: column;\n -webkit-flex-shrink: 0;\n }\n $i: 1;\n $end: map-get($settings, \"columns\") - 1;\n $list: ();\n $list: append($list, unquote(\"[str-row-vertical] [str-#{$key}]\"),comma);\n @while $i <= map-get($settings, \"columns\") {\n $list: append(\n $list,\n unquote(\"[str-row-vertical] [str-#{$key}='#{$i}']\"),\n comma\n );\n $i: $i+1;\n }\n #{$list} {\n padding-left: initial;\n padding-right: initial;\n padding-top: map-get($settings, \"margin\");\n padding-bottom: map-get($settings, \"margin\");\n }\n}\n\n@mixin renderColumns($key, $settings) {\n [str-#{$key}] {\n flex-basis: 0;\n flex-grow: 1;\n max-width: 100%;\n -ms-flex-positive: 1;\n -ms-flex-preferred-size: 0;\n -webkit-flex-basis: 0;\n -webkit-box-flex: 1;\n -webkit-flex-grow: 1;\n }\n [str-row-vertical] [str-#{$key}] {\n flex-basis: 0;\n flex-grow: 1;\n max-height: 100%;\n -ms-flex-positive: 1;\n -ms-flex-preferred-size: 0;\n -webkit-flex-basis: 0;\n -webkit-box-flex: 1;\n -webkit-flex-grow: 1;\n }\n $i: 1;\n @while $i <= map-get($settings, \"columns\") {\n [str-#{$key}='#{$i}'] {\n -webkit-flex-basis: 100% * $i / map-get($settings,\"columns\");\n -ms-flex-preferred-size: 100% * $i / map-get($settings,\"columns\");\n flex-basis: 100% * $i / map-get($settings,\"columns\");\n max-width: 100% * $i / map-get($settings,\"columns\");\n }\n $i: $i+1;\n }\n $i: 1;\n @while $i <= map-get($settings, \"columns\") {\n [str-row-vertical] [str-#{$key}='#{$i}'] {\n max-width: initial;\n max-height: 100% * $i / map-get($settings,\"columns\");\n }\n $i: $i+1;\n }\n}\n\n@mixin renderOffsets($key, $settings) {\n $i: 1;\n @while $i < map-get($settings, \"columns\") {\n [str-#{$key}-offset='#{$i}'] {\n margin-left: 100% * $i / map-get($settings,\"columns\");\n }\n $i: $i+1;\n }\n $i: 1;\n @while $i < map-get($settings, \"columns\") {\n [str-row-vertical] [str-#{$key}-offset='#{$i}'] {\n margin-left: intitial;\n margin-top: 100% * $i / map-get($settings,\"columns\");\n }\n $i: $i+1;\n }\n}\n\n@mixin renderOrder($key, $settings) {\n $i: 0;\n @while $i < map-get($settings, \"columns\") {\n [str-#{$key}-order='#{$i}'] {\n order: #{$i};\n }\n $i: $i+1;\n }\n}\n\n@mixin renderFlex($key, $settings) {\n $i: 0;\n @while $i < map-get($settings, \"columns\") {\n [str-#{$key}-flex='#{$i}'], [str-row-vertical] [str-#{$key}-flex='#{$i}'] {\n flex: #{$i};\n }\n $i: $i+1;\n }\n}\n\n@mixin media($queryString){\n @media #{$queryString} {\n @content;\n }\n}\n\n@include renderGridStyles($settings);" ]

{ "pile_set_name": "Github" }

[ 0.0007886565872468054 ]

[ "Mavic 2 Root Bounty Update\n\nMittwoch, 23. ", "Januar 2019\n\nFirst of all, Good News Everyone! ", "</OldFuturamaReference> The NLD bounty hunt has been progressing well over the last week since its launched generating around $1000 on top of the cash NLD first put in to start the pools up. ", "As previously talked about, this will be used to incentivize anyone out there with the skills necessary to contribute their hacks to NLD and overall to the drone hacking community.", "\n\nIt seems like we have our first fish on the line. ", "We have been contacted by a group of people working on the Mavic Pro 2. ", "As you will know from the bounty page over at NoLimitDronez.com/bounty we are running a bounty on the M2, specifically targeting root access on the M2 so that files in the operating system are modifiable without being rolled back to an older firmware. ", "Progress is being made here. ", "As you can see by the screenshot below, these guys have managed to get ADB shell access onto the filesystem.", "\n\nThis alone qualifies for the bounty pot. ", "We have also seen other evidence of how this hack is performed and are 100% sure of its legitimacy. ", "The only thing we don’t have yet is the underlying code for the technique so it’s not something we can implement into NLD until we have a copy of their secret sauce.", "\n\nWe are so happy that the bounty has already yielded some sort of results, but we need you to help push this over the line. ", "The team behind this exploit are waiting for the pool size to grow. ", "They’re confident their technique isn’t being looked at by anyone else and are therefore sitting on the code until the bounty pool grows further.", "\n\nEssentially, the faster donations come in, the faster they will give access to the code in order that we can add it into NLD as an exploitable bird. ", "Simple as that!", "\n\nSome of this may seem…selfish, but it really isn’t. ", "Think about it, If you were in the same position you’d do exactly the same! ", "Your payment will grow larger the longer you leave it as long as you take the little risk of someone else finding the same exploit. ", "Think of it this way, they could have gone to DJI, turned over their bug and ruined the party for everyone, but instead they came to NLD, triggered by the bounty programme and your generous donations.", "\n\nLets pick up the pace and see how fast we can get this bird added to NLD!" ]

{ "pile_set_name": "Pile-CC" }

[ 0.014188716188073158, 0.000648068031296134, 0.0006742705008946359, 0.0006124282372184098, 0.0009524326887913048, 0.0005404683179222047, 0.0005686807562597096, 0.0006322794361039996, 0.0006094277487136424, 0.0006232088780961931, 0.0007443597423844039, 0.0006512228865176439, 0.0005888828891329467, 0.0006065790657885373, 0.0006066015921533108, 0.0005931321065872908, 0.0011281343176960945, 0.0009454631945118308, 0.0008727529202587903, 0.0007563765975646675, 0.0011999831767752767, 0.0007993863546289504 ]

[ "This is a guest post kindly contributed by Noam Lifshitz. ", "Here is a pdf version. ", "This post is a continuation of the post To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer, and it gives the proof of the new hypercontractive inequality. ", "We plan a third post where various applications will be mentioned.", "\n\nBefore we get to the post I want to mention that there are a lot of activities on the web. ", "I may devote a special post to links and discussion (and contributing links in the comment section is very welcome.) ", "but meanwhile a few links: 1) Advances in Boolean Function Analysis Lecture Series (thanks to Avishay Tal and Prasad Raghavendra for letting me know); 2) Online course in Foundations of Algebraic Geometry Given by Ravi Vakil from Stanford. ", "You can take the course at varying levels of involvement. (", "Thanks to Tami Ziegler for telling me) A very very interesting way of online teaching. ", "3) A site with online mathematical lectures.", "\n\nAline Bonami with Szilard Revesz and me (2006). ", "Aline Bonami first proved the 2-point hypercontractive inequality which is very useful in the analysis of Boolean functions. (", "Leonard Gross proved it independently a few years later and William Beckner found important applications to harmonic analysis.)", "\n\nProof of the new hypercontractivity inequality\n\nOur aim is to prove the hypercontractivity theorem for global functions. ", "The proof here is taken from a joint paper with David Ellis and Guy Kindler that’ll soon be out on the Arxiv.", "\n\nTheorem 1:\n\nHere we use the notations given in the last blog post. ", "Let us first get a feel for our hypercontractivity theorem by proving the case. ", "Here the RHS is\n\n1. ", "Proof of the case\n\nWe will prove the following slightly stronger version of Theorem 1 for the case.", "\n\nProposition 2:\n\nLet Let Then\n\n\n\nProof: Let us write for Rearranging, we have\n\n\n\nThe noise operator in the case is by definition equal to where is the expectation over operator, and is the identity operator. ", "Hence,\n\n\n\nNow when expanding the 4-norm of the function , we obtain\n\n\n\n\n\n\n\n\n\nwhere we used the fact that the expectation of is 0. ", "When looking at the right hand side of the global hypercontractivity theorem, we see most of the above terms except for the one involving the third norm of the Laplacian. ", "Indeed we have\n\n\n\n\n\n\n\n\n\n\n\nHence we see that the only term in the left hand side that doesn’t appear with a greater coefficient in the left hand side is the term and by AM-GM we have\n\n\n\n\n\n\n\nwhich allows us to upper bound the only term appearing in the left hand side but not in the right hand side by corresponding terms that do appear in the right hand side.", "\n\n2. ", "Tensorisation lemma\n\nNext we are going to prove a theorem that doesn’t seem to fit to our setting, but we’re going to fit it in by force. ", "Let be finite sets. ", "Let us write for the linear space of complex valued functions on . ", "The space can be identified with the space where a pair of function is identified with the function\n\n\n\nin\n\nGiven two operators , the operator is the unique operator sending to . ", "We write for The operator can also be defined more explictly in terms of its values on functions. ", "The operator can be understood more explicitly by noting that it is the composition of the operators and Now the operator is given by where\n\nLemma 3: Let be measure spaces with finite underlying sets. ", "Let be operators satisfying\n\nfor all functions\n\nThen\n\nfor all\n\nHere the spaces and are equipped with the product measure, where the measure of an atom is the product of the measures of its coordiates.", "\n\nProof: For each let be given by As mentioned Hence by hypothesis, we have\n\n\n\n\n\nWe may now repeat the same process on each of the other coordinates to replace the s by s one by one.", "\n\n3. ", "The main idea: Fourifying the 2-norms.", "\n\nThe strategy of our proof is to take the theorem\n\nwhich we established in the case for , and to turn it into an essentially equivalent statement about 4-norms. ", "We will then get a tensorised statement for general , which we will be able to convert back into our hypercontractivity theorem for global functions. ", "Our idea is to encode our function as a function satisfying\n\nand\n\nThe benefit of working with rather than is that in one may move between 4-norms and 2-norms by appealing to the hypercontractivity theorem there, which gives\n\nat the cost of some noise.", "\n\nTo define we use Fourier analysis of Abelian groups. ", "Let us briefly recall it. ", "For simplicity let us assume that where is a prime. ", "Let be a th root of unity. ", "For any we have a character given by The are an orthonormal basis of and we write , where Note that is the constant function, and so we have\n\nwhich gives\n\nOur mission will first be to convert the -norm of a function to the norm of a different function.", "\n\nWe define an encoding operator by setting\n\nWe have\n\nas the are orthonormal and so are the Moreover, by the Fourier formula for Since -norms are always smaller than 4-norms on probability spaces, we’ve got the following corollary of Proposition 2.", "\n\nLemma 4. ", "For all and all we have\n\nWe now reach the final little trick. ", "We define a measure space whose underlying set is and where the measure is given by for and for We let be given by on and letting it be on This way Lemma 4 takes the form\n\n4. ", "Tensorised operators\n\nThe operator on satisfies where the latter refers to the noise operator on The characters satisfy and so we have the Fourier formula\n\nWe also have\n\nand so\n\nThis will allow us to conclude that\n\nWe will also encounter the operator which by abusing notation we also call encodes\n\nas the function on\n\nNow finally we can get to the understanding of the operator The space is the disjoint union of spaces of the form\n\nBy definition of the tensor product, for is the function\n\n5. ", "Finishing the proof\n\nProof: Lemmas 3 and 4 yield:\n\nfor any We now have\n\n\n\n\n\n\n\nThe first equality follows from the formula and the fact that commutes with the encoding. ", "The inequality used hypercontractivity on the discrete cube. ", "The last equality follows from the fact that the operator preserves 2-norms." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0007721713627688587, 0.0006149125401861966, 0.0008924768771976233, 0.0005410458543337882, 0.0005791017320007086, 0.0005283675855025649, 0.00061783567070961, 0.000536942039616406, 0.0006724873674102128, 0.0006967440131120384, 0.0007004440412856638, 0.001010082894936204, 0.0005885263090021908, 0.0007868216489441693, 0.0006320863030850887, 0.0005632754764519632, 0.0006202685763128102, 0.0010614566272124648, 0.0005693934508599341, 0.0008818720234557986, 0.0007813035044819117, 0.0006010187789797783, 0.0006648574490100145, 0.0011860732920467854, 0.0007049697451293468, 0.001113836420699954, 0.0006332524353638291, 0.0007494468009099364, 0.0006379553815349936, 0.0007502227672375739, 0.0009434628300368786, 0.0006754684145562351, 0.0011743707582354546, 0.0006396451499313116, 0.0006004945607855916, 0.0006298942607827485, 0.0008560955757275224, 0.000620654784142971, 0.0005459784297272563, 0.0007433213177137077, 0.0009541042381897569, 0.0008224364719353616, 0.000737468246370554, 0.0009720469824969769, 0.0014665555208921432, 0.000750442617572844, 0.0007768413051962852, 0.0006555132567882538, 0.0007532508461736143, 0.0006253169267438352 ]

[ "Beneficial HLA matching in centers using cyclosporine A.\nIn this chapter the linear model for the relationship between cumulative HLA mismatches and graft loss is shown to be invalid. ", "HLA-A and -B mismatches and HLA-DR mismatches appear to differ in potency. ", "A single mismatch at the HLA-DR locus is associated with a maximum risk of graft loss. ", "These findings permit a simple division of transplants into beneficially matched (000, 100, and 010) and nonbeneficially matched (all other 23 combinations). ", "In centers where more than two-thirds of patients were treated with CsA at three months, a similar dichotomy between beneficially and nonbeneficially matched transplants was observed, confirming the view that CsA-treated patients benefit from good HLA-A,B and DR matching. ", "Organ-sharing schemes are designed to realize the full potential of matching and their potential can be investigated by simulation studies. ", "These indicate that if all organs were unconditionally offered to a multicenter pool of more than 3,000 recipients, more than 60% of transplants could be beneficially matched." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0006362824933603406, 0.0008477857918478549, 0.0007350315572693944, 0.0006139304605312645, 0.0005962987197563052, 0.0005476423539221287, 0.000536348728928715 ]

[ "\n\nTwitter acquires Fluther - tonystubblebine\nhttp://techcrunch.com/2010/12/21/fluther-twitter/\n\n======\ntonystubblebine\nDo people agree with the TechCrunch analysis that there's going to be a\nTwitter QA site?", "\n\nI don't really see Twitter having separate sections, but it does seem natural\nthat questions in your stream could be handled better.", "\n\n" ]

{ "pile_set_name": "HackerNews" }

[ 0.0007566469139419496, 0.0005350515129975975, 0.001994825666770339 ]

[ "What is your take on my blog post here? ", "http://www.narutoforums.com/xfa-blog-entry/sjws-or-any-political-extremists-on-internet-forums-vs-obdrs-or-all-versus-debaters-in-existence.36559/#comment-238433\n\nI was looking for more of a constructive dialogue about you thought about the interpretations, arguments, etc, and for you to bring up your own opinions. ", "More than an just an Informative rating in any case lol\n\nragaz ► TTGL can i request a calc?", "\nToday at 4:45 AM•••\nragaz\nragaz ► Endless Mike can i request a calculation here?", "\nToday at 4:34 AM•••\nragaz\nragaz ► ChaosTheory123 can i request a calculation? ", "seems like ure into those things\nToday at 4:19 AM\n\nWould have liked another post that was \"can calc?\" ", "and then finally \"calc?\"", "\n\nI'm still trying to work on the pm... but the thing is in Taiwan, I'm always going out to do an activity and whenever I get back to my grandma's here, I'm always busy updating what I did each day on my trip and watching a movie.", "\n\nGiven that There are three segments of reality which are each infinite in number and extent, at least megaversal. ", "The other Amaranths could put it even higher, though I need to look more into the meta-lore." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0008104549488052726, 0.0006377137033268809, 0.0007685909513384104, 0.0007705167517997324, 0.0008221747702918947, 0.000683069636579603, 0.0008623698959127069, 0.0006525605567730963, 0.0007847590604797006, 0.0006203282973729074 ]

[ "List of million-plus urban agglomerations in India\n\nIndia is a country in South Asia. ", "It is the seventh-largest country by geographical area, the second-most populous country with over 1.2 billion people. ", "India consists of twenty-eight states and nine union territories. ", "It is a home to 17.5 percent of the world's population.", "\n\nThe first population census in British India was conducted in 1872. ", "Since 1951, a census has been carried out every 10 years. ", "The census in India is carried out by the Office of the Registrar General and Census Commissioner under the Ministry of Home Affairs, and is one of the largest administrative tasks conducted by a federal government.", "\n\nThe latest population figures are based on data from the 2011 census of India. ", "India has 641,000 inhabited villages and 72.2 percent of the total population reside in these rural areas. ", "Of them 145,000 villages have population size of 500–999 persons; 130,000 villages have population size of 1000–1999 and 128,000 villages have population size of 200–499. ", "There are 3,961 villages that have a population of 10,000 persons or more. ", "India's 27.8 percent urban population lives in more than 5,100 towns and over 380 urban agglomerations. ", "In the decade of 1991–2001, migration to major cities caused rapid increase in urban population. ", "The number of Indians living in urban areas has grown by 31.2% between 1991 and 2001. ", "Yet, in 2001, over 70% lived in rural areas. ", "According to the 2011 census, there were 46 million-plus cities in India, with Mumbai, Delhi and Kolkata having populations over 10 million.", "\n\nThere are 53 urban agglomerations in India with a population of 1 million or more as of 2011 against 35 in 2001. ", "About 43 percent of the urban population of India lives in these cities. ", "Kerala has added six new million-plus agglomerations in addition to Kochi, the only such area in 2001.", "\n\nGallery\n\nList\nThe cities which are listed in bold are the capital of the respective state / union territory.", "\n\nSee also\n List of cities in India by population\n List of most populous metropolitan areas in India\n List of states and union territories of India by population\n Demographics of India\n\nNotes\n\nReferences\n\nFurther reading\n\nExternal links\n Office of the Registrar General & Census Commissioner, India\n\nCategory:Lists of cities in India\nCategory:Urbanization in India" ]

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

[ 0.0006953132688067853, 0.0006947257788851857, 0.0006687329732812941, 0.0010879215551540256, 0.0006044713663868606, 0.0005827414570376277, 0.0006071603274904191, 0.0006237443303689361, 0.0006798577960580587, 0.0008654958801344037, 0.0008180252625606954, 0.0012480536242946982, 0.0005785244284197688, 0.000717482587788254, 0.0006165492231957614, 0.0005632478278130293, 0.0007431742851622403, 0.0006909775547683239, 0.0007000500336289406, 0.0006124919163994491, 0.0006165321683511138 ]

[ "Q:\n\nHow to change the scrollbar color using css\n\nMy jsfiddle is here\nI trying to change the color of the scrollbar but here it is not working.", "\nCss:\n.flexcroll { \n scrollbar-face-color: #367CD2;\n scrollbar-shadow-color: #FFFFFF;\n scrollbar-highlight-color: #FFFFFF;\n scrollbar-3dlight-color: #FFFFFF;\n scrollbar-darkshadow-color: #FFFFFF;\n scrollbar-track-color: #FFFFFF;\n scrollbar-arrow-color: #FFFFFF;\n}​\n\nA:\n\nYou can use the following attributes for webkit, which reach into the shadow DOM:\n::-webkit-scrollbar { /* 1 */ }\n::-webkit-scrollbar-button { /* 2 */ }\n::-webkit-scrollbar-track { /* 3 */ }\n::-webkit-scrollbar-track-piece { /* 4 */ }\n::-webkit-scrollbar-thumb { /* 5 */ }\n::-webkit-scrollbar-corner { /* 6 */ }\n::-webkit-resizer { /* 7 */ }\n\nHere's a working fiddle with a red scrollbar, based on code from this page explaining the issues.", "\nhttp://jsfiddle.net/hmartiro/Xck2A/1/\nUsing this and your solution, you can handle all browsers except Firefox, which at this point I think still requires a javascript solution.", "\n\nA:\n\nYour css will only work in IE browser. ", "And the css suggessted by hayk.mart will olny work in webkit browsers. ", "And by using different css hacks you can't style your browsers scroll bars with a same result.", "\nSo, it is better to use a jQuery/Javascript plugin to achieve a cross browser solution with a same result.", "\nSolution:\nBy Using jScrollPane a jQuery plugin, you can achieve a cross browser solution \nSee This Demo\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0007804767810739577, 0.001375196734443307, 0.0007520244107581675, 0.0010351079981774092, 0.05461597815155983, 0.001058195368386805, 0.0006248304853215814, 0.0007774915429763496 ]

[ "[Studies on standard growth curve chart on body weight of adolescent Chinese for orthodontic diagnosis].", "\nTo establish the first new annual increase and growth curve charts on the body weight of Chinese children. ", "Data were surveyed in 1995, which were obtained from subjects consisting of 32524 students aged from 7 to 19 years in Sichuan province. ", "Mean values of the annual increment of body weight, sex and area difference were analyzed. ", "The new standard growth curve chart on the body weight is very useful for orthodontic diagnosis, treatment and prognosis." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005804193788208067, 0.0012667569098994136, 0.0005869586602784693, 0.000728847342543304, 0.0005771387950517237 ]

[ "Q:\n\nLoad all css as a single http request and minified form?", "\n\nI need to compress my css files and presently it takes lot of time for loading and i also got multiple http request warning.", "\nSo i found this on code.google.com \nCode.google.com example program link\naccording to them,i need to specify all css links in a php file instead of my html and call that php once in html.", "So the http request issue will get solved and that code from google compress the css file also.", "\nInstead of\n\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/main.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/menu.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/blog.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/box.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/form.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/profile.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/page.css\" />\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/gallery.css\" />\n\nYour write\n\nlink rel=\"stylesheet\" type=\"text/css\" href=\"/css/css_include.php\" />\n\nThis is the php code format\n<?", "php\n\nfunction compress($buffer) \n{\n $buffer = preg_replace('!/\\*[^*]*\\*+([^/][^*]*\\*+)*/!', '', ", "$buffer);\n\n $buffer = str_replace(array(\"\\r\\n\", \"\\r\", \"\\n\", \"\\t\", ' ', ' ', ' '), '', $buffer);\n\n return $buffer;\n}\n\n$handle = opendir(\".\");", "\n\nheader ('Content-type: text/css');\nheader (\"Cache-control: public\");\nheader (\"Vary: Accept-Encoding\");\nheader (\"Content-Encoding: gzip\");\n\nob_start(\"ob_gzhandler\");\n\nwhile (false !", "= ($file = readdir($handle))) \n{\n if (strpos($file,\".css\") !", "== FALSE)\n {\n echo compress (file_get_contents($file));\n }\n}\n\n?", ">\n\nBut My question is how can i add files in that php ???", "I mean where should i add the css paths in this php?", "\n\nA:\n\n$handle = opendir(\".\"); ", "will read all files in the current directory. ", "So just change that to wherever your css files are i.e. opendir(\"/var/www/css\")\nOr place the php file in your css directory\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0009822661522775888, 0.0008602397865615785, 0.0006372224888764322, 0.0006086334469728172, 0.0007861531339585781, 0.0017466197023168206, 0.0023472479078918695, 0.0013171522878110409, 0.001298604067414999, 0.0009326062281616032, 0.0009028211934491992, 0.0006439635762944818, 0.0007488945848308504, 0.0006525885546579957, 0.000733247899916023 ]

[ "The feeling of ”Leave me alone. ", "I know what I’m doing.”", "\n\nThis typically Finnish attitude was made famous by the Iceman himself, Formula 1 driver Kimi Räikkönen. ", "We feel he quite nicely sums it all up." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.00891654472798109, 0.0008808902348391712, 0.0007340438896790147, 0.0005349238053895533 ]

[ "Wednesday, December 19, 2012\n\nSince the news last week of the shooting in CT, I've been skimming over the grief. ", "A good friend of mine stated, that it wasn't possible for her to look at the photo of the 20 children and 6 adults that lost their lives. ", "I can't either, as least I can't if I stay in this space of skimming.", "\n\nThe extent of this loss and violence makes me feel as if I might drown in it.", "\n\nI don't want to really see it.", "\n\nI'm fearful that it will pierce my heart in an inconsolable way.", "\n\nAnd then I'm only looking at this loss from arms length.", "\n\nI did not know any of these people personally, however this kind of loss cuts all of us to the quick.", "\n\nChildren and adults that were full of life, hope and promise; were taken away.", "\n\nThis kind of tragedy just shouldn't happen.", "\n\nMy dear friend Becky send me this Psalm this week to be a help to me. ", "She gave it to me as a reminder of how God in the way that only God can - work in the midst of tragedy, call others to help the hurting and ultimately hold on to hope.", "\n\nEarlier today, I was able to (with the help of my church's knitting ministry) give 4 prayer shawls to a friend who works in the area of Disaster Services. ", "Her agency is collecting prayer shawls to be given to the families and first responders who assisted those impacted by the tragedy in Newton, CT. ", "first hand.", "\n\nBit by bit, I begin to see how small steps like reading the following text from Isaiah 35 and getting prayer shawls to the people who need them are ways of working past skimming over grief into walking through it - to a place of help and hope.", "\n\nMay these words give you hope for whatever wild times you are living in and my the God of perfect peace give you strength.", "\n\nGrace and Peace,\n\nT\n\nIsaiah 35\n\nThe wilderness and the wasteland shall be glad for them,\n\nAnd the desert shall rejoice and blossom as the rose;\n\n2 It shall blossom abundantly and rejoice,Even with joy and singing.", "The glory of Lebanon shall be given to it,The excellence of Carmel and Sharon.", "They shall see the glory of the Lord,The excellency of our God.", "\n\n3 Strengthen the weak hands,And make firm the feeble knees.4 Say to those who are fearful-hearted,“Be strong, do not fear!Behold, your God will come with vengeance,With the recompense of God;He will come and save you.”", "\n\n5 Then the eyes of the blind shall be opened,And the ears of the deaf shall be unstopped.6 Then the lame shall leap like a deer,And the tongue of the dumb sing.", "For waters shall burst forth in the wilderness,And streams in the desert.7 The parched ground shall become a pool,And the thirsty land springs of water;In the habitation of jackals, where each lay,There shall be grass with reeds and rushes.", "\n\n8 A highway shall be there, and a road,And it shall be called the Highway of Holiness.", "The unclean shall not pass over it,But it shall be for others.", "Whoever walks the road, although a fool,Shall not go astray.9 No lion shall be there,Nor shall any ravenous beast go up on it;It shall not be found there.", "But the redeemed shall walk there,10 And the ransomed of the Lord shall return,And come to Zion with singing,With everlasting joy on their heads.", "They shall obtain joy and gladness,\n\nTuesday, December 18, 2012\n\nPhotos have an amazing way\nof bringing back old memories don’t they? ", "No matter if you collect them in Albums,\nScrapbooks, Facebook or Instagram – photo sharing is an important way of\ntelling your families stories in a concrete way. ", "You can point to and talk\nabout who is in the picture, what they were doing and why that moment in time\nis still important to you today. ", "Photos tell us not only what we were doing\nthen, but what group or community was important as well. ", "When my family was\nyoung, each summer we would take a photo at the photo booth at Midway Park.", "\nOver the years, we collected these strips of photos, and my husband created a\ncollage. ", "This collage (above) is one of my most cherished possessions. ", "It\nreminds me of those early days, reminds me of how small my own children once\nwere and continues to give me hope for the future. ", "Pictures that we take at\nchurch have to same power to help us remember who we are and carry hope into\nthe future days to come.", "\n\nThe Advent season was a time for many\npictures of hope at First Lutheran Church. ", "From Blanket Builds, Christmas\nParades, Community Christmas Party, Bell ringing with SLYM youth and parents,\nvisitation at Lutheran, 42 boxes filled and sent overseas with Operation\nChristmas Child ,Advent Supper, Families reading weekly Advent prayers, Lucia\nFestival’s 60th Anniversary, Choir and Sacred Fire sharing music\neach week in worship, Children’s Advocacy Training with 18 caring adults\nworking to promote greater safety for children in our community, and Sunday\nSchool Staff, parents, guardians, teens and children working together as a team\nof 50 people shared this year’s “Sheep Tweets and Camel Tales” Sunday School\nprogram. ", "All these moments were times where the hope of God’s message was\nshared richly.", "\n\nWhat is the message that God is sharing\nin and through First Lutheran Church? ", "I believe the message God is sending is: “I\nknow you, I love you.” ", "I know you and I love you, means that God know our\nweaknesses and strengths, our needs and dreams, and gave Jesus, “Not to condemn\nthe world but to save the world through him,” (John 3:17)\n\nIt is almost a new year, a time where we all\nbegin again. ", "As we think of the year just past, let’s hold on to hope of Jesus;\nand take a step into many new opportunities to share God’s message. ", "From youth\nto families, college and career, mid-life and seniors – God sends his message\nand asks us to share it with hope in our hearts.", "\n\nFriday, November 02, 2012\n\nThe lyrics of the song, \"Please release me, let me go..\" (thank you Tom Jones) have been bouncing around my mind all week. ", "I've been pondering on the practical and spiritual meaning of the story of Lazarus and what it means to be \"untied\" from things that bind or hold people back.", "\n\nLater this weekend, I will be sharing a children's message based on the reading in John 11, concerning the death of Lazarus. ", "I know the story and I'm pretty sure that we shared it with the kids at VBS a few years ago, but I'd like to be careful in how it's presented. ", "This Sunday is All Saints Sunday, it was just Halloween - and as much as I like the fun of Halloween, I don't want the account of Lazarus and Jesus to sound like another spooky story.", "\n\nThe more I read this account, the more I'm struck on how Jesus walks into a situation of grief, experiences that grief, and takes action to release his friends and himself from it. ", "The words that I keep getting stuck on are as follows, \" Take of the grave clothes and let him go.\"", "\n\nLazarus had died, true. ", "Jesus raises him, true. ", "But when it comes to being freed to take his first Resurrected steps, Jesus asks Lazarus' friends and family to help.", "\n\n\"Take off the grave clothes and let him go.\"", "\n\nShortly after this account, the timeline on Jesus own arrest, crucifixion and Resurrection speed up. ", "In fact, it seems that some of the expediency of his own death comes as a result of his actions to assist Lazarus and his family. ", "Stunning, isn't it? ", "While Lazarus' resurrection was not eternal, like Jesus. ", "The act of resurrection was something that caused so much upset, that Jesus was targeted for execution.", "\n\nAll this talk of death, does not make for an easy children's message, but here in lies a theme that will be suitable to their, and their parents ears...\n\nJesus wants to set us free from the things that tie us up, in this life and beyond. ", "Just as Jesus set Lazarus free from death and his family free from grief; he invited them to help in at action of \"letting go\" and moving into a new or resurrected way of living - now!", "\n\n\"Take off the grave clothes and let _____ go.\"", "\n\nI suppose it could be said, that we all wear \"grave clothes\" of one sort or another. ", "Instead of looking at life a opportunity, we can always think of the limitations. ", "The negative can often overshadow the positive. ", "However, in this lesson, Jesus overcomes all that, and then asks people to help remove the grave clothes and \"let him go\".", "\n\nIn the simple act of asking for people's help; maybe Jesus assigns some resurrection responsibility to us? ", "Could it be, that people have the ability, with God's help, to remove some grave clothes (limitations, negativity, apathy) and help to free others to live a new life that is full of opportunity, positivism and care?", "\n\nPutting it simply, what things make you and those you care about feel \"tied up\"? ", "How might Jesus be asking us to help try on some new clothes and be freed up to live?", "\n\nJesus took a great deal of risk in reaching out to resurrect Lazarus and invite others into living new lives. ", "I think that risk, along with the repercussions that came afterward for him are a reminder of God's great love for people, and a reminder to work together for freedom and life.", "\n\nSo, in response to this message, I say to myself just as I share it with others:\n\nPut on some new duds. ", "Let go. ", "Live. - ", "and help others to do the same.", "\n\n\"Take off the grave clothes and let ________ go.\"", "\n\nJOHN 11:41 So they took away the stone. ", "Then Jesus looked up(AS) and said, “Father,(AT) I thank you that you have heard me.42 I knew that you always hear me, but I said this for the benefit of the people standing here,(AU) that they may believe that you sent me.", "”(AV)\n\n43 When he had said this, Jesus called in a loud voice, “Lazarus, come out!”(AW)44 The dead man came out, his hands and feet wrapped with strips of linen,(AX) and a cloth around his face.(AY)\n\nChop all veggies and toss in large saute pan with olive oil and all spices.", "\nSimmer till all veggies are tender. ", "You may want to add the tougher veggies first (Carrots, Kohlrabi, Beets and Onions) and the more tender veggies later.) ", "Before you serve, mash the stew a little to desired consistency. ", "Serve over rice, quinoa, or with good bread.", "\n\nI add an additional dash of cinnamon toward the end of the cooking process for an extra dose of taste. ", "If you like, add a little fresh mozzarella to the top of the dish for contrast with the sweet spicy flavor.", "\n\nMy Facebook friend Gary posted this link earlier today and I can't help but re-share it here. ", "While many on the East coast stand up to oncoming hurricane weather, first responders have been preparing and those inland watch pray-fully from hundreds of miles away. ", "We all are keeping friends closer to the storm close in thoughts and prayers. ", "We all want to help in some way. ", "At the least, or some might say most, we can all pray, support and work together to bring all people to safety in this stormy time.", "\n\n\"God of the Universe, at the dawn of creation, your Spirit breathed on the waters, making them the wellspring of all holiness. ", "You created the oceans and rivers, and all that dwell within them, and at your word the wind and the waves were born. ", "The seasons follow your plan, and the tides rise and fall on your command. ", "In both calm and storm, you are with us.", "\n\nOn the Sea of Galilee, even when the disciples began to fear, Jesus showed that he was Lord over the waters by rebuking the storms, so that all would know that even the wind and the waves obey him.", "\n\nCreator God, we ask you to calm the wind and the waves of the approaching hurricane, and spare those in its path from harm. ", "Help those who are in its way to reach safety. ", "Open our hearts in generosity to all who need help in the coming days. ", "In all things and in all times, help us to remember that even when life seems dark and stormy, you are in the boat with us, guiding us to safety. ", "Amen.\" (", "This link found at the Huffington Post.)", "\n\nFriday, October 26, 2012\n\nA little over two years ago, our family friend Pat passed away due to complications in heart surgery. ", "Every Halloween I am especially tuned into memories of Pat and his amazing, creative and artistic skills. ", "Take a few minutes to visit his website and learn a little more about the creator of \"Grumpkins\".", "\n\nHowever, do not mistake anger as hatred. ", "Anger is a secondary emotion that can come from a place of frustration, concern or deep care for people. ", "It is an emotional vehicle that is misused all too often, but can also be rooted in love and be a means of defeating injustice and hatred.", "Anger is a secondary emotion. ", "It is important to seek the root of it - ugly or beautiful; if you are going to move towards any resolution or peace.", "It is important to learn ways - healthy ways - for everyone to deal with anger. ", "It's an emotion that we all experience from time to time. ", "So instead of being the \"elephant\" in the room of relationships, lets give anger a chance to count to 10 and take a step toward restoration.", "For some hints on how to deal with anger, go to: Anger Control tips.", "Grace and peace, T\n\nWednesday, October 17, 2012\n\nThis Sunday at 1pm, Abbi Rajasekhar will be playing a live music set at First Lutheran Church in Jamestown NY. ", "This concert does not have a standard door fee, however please bring a dish of food to share (as we all will share a meal together), a non-perishable food item to donate to Joint Neighborhood Project and a little cash to help Abbi put gas in her tank for this leg of her Fall Tour.", "\n\nTake a moment. ", "Watch and listen. ", "Your ears - and heart are about to get a treat you'll want to experience again - this Sunday, @ First Lutheran Church Parlors, 1PM.", "\n\nThursday, October 11, 2012\n\nI found this quote on a board in the dorm I'm staying in this weekend - who would have thought\n\nthat Joan Chittister would meet me here and greet me, just when I needed it the most.", "\n\nSt. Benedict's is a Benedictine Monastery that I visit regularly and it just so happens to be her home community. ", "Coincidence - I think not. :) ", "Here is a short video clip to see what kind of ministry these amazing ladies are active in every day...\n\nBread to take with me...\n\nThis week I'm in Dubuque, Iowa at Wartburg Theological Seminary for a weekend of intensive study in the area of Lutheran Worship. ", "The work week has already been very full after a fun overnight with the Shared Lutheran Confirmation Youth on retreat, planning for an upcoming Youth Sunday, and getting ready to hit the road, and air today at 4am to head west to Wartburg. ", "This bread may not be well thought out, but these things are the ones I take with me for the adventure ahead - I hope this \"quick bread\" is a blessing to you as well.", "\n\nThere have been many references back to last weeks' bread to \"Keep, toss and donate\" since last week's\n\nSleeping with Bread. ", "I've had a few opportunities to share it as a devotional prompt and have been thankful that it has resonated with some folks. ", "That in itself has been some good bread for me.", "\n\nWhat I've continued to leave behind is the nagging feeling of not quite making the cut in some academic terms. ", "No one has told me this, except the gremlin in the back of my brain. ", "But that nagging has held me somewhat captive in taking steps to write, read, and move forward on some school assignments this week. ", "I know I need to press on, and will - but naming this gremlin just might be helpful in requesting it's quick exit.", "\n\nThere are some other amazing encouraging people out there: folks from Cohort B and C from the Princeton Seminary Youth Ministry Certificate Program. ", "This group of folks have been and continue to be bread in my life in so many ways. ", "My family has been fantastic. ", "They have worked out work schedules, made meals, bought laundry soap and put up with my occasional grumpiness about what \"Needs to be done!\" ", "Oh my, what a drama queen going back to school can make me at times. ", "They are good at keeping the \"queendom\" rolling along.", "\n\nFor the last few weeks, a small group of folks have been meeting at lunch time once a week for conversation, scripture reading and discussion of moments where we take notice of God's presence and work in our lives and the lives of others. ", "This sharing - especially the time of prayer has been uplifting to my heart.", "\n\nWhat bread are you carrying with you this week? ", "Can you pack it into a carry-on easily? ", "Is it giving you life?", "\n\nSaturday, October 06, 2012\n\nPastor Cartwright's wife's name was Winnie. ", "At least that is what I think her name was. ", "No she wasn't \"Winne the Pooh\", but she was very friendly and kind. ", "She had gray fluffy hair, a kind face, and a easy going way about her. ", "All these characteristics were reasons I probably wasn't afraid to tell her about the dream I'd had.", "\n\nI was no more than 5 years old and I was sitting in her Kindergarten Sunday school classroom. ", "There was I picture on the wall of Jesus and a multicultural group of children crowding around him. ", "I really liked that picture.", "\n\nAt some point, I'd had a dream about Jesus when I was in her class. ", "In the dream, I was one of the children in the crowd huddled around him. ", "In fact, at one point of the dream I was sitting on Jesus lap having a nice chat with him - probably about how much I loved my red patent leather Buster-brown dress shoes.", "\n\nNo matter what I actually talked to Jesus about in my dream, I was so excited to have been \"choosen\" to be so close to him.", "\n\nI couldn't wait to tell Winnie.", "\n\nWe all said our hellos and got started talking about the lesson that day, but upon seeing the picture in that classroom I could wait no longer.", "\n\n\"Miss Winny, can I tell you about a dream I had? ", "It's about Jesus!\"", "\n\nShe smiled. ", "She listened.", "\nShe did not chide me for wanting to be the child in the center of Jesus' attention.", "\nShe included the rest of the class in the discussion.", "\nShe affirmed me that it was a wonderful dream and brought this dream into the light of day.", "\nWe all talked about how it would be amazing to meet Jesus face to face.", "\nWhat would we say to him?", "\nWho would we tell about meeting him?", "\nWhat do we think he would say to us?", "\n\nIn our discussion, we read Mark 10:13-16 and knew what Jesus would do.", "\nJesus would bless the little children, take time with the little children and love the little children.", "\n\nJust like Miss Winne did.", "\nThanks Winnie.", "\nYou always let us know that God has plenty of space for \" All the little children of the world.\"", "\n-------------------------------------------------------------------------------------------------------People were bringing little children to Jesus to have him touch them, but the disciples rebuked them. ", "When Jesus saw this, he was indignant. ", "He said to them, \"Let the little children come to me, and do not hinder them, for the kingdom of God belongs to such as these. ", "I tell you the truth, anyone who will not receive the kingdom of God like a little child will never enter it.\" ", "And he took the children in his arms, put his hands on them and blessed them. ", "Mark 10:13-16 (NIV)\n\nMonday, October 01, 2012\n\nThere is a distinct difference in what I actually need and what I want. ", "And if I'm honest, I know that all the seeking after the 'wants' can prevent me from digging into the needs I actually have.", "The last week has been a whirlwind of want/needs. ", "When I pause to look at what I'm most grateful and least grateful for - I'm pointed to the spaces of need and the thin residue of want that often gets in the way.", "So, if you will bear with me - I'm going to do some thoughtful sorting this week in SWB. ", "It may be a process that will take more than this one post. ", "But the sorting has to start somewhere, right?-------------------------------------------------------------------------------------------If you have ever watched those remodeling shows on TLC - you'll recall the keep, throw away, and donate piles that are necessary to come to a place of elbow room and change to whatever space is being reworked. ", "If I were to remodel my interior life - what would I keep, throw or donate?This metaphor has a great deal of possibility - so here's whats in my pile of \"What to keep\" for this week:Patience with self and others: Transition has been a key word for me this fall. ", "Seminary classes have started, re-working programs and work related roles is an ongoing process, and coming to terms with this is challenging. ", "In this transition, some things have come to the surface that are needed more than ever. ", "Thoughtful and life giving conversations: My husband, Ian, and I love to have deep conversations. ", "We like to dream, to ponder, and puzzle with each other over so many things. ", "It's been especially helpful for me to talk out some school-work questions, dream some vocational dreams and have his support and partnership in this process. ", "This kind of conversation with Ian, makes me desire greater depth with my interactions with others as well. ", "This week at work, there was a great deal of this activity as Paul Sparks from the Parish Collective came to discuss mission and 'weaving a fabric of love and care in our community.\" ", "Over lunch, over dinner and walking around Jamestown - this quality conversation happened all week long with many members of the community. ", "Openness: Over another meal with friends this weekend, a woman came up to our table and asked us - \"Are you all on a team together?\" ", "The friends gathered were a mix of family, new acquaintances, old friends and mission workers. ", "We all attend different churches, but the one thing we all have in common is our faith in God. ", "So, we responded, \"We are all friends, but I suppose you could say we are on God's team.\" ", "The woman's eyes filled with tears and she said, \" I want to be on God's team - I NEED GOD!\"Her honesty took me off guard, my friend got up and embraced her. ", "We listened to her profess her needs. ", "By the end of the meal, she had a glimmer of hope in her eyes. ", "The next day, my friend took her to church with her and got her connected with a supportive faith community. ", "This account may seem unreal, but it was very real. ", "Thankfully, the group of friends assembled were open enough to welcome this unpredicted conversation. ", "What if this sense of openness invaded everyday life? ", "What kinds of unexpected \"Bread\" would be born into the common?--------------------------------------------------------------\"What to donate\"The \"what to donate\" is becoming a little clearer. ", "What that revolves around is discerning what to say yes or no to, but also involves bringing some more partners in holy mischief alongside to help with what is to be. ", "There are some cool things I have on hand, but they might be better used if I placed ownership in others hands. ", "More to come on this.------------------------------------------\n\n\"What to toss\"\n\nIf I sort carefully, the 'what to toss' comes down to a central theme: self-imposed limitations that are kept in place by fear.", "\n\nI came across this quote earlier this week: \"The key to change is to let go of fear.\" ", "Rosanne Cash\n\nThere seems to be so much change that needs to come about. ", "Sometimes I get in a hurry and other times I bog progress down by living into fear instead of living into the promise of hope. ", "I need to uncurl my clenched fists to allow access to that key of change or ask God to help me become free of fear.", "\n\n------------------------------------------\n\nAll the things I desire to hold on to are a part of that unclenching process: patience, caring conversations and openness.", "\n\nIt's been a while since \"Sleeping with Bread\" was a regular practice for me. ", "A while back, there was a sweet little community of bloggers that would share in this Monday practice but over time, pressing schedules, and life's movements - it was a practice that sort of fell away.", "\n\nOne of our community posted this to his blog a while back to explain more of what Sleeping with Bread is -\n\nDuring the bombing raids of WWII, thousands of children were orphaned and left to starve. ", "The fortunate ones were rescued and placed in refugee camps where they received food and good care. ", "But many of these children who had lost so much could not sleep at night. ", "They feared waking up to find themselves once again homeless and without food. ", "Nothing seemed to reassure them. ", "Finally, someone hit upon the idea of giving each child a piece of bread to hold at bedtime. ", "Holding their bread, these children could finally sleep in peace. ", "All through the night the bread reminded them, “Today I ate and I will eat again tomorrow.”", "\n\nLinn, Dennis et. ", "al, Sleeping with Bread\n\nSleeping with Bread is a Monday meme. ", "You can participate in one of two ways: 1) Pick one of the above examen question sets and answer it in the comments section of my SWB post; or, 2) Create your own Sleeping with Bread post. ", "You can also phrase the question in any of the following ways:For what am I most grateful? ", "Least grateful?When did I give and receive the most love? ", "The least love?When did I feel most alive? ", "Most drained of life?When did I have the greatest sense of belonging? ", "Least sense of belonging?When was I most free? ", "Least free?When was I most creative? ", "Least creative?When did I feel most connected? ", "Least connected?When did I feel most fully myself? ", "Least myself?When did I feel most whole? ", "Most fragmented?", "\n\nFor simplicity's sake, I will kick things off in a separate post above with the first question listed (most grateful/least grateful). ", "If you would like to join in, please do so by responding in the comments at this weeks \"Sleeping with Bread\".", "\n\nFacebook Badge\n\nAbout Me\n\nThings I wish I had said...\n\n\"I am not afraid, I was born to do this. ", "Joan of Arc\n\n\"Everything that is done in the world is done by hope.\" - ", "M. Luther\n\nCall on God, but row away from the rocks. - ", "Indian Proverb\n\nIf it can be verified, we don't need faith... Faith is for that which lies on the other side of reason. ", "Faith is what makes life bearable, with all its tragedies and ambiguities and sudden, startling joys. - ", "Madeline L'Engle" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006556978914886713, 0.0007280295831151307, 0.0008430341840721667, 0.02920796163380146, 0.0007672957144677639, 0.0014830479631200433, 0.0008569712517783046, 0.0006991262780502439, 0.0007562518585473299, 0.0014176118420436978, 0.0006506660720333457, 0.0007737771375104785, 0.0006282518152147532, 0.0006266366108320653, 0.0008263469790108502, 0.0007050000131130219, 0.0006945692002773285, 0.000971808098256588, 0.0004979538498446345, 0.0006396658718585968, 0.1409052461385727, 0.7319207191467285, 0.0010748381027951837, 0.0007320906152017415, 0.0009228002745658159, 0.11159206926822662, 0.009088339284062386, 0.000655788229778409, 0.0006943203625269234, 0.0005374881438910961, 0.0005324822850525379, 0.0005868599400855601, 0.0005514370277523994, 0.0006384541047737002, 0.0007925507961772382, 0.0006951234536245465, 0.0005971188074909151, 0.0007943844539113343, 0.0007115944172255695, 0.000777286768425256, 0.000685609586071223, 0.0011406884295865893, 0.0006393047515302896, 0.0005846245912835002, 0.0006502721807919443, 0.0005607129423879087, 0.000639180769212544, 0.0005256404401734471, 0.0016269797924906015, 0.0007149724406190217, 0.0067429132759571075, 0.006624097470194101, 0.001781183760613203, 0.0007553498144261539, 0.050348877906799316, 0.0027368718292564154, 0.0011799836065620184, 0.0006715193740092218, 0.0011997735127806664, 0.004752021282911301, 0.01000484824180603, 0.0037107171956449747, 0.048610955476760864, 0.0010816941503435373, 0.0006064013577997684, 0.0007447028183378279, 0.0016535918693989515, 0.0007762034656479955, 0.0023632352240383625, 0.0010756959673017263, 0.005436574574559927, 0.0008915917132981122, 0.0007157653453759849, 0.02655474655330181, 0.05810223147273064, 0.0007980387890711427, 0.0006264604162424803, 0.04770875349640846, 0.0012693105963990092, 0.0008105244487524033, 0.08151023834943771, 0.5197654962539673, 0.021941857412457466, 0.0006051919772289693, 0.0007421328919008374, 0.0005275752046145499, 0.0006237971829250455, 0.0006228084093891084, 0.0007380584720522165, 0.0005870067980140448, 0.0005552147631533444, 0.0006320682587102056, 0.0010097402846440673, 0.000916439457796514, 0.0010761941084638238, 0.0012992474948987365, 0.0007381312898360193, 0.0015104056801646948, 0.0006680586957372725, 0.0005816053017042577, 0.0007130301091820002, 0.0007802782347425818, 0.0005754236481152475, 0.0006796495290473104, 0.0005559418350458145, 0.0009196803439408541, 0.003699362277984619, 0.0034469689708203077, 0.001754592638462782, 0.012293853797018528, 0.0007360865129157901, 0.004920413251966238, 0.0005828852881677449, 0.002213797066360712, 0.0009035324910655618, 0.000632988172583282, 0.0007638383540324867, 0.0009407238103449345, 0.0019593178294599056, 0.005341692361980677, 0.0006544181378558278, 0.0006231388542801142, 0.0006581505294889212, 0.0006353986100293696, 0.0006632180302403867, 0.0005220675375312567, 0.0012767512816935778, 0.0005034759524278343, 0.0006357187521643937, 0.003989126067608595, 0.01038636825978756, 0.00224233977496624, 0.000957537442445755, 0.0005220916937105358, 0.0006993382121436298, 0.0005580715369433165, 0.0013367101782932878, 0.007130189798772335, 0.0008973744115792215, 0.0005437111249193549, 0.0005359922652132809, 0.0009772726334631443, 0.000911626557353884, 0.024594800546765327, 0.000645322899799794, 0.0006910242955200374, 0.004276002757251263, 0.0013486819807440042, 0.0006460315198637545, 0.004604645539075136, 0.0014515372458845377, 0.0005788371781818569, 0.000751510844565928, 0.0007518703932873905, 0.001696595922112465, 0.0009490257943980396, 0.0010729898931458592, 0.0005462582339532673, 0.001004426390863955, 0.001656474662013352, 0.0007707123877480626, 0.000696299655828625, 0.007674832362681627, 0.0007687481120228767, 0.0005461275577545166, 0.0015232313890010118, 0.0007964555406942964, 0.0008048199815675616, 0.0006789457402192056, 0.0007056398899294436, 0.0012825068552047014, 0.0017013540491461754, 0.0005740977358072996, 0.008066331967711449, 0.011380089446902275, 0.0014948295429348946, 0.009361141361296177, 0.006784448400139809, 0.0019719800911843777, 0.0006289005978032947, 0.0007035378366708755, 0.0013025370426476002, 0.0005902874399907887, 0.0008529545739293098, 0.0005523102008737624, 0.0008553906227461994, 0.00121893675532192, 0.0005565308383665979, 0.0005807619309052825, 0.0005199293955229223, 0.0007009502733126283, 0.0005101857241243124, 0.000608331523835659, 0.0005209838855080307, 0.0005355405737645924, 0.0006594046717509627, 0.0005905660218559206, 0.000610293005593121, 0.0005646636709570885, 0.006097296252846718, 0.0008631895179860294, 0.0007662563002668321, 0.0006319796666502953, 0.0006098499288782477, 0.0005168875213712454, 0.0006784652359783649, 0.0008176051778718829, 0.000563153880648315, 0.0005193021497689188, 0.0013954066671431065, 0.0010396462166681886, 0.0007398876477964222, 0.0014515462098643184, 0.017056778073310852, 0.0007142104441300035, 0.0018755042692646384, 0.0006326561560854316, 0.0637725368142128, 0.0007558221695944667, 0.0217878594994545, 0.02295263484120369, 0.0010822409531101584, 0.0013322776649147272, 0.001675277017056942, 0.0008887109579518437, 0.0007389963138848543, 0.06487727165222168, 0.01924719847738743, 0.0006449245265685022, 0.0009959498420357704, 0.001054977416060865, 0.0009438890847377479, 0.0009558357414789498, 0.0008829797734506428, 0.0007833230774849653, 0.0008919099345803261, 0.0009786054724827409, 0.000767249264754355, 0.0006469563231803477, 0.0009440302383154631, 0.00071855413261801, 0.0007852546987123787, 0.011287503875792027, 0.0010254487860947847, 0.0013643424026668072, 0.0009509029914624989 ]

[ "‘prevention is better than cure!’", "\n\nHere are some simple tips to take care of your Lips Health\n\nDrink Lot Of Water\n\nRemove Makeup\n\nRemove your makeup as soon as you dont need make over beacuse your lips need to b relaxed by its natural position .Cosmetis can harm your lips because they are chemcals and artificial colors.", "Remove lipstick and lip liner or any other makeup cosmetic with cotton swabs or cotton balls before going to bed.", "\n\n\n\n\n\nDon't Lick Or Touch Your Lips\n\nDon't touch or lick your lips as they can be affected because lips don't have any own protection.", "Touching or licking your lips not only creat problem for your lips but also increase any occured problem.", "\n\n\n\n\n\nLips Hyderation At Night\n\n\n\n\n\nWhen we are awake whe know when lips come dry but when we are sleeping we dont know .Dehyderation of lips can create cracking chapping or any other lips health problem .Use peetrolium jelly or heavy baam to hyderate and wet your lips overnight\n\n\n\n\n\nMassaging Your Lips\n\nLips tissues also needs care and massage as other body tissue can work better by simple care.", "Massage your lips for only 5 to 7 mints daily with lubricated nourishing oil to prevent many lips diseases or problems.", "\n\n\n\n\n\nScrubing Your Lips\n\nRemove dead skin cell of lips by using rock suger scruo with can be made easily at home to care your lips health.", "Dead cells of lips skin can creat any infection for your lips not only a bad look but also pain and irritation.", "\n\nYou can restore your lips health if you bealeive in saying" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.001062869094312191, 0.05819861590862274, 0.057263463735580444, 0.7841129302978516, 0.4494962990283966, 0.11451887339353561, 0.3323134779930115, 0.6952217817306519, 0.12499037384986877, 0.027529286220669746 ]

[ "Explore Porcelanas Linha, Oxford Porcelanas e muito mais!", "\n\n12 x five track Eps: The Hold Tight Released: 27 January 2014 We Should Break Up Released: 28 February 2014 When the Morning Stars Sang Together Released: 31 March 2014 Free As You Wanna Be Released: 28 April 2014 Grand Union Released 26 May 2014 When I Grow Up Released 30 June 2014 Rousseau Released 28 July 2014 Little Bull Released 29 August 2014 Small Things Released 29 September 2014 Spirit Walks Released 31 October 2014 Live from Union Chapel Released 30…" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0012554305139929056, 0.0012617144966498017 ]

[ "Alivash\n\nAlivash is a village in the Ardabil Province of Iran.", "\n\nReferences\n\nTageo\n\nCategory:Populated places in Ardabil Province" ]

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

[ 0.002111510606482625, 0.0006393498624674976 ]

[ "Exogenous estrogens attenuate dietary hypercholesterolemia and atherosclerosis in the rabbit.", "\nThe effect of exogenous estrogens upon the response to dietary cholesterol was tested in New Zealand White rabbits. ", "Cholesterol-fed, untreated rabbits had a 10-fold increase in plasma cholesterol in 12 wk. ", "The major increase of cholesterol occurred in very low density lipoproteins (VLDL, 43.5-fold) followed by intermediate density lipoproteins (IDL, 26-fold) and low density lipoproteins (LDL, 6-fold) with no change in high density lipoproteins (HDL). ", "These diet induced changes were markedly attenuated in the estrogen treated animals, in whom plasma cholesterol increased only 5-fold. ", "This increase was distributed among LDL (6-fold), IDL (7.5-fold), and VLDL (9-fold), similarly with no change in HDL. ", "All the lipoproteins in both groups of animals were considerably enriched in cholesterol during cholesterol feeding as indicated by a high cholesterol/protein and cholesterol/triglyceride ration. ", "However, these ratios were lower in estrogen treated animals. ", "There were no differences in the feed consumption, body weight or cholesterol absorption between the two groups of animals. ", "Rabbits fed a cholesterol-rich diet but not treated with estrogen had well developed lesions in all parts of the aorta with higher content of cholesterol and phospholipids as compared to those injected with estrogen, whose aortas were completely clear of visible atherosclerosis. ", "Equivalent total hypercholesterolemia was induced in other estrogen-treated rabbits by feeding twice the cholesterol dietary content (0.2%) as in nonestrogen-treated animals. ", "Aortic atherosclerosis was far more evident in the latter, which had higher proportions of cholesterol-rich lipoproteins of d less than 1.006 g/ml." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0016403266927227378, 0.0008579092682339251, 0.012425359338521957, 0.0009356206865049899, 0.0006700046360492706, 0.0006251607555896044, 0.0008971102652139962, 0.0006647339323535562, 0.0006484591285698116, 0.002218657871708274, 0.0011025581043213606, 0.0010111135197803378 ]

[ "/* Copyright 2017 The TensorFlow Authors. ", "All Rights Reserved.", "\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.", "\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.", "\nSee the License for the specific language governing permissions and\nlimitations under the License.", "\n==============================================================================*/\n#include <stddef.h>\n\n#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <functional>\n#include <limits>\n\n#include \"tensorflow/lite/c/builtin_op_data.h\"\n#include \"tensorflow/lite/c/common.h\"\n#include \"tensorflow/lite/kernels/cpu_backend_context.h\"\n#include \"tensorflow/lite/kernels/internal/common.h\"\n#include \"tensorflow/lite/kernels/internal/compatibility.h\"\n#include \"tensorflow/lite/kernels/internal/cppmath.h\"\n#include \"tensorflow/lite/kernels/internal/optimized/optimized_ops.h\"\n#include \"tensorflow/lite/kernels/internal/quantization_util.h\"\n#include \"tensorflow/lite/kernels/internal/reference/binary_function.h\"\n#include \"tensorflow/lite/kernels/internal/reference/integer_ops/log_softmax.h\"\n#include \"tensorflow/lite/kernels/internal/reference/integer_ops/logistic.h\"\n#include \"tensorflow/lite/kernels/internal/reference/integer_ops/tanh.h\"\n#include \"tensorflow/lite/kernels/internal/reference/logistic.h\"\n#include \"tensorflow/lite/kernels/internal/reference/prelu.h\"\n#include \"tensorflow/lite/kernels/internal/reference/reference_ops.h\"\n#include \"tensorflow/lite/kernels/internal/reference/softmax.h\"\n#include \"tensorflow/lite/kernels/internal/reference/tanh.h\"\n#include \"tensorflow/lite/kernels/internal/tensor.h\"\n#include \"tensorflow/lite/kernels/internal/tensor_ctypes.h\"\n#include \"tensorflow/lite/kernels/internal/types.h\"\n#include \"tensorflow/lite/kernels/kernel_util.h\"\n\n#if __aarch64__ && __clang__\n#include <arm_neon.h>\n#endif\n\nnamespace tflite {\nnamespace ops {\nnamespace builtin {\nnamespace activations {\n\n// TODO(b/142762739): We should figure out a multi-threading plan for most of\n// the activation ops below.", "\n\nenum KernelType {\n kReference,\n kGenericOptimized,\n kFixedPointOptimized,\n};\n\nstruct OpData {\n int32_t input_multiplier = 0;\n int input_left_shift = 0;\n int32_t input_range_radius = 0;\n int diff_min = 0;\n uint8_t table[256] = {0};\n};\n\nstruct SoftmaxOpData {\n struct SoftmaxParams params = {};\n float table[256];\n#ifdef TFLITE_SOFTMAX_USE_UINT16_LUT\n uint8_t uint8_table1[256];\n uint8_t uint8_table2[256];\n#endif\n static constexpr int kInt16LUTArraySize = 513;\n int16_t exp_lut[kInt16LUTArraySize]; // int16 LUT for exp(x), where x uniform\n // distributed between [-10.0 , 0.0]\n int16_t one_over_one_plus_x_lut[kInt16LUTArraySize]; // int16 LUT for 1 /\n // (1 + x), where x\n // uniform distributed\n // between [0.0 , 1.0]\n};\n\nstruct LogSoftmaxOpData : public OpData {\n int32_t reverse_scaling_divisor = 0;\n int32_t reverse_scaling_right_shift = 0;\n struct SoftmaxParams params = {};\n float f_table[256];\n};\n\nstruct LeakyReluOpData : public OpData {\n int32_t output_multiplier_alpha = 0;\n int32_t output_shift_alpha = 0;\n int32_t output_multiplier_identity = 0;\n int32_t output_shift_identity = 0;\n};\n\nstruct PreluOpData : public OpData {\n int32_t output_multiplier_1 = 0;\n int32_t output_shift_1 = 0;\n int32_t output_multiplier_2 = 0;\n int32_t output_shift_2 = 0;\n bool requires_broadcast;\n};\n\nstruct HardSwishData {\n HardSwishParams params;\n};\n\nstruct ReluOpData : public OpData {\n int32_t output_multiplier = 0;\n int output_shift = 0;\n};\n\nnamespace {\nTfLiteStatus CheckOutputQuantParams(TfLiteContext* context,\n const TfLiteTensor* input,\n const TfLiteTensor* output) {\n TF_LITE_ENSURE(context, output->params.scale == 1. / ", "256);\n if (input->type == kTfLiteUInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 0);\n } else {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, -128);\n }\n return kTfLiteOk;\n}\n\ntemplate <typename T>\nvoid PopulateLookupTable(struct OpData* data, const TfLiteTensor* input,\n TfLiteTensor* output,\n const std::function<float(float)>& transform) {\n static_assert(sizeof(T) == 1, \"Lookup table valid only for 8bit\");\n const float inverse_scale = 1 / output->params.scale;\n int32_t maxval = std::numeric_limits<T>::max();\n int32_t minval = std::numeric_limits<T>::min();\n for (int32_t val = minval; val <= maxval; ++val) {\n const float dequantized =\n input->params.scale * (val - input->params.zero_point);\n const float transformed = transform(dequantized);\n const float rescaled = std::round(transformed * inverse_scale);\n const int32_t quantized =\n static_cast<int32_t>(rescaled + output->params.zero_point);\n data->table[static_cast<uint8_t>(static_cast<T>(val))] =\n static_cast<uint8_t>(\n static_cast<T>(std::max(std::min(maxval, quantized), minval)));\n }\n}\n\n// TODO(b/143696793): move this to optimized_ops.", "\nvoid EvalUsingLookupTable(struct OpData* data, const TfLiteTensor* input,\n TfLiteTensor* output) {\n const int size =\n MatchingFlatSize(GetTensorShape(input), GetTensorShape(output));\n uint8_t* output_data = GetTensorData<uint8_t>(output);\n const uint8_t* input_data = GetTensorData<uint8_t>(input);\n int i = 0;\n#if __aarch64__ && __clang__\n // This code uses ARM64-only instructions.", "\n // TODO(b/143709993): Port to ARMv7\n\n // Load the tables into registers. (", "4*4 128-bit registers)\n uint8x16x4_t table[4];\n table[0] = vld1q_u8_x4(data->table + 16 * 4 * 0);\n table[1] = vld1q_u8_x4(data->table + 16 * 4 * 1);\n table[2] = vld1q_u8_x4(data->table + 16 * 4 * 2);\n table[3] = vld1q_u8_x4(data->table + 16 * 4 * 3);\n\n // Vectorized loop; process uint8x16_t (16 elements) at a time.", "\n constexpr int vectorized_16_loop_step = 16;\n const int vectorized_16_loop_end =\n size / vectorized_16_loop_step * vectorized_16_loop_step;\n for (; i < vectorized_16_loop_end; i += vectorized_16_loop_step) {\n uint8x16_t input = vld1q_u8(input_data + i);\n uint8x16_t output = optimized_ops::aarch64_lookup_vector(table, input);\n vst1q_u8(output_data + i, output);\n }\n // Postamble and non-ARM64 code: simple for loop.", "\n#endif\n for (; i < size; ++i) {\n output_data[i] = data->table[input_data[i]];\n }\n}\n\ntemplate <typename T>\nvoid QuantizedReluX(float act_min, float act_max, const TfLiteTensor* input,\n TfLiteTensor* output, const ReluOpData* data) {\n ReluParams params;\n params.quantized_activation_min =\n std::max(static_cast<int32_t>(std::numeric_limits<T>::min()),\n output->params.zero_point +\n static_cast<int32>(roundf(act_min / output->params.scale)));\n params.quantized_activation_max =\n act_max == std::numeric_limits<float>::infinity()\n ? ", "static_cast<int32_t>(std::numeric_limits<T>::max())\n : std::min(\n static_cast<int32_t>(std::numeric_limits<T>::max()),\n output->params.zero_point +\n static_cast<int32>(roundf(act_max / output->params.scale)));\n params.input_offset = input->params.zero_point;\n params.output_offset = output->params.zero_point;\n params.output_multiplier = data->output_multiplier;\n params.output_shift = data->output_shift;\n optimized_ops::ReluX(params, GetTensorShape(input), GetTensorData<T>(input),\n GetTensorShape(output), GetTensorData<T>(output));\n}\n\n} // namespace\n\nvoid* Init(TfLiteContext* context, const char* buffer, size_t length) {\n // This is a builtin op, so we don't use the contents in 'buffer', if any.", "\n // Instead, we allocate a new object to carry information from Prepare() to\n // Eval().", "\n return new OpData;\n}\n\nvoid* SoftmaxInit(TfLiteContext* context, const char* buffer, size_t length) {\n return new SoftmaxOpData;\n}\n\nvoid SoftmaxFree(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<SoftmaxOpData*>(buffer);\n}\n\nvoid* LogSoftmaxInit(TfLiteContext* context, const char* buffer,\n size_t length) {\n return new LogSoftmaxOpData;\n}\n\nvoid* PreluInit(TfLiteContext* context, const char* buffer, size_t length) {\n return new PreluOpData;\n}\n\nvoid Free(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<OpData*>(buffer);\n}\n\nvoid LogSoftmaxFree(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<LogSoftmaxOpData*>(buffer);\n}\n\nvoid PreluFree(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<PreluOpData*>(buffer);\n}\n\nvoid* HardSwishInit(TfLiteContext* context, const char* buffer, size_t length) {\n return new HardSwishData;\n}\n\nTfLiteStatus GenericPrepare(TfLiteContext* context, TfLiteNode* node) {\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\nvoid* ReluInit(TfLiteContext* context, const char* buffer, size_t length) {\n return new ReluOpData;\n}\n\nvoid ReluFree(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<ReluOpData*>(buffer);\n}\n\nTfLiteStatus ReluPrepare(TfLiteContext* context, TfLiteNode* node) {\n ReluOpData* data = reinterpret_cast<ReluOpData*>(node->user_data);\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n if (input->type == kTfLiteInt8 || input->type == kTfLiteUInt8) {\n double real_multiplier = input->params.scale / output->params.scale;\n QuantizeMultiplier(real_multiplier, &data->output_multiplier,\n &data->output_shift);\n }\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\nvoid* LeakyReluInit(TfLiteContext* context, const char* buffer, size_t length) {\n return new LeakyReluOpData;\n}\n\nvoid LeakyReluFree(TfLiteContext* context, void* buffer) {\n delete reinterpret_cast<LeakyReluOpData*>(buffer);\n}\n\nvoid HardSwishFree(TfLiteContext* context, void* buffer) {\n delete static_cast<HardSwishData*>(buffer);\n}\n\nTfLiteStatus HardSwishPrepare(TfLiteContext* context, TfLiteNode* node) {\n TF_LITE_ENSURE_STATUS(GenericPrepare(context, node));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n\n if (output->type == kTfLiteUInt8 || output->type == kTfLiteInt8) {\n HardSwishData* data = static_cast<HardSwishData*>(node->user_data);\n HardSwishParams* params = &data->params;\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n params->input_zero_point = input->params.zero_point;\n params->output_zero_point = output->params.zero_point;\n const float input_scale = input->params.scale;\n const float hires_input_scale = (1.0f / 128.0f) * input_scale;\n const float reluish_scale = 3.0f / 32768.0f;\n const float output_scale = output->params.scale;\n\n const float output_multiplier = hires_input_scale / output_scale;\n\n int32_t output_multiplier_fixedpoint_int32;\n QuantizeMultiplier(output_multiplier, &output_multiplier_fixedpoint_int32,\n &params->output_multiplier_exponent);\n DownScaleInt32ToInt16Multiplier(\n output_multiplier_fixedpoint_int32,\n &params->output_multiplier_fixedpoint_int16);\n TF_LITE_ENSURE(context, params->output_multiplier_exponent <= 0);\n\n const float reluish_multiplier = hires_input_scale / reluish_scale;\n int32_t reluish_multiplier_fixedpoint_int32;\n QuantizeMultiplier(reluish_multiplier, &reluish_multiplier_fixedpoint_int32,\n &params->reluish_multiplier_exponent);\n DownScaleInt32ToInt16Multiplier(\n reluish_multiplier_fixedpoint_int32,\n &params->reluish_multiplier_fixedpoint_int16);\n }\n return kTfLiteOk;\n}\n\nTfLiteStatus LeakyReluPrepare(TfLiteContext* context, TfLiteNode* node) {\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n LeakyReluOpData* data = reinterpret_cast<LeakyReluOpData*>(node->user_data);\n\n if (output->type == kTfLiteUInt8 || output->type == kTfLiteInt8 ||\n output->type == kTfLiteInt16) {\n const auto* params =\n reinterpret_cast<TfLiteLeakyReluParams*>(node->builtin_data);\n\n double alpha_multiplier =\n input->params.scale * params->alpha / output->params.scale;\n QuantizeMultiplier(alpha_multiplier, &data->output_multiplier_alpha,\n &data->output_shift_alpha);\n double identity_multiplier = input->params.scale / output->params.scale;\n QuantizeMultiplier(identity_multiplier, &data->output_multiplier_identity,\n &data->output_shift_identity);\n }\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus TanhPrepare(TfLiteContext* context, TfLiteNode* node) {\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n if (kernel_type == kFixedPointOptimized) {\n if (input->type == kTfLiteUInt8 || input->type == kTfLiteInt8) {\n static constexpr int kInputIntegerBits = 4;\n\n const double input_real_multiplier =\n input->params.scale *\n static_cast<double>(1 << (15 - kInputIntegerBits));\n\n const double q =\n std::frexp(input_real_multiplier, &data->input_left_shift);\n auto q_fixed = static_cast<int32_t>(TfLiteRound(q * (1ll << 15)));\n data->input_multiplier = static_cast<int16_t>(q_fixed);\n\n int16_t input_range_radius =\n CalculateInputRadius(kInputIntegerBits, data->input_left_shift, 15);\n data->input_range_radius = input_range_radius;\n }\n }\n\n if (kernel_type == kGenericOptimized || kernel_type == kReference) {\n if (input->type == kTfLiteUInt8) {\n PopulateLookupTable<uint8_t>(\n data, input, output, [](float value) { return std::tanh(value); });\n } else if (input->type == kTfLiteInt8) {\n PopulateLookupTable<int8_t>(data, input, output,\n [](float value) { return std::tanh(value); });\n }\n }\n\n if (input->type == kTfLiteInt16) {\n static constexpr int kInputIntegerBits = 3;\n static constexpr int kOutputFractionalBits = 15;\n\n // These operators are implemented in fixed-point arithmetic,\n // which intrinsically wants symmetric ranges (zero_point==0)\n // and power-of-two scales (power-of-two is abbreviated below as POT).", "\n // While more general support would be possible by means of rescaling,\n // that would add some overhead and some loss of accuracy and wouldn't\n // be used at the moment as current quantized LSTM applications are\n // happy with symmetric, power-of-two-scales quantization. ", "So we just\n // implement that narrow case only for now.", "\n\n TF_LITE_ENSURE_EQ(context, input->params.zero_point, 0);\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 0);\n\n int input_scale_log2_rounded;\n bool param_scale_pot =\n CheckedLog2(input->params.scale, &input_scale_log2_rounded);\n\n data->input_left_shift =\n (15 - kInputIntegerBits) + input_scale_log2_rounded;\n param_scale_pot &=\n (data->input_left_shift == 0 || data->input_left_shift == 1);\n\n if (!", "param_scale_pot) {\n // In case of general scale parameter, we need to do a rescaling.", "\n // Magic constant 4096:\n // We need to scale down to (-2^3, 2^3) / 3 is kInputIntegerBits/ interval\n // from 16-bit (-2^15, 2^15),\n // so we need to multiply by\n // 2^(15 - kInputIntegerBits) = 2^12 = 4096.", "\n data->input_multiplier = static_cast<int32_t>(input->params.scale * 4096);\n }\n\n int output_scale_log2_rounded;\n TF_LITE_ENSURE(\n context, CheckedLog2(output->params.scale, &output_scale_log2_rounded));\n TF_LITE_ENSURE_EQ(context, output_scale_log2_rounded,\n -kOutputFractionalBits);\n }\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus SigmoidPrepare(TfLiteContext* context, TfLiteNode* node) {\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n if (kernel_type == kFixedPointOptimized) {\n if (input->type == kTfLiteUInt8 || input->type == kTfLiteInt8) {\n if (input->type == kTfLiteUInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point,\n std::numeric_limits<uint8_t>::min());\n }\n if (input->type == kTfLiteInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point,\n std::numeric_limits<int8_t>::min());\n }\n TF_LITE_ENSURE(context, output->params.scale == 1. / ", "256);\n\n static constexpr int kInputIntegerBits = 4;\n\n const double input_real_multiplier =\n input->params.scale *\n static_cast<double>(1 << (15 - kInputIntegerBits));\n\n const double q =\n std::frexp(input_real_multiplier, &data->input_left_shift);\n auto q_fixed = static_cast<int32_t>(TfLiteRound(q * (1ll << 15)));\n data->input_multiplier = static_cast<int16_t>(q_fixed);\n\n int16_t input_range_radius =\n CalculateInputRadius(kInputIntegerBits, data->input_left_shift, 15);\n data->input_range_radius = input_range_radius;\n }\n }\n\n if (kernel_type == kGenericOptimized || kernel_type == kReference) {\n if (input->type == kTfLiteUInt8) {\n TF_LITE_ENSURE(context, output->params.scale == 1. / ", "256);\n PopulateLookupTable<uint8_t>(data, input, output, [](float value) {\n return 1.0f / (1.0f + std::exp(-value));\n });\n } else if (input->type == kTfLiteInt8) {\n TF_LITE_ENSURE(context, output->params.scale == 1. / ", "256);\n PopulateLookupTable<int8_t>(data, input, output, [](float value) {\n return 1.0f / (1.0f + std::exp(-value));\n });\n } else if (input->type == kTfLiteInt16) {\n TF_LITE_ENSURE(context, output->params.scale == 1. / ", "32768);\n TF_LITE_ENSURE(context, output->params.zero_point == 0);\n }\n }\n\n if (input->type == kTfLiteInt16) {\n static constexpr int kInputIntegerBits = 3;\n static constexpr int kOutputFractionalBits = 15;\n\n // See comments in TanhPrepare about requiring zero_point==0\n // and a power-of-two (\"POT\") scale.", "\n\n TF_LITE_ENSURE_EQ(context, input->params.zero_point, 0);\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 0);\n\n int input_scale_log2_rounded;\n bool param_scale_pot =\n CheckedLog2(input->params.scale, &input_scale_log2_rounded);\n\n data->input_left_shift =\n (15 - kInputIntegerBits) + input_scale_log2_rounded;\n param_scale_pot &= (data->input_left_shift == 0);\n\n if (!", "param_scale_pot) {\n // In case of general scale parameter, we need to do a rescaling.", "\n // Magic constant 4096:\n // We need to scale down to (-2^3, 2^3) / 3 is kInputIntegerBits/ interval\n // from 16-bit (-2^15, 2^15),\n // so we need to multiply by\n // 2^(15 - kInputIntegerBits) = 2^12 = 4096.", "\n data->input_multiplier = static_cast<int32_t>(input->params.scale * 4096);\n }\n\n int output_scale_log2_rounded;\n TF_LITE_ENSURE(\n context, CheckedLog2(output->params.scale, &output_scale_log2_rounded));\n TF_LITE_ENSURE_EQ(context, output_scale_log2_rounded,\n -kOutputFractionalBits);\n }\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\nTfLiteStatus SoftmaxPrepare(TfLiteContext* context, TfLiteNode* node) {\n auto* params = reinterpret_cast<TfLiteSoftmaxParams*>(node->builtin_data);\n SoftmaxOpData* data = reinterpret_cast<SoftmaxOpData*>(node->user_data);\n\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n if (output->type == kTfLiteInt16) {\n TF_LITE_ENSURE(context, input->type == kTfLiteInt8 ||\n input->type == kTfLiteUInt8 ||\n input->type == kTfLiteInt16);\n } else {\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n }\n\n TF_LITE_ENSURE(context, NumDimensions(input) >= 1);\n\n if (input->type == kTfLiteUInt8 || input->type == kTfLiteInt8) {\n switch (output->type) {\n case kTfLiteUInt8:\n case kTfLiteInt8:\n#ifdef TFLITE_SOFTMAX_USE_UINT16_LUT\n // Only apply when both input & output are uint8/int8 & build with clang\n // on aarch64.", "\n // TODO(b/143709993): Port to ARMv7 and other platforms.", "\n data->params.uint8_table1 = data->uint8_table1;\n data->params.uint8_table2 = data->uint8_table2;\n optimized_ops::PopulateSoftmaxUInt8LookupTable(\n &data->params, input->params.scale, params->beta);\n break;\n#endif\n case kTfLiteInt16:\n default:\n data->params.table = data->table;\n optimized_ops::PopulateSoftmaxLookupTable(\n &data->params, input->params.scale, params->beta);\n }\n\n data->params.zero_point = output->params.zero_point;\n data->params.scale = output->params.scale;\n }\n\n if (input->type == kTfLiteInt16) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 0);\n\n data->params.exp_lut = data->exp_lut;\n // exp LUT only used on nagative values\n // we consider exp(-10.0) is insignificant to accumulation\n gen_lut([](double value) { return std::exp(value); }, -10.0, 0.0,\n data->params.exp_lut, data->kInt16LUTArraySize);\n data->params.one_over_one_plus_x_lut = data->one_over_one_plus_x_lut;\n gen_lut([](double value) { return 1.0 / (1.0 + value); }, 0.0, 1.0,\n data->params.one_over_one_plus_x_lut, data->kInt16LUTArraySize);\n data->params.zero_point = output->params.zero_point;\n data->params.scale = output->params.scale;\n\n double input_scale_beta_rescale =\n input->params.scale * params->beta /\n (10.0 / 65535.0); // scale the input_diff such that [-65535, 0]\n // correspond to [-10.0, 0.0]\n QuantizeMultiplier(input_scale_beta_rescale, &data->params.input_multiplier,\n &data->params.input_left_shift);\n }\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\nTfLiteStatus LogSoftmaxPrepare(TfLiteContext* context, TfLiteNode* node) {\n LogSoftmaxOpData* data = reinterpret_cast<LogSoftmaxOpData*>(node->user_data);\n\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 1);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, output->type);\n\n if (input->type == kTfLiteUInt8 || input->type == kTfLiteInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.scale, 16.0 / 256);\n static const double kBeta = 1.0;\n if (input->type == kTfLiteUInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 255);\n data->params.table = data->f_table;\n optimized_ops::PopulateSoftmaxLookupTable(&data->params,\n input->params.scale, kBeta);\n data->params.zero_point = output->params.zero_point;\n data->params.scale = output->params.scale;\n }\n if (input->type == kTfLiteInt8) {\n TF_LITE_ENSURE_EQ(context, output->params.zero_point, 127);\n static const int kScaledDiffIntegerBits = 5;\n tflite::PreprocessLogSoftmaxScalingExp(\n kBeta, input->params.scale, kScaledDiffIntegerBits,\n &data->input_multiplier, &data->input_left_shift,\n &data->reverse_scaling_divisor, &data->reverse_scaling_right_shift);\n data->reverse_scaling_right_shift *= -1;\n data->diff_min =\n -1.0 * tflite::CalculateInputRadius(kScaledDiffIntegerBits,\n data->input_left_shift);\n }\n }\n\n return context->ResizeTensor(context, output,\n TfLiteIntArrayCopy(input->dims));\n}\n\nTfLiteStatus PreluPrepare(TfLiteContext* context, TfLiteNode* node) {\n TF_LITE_ENSURE_EQ(context, NumInputs(node), 2);\n TF_LITE_ENSURE_EQ(context, NumOutputs(node), 1);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n const TfLiteTensor* alpha;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 1, &alpha));\n PreluOpData* data = reinterpret_cast<PreluOpData*>(node->user_data);\n\n TF_LITE_ENSURE_TYPES_EQ(context, input->type, alpha->type);\n\n output->type = input->type;\n\n if (output->type == kTfLiteUInt8 || output->type == kTfLiteInt8 ||\n output->type == kTfLiteInt16) {\n // prelu(x) = x if x >= 0 else x * alpha.", "\n // So if we translate that for quantized computation:\n //\n // input_float = (input_q - input_zp) * input_scale\n // output_float = (output_q - output_zp) * output_scale\n // alpha_float = (alpha_q - alpha_zp) * alpha_scale\n //\n // When input_q - input_zp >= 0:\n // ouput_q = (input_q - input_zp) * input_scale / output_scale + output_q\n // else:\n // output_q = (input_q - input_zp) * (alpha_q - alpha_zp) * input_scale\n // * alpha_scale / output_scale + output_q\n //\n // So for input_q - input_zp >= 0:\n // output real multiplier 1 is input_scale / output_scale;\n // for input_q - input_zp < 0:\n // output real multiplier 2 is input_scale * alpha_scale/ output_scale.", "\n double real_multiplier_1 = input->params.scale / output->params.scale;\n double real_multiplier_2 =\n input->params.scale * alpha->params.scale / output->params.scale;\n QuantizeMultiplier(real_multiplier_1, &data->output_multiplier_1,\n &data->output_shift_1);\n QuantizeMultiplier(real_multiplier_2, &data->output_multiplier_2,\n &data->output_shift_2);\n }\n\n data->requires_broadcast = !", "HaveSameShapes(input, alpha);\n // PRelu (parameteric Relu) shares the same alpha value on \"shared axis\".", "\n // This means it's always required to \"broadcast\" alpha values in PRelu.", "\n TfLiteIntArray* output_size = nullptr;\n TF_LITE_ENSURE_OK(\n context, CalculateShapeForBroadcast(context, input, alpha, &output_size));\n\n TF_LITE_ENSURE_OK(context,\n context->ResizeTensor(context, output, output_size));\n // After broadcasting, the output shape should always be the same as the\n // input shape.", "\n TF_LITE_ENSURE(context, HaveSameShapes(input, output));\n\n return kTfLiteOk;\n}\n\nTfLiteStatus ReluEval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n const ReluOpData* data = reinterpret_cast<ReluOpData*>(node->user_data);\n switch (input->type) {\n case kTfLiteFloat32: {\n optimized_ops::Relu(GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n } break;\n // TODO(renjieliu): We may revisit the quantization calculation logic,\n // the unbounded upper limit is actually hard to quantize.", "\n case kTfLiteUInt8: {\n QuantizedReluX<uint8_t>(0.0f, std::numeric_limits<float>::infinity(),\n input, output, data);\n } break;\n case kTfLiteInt8: {\n QuantizedReluX<int8_t>(0.0f, std::numeric_limits<float>::infinity(),\n input, output, data);\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context, \"Only float32 & int8/uint8 is supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n return kTfLiteOk;\n}\n\nTfLiteStatus Relu1Eval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n const ReluOpData* data = reinterpret_cast<ReluOpData*>(node->user_data);\n switch (input->type) {\n case kTfLiteFloat32: {\n optimized_ops::Relu1(GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output),\n GetTensorData<float>(output));\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8: {\n QuantizedReluX<uint8_t>(-1.0f, 1.0f, input, output, data);\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n QuantizedReluX<int8_t>(-1, 1, input, output, data);\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only float32, uint8, int8 supported \"\n \"currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus HardSwishEval(TfLiteContext* context, TfLiteNode* node) {\n HardSwishData* data = static_cast<HardSwishData*>(node->user_data);\n\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n switch (input->type) {\n case kTfLiteFloat32: {\n if (kernel_type == kReference) {\n reference_ops::HardSwish(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n } else {\n optimized_ops::HardSwish(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n }\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8: {\n HardSwishParams& params = data->params;\n if (kernel_type == kReference) {\n reference_ops::HardSwish(\n params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n } else {\n optimized_ops::HardSwish(\n params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n }\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n HardSwishParams& params = data->params;\n if (kernel_type == kReference) {\n reference_ops::HardSwish(\n params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n } else {\n optimized_ops::HardSwish(\n params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n }\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context,\n \"Only float32, uint8 and int8 are supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\nTfLiteStatus Relu6Eval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n ReluOpData* data = reinterpret_cast<ReluOpData*>(node->user_data);\n switch (input->type) {\n case kTfLiteFloat32: {\n size_t elements = input->bytes / sizeof(float);\n const float* in = GetTensorData<float>(input);\n const float* in_end = in + elements;\n float* out = GetTensorData<float>(output);\n for (; in < in_end; in++, out++) *out = std::min(std::max(0.f, *in), 6.f);\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8:\n QuantizedReluX<uint8_t>(0.0f, 6.0f, input, output, data);\n return kTfLiteOk;\n case kTfLiteInt8: {\n QuantizedReluX<int8_t>(0.0f, 6.0f, input, output, data);\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context,\n \"Only float32, uint8 and int8 are supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus TanhEval(TfLiteContext* context, TfLiteNode* node) {\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n switch (input->type) {\n case kTfLiteFloat32: {\n if (kernel_type == kReference) {\n reference_ops::Tanh(GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output),\n GetTensorData<float>(output));\n } else {\n optimized_ops::Tanh(GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output),\n GetTensorData<float>(output));\n }\n return kTfLiteOk;\n } break;\n case kTfLiteInt16: {\n TanhParams params;\n params.input_left_shift = data->input_left_shift;\n if (kernel_type == kReference || (data->input_multiplier > 0)) {\n reference_integer_ops::Tanh(\n data->input_multiplier, data->input_left_shift,\n GetTensorShape(input), GetTensorData<int16_t>(input),\n GetTensorShape(output), GetTensorData<int16_t>(output));\n } else {\n optimized_ops::Tanh(\n params, GetTensorShape(input), GetTensorData<int16_t>(input),\n GetTensorShape(output), GetTensorData<int16_t>(output));\n }\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8: {\n if (kernel_type == kFixedPointOptimized) {\n TanhParams params;\n params.input_zero_point = input->params.zero_point;\n params.input_range_radius = data->input_range_radius;\n params.input_multiplier = data->input_multiplier;\n params.input_left_shift = data->input_left_shift;\n optimized_ops::Tanh16bitPrecision(\n params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n } else {\n EvalUsingLookupTable(data, input, output);\n }\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n if (kernel_type == kFixedPointOptimized) {\n TanhParams params;\n params.input_zero_point = input->params.zero_point;\n params.input_range_radius = data->input_range_radius;\n params.input_multiplier = data->input_multiplier;\n params.input_left_shift = data->input_left_shift;\n optimized_ops::Tanh16bitPrecision(\n params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n } else {\n EvalUsingLookupTable(data, input, output);\n }\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only float32, uint8, int16 and int8 are supported \"\n \"currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\n// Sigmoid is also know as \"Logistic\".", "\ntemplate <KernelType kernel_type>\nTfLiteStatus SigmoidEval(TfLiteContext* context, TfLiteNode* node) {\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n switch (input->type) {\n case kTfLiteFloat32: {\n if (kernel_type == kReference) {\n reference_ops::Logistic(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n } else {\n optimized_ops::Logistic(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n }\n break;\n }\n case kTfLiteInt16: {\n LogisticParams params;\n if (kernel_type == kReference || (data->input_multiplier > 0)) {\n const int size =\n MatchingFlatSize(GetTensorShape(input), GetTensorShape(output));\n\n reference_integer_ops::Logistic(data->input_multiplier, size,\n GetTensorData<int16_t>(input),\n GetTensorData<int16_t>(output));\n } else {\n optimized_ops::Logistic(\n params, GetTensorShape(input), GetTensorData<int16_t>(input),\n GetTensorShape(output), GetTensorData<int16_t>(output));\n }\n break;\n }\n case kTfLiteUInt8: {\n if (kernel_type == kFixedPointOptimized) {\n LogisticParams params;\n params.input_zero_point = input->params.zero_point;\n params.input_range_radius = data->input_range_radius;\n params.input_multiplier = data->input_multiplier;\n params.input_left_shift = data->input_left_shift;\n optimized_ops::Logistic16bitPrecision(\n params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n } else {\n EvalUsingLookupTable(data, input, output);\n }\n break;\n }\n case kTfLiteInt8: {\n if (kernel_type == kFixedPointOptimized) {\n LogisticParams params;\n params.input_zero_point = input->params.zero_point;\n params.input_range_radius = data->input_range_radius;\n params.input_multiplier = data->input_multiplier;\n params.input_left_shift = data->input_left_shift;\n optimized_ops::Logistic16bitPrecision(\n params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n } else {\n EvalUsingLookupTable(data, input, output);\n }\n break;\n }\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only float32, uint8, int16 and int8 are supported \"\n \"currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n return kTfLiteOk;\n}\n\nTfLiteStatus SoftmaxFloat(TfLiteContext* context, const TfLiteTensor* input,\n TfLiteTensor* output, TfLiteSoftmaxParams* params) {\n SoftmaxParams op_params;\n op_params.beta = params->beta;\n optimized_ops::Softmax(op_params, GetTensorShape(input),\n GetTensorData<float>(input), GetTensorShape(output),\n GetTensorData<float>(output),\n CpuBackendContext::GetFromContext(context));\n return kTfLiteOk;\n}\n\ntemplate <typename In, typename Out>\nTfLiteStatus SoftmaxQuantized(TfLiteContext* context, const TfLiteTensor* input,\n TfLiteTensor* output, SoftmaxOpData* data) {\n optimized_ops::Softmax(data->params, GetTensorShape(input),\n GetTensorData<In>(input), GetTensorShape(output),\n GetTensorData<Out>(output));\n return kTfLiteOk;\n}\n\ntemplate <>\nTfLiteStatus SoftmaxQuantized<int8_t, int8_t>(TfLiteContext* context,\n const TfLiteTensor* input,\n TfLiteTensor* output,\n SoftmaxOpData* data) {\n#ifdef TFLITE_SOFTMAX_USE_UINT16_LUT\n optimized_ops::SoftmaxInt8LUT(\n data->params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n#else\n optimized_ops::Softmax(data->params, GetTensorShape(input),\n GetTensorData<int8_t>(input), GetTensorShape(output),\n GetTensorData<int8_t>(output));\n#endif\n return kTfLiteOk;\n}\n\ntemplate <>\nTfLiteStatus SoftmaxQuantized<uint8_t, uint8_t>(TfLiteContext* context,\n const TfLiteTensor* input,\n TfLiteTensor* output,\n SoftmaxOpData* data) {\n#ifdef TFLITE_SOFTMAX_USE_UINT16_LUT\n optimized_ops::SoftmaxInt8LUT(\n data->params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n#else\n optimized_ops::Softmax(data->params, GetTensorShape(input),\n GetTensorData<uint8_t>(input), GetTensorShape(output),\n GetTensorData<uint8_t>(output));\n#endif\n return kTfLiteOk;\n}\n\ntemplate <>\nTfLiteStatus SoftmaxQuantized<int16, int16>(TfLiteContext* context,\n const TfLiteTensor* input,\n TfLiteTensor* output,\n SoftmaxOpData* data) {\n if (NumDimensions(input) >= 1 && NumDimensions(input) <= 4) {\n reference_ops::SoftmaxInt16(\n data->params, GetTensorShape(input), GetTensorData<int16_t>(input),\n GetTensorShape(output), GetTensorData<int16_t>(output));\n return kTfLiteOk;\n } else {\n TF_LITE_KERNEL_LOG(context,\n \"Only 1D, 2D, 3D and 4D tensors supported for int16 \"\n \"input with int16 output, got %dD.\",\n NumDimensions(input));\n return kTfLiteError;\n }\n}\n\nTfLiteStatus SoftmaxEval(TfLiteContext* context, TfLiteNode* node) {\n auto* params = reinterpret_cast<TfLiteSoftmaxParams*>(node->builtin_data);\n SoftmaxOpData* data = reinterpret_cast<SoftmaxOpData*>(node->user_data);\n\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n\n switch (input->type) {\n case kTfLiteFloat32: {\n return SoftmaxFloat(context, input, output, params);\n }\n case kTfLiteUInt8: {\n switch (output->type) {\n case kTfLiteUInt8:\n return SoftmaxQuantized<uint8_t, uint8_t>(context, input, output,\n data);\n case kTfLiteInt16:\n return SoftmaxQuantized<uint8_t, int16_t>(context, input, output,\n data);\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only uint8_t and int16_t outputs are supported \"\n \"with uint8_t inputs currently, got %s.\",\n TfLiteTypeGetName(output->type));\n return kTfLiteError;\n }\n }\n case kTfLiteInt8: {\n switch (output->type) {\n case kTfLiteInt8:\n return SoftmaxQuantized<int8_t, int8_t>(context, input, output, data);\n case kTfLiteInt16:\n return SoftmaxQuantized<int8_t, int16_t>(context, input, output,\n data);\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only int8_t and int16_t outputs are supported \"\n \"with int8_t inputs currently, got %s.\",\n TfLiteTypeGetName(output->type));\n return kTfLiteError;\n }\n }\n case kTfLiteInt16: {\n return SoftmaxQuantized<int16_t, int16_t>(context, input, output, data);\n }\n\n default:\n TF_LITE_KERNEL_LOG(context,\n \"Only float32, uint8_t, Int8_t, Int16_t are supported \"\n \"currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus LogSoftmaxEval(TfLiteContext* context, TfLiteNode* node) {\n const LogSoftmaxOpData* data =\n reinterpret_cast<LogSoftmaxOpData*>(node->user_data);\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n switch (input->type) {\n case kTfLiteFloat32: {\n SoftmaxParams op_params;\n if (kernel_type == kGenericOptimized) {\n optimized_ops::LogSoftmax(\n op_params, GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n } else {\n reference_ops::LogSoftmax(\n op_params, GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n }\n return kTfLiteOk;\n }\n case kTfLiteUInt8: {\n SoftmaxParams op_params = data->params;\n if (kernel_type == kGenericOptimized) {\n optimized_ops::LogSoftmax(\n op_params, input->params.scale, GetTensorShape(input),\n GetTensorData<uint8_t>(input), GetTensorShape(output),\n GetTensorData<uint8_t>(output));\n } else {\n reference_ops::LogSoftmax(\n op_params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n }\n return kTfLiteOk;\n }\n case kTfLiteInt8: {\n const auto input_shape = GetTensorShape(input);\n const auto output_shape = GetTensorShape(output);\n const int trailing_dim = input_shape.", "DimensionsCount() - 1;\n const int outer_size =\n MatchingFlatSizeSkipDim(input_shape, trailing_dim, output_shape);\n const int depth =\n MatchingDim(input_shape, trailing_dim, output_shape, trailing_dim);\n reference_integer_ops::LogSoftmax(\n data->input_multiplier, data->input_left_shift,\n data->reverse_scaling_divisor, data->reverse_scaling_right_shift,\n data->diff_min, outer_size, depth, GetTensorData<int8_t>(input),\n GetTensorData<int8_t>(output));\n return kTfLiteOk;\n }\n default:\n TF_LITE_KERNEL_LOG(\n context,\n \"Only float32, uint8 and int8 are supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\ntemplate <typename T>\nT ApplyPrelu(T input, T alpha) {\n return input >= 0.0 ? ", "input : input * alpha;\n}\n\ntemplate <KernelType kernel_type>\nTfLiteStatus PreluEval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n const TfLiteTensor* alpha;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 1, &alpha));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n const PreluOpData* data = reinterpret_cast<PreluOpData*>(node->user_data);\n switch (input->type) {\n case kTfLiteFloat32: {\n if (kernel_type == kGenericOptimized) {\n tflite::ArithmeticParams op_params;\n bool need_broadcast = optimized_ops::ProcessBroadcastShapes(\n GetTensorShape(input), GetTensorShape(alpha), &op_params);\n if (need_broadcast) {\n optimized_ops::BroadcastPReluDispatch(\n op_params, GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(alpha), GetTensorData<float>(alpha),\n GetTensorShape(output), GetTensorData<float>(output),\n ApplyPrelu<float>);\n } else {\n const int flat_size =\n MatchingElementsSize(GetTensorShape(input), GetTensorShape(alpha),\n GetTensorShape(output));\n optimized_ops::PReluElementWise(\n flat_size, op_params, GetTensorData<float>(alpha),\n GetTensorData<float>(input), GetTensorData<float>(output));\n }\n } else {\n if (data->requires_broadcast) {\n reference_ops::BroadcastBinaryFunction4DSlow<float, float, float>(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(alpha), GetTensorData<float>(alpha),\n GetTensorShape(output), GetTensorData<float>(output),\n ApplyPrelu<float>);\n } else {\n reference_ops::BinaryFunction<float, float, float>(\n GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(alpha), GetTensorData<float>(alpha),\n GetTensorShape(output), GetTensorData<float>(output),\n ApplyPrelu<float>);\n }\n }\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8: {\n PreluParams op_params;\n op_params.input_offset = -input->params.zero_point;\n op_params.alpha_offset = -alpha->params.zero_point;\n op_params.output_offset = output->params.zero_point;\n op_params.output_multiplier_1 = data->output_multiplier_1;\n op_params.output_shift_1 = data->output_shift_1;\n op_params.output_multiplier_2 = data->output_multiplier_2;\n op_params.output_shift_2 = data->output_shift_2;\n if (data->requires_broadcast) {\n reference_ops::BroadcastPrelu4DSlow(\n op_params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(alpha), GetTensorData<uint8_t>(alpha),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n } else {\n reference_ops::Prelu(\n op_params, GetTensorShape(input), GetTensorData<uint8_t>(input),\n GetTensorShape(alpha), GetTensorData<uint8_t>(alpha),\n GetTensorShape(output), GetTensorData<uint8_t>(output));\n }\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n PreluParams op_params;\n op_params.input_offset = -input->params.zero_point;\n op_params.alpha_offset = -alpha->params.zero_point;\n op_params.output_offset = output->params.zero_point;\n op_params.output_multiplier_1 = data->output_multiplier_1;\n op_params.output_shift_1 = data->output_shift_1;\n op_params.output_multiplier_2 = data->output_multiplier_2;\n op_params.output_shift_2 = data->output_shift_2;\n if (data->requires_broadcast) {\n reference_ops::BroadcastPrelu4DSlow(\n op_params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(alpha), GetTensorData<int8_t>(alpha),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n } else {\n reference_ops::Prelu(\n op_params, GetTensorShape(input), GetTensorData<int8_t>(input),\n GetTensorShape(alpha), GetTensorData<int8_t>(alpha),\n GetTensorShape(output), GetTensorData<int8_t>(output));\n }\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context,\n \"Only float32 and uint8 and int8 are supported currently, got %d.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\ntemplate <typename T>\nvoid QuantizeLeakyRelu(const TfLiteTensor* input, TfLiteTensor* output,\n const LeakyReluOpData* data) {\n LeakyReluParams op_params;\n\n op_params.input_offset = input->params.zero_point;\n op_params.output_offset = output->params.zero_point;\n op_params.output_multiplier_alpha = data->output_multiplier_alpha;\n op_params.output_shift_alpha = data->output_shift_alpha;\n op_params.output_multiplier_identity = data->output_multiplier_identity;\n op_params.output_shift_identity = data->output_shift_identity;\n reference_ops::QuantizeLeakyRelu(\n op_params, GetTensorShape(input), GetTensorData<T>(input),\n GetTensorShape(output), GetTensorData<T>(output));\n}\n\nTfLiteStatus LeakyReluEval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n const auto* params =\n reinterpret_cast<TfLiteLeakyReluParams*>(node->builtin_data);\n const LeakyReluOpData* data =\n reinterpret_cast<LeakyReluOpData*>(node->user_data);\n\n LeakyReluParams op_params;\n switch (input->type) {\n case kTfLiteFloat32: {\n op_params.alpha = params->alpha;\n optimized_ops::LeakyRelu(\n op_params, GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n return kTfLiteOk;\n } break;\n case kTfLiteUInt8: {\n QuantizeLeakyRelu<uint8_t>(input, output, data);\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n QuantizeLeakyRelu<int8_t>(input, output, data);\n return kTfLiteOk;\n } break;\n case kTfLiteInt16: {\n QuantizeLeakyRelu<int16_t>(input, output, data);\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context,\n \"Only float32, int8, int16 and uint8 is supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\nTfLiteStatus EluPrepare(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n\n // Use LUT to handle quantized elu path.", "\n if (input->type == kTfLiteInt8) {\n PopulateLookupTable<int8_t>(data, input, output, [](float value) {\n return value < 0.0 ? ", "std::exp(value) - 1.0f : value;\n });\n }\n return GenericPrepare(context, node);\n}\n\nTfLiteStatus EluEval(TfLiteContext* context, TfLiteNode* node) {\n const TfLiteTensor* input;\n TF_LITE_ENSURE_OK(context, GetInputSafe(context, node, 0, &input));\n TfLiteTensor* output;\n TF_LITE_ENSURE_OK(context, GetOutputSafe(context, node, 0, &output));\n switch (input->type) {\n case kTfLiteFloat32: {\n optimized_ops::Elu(GetTensorShape(input), GetTensorData<float>(input),\n GetTensorShape(output), GetTensorData<float>(output));\n return kTfLiteOk;\n } break;\n case kTfLiteInt8: {\n OpData* data = reinterpret_cast<OpData*>(node->user_data);\n EvalUsingLookupTable(data, input, output);\n return kTfLiteOk;\n } break;\n default:\n TF_LITE_KERNEL_LOG(\n context, \"Only float32 and int8 is supported currently, got %s.\",\n TfLiteTypeGetName(input->type));\n return kTfLiteError;\n }\n}\n\n} // namespace activations\n\nTfLiteRegistration* Register_ELU() {\n static TfLiteRegistration r = {activations::Init, activations::Free,\n activations::EluPrepare, activations::EluEval};\n return &r;\n}\n\nTfLiteRegistration* Register_RELU() {\n static TfLiteRegistration r = {activations::ReluInit, activations::ReluFree,\n activations::ReluPrepare,\n activations::ReluEval};\n return &r;\n}\n\nTfLiteRegistration* Register_RELU_N1_TO_1() {\n static TfLiteRegistration r = {activations::ReluInit, activations::ReluFree,\n activations::ReluPrepare,\n activations::Relu1Eval};\n return &r;\n}\n\nTfLiteRegistration* Register_RELU6() {\n static TfLiteRegistration r = {activations::ReluInit, activations::ReluFree,\n activations::ReluPrepare,\n activations::Relu6Eval};\n return &r;\n}\n\nTfLiteRegistration* Register_TANH_REF() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::TanhPrepare<activations::kReference>,\n activations::TanhEval<activations::kReference>};\n return &r;\n}\n\nTfLiteRegistration* Register_TANH_GENERIC_OPT() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::TanhPrepare<activations::kGenericOptimized>,\n activations::TanhEval<activations::kGenericOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_TANH_FIXED_POINT_OPT() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::TanhPrepare<activations::kFixedPointOptimized>,\n activations::TanhEval<activations::kFixedPointOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_TANH() {\n // TODO(b/134622898): Switch over from the LUT optimized method to the fixed\n // point optimized method when typical Android hardware performs better on\n // the latter one.", "\n return Register_TANH_GENERIC_OPT();\n}\n\nTfLiteRegistration* Register_LOGISTIC_REF() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::SigmoidPrepare<activations::kReference>,\n activations::SigmoidEval<activations::kReference>};\n return &r;\n}\n\nTfLiteRegistration* Register_LOGISTIC_GENERIC_OPT() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::SigmoidPrepare<activations::kGenericOptimized>,\n activations::SigmoidEval<activations::kGenericOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_LOGISTIC_FIXED_POINT_OPT() {\n static TfLiteRegistration r = {\n activations::Init, activations::Free,\n activations::SigmoidPrepare<activations::kFixedPointOptimized>,\n activations::SigmoidEval<activations::kFixedPointOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_LOGISTIC() {\n // TODO(b/134622898): Switch over from the LUT optimized method to the fixed\n // point optimized method when typical Android hardware performs better on\n // the latter one.", "\n return Register_LOGISTIC_GENERIC_OPT();\n}\n\nTfLiteRegistration* Register_SOFTMAX() {\n static TfLiteRegistration r = {\n activations::SoftmaxInit, activations::SoftmaxFree,\n activations::SoftmaxPrepare, activations::SoftmaxEval};\n return &r;\n}\n\nTfLiteRegistration* Register_LOG_SOFTMAX_REF() {\n static TfLiteRegistration r = {\n activations::LogSoftmaxInit, activations::LogSoftmaxFree,\n activations::LogSoftmaxPrepare,\n activations::LogSoftmaxEval<activations::kReference>};\n return &r;\n}\n\nTfLiteRegistration* Register_LOG_SOFTMAX() {\n static TfLiteRegistration r = {\n activations::LogSoftmaxInit, activations::LogSoftmaxFree,\n activations::LogSoftmaxPrepare,\n activations::LogSoftmaxEval<activations::kGenericOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_PRELU_REF() {\n static TfLiteRegistration r = {\n activations::PreluInit, activations::PreluFree, activations::PreluPrepare,\n activations::PreluEval<activations::kReference>};\n return &r;\n}\n\nTfLiteRegistration* Register_PRELU() {\n static TfLiteRegistration r = {\n activations::PreluInit, activations::PreluFree, activations::PreluPrepare,\n activations::PreluEval<activations::kGenericOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_LEAKY_RELU() {\n static TfLiteRegistration r = {\n activations::LeakyReluInit, activations::LeakyReluFree,\n activations::LeakyReluPrepare, activations::LeakyReluEval};\n return &r;\n}\n\nTfLiteRegistration* Register_HARD_SWISH() {\n static TfLiteRegistration r = {\n activations::HardSwishInit, activations::HardSwishFree,\n activations::HardSwishPrepare,\n activations::HardSwishEval<activations::kGenericOptimized>};\n return &r;\n}\n\nTfLiteRegistration* Register_HARD_SWISH_REF() {\n static TfLiteRegistration r = {\n activations::HardSwishInit, activations::HardSwishFree,\n activations::HardSwishPrepare,\n activations::HardSwishEval<activations::kReference>};\n return &r;\n}\n\n} // namespace builtin\n} // namespace ops\n} // namespace tflite\n" ]

{ "pile_set_name": "Github" }

[ 0.0006811587372794747, 0.0006133032729849219, 0.0005655669956468046, 0.0005399590590968728, 0.0005530948983505368, 0.0011907938169315457, 0.003717474639415741, 0.0017997116083279252, 0.003613636363297701, 0.000808018958196044, 0.0009728034492582083, 0.0009558078600093722, 0.0010547583224251866, 0.0014480291865766048, 0.0006651816656813025, 0.00575094111263752, 0.0005862654070369899, 0.0005950896302238107, 0.0017353598959743977, 0.0005859974771738052, 0.0007730747456662357, 0.0017785023665055633, 0.0011299955658614635, 0.0010282290168106556, 0.0010289987549185753, 0.0009975391440093517, 0.002068811561912298, 0.0005859974771738052, 0.0007730747456662357, 0.002831239951774478, 0.0007280375575646758, 0.006214024033397436, 0.0007420162437483668, 0.0011007908033207059, 0.0006276221829466522, 0.0005986562464386225, 0.0007075387984514236, 0.0023031672462821007, 0.002473607659339905, 0.0043875970877707005, 0.0010698125697672367, 0.00226070755161345, 0.0008949937764555216, 0.006717533338814974, 0.0027278531342744827, 0.011769787408411503 ]

[ "To support high capacity demand and new applications in evolving networks such as fifth generation (5G) wireless networks, ultra-dense networks (UDN) and moving networks (MN) are being developed. ", "Such network architectures are challenged by high capacity demand, inter-cell interference, frequent handovers, and fast moving users, among other challenges. ", "Technologies, such as Coordinated multipoint (CoMP) or Joint transmission (JT) CoMP, Coordinated beam forming/scheduling (CB/CS) CoMP, and multi-user multiple-input and multiple-output (MU-MIMO) based on beam forming are being proposed to alleviate such challenges. ", "However, such CoMP and MU-MIMO schemes are closed-loop schemes, requiring channel state information (CSI) feedback, which in turn requires signaling overhead. ", "The CSI feedback is also sensitive to channel aging and feedback error. ", "Sparse Code Multiple Access (SCMA) is a transmission scheme with relatively low complexity receiver design and good performance. ", "SCMA can offer high spectral efficiency by supporting overloaded systems having more connected devices or traffic than orthogonal resources. ", "A Multi-user SCMA (MU-SCMA) scheme can also increase throughput and coverage, and support open-loop (OL) user multiplexing with low feedback overhead and with less sensitivity to channel aging and feedback error.", "\nHowever, there is still a need for more efficient CoMP systems." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0006205142708495259, 0.000624363194219768, 0.0006164713413454592, 0.0007079630740918219, 0.0006135952426120639, 0.0006427164771594107, 0.0006090939277783036, 0.0007437177700921893, 0.000607253226917237 ]

[ "The myth of self-management\n\nThe following is an article originally written for the RCP(OC)‘s Arsenal Magazine in 2004. ", "It is written by Christophe Jacobson.", "\n\nThe majority of men and women are forced to live under capitalism. ", "Because of an unfavorable strength balance under capitalism, the proletariat is forced to consider its liberation only through its immediate living conditions. ", "To say the least, the proletariat is the prisoner of a system which leaves it very few occasions of escaping.", "\n\nDoing away with capitalism is the main task of the proletariat. ", "But to eliminate a system so powerful that it will relentlessly defend itself and will not let the exploited organize, more than good intentions are needed: a clear separation must be drawn at all levels (theoretical, practical, organizational) from the bourgeoisie. ", "As long as the bourgeoisie will prevail, this separation will need to neverendingly be started over. ", "It is not spontaneous, neither is it innate within the proletariat: it requires going back more than once on questions that seemed resolved, reexamining, re-doing.", "\n\nUtopia and revolution\n\nFrom its beginnings as the proletariat’s revolutionary theory, Marxism distinguished itself from utopian socialism, especially from that of Proudhon (1809-1865)’s followers, then those of Bakunin (libertarian communists and anarchosyndicalists), on the central issues of the goals, means and objectives of the revolution. ", "This boundary between anarchists and communists, between utopian socialism and scientific socialism still prevails, although in a different manner.", "\n\nIn the history of the proletariat and its struggle for communism, in the general history of the proletarian revolutionary movement, few issues were the subject of as many debates as the one over the content of the period which follows capitalism and leads to communism. ", "While being opposed on this question, anarchists and communists have at least one thing in common: the objective of a free, equalitarian society rid of any form of exploitation and state. ", "But from that goal, anarchists have made a utopia: communists a revolutionary project. ", "This is a fundamental difference which reflects in all domains of revolutionary activity.", "\n\nFrom historical experience, communists draw the following teachings: the proletariat cannot ignore to exert an integral dictatorship over the bourgeoisie in every field and at each step of development of the revolution. ", "Any important change to the bourgeois system of property over the course of history, as much as through the substitution of slavery by the feudal system, as that from feudalism to capitalism, invariably began by the conquest of power, which supporting itself by the strength of the conquering, proceeded with the transformation of property on a large scale, to consolidation and development of the new property system.", "\n\nWhat the dictatorship of the proletariat made up of? ", "Marx gave the most succinct description: “What I did that was new was to prove: 1) that the existence of classes is only bound up with particular historical phases in the development of production, 2) that the class struggle necessarily leads to the dictatorship of the proletariat, 3) that this dictatorship itself only constitutes the transition to the abolition of all classes and to a classless society.”", "\n\nTo this conception, libertarian communists oppose their own vision of an anti-authoritarian socialism which aims to be “a radical change of society concretizing workers’ spontaneous socialism, realizing libertarian and equalitarian aspirations so often expressed into the exploited’s class-struggle and into the oppressed and women’s emancipation fights.” ", "This project could be realized “because production intercourses, the wage-earning intercourse are broken, because big means of production are socialized, collectivized at the basis and not under state-control, because autogestion [self-management] substitutes to the ruler/ruled people intercourse, and because thus, the social division into antagonistic classes is replaced by a reunifying human community, socially and politically equal and free.” ", "Finally, anti-authoritarian socialism would be “an authentic democracy, because the state mechanic-i.e. the exploiting classes domination mechanic-is broken, replaced by a federalist organization of society and by generalized autogestion, exercized on every bid decision, the actual collective sovereignty, the ‘down to up’ or ‘from the periphery to the center’ democracy, the power to the basis Assemblies and to their freely associated Councils.” “", "From this follows that the new power will not exclusively be the proletariat’s power-even if it weighs in it in a decisive manner-and even less its dictatorship…”\n\nThese quotes are from the Manifesto for a Libertarian Alternative from the French organization of the same name (“Alternative Libertaire“, or AL). ", "From these is drawn the libertarian communist vision of transition to communism whose merit is at least to be written on paper. ", "AL claims 1) that there is no State-run transitional society between capitalism and communism; and 2) that self-management, practiced on a large scale, insures this transition.", "\n\nWe will draw our attention to these two elements demonstrating that anarchist theses, when put to the test, contradict objective reality on every point. ", "That the anarchist doctrine, as Lenin wrote over 100 years ago, “has produced nothing but general platitudes against exploitation. ", "These phrases have been current for more than 2,000 years. ", "What is missing is (alpha) an understanding of the causes of exploitation; (beta) an understanding of the development of society, which leads to socialism; (gamma) an understanding of the class struggle as the creative force for the realization of socialism.”", "\n\nProtest struggle and revolutionary struggle\n\nBeaten in its overt form of refusal to engage in the political struggle, the anarchist utopia of social revolution without political revolution, of creating a classless society without a stage in which the proletariat exerts its political leadership onto the whole masses (hence the dictatorship of the proletariat) reappeared under the guise of merging protest struggles and revolutionary struggle, as if both were the same thing and took the same shape.", "\n\nContrary to anarchists, Marxists always took good care of distinguishing the masses’ protest struggles (waged in order to keep or win gains, improvements from the bourgeoisie, forcing it to act against its immediate interests) and the revolutionary struggle led by the communists and the proletariat to conquer political power, eliminate the bourgeoisie and its state, establish the dictatorship of the proletariat to then make ahead towards communism. ", "Between these two forms of struggle, there is a qualitative leap the anarchist movement completely ignores, refuses to make or shows itself incapable to accomplish.", "\n\nFor the anarchist movement, protest struggles simply have to go beyond the framework imposed by the ruling class and become less and less compatible with capitalism to see “counter-powers” spontaneously erupt within the base which is challenging the state. ", "However, all of historical experience showed, costing the lives of thousands of revolutionaries, that revolution doesn’t erupt simply from a multiplication of protest struggles, however radical they may be (let’s just think of Argentina), but that it needs the unification of various objective factors: 1) an economical and political crisis which affects all classes; 2) the incapacity for the bourgeoisie to maintain its domination intact; 3) the incapacity for the proletariat and the masses to live like before; and a subjective factor: 4) the existence of a revolutionary political leadership, a Communist Party.", "\n\nBy not distinguishing the revolutionary struggle from protest struggles, the anarchist movement is brought to oscillate between direct action (dead propaganda) and an anarchosyndicalist strategy articulated around following the organized workers’ movement and on the exaltation of all struggles carried by trade unions. ", "This alternative is significantly reproduced in all of anarchism’s history (from the Bonnot gang to revolutionary trade-unionism in France, from attacks to anarchosyndicalism in Spain, etc.).", "\n\nA necessary political detour\n\nAccording to anarcho-communists, the protest and social struggle leads to socialization of means of production, which would not be a concentration of the latter into the hands of the state, but rather collectively possessed by the whole of society, global self-management of production, and self-management of each unit by those employed by it. ", "Everything looks fine on paper, but one essential issue remains: if government was to be abolished, the economy collectivized and self-managed, would exploitation and capitalism be eliminated?", "\n\nIt is paramount to answer this question because it is the basis of the whole world conception of anarcho-communists since Proudhon, who claimed that society could develop on the basis of relationships among producers and between producers and consumers, independently from the state. ", "Leaning on this notion, Bakunin then developed the idea of federalism based on workers’ associations or companies, linked to one another, but free and independent in their decisions, property being managed on a collectivist basis.", "\n\nTo answer our questioning, a sufficiently complete example must be found in history to drive any teachings. ", "Does this example exist? ", "Yes, it does in the Spanish Civil War (1936-1939) which gives the most advanced example of self-managed anarchist communes, which embraced both agriculture and industry, countryside and cities, on a massive scale. ", "Despite all precautions that have to be taken due to this experience’s short life span, many teachings can be deducted from it, especially since anarchists are using it as an example and have made it “their revolution”. ", "However, as we will see, history’s irony wanted-as is always the case each time doctrinaries come to power-that the Spanish anarchists had to do the opposite of what their doctrinary school taught them; in fact, they prove incapable of mobilizing the masses when they were confronted with the fundamental problems of transforming capitalism into communism.", "\n\nIn Spain, just before the bourgeoisie’s attack led by Franco, anarchists were leading the most important mass trade union (the CNT had more than one million members) and had a political apparatus, despite what they claim, with the Federación Anarquiste Ibérica (FAI). ", "In a dominating position, anarchists had the organizational capacity and the possibility to lead the proletarian and peasant masses to assault the bourgeois state, which they refused to do, conforming to their doctrinary apolitical stance. ", "The Spanish Civil War was thus imposed by the bourgeoisie, depriving the proletariat and peasantry from the initiative.", "\n\nFrom the first days of the civil war, the void left on Republican terrain by the fleeing of thee bosses’ and administrative authorities allowed the proletariat and peasantry to easily take over economic power; but once that done, they still had to resolve the difficulty of defending and maintaining the new society. ", "Which depended on the constitution of a genuine proletarian power capable of consolidating the gains and beat the enemy!", "\n\nWith self-management, did production escape the laws of capitalism?", "\n\nSpanish anarchists believed, like today’s ones, that a system of autonomous self-managed communes, with the weakest links between each other, was the alternative to capitalism and Marxism. ", "Hence they thought that as soon as they had collectivized villages in the countryside and places of work in the city, they would have, they thought, suppressed inequalities, capitalism, money, government, the state. ", "But this prove to be untrue.", "\n\nAnarchist comrades should have rather known that when production is the result of small (or large) independent companies, whether managed by a capitalist or a workers’ collective, this production does not lead to more freedom, but quite the opposite: it becomes the most firm basis of development for exploitation and capitalism. ", "Self-management within the federalist framework promoted by anarchists (allowing thousands of businesses, factories and proletarians to be linked not by a conscious and discussed plan, but by the sole forces of the market) though the result of thousands of transactions between these small groups, will constantly regenerate capitalism, divisions between the poor and rich and finally end up with monopolies.", "\n\nWhat we will try to shed some light on is that despite the incredible heroism of anarchist activists, the anarchist project in Spain failed because the material bases which gave birth to capitalism, social classes, the capitalist state, are compatible with production, even collectivized. ", "Anarchism failed because it saw in small affinity or production groups (basic assemblies) self-sufficient units, while only proletariat in its entirety-by building its party and leading the revolutionary struggle-can get to control and master the economy, restricts the bourgeois right and at the same time overcome its own exploitation (which is the content of the dictatorship of the proletariat). ", "Finally, anarchism failed because it did not understand the link between freedom and mass revolutionary activity; by the fact, it reflects the bourgeois ideology of “everybody for himself”.", "\n\nMore specifically, the forces of capitalism (market laws) rapidly asserted themselves within communes led by anarchists. ", "These forces were not mainly linked to difficulties of the civil war, but by economical relationships (or absence of) between communes. ", "The communes’ incapacity to overcome inequalities, as with other problems, was noticed by all serious civil war commentators, from various tendencies, and even by some leaders of the CNT. ", "This cannot be denied, except by those who are turning Spain into an Eldorado of revolution but refuse to study what actually happened.", "\n\nThis incapacity to overcome inequality does not mean that the communes were a failure. ", "Some functioned well, others not: positively, they allowed the masses to take charge of business and demonstrating that proletarians could continue production without bosses. ", "But at this point, it is only was a means of struggle, nothing more.", "\n\nAbolishing the state\n\nTaking control of factories and various workplaces is an inevitable step in the revolutionary process. ", "But to stop there necessarily means that one does not understand the requirements of revolution and the tasks to be accomplished to really abolish capitalism. ", "As Lenin explained, what is to be done is to transit “from the very simple task of further expropriating the capitalists to the much more complicated and difficult task of creating conditions in which it will be impossible for the bourgeoisie to exist, or for a new bourgeoisie to arise“.", "\n\nFor the proletariat, it is necessary to repress the bourgeoisie and counter-revolution, to expropriate the upper bourgeoisie, among others banks, major industries and communication networks; to nationalize real estate and other major assets, lands, subsoil and waters; to develop social and collective property of the main means of production; to constitute in all units of production a leadership that will act in the general interest of the proletariat i.e. in the goal of satisfying collective means and serve world revolution; to manage companies according to a national plan and local plans that assign tasks to be accomplished, allocate resources and determine the destination of products.", "\n\nThis demands a proletarian state, since production relationships will not be able to be transformed completely and at all levels at the first attempt; consequently, classes will subsist. ", "Forms of small production will also subsist (let us think of the thousands of small businesses), as repartition according to work, in opposition to needs, will be maintained. ", "Inequalities will persist, for example between those who lead and those who execute.", "\n\nThe anarchist theory during the civil war, as for today, was allergic to all forms of state, centralism and central planning. ", "For anarchism, centralism and democracy are basically incompatible. ", "Facing the necessity of making the communes work with one another, anarchists did not see that revolution required in the first stage a strategic centralization which lays on grassroots initiatives. ", "Instead of directly (by authority, we would say) and globally taking productive forces, they preferred letting things go, hoping that coordination if necessary between communes would easily be attained through “mutual aid” or “voluntary cooperation” or, in the worst case, by the weakest possible Federalism.", "\n\nThe capitalist state is certainly a monster, but this monster did not simply appear out of nowhere. ", "The state appears when society divides into classes with irreconcilable interests and is always the ruling class’s state, i.e. the bourgeoisie under capitalism. ", "This division between antagonistic classes is itself the fruit of production’s development; this production and the forces that allow it are under the control of one class, that of the capitalists.", "\n\nRevolutions from the last century taught us that the proletariat cannot hope to reverse the situation unless it becomes the ruling class. ", "By refusing to support the proletariat’s state and proletarian democracy (dictatorship of the proletariat) in the transition phase towards communism, simply be denying the need itself for this transition, the anarchist movement was brought to participate, defend and spare the capitalist state. ", "Confronted with the need for coordination and planning encompassing all of the proletarian and peasantry, anarchists were progressively brought to adopt their adversaries’ plans, among others those of the liberal bourgeoisie. ", "This was not a tactical withdrawal meant to favor alliances with other forces to beat the bourgeois army (which is admissible and even in this case necessary), it simply is that anarchists had no independent idea about how to accomplish the necessary centralization.", "\n\nOne could oppose to us that communes in Spain had little time to develop. ", "However, for more than a year, anarchists nearly had carte blanche to develop communes in the Aragon and Levante regions and in the Barcelona industrial area and, from the beginning, difficulties linked to planning and centralization were experienced. ", "There are good reasons to believe that the problem would only have gotten worse had the experienced lasted.", "\n\nEliminating inequalities\n\nIn its manifesto, Alternative Libertaire states that Federalism leads to “stabilized structuration of society“. ", "Coordination of production is done by federations and branches. ", "Precisely, during the Spanish Civil War, one of the objectives of the communes, set by anarchists themselves, was to insure equality for all participants; and one of the privileged instruments to reach this objective were federations and branches. ", "Anarchist activists believed that living conditions between communes would rapidly equalize on the basis of “mutual aid”. ", "Here again, we must admit that it did not happen.", "\n\nIn the countryside, communes were organized in a very different way. ", "In some cases, the commune’s merchandise was centralized in a warehouse; in others, it was not the case. ", "Disparities rapidly established from commune to commune, and from factory to factory. ", "Some communes could count on a much superior income than the poorest ones.", "\n\nBut where did “mutual aid” go, which communes had to commit to each other? ", "The answer is simple: communes, afraid of seeing landowners taking back their land, were more prone to send any surplus to the city or the Front rather than to one another. ", "To insure the cities’ and the Front’s supply, columns of anarchist militia were used (small detail, these militia people charged with supplying the cities and whose members did not come from these communities, were they not like an armed force separated from the population-and is it not true that this separation of the armed forces from the people is the basis of… the state?). ", "But when time came to attack discrepancies between communes-a task too strenuous, sensitive and complex to be accomplished by mobile militia columns-very little was done. ", "It is precisely what happened in Aragon and Levante, the two areas where land collectivization went the furthest, and this even if regional federations took redistribution between communes very seriously (it was even seen as being their main task). ", "Variations between communes probably indicated historical inequalities, but also reflected the minor role played by the redistribution organized by federations.", "\n\nThe same phenomenon occurred in collectivized factories in Barcelona, which was the main center of anarchist industrial communes. ", "Proletarians had control of the factories, but on the basis of the same anarchist principles applied in the countryside, it proved impossible to establish lasting cooperation.", "\n\nMore concretely, the anarchist theory brought proletarians to consider their factory as the possession of those who worked in it rather than property of the whole proletariat. ", "While unemployment was high, proletarians in collectivized shops tended more often than not to proceed to improve their own working conditions (better wages, social programs) than to distribute their advantages with other proletarians. ", "As with agricultural communes, great disparities lasted between working proletarians and unemployed ones, between proletarians from strategic sectors (thus better paid) and those from secondary sectors.", "\n\nFacing the difficulties of organizing sustainable cooperation between collectivized factories in Barcelona, how did anarchists react? ", "Despite their declarations against money, they used the same tools as capitalism, namely a central labour bank, an economic council, credit, cash purchases, demand, etc. ", "Not only could they not eliminate accounting, money, they also had to organize forms of banking and financial operations.", "\n\nOne of the most striking effects of the increasing polarization between collectivized workplaces was the loss of independence for many of them. ", "The poorest collectivized workplaces not having the necessary funds to pay wages, got these funds by mortgaging their workplace’s equipment, as well as their warehoused material with the bourgeois Catalan government. ", "One by one, workplaces passed from proletarian hands to those of the bourgeoisie without the latter playing any role in this, except that of a pawnbroker.", "\n\nSuppressing money\n\nLet’s take a look at money. ", "Anarchists believed that taking control of workplaces and villages would suffice to eliminate money. ", "For example, in Binéfor, like in 450 other collectivized towns in Aragon, money was declared abolished. ", "An economy totally based on barter being impracticable, the Committee thus proceeded to emitting notes of 5, 6 and 7 pesetas each. ", "The value of each male person’s work was set at 7 pesetas, and that of women at… 5 pesetas. ", "The old currency not being seized, a black market bloomed.", "\n\nSo, after announcing that money was suppressed, the autonomous commune’s local committee proceeded with emitting local notes which worked for locals like money. ", "Ironically, the fact these notes played the same role as money never struck the anarchists. ", "For them, money was national bank notes, while the local currency, to their eyes, was not. ", "The emission by several communes of differently valued notes had as a consequence to make exchanges between communes more difficult. ", "Many people in the communes were led to think that a national currency was maybe not such a bad thing. ", "The main point here is that anarchists struggled against outside aspects of money-a bank note emitted by capitalist financial institutions-and not against the social and production relationships brought by money.", "\n\nOnce more, we have to pinpoint that the problem is not that anarchists failed to accomplish the impossible-immediate abolition of money. ", "From the Marxist theory’s point of view, it is not surprising that money cannot immediately be abolished. ", "The problem is not the practical measures taken (rationing of first necessity goods, various free-of-charge services, etc.) ", "either. ", "The problem lies in the anarchist theory itself. ", "When the objective reality came to crush all of the anarchist dogmas, they found themselves facing a difficult choice: taking control of the economy and carrying out the dictatorship of the proletariat in alliance with the peasantry, or leaving the bourgeoisie to take over control; and it was the second option that won because for them, centralization was a synonym of authority, which was in their eyes equivalent to capitalism.", "\n\nThe dictatorship of the proletariat\n\nMarxism identifies the need for a relatively protracted period of transition between the beginning of the social revolution and the accomplishment of a classless society which has eliminated government, money, etc. ", "During this period, proletarians must learn to lead society, thus surpassing capitalism. ", "Productive forces must also be developed enough to eliminate the risk of shortages from the masses. ", "During this period, society’s division into classes must be practically overcome before the proletariat can avoid using a state revolutionary machine.", "\n\nAs Lenin taught: “…during every transition from capitalism to socialism, dictatorship is necessary for two main reasons, or along two main channels. ", "Firstly, capitalism cannot be defeated and eradicated without the ruthless suppression of the resistance of the exploiters, who cannot at once be deprived of their wealth, of their advantages of organization and knowledge, and consequently for a fairly long period will inevitably try to overthrow the hated rule of the poor; secondly, every great revolution, and a socialist revolution in particular, even if there is no external war, is inconceivable without internal war, i.e., civil war…”\n\nAs it is said in the RCP(OC)’s Programme: “The state that keeps on existing during the socialist phase but that will progressively “wither away” must lead the masses into assuming leadership of society. ", "The conditions to allow them to do this must be set. ", "This will require spare time for the masses (provided by the reduction of the working week); a collective take over of household chores; the furnishing of tools such as ink, paper and places to hold meetings must also be provided so they can express themselves freely, etc.", "\n\n“They must also work in destroying privileges that are imparted to those who are in positions of leadership. ", "One way to do this is to enable them to vote and to revoke leaders. ", "The reduction of salary disparities between leaders and the proletarian masses and the participation of managers in labour are also tasks that will have to be undertaken.", "\n\n“In the long run, everyone must assume leadership. ", "Not only that of a firm or of a neighborhood (although this will be a necessary step in the process of learning), but equally that of society as a whole. ", "This means the organization of its activities and the mastery of the direction it will be headed for.", "\n\n“In order to make this type of participation possible, and to insure it is something authentic and unlike the bogus consultations the capitalists hold on occasion for the people to give them the impression that they are partaking in a democratic process, the State itself must undergo change. ", "It must give birth to new types of leadership, based on the participation of the masses.”", "\n\nDisarmed before the tasks brought by the revolution, without a theory that is not a dogma but rather a guide for action, the anarchist movement resembles Don Quijote, a great reader of chivalry novels who decided to leave for adventure, conquer glory by valorous deeds and save the world. ", "Like many before him, he will pursue his quest to the end, deluded with his dreams, reinventing the world. ", "Like Don Quijote fighting with flocks of sheep he took for enemy armies, windmills become giants, the anarchist movement stayed too long on the surface of things: while it thought abolishing inequalities, they reappeared; when it thought it had abolished money, one sees it reappear; the State was thought to have vanished, however proletarians were forced to mortgage machinery to it. ", "By paying more attention to form rather than foundation, drawing no lessons from the past, anarchism proved its limits, which we absolutely must overcome.", "\n\n1) On September 24, 1936 in a congress of the CNT’s Catalonia Regional Federation in which 500 delegates took part, the long debate in the anarchosyndicalist movement between political and apolitical stance was for the first time clearly resolved in favor of the former. ", "For the sake of antifascist war and syndicalist revolution, the congress decided to participate in the Generalitat cabinet. (", "The Generalitat was the legislative power also known as the Parliament of Catalonia. ", "The 1932 Statute of Autonomy granted Catalonia’s Parliament its own justice system [with High Court] and its own police force.)", "\n\n2) Evidence of difficulties in the union-controlled economy soon came in abundance. ", "The Republican Minister of Industry reported that by January 1937 he had received petition asking for state intervention in no less than 11,000 enterprises (Juan Peiró, De la fábrica de vidrio de Mataro al Ministerio de Industria – Valencia 1937)." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006029109354130924, 0.0007723862072452903, 0.04119015857577324, 0.0006670242291875184, 0.011203388683497906, 0.008114777505397797, 0.0008304556831717491, 0.0010620802640914917, 0.0007666726596653461, 0.000674178940244019, 0.0009708996512927115, 0.0006980148609727621, 0.0014497289666906, 0.0009542473708279431, 0.0005687992088496685, 0.000818636966869235, 0.000601937179453671, 0.004165492486208677, 0.0011023050174117088, 0.002406167797744274, 0.0006676118355244398, 0.0007778212893754244, 0.0006884302711114287, 0.0006990746478550136, 0.0007814305135980248, 0.0007941100047901273, 0.0016088747652247548, 0.0006190791027620435, 0.0006938183214515448, 0.0008060321561060846, 0.0033658144529908895, 0.0008429554873146117, 0.0008890281897038221, 0.0007282720762304962, 0.0008257522713392973, 0.0006347467424347997, 0.0009246175759471953, 0.0005967188626527786, 0.0006499917944893241, 0.0007435097359120846, 0.0005610464722849429, 0.000722284079529345, 0.0006184041849337518, 0.00064131582621485, 0.0008298545144498348, 0.0009779242100194097, 0.002251849276944995, 0.0027465117163956165, 0.000984401791356504, 0.002056918339803815, 0.0008467250154353678, 0.001264343038201332, 0.0007421293994411826, 0.0008394147153012455, 0.0011341776698827744, 0.00099854520522058, 0.0005703847273252904, 0.001221017329953611, 0.0010779713047668338, 0.0007323491154238582, 0.0005857986980117857, 0.0007735551334917545, 0.0009316554642282426, 0.018981846049427986, 0.0007201291155070066, 0.0006717114010825753, 0.0006894499529153109, 0.0007240328122861683, 0.0007455986342392862, 0.0009274472831748426, 0.0006765475263819098, 0.0006009392091073096, 0.0006908255163580179, 0.0009324676939286292, 0.000952565111219883, 0.000836586463265121, 0.0006850240752100945, 0.01487395167350769, 0.0008009985904209316, 0.0008829986909404397, 0.0008873076876625419, 0.0018515227129682899, 0.001256004674360156, 0.0008845325210131705, 0.0007712987717241049, 0.0007273267256096005, 0.0006653252639807761, 0.0009238110505975783, 0.0005619017174467444, 0.0006498016300611198, 0.0007381231989711523, 0.0007086306577548385, 0.0005592944216914475, 0.0006072468822821975, 0.0008796678157523274, 0.014406277798116207, 0.0009000182035379112, 0.0007477111066691577, 0.0009534857817925513, 0.0007746067130938172, 0.0006075400160625577, 0.0005526479799300432, 0.0007078534690663218, 0.0006133877323009074, 0.0008025175193324685, 0.0013157931389287114, 0.0007336249691434205, 0.0006371426279656589, 0.0006954239797778428, 0.000682511948980391, 0.0006946618668735027, 0.010405662469565868, 0.0016523334197700024, 0.004315763711929321, 0.0022652798797935247, 0.000662249221932143, 0.0009368449682369828, 0.0051287137903273106, 0.0029763325583189726, 0.0005850226152688265, 0.0008782135555520654, 0.0007059604395180941, 0.0005418888758867979, 0.0006027073250152171, 0.0009008387569338083, 0.0013743580784648657, 0.0008484460413455963, 0.0006871068617329001, 0.0009737571817822754, 0.0013939880300313234, 0.0030118105933070183, 0.0009945238707587123, 0.0008185156621038914, 0.000623117433860898, 0.0011388015700504184, 0.0006251834565773606, 0.002472393913194537, 0.0006036031991243362, 0.0006098572048358619, 0.0009859120473265648, 0.0006733679329045117, 0.0007447088719345629, 0.0006275124032981694, 0.0005936252418905497, 0.0005423914990387857, 0.0008634197874926031, 0.0009455095860175788, 0.0010090464493259788, 0.0033251827117055655, 0.010723152197897434, 0.0006787856691516936, 0.0005767373368144035, 0.0015471427468582988, 0.000730395782738924, 0.0006014276295900345, 0.000606110377702862, 0.0006125980871729553 ]

[ "Mount Katahdin\n\nMount Katahdin ( ) is the highest mountain in the U.S. state of Maine at . ", "Named Katahdin by the Penobscot Native Americans, which means \"The Greatest Mountain\", it is located within Northeast Piscataquis, Piscataquis County, and is the centerpiece of Baxter State Park. ", "It is a steep, tall massif formed from a granite intrusion weathered to the surface. ", "The flora and fauna on the mountain are typical of those found in northern New England.", "\n\nKatahdin was known to the Native Americans in the region, and was known to Europeans at least since 1689. ", "It has inspired hikes, climbs, journal narratives, paintings, and a piano sonata. ", " The area around the peak was protected by Governor Percival Baxter starting in the 1930s. ", "Katahdin is the northern terminus of the Appalachian Trail, and is located near a stretch known as the Hundred-Mile Wilderness.", "\n\nIn 1967, Mount Katahdin was designated as a National Natural Landmark by the National Park Service.", "\n\nThe mountain is commonly called just \"Katahdin\", though the official name is \"Mount Katahdin\" as decided by the US Board on Geographic Names in 1893.", "\n\nGeography\n\nKatahdin is in Baxter State Park, which is in east central Piscataquis County, about northwest of Millinocket. ", "It is on the drainage divide between the East and West branches of the Penobscot River.", "\n\nThe mountain massif itself consists of multiple peaks. ", "Baxter Peak is the tallest, and is the official northern terminus of the Appalachian Trail. ", " South Peak and Pamola Peak are southeast and east of Baxter Peak, respectively, along the Knife Edge ridgeline, while Hamlin Peak lies to the north.", "\n\nThe third highest mountain in Maine, Sugarloaf Mountain at 1,295 m (4,250 ft), is over one hundred miles to the southwest. ", "There is low lake country to the south and west of Katahdin, and lowlands extending east to the Atlantic and north to the Saint Lawrence River in Canada.", "\n\nIt is commonly thought that Katahdin is the first place in the United States mainland to receive sunlight in the morning, but this is incorrect. ", "Other mountains, lower in elevation but farther to the east or southeast, depending on the season, see the first sunrise of the day.", "\n\nNatural history\nKatahdin is part of a laccolith that formed in the Acadian orogeny, when an island arc collided with eastern North America approximately 400 million years ago. ", "On the sides of Katahdin are four glacial cirques carved into the granite by alpine glaciers and in these cirques behind moraines and eskers are several ponds.", "\n\nIn Baxter State Park, many outcrops of sedimentary rocks have striations, whereas Katahdin Granite and Traveler Rhyolite lava have weathered surfaces on which striations are commonly not preserved. ", "Bedrock surfaces of igneous rocks which have been buried by glacial sediments and only recently exposed have well preserved striations, as in the vicinity of Ripogenus Dam. ", "Several outcrops of sedimentary rocks along the Patten Road show striations, especially on the north side of the road at Hurricane Deck. ", "A few outcrops near the Pattern Road just north of Horse Mountain are striated, as are several outcrops of sedimentary rocks along the road from Trout Brook Farm northward to Second Lake Matagamon.", "\n\nFauna include black bear, deer and moose as well as black flies and mosquitos in the spring. ", " A subspecies of Arctic butterfly, known as the Katahdin Arctic (Oeneis polixenes katahdin) is specific to the area, and is currently listed as endangered.", "\nAmong the birds are Bicknell's thrush and various songbirds and raptors. ", "A study of the animal communities was published by Irving H. Blake in 1926. ", "The flora includes pine, spruce, fir, hemlock, beech, maple, birch, aspen, and Diapensia lapponica.", "\n\nHuman history\n\nKatahdin is referred to 60 years after Field's climb of Agiokochuk (Mount Washington) in the writings of John Gyles, a teenage colonist who was captured near Portland, Maine in 1689 by the Abenaki. ", " While in the company of Abenaki hunting parties, he traveled up and down several Maine rivers including both branches of the Penobscot, passing close to \"Teddon\". ", " He remarked that it was higher than the White Hills above the Saco River.", "\n\nAmong some Native Americans, Katahdin was believed to be the home of the storm god Pamola, and thus an area to be avoided.", "\n\nThe first recorded climb of \"Catahrdin\" was by Massachusetts surveyors Zackery Adley and Charles Turner, Jr. in August 1804. ", " In the 1840s Henry David Thoreau climbed Katahdin, which he spelled \"Ktaadn\"; his ascent is recorded in a well-known chapter of The Maine Woods. ", " A few years later Theodore Winthrop wrote about his visit in Life in the Open Air. ", " Painters Frederic Edwin Church and Marsden Hartley are well-known artists who created landscapes of Katahdin. ", "On 30 November 2011, Christie's auctioned Church's 1860 painting Twilight (Katahdin) for $3.1 million.", "\n\nIn the 1930s Governor Percival Baxter began to acquire land and finally deeded more than 200,000 acres (809 km2) to the State of Maine for a park, named Baxter State Park after him. ", " The summit was officially recognized by the US Board on Geographic Names as \"Baxter Peak\" in 1931.", "\n\nRecreation opportunities\nAs the northern terminus of the Appalachian Trail and southern terminus of the International Appalachian Trail, Katahdin is a popular hiking and backpacking destination and the centerpiece of Baxter State Park. ", "\nBaxter State Park is open year-round, though strictly regulated in winter. ", " The overnight camping season is from May 15 to October 15 each year. ", " Capacity limits have been placed on day use parking at the trailheads to minimize the overuse of trails.", "\n\nMt. Katahdin has several trails leading up to Baxter, Pamola, or Hamlin Peaks These trails start right up the mountain, but each trail on the mountain ends up taking eight to ten hours round-trip depending on ability. ", "The rest of the trails go up the north side or west side of the mountain. ", "These are accessed from the Chimney Pond Trail. ", "For these trails, hikers must park at the Roaring Brook Campground and hike in. ", "All trails are maintained by the Baxter State Park Authority, which runs the State Park. ", "All of the trails on the mountain are classified as very strenuous, the highest classification the Park Authority gives, except for Saddle (strenuous), Hamlin Ridge trail (moderate), and Chimney Pond (moderate).", "\n\nThe most famous hike to the summit goes along Knife Edge, a glacial Arête which traverses the ridge between Pamola Peak and Baxter Peak. ", " The mountain has claimed 23 lives since 1963, mostly from exposure in bad weather and falls from the Knife Edge. ", "For about 3/10 of a mile the trail is 3 feet wide, with a drop off on either side. ", " The Knife Edge is closed during periods of high wind.", "\n\nNamesakes \n Two US Navy ships have been named USS Katahdin. ", "Katahdin is also the name of a 1914 steamboat (later converted to diesel) owned by the Moosehead Marine Museum that plies the waters of Moosehead Lake in northern Maine.", "\n The Katahdin potato, which was certified by the U.S. Department of Agriculture in 1932, and is still popular in the Northeastern United States.", "\n The Katahdin sheep.", "\n Composer Alan Hovhaness has composed a sonata for piano in 1987 titled Mt. Katahdin, dedicated to Carleton S. Coon for his 60th birthday.", "\n Katahdin is a monster in 1979 horror film Prophecy.", "\n\nSee also\n\nKatahdin Woods and Waters National Monument\nList of mountain peaks of North America\nList of mountain peaks of the United States\nList of U.S. states by elevation\nList of mountains of Maine\nDonn Fendler, author of book about being lost on Katahdin in 1939.", "\n\nReferences\n\nExternal links\n\n More detailed Wiki on Katahdin Including Trails\n Katahdin Webcam\n Katahdin Webcam - Millinocket\n Katahdin Webcam - Twin Pine Camps, Millinocket\n Katahdin on Peakware (photos)\n Baxter State Park Authority Official Website\n Summit Log (October 2005 summit log)\n Katahdin at Summitpost many photos\n\nCategory:Mountains of Maine\nCategory:Mountains of Piscataquis County, Maine\nCategory:Mountains on the Appalachian Trail\nCategory:Highest points of U.S. states\nCategory:National Natural Landmarks in Maine\nCategory:New England Four-thousand footers\nCategory:North American 1000 m summits\nCategory:North Maine Woods\nCategory:Protected areas of Piscataquis County, Maine\nCategory:Religious places of the indigenous peoples of North America\nCategory:Sacred mountains\nCategory:Devonian magmatism" ]

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

[ 0.0007666474557481706, 0.00110155763104558, 0.0005958319525234401, 0.0006157449679449201, 0.0006164836813695729, 0.0005562550504691899, 0.0005586029146797955, 0.0006702859536744654, 0.0006254694890230894, 0.0005749105475842953, 0.000733812979888171, 0.000994358561001718, 0.0006148647516965866, 0.0006955074495635927, 0.0007992522441782057, 0.000835356127936393, 0.0005984209128655493, 0.0006481291493400931, 0.0005728094256483018, 0.0007364783086813986, 0.0006510662497021258, 0.0007774507976137102, 0.0007098679197952151, 0.000653751427307725, 0.0008636156562715769, 0.002596240257844329, 0.0006010981742292643, 0.016305306926369667, 0.0005700007895939052, 0.0006810594350099564, 0.0006466810591518879, 0.0007748572970740497, 0.0008821237133815885, 0.0007229297189041972, 0.0006552499835379422, 0.0006290327874012291, 0.0005494210054166615, 0.000620083010289818, 0.0005757646285928786, 0.0006815834785811603, 0.0005824521649628878, 0.0006494044791907072, 0.0006809004116803408, 0.0005799907958135009, 0.0007017028401605785, 0.0005517821991816163, 0.0007931170985102654, 0.0005998227279633284, 0.0006205905228853226, 0.0007021192577667534, 0.0006278866203501821, 0.0007107431883923709, 0.0014121580170467496, 0.0007614730857312679, 0.0007615173235535622, 0.0005905319703742862, 0.0007279657293111086, 0.000616042350884527, 0.05165630206465721, 0.0005812315503135324, 0.002254689112305641, 0.0006089569069445133, 0.0005949254846200347 ]

[ "Apostolos of Kilkis\n\nMetropolitan Apostolos (Papakonstantinou) (1924 – 28 September 2009) was the metropolitan bishop of Kilkis from 1991 until his death. ", "He was ordained a deacon in 1950 and a priest in 1954. ", "He was elected and ordained as Bishop of Zakynthos in 1967.", "\n\nReferences\n\nCategory:1924 births\nCategory:2009 deaths\nCategory:Bishops of the Church of Greece\nCategory:Kilkis (regional unit)" ]

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

[ 0.0018085513729602098, 0.0007087907288223505, 0.0008212238317355514, 0.0005585558246821165 ]

[ "More intensive hemodialysis.", "\nClinical outcomes have not improved substantially for patients treated with conventional thrice weekly hemodialysis. ", "More intensive hemodialysis regimens, including daily short dialysis, and nocturnal prolonged dialysis show promise to improve morbidity and mortality. ", "Published studies and trials underway examining these therapies are reviewed." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.000897743389941752, 0.0008031956967897713, 0.0016237784875556827, 0.0005239215097390115 ]

[ "MIXED NUTS!", "\n\nSHOW DESCRIPTION\n\nTwo titans of sketch comedy come together for an evening of hilarity!", "\n\nOn Saturday, March 10th The Company and SWAG will come together to showcase the best sketch comedy in the Southwest corner of Ohio! ", "Mixed Nuts will be an evening of double-sized portions of comedy. ", "2x the sketches! ", "2x the funny! ", "2x the panda costumes!", "\n\nThe performance will be at Clifton Performance Theater (404 Ludlow Ave, Cincinnati, OH 45220), with doors opening at 7:30, and the show starting at 8. ", "Tickets are only $10, and CPT will have concessions available for donations! ", "Buy your tickets now via the box office on our website. ", "Don’t miss it!", "\n\n(Please note that the show will feature adult humor and will not be suitable for children or anyone that might be offended by crude jokes and profanity.)" ]

{ "pile_set_name": "Pile-CC" }

[ 0.1048782542347908, 0.0007229968905448914, 0.0007801562896929681, 0.0009116915753111243, 0.001700998400337994, 0.0022729479242116213, 0.0017626381013542414, 0.0005696515436284244, 0.0007018640171736479, 0.0010518383933231235, 0.007210883777588606, 0.001588995917700231 ]

[ "When a woman is horny enough, she doesn't need to wait for her man to come home because she will make good use of her favorite dildo and collection of sex toys, and you can watch every minute of her pleasure. ", "See how creative they get once their rubber is lubricated, and they make sure to spread their legs right in front of their webcam for you to have a closeup of all the action. ", "See them start by slowly rubbing their sensitive clits while simultaneously massaging one of their big boobs. ", "Their pink pussies will quickly start to drip in anticipation, and they will use their dildo to slowly rub the outside of their holes, dipping a little deeper inside each time until they can't resist any longer and have to plunge it deep between their tight pussy lips. ", "Others play with multiple toys at once and will writhe before your eyes with a vibrator stimulating their clits while a plug is penetrating their assholes. ", "These chicks also love to share, so see how they explore each other's tight, toned bodies and dive between each other's legs with fingers, tongues and toys. ", "Spankwire.com wants you to watch it all for free, so tune in to see all the movies." ]

{ "pile_set_name": "Pile-CC" }

[ 0.8650193214416504, 0.0017275926657021046, 0.9743475317955017, 0.9887259602546692, 0.9899994730949402, 0.008166056126356125, 0.0008376864134334028 ]

[ "Get a FREE ACTIVE bracelet on us.", "\n\nAt FitLife, we want to help you achieve your goals.", "\n\nThat's why for a limited-time only we're offering you a FREE Black Active silicon bracelet. ", "Wear it as a reminder to stick to your fitness goals.", "\n\nTake advantage of this deal while supplies last." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.00754527747631073, 0.000575750891584903, 0.013953067362308502, 0.0023175482638180256, 0.0007941395742818713 ]

[ "Q:\n\nBancos de dados para Clientes diferentes\n\nEstou aprendendo MVC 4 e gostaria de saber se existe um jeito de com apenas 1 modelo acessar bancos de dados diferentes?", "\nPor exemplo, eu tenho um sistema online e para cada cliente eu tenho um banco separado.", "\nQual seria a melhor prática para fazer isso?", "\n\nA:\n\nDois cenários:\n1. ", "Um sistema, acessando vários bancos de dados\nDefina um contexto para cada banco de dados:\npublic class Cliente1Context : DbContext\n{\n public Cliente1Context() : base(\"ConnectionStringDoCliente1\") {}\n\n // Definição dos DbSets\n ...\n}\n\npublic class Cliente2Context : DbContext\n{\n public Cliente2Context() : base(\"ConnectionStringDoCliente2\") {}\n\n // Definição dos DbSets\n ...\n}\n\nWeb.config para este caso\n<configuration>\n ...\n <connectionStrings>\n <add name=\"ConnectionStringDoCliente1\" providerName=\"System.", "Data.", "SqlClient\" connectionString=\"Dados da conexão do cliente 1\" />\n <add name=\"ConnectionStringDoCliente2\" providerName=\"System.", "Data.", "SqlClient\" connectionString=\"Dados da conexão do cliente 2\" />\n </connectionStrings>\n ...\n</configuration>\n\n2. ", "Uma instância do sistema para cada cliente\nNeste caso, deve ser um contexto só com uma configuração só:\npublic class SistemaContext : DbContext\n{\n public SistemaContext() : base(\"DefaultConnection\") {}\n\n // Definição dos DbSets\n ...\n}\n\nNo seu Web.config, defina apenas uma Connection String:\n<configuration>\n ...\n <connectionStrings>\n <add name=\"DefaultConnection\" providerName=\"System.", "Data.", "SqlClient\" connectionString=\"Dados da Default Connection\" />\n </connectionStrings>\n ...\n</configuration>\n\nDefina uma configuração para cada cliente. ", "Isso se faz acessando o menu do Configuration Manager:\n\nDefina uma nova configuração:\n\nDigite o nome do seu cliente, por exemplo:\n\nClique com o botão direito no seu arquivo Web.config e escolha a opção Add Config Transform: \n\nRepare que irá aparecer uma variação do seu arquivo Web.config. ", "Isso é o que chamamos de arquivo de transformação:\n\nAbra o novo arquivo de transformação. ", "Repare que dentro dele tem uns exemplos comentados. ", "Basta alterar o exemplo que tem a Connection String para a Connection String do seu cliente:\n<configuration xmlns:xdt=\"http://schemas.microsoft.com/XML-Document-Transform\">\n <connectionStrings>\n <add name=\"DefaultConnection\" \n connectionString=\"Connection String do Cliente 1\" \n xdt:Transform=\"SetAttributes\" xdt:Locator=\"Match(name)\"/>\n </connectionStrings>\n ...\n</configuration>\n\nBasta agora fazer um Build ou um Publish utilizando a nova configuração criada. ", "No caso, \"Cliente1\".", "\nMais exemplos? ", "http://go.microsoft.com/fwlink/?LinkId=125889\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.00270438427105546, 0.012586340308189392, 0.06732494384050369, 0.0008095957455225289, 0.0011309027904644608, 0.0007057390757836401, 0.0006851990474388003, 0.0007057390757836401, 0.0007637910894118249, 0.0014300007605925202, 0.0007057390757836401, 0.0008957159006968141, 0.03217306733131409, 0.0025127502158284187, 0.04444482550024986, 0.0023004671093076468, 0.0007228708127513528, 0.0012579610338434577, 0.000896998739335686 ]

[ "1. ", "Introduction\n===============\n\nSevere early childhood caries (S-ECC) is defined in 3- to 5-year-old children as one or more cavitated teeth, teeth missing due to caries or filled smooth surfaces in primary maxillary anterior teeth, or a decayed/missing/filled tooth score of ≥4 (age 3 years), ≥5 (age 4 years) or ≥6 (age 5 years) \\[[@B1-ijms-15-10766]\\]. ", "It is a particularly aggressive form of dental caries affecting the primary teeth of young children and has become a serious public health problem. ", "It is well-known that the mutans streptococci, including *Streptococcus mutans* and *Streptococcus sobrinus*, are the major pathogens of S-ECC \\[[@B2-ijms-15-10766],[@B3-ijms-15-10766],[@B4-ijms-15-10766]\\]. ", "Apart from this, many researchers have focused on other species involved in the microbial etiology of S-ECC \\[[@B5-ijms-15-10766],[@B6-ijms-15-10766]\\]. ", "Analysis of epidemiological data has shown that *Candida albicans* can be detected in saliva, dental plaque and caries lesions. ", "The frequency of *C. albicans* in samples obtained from those in the ECC group was higher compared with that from the caries-free group \\[[@B4-ijms-15-10766],[@B7-ijms-15-10766],[@B8-ijms-15-10766],[@B9-ijms-15-10766]\\]. ", "Therefore, it is suggested that there is a significant association between the presence of *C. albicans* and early childhood caries.", "\n\nThe secreted aspartyl proteinases (Saps) are among the most important virulence factors of *C. albicans*, and are related to the adhesion of *C. albicans* to tooth surfaces and the degradation of extracellular matrix and proteins. ", "The SAPS proteins, encoded by a family of 10 *Sap* genes \\[[@B10-ijms-15-10766],[@B11-ijms-15-10766]\\], can be classified into several distinct groups according to sequence homology. ", "The different members of the Sap family might be differentially expressed depending on environment and host conditions. ", "For example, in the study by Naglik *et al*. ", "\\[[@B12-ijms-15-10766]\\], saliva from patients with oral *C. albicans* infection and those with asymptomatic Candida carriage was collected, and the results suggested that *Sap2* and *Sap4* to *Sap*6 were the predominant proteinase genes expressed in the oral cavity of patients with oral candidiasis and those who were Candida carriers. *", "Sap1* and *Sap3* transcripts were observed only in affected patients. ", "In another study, carried out in a reconstituted human epithelium (RHE) model, the results showed that expression of *Sap1* and *Sap3* was higher than that of *Sap2* and *Sap6* \\[[@B13-ijms-15-10766]\\]. ", "Until now, such research has focused mainly on the transcript levels of SAPS from oral candidiasis, vaginal candidiasis, oropharyngeal candidiasis and gastrointestinal candidiasis \\[[@B12-ijms-15-10766],[@B14-ijms-15-10766],[@B15-ijms-15-10766],[@B16-ijms-15-10766],[@B17-ijms-15-10766]\\]. ", "However, the enzyme activity and gene expression of *Saps* in samples obtained from dental biofilm and their relationship with S-ECC are still unknown.", "\n\nIt is hypothesized that, in different genotypes of *C. albicans*, the enzyme activity and gene expression of *Saps* associated with the development of S-ECC are variable.", "\n\nIn this study, strains and genotypes of *C. albicans* from dental biofilm of children with S-ECC were isolated and identified. ", "We detected the enzyme activity of Saps by both the yeast nitrogen base-bovine serum albumi YNB--BSA agar plate method and by the MTT method, with BSA as the substrate. ", "Gene expression of *Sap*1--5 in genotypes of *C. albicans* was evaluated by reverse transcription polymerase chain reaction (RT-PCR).", "\n\n2. ", "Results and Discussion\n=========================\n\n2.1. ", "The Enzyme Activity of Saps Determined by the Yeast Nitrogen Base--Bovine Serum Albumi (YNB--BSA) Agar Plate Method\n------------------------------------------------------------------------------------------------------------------------\n\nAll 40 strains of *C. albicans* isolated from S-ECC and caries-free children grew well on the YNB--BSA agar plate. ", "The yeast colony was round, white and smooth-surfaced. ", "Moreover, a halo around the colony could be seen in all *Candida* strains from both the S-ECC and the caries-free groups. ", "According to Price *et al.* ", "\\[[@B18-ijms-15-10766]\\], enzymatic activity was determined by the ratio of the diameter of the colony to the total diameter of the colony plus the zone of precipitation (Proteolytic activity, Pa). ", "In our study, the colony diameter in the S-ECC group was 5.63--8.00 mm, and there was no significant difference compared with that in the caries-free group, whose colony diameter was 6.42--7.42 mm ([Table 1](#ijms-15-10766-t001){ref-type=\"table\"}). ", "However, the *Pa* value in the S-ECC group was significantly lower than that in the caries free (CF) group (*p* \\< 0.05), which means that the enzyme activity of Saps in *C. albicans* isolated from S-ECC children was higher than that from CF children ([Figure 1](#ijms-15-10766-f001){ref-type=\"fig\"}).", "\n\nijms-15-10766-t001_Table 1\n\n###### \n\nSaps activity determined by the yeast nitrogen base--bovine serum albumin (YNB--BSA) agar plate method.", "\n\n Groups *n* Diameter of Colony (mm) Diameter of Colony plus Precipitation Zone (mm) *Pa* *p*\n ------------- ----- ------------------------- ------------------------------------------------- ------------- -------\n S-ECC 26 7.13 ± 0.49 19.76 ± 2.63 0.36 ± 0.03 0.031\n Caries-free 14 6.78 ± 0.32 17.52 ± 1.65 0.39 ± 0.05 \n\n{#ijms-15-10766-f001}\n\n2.2. ", "The Enzyme Activity of Saps Determined by the Bovine Serum Albumin--MTT (BSA--MTT) Method\n----------------------------------------------------------------------------------------------\n\nFirst, live yeast was detected by the MTT method ([Table 2](#ijms-15-10766-t002){ref-type=\"table\"}, [Figure 2](#ijms-15-10766-f002){ref-type=\"fig\"}). ", "The MTT value was higher in the CF group; however, the *U* value was significantly higher in the S-ECC group (*p* \\< 0.001), which means that the enzyme activity of Saps in *C. albicans* isolated from S-ECC children was higher than that from CF children.", "\n\nijms-15-10766-t002_Table 2\n\n###### \n\nSaps activity determined by the bovine serum albumin--MTT (BSA--MTT) method.", "\n\n Groups *n* OD~280~ MTT Value *U* *p*\n ------------- ----- ------------- ------------- ------------- -------\n S-ECC 26 0.53 ± 0.25 0.40 ± 0.19 1.59 ± 0.92 0.001\n Caries-free 14 0.42 ± 0.13 0.54 ± 0.12 0.79 ± 0.26 \n\n{#ijms-15-10766-f002}\n\n2.3. ", "Genotypes of Candida albicans from Severe Early Childhood Caries (S-ECC) Children\n--------------------------------------------------------------------------------------\n\nTo investigate whether the enzyme activity of Saps is related to the sequence of genomic DNA, we evaluated the genotypes of *C. albicans* by arbitrarily primed polymerase chain reaction (AP-PCR). ", "According to previous studies, genotypes of *C. albicans* can be divided into five different groups, based on the length of the polymerase chain reaction (PCR) amplification product, namely, genotypes A (450 bp), B (840 bp), C (both 450 and 840 bp), D (1080 bp) and E (1400 bp) \\[[@B12-ijms-15-10766],[@B13-ijms-15-10766]\\]. ", "After all *C. albicans* colonies identified were screened, genotypes A, B and C of *C. albicans* were detected in the dental biofilms of children with S-ECC, while only genotypes A and C of *C. albicans* were detected in the dental biofilms of CF children ([Table 3](#ijms-15-10766-t003){ref-type=\"table\"}, [Figure 3](#ijms-15-10766-f003){ref-type=\"fig\"}). ", "Genotypes D and E were not detected in the oral cavities of any examined children. ", "These results are consistent with those reported by Yang *et al.* ", "\\[[@B19-ijms-15-10766]\\].", "\n\nijms-15-10766-t003_Table 3\n\n###### \n\nGenotypes of *C. albicans* isolated from different sampling sites in S-ECC and CF children.", "\n\n Groups *C. albicans* Isolate Genotypes \n ------------- ----------------------- ------------ ----------- -----------\n S-ECC group 23 13 (56.5%) 7 (30.4%) 3 (13.1%)\n CF group 17 8 (47.1%) ND 9 (52.9%)\n\nND: Not found.", "\n\n{#ijms-15-10766-f003}\n\nFurthermore, whether the virulence of *C. albicans* is related to genotypes remains controversial. ", "One study found that genotype A was more prevalent among invasive isolates and that genotypes B and C were more prevalent among non-invasive isolates (*p* \\< 0.05) \\[[@B15-ijms-15-10766]\\], while another study, conducted by Al-Karaawi *et al.*, ", "reported that genotype A is the most predominant type in patients with oral Candida infection; however, there was no relationship with the virulence of *C. albicans* \\[[@B20-ijms-15-10766]\\].", "\n\nijms-15-10766-t004_Table 4\n\n###### \n\nComparison of Saps activity in different genotype groups.", "\n\n Genotype Enzyme Activity Group *N* *x* ± *s* *F* *t* Sig.", "\n ------------ ----------------- ------------- ------------- ------------- ------- -------- -------\n Genotype A *Pa* CF 8 0.34 ± 0.03 0.426 −2.385 0.028\n S-ECC 13 0.38 ± 0.04 \n *U* CF 8 1.33 ± 0.67 8.687 2.296 0.034 \n S-ECC 13 0.82 ± 0.27 \n Genotype C *Pa* CF 9 0.36 ± 0.04 2.029 −1.898 0.087\n S-ECC 3 0.42 ± 0.07 \n *U* CF 9 1.73 ± 0.34 4.88 1.307 0.22 \n S-ECC 3 0.68 ± 0.21 \n\n*N* means number; *x* ± *s* denotes mean ± standard deviation; *F* denotes the result of F test; *t* denotes the result of *t* test; Sig. ", "means significance, which is equal to *p* value.", "\n\nThe relationship of Saps activity and the different genotypes was also analyzed. ", "According to the results of one-way ANOVA and the Kruskal-Wallis test, in the genotype A group, the Saps activity of *C. albicans* isolated from S-ECC children was significantly different from that in CF children (*p* \\< 0.05) ([Table 4](#ijms-15-10766-t004){ref-type=\"table\"}, [Figure 4](#ijms-15-10766-f004){ref-type=\"fig\"}). ", "However, there was no significant difference in Saps activity in the genotype C group of *C. albicans* from S-ECC and CF children. ", "The results supported *C. albicans* of genotype A as more aggressive in the progression of S-ECC.", "\n\n{#ijms-15-10766-f004}\n\n2.4. ", "Gene Expression of Sap1--5 in Dental Biofilm from S-ECC and CF Children\n----------------------------------------------------------------------------\n\nUntil now, Saps expression has been detected in all types of *C. albicans* infections by various gene expression detection techniques. ", "The different members of the SAPS family might be differentially expressed *in vivo* and might contribute to different *C. albicans* infections, because the pathogen inhabits a diverse number of host niches under a variety of environmental conditions \\[[@B21-ijms-15-10766],[@B22-ijms-15-10766]\\]. ", "In the study by Naglik *et al*. ", "\\[[@B14-ijms-15-10766]\\], samples were obtained from individuals with, or carrying, oral and vaginal candidiasis, and the expression of *Sap1--Sap8* was evaluated in an *in vivo* model. ", "The results suggested that *Sap2* and *Sap5* were the most common genes expressed during oral mucosal infection. *", "Sap1*, *Sap3*, *Sap4*, *Sap7* and *Sap8* expression was correlated with oral mucosal infection, whereas *Sap1*, *Sap3* and *Sap6*--*Sap8* expression was correlated with vaginal disease. ", "Another study found the expression of Saps in oropharyngeal candidiasis in a murine model \\[[@B23-ijms-15-10766]\\], and the results showed sustained expression of *Sap1*--*Sap6* and *Sap9*, with *Sap5* and *Sap9* most strongly expressed throughout the course of infection. ", "The research focused mainly on the gene expression of Saps from oral candidiasis, vaginal candidiasis, oropharyngeal candidiasis and gastrointestinal candidiasis, and the results differed considerably because of the different models involved \\[[@B12-ijms-15-10766],[@B13-ijms-15-10766],[@B14-ijms-15-10766],[@B15-ijms-15-10766],[@B17-ijms-15-10766],[@B23-ijms-15-10766],[@B24-ijms-15-10766]\\]. ", "However, the gene expression of Saps in samples obtained from dental biofilm and its relationship with S-ECC are still unclear. ", "In our study, *Sap1--Sap5* could be detected in all of the dental biofilm samples obtained from S-ECC and CF children ([Figure 5](#ijms-15-10766-f005){ref-type=\"fig\"}). ", "Results showed that the highest gene expression levels were found for *Sap1* and *Sap5* in the S-ECC group and for *Sap5* in the CF group ([Figure 6](#ijms-15-10766-f006){ref-type=\"fig\"}). ", "The transcript level of *Sap1* in dental biofilms from S-ECC children was higher than that from CF children (*p* = 0.001). ", "The results from this *in vivo* model suggested that *Sap1* might play an important role in the development of S-ECC, since, in the same SAPS isoenzyme family, the sequence homology of *Sap1--Sap3* is up to 67%, and their functions and roles in the development of the disease are perhaps the same. ", "Klinke \\[[@B25-ijms-15-10766]\\] detected the expression of *Sap2* in caries lesions by immunohistochemistry, using specific monoclonal antibodies against *Sap2*, which suggested that *Sap2* may be involved in the progression of dental caries. ", "We also found that gene expression of *Sap2*, *Sap3* and *Sap5* in the S-ECC group was higher than that in the CF group, but there was no significant difference between the S-ECC and CF groups.", "\n\n{#ijms-15-10766-f005}\n\nAnother interesting finding from our study is that the transcript level of *Sap4* in the CF group was statistically higher than that in the S-ECC group (*p \\<* 0.029). ", "Some studies have confirmed that the gene expression of Saps can be regulated by environmental conditions, including temperature and pH. Furthermore, the enzyme activity of Sap is pH-dependent. ", "For example, the optimum pH for *Sap*1--3 is pH 2.0--5.0, while for *Sap*4--6, the optimum pH is 5.0--7.0 \\[[@B26-ijms-15-10766]\\]. ", "The pH value is a critical factor for dental caries. ", "Since lower pH may cause demineralization of enamel and dentin and lead to the development of dental caries, the virulence of strains is related to their acidogenicity and acid endurance. ", "In our study, the gene expression of *Sap*1--3 in dental biofilm samples obtained from S-ECC children is higher than that from CF children. ", "Moreover, the Sap activities of the S-ECC group were significantly higher than those of the CF group, measured by both the YNB--BSA agar plate method and the MTT method with BSA as the substrate (*p* \\< 0.05). ", "Therefore the high level of gene expression and enzyme activity of Saps might be relalted to the lower pH environment induced by strains of *C. albicans* from S-ECC children. ", "However, the factors which regulated the gene expression and enzyme activity of Saps still need to be further investigated.", "\n\n{#ijms-15-10766-f006}\n\n3. ", "Materials and Methods\n========================\n\n3.1. ", "Study Population\n---------------------\n\nSeventy-three children aged 2.3 to 5 years old were recruited for this study and were divided into two groups: 40 children with S-ECC children and the balance CF. ", "Written informed consent was obtained from all individuals' families or caregivers, and the experimental procedures were approved by the Institutional Ethical Committee of the School of Stomatology, Sun Yat-sen University, Guangzhou, China. ", "The reference number is ERC\\[2012\\]25, which was approved on 11 September 2012.", "\n\n3.2. ", "Sampling Procedures\n------------------------\n\nBacterial samples from pooled plaque of the S-ECC and CF children were collected as previously described \\[[@B27-ijms-15-10766],[@B28-ijms-15-10766]\\]. ", "Sterile dental probes were used to collect dental biofilm samples from all the children. ", "For the S-ECC group, pooled samples were collected separately from caries lesions. ", "For the CF group, pooled biofilm samples were obtained from the sound buccal surfaces and accessible proximal surfaces of molars and canines. ", "The biofilm samples were immediately placed in sterilized tubes containing phosphate buffered saline (PBS, Boster, Wuhan, China).", "\n\n3.3. ", "Candida albicans Identification\n------------------------------------\n\nFor the detection of *C. albicans*, undiluted samples and 10^−1^--10^−3^ dilutions were cultured in CA medium (CHROMagar Company, Paris, France) and incubated at 37 °C under aerobic conditions for 48 h. A single typical green colony of yeast cells was obtained from the CA medium \\[[@B29-ijms-15-10766]\\] and spread onto Sabouraud medium for pure culture. ", "Twenty-six strains of *C. albicans* from S-ECC children and 14 strains from CF children were obtained.", "\n\n3.4. ", "Saps Enzyme Activity Determination by the Agar Plate Method\n----------------------------------------------------------------\n\nAccording to the method of Barros L.M. \\[[@B30-ijms-15-10766]\\] all *C. albicans* isolates were tested in duplicate for verification of the enzymatic activity of Saps and phospholipases. ", "The test medium for proteinases was BSA agar medium containing 2 g of BSA, 1.45 g of YNB (Difco Laboratories, Detroit, MI, USA), 20 g of glucose and 20 g of agar per liter of distilled water. ", "The test medium for phospholipases consisted of SDA (Sabouraud dextrose agar) containing 57.3 g of sodium chloride, 0.55 g of calcium chloride and 100 mL of 50% sterile egg yolk (egg yolk enrichment) per liter of distilled water. ", "Test isolates were grown on SDA for 24 h, and an inoculum of 10^7^ CFU/mL in sterile saline (absorbance 1.2 at 560 nm) was transferred to the test medium. ", "The plates were incubated at 37 °C for 72 h. The enzymatic activity was determined by the formation of a halo around the yeast colony, and was measured in terms of the ratio of the diameter of the colony to the total diameter of the colony plus the zone of precipitation (Proteolytic activity, Pa). ", "According to the method described by Price *et al*. ", "\\[[@B18-ijms-15-10766]\\], a *Pa* = 1.00 indicates that the test strain is negative for Saps enzyme activity. ", "The smaller the *Pa* value, the higher the enzyme activity of Saps.", "\n\n3.5. ", "Saps Enzyme Activity Determination by MTT Methods\n------------------------------------------------------\n\n*C. albicans* strains were inoculated into Sabouraud broth plus 100 mM glucose and grown for 17 h at 37 °C in an orbital incubator (Shellab, Cornelius, OR, USA). ", "The cells were then harvested and washed twice with 10 mL of PBS (pH 7.2) and re-suspended in the same buffer solution to yield a density of 10^7^ cells/mL (OD~540\\ nm~ = 0.4). ", "A 200-μL quantity of the former candidal suspension was inoculated into 3 mL of YNB w/o ammonium sulfate in a rocker at 37 °C for 30 min. ", "Tricarboxylic acid (TCA, Boster, Wuhan, China) was added to end the reaction. ", "The planktonic suspension was centrifuged, and the supernatant was measured by Ultraviolet spectrophotometry (Varian, Palo Alto, CA, USA) at a wavelength of 280 nm (OD~280~). ", "Another 200-μL quantity of the former candidal suspension was put into a 96-well plate. ", "After the addition of 20 μL MTT, the suspension was incubated at 37 °C for 4 h. The plate was centrifuged, and the supernatant was discarded. ", "Another 150-μL quantity of dimethyl sulfoxide (DMSO) was put into every well of a 96-well plate, and absorbance was measured by automated enzyme-linked immunosorbent assay (ELISA) at a wavelength of 490 nm (OD~490~). ", "The Sap activity (*U* value) = OD~280~/OD~490~.\n\n3.6. ", "DNA Extraction of C. albicans\n----------------------------------\n\nCellular DNA of isolates was isolated by means of a whole-genome DNA extraction kit (Promega, Madison, WI, USA) according to the manufacturer's protocols. ", "Ultraviolet spectrophotometry (Varian, Palo Alto, CA, USA) was used to adjust DNA concentration to 10 ng/mL.\n\n3.7. ", "Genotype Determination of C. albicans by Polymerase Chain Reaction (PCR)\n-----------------------------------------------------------------------------\n\nThe primer pairs whose sequences span the site of the transposable intron in the 25S rDNA were those described by McCullough *et al*. ", "\\[[@B31-ijms-15-10766]\\]: CA-NT-L: 5\\'-ATAAGGGAAGTCGGCAAAATAGATCCGTAA-3\\' and CA-NT-R: 5\\'-CCTTGGCTGTGGTTTCGCTAGATAGTAGAT-3\\'. ", "Amplification reactions were performed in 50 μL of distilled water containing 2.0 μL of each primer, 2.0 μL of genomic DNA (5 μg/mL) and one PCR bead (Ready-to-Go PCR beads; Amersham Pharmacia Biotech, Piscataway, NJ, USA). ", "The PCR conditions used were as follows: denaturation by incubation for 5 min at 93 °C prior to 40 cycles of 93 °C for 30 s, 55 °C for 45 s, and 72 °C for 45 s and a final extension at 72 °C for 10 min. ", "All reaction products were characterized by electrophoresis on 1.5% agarose gels in TBE (Tris-borate-EDTA) buffer at 70 V for 30 min and were then stained in a solution of 0.5 μg of ethidium bromide per mL.\n\nAccording to the results of electrophoresis, the genotypes of *C. albicans* can be divided into 5 groups by the size of DNA amplified (450 bp for group A, 840 bp for group B, 450 and 840 bp for group C, 1080 bp for group D and 1400 bq for group E) \\[[@B32-ijms-15-10766],[@B33-ijms-15-10766]\\].", "\n\n3.8. ", "RNA Extraction and Reverse Transcription\n---------------------------------------------\n\nTotal RNA was extracted and the integrity of RNA was assessed by agarose gel electrophoresis, and the purity of RNA (OD~260~/OD~280~) was measured. ", "The reverse transcription of mRNA was performed according to the instructions for the reverse transcription kit (Promega).", "\n\n3.9. ", "Real-Time RT-PCR for Gene Expression of Sap1--5\n----------------------------------------------------\n\nPrimer sets were designed to amplify *Sap1*--*Sap5* and ACT1 (actin) ([Table 1](#ijms-15-10766-t001){ref-type=\"table\"}). ", "None of the primer sets amplified regions containing introns.", "\n\n3.10. ", "Statistical Analysis\n--------------------------\n\nAll results were analyzed with SPSS 13.0 software (SPSS Inc., Chicago, IL, USA). ", "The enzyme activity of Saps (*Pa* and *U* values) in the S-ECC and caries-free groups was compared by *t*-test. ", "The *Pa* and *U* values of different genotype groups were analyzed by one-way ANOVA and the Kruskal-Wallis test. ", "The gene expression of *Sap*1--5 (*x* ± *s*) in the S-ECC and caries-free groups was compared by the RANK test. ", "A *p*-value \\< 0.05 was considered statistically significant.", "\n\n4. ", "Conclusions\n==============\n\nThe regulation of gene expression and enzyme activity of Sap is complicated and not clearly understood. ", "In this *in vivo* model, we found that the enzyme activities of *Candida albicans* isolated from children with S-ECC were significantly higher than those from children in the CF group. ", "Furthermore, the enzyme activity might be related to the genotypes of *C. albicans*, since, in the genotype A group, Saps activity in the S-ECC group was significantly different from that in the CF group. ", "According to the results of RT-PCR, *Sap*1--5 can be detected in the biofilm from both S-ECC and CF children, but only the gene expression level of *Sap*1 in the S-ECC group was significantly higher than that in the CF group. ", "It can thus be concluded that Saps are associated with the development of S-ECC, and that *Sap*1 may play an important role in its progression. ", "The relationships of Saps gene expression and genotype of *C. albicans* and mechanisms of Saps gene expression regulation need to be further investigated.", "\n\nThis work was supported by the Guangdong Science and Technology Program Fund (No. ", "2010B050700004, 2011B050400030), the Guangdong Natural Science Fund (No. ", "S2011020003247), and the National Natural Science Fund (No. ", "81272554).", "\n\nAs corresponding author, W.Z. was responsible for the design and guidance of all part of the study; The major part of the study including sample collection, *Candida albicans* isolation and identification, RT-PCR were done by W.L.; D.Y. provided guidance for the primers design, experiment of molecular biology, statistical analysis and paper written. ", "DNA extraction and genotype determination were done by J.L.; S.G. and Z.C. kindly helped to do the sample collection and the experiment of Saps Enzyme Activity Determination.", "\n\nThe authors declare no conflict of interest.", "\n\n[^1]: These authors contributed equally to this work.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.0009393597138114274, 0.004533036146312952, 0.004728279542177916, 0.0012223409721627831, 0.0005618409486487508, 0.0006502811447717249, 0.0007258497644215822, 0.001223805476911366, 0.0009615811286494136, 0.000667165033519268, 0.0005443855188786983, 0.0006158718024380505, 0.001614568056538701, 0.0007027327083051205, 0.0008266509976238012, 0.002238811459392309, 0.0006449223146773875, 0.0007872363203205168, 0.0006847806507721543, 0.0005955986562184989, 0.0006751745822839439, 0.0011863111285492778, 0.000853318371810019, 0.0009725217241793871, 0.0006455920520238578, 0.0007506479742005467, 0.0006213676533661783, 0.0006214992026798427, 0.0005692607373930514, 0.0010305900359526277, 0.0006579433102160692, 0.002423842903226614, 0.002338131656870246, 0.0011390445288270712, 0.0006454942049458623, 0.0006540789036080241, 0.0011337385512888432, 0.00071600271621719, 0.038032352924346924, 0.0009885375620797276, 0.0027858526445925236, 0.0006407955661416054, 0.0010657582897692919, 0.000602494808845222, 0.0007390853716060519, 0.0033099313732236624, 0.0005930981715209782, 0.0012845442397519946, 0.0008306701201945543, 0.0008297647582367063, 0.0019058462930843234, 0.0006127032684162259, 0.0007515598554164171, 0.0007707957993261516, 0.0006229375721886754, 0.0008782984223216772, 0.0006206952384673059, 0.8983868360519409, 0.07533316314220428, 0.000934278650674969, 0.0005613952525891364, 0.0006223040400072932, 0.0008478645468130708, 0.0006604553200304508, 0.0019058462930843234, 0.000546272553037852, 0.0017591301584616303, 0.0006475942209362984, 0.0007325361366383731, 0.0006096433498896658, 0.0006361627602018416, 0.002786965575069189, 0.001553262467496097, 0.08647480607032776, 0.0015130643732845783, 0.0013323418097570539, 0.0005898037925362587, 0.0005901462282054126, 0.0006086867651902139, 0.0007288060151040554, 0.0006100810132920742, 0.0007486951653845608, 0.0007000347250141203, 0.0019058462930843234, 0.0017798912012949586, 0.0005980522837489843, 0.0006899093277752399, 0.0006645964458584785, 0.000867377792019397, 0.0007951402221806347, 0.0006852646474726498, 0.0008998767589218915, 0.0005599145079031587, 0.0019058462930843234, 0.0007064476376399398, 0.0012038758723065257, 0.0006720940000377595, 0.0009956909343600273, 0.0009443464805372059, 0.0005857038195244968, 0.0005521275452338159, 0.0013827874790877104, 0.000716624956112355, 0.0008864199626259506, 0.0005519268452189863, 0.0007220095139928162, 0.0006238891510292888, 0.001374414307065308, 0.0006548088858835399, 0.0008853285689838231, 0.0013626827858388424, 0.000811974226962775, 0.0007554711191914976, 0.0010084593668580055, 0.0005783113301731646, 0.0005740289925597608, 0.0006089844973757863, 0.0010664592264220119, 0.0011006707791239023, 0.00128325039986521, 0.0007278811535798013, 0.0007046335376799107, 0.0008447332656942308, 0.0007489073905162513, 0.0006227199919521809, 0.0009927019709721208, 0.0007229658658616245, 0.0009116734145209193, 0.0006509991944767535, 0.0006185692618601024, 0.0005676483269780874, 0.0007720631547272205, 0.18146075308322906, 0.0006190827116370201, 0.0005977773107588291, 0.0007521140505559742, 0.001372571219690144, 0.0006702220998704433, 0.000579755927901715, 0.0013000019825994968, 0.0006804593140259385, 0.0008134456584230065, 0.0012012806255370378, 0.0006148468819446862, 0.0007296635885722935, 0.0010545924305915833, 0.0006706246640533209, 0.0017900204984471202, 0.0012908900389447808, 0.000738563307095319, 0.0007534052710980177, 0.0006428886554203928, 0.0006758837844245136, 0.0005783924134448171, 0.000604617758654058, 0.0005874466733075678, 0.0006457098643295467, 0.00067497743293643, 0.0008567161276005208, 0.0005612002569250762, 0.0005823933170177042, 0.0006132140988484025, 0.0005721304332837462, 0.001995587022975087 ]

[ "\n\n\n\nProduced by Jonathan Ingram, Allen Siddle and the Online Distributed\nProofreading Team.", "\n\n\n\n\n\nTHE MIRROR OF LITERATURE, AMUSEMENT, AND INSTRUCTION.", "\n\nNO. ", "329.] ", "SATURDAY, AUGUST 30, 1828. [", "PRICE 2d.", "\n\n\n\n\nNEW CHURCH, BUILDING AT STAINES.", "\n\n[Illustration: NEW CHURCH, BUILDING AT STAINES.]", "\n\n\nWho has journeyed on the Exeter road without noticing the town of STAINES,\nwith its host of antiquarian associations--as the _Stana_ (Saxon) or\nLondon Stone,[1] its ancient bridge, for the repair of which three oaks\nout of Windsor Forest were granted by the crown in the year 1262, besides\n_pontage_ or temporary tolls previous to the year 1600.--Dr. ", "Stukeley's\nconjectures respecting the _Via Trinobantica_ passing here--and the _old_\nparish church, the situation of which appeared to denote the site of the\nmore ancient town of Staines. ", "It is here too, that the tourist begins to\nimagine himself _in rure_, after he has been whirled through the brick and\nmortar avenues of _Kensington_, and _Hammersmith_, and the unsightly\nlane-street of _Brentford_,[2] with all its cockney reminiscences of\nequestrianism and election squabbles; _Hounslow_ and its by-gone days of\nhighway notoriety and powder-mill and posting celebrity, and _Bedfont_,\nwith its yew trees tortured into peacock shapes, and the date 1704. ", "Then,\nwho does not recollect and venerate the convivial celebrity of this route,\nits luxurious inns, and their \"thrones of human felicity;\" along which\nQuin, Dr. Johnson or Shenstone could scarcely have accomplished a stage a\nday!", "\n\nIn our days, hundreds of London tourists breakfast at the _Bush_, although,\nafter sixteen miles' ride, their appetites do not require this stimulant\nany more than do the glories of the _Bush_ cellars after dinner.", "\n\nBut we must pass on to the church. ", "The _old_ building was in the Gothic or\npointed style, with lancet windows, &c., but much disfigured by\nchurchwardens' repairs, although the great Inigo Jones is said to have\nbuilt its square, brick tower. ", "At length, a considerable portion of this\nancient structure fell in one Sunday morning, during the service, but, as\nthe newspapers say, \"fortunately no lives were lost.\" ", "The inhabitants then\nresolved to rebuild nearly the whole, and the design of Mr. J.B. Watson\nwas adopted. ", "The foundation stone was laid March 31, in the present year,\nand the building is to be completed by Christmas next. ", "The church is\nintended to contain 1,100 persons. ", "The length of the interior, 65 feet;\nwidth, 47 feet; height to ceiling, 25 feet. ", "The chancel is to be rebuilt\nat the expense of the impropriators. ", "The lower part of Inigo Jones's tower\nis to remain, and the whole is to be raised 23 feet. ", "These repairs, with\nthe enclosure of the churchyard, will not exceed 4,000_l_.; ", "and the\nprogress of the undertaking is highly creditable to the taste and\nexecution of all the parties concerned.", "\n\nAs one act of public spirit generally leads to another, the erection of a\nnew stone bridge is projected at Staines; it is to be nearer the church\nthan the present bridge, and will afford a better view of the new\nstructure. ", "An elegant stone bridge was erected here in 1796, but two of\nthe piers sinking, the bridge was taken down, and an iron one substituted;\nthis failed, and has since been supported by wooden piles and frame-work.", "\n\n\n[1] This is a boundary stone which marks the extent of the jurisdiction\n possessed by the City of London over the western part of the River\n Thames. ", "It stands on the margin of the river, in the vicinity of\n Staines church, and bears the date of 1280. ", "On a moulding round the\n upper part is inscribed \"GOD preserve the City of London, A.D. 1280.\"", "\n\n[2] George II. ", "used to say when riding through Brentford, with his heavy\n guards, \"I do like dis place, 'tis so like Yarmany.\"", "\n\n\n\n * * * * *\n\n\nTHE SPECTRE'S VOYAGE.", "\n\n_(For the Mirror.)_", "\n\n\n \"There is a part of the river Wye, between the city of Hereford and\n the town of Moss, which was distinguished and well known for upwards\n of two centuries, by the appellation of the Spectre's Voyage; across\n which, so long as it retained that name, neither entreaty nor\n remuneration could induce any boatman to convey passengers after a\n certain hour of the night. ", "The superstitious ideas current amongst the\n lower orders of people were, that on every evening about the hour of\n eight, a beautiful female figure was seen in a small vessel, sailing\n from Hereford to Northrigg, (a small village about three miles\n distant,) with the utmost rapidity, against wind and tide, or even in\n a dead calm--landed at the little village, returned, and vanished,\n when arrived at a certain part of the river, where the current is\n remarkably strong, about half a mile from the city of Hereford.\"", "\n\n --_Neele's Romance of History._ ", "See MIRROR, vol. ", "x, page 352.", "\n\n\n Bright shines the silver queen of night,\n Upon fair Wye's soft stream;\n Which throws a ray of heavenly light\n Reflected from her beam.", "\n Yet this smooth water, wide and clear,\n This scene of sweet repose;\n Erst filled the villagers with fear\n As ancient story goes.", "\n\n 'Tis told us that in dead of night,\n (In days of yore long past)\n A skiff was seen compact and light,\n With sail, and oars, and mast.", "\n And in it sat the spectral form,\n Of a most beauteous maid;\n Who heeded neither wind nor storm,\n As she this voyage made.", "\n\n Nor heeded she the pelting rain,\n Nor winter's blinding snows;\n But to the destin'd spot amain,\n The scudding vessel goes;\n Or if so calm, the placid Wye,\n No wave was on its face,\n Yet onward did that light bark fly\n To reach the fated place.", "\n\n When on the deck she was espied,\n Each trembled to behold;\n As on she sail'd 'gainst wind and tide,\n ('Tis scarce believ'd when told)\n Then sail and oar were both applied,\n And swift the vessel flew;\n But where the man--who could abide\n That vessel to pursue?", "\n\n Ah! ", "who could dare approach the spot\n Where Isabel did steer?", "\n That mariner existeth not,\n But did that phantom fear.", "\n Or where's the man whose courage bold,\n Could lend him strength one hour,\n To gaze upon that form so cold,\n Or place him in her power.", "\n\n And when the spectral sail was spread,\n That flutter'd to and fro;\n The hair would bristle on each head,\n Which awful fear did show.", "\n And when the moon-beam seem'd to kiss,\n That dreaded maiden's brow;\n Something each knew would go amiss,\n Nor judg'd such wrong, I trow.", "\n\n For tho' the form was wond'rous fair,\n 'Twas terrible to view;\n And to avoid it was the care\n Of every vessel's crew.", "\n Full many a dismal tale was told,\n Of that fam'd spectre ship;\n And none were ever known so bold\n To watch this nightly trip.", "\n\n Why did that troubled shade proceed\n Along that watery way?", "\n Or what the purpose, or the deed,\n Which caus'd her thus to stray?", "\n For good, or bad, did Isabel,\n Forsake her dreary grave?", "\n Or was't because she lov'd to sail\n On Wye's pellucid wave?", "\n\n The spectre came to meet her dear,\n Lord Hugh--the young and brave;\n When dreadful tidings met her ear,\n \"He'd found a traitor's grave.\"", "\n When second Edward rul'd this land,\n (A wretched prince was he,)\n Of favourites he'd a numerous band,\n As worthless as could be.", "\n\n Two noblemen amongst this set\n Were hated above all;\n And many were the lords who met,\n To work the Spencer's fall.", "\n Success attends these foe-men's strife,\n Lord Hugh is doom'd to die;\n And in his happiest hours of life,\n That precious life did fly.", "\n\n His manly form did never more,\n Bless Isabel's fond eyes;\n With him--the joys of life were o'er,\n For him--the maiden dies.", "\n Yet still the spirit fondly clings,\n To what in life has been,\n Thus Isabel, it nightly brings\n To this beloved scene.", "\n\n But when her feet have touch'd the ground,\n With silent, noiseless tread;\n No tender lover there is found,\n He's number'd with the dead.", "\n No more of love the tender strain,\n Falls on her list'ning ear,\n In life--her joy, was turn'd to pain,\n Her hope--gave place to fear.", "\n\n 'Tis then, that dread laments they hear,\n Who pass by night that way;\n Which the scar'd traveller, so clear,\n Hears till returning day;\n When re-embarks sad Isabel,\n That spectre shade so fair;\n Then dashing in the water's swell,\n She vanishes in air.", "\n\n No trace remains in Sol's bright ray,\n Of boat or awful spright;\n For grief--or guilt conceived by day,\n Conspicuous is at night.", "\n Thus Isabel's unearthly woe,\n Remain'd for many years;\n But as our superstitions go,\n So go unfounded fears\n\nCAROLINE MAXWELL.", "\n\n\n * * * * *\n\nHARVEST HOME.", "\n\n_(To the Editor of the Mirror.)_", "\n\n\nSir,--Wishing to add to your numerous accounts of our local customs, I\nsend you a description of the manner of celebrating harvest home in\nWestmoreland.", "\n\nThe farmers of Appleby, Kirby, Thore, and many of the neighbouring and low\ntowns thereabout, devote the last day of the harvest to mirth and\nfestivity. ", "The men generally endeavour to get the corn all in pretty early\nin the day; and at the last cart-load the horses are decked by the men\nwith ears of corn and flowers and ribands; and then the lasses' straw-\nbonnets, who, in return, perform the same compliments on them. ", "Thus they\nmove on through the lanes and roads, till they reach the farm-yard,\nshouting, \"Harvest Home,\" and singing songs in their way. ", "When they reach\nthe farm-yard, they set up an exulting shout, and ale is distributed to\nthem by their master. ", "About nine o'clock, a supper is prepared for them in\ntheir master's house. ", "A wheat-sheaf is brought, and placed in the middle of\nthe room, decorated with ribands and flowers, and corn is hung in various\nparts of the room. ", "The supper mostly consists of some good old English\ndish, (of which there is plenty,) and the jolly farmer presides at the\nhead of the table. ", "After the cloth is cleared, liquor in abundance is\nbrought forward, and the \"president\" sings, (not a _Non Nobis Domine_,)\nbut a good, true, mirth-stirring song, and then the _fun_ commences;\nsinging and dancing alternately occupy the evening, and the bottle\ncirculates speedily, and the festival generally breaks up about midnight.", "\n\nThus, Mr. Editor, is harvest home spent in that county, and I send you the\nonly account I can furnish of the harvest merriments, hoping some of your\ncorrespondents will add to my little mite.", "\n\nW.H.H.\n\n\n * * * * *\n\nSTANZAS TO, AND IN ILLUSTRATION OF, A LANDSCAPE BY CLAUDE.", "\n\n_(For the Mirror.)_", "\n\n\n Young land of beauty, and divine repose!", "\n Art thou a dream? ", "a vision from on high\n Unveiling Paradise? ", "uncurt'ning those\n Supernal glories, Eden doth supply\n To glad immortals? ", "o'er thee, ev'ning glows,\n Brilliant, as seraph's blush--pure as his breath--\n Smiling an antidote to tears and death!", "\n\n Young land of beauty! (", "fancy could not dwell\n In lovelier, albeit her rainbow wings\n Fold, but in fairy-spheres) a living well\n Of sylvan joy art thou, whose thousand springs\n Gush, sinless, gladness, peace ineffable,\n And that luxuriousness of being, which\n Mocks eloquence: warm, holy, ruby, rich.", "\n\n Young land of beauty! '", "neath thy sun-ting'd shades,\n Beside thy lake, crystal in roseate light,\n Enam'ring music breathes: there, raptur'd maids\n In dances, with adoring youths unite;\n There, magic voices sigh in song; and glades\n With birds and blossoms, all but vital, seem\n Entranc'd, like hermit in divinest dream!", "\n\n Young land of beauty! ", "art thou but a ray\n Of intellect, emerg'd from one? ", "and shrin'd,\n That thine immortal light may dim the day,\n Faint struggling thro' some lowlier, cloudier, mind:\n Dream of the painter-poet! ", "oh! ", "we'll say,\n Lur'd to ethereal musings by thy thrall,\n Tho' dream in part, no dream art thou in all!", "\n\nM.L.B\n\n\n * * * * *\n\nMARCH OF \"IMPROVEMENT.\"", "\n\n_(For the Mirror.)_", "\n\n\nAn old Subscriber has sent us the following _questions_ on the improvement\nof the metropolis, which we insert as a castle-building _jeu d'esprit_\nrather than as a serious matter. ", "They will, however, serve for the\n_committee of taste_ to crack after dinner, and give a zest for their\n_magna bona_.", "\n\nOught not the new palace to have been built in the richest Gothic\nstyle, so as to have deviated in appearance from every other edifice\nin the metropolis; and to have been erected on the north bank of the\nSerpentine?--And, if the _dome_ of the present erection is not to be\nremoved, cannot it be ornamented?--Or could not the pediment, fronting\nthe park, be raised another story, so as to hide it (the dome) from\nthat side?--Indeed, would not the palace be much improved by such an\nalteration? ", " I think if it be left as it is, when the wings are raised\nto the height of the body of the palace, (though they are a wonderful\nimprovement upon those first erected) the whole will have a very flat\nappearance.--Are not the statues of Neptune, &c., much too small, and\nthe other ornaments, consisting of representations of warlike implements,\n&c., much too heavy to look well?", "\n\nIs not the Borough a very improper place for the king's, or any other,\ncollege?--Is it not the very mart of trade, and consequently ever noisy\nand in confusion?--And what a magnificent improvement would its erection\nnear Westminster Abbey be to that ancient and very sumptuous pile. ", "Could\nit not be erected from Tothill Street, and extend towards Storey's\nGate?--And should it not be built in the Gothic style to correspond with\nthe abbey? ", "The seat of learning and wisdom is in that neighbourhood\n(Westminster School, Houses of Parliament, Courts of Justice, &c.);\ntherefore it is the place best adapted for the erection of a college.", "\nOught not also those disgraceful erections close to the abbey's western\nfront, to be instantly removed?--And ought not the house of the dean, &c.\nto be also rebuilt in the Gothic style, and extend from Tothill Street\ntowards St. John's church? ", "I never see this abbey (the glory of London)\nwithout feeling utterly disgusted at the surrounding objects. ", "The great\ntower, also, should be erected in the same style as the other two. ", "But\nshould not the council office, and Somerset House, be finished before\nother works are begun?--Should not the interior of the dome of St. Paul's\nbe repainted and gilt, and the windows (particularly the three over the\naltar) be of stained glass?--And should not the railing on the top of the\ndome on the outside (which is much decayed) be replaced by railing made of\nthe new metal lately invented, which imitates brass, and does not\ntarnish?--Would not the entrance for the public, from Piccadilly into St.\nJames's Park, be much better two or three yards from the new royal archway,\nas it will be very likely to be injured by people passing so near it?", "\n\nWould not a Swiss cottage and a Chinese temple very materially improve the\nappearance of the islands in St. James's Park; and two or three vessels\nupon that water, and the Serpentine in Hyde Park, also add very much to\nthe effect?--Would a tower, surrounded by a railing, as the monument, and\nsurmounted by a statue of George III. (", "looking with surprise to see what\nhis son had done), or Canning, or Byron, be a proper sort of monument as a\ntribute to their memories; and to be erected in the centre of the Regent's\nPark? ", "Oh! ", "what a prospect would its summit command! ", "Would not\nmagnificent baths for males and females, erected on either side of\nWaterloo Place, and to be supplied from the new fountain, be a great\naddition to the beauty and comfort of this great city.", "\n\nThese additions, alterations, and improvements, ought to be made now; and\nI doubt not, in the course of time, all warehouses will be removed from\nthe banks of the Thames, above Blackfriars' Bridge, and that streets will\nrun by the waterside as at Dublin. ", "Also the time will come when the houses\nround St. Paul's will be pulled down and rebuilt in the Grecian style of\narchitecture to correspond with the cathedral (the wonder of England), and\nbe re-erected at a much greater distance from it.", "\n\nI would also ask, \"should not the chimney pots upon the palaces in Regent\nStreet, &c. be of a slate colour?--Should not all tiles be painted of the\nsame colour? (", "slate.)--Should not the names of streets be more\nparticularly attended to?\"", "\n\n\n * * * * *\n\nINTRODUCTION OF SILK INTO EUROPE.", "\n\n_(For the Mirror.)_", "\n\n\nThe frequency of open hostilities between the Emperor of Constantinople\nand the monarchs of Persia, together with the increasing rivalry of their\nsubjects in the trade with India, gave rise to an event which produced a\nconsiderable change in the silk trade. ", "As the use of that article, both in\ndress and furniture, became more general in the court of the Greek\nemperors, who imitated and surpassed the sovereigns of Asia in splendour\nand magnificence; and as China, in which, according to the concurring\ntestimony of oriental writers, the culture of silk was originally known,\n_(Herlelot. ", "Biblioth. ", "Orient.)_, ", "still continued to be the only country\nwhich produced that valuable commodity; the Persians improving the\nadvantages which their situation gave them over the merchants from the\nArabian Gulf, supplanted them in all the marts of India, to which silk was\nbrought by sea from the east. ", "Having it likewise in their power to molest\nor to cut off the caravans, which, in order to procure a supply for the\nGreek empire, travelled by land to China through the northern provinces of\ntheir kingdom, they entirely engrossed that branch of commerce.", "\nConstantinople was obliged to depend on the rival power for an article\nwhich luxury reserved and desired as essential to elegance. ", "The Persians,\nwith the usual rapacity of monopolists, raised the price of silk to such\nan exorbitant height, that the Emperor Justinian eager, not only to obtain\na full and certain supply of a commodity which was become of indispensible\nuse, but solicitous to deliver the commerce of his subjects from the\nexactions of his enemies, endeavoured, by means of his ally, the christian\nmonarch of Abyssinia, to wrest some portion of the silk trade from the\nPersians. ", "In this attempt he failed; but when he least expected it, he, by\nan unforeseen event, attained in some measure (A.D. 55.) ", "the object which\nhe had in view. ", "Two Persian monks having been employed as missionaries to\nsome christian churches which were established (as we are informed by\nCosmas) in different parts of India, had penetrated into the country of\nthe Seres, or China. ", "There they observed the labours of the silk-worm, and\nbecame acquainted with all the arts of men in working up its productions\ninto such a variety of elegant fabrics. ", "The prospect of gain, or perhaps\nan indignant zeal excited by seeing this lucrative branch of commerce\nengrossed by unbelieving nations, prompted them to repair to\nConstantinople. ", "There they explained to the emperor the origin of silk,\nas well as the various modes of preparing and manufacturing it--mysteries\nhitherto unknown, or very imperfectly understood in Europe, and encouraged\nby his liberal promises, they undertook to bring to the capital a\nsufficient number of those wonderful insects to whose labours man is so\nmuch indebted. ", "This they accomplished by conveying the eggs of the\nsilk-worm in a hollow cane. ", "They were hatched by the heat of a dunghill;\nfed with the leaves of a wild mulberry-tree, and they multiplied and worked\nin the same manner as in those climates where they first became objects of\nhuman attention and care. ", "Vast numbers of these insects were soon reared\nin different parts of Greece, particularly in the Peloponnesus. ", "Sicily\nafterwards undertook to breed silk-worms with equal success, and was\nimitated from time to time in several towns of Italy. ", "In all these places\nextensive manufactures were established and carried on with silk of\ndomestic production. ", "The demand for silk from the East diminished, of\ncourse. ", "The subjects of the Greek emperors were no longer obliged to have\nrecourse to their enemies, the Persians, for a supply of it; and a\nconsiderable change took place in the nature of the commercial intercourse\nbetween Europe and India.", "\n\nBefore the introduction of the silk-worm into Europe, and as often as its\nproduction is mentioned by the Greek and Roman authors, they had not, for\nseveral centuries after the use of it became common, any certain knowledge\neither of the countries to which they were indebted for this favourite\narticle of elegance, or the manner in which it was produced, By some, silk\nwas supposed to be a fine down adhering to the leaves of trees or flowers;\nothers imagined it to be a delicate species of wool or cotton; and even\nthose who had learned that it was the work of an insect, show by their\ndescription that they had no distinct idea of the manner in which it was\nformed. ", "A circumstance concerning the traffic of silk among the Romans\nmerits observation. ", "Contrary to what usually takes place in the operations\nof trade, the more general use of that commodity seems not to have\nincreased the quantity imported in such proportion as to answer the\ngrowing demand for it; and the price of silk was not reduced during the\ncourse of 250 years from the time of its being first known in Rome. ", "In the\nreign of Aurelian it still continued to be valued at its weight in gold.", "\n(See Robertson's _History of India_.)", "\n\nIt is a singular circumstance in the history of silk, that, on account of\nits being an exertion of a worm, the Mahomedans consider it as an unclean\ndress, and it has been decided with the unanimous assent of all their\ndoctors, that a person wearing a garment made entirely of silk cannot\nlawfully offer up the daily prayers enjoined by the Koran. _(", "Herbel. ", "Bibl.", "\nOrient.)_ ", "C.V.\n\n\n * * * * *\n\nLADIES' FASHIONS.", "\n\n_(To the Editor of the Mirror.)_", "\n\n\nIf you think the following observations conformable to the plan of your\nuseful and entertaining publication, perhaps you may be induced to give\nthem a place, or notice the subject I have in view, in some other way.", "\n\nNotwithstanding the host of publications periodically issuing from the\npress, independent of the incalculable list of newspapers and reviews; and\nthough the rage for periodicals is so great, that a single event will give\nrise to one, yet there does not appear to me to be any thing like those\nworks which used to amuse and instruct our great grandfathers. ", "I mean the\n\"Spectator,\" \"Tatler,\" and others, whose influence extends to the present\nday, and which are continually affording pleasure to cultivated minds by\nthe soundness of their doctrines, aided by the extensive knowledge of\nhuman nature that the authors display throughout. ", "But as they are now\nbecome standard works, they are not so capable of \"shooting folly as it\nflies,\" and being as it were aged in the service, can only have a proper\neffect when folly will stand still to listen to them; but as that is, in\nmost instances, out of the question, we want something more active, or in\nother words, something new; and novelty being the order of the day,\nattention is thereby excited, and the follies and extravagances of the\n\"age,\" may possibly have some advantageous pruning.", "\n\nCaricatures, whether exhibited in pantomimes or print shops, (though often\ngot up for any other purpose than instruction) are not sufficient; they\nare too ridiculous, though sometimes not devoid of humour, instance the\npicture of a lady striving ineffectually to make a way through Temple Bar,\nbut is prevented by the enormous size of her bonnet, which shows likewise\nthat this extravagance in dress is not confined to the west end. ", "But as\nthese things are only laughed at, some other means ought to be adopted;\nand I should think myself extremely fortunate if I could be the humble\nmeans of inducing you, or your correspondents, to take the matter in hand.", "\n\nCertainly not the least to be deprecated are the \"ladies' present dresses;\"\nthe extravagances of which are not confined to the head, but are exhibited\nalso all down the arm (not unaptly likened to series of balloons) and are\nalso, in most instances, by some unusual \"bustling,\" equally absurd. ", "I\nwonder what would be said by Mr. Addison, were he to witness the present\nfashions. ", "He would certainly think that all the care he took to keep the\nfair sex in order was in vain; and though enormous head dresses were not\nin vogue in his time, he seems to have anticipated that they would be, by\nhis recommending the perusal of his 98th paper of the \"Spectator\" to his\nfemale readers by way of prevention, but which, alas! ", "has not been studied\nwith the attention it merits. ", "Probably the transcription of one passage\nwill not be misapplied here:--\n\nHe says, \"I would desire the fair sex to consider how impossible it is for\nthem to add any thing that can be ornamental to what is already the\nmasterpiece of nature. ", "The head has the most beautiful appearance, as well\nas the highest station, in a human figure. ", "Nature has laid out all her art\nin beautifying the face; she has touched it with vermilion, planted in it\na double row of ivory, made it the seat of smiles and blushes, lighted it\nup and enlivened it with the brightness of the eyes, hung it on each side\nwith curious organs of sense, given it airs and graces that cannot be\ndescribed, and surrounded it with such a flowing shade of hair as sets all\nits beauties in the most agreeable light. ", "In short she seems to have\ndesigned the head as the cupola to the most glorious of her works; and\nwhen we load it with such a pile of supernumerary ornaments, we destroy\nthe symmetry of the human figure, and foolishly contrive to call off the\neye from great and real beauties to childish gew-gaws, ribbons, and\nbone-lace.\"", "\n\nWomankind, Mr. Editor, I do not believe, are naturally vain; but as they\nwere made for us and for our comfort, it is natural that they should\nendeavour to gain our esteem; but they carry their endeavours too far; by\nstraining to excite attention they overstep the mark, become vain and\ncoquetish, one strives to outdo another, others say they must do as other\nwomen do, and they thus make themselves ridiculous unknowingly. ", "It is\nreally painful to see a woman of sense and education become a slave to the\ntyranny of fashion--and injuring both body and mind--and it is, I think,\nan insult to a man of understanding to endeavour to excite his attention\nby any such peculiarities.", "\n\nHaving now generally stated the subject that I should wish to be taken up\nby abler hands than mine, I will conclude by recommending all your\ntown-bred, and coquetish ladies to study and restudy a letter signed \"Mary\nHome,\" in No. ", "254 of the excellent work before alluded to, \"The Spectator.\"", "\n--H. M--._Great Surrey Street, Aug. 1828_.", "\n\n\n\n * * * * *\n\nRETROSPECTIVE GLEANINGS\n\n * * * * *\n\n\nHISTORICAL ACCOUNT OF SMITHFIELD.", "\n\n_(For the Mirror.)_", "\n\n\nStowe, in his \"Survey of London,\" 1633, says, \"Then is Smithfield Pond,\nwhich of (old time) in records was called Horsepoole, for that men watered\nhorses there, and was a great water. ", "In the 6th of Henry V. a new building\nwas made in the west part of Smithfield, betwixt the said poole and the\nriver of Wels, or Turne-mill-brooke, in a place then called the Elms, for\nthat there grew many elme-trees, and this had been the place of execution\nfor offenders. ", "Since the which time, the building there hath been so\nincreased, that now remaineth not one tree growing. ", "In the yeere 1357, the\n31st of Edward III., ", "great and royall justs were then holden in Smithfield,\nthere being present the kings of England, France, and Scotland, with many\nother nobles, and great estates of divers lands. ", "In the yeere 1362, the\n36th of Edward III., ", "on the first five daies of May, in Smithfield, were\njusts holden, the king and queene being present, with the most part of the\nchivalry of England and of France and of other nations; to which came\nSpaniards, Cyprians, and Armenians, knightly requesting ayde of the king\nof England against the Pagans, that invaded their confines. ", "The 48th of\nEdward III., ", "Dame Alice Perrers, or Pierce, (the king's concubine,) as\nlady of the Sunne, rode from the Tower of London through Cheape,\naccompanied of many lords and ladies, every lady leading a lord by his\nhorse bridle, till they came into West Smithfield, and then began a great\njust, which endured seven daies after.--In the 14th of Richard II., ", "royal\njusts and turnements were proclaimed to be done in Smithfield, to begin on\nSunday next, after the feast of Saint Michael; many strangers came forth\nof other countries, namely, Valarian, Earle of St. Paul, that had married\nKing Richard's sister, the Lady Maud Courtney; and William, the young\nEarle of Ostervant, son to Albert of Baviere, Earle of Holland and Henault.", "\nAt the day appointed, there issued forth at the Tower, about the third\nhoure of the day, 60 coursers, apparelled for the justs, upon every one an\nesquire of honour riding a soft pace; then came forth 60 ladies of honour,\nmounted upon palfraies, riding on the one side, richly apparelled, and\nevery lady led a knight with a chain of gold; those knights, being on the\nking's party, had their armour and apparell garnished with white harts,\nand crownes of gold about the harts' neckes; and so they came riding\nthrough the streets of London to Smithfield, with a great number of\ntrumpets, &c. The kinge and the queene, who were lodged in the bishop's\npalace of London, were come from thence, with many great estates, and\nplaced in chambers, to see the justs. ", "The ladies that led the knights were\ntaken down from their palfraies, and went up to chambers prepared for them.", "\nThen alighted the esquires of honour from their coursers, and the knights\nin good order mounted upon them; and after their helmets were set on their\nheads, and being ready in all points, proclamation made by the heralds,\nthe justs began, and many commendable courses were runne, to the great\npleasure of the beholders. ", "The justs continued many days with great\nfeastings, as ye may reade in _Froisard_,\" &c. &c.\n\nSmithfield, says Pennant, \"was also the spot on which accusations were\ndecided by duel, derived from the Kamp-fight ordeal of the Saxons. ", "I will\nonly (says Mr. P.) mention an instance. ", "It was when the unfortunate\narmourer entered into the lists, on account of a false accusation of\ntreason, brought against him by his apprentice, in the reign of Henry VI.", "\nThe friends of the defendant had so plied him with liquor, that he fell an\neasy conquest to his accuser. ", "Shakspeare has worked this piece of history\ninto a scene, in the second part of _Henry VI_., ", "but has made the poor\narmourer confess his treasons in his dying moments; for in the time in\nwhich this custom prevailed, it never was even suspected but that guilt\nmust have been the portion of the vanquished. ", "When people of rank fought\nwith sword and lance, plebeian combatants were only allowed a pole, armed\nwith a heavy sand-bag, with which they were to decide their guilt or\ninnocence. ", "In Smithfield were also held our autos-de-fee; but to the\ncredit of our English monarchs, none were ever known to attend the\nceremony. ", "Even Philip II. ", "of Spain never honoured any, of the many which\nwere celebrated by permission of his gentle queen, with his presence,\nnotwithstanding he could behold the roasting of his own subjects with\ninfinite self-applause and _sang-froid_. ", "The stone marks the spot, in this\narea, on which those cruel exhibitions were executed. ", "Here our martyr\n_Latimer_ preached patience to friar _Forest_, agonizing under the torture\nof a slow fire, for denying the king's supremacy; and to this place our\nmartyr _Cranmer_ compelled the amiable _Edward_, by forcing his reluctant\nhand to the warrant, to send _Joan Bocher_, a silly woman, to the stake.", "\nYet _Latimer_ never thought of his own conduct in his last moments; nor\ndid _Cranmer_ thrust his hand into the fire for a real crime, but for one\nwhich was venial, through the frailty of human nature. ", "Our gracious\nElizabeth could likewise burn people for religion. ", "Two Dutchmen,\nAnabaptists, suffered in this place in 1675, and died, as Holinshed sagely\nremarks, with \"roring and crieing.\" ", "But let me say, (says Pennant,) that\nthis was the only instance we have of her exerting the blessed prerogative\nof the writ _De Haeretico comburendo_. ", "Her highness preferred the halter;\nher sullen sister <DW19> and fire. ", "Not that we will deny but Elizabeth\nmade a very free use of the terrible act of her 27th year. ", "One hundred and\nsixty-eight suffered in her reign, at London, York, in Lancashire, and\nseveral other parts of the kingdom, convicted of being priests, of\nharbouring priests, or of becoming converts. ", "But still there is a balance\nof 109 against us in the article persecution, and that by the agonizing\ndeath of fire; for the smallest number estimated to have suffered under\nthe savage Mary, amounts, in her short reign, to 277. ", "The last person who\nsuffered at the stake in England was Bartholomew Logatt, who was burnt\nhere in 1611, as a blasphemous heretic, according to the sentence\npronounced by John King, bishop of London. ", "The bishop consigned him to the\nsecular of our monarch James, who took care to give the sentence full\neffect. ", "This place, as well as Tybourn, was called _The Elms_, and used\nfor the execution of malefactors even before the year 1219. ", "In the year\n1530, there was a most severe and singular punishment inflicted here on\none John Roose, a cook, who had poisoned 17 persons of the Bishop of\nRochester's family, two of whom died, and the rest never recovered their\nhealth. ", "His design was against the pious prelate Fisher, who at that time\nresided at Rochesterplace, Lambeth. ", "The villain was acquainted with the\ncook, and, coming into the bishop's kitchen, took an opportunity, while\nthe cook's back was turned to fetch him some drink, to fling a great\nquantity of poison into the gruel, which was prepared for dinner for the\nbishop's family, and the poor of the parish. ", "The good bishop escaped.", "\nFortunately, he that day abstained from food. ", "The humility and temperance\nof that good man are strongly marked in this relation, for he partook of\nthe same ordinary food with the most wretched pauper. ", "By a retrospective\nlaw, Roose was sentenced to be boiled to death, which was done accordingly.", "\nIn Smithfield, the arch-rebel, Wat Tyler, met with, in 1381, the reward of\nhis treason and insolence.\"", "\n\nSmithfield[1] is at present celebrated, and long since, for being the\ngreat market for cattle of all kinds, and likewise for being the place\nwhere Bartholomew fair is held, alias the _Cockneys' Saturnalia_, which\nwas granted by Henry II. ", "to the neighbouring priory.", "\n\nP.T.W.\n\n [1] After the Great Fire, many Londoners resided here in huts.", "\n\n\n\n * * * * *\n\nTHE ANECDOTE GALLERY.", "\n\n * * * * *\n\n\nTHE ANDALUSIAN ASS.", "\n\n\nA gay lieutenant of the Spanish Royal Guards, known by the name of Alonzo\nBeldia, became violently enamoured of the beautiful Carlotta Pena, the\neldest daughter of a reputable gunsmith, whose humble habitation adjoined\nthe vast cemetery of Valencia, and whom Beldia had casually seen at a\npublic entertainment given in that good city.", "\n\nAlonzo was affable and extremely complaisant, though an egotist and\nsomewhat loquacious; but nature had, nevertheless, bestowed upon him a\nprepossessing exterior with an enviable pair of jet black whiskers, and\nthe most expressive eyes; he could sing a _tonadilla_ divinely; dance the\n_fandango_ with inimitable grace; and \"strike the light guitar\" with\nunparalleled mastery. ", "He was, in truth, an accomplished man of pleasure,\nand by his gallantry he subdued the tender hearts of many fair daughters\nof Ferdinand's domains.", "\n\nOn a dark night in the month of December, just as Alonzo had played one of\nhis bewitching airs, with his wonted execution, and was engaged, in\nconverse sweet, with the enraptured Carlotta, an extraordinary and\nseemingly supernatural noise suddenly proceeded from a distant part of the\nhallowed ground where Alonzo sacrificed at the shrine of love. ", "Jesu Maria!", "\nexclaimed the terrified damsel, what, in the name of heaven, can it be?", "\nere the silvery tones of her sweet voice had reached the ears of the\npetrified Alonzo, the \"iron tongue\" of the cathedral clock announced the\nhour of midnight, and the solemn intonation of its prodigious bell\ninstilled new horrors into the confused minds of the affrighted lovers.", "\nThe brave, the royal Alonzo heard not the voice of his enchanting dulcinea;\nhe, poor fellow, with difficulty supported his trembling frame against an\nancient _memento mori_, which reared its tristful crest within a whisper\nof the lattice of the lovely Carlotta. ", "Large globules of transparent\nliquid adorned his pallid brow, and his convulsed knees sought each other\nwith mechanical solicitude. ", "It was a moment pregnant with the gravest\nmisery to poor Alonzo; not a star was seen to enliven the murky night, and\nthe wind whistled most lugubriously. ", "He was in a state of insensibility,\nand would have fallen to the cold earth, but luckily for the valiant youth,\nthe melodious voice of the enchanting girl again breathed the tenderest\nhopes for the safety of her adored Alonzo. ", "He sprang upon his legs and\ndrew a pistol from his girdle, which he discharged with unerring aim at\nthe dreaded goblin. ", "A horrible groan followed this murderous act, which\nwas succeeded by a confused noise, and a solemn silence ensued! \"", "It's\nvanished, Carlotta! ", "I have hurried the intruding demon to the nether\nworld!\" ", "exclaimed the valorous guardsman. \"", "Heavens be praised,\" cried the\nsuperstitious girl, \"but hasten, my love--quit this spot directly--my\nfather has alarmed his people--away, away!\"", "\n\nThe worthy maker of guns approached the scene of carnage, accompanied by\nthe inmates of his dwelling, with rueful countenances, illumined by tapers,\nwhen the cause of their disquietude was soon discovered. ", "No apparition or\nsprite forsooth, but a full grown _donkey_ of the Andalusian breed, lay\nweltering in gore, yet warm with partial life! ", "By timely liberality the\nvalorous Alonzo escaped detection, though the heroic deed is still\nremembered in merry Valencia, and often cited as an instance of glorious\n(?) _", "chivalry_.", "\n\nGRADIVUS.", "\n\n\n\n * * * * *\n\nSPIRIT OF DISCOVERY.", "\n\n * * * * *\n\n\nIMPROVED SAFETY LAMP.", "\n\n[Illustration]\n\n\nMr. Dillon has lately introduced to the notice of the scientific world, an\nimprovement upon the _Safety Lamp_ of Sir Humphry Davy, which appears to\nus of sufficient interest for illustration in our columns. ", "As the _Davy\nLamp_ is too well known to need special description here, it will be\nmerely necessary to allude to the principle of the invention, in order to\npoint out Mr. Dillon's improvement.", "\n\nHe maintains, in opposition to Sir Humphry Davy, that the Davy lamp acts\nby its heat and rarefaction, and not from Sir H. Davy's theory, that flame\nis cooled by a wire-gauze covering. ", "He shows, by a simple experiment, that\nthe Davy lamp is not safe in a current of hydrogen or carburetted hydrogen\ngas, and that many lives may have been lost from the confidence of miners\nin its perfect safety. ", "A current of hydrogen or carburetted hydrogen gas\nsteadily directed on the flame of the lamp from a bladder and stopcock,\n_by cooling the wire gauze_, brings the flame of the lamp through the\ngauze to the mouth of the stopcock, (even should there be six folds of\ngauze intervening.) ", "He shows also, by immersing the lamp, when cold and\nnewly lighted, into a jar of dense hydrogen or carburetted hydrogen gas,\nor an explosive mixture with atmospheric air, that explosion takes place\ninside and outside of the lamp; whereas, when the lamp has burnt\nsufficiently long to heat the wire gauze, no explosion takes place on the\noutside of the lamp. ", "These experiments appear incontrovertible in support\nof his theory, which is, \"_that the wire gauze is merely the rapid\nreceiver and the retainer of heat, and that it is the caloric in its\nmeshes which prevents the flame of the lamp from being fed by the oxygen\nof the atmosphere on the outside_.\"", "\n\nThe experiments of Libri, showing that flame is inflected by metallic rods,\nand that \"when two flames are made to approach each other, there is a\nmutual repulsion, although their proximity increases the temperature of\neach, instead of diminishing it,\" support Mr. Dillon's theory--the\ninflection being occasioned by the rarefaction of the air between the rod\nand the flame, the latter seeking for oxygen to support it in a denser\nmedium, the two flames repelling each other for the same reason, and not\nfrom any mysterious and \"repulsive effect of the wires of the gauze\ntissue.\" ", "Mr. Dillon increases the heat of the lamp, and places on it a\nshield of talc to protect it from a current, and, upon his theory, the\nshafts or workings of iron and coal mines may be lighted with gas with\nperfect safety, protecting the flame with wire gauze and a circular shield\nof talc.", "\n\n\n * * * * *\n\nEPITAPH ON A FRENCH SCOLD.", "\n\n Ci git ma femme; ah! ", "qu'il est bien\n Pour son repos et pour le mien.", "\n\n\n\n * * * * *\n\nTHE SELECTOR; AND LITERARY NOTICES OF _NEW WORKS_.", "\n\n * * * * *\n\n\nPENELOPE, OR LOVE'S LABOUR LOST.", "\n\n\nThis is one of the most deservedly attractive novels of the past season;\nand the good sense with which it abounds, ought to insure it extensive\ncirculation. ", "It has none of the affectation or presumptuousness of\n\"fashionable\" literature; but is at once a rational picture of that order\nof society to which its characters belong, and a just satire on the\n_superior_ vices of the wealthy and the great. ", "The author is evidently no\nservile respecter of either of the latter classes, for which reason, his\nwork is the more estimable, and is a picture of _real_ life, whereas\nfashion at best lends but a disguise, or artificial colouring to the\nactions of men, and thus renders them the less important to the world, and\nless to be depended on as scenes and portraitures of human character. ", "The\nformer will, however, stand as lasting records of the men and manners of\nthe age in which they were drawn, whilst the latter, being in their own\nday but caricatures of life, will, in course of time, fade and lose their\ninterest, and at length become levelled with the mere ephemera, or\nday-flies of literature. ", "It is true that novel-writing has, within the last\nsixteen, or eighteen years, attained a much higher rank than it hitherto\nenjoyed; but it should be remembered that this superiority has not been\ngrounded in mawkish records of the fashionable follies of high life, such\nas my Lord Duke, or my Lady Bab, might indite below stairs, for the\namusement of those in the drawing-room; on the contrary, it was founded in\nportraits and pictures of human nature, strengthened by historical, or\nmatter-of-fact interest, and stripped of the trickery of fancy and romance;\nwhereas, the chronicles of fashion are little better than the vagaries of\nan eccentric few, who bear the same proportion to the general mass of\nsociety, that the princes, heroes, and statesmen of history do to the\nwhole world. ", "This is a fallacy of which thousands of Bath and Cheltenham\nnovel-readers are not yet aware, and which the listless _Dangles_ of\nBrighton and Margate have yet to learn, ere they can hope to arrive at a\ncorrect estimate of human nature; but to such readers we cordially\nrecommend _Penelope_ as the best corrective we can prescribe for the bile\nof fashionable prejudice, or the nausea arising from overstrained fiction,\nmodified as it is to the romance of real life.", "\n\n_Penelope_ has, however, one of the failings common to fashionable novels.", "\nIts plot is weak and meagre--but it is still simple and natural, and has\nnot borrowed any of those adventitious aids to which we have alluded above.", "\nIt bears throughout an air of probability, untinctured by romance, and has\nthe strong impress of truth and fidelity to nature. ", "Sketchy and vivacious,\nalways humorous and sometimes witty; it has many scenes and portraits,\nwhich in terseness and energy, will compare with any of its predecessors;\nand occasionally there are touches of genuine sentiment which seize on the\nsympathies of the reader with more than common effect. ", "The incidents of\nthe narrative do not present many opportunities for these displays of the\nwriter's talent, and we cannot refrain from thinking that their more\nfrequent introduction would have increased the success of the work--that\nis, if we may be allowed to judge from the specimens with which the author\nhas here favoured us.", "\n\nBut we are getting somewhat too critical, and consequently as much out of\nour element as modern aeronauts, who are no sooner in the air than they\nseem to think of their descent. ", "We shall not, however, impair the pleasure\nof the reader by giving him a foretaste of the whole plot of _Penelope_;\nbut we shall rather confine ourselves to a few portrait-specimens of\ncharacters, whose _drawing_ will, we hope, _attract_ the general reader;\npresuming, as we do, that its claims to his attention will be found to\noutweigh dozens of the scandalous chronicles of high fashion. ", "We are not\ntold whether the parties ate with silver or steel forks, or burned wax or\ntallow; but those characters must be indeed poorly drawn which do not\nenable the reader to satisfy himself about such trifles, allowing that he\nthinks them worth his study.", "\n\nAn outline of the characters may not be unacceptable. ", "The scene lies\nprincipally in the villages of Neverden and Smatterton; and between their\nrectors Dr. Greendale and Mr. Darnley, and their families; the Earl of\nSmatterton, of Smatterton Hall; Lord Spoonbill, his son; Sir George\nAimwell, of Neverden Hall; _Penelope Primrose_, the heroine, who is placed\nby her father under the care of Dr. Greendale, whilst Mr. Primrose seeks\nto repair his fortune in the Indies; and Robert Darnley, Penelope's suitor,\nalso for sometime in the Indies, who is thwarted in his views by Lord\nSpoonbill, and a creature named colonel Crop, &c.\n\nIn the early part of the narrative, Dr. Greendale dies, and Penelope is\nremoved from Smatterton to London, where she is to be brought out as a\nsinger, under the patronage of the Countess of Smatterton, and Spoonbill\nis first struck with her charms, and resolves to frustrate his absent\nrival.", "\n\nThe roguery of a postboy named Nick Muggins, who is employed by the noble\nsuitor to intercept letters, and the aid of Crop, who acts as a sort of\ngo-between, are put in requisition for this purpose; but the villany of the\nlatter is finely defeated in his mistaking a silly, forward girl, Miss\nGlossop, for Penelope, and accordingly prevailing on her to elope with him\nto Lord Spoonbill's villa, where the blunder is soon discovered by his\nlordship, who in return is horsewhipped by the father of Miss Glossop;\nand Darnley and Penelope are eventually married.", "\n\nThere are two or three adjuncts, as Peter Kipperson, a \"march of intellect\"\nman, Erpingham, one of Spoonbill's companions in debauchery, Ellen\nFitzpatrick, one of his victims, Dr. Greendale's successor, Charles\nPringle; and Zephaniah Pringle, a literary coxcomb of the first order.", "\n\nThe portrait of Dr. Greendale is of high finish--full of the truth and\namiability of the Christian character--one who regarded the false\ndistinctions of society in their proper light, and knew how to set a right\nvalue upon the influence of good example, and who was \"loved and respected\nfor the steadiness and respectability of his character; for the integrity,\npurity, simplicity, and sincerity of his life.\" ", "At the same time, the\ndoctor is finely contrasted with his wife, who possessed the common\nfailing of paying homage to her illustrious neighbours to obtain their\nnotice and patronage, and who felt flattered by a collateral branch of the\nSmattertons accepting an invitation to her table. ", "Of the _heroine_, we\nquote the author's outline:--\n\n_Penelope Primrose_ exceeded the middle stature, that her dark blue eyes\nwere shaded by a deep and graceful fringe, that her complexion was\nsomewhat too pale for beauty, but that its paleness was not perceptible as\na defect whenever a smile illumined her countenance, and developed the\ndimples that lurked in her cheek and underlip. ", "Her features were regular,\nher gait exceedingly graceful, and her voice musical in the highest degree.", "\nSeldom, indeed, would she indulge in the pleasure of vocal music, but when\nshe did, as was sometimes the case to please the Countess of Smatterton,\nher ladyship, who was a most excellent judge, used invariably to pronounce\nMiss Primrose as the finest and purest singer that she had ever heard.", "\n\nThe character of Lord Spoonbill is struck out with singular felicity and\nspirit:--\n\nLord Spoonbill was not one of those careless young men who lose at the\nuniversity what they have gained at school; one reason was, that he had\nlittle or nothing to lose; nor was his lordship one of those foolish\npeople who go to a university and study hard to acquire languages which\nthey never use, and sciences which they never apply in after-life. ", "His\nlordship had sense enough to conclude that, as the nobility do not talk\nGreek, he had no occasion to learn it; and as hereditary legislators have\nnothing to do with the exact sciences, it would be a piece of idle\nimpertinence in him to study mathematics. ", "But his lordship had heard that\nhereditary legislators did occasionally indulge in other pursuits, and for\nthose pursuits he took especial care to qualify himself. ", "In his lordship's\ncranium, the organ of exclusiveness was strongly developed. ", "We do not mean\nthat his head was so constructed internally, as to exclude all useful\nfurniture, but that he had a strong sense of the grandeur of nobility and\nthe inseparable dignity which attaches itself to the privileged orders.", "\nThe only instances in which he condescended to persons in inferior rank,\nwere when he was engaged at the race-course at Newmarket, or when he found\nthat condescension might enable him to fleece some play-loving plebeian,\nor when affairs of gallantry were concerned. ", "In these matters no one could\nbe more condescending than Lord Spoonbill. ", "We should leave but an\nimperfect impression on the minds of our readers if we should omit to\nspeak of his lordship's outward and visible form. ", "This was an essential\npart of himself which he never neglected or forgot; and it should not be\nneglected or forgotten by his historian. ", "He was tall and slender, his face\nwas long, pale and thin, his forehead was narrow, his eyes large and dull,\nhis nose aquiline, his mouth wide, his teeth beautifully white and well\nformed, and displayed far more liberally than many exhibitions in the\nmetropolis which are only \"open from ten till dusk.\" ", "His lips were thin,\nbut his whiskers were tremendously thick. ", "Of his person he was naturally\nand justly proud. ", "Who ever possessed such a person and was not proud of it?", "\n\n_Colonel Crop_ was only Colonel Crop; he enjoyed the rank of colonel, and\nthat was all the rank that he could boast; he was tolerated at the castle;\nhe dined occasionally with his lordship; and occasionally partook of the\npleasure of shooting the birds which were cultivated on his lordship's\nestate. ", "In town, he patronised the countess' routs, and in the country he\nwas a companion for the earl, when not otherwise engaged. ", "He was proud of\nthe earl's acquaintance, though he was not weak enough to suppose that he\nwas more than tolerated. ", "The haughtiest of the great do sometimes pick up\nsuch acquaintances as Colonel Crop, and they cannot easily get rid of them.", "\n\nWe must pass over Peter Kipperson, an excellent whole-length portrait of a\nman who makes a noise in these marching times, and show in _Sir George\nAimwell_, of Neverden Hall, Bart., ", "who was descended from a long line of\nillustrious ancestry, and was a wholesale poulterer, and one of the great\nunpaid. ", "Not that we mean by this expression to insinuate that the retail\npoulterers did not pay him for what they had: we merely mean to say, that\nthe preserve-worshiping, springgun-setting, poacher-committing baronet\nadministered justice for nothing; and with reverence be it spoken, that\nwas quite as much as it was worth. ", "The worthy baronet was a most active\nmagistrate, peculiarly acute in matters of summary conviction; and\nthinking it a great pity that any rogue should escape, or that any accused,\nbut honest man, should lose an opportunity of clearing his character by\nmeans of a jury of his fellow-countrymen, he never failed to commit all\nthat were brought before him.", "\n\nSir George professed Whig politics; these were hereditary in his family,\nbut by no means constitutional in him as an individual. ", "Therefore he\npassed for a very moderate Whig; for one who would not clog the wheels of\ngovernment. ", "In short, he was no more a Whig than a game preserver ought to\nbe; and that, as our readers know, is not much. ", "He took especial pains to\nkeep the parish clear of vagrants and paupers; and by his great activity\nhe kept down the poor-rates to a moderate sum. ", "Sir George, though a\nprofessed Whig, was not very partial to the education of the lower orders,\nand he always expressed himself well pleased when he met with a country\nbooby who could neither read nor write. ", "For this reason Nick Muggins, the\npostboy, was a great favourite with him. ", "Our worthy baronet could not see\nthe use of reading, and he thought it a great piece of affectation for\ncountry gentlemen to have libraries. ", "His own books, for he had a few, were\nhuddled together in a light closet, where he kept his guns and sporting\ntackle. ", "There was a Lady Aimwell, wife to Sir George; but this lady was a\npiece of still life, of whom the neighbours knew nothing, and for whom her\nhusband cared nothing.", "\n\nEverybody in the neighbourhood remembers the impressive admonition which\nSir George gave to an old man who was convicted at the quarter sessions of\nhaving a bit of string in his pocket, and therefore strongly suspected of\na design of a malicious nature against the game.", "\n\n\"John Carter,\" said the worthy baronet, \"let me address to you a few\nwords on the sin of poaching. ", "Poaching, John Carter--is--is a sin of which\ntoo many are guilty, owing to the lenity of our most excellent laws. ", "I\nthink that if everybody thought, as I think, of the moral heinousness of\nthis offence, nobody would be guilty of it. ", "Poaching is not yet made\nfelony; but there is no saying how soon it may be made so, if the crime be\npersisted in. ", "It is a moral offence of the greatest enormity, and is one\nof those crying, national sins, which may one day or other bring down the\nvengeance of heaven on our guilty country. ", "Now, John Carter, if you go to\ngaol for six months, I hope the tread-mill and the chaplain will work a\nthorough reformation in your morals.\"", "\n\nOf course the contact of Sir George with such a man as Kipperson, affords\ngreat merriment: _ex. ", "gr._ ", "part of a dinner scene at Neverden Hall:--\n\nNow Peter was a very literary man, who thought there was nothing worth\nliving for but science and literature; and having somewhere read that it\nwas impossible to take shelter in a shower of rain with such a man as\nBurke, without discovering him to be a man of genius, Peter was desirous\nof continually showing off, and was instant in season and out of season.", "\nTherefore when sitting at the table of the worthy baronet, he assailed the\nmagistrate with various scientific subjects, but all to no purpose; there\nwas no response from his worthy host. ", "Endeavouring to adapt himself to the\nmoderate talents and circumscribed reading of the baronet, he next started\nthe subject of novels and novel reading, taking care to insinuate that,\nthough Sir George might not read the trash of circulating libraries, he\nmight be acquainted with some of our best novels. ", "To this at last the\nbaronet replied--\"Oh, yes; I remember many years ago reading a novel\ncalled Tom Jones, written by a Bow Street officer. ", "I recollect something\nabout it--it was very low stuff--I forget the particulars, but it was\nwritten in the manner of servants.\"", "\n\nHereupon Mr. Peter Kipperson set it down as an indisputable fact that\nbaronets and magistrates were the most ignorant creatures on the face of\nthe earth, and he congratulated himself that neither he nor Sir Isaac\nNewton were baronets.", "\n\nA scene between Lord Spoonbill and one of his victims, whom he meets in\nhis father's park, has some fine touches of remorse:--\n\nAgitated by distracting thoughts, he stood at the park gate, gazing\nalternately in different directions; and by the intensity of his feelings\nwas at last rivetted in an almost unconscious state of mind to the spot on\nwhich he was standing. ", "Suddenly his pulse beat quicker, and his heart\nseemed to swell within him, when at a little distance he saw the dreaded\none approaching him. ", "Had he seen her anywhere else his first impulse would\nhave been to avoid her; but here his truest and best policy was to submit\nto an interview, however painful. ", "Shall he meet her with kindness?--\nShall he meet her with reproaches?--Shall he meet her with coldness? ", "These\nwere inquiries rapidly passing through his mind as she drew nearer and\nnearer. ", "It was difficult for him to decide between cruelty and hypocrisy;\nbut the last was the most natural to him, so far as custom is a second\nnature.", "\n\nThe afflicted one moved slowly with her eyes fixed on the ground, and she\nsaw not her enemy till so near to him, that on lifting up her face and\nrecognising his well-known features, the sudden shock produced a slight\nhysteric shriek.", "\n\nLord Spoonbill was not so lost to all feeling of humanity as to be\ninsensible to the anguish of mind which she now suffered, who had once\nregarded him as a friend, and had loved him, \"not wisely, but too well.\"", "\nHe held out his hand to her with an unpremeditated look of kindness and\naffection; and which, being unpremeditated, bore the aspect of sincerity.", "\nThe stranger at first hesitated, and seemed not disposed to accept the\noffered hand; but she looked up in his face, and the blood mounted to her\ncheeks and the tears stood in her eyes, and she gave him her hand, and\ncovered her face and wept bitterly.", "\n\nThere are moments in which shameless profligates look foolish and feel\nthat they are contemptible. ", "This was such a moment to Lord Spoonbill. ", "He\nwas moved, and he was mortified that he was moved; and there was a general\nfeeling of confusion and perplexity in his mind. ", "What could he say? ", "or how\ncould he act? ", "He began to stammer out something like gentleness, and\nsomething like reproof. ", "But she who stood before him was as an accusing\nspirit, to whom apology was mockery, and repentance too late.", "\n\nIn the first volume too, there is a successful satire on the changes of\nsixteen years in the condition of the people of England--between Mr.\nPrimrose, who had been absent for that period, and the egregious Peter\nKipperson. ", "It is quite in the _forte_ of the writer, and we regret that we\nhave not room to quote it at full length.", "\n\nSuch are the only specimens which our limits enable us to present to the\nreader; but we hope they will be sufficient to induce him to turn to the\nwork itself--and we doubt not--for his further gratification. ", "Digressions\noccur too frequently to suit the pioneering taste of a certain class of\nreaders; they may serve as resting-places in an intricate plot, but they\nwere not, on that account, wanted here. ", "At the same time, they are\nrecommended by plain sense, knowledge of the world, shrewdness, and\nharmless satire on the weak sides of our nature, and are therefore\n_useful_; whilst their terseness and vivacity will free them from the\ncharge of dulness, or the sin of prosing.", "\n\n\n * * * * *\n\nDIALOGUES ON FLY FISHING.", "\n\n_By Sir Humphry Davy._", "\n\n\nWe continue our extracts from this \"philosophical angler's\" delightful\nlittle book. ", "The present will serve such as are unacquainted with the\nmysteries of fly-fishing, and interest all who are fond of inquiries in\nnatural history.", "\n\n\n_Management of Flies._", "\n\n_Hal_--Whilst you are preparing I will mention a circumstance which every\naccomplished fly-fisher ought to know. ", "You changed your flies on Saturday\nwith the change of weather, putting the dark flies on for the bright\ngleams of the sun, and the gaudy flies when the dark clouds appeared. ", "Now\nI will tell you of another principle which it is as necessary to know as\nthe change of flies for change of weather; I allude to the different kinds\nof fly to be used in particular pools, and even for particular parts of\npools. ", "You have fished in this deep pool; and if you were to change it for\na shallower one, such as that above, it would be proper to use smaller\nflies of the same colour; and in a pool still deeper, larger flies;\nlikewise in the rough rapid at the top, a larger fly may be used than\nbelow at the tail of the water; and in the Tweed, or Tay, I have often\nchanged my fly thrice in the same pool, and sometimes with success--using\nthree different flies for the top, middle, and bottom. ", "I remember when I\nfirst saw Lord Somerville adopt this fashion, I thought there was fancy in\nit; but experience soon proved to me how accomplished a salmon-fisher was\nmy excellent and lamented friend, and I adopted the lesson he taught me,\nand with good results, in all bright waters.", "\n\n\n_Hooks._", "\n\n_Hal_--I never use any hooks for salmon-fishing, except those which I am\nsure have been made by O'Shaughnessy, of Limerick; for even the hooks made\nin Dublin, though they seldom break, yet they now and then bend; and the\nEnglish hooks made of cast steel in imitation of Irish ones are the worst\nof all. _", "There_ is a fly nearly of the same colour as that which is\ndestroyed; and I can tell you that I saw it made at Limerick by\nO'Shaughnessy himself, and tied on one of his own hooks. ", "Should you catch\nwith it a fish even of 30 lbs., ", "I will answer for its strength and temper;\nit will neither break nor bend.--We should have such hooks in England, but\nthe object of the fishing-tackle makers is to obtain them cheap, and most\nof their hooks are made to sell, and good hooks cannot be sold but at a\ngood price.--The early Fellows of the Royal Society, who attended to all\nthe useful and common arts, even improved fish-hooks; and Prince Rupert,\nan active member of that illustrious body, taught the art of tempering\nhooks to a person of the name of Kirby, under whose name, for more than a\ncentury, very good hooks were sold.", "\n\n\n_Variety in Trout._", "\n\n_Phys._--Tell us why they are so different from the river-trout, or why\nthere should be two species or varieties in the same water.--_Hal._ ", "Your\nquestion is a difficult one, and it has already been referred to in a\nformer conversation; but I shall repeat what I stated before, that\nqualities occasioned by food, peculiarities of water, &c. are transmitted\nto the offspring, and produce varieties which retain their characters as\nlong as they are exposed to the same circumstances, and only slowly lose\nthem. ", "Plenty of good food gives a silvery colour and round form to fish,\nand the offspring retain these characters. ", "Feeding on shell-fish thickens\nthe stomach, and in many generations, probably, the gillaroo trout becomes\nso distinct a variety, as to render it doubtful if it be not a distinct\nspecies. ", "Even these smallest salmon trout have green backs, _only_ black\nspots, and silvery bellies; from which it is evident that they are the\noffspring of lake trout, or _lachs forelle_, as it is called by the\nGermans; whilst the river trout, even when 4 or 5 lbs., ", "as we see in one\nof these fish, though in excellent season, have red spots.", "\n\n\n_Char._", "\n\n_Phys._ ", "The char[1] is a most beautiful and excellent fish, and is, of\ncourse, a fish of prey. ", "Is he not an object of sport to the angler?--_Hal.", "\n_ They generally haunt deep, cool lakes, and are seldom found at the\nsurface till late in the autumn. ", "When they are at the surface they will,\nhowever, take either fly or minnow. ", "I have known some caught in both these\nways; and have myself taken a char, even in summer, in one of those\nbeautiful, small, deep lakes in the Upper Tyrol, near Nazereit; but it was\nwhere a cool stream entered from the mountain; and the fish did not rise,\nbut swallowed the artificial fly under water. ", "I have fished for them in\nmany lakes, without success, both in England and Scotland, and also\namongst the Alps; and I am told the only sure way of taking them is by\nsinking a line with a bullet, and a hook having a live minnow attached to\nit, in the deep water which they usually haunt; and in this way, likewise,\nI have no doubt the _umbla_, or _ombre chevalier_, might be taken.", "\n\n [1] _Sabling_ of the Germans.", "\n\n\n_Naturalization of Fish._", "\n\n_Hal._ ", "At Lintz, on the Danube, I could have given you a fish dinner of a\ndifferent description, which you might have liked as a variety. ", "The four\nkinds of perch, the _spiegil carpfen_, and the _siluris glanis_; all good\nfish, and which I am sorry we have not in England, where I doubt not they\nmight be easily naturalized, and where they would form an admirable\naddition to the table in inland counties. ", "Since England has become\nProtestant, the cultivation of fresh water fish has been much neglected.", "\nThe _burbot_, or _lotte_, which already exists in some of the streams\ntributary to the Trent, and which is a most admirable fish, might be\ndiffused without much difficulty; and nothing could be more easy than to\nnaturalize the _spiegil carpfen_ and _siluris_; and I see no reason why\nthe _perca lucio perca_ and _zingil_ should not succeed in some of our\nclear lakes and ponds, which abound in coarse fish. ", "The new Zoological\nSociety, I hope, will attempt something of this kind; and it will be a\nbetter object than introducing birds and beasts of prey--though I have no\nobjection to any sources of rational amusement or philosophical curiosity.", "\n\n\n_Conveying Fish._", "\n\n_Phys._--In Austria, the art of carrying and keeping fish is better\nunderstood than in England. ", "Every inn has a box containing grayling, trout,\ncarp, or char, into which water from a spring runs; and no one thinks of\ncarrying or sending _dead_ fish for a dinner. ", "A fish-barrel full of cool\nwater, which is replenished at every fresh source amongst these mountains,\nis carried on the shoulders of the fisherman. ", "And the fish, when confined\nin wells, are fed with bullock's liver, cut into fine pieces, so that they\nare often in better season in the tank or stew than when they were taken.", "\nI have seen trout, grayling, and char even, feed voraciously, and take\ntheir food almost from the hand. ", "These methods of carrying and preserving\nfish have, I believe, been adopted from the monastic establishments. ", "At\nAdmondt, in Styria, attached to the magnificent monastery of that name,\nare abundant ponds and reservoirs for every species of fresh water fish;\nand the char, grayling, and trout are preserved in different waters--\ncovered, enclosed, and under lock and key.", "\n\n\n\n * * * * *\n\nSPIRIT OF THE PUBLIC JOURNALS.", "\n\n * * * * *\n\n\nPAROCHIAL HISTORIES.", "\n\n\nWe wonder why clergymen do not oftener write accounts of their parishes;\nnot mere statistical accounts, though these are most valuable, as witness\nthe contributions of the Scottish Clergy to the truly patriotic Sir John\nSinclair's work; but accounts comprehending every thing interesting to all\nhuman beings, whatever be their political or religious creed. ", "A\ndescription of a church that has principally ceased to exist, is in\ngeneral very, very, very dry; inscriptions on tombstones, without comment,\nor moral, are hard reading; an old pan dug up among rubbish proves a sore\naffliction in the hands of the antiquary, and twenty pages quarto, with\nplates, about a rusty spur without a rowel, is, in our humble opinion, an\nabuse of the art of printing. ", "But how easy--how pleasant, to mix up\ntogether all sorts of information in due proportions into one whole, in\nthe shape of an octavo--epitomizing every kind of history belonging to the\nparish, from peer's palace to peasant's hut! ", "What are clergymen\nperpetually about? ", "Not always preaching and praying; or marrying,\nchristening, and burying people. ", "They ought to tell us all about it; to\nmoralize, to poetize, to philosophize; to paint the manners living as they\nrise, or dead as they fall; to take Time by the forelock, and measure the\nmarks of his footsteps; to show us the smoke curling up from embowered\nchimneys; or, since woods must go down, to record the conquests of the\nbiting axe; to celebrate the raising of every considerable roof-tree, to\nlament all dilapidations and crumbling away of ivied walls; to inform us\nhow many fathoms deep is the lake with its abbeyed island--why the pool\nbelow the aged bridge gets shallower and shallower every year, so that it\ncan no more shelter a salmon--what are the sports, and games, and pastimes\nof the parishioners--what books they read, if any--if the punishment of\nthe stocks be obsolete--or the stang--or the jougs--if the bowels of the\npeople yearn after strange doctrine--if the parish has produced any good\nor great murderer, incendiary, or other criminal. ", "In short, why might not\nthe history of each of the twenty or thirty thousand parishes of Great\nBritain--we speak at random--be each a history of human nature, at once\nentertaining and instructive? ", "How infinitely better such books than\npamphlets on political economy, for example, now encumbering the whole\nland! ", "Nay, even than single sermons, or bundles of sermons, all like so\nmany sticks--strong when tied all together, but when taken separately,\nweak and frush. ", "We have no great opinion of county histories in general,\nthough we believe there are some goodish ones, from which we purpose, ere\nlong, to construct some superior articles. ", "A county history, to be worth\nmuch, should run from sixty to six hundred volumes. ", "No library could well\nstand that for many years. ", "But a judicious selection might be made from\nthe thirty thousand parish histories--that would afford charming reading\nto the largest family during the longest nights--in the intervals between\nthe Scotch Novels. ", "Form the circle round the fire--when winter crimps and\nfreezes--or round the open bow-window, now that summer roasts and broils,\nand get her whose voice is like a silver bell to read it up, right on from\nbeginning to end, only skipping a few lists of names now and then, and we\npledge our credit on the prediction, that you will be delighted as on a\nsummer ramble, now in sunlight and now in moonlight, over hill and dale,\nadorned with towers, turrets, pinnacles of halls and churches, and the low\nroofs,--blue or brown, slated or strawed.--\n\n \"Of huts where poor men lie!\"", "\n\n_Blackwood's Magazine._", "\n\n\n\n * * * * *\n\nTHE GATHERER.", "\n\n \"A snapper-up of unconsidered trifles.\"", "\n SHAKSPEARE.", "\n\n * * * * *\n\n\nIAMBICS.", "\n\n\nIambe was a servant-maid of Metanira, wife of Celeus, king of Eleusis, who\ntried to exhilarate Ceres when she travelled over Attica in quest of her\ndaughter Proserpine. ", "From the jokes and stories which she made use of,\nfree and satirical verses have been called _iambics_.--_Apollod_, i._c_. ", "5.", "\nHALBERT.", "\n\n\n * * * * *\n\nBISHOP AND NEGUS.", "\n\n\nTwo dustmen were lately disputing the difference between _bishop_ and\n_negus_. \"", "Don't you know?\" ", "said one of them; \"I vonders at your ignorance--\nvy bishop is made all vine vithout no vater vatsomever; vereas negus is\nmade with vine and vater mixed--that's the difference, to be sure.\"", "\n\n\n * * * * *\n\nPOLITE EVIDENCE.", "\n\n\nAt the Wells assizes, the other day, a butcher's wife, in giving her\nevidence, repeatedly turned towards the prisoner at the bar, and\ndesignated him as \"that gentleman!\" ", "The judge at last lost all patience,\nand exclaimed, \"Old woman, you are become quite offensive.\" ", "This\nexemplifies Steele's speaking of \"sin as a fine gentleman.\"", "\n\n\n * * * * *\n\n\nBaron Garrow lately observed at Monmouth, that a respected friend of his,\nin the city of London, would sign his name on the outside of letters, in\nsuch a way as to defy the skill of every man in the court, even if\nassisted by the greater sagacity of the other sex, in finding out what his\nsignature could possibly be meant for. ", "The post-offices indeed, knew that\na certain number of straight strokes, up and down, meant W. Curtis; but\nprobably that was not because they could read the signature, but because\nnothing else at all like it ever came there.", "\n\n\n * * * * *\n\n\nDr. Solo, on hearing of the glorious victory obtained by Bolivar, was\ndetermined that every bird and beast that he possessed should get drunk on\nthis glorious occasion. ", "For this purpose he gave the horses, cows, pigs,\nand poultry and birds as much juice of the sugar-cane as they could drink;\nand it was very amusing to see the pigs jump about in the most frolicsome\nmanner.--_Hutchinson's Travels in Colombia._", "\n\n\n * * * * *\n\nBELL ROCK LIGHT-HOUSE.", "\n\nIn the _Album_ at the Bell Rock Light-House are the following lines by Sir\nWalter Scott:--\n\n\n_Pharos Loquitur._", "\n\n Far in the bosom of the deep,\n O'er these wild shelves my watch I keep;\n A ruddy gem of changeful light,\n Bound on the dusky brow of night;\n The seaman bids my lustre hail,\n And scorns to strike his timorous sail.", "\n\nWALTER SCOTT.", "\n\n\n * * * * *\n\nNEWSPAPER WONDERS.", "\n\n\nFlights of wild ducks and geese, in numbers _sufficiently multitudinous to\ndarken the air_, have already migrated to the moors--a circumstance\nscarcely existing in the memory of the oldest inhabitant at this period of\nthe year.--_Hereford Journal._", "\n\n\n * * * * *\n\n\nA countryman, who was cutting wood near the falls of Niagara, on the 10th\nof July, was attacked by a rattle-snake; in his terror he leaped across a\ntremendous gulf, sixty-seven feet wide, and escaped unhurt!--_Charleston\nPaper._", "\n\n\n * * * * *\n\n\nThe _Weedsport Advertiser_ (an American Journal) relates an incident which\nhad just occurred in the town of Cato, Cross Lake. ", "A young man named\nStockwell, son of a widow woman of that name, living in the town, after\nrepeated threats to kill a favourite cat belonging to the house, in order\nto vex his mother, at length undertook to carry them into execution. ", "In\nthe morning he took the cat and started with her into the woods, telling\nhis youngest sister that he was going to destroy her. ", "They were absent\nuntil the afternoon, when the cat came home, _apparently looking_ as\nthough she had been in the water. ", "The next morning the young man's clothes\nwere seen on the bank of Cross Lake, and in the water was found his body,\nthe face and shoulder dreadfully scratched, evidently by the cat in\nstruggling, so that little doubt existed that he was drowned in attempting\nto destroy puss. ", "All speculation on the matter, however, was set at rest\non the body being brought home, for the cat flew at the corpse, and could\nwith difficulty be kept off.", "\n\n\n * * * * *\n\nIMPROMPTU ON RELIEVING A BEGGAR.", "\n\n_(For the Mirror.)_", "\n\n\n Take this, old man, thy looks bespeak thy need,\n And pity never questions want and woe;\n A bright-hair'd angel registers the deed\n In heaven--the meed of charity below!", "\n\nH.M.L.\n\n\n * * * * *\n\n\nRosamond's Labyrinth--We shall feel obliged by a call from the gentleman\nwho favoured us with the original of this engraving; or, if more\nconvenient, by a note enclosing his address.", "\n\n\n\n\n\n\n\n\n\nEnd of the Project Gutenberg EBook of The Mirror of Literature, Amusement,\nand Instruction, by Various\n\n*** " ]

{ "pile_set_name": "Gutenberg (PG-19)" }

[ 0.0006350356852635741, 0.0010945434914901853, 0.0013781859306618571, 0.0007159607484936714, 0.0007448337855748832, 0.000757513043936342, 0.000844320107717067, 0.0006577734020538628, 0.0006210148567333817, 0.0006846905453130603, 0.0008588845958001912, 0.0009575607255101204, 0.0008176476112566888, 0.0015511400997638702, 0.0009806022280827165, 0.0006009729695506394, 0.0005991742946207523, 0.0006444812170229852, 0.0013893507421016693, 0.0006640867795795202, 0.0014386031543835998, 0.0008415826596319675, 0.0006405715248547494, 0.0005480721010826528, 0.0005953926010988653, 0.0006866577896289527, 0.0007024986553005874, 0.0008228331571444869, 0.00065536581678316, 0.0009943452896550298, 0.001320775831118226, 0.0012008625781163573, 0.0007262587314471602, 0.0006327013834379613, 0.0008286975207738578, 0.0008091986528597772, 0.0007956784102134407, 0.0007048166007734835, 0.000907778856344521, 0.0014361091889441013, 0.0016940201167017221, 0.0009778435342013836, 0.0035652455408126116, 0.0008603106252849102, 0.002727616811171174, 0.0018758149817585945, 0.005770400166511536, 0.0008850612211972475, 0.004275288432836533, 0.006491780746728182, 0.0026539303362369537, 0.008826547302305698, 0.0007741602603346109, 0.003944580443203449, 0.02003260888159275, 0.0032505705021321774, 0.016622530296444893, 0.025803830474615097, 0.011021868325769901, 0.02735866792500019, 0.010492991656064987, 0.0006265983101911843, 0.011634589172899723, 0.02622600458562374, 0.0057513234205543995, 0.0020722353365272284, 0.0014572691870853305, 0.0012376526137813926, 0.0006965950015000999, 0.0005888823652639985, 0.0014253801200538874, 0.0010585261043161154, 0.0007580503588542342, 0.010009336285293102, 0.0011529382318258286, 0.0007819695165380836, 0.0007145678391680121, 0.0006919159204699099, 0.01050913892686367, 0.0007110121077857912, 0.0007262587314471602, 0.0008012940525077283, 0.0021770314779132605, 0.0009100157767534256, 0.02255983091890812, 0.2854805290699005, 0.0008651620009914041, 0.003878713119775057, 0.0009809848852455616, 0.005397542845457792, 0.0012346566654741764, 0.008224696852266788, 0.0030308763962239027, 0.003982773050665855, 0.033518142998218536, 0.0017175268149003386, 0.0007262587314471602, 0.0006241255323402584, 0.003925159107893705, 0.0010537082562223077, 0.0005864573176950216, 0.0009486448834650218, 0.0007567994762212038, 0.0005549800698645413, 0.0038964212872087955, 0.000663736485876143, 0.0006134953000582755, 0.0006504469201900065, 0.0006508767255581915, 0.0005955906817689538, 0.003982773050665855, 0.005070889368653297, 0.0009777769446372986, 0.0008902847766876221, 0.0006183662335388362, 0.0005790501600131392, 0.000696207454893738, 0.0006774204666726291, 0.0007262587314471602, 0.0005451113684102893, 0.0006071195239201188, 0.0008982637082226574, 0.000770021986681968, 0.0006988857639953494, 0.0011021385435014963, 0.0006496682181023061, 0.016987530514597893, 0.0007032197900116444, 0.0007308289059437811, 0.0005932697677053511, 0.0006884604808874428, 0.000684061786159873, 0.0005915783694945276, 0.0007143308757804334, 0.0013112793676555157, 0.0007908451370894909, 0.0005852049216628075, 0.0005355408065952361, 0.00059867138043046, 0.0007623331039212644, 0.0006314516649581492, 0.0005371079314500093, 0.0006057581049390137, 0.0006428524502553046, 0.0005871318280696869, 0.0010711239883676171, 0.001349207479506731, 0.0009853481315076351, 0.0007471502176485956, 0.005852970760315657, 0.0006965950015000999, 0.0005363745149224997, 0.0006056605488993227, 0.0005877894000150263, 0.0008710676338523626, 0.0011513030622154474, 0.0007141927490010858, 0.001066100667230785, 0.0006053465767763555, 0.004860172513872385, 0.000579318730160594, 0.0018229895504191518, 0.0007284762104973197, 0.0008938777609728277, 0.03591901436448097, 0.030459130182862282, 0.026330793276429176, 0.0010192911140620708, 0.0006259030196815729, 0.00080014270497486, 0.0009512963588349521, 0.0007262587314471602, 0.0008135313400998712, 0.0010019977344200015, 0.0008225133060477674, 0.0007516293553635478, 0.0006521340110339224, 0.0007165101706050336, 0.0012774633942171931, 0.0007094499305821955, 0.0011774224694818258, 0.0007931019645184278, 0.0007766547496430576, 0.0017542712157592177, 0.0013615528587251902, 0.0008316303719766438, 0.0005818709032610059, 0.003929866943508387, 0.0205952487885952, 0.0008218406583182514, 0.007507034577429295, 0.012689240276813507, 0.0006680039223283529, 0.0008147353073582053, 0.001131753670051694, 0.0017650795634835958, 0.11667871475219727, 0.0015218447661027312, 0.3645709455013275, 0.012363261543214321, 0.0009164996445178986, 0.03203282505273819, 0.0008583242306485772, 0.002043325686827302, 0.00235316576436162, 0.018993228673934937, 0.0009001026628538966, 0.0009079946903511882, 0.003482444677501917, 0.0007457826868630946, 0.012862518429756165, 0.0012496374547481537, 0.0012258283095434308, 0.0008494143257848918, 0.06078268587589264, 0.04540206119418144, 0.0011703255586326122, 0.0008282748167403042, 0.0008021275862120092, 0.0008794902241788805, 0.963044285774231, 0.06922078132629395, 0.028995221480727196, 0.0006571420817635953, 0.0013025555526837707, 0.006443750578910112, 0.003660788992419839, 0.0018686229595914483, 0.0026038959622383118, 0.011255927383899689, 0.08836738765239716, 0.001512570190243423, 0.04834746569395065, 0.03540428727865219, 0.0016265468439087272, 0.12214244157075882, 0.000821321620605886, 0.0024176386650651693, 0.007454494945704937, 0.4245859384536743, 0.000602052197791636, 0.005219446960836649, 0.0007940729265101254, 0.0006929347873665392, 0.0007807550136931241, 0.0005900917458347976, 0.000532741192728281, 0.0009503985056653619, 0.000687067920807749, 0.0008181826560758054, 0.0007283727172762156, 0.0006466440390795469, 0.0006301482790149748, 0.0007235354860313237, 0.012959286570549011, 0.11172352731227875, 0.0011811344884335995, 0.0008187196799553931, 0.0012560095638036728, 0.0007702986476942897, 0.0009768044110387564, 0.0009231401490978897, 0.0009450075449422002, 0.0045556663535535336, 0.0018426032038405538, 0.000889608112629503, 0.008244546130299568, 0.000624636362772435, 0.0008054397767409682, 0.000580602849368006, 0.0007088204147294164, 0.000763143936637789, 0.0006429428467527032, 0.0005500834085978568, 0.0014853283064439893, 0.005654892418533564, 0.0008307235548272729, 0.0005768756382167339, 0.0007352913962677121, 0.0007138300570659339, 0.0011104366276413202, 0.0010869851103052497, 0.01579485461115837, 0.0007524911197833717, 0.0006493658293038607, 0.021743515506386757, 0.0006468095816671848, 0.0013433395652100444, 0.0007439385517500341, 0.0005862477701157331, 0.0009786731097847223, 0.0169456098228693, 0.30431807041168213, 0.0006277741631492972, 0.001265050726942718, 0.0009384164004586637, 0.001861611264757812, 0.0011766275856643915, 0.007122160866856575, 0.0006700454978272319, 0.0009559081518091261, 0.0008627828792668879, 0.0008592943195253611, 0.0007823033374734223, 0.000704405305441469, 0.0033208602108061314, 0.0030244356021285057, 0.023738238960504532, 0.0011547738686203957, 0.000628902402240783, 0.001629395643249154, 0.018107019364833832, 0.0010225757723674178, 0.004655450116842985, 0.02253051847219467, 0.0016110814176499844, 0.0012407115427777171, 0.062397077679634094, 0.008885764516890049, 0.00110782275442034, 0.0012413811637088656, 0.0008699714671820402, 0.017296770587563515, 0.0007313290843740106, 0.0005918530514463782, 0.0006037453422322869, 0.04514266178011894, 0.0007591831381432712, 0.0007374306442216039, 0.0008069589966908097, 0.002090316265821457, 0.0006119882455095649, 0.004113402683287859, 0.0076118214055895805, 0.0008091269410215318, 0.0008691599359735847, 0.0021086721681058407, 0.8003627061843872, 0.0016364379553124309, 0.0007684229058213532, 0.001008767751045525, 0.0011261581676080823, 0.001403379486873746, 0.012886346317827702, 0.0007760493317618966, 0.000584419525694102, 0.0007680956623516977, 0.0007007822277955711, 0.009024210274219513, 0.000707403349224478, 0.0009944281773641706, 0.0005862726247869432, 0.0005587844643741846, 0.0007576289353892207, 0.0007274826639331877, 0.0009089346858672798, 0.0006107058725319803, 0.0006191511056385934, 0.0006440099095925689, 0.0008945618174038827, 0.0067952168174088, 0.000695413735229522, 0.002964574610814452, 0.0006367070600390434, 0.0007272630464285612, 0.0009794528596103191, 0.0005674768472090364, 0.0006026906194165349, 0.0018796623917296529, 0.0032878953497856855, 0.001074408064596355, 0.001280366093851626, 0.0008624364272691309, 0.0008383903186768293, 0.0020709489472210407, 0.0006616116734221578, 0.0010678336257115006, 0.000668285705614835, 0.0005937641835771501, 0.008607694879174232, 0.0007692090002819896, 0.000974281458184123, 0.0005600164295174181, 0.0006174297886900604, 0.0007796665304340422, 0.0009350868058390915, 0.0006710856105200946, 0.001056633540429175, 0.0007496228790841997, 0.0014130836352705956, 0.0005897515802644193, 0.0008328076801262796, 0.002251733560115099, 0.0006335696671158075, 0.0006946575595065951, 0.0007956567569635808, 0.0007892422727309167, 0.0006430338253267109, 0.013645008206367493, 0.0009227958507835865, 0.0032641757279634476, 0.0007603440899401903, 0.0030264260713011026, 0.0007294678944163024, 0.001360310590825975, 0.0018918052082881331, 0.000592555501498282, 0.0006626860122196376, 0.0009239923674613237, 0.0006230782601051033, 0.004921368323266506, 0.0007658569957129657, 0.007937111891806126, 0.0012119285529479384, 0.04151865839958191, 0.0014848278369754553, 0.0028768416959792376, 0.0007631377666257322, 0.0013674331130459905, 0.0011188846547156572, 0.003745313733816147, 0.0008092977805063128, 0.0010621732799336314, 0.3142130374908447, 0.0008571130456402898, 0.004567327443510294, 0.13360577821731567, 0.004769268445670605, 0.0007825478678569198, 0.0005986182950437069, 0.0035481720697134733, 0.013832170516252518, 0.0007361303432844579, 0.000737725873477757, 0.004512501414865255, 0.001050685066729784, 0.003803115338087082, 0.0006766984006389976, 0.003041132353246212, 0.0006752189947292209, 0.007116359658539295, 0.12509092688560486, 0.0011379225179553032, 0.09333349764347076, 0.0008502014097757638, 0.6653167009353638, 0.0007262289873324335, 0.05746156722307205, 0.0006070715025998652, 0.0008015530183911324 ]

[ "An immobilized antibody targeting N-cadherin facilitates spread of N-cadherin-positive tumour cells.", "\nWe investigated whether an antibody targeting N-cadherin facilitates the adhesion and spreading of N-cadherin-positive tumour cells under static conditions. ", "Two human melanoma cell lines, HMB-2 and BLM, were selected for their presence and lack of expression of N-cadherin, respectively. ", "In vitro adhesion experiments were performed in the presence of a monoclonal antibody targeting N-cadherin (GC-4) or a control (antibody to α-tubulin). ", "Quantitative data from the spreading assays were calculated by converting the images obtained by fluorescence microscopy to binary images. ", "For HMB-2 cells, the average cell width was significantly larger in the presence of GC-4 vs. control at all measured time points, with the exception of the measurement at 70 minutes (p=0.051). ", "No differences were observed between controls and GC-4 for BLM cells. ", "The adhesion and spread of N-cadherin-positive tumour cells can be facilitated by the presence of an immobilized antibody to N-cadherin." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0013136918423697352, 0.0006008956115692854, 0.0007330148364417255, 0.000620563339907676, 0.0005937664536759257, 0.0005841272068209946, 0.0006173227448016405, 0.0008518037502653897 ]

[ "\n264 P.3d 534 (2011)\n2011 UT App 335\nWade S. WINEGAR and Sandra Winegar, Plaintiffs and Appellants,\nv.\nSPRINGVILLE CITY, Defendant and Appellee.", "\nNo. ", "20110640-CA.", "\nCourt of Appeals of Utah.", "\nOctober 6, 2011.", "\nTodd S. Winegar, Salt Lake City; and Wade S. Winegar, Lehi, for Appellants.", "\nDennis C. Ferguson, Salt Lake City, for Appellee.", "\nBefore Judges DAVIS, VOROS, and ROTH.", "\n\nDECISION\nPER CURIAM:\n¶ 1 Wade S. and Sandra Winegar appeal the district court's ruling and order entered on June 7, 2011. ", "This matter is before the court on a sua sponte motion for summary disposition. ", "We dismiss the appeal without prejudice.", "\n¶ 2 Generally, \"[a]n appeal is improper if it is taken from an order or judgment that is not final.\" ", "Bradbury v. Valencia, 2000 UT 50, ¶ 9, 5 P.3d 649. ", "This court lacks jurisdiction to consider an appeal unless it is taken from a final, appealable order. ", "See id. ¶ 8. ", "Previously, a signed minute entry could be considered to be a final, appealable order so long as it specified with certainty a final determination of the rights of the parties and was susceptible to enforcement. ", "See Dove v. Cude, 710 P.2d 170, 171 (Utah 1985).", "\n¶ 3 The Utah Supreme Court has determined that the prior framework for analyzing finality of a minute entry or order for purposes of appeal was unworkable. ", "See Giusti v. Sterling Wentworth Corp., 2009 UT 2, ¶¶ 30-36, 201 P.3d 966. ", "After the supreme court's decision in Giusti, whenever the district court \"intends any `document' to constitute its final action,\" the court \"must explicitly direct that no additional order is necessary.\" ", "Id. ¶ 32. ", "Otherwise, if the district court does not expressly direct that its order is the final order of the court, rule *535 7(f)(2) of the Utah Rules of Civil Procedure requires the prevailing party to prepare and file an order to trigger finality for purposes of appeal. ", "See id. ¶ 30. ", "If the prevailing party does not prepare and file an order in accordance with rule 7(f)(2), the non-prevailing party must do so. ", "See id. ¶ 38.", "\n¶ 4 Relying upon Code v. Utah Dept. ", "of Health, 2007 UT 43, 162 P.3d 1097, Winegars argue that Giusti is not applicable where the parties agree that a decision is final, despite the fact that it was not entered in compliance with rule 7(f)(2), and the result is to \"preserve appeal rights.\" ", "This argument ignores the clear language of Giusti, in which the supreme court stated that \"our broad holding in Code is inclusive of all final district court decisions, regardless of how they are styled\" and that \"the requirements of rule 7(f)(2) apply to every final decision issued by a district court, not just memorandum decisions or minute entries.\" ", "Giusti, 2009 UT 2, ¶ 31, 201 P.3d 966. \"", "It is the entry of the final order according to rule 7(f)(2) that triggers the appeal period.\" ", "Id. ¶ 35. ", "Noting that \"[t]he strict application of rule 7(f)(2) supports the judicial policy favoring finality,\" the supreme court stated in Giusti that it took that \"opportunity to clarify that the rule's requirements and the policy supporting the rule apply to all final decisions regardless of how they are styled.\" ", "Id. ¶ 36. ", "Accordingly, the supreme court stated,\nThe rule is clear. ", "A prevailing party shall prepare for entry a proposed order in conformity with the court's decision. ", "There are only two exceptions to this mandate. ", "First, if the court approves a proposed order that is submitted with an initial memorandum, then no additional order is necessary. ", "Second, if the court directed that no additional order is necessary, then none is.", "\nId. ¶ 27.", "\n¶ 5 The June 7, 2011 ruling and order does not satisfy the requirements of Giusti. ", "The district court did not expressly state that the June 7, 2011 ruling and order was the final order of the court. ", "Furthermore, neither party submitted a proposed final order that would satisfy the requirements set forth in rule 7(f)(2) of the Utah Rules of Civil Procedure and Giusti. ", "See id. Thus, the June 7, 2011 ruling and order is not final for purposes of appeal, and this court lacks jurisdiction to consider the appeal. ", "See Bradbury, 2000 UT 50, ¶ 9, 5 P.3d 649. ", "When this court lacks jurisdiction, we have only the authority to dismiss the appeal. ", "See Varian-Eimac, Inc. v. Lamoreaux, 767 P.2d 569, 570 (Utah Ct.", "App.1989).", "\n¶ 6 Accordingly, the appeal is dismissed without prejudice to the filing of a timely appeal after the entry of a final appealable order.", "\n" ]

{ "pile_set_name": "FreeLaw" }

[ 0.0006540582980960608, 0.001378453802317381, 0.0008331811404787004, 0.0007851783302612603, 0.0007100384100340307, 0.0006381830899044871, 0.000687721068970859, 0.00067271658917889, 0.0006244754185900092, 0.0007343226461671293, 0.0007611114415340126, 0.0007437961176037788, 0.0007149655721150339, 0.0007662763819098473, 0.0007056287722662091, 0.0005483289714902639, 0.0006105527281761169, 0.000573826371692121, 0.0006626194226555526, 0.0006207476835697889, 0.006205846089869738, 0.0006541521288454533, 0.0008487852755934, 0.0006104896310716867, 0.0007011787383817136, 0.0006323035340756178, 0.0006543868803419173, 0.0006461075390689075, 0.0006864104652777314, 0.0006007321644574404, 0.0024776773061603308, 0.000708624953404069, 0.0038292917888611555, 0.0006106592481955886, 0.0005643448675982654, 0.0006303885020315647, 0.0005827403510920703, 0.0007619093521498144, 0.002578341169282794, 0.0006598535692319274, 0.0006606447859667242, 0.0006336530204862356, 0.0006307121948339045, 0.0006215047324076295, 0.0008568876073695719, 0.0006414377712644637, 0.0006981762126088142, 0.0006572582642547786, 0.001995587022975087 ]

[ "You can purchase tickets 120 days before the date of travel. ", "Tickets for some trains on routes to/from CIS countries and Baltic states can be sold up to 45 days in advance.", "Domestic tickets can be booked from 25.05.2019 to 21.09.2019International tickets and tickets for certain domestic trains can be booked from 25.05.2019 to 23.07.2019" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006352114723995328, 0.0005661025061272085, 0.0007625059806741774 ]

[ "Interaction of 5-hydroxytryptamine and ketanserin in rat vas deferens subjected to low frequency field stimulation.", "\nThe interaction of 5-hydroxytryptamine (5HT) and ketanserin was investigated in isolated rat vas deferens. ", "Ketanserin (10(-7) M) almost completely abolished the phasic and the following rhythmic contractions induced by 5HT, whereas the inhibition by prazosin (10(-6) M) or methysergide (10(-6) M) of 5HT-induced contractions were incomplete. ", "The amplitude of twitch contractions of vas deferens subjected to low frequency (0.1 Hz) field stimulation were substantially unchanged by 5HT (10(-7)-10(-5) M) per se. ", "After pretreatment of the tissue with ketanserin (10(-8)-10(-6) M), 5HT, in a concentration-dependent manner, attenuated the amplitude of twitch contractions. ", "Such attenuation of the amplitude was not observed after pretreatments with methysergide (10(-8)-10(-6) M) or prazosin (10(-7)-10(-5) M). ", "The 5HT-induced inhibition of twitch contractions in the presence of ketanserin was not antagonized by phentolamine, propranolol, methysergide, morphine, promethazine, cimetidine, atropine or indomethacin. ", "It is suggested that 5HT has dual (excitatory and inhibitory) effects upon nerve transmission of rat vas deferens, and only the excitatory effect is suppressed by ketanserin." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0010736893163993955, 0.0015921784797683358, 0.0010649539763107896, 0.001042538438923657, 0.000824290094897151, 0.0008411021553911269, 0.0019224690040573478, 0.002395912306383252 ]

[ "Demo 98\n\nDemo 98 is the first demo and release by the Blackened death metal band Crionics. ", "The demo is actually named Demo 98 and the cover on the right is the original cover that goes with the demo. ", "Featuring only a calm winter nature photo, without the title and the original Crionics logo which they are still using today on their releases.", "\n\nYanuary made his first appearance on this demo, but left the band later on. ", "He came back to Crionics after a couple of years although not as the guitarist, but as the bassist. ", "A year after the band was formed, they recorded five songs. ", "However, this material never saw the light because of its bad production. ", "About six months later after they recorded the songs, the band decided to record a four-song Demo 98. ", "This is that same demo featuring four song of the original five songs they recorded. ", "Because of the poor equipment the material wasn’t exactly perfect, but the band decided to promote it anyway. ", "They played a few shows and started looking for a keyboardist that would enhance their sound. ", "Vac-V was the man that quickly became the missing link in their music and the band's music started to sound more interesting and complete at their shows. ", "He joined the band later on and made its first appearance on their next release and first EP, Beyond the Blazing Horizon.", "\n\nTrack listing\n\n \"Mystic Past\" - 4:12\n \"Pagan Strength\" - 4:01\n \"Black Warriors\" - 5:29\n \"I Am the Black Wizards\" - 5:11 (Emperor cover)\n\nTotal playing time 18:53\n\nNotes\n The song Black Warriors was later re-recorded on the Neuthrone release in 2007.", "\n\nPersonnel\n Michał \"War-A.N\" Skotniczny - guitars, vocals\n Dariusz \"Yanuary\" Styczeń - guitars\n Maciej \"Carol\" Zięba - drums, keymaster\n Marcotic - bass\n G. Sznyterman - engineering\n\nExternal links\n \n Encyclopaedia Metallum\n\nCategory:1998 albums\nCategory:Demo albums\nCategory:Crionics albums" ]

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

[ 0.0012236107140779495, 0.0006687810528092086, 0.0006411404465325177, 0.0006840370479039848, 0.0007525950786657631, 0.0006045416812412441, 0.0006971984403207898, 0.0006057944265194237, 0.0005895441281609237, 0.000896891055162996, 0.000596360070630908, 0.0007799827144481242, 0.0006305552669800818, 0.000679967924952507, 0.0007696236716583371 ]

[ "\nTwo letters picked without replacement from dcmmmdmczc. ", "What is prob of sequence dd?", "\n1/45\nFour letters picked without replacement from kttktttktt. ", "What is prob of sequence tkkk?", "\n1/120\nFour letters picked without replacement from {j: 1, f: 12, i: 6}. ", "What is prob of sequence ijff?", "\n11/1292\nThree letters picked without replacement from {k: 6, c: 3, r: 4}. ", "What is prob of sequence rrc?", "\n3/143\nThree letters picked without replacement from ggggjgj. ", "Give prob of sequence gjg.", "\n4/21\nWhat is prob of sequence yhxx when four letters picked without replacement from {y: 2, x: 4, h: 3}?", "\n1/42\nThree letters picked without replacement from {i: 3, c: 13}. ", "Give prob of sequence ici.", "\n13/560\nWhat is prob of sequence bf when two letters picked without replacement from wbwfwswwbwss?", "\n1/66\nTwo letters picked without replacement from {u: 2, o: 1, q: 1, m: 2}. ", "Give prob of sequence qo.", "\n1/30\nThree letters picked without replacement from ycech. ", "What is prob of sequence eyh?", "\n1/60\nWhat is prob of sequence no when two letters picked without replacement from {o: 1, c: 1, n: 1, x: 1, q: 3}?", "\n1/42\nWhat is prob of sequence pip when three letters picked without replacement from ipliiiilppieiepie?", "\n2/85\nThree letters picked without replacement from {b: 3, t: 13}. ", "Give prob of sequence ttb.", "\n39/280\nTwo letters picked without replacement from {k: 5, j: 1, c: 4, i: 3, s: 1}. ", "What is prob of sequence js?", "\n1/182\nThree letters picked without replacement from ccfczecccccq. ", "What is prob of sequence zfq?", "\n1/1320\nWhat is prob of sequence cj when two letters picked without replacement from {c: 5, j: 7}?", "\n35/132\nThree letters picked without replacement from cnpucnfcnccc. ", "Give prob of sequence ucn.", "\n3/220\nFour letters picked without replacement from dedwwwweyev. ", "What is prob of sequence vwyd?", "\n1/990\nFour letters picked without replacement from hehycchhhhhe. ", "Give prob of sequence eych.", "\n7/2970\nThree letters picked without replacement from yppyeseyspy. ", "Give prob of sequence sep.", "\n2/165\nTwo letters picked without replacement from ulxuuubl. ", "Give prob of sequence bx.", "\n1/56\nCalculate prob of sequence qqqi when four letters picked without replacement from nqnqiqq.", "\n1/35\nFour letters picked without replacement from nwnnbnw. ", "What is prob of sequence bnww?", "\n1/105\nCalculate prob of sequence hxx when three letters picked without replacement from {h: 11, a: 1, x: 8}.", "\n77/855\nCalculate prob of sequence em when two letters picked without replacement from meeevvvmvvvevv.", "\n4/91\nCalculate prob of sequence ki when two letters picked without replacement from {k: 2, c: 1, m: 1, i: 4}.", "\n1/7\nTwo letters picked without replacement from kkwkw. ", "What is prob of sequence kk?", "\n3/10\nThree letters picked without replacement from ruru. ", "What is prob of sequence uur?", "\n1/6\nThree letters picked without replacement from uuzuuuuzzuzuuz. ", "What is prob of sequence uuu?", "\n3/13\nThree letters picked without replacement from {v: 5, a: 2, w: 13}. ", "What is prob of sequence vva?", "\n1/171\nCalculate prob of sequence cx when two letters picked without replacement from {c: 3, f: 7, x: 9}.", "\n3/38\nFour letters picked without replacement from {r: 4, m: 15}. ", "Give prob of sequence mmrm.", "\n455/3876\nThree letters picked without replacement from yyvyyyyyyyyvvvyyvv. ", "Give prob of sequence yvv.", "\n5/68\nWhat is prob of sequence orq when three letters picked without replacement from {x: 3, r: 2, e: 1, o: 2, q: 4}?", "\n2/165\nTwo letters picked without replacement from {z: 1, t: 2, n: 1, c: 1, l: 2, k: 2}. ", "What is prob of sequence lc?", "\n1/36\nTwo letters picked without replacement from ttsudududre. ", "What is prob of sequence su?", "\n3/110\nCalculate prob of sequence tt when two letters picked without replacement from {y: 2, t: 4}.", "\n2/5\nThree letters picked without replacement from {g: 6, v: 2, f: 3, m: 2, t: 1, q: 6}. ", "Give prob of sequence tmv.", "\n1/1710\nWhat is prob of sequence thtt when four letters picked without replacement from {y: 4, h: 7, u: 3, t: 4}?", "\n7/3060\nWhat is prob of sequence ws when two letters picked without replacement from uws?", "\n1/6\nWhat is prob of sequence ggg when three letters picked without replacement from {g: 3}?", "\n1\nThree letters picked without replacement from vtvvvtttvtvvt. ", "What is prob of sequence ttt?", "\n10/143\nTwo letters picked without replacement from sooddoo. ", "What is prob of sequence od?", "\n4/21\nCalculate prob of sequence hfev when four letters picked without replacement from {h: 1, e: 1, f: 1, v: 1, z: 1, y: 2}.", "\n1/840\nTwo letters picked without replacement from saisaosaaaaoo. ", "What is prob of sequence ia?", "\n1/26\nCalculate prob of sequence xgxg when four letters picked without replacement from {m: 1, o: 1, s: 1, g: 2, h: 2, x: 1}.", "\n0\nCalculate prob of sequence vj when two letters picked without replacement from jbatbvt.", "\n1/42\nWhat is prob of sequence drd when three letters picked without replacement from drhrhdrrhhhrhrhdhdrr?", "\n4/285\nFour letters picked without replacement from {y: 8, q: 3, v: 3, f: 3}. ", "What is prob of sequence vvyv?", "\n1/1190\nTwo letters picked without replacement from {e: 2, r: 2, c: 3, t: 1, g: 2, y: 2}. ", "Give prob of sequence gg.", "\n1/66\nThree letters picked without replacement from loonoaolnaoonloo. ", "What is prob of sequence nao?", "\n1/70\nThree letters picked without replacement from {p: 4, d: 3, t: 1, f: 6, r: 1, l: 1}. ", "What is prob of sequence ptl?", "\n1/840\nThree letters picked without replacement from {h: 1, w: 1, n: 2, e: 1, b: 1, z: 1}. ", "What is prob of sequence hbe?", "\n1/210\nTwo letters picked without replacement from {x: 4, z: 2}. ", "Give prob of sequence xx.", "\n2/5\nWhat is prob of sequence qeq when three letters picked without replacement from {e: 3, q: 13}?", "\n39/280\nCalculate prob of sequence dsj when three letters picked without replacement from {d: 3, s: 7, j: 3}.", "\n21/572\nWhat is prob of sequence dt when two letters picked without replacement from tthwwowtwcwotwtd?", "\n1/48\nCalculate prob of sequence un when two letters picked without replacement from nnnunnnnnunnnnnnnnn.", "\n17/171\nCalculate prob of sequence pzpe when four letters picked without replacement from {z: 2, e: 1, q: 1, p: 5, o: 1}.", "\n1/126\nCalculate prob of sequence aqq when three letters picked without replacement from qaqa.", "\n1/6\nThree letters picked without replacement from {q: 1, m: 10, g: 7}. ", "What is prob of sequence qgg?", "\n7/816\nCalculate prob of sequence bbb when three letters picked without replacement from bbgrrgbgbrrrbrrggggr.", "\n1/114\nTwo letters picked without replacement from {m: 1, t: 5, o: 1, w: 1, n: 3}. ", "Give prob of sequence wn.", "\n3/110\nWhat is prob of sequence ofo when three letters picked without replacement from {o: 3, p: 4, f: 2}?", "\n1/42\nWhat is prob of sequence hl when two letters picked without replacement from {h: 1, c: 1, l: 1, s: 2, z: 4}?", "\n1/72\nFour letters picked without replacement from {i: 5, m: 1, o: 3, q: 1}. ", "Give prob of sequence moqi.", "\n1/336\nWhat is prob of sequence ttr when three letters picked without replacement from {r: 17, t: 3}?", "\n17/1140\nTwo letters picked without replacement from yhyyyrryrh. ", "Give prob of sequence hy.", "\n1/9\nTwo letters picked without replacement from {l: 1, w: 4, n: 2, o: 3, p: 3, g: 3}. ", "Give prob of sequence lo.", "\n1/80\nCalculate prob of sequence eo when two letters picked without replacement from {x: 1, t: 1, o: 2, e: 2, k: 5, u: 2}.", "\n1/39\nCalculate prob of sequence nn when two letters picked without replacement from nwxnnnyyxwwynnnnnnn.", "\n55/171\nWhat is prob of sequence faf when three letters picked without replacement from {f: 4, a: 2}?", "\n1/5\nFour letters picked without replacement from xnizixiiziniiinixzil. ", "What is prob of sequence iizz?", "\n3/646\nThree letters picked without replacement from qlaaaallql. ", "What is prob of sequence qlq?", "\n1/90\nTwo letters picked without replacement from {h: 3, y: 5, x: 1, u: 7, a: 3}. ", "What is prob of sequence uu?", "\n7/57\nThree letters picked without replacement from twtbrwrbrwqrrwtr. ", "Give prob of sequence twr.", "\n3/140\nCalculate prob of sequence hu when two letters picked without replacement from {r: 1, x: 1, u: 1, z: 2, v: 2, h: 2}.", "\n1/36\nTwo letters picked without replacement from ktklbttttktbl. ", "What is prob of sequence lt?", "\n1/13\nThree letters picked without replacement from gggwgwgwgwwwwwwgwwgg. ", "Give prob of sequence ggw.", "\n11/95\nWhat is prob of sequence mxxm when four letters picked without replacement from xxmmmxx?", "\n3/35\nTwo letters picked without replacement from {x: 13, " ]

{ "pile_set_name": "DM Mathematics" }

[ 0.0007259355625137687, 0.0007965537952259183, 0.01143915019929409, 0.18556630611419678, 0.000694778049364686, 0.0010533735621720552, 0.0006986893131397665, 0.0006891191587783396, 0.13894952833652496, 0.003325794357806444, 0.0010134788462892175, 0.0006574327708221972, 0.000737095542717725, 0.0013696827227249742, 0.0008404551190324128, 0.0008943752618506551, 0.0008892170153558254, 0.0009369337931275368, 0.0009972896659746766, 0.027472341433167458, 0.0006564456853084266, 0.0007509710267186165, 0.0006580172921530902, 0.0007394876447506249, 0.0016657107044011354, 0.0007620051619596779, 0.0007858052267692983, 0.0006925063789822161, 0.0007946773548610508, 0.0007089120335876942, 0.0008549343910999596, 0.005738239269703627, 0.0010306406766176224, 0.021456539630889893, 0.0006710962043143809, 0.0016746686305850744, 0.0007876745657995343, 0.0007314639515243471, 0.000785847834777087, 0.0008449663873761892, 0.0006697250646539032, 0.0012729293666779995, 0.0006766545702703297, 0.000765618693549186, 0.0007788994116708636, 0.000740348594263196, 0.000799423607531935, 0.006009500473737717, 0.004450829699635506, 0.0006816239911131561, 0.0007451103301718831, 0.0006363652064464986, 0.0006796239176765084, 0.0007708306657150388, 0.0014024463016539812, 0.0008876006468199193, 0.000988283776678145, 0.0008182075689546764, 0.0006961453473195434, 0.0008130028145387769, 0.0007701581926085055, 0.0006899642175994813, 0.0007822597399353981, 0.0008290730766020715, 0.0011971000349149108, 0.0011118323309347034, 0.0026970317121595144, 0.001993906917050481, 0.0007844865322113037, 0.0009132626582868397, 0.0007760729058645666, 0.0007360910531133413, 0.001428932067938149, 0.0006886930204927921, 0.00077741191489622, 0.0007457457832060754, 0.010298444889485836, 0.0006758551462553442, 0.0008308059186674654, 0.0007644296856597066, 0.0034839308355003595, 0.001508388202637434, 0.0008701045881025493, 0.0008215728448703885, 0.0007359024020843208, 0.0007289956556633115, 0.000748469028621912, 0.0006722695543430746, 0.0006980145117267966, 0.0008182115270756185, 0.0006276736385188997, 0.007927839644253254, 0.01432761363685131, 0.0007659342954866588, 0.0006622219807468355, 0.0007036930765025318, 0.000937890843488276, 0.014661814086139202, 0.0007928117993287742, 0.0008631031378172338, 0.0010475742164999247, 0.0009388788021169603, 0.0007495518075302243, 0.0007745494949631393, 0.0007458836189471185, 0.0008293939172290266, 0.0009153803694061935, 0.0007924908422864974, 0.0010643262648954988, 0.0008680885075591505, 0.00736054964363575, 0.011312101036310196, 0.000984942656941712, 0.0007480600033886731, 0.0018430898198857903, 0.0007359303999692202, 0.0008013929473236203, 0.0008378975326195359, 0.0011838728096336126, 0.00116630457341671, 0.000857394770719111, 0.009879492223262787, 0.0007220394327305257, 0.07297931611537933, 0.0010994550539180636, 0.0008476888760924339, 0.0006984516512602568 ]

[ "Introduction {#Sec1}\n============\n\nOur ability to locate and act on objects in space is a fundamental requirement of our daily life activities. ", "This function is generally achieved by monitoring the position and movement of the body in relation to events located in external space. ", "In touch, spatial localization is initially defined by which receptors on the skin are active; that is, in a skin-based or internal reference frame. ", "However, because the limbs move in the space surrounding the body, the spatial location of an object that enters in contact with the skin and/or on which an action is made requires the brain to integrate internal coordinates with information about current body posture. ", "This process has been referred to as tactile remapping^[@CR1],[@CR2]^ and has been denoted as occurring in external coordinates. ", "The external reference frame refers to a spatial coordinate system that abstracts from the original source but that can still be egocentric -- eye-centered, head-centered or trunk centered. \"", "External\" should therefore not be understood as implying independence of the body^[@CR3],[@CR4]^. Within this context, tactile localization has been recently defined as a two-step process, in which tactile information (internal coordinates) are first remapped into an external representation^[@CR3]^. Then anatomical and external spatial information are integrated according to a specific weighting scheme.", "\n\nThe most widespread experimental paradigm that has been used to examine which weighting scheme is associated to the spatial localization of touch is probably the temporal order judgment task (TOJ)^[@CR5],[@CR6]^. In this task, participants have to determine, with their hands uncrossed or crossed over the body midline, which of their two hands received a tactile stimulus first. ", "Crossing the hands actually induces a conflict between the internal and external coordinate systems: with crossed hands, the right hand lies in the left hemispace while the reverse is true for the left hand^[@CR5]^. Manipulations of posture should not affect performance if spatial localization relied exclusively on internal coordinates. ", "In contrast, if a posture manipulation induces changes in task performance, this would be an indication that the external reference frame has been used to code tactile stimulus location. ", "As sighted adults are strongly impaired in the TOJ task while responding with their hands crossed over the body midline^[@CR5],[@CR6]^, the weighting scheme of touch localization in this population seems to automatically favor, even when it is not necessary, an external reference frame.", "\n\nIn contrast to sighted and late blind individuals, congenitally blind people do not manifest any crossing effects in a static TOJ task^[@CR7]^. The same observation has interestingly been made whenever congenitally or early blind had to process tactile stimuli^[@CR8],[@CR9]^, the auditory Simon effect^[@CR10]^, pointing movements toward memorized proprioceptive targets^[@CR11]^ and even numerical spatial relation^[@CR12]^. While these findings together suggest that vision drives the development of the automatic integration of internal and external coordinates^[@CR5]--[@CR7],[@CR13]--[@CR16]^, recent results demonstrated that bimanual coordination in the congenitally blind was constrained by external-spatial factors, like in the sighted^[@CR17]^ and that external coordinates may affect tactile localization in congenitally blind in the context of an action that requires external spatial coding (i.e., bimanual arm movements with uncrossed and crossed start and end postures^[@CR18]^). ", "It is therefore conceivable that congenitally blind do integrate information from internally and externally defined reference frames, but that they do so according to another weighting scheme than the sighted. ", "Integration in the congenitally blind could be restricted to situations in which the use of the non-preferred external reference frame is required by the task^[@CR2],[@CR18],[@CR19]^. The experiments reported above suggest that movement is a good candidate to bias spatial localization towards an external coordinate system in sighted as well as in blind individuals. ", "As movements are commonly used to interact with objects located in the external world (e.g., typing on a computer), relying on an external representation within a motor context would indeed seem more appropriate even in early blind individuals.", "\n\nInterestingly, within the motor literature, a variety of different laboratory-based protocols demonstrated that motor sequence learning involves, like touch perception, the processing of internal and external spatial coordinates. ", "This procedural learning actually refers to the process by which simple, stereotyped movement elements come to be performed effortlessly as a unitary well- rehearsed sequence. ", "In the most classical experiments investigating this process, participants are required to use the fingers of the right or left hand to either press buttons on a keyboard, or to lightly touch one's own thumb in a precise and sequential order. ", "The sequence of movements may be explicitly^[@CR20],[@CR21]^ or implicitly learned^[@CR22]^, self-initiated^[@CR20]^, cued by visual or acoustic stimuli^[@CR23]^, or interleaved with random movements^[@CR24]^. But, more importantly for our purposes, the sequence of movements can be learned as both a sequence of finger movements (coded in internal coordinates) and as a sequence of response buttons (coded in external coordinates). ", "These two spatial coordinates can be distinguished by probing skill with the response box turned upside-down (for a review, see ref.^[@CR25]^). ", "Internal representation of the sequence is assessed by changing the sequence of response locations but preserving the specific pattern of finger movements learned during training; external representation is assessed by changing the specific pattern of finger movements while preserving the sequence of response locations. ", "Despite all the methodological differences of the various motor sequence learning tasks described above, participants typically increase the velocity of their finger movements and decrease the interval between successive key presses with practice, resulting in a decrease of the number of errors made (a measure of accuracy) and in a decrease of the duration necessary to complete the internal and external representations of the learned sequence (a measure of speed). ", "While motor sequence learning has been extensively studied in the sighted population, we still don't know whether blindness may affect this procedural learning as it affects touch perception.", "\n\nIn this paper, we therefore examined whether vision may differentially shape the use of internal versus external spatial representations of touch and motor sequence learning. ", "Early blind and sighted controls were required to perform 2 tasks. ", "The first task was a tactile Temporal Order Judgment task (TOJ^[@CR6]^) in which participants had to determine, with their hands uncrossed or crossed over the body midline, which of their two hands received a tactile stimulus first. ", "The second task was a motor sequence learning task^[@CR26]^. In this task, participants were trained to perform a sequence of five fingers movements. ", "After the training session, participants were tested on their ability to produce, with the same hand but with the keypad turned upside down, the learned (internal condition) or the mirror sequence (external condition). ", "While the TOJ task involves passive touch, action is required to perform the motor sequence learning task. ", "Therefore, if visual deprivation prevents touch localization to be biased towards an external reference frame, but does not prevent the use of external coordinates in the motor sequence learning task, early blind should not manifest any crossing effects in the TOJ task but should be able to produce the internal and external configurations of the learned motor sequence. ", "The use of these tasks on the same participants represents a unique opportunity to test the idea that early blind do integrate information from different reference frames, but use the external coordinates with a higher selectivity according to the requirements of the task, therefore using another weighting scheme than the sighted^[@CR17],[@CR18]^.\n\nMethod {#Sec2}\n======\n\nParticipants {#Sec3}\n------------\n\nEleven blind participants and 11 sighted controls (SC) took part in the study. ", "The SC and blind groups were matched in terms of age, sex and musical knowledge (i.e., number of practices a week). ", "The blind group was composed of 3 females and 8 males ranging in age from 21 to 61 years old with a mean age of 42 years (*SD* = 13.74). ", "Nine participants were right handed, 2 were ambidextrous. ", "Causes of blindness included detachment of the retina, congenital cataract, optic nerve burned, retinitis pigmentosa, congenital malformation, retinoblastoma, medical accident, thalidomide, retinopathy of prematurity and Leber's congenital amaurosis. ", "Nine participants were congenitally blind (CB), two were early blind (EB). ", "One lost his sight at 2 months, and one lost vision in the left eye at 10 months and vision in the right eye at 3 years. ", "In this group (that we will call thereafter the EB group), 7 participants had musical training. ", "Blind individuals were totally blind or had only rudimentary sensitivity for brightness differences but never experienced patterned vision. ", "The SC group was composed of 4 females and 7 males ranging in age from 21 to 68 years old with a mean age of 43 years (*SD* = 14.13). ", "As in the EB group, 7 participants of the SC group were trained musicians (4 of them were professional musicians). ", "Musical abilities of both groups were matched as it has already been demonstrated that musicians show greater efficiency than non-musicians in motor sequence learning task^[@CR27]^. Sighted participants were blindfolded when performing the tasks. ", "The samples size was determined by the number of blind participants we were able to recruit on a 6 months period. ", "A minimal number of 10 participants was used as a cut-off since previous studies^[@CR7]^ have shown reliable results with such a number. ", "All the procedures were approved by the Research Ethics Boards of the University of Montreal. ", "All experiments were performed in accordance with relevant guidelines and regulations and informed consent was obtained from all participants. ", "Below, we report all experimental manipulations, all exclusions of data (if any), and all evaluated measures of the study.", "\n\nTasks {#Sec4}\n-----\n\n### Temporal order judgment task {#Sec5}\n\nIn this task, we used a similar procedure as the one applied by Röder and collaborators^[@CR7]^. Two successive tactile stimuli were presented for 10 ms to the distal phalanxes of the left and right middle fingers at 10 different stimulus onset asynchronies (SOAs): −200, −90, −55, −30, −15, 15, 30, 55, 90, 200. ", "Negative values indicated that the first stimulus was presented to the participant's left hand; positive values indicated that the first stimulus was presented to the participant's right hand. ", "Tactile stimuli were delivered using a pneumatic tactile stimulator (Institute for Biomagnetism and Biosignal Analysis, University of Muenster, Germany). ", "A plastic membrane (1 cm in diameter) was attached to the distal phalanxes of the left and right middle fingers and was inflated by a pulse of air pressure delivered through a rigid plastic tube. ", "The plastic tube connecting the stimulator to the participants' finger tips were inserted into the testing room through a hole padded with sound attenuating foam to ensure that tactile stimulations were completely silent from the inside of the room. ", "Participants had to press a response button placed below the index finger of the hand that they perceived to have been stimulated first. ", "Participants were asked to perform the task either with their hands in a parallel posture (i.e., uncrossed posture) or with their arms crossed over the body midline. ", "The order of posture conditions was counterbalanced across participants. ", "Hand posture was altered every two blocks. ", "Participants had to respond within a random interval ranging from 3000 to 4000 ms (from the onset of the target) otherwise the trial was terminated. ", "Each SOA was presented 32 times in both hand postures, giving rise to 640 trials in total. ", "These 640 trials were presented through 8 blocks of 80 stimuli. ", "Prior to the experiment, participants had to complete two blocks of 16 practice trials (one block in the uncrossed posture followed by one block in the crossed posture). ", "Stimuli were delivered and reaction times were recorded using Presentation software (Neurobehavioral Systems Inc.) running on a Dell XPS computer using a Windows XP operating system. ", "The two response keys were placed 40 cm in front of the participant's body and 50 cm away from each other. ", "During testing, participants sat in a silent room with the head restrained by a chin rest. ", "Participants also wore earplugs to mask any sounds made by the operation of the tactile stimulators.", "\n\nMotor sequence learning task {#Sec6}\n----------------------------\n\nThis task involved 2 separate practice sessions referred to as the training and the representation test sessions. ", "On each period, participants had to tap on a keyboard, with their non-dominant hand, a five-element finger sequence as rapidly and as accurately as possible. ", "The sequence to perform was explicitly told to the participants before training. ", "The sequence was performed in 14 successive practice blocks during the training session and 4 successive blocks during the representation test session, each practice block (composed of 60 key presses, a maximum of 12 repetitions of the same sequence) being separated by 15-second rest intervals (Fig.", " [1](#Fig1){ref-type=\"fig\"}). ", "During the training period, participants had to perform the sequence in a usual set-up (i.e., with the non-dominant hand on the keyboard and the keyboard upside-up). ", "Two different sequences were used to allow the investigation of the internal and external representations within subject. ", "As a within-subject design was used and in order to avoid between-sessions retention of motor performance, participants were trained on a different sequence at each occasion (either 4 1 3 2 4 or 2 3 1 4 2, where 1 corresponds to the index finger and 4 to the little finger, see Fig.", " [1](#Fig1){ref-type=\"fig\"}). ", "These 2 sequences had the same level of complexity: the length of the 2 sequences (41324 vs. 223142) was the same (i.e., 5 elements) and the rule defining the architecture of the sequences was identical (i.e., 3 fingers pressed once and one finger pressed twice in a sequence) (see also supplemental data). ", "During the representation test session, participants had to perform the sequence with the hand and the keyboard turned upside-down. ", "The presence of external and internal representations of the sequence was assessed in this session at an individual level. ", "The external representation was assessed by changing the finger movements that participants needed to perform, while preserving the spatial locations of the response buttons on the reverted key-pad (from sequence 4 1 3 2 4/2 3 1 4 2 to their mirror configurations 1 4 2 3 1/3 2 4 1 3, respectively). ", "The internal representation of the sequence was in contrast assessed by changing the spatial locations of the response buttons while preserving the order of finger movements learned during training (i.e., sequence 4 1 3 2 4 or 2 3 1 4 2, see Fig.", " [1](#Fig1){ref-type=\"fig\"}). ", "All participants were tested on both representations in approximately one week of interval. ", "The order of representation tested (external or internal) and the sequences used were counterbalanced across participants. ", "On session 1, each participant practiced one of the two sequences (41324 or 23142) and was subsequently tested on one of the two transfer conditions (either external or internal). ", "On session 2, each participant practiced the other sequence and was tested on the other of the two transfer conditions. ", "In both sessions, the transfer test took place immediately (i.e., less than 5 min) after initial training. ", "Motor skill performance was measured in terms of speed (block duration to perform the 60 key presses) and accuracy (number of accurate sequences by block). ", "The task was implemented in MATLAB (Mathworks Inc., Sherbom, MA) using the Cogent 2000 toolbox (<http://www.vislab.ucl.ac.uk/cogent.php>).Figure 1Motor sequence learning task. ", "Training panel: All the participants were trained with the usual set-up (hand on the keypad). ", "Representation test panel: immediately after initial training, switching the keypad and hand coordinates upside down allowed us to investigate the EXTERNAL (same spatial sequence but different finger movements) and INTERNAL (same finger movements but different spatial sequence) representations. ", "Participants were tested on both representations with two different motor sequences: 41324 (left side of the figure) vs. 23142 (right side of the figure).", "\n\nProcedure {#Sec7}\n---------\n\nParticipants were tested in three different sessions: they performed the 2 conditions of the motor sequence learning task in the first 2 sessions (separated by approximately one week of interval), then they performed a third session (one month later) during which the TOJ task was presented. ", "The motor sequence learning task was split over two sessions to avoid any interfering effect between motor practice sessions. ", "A window of ⟪sensitivity⟫ to interference in the first 4--6 hours following initial training has indeed been described in the literature^[@CR28],[@CR29]^.\n\nData analysis {#Sec8}\n-------------\n\n### Temporal order judgment task {#Sec9}\n\nThe mean percentages of \"right hand first\" responses were first calculated for each participant, SOA and posture. ", "These raw proportions were transformed into their standardized z-score equivalents and then used to calculate the best-fitting linear regression lines of each participant^[@CR5]^. Because the longest intervals showed evidence of a ceiling effect for the uncrossed posture, only the intermediate 8 points (i.e., −90 to 90 ms) were included in the analysis. ", "The slopes of each individual line were then submitted to an ANOVA with posture (uncrossed vs. crossed) as the within-subject factor and group (EB, SC) as the between-subject variable.", "\n\nThe just noticeable difference (JND; the smallest interval needed to reliably indicate temporal order) was secondly calculated from the mean slope data by subtracting the SOA needed to achieve 75% performance from that needed to achieve 25% performance and dividing by two^[@CR2]^. This value could not be determined independently for all observers because several of them obtained a slightly negative slope value for the crossed posture; indicating that these participants often responded with the opposite hand as the one that has been stimulated first^[@CR5]^.\n\n### Motor sequence learning task {#Sec10}\n\nIn the motor sequence learning task, we first evaluated whether practice of the sequence in the training session improves participants' performance. ", "A 14 (blocks of practice during the training session) × 2 (condition: external vs. internal) × 2 (group: EB, SC) ANOVA was therefore conducted on speed of performance (i.e., block duration in ms) and accuracy (i.e., number of correct sequences per block). ", "We also examined participants' performance in the representation session by conducting a 4 (blocks of practice during the representation session) × 2 (condition: external vs. internal) × 2 (group: EB, SC) ANOVA on speed of performance and accuracy.", "\n\nFinally, to examine the transfer in sequence knowledge, taken as an indicator of the development of external and internal representations, the averaged performance of the first four blocks of training was compared to the four blocks of the representation test session. ", "We tested this with a three-way ANOVA with the averaged performance of the first four blocks of training and the four blocks of the representation session as the first within-subject factor (session), the type of representation (external vs. internal) as the second within subject factor and the group (EB, SC) as the between-subject factor. ", "As previously, this analysis was performed on speed of performance and accuracy. ", "Comparing the beginning of the training session (first 4 blocks) to the representation session (4 blocks) is a procedure generally used to assess the amplitude of the transfer of sequence knowledge^[@CR26],[@CR30]^.\n\nResults {#Sec11}\n=======\n\nTemporal order judgment task {#Sec12}\n----------------------------\n\nResults of the 2 (postures: uncrossed vs. crossed) × 2 (groups: EB, SC) ANOVA carried out on the slopes of each individual regression lines showed: (1) a significant effect of posture, *F*(1, 20) = 13.93, *p* = 0.001, *η* ^*2*^ = 0.41, the regression line for the uncrossed posture being steeper (*M* = 0.90 ± 0.03) than the regression line for the crossed posture (*M* = 0.59 ± 0.09); (2) a significant effect of group, *F*(1, 20) = 8.47, *p* = 0.009, *η* ^*2*^ = 0.30, the EB (*M* = 0.90 ± 0.08) performing better than the SC (*M* = 0.59 ± 0.08); and (3) a significant posture × group interaction, *F*(1, 20) = 11.37, *p* = 0.003, *η* ^*2*^ = 0.36. ", "To further examine this interaction, paired samples t-test were performed on each group separately with hand position as the only factor. ", "In SC group, participants' performance was better in the uncrossed posture (*M* = 0.88 ± 0.06) than in the crossed posture (M = 0.29 ± 0.18), *t*(10) = −3.61, *p* = 0.005 (see Fig.", " [2A](#Fig2){ref-type=\"fig\"}). ", "In deep contrast, the performance did not significantly differ between hand postures in the EB group, *t*(10) = −0.98, *p* = 0.350, the slope of the regression lines being similar in the uncrossed (*M* = 0.91 ± 0.01) and crossed postures (*M* = 0.88 ± 0.04). ", "As the development of spatial representation is sensitive to early visual deprivation during the first years/months of life^[@CR31]^, we performed the same analysis without the 2 EB participants. ", "Only the 9 congenitally blind were included. ", "This analysis yielded the same results as the one described above (see supplemental material for a detailed description of the results).Figure 2(**A**) Standardized z-score equivalents of the mean proportions of right-hand responses and best-fitting linear regression lines for the uncrossed (II -- continuous lines) and crossed (X - dotted lines) postures for EB (in blue) and SC (in black). ", "Bars represent standard error of the mean; (**B**) JND: the minimum interval between the two tactile stimuli required for participants to judge their temporal order accurately on 75% of trials. ", "No error bars are presented as the JND was calculated on the group data.", "\n\nMoreover and as shown in Fig.", " [2B](#Fig2){ref-type=\"fig\"}, crossing the hands led to a significant decrement in performance in SC; it actually more than doubled the JND. ", "The EB group, in striking contrast, was not affected by the crossing of their hands as already reported by Röder *et al*.^[@CR7]^. Since both groups of participants presented similar level of performance in the uncrossed position, this observation could not be explained by better temporal resolution ability in EB.", "\n\n3.2 Motor sequence learning task {#Sec13}\n--------------------------------\n\n### Training session {#Sec14}\n\nThe 14 (blocks of practice during the training session) × 2 (representation: external vs. internal) repeated measures ANOVA conducted on speed of performance (i.e., block duration in ms), with group (EB, SC) as the between-subject factor, yielded a significant main effect of block, *F*(13, 260) = 49.80, *p* = 0.000, *η* ^*2*^ = 0.71, indicating that block duration decreased with practice. ", "There was also a significant block × group interaction, *F*(13, 260) = 3.77, *p* = 0.02, *η* ^*2*^ = 0.16, indicating that the learning curve (changes in performance from one block to the other) differed between SC and EB. ", "Data inspection revealed that the learning curve was steeper in SC due to slower performance at the beginning of training. ", "A significant block × group × representation interaction, *F*(13, 260) = 3.01, *p* = 0.043, *η* ^*2*^ = 0.13 was also observed. ", "However, follow-up analyses indicated no block × representation interaction within each group (all *F* \\< 3.16, all p-values \\> 0.06). ", "No other effect was significant (see Fig.", " [3](#Fig3){ref-type=\"fig\"}).Figure 3Results of the motor sequence learning task. ", "Mean block duration during the 14 blocks of the training and the 4 blocks of the representation test (transfer) sessions for the internal (**A**) and external conditions (**C**) of the task. ", "Transfer of sequence knowledge in the internal (**B**) and external (**D**) conditions of the task. ", "Bars represent standard error of the mean.", "\n\nThe same 14 (blocks of practice during the training session) × 2 (condition: external vs. internal) × 2 (group: EB, SC) ANOVA conducted this time on the accuracy scores (number of accurate sequences per block) did not reveal any significant effect (all *p* ~*s*~ \\> 0.05).", "\n\n*Representation test sessions*. ", "The 4 (blocks of practice in the representation test session) × 2 (representations: external vs. internal) repeated measures ANOVA carried out on performance speed with group (EB, SC) as the between-subject factor revealed a significant main effect of block, *F*(3, 60) = 24.81, *p* = 0.000, *η* ^*2*^ = 0.55, block duration decreasing with practice for the two representations of the sequence (see Fig.", " [3](#Fig3){ref-type=\"fig\"}). ", "No other effect was observed.", "\n\nThe same 4 (blocks of practice in the representation test session) × 2 (representations: external vs. internal) × 2 (groups: EB, SC) ANOVA conducted on the accuracy measure did not show any significant effect, accuracy remaining stable with a low error rate throughout the 4 blocks of practice, *F*(3, 60) = 1.06, *p* = 0.395, *η* ^*2*^ = 0.05, whatever the representation tested, *F*(1, 20) = 0.21, *p* = 0.651, *η* ^*2*^ = 0.01, and in the 2 groups of participants, *F*(1, 20) = 0.05, *p* = 0.817, *η* ^*2*^ = 0.003.", "\n\n*Transfer between the training and the representation test sessions*. ", "The 2 (session: first 4 blocks vs. last 4 blocks) × 2 (representation: external vs. internal) × 2 (group: EB, SC) ANOVA performed on block duration revealed a significant main effect of session, *F*(1, 20) = 35.16, *p* = 0.000, *η* ^*2*^ = 0.64, showing an improvement of performance from the training to the representation test session (see Fig.", " [3](#Fig3){ref-type=\"fig\"}). ", "No between-groups differences, *F*(1, 20) = 1.46, *p* = 0.241, *η* ^*2*^ = 0.07, and no interactions were observed. ", "Interestingly, the representation × session × group interaction was not significant, *F*(1, 20) = 1.76, *p* = 0.199, *η* ^*2*^ = 0.08, showing that EB and SC both demonstrated significant transfer of motor sequence knowledge irrespective of whether the representation of the sequence was external or internal. ", "The same analysis performed without the 2 early blind participants yielded the same results as the one described above (see supplemental material for a detailed description of the results). ", "Moreover, to further examine the absence of the representation × session × group interaction on block duration measures, we computed Bayesian statistics with JASP^[@CR32]^. These statistics have the main advantages of quantifying evidence instead of forcing an all-or-none decision. ", "Bayes factors indeed provide a coherent approach to determining whether non-significant results support a null hypothesis (interaction absent) over a theory (interaction present), or whether the data are just insensitive. ", "This analysis highlighted a BF~01~ of 4.65, indicating that the posterior probabilities were 0.82 for H~0~ (the null hypothesis has 82% chance of being true) and 0.18 for H~1~. According to Raftery's (1995)^[@CR33]^ classification of evidence into weak (0.50--0.75), positive (0.75--0.95), strong (0.95--0.99), and very strong (\\>0.99), the probability value obtained here provided positive support for H~0~.\n\nA 2 (session: first 4 blocks vs. last 4 blocks) × 2 (representation: external vs. internal) × 2 (group: EB, SC) ANOVA was finally performed on accuracy scores. ", "It only revealed a significant effect of session, *F*(1, 20) = 6.51, *p* = 0.019, *η* ^*2*^ = 0.55, indicating improvement in performance accuracy. ", "No other results were significant.", "\n\nDiscussion {#Sec15}\n==========\n\nWe aimed to investigate the role visual experience plays in shaping the use of internal and external coordinate systems for sensori-motor processing. ", "The same participants were involved in two different tasks allowing us to directly compare their use of different spatial coordinates in the sensory and motor fields. ", "The spatial representation of touch was assessed by asking participants to perform a TOJ task with the hands uncrossed or crossed over the body midline. ", "The spatial representation of motor plans was tested by requiring participants to reproduce a motor sequence with the hand turned upside-down either following internal or external coordinates.", "\n\nResults of the TOJ task replicated the data of Röder *et al*.^[@CR7]^: in SC, crossing the hands reduced the slope of the regression line while no decrease of performance was observed in EB. ", "This absence of crossed-hand effect in CB and EB is attributed to a difference in the weights that are used to integrate internal and external spatial information. ", "While the weighting scheme of SC automatically favors an external coordinate system, EB preferentially rely on an internal frame of reference to perform the task. ", "The automatic integration of internal and external coordinates for touch localization therefore appears to be driven by developmental vision. ", "Such integration probably helps the alignment of the spatial frames of references that are used by the distal senses (e.g., vision and audition) and the body limbs. ", "For example, our ability to interact with our immediate surroundings depends on our ability to represent the location of objects with respect to our own body and especially to our hands. ", "This process is particularly critical since the hands move constantly within the space around our body as different postures are adopted. ", "It has therefore been demonstrated that EB have more difficulties to optimally integrate audio-tactile information in the crossed posture due to the poorly aligned spatial coordinates of these two modalities in such conditions^[@CR9]^. However, since the TOJ task may be resolved using skin-based coordinates only, the weighting scheme used by the EB shields them from the detrimental crossing effect. ", "Interestingly, a similar difference in the weights that are used to integrate anatomical skin-based and external spatial information has been observed in patient HS, a man who had been totally deprived of vision for the first two years of life^[@CR33]^. This suggests the presence of a sensitive period early in life for the development of the automatic use of an external visuo-spatial frame of reference for coding touch in space^[@CR34]^. It is therefore possible that early visual deprivation alleviates the weights of external coordinates due to the reorganization or to the lack of development of the brain circuits implicated in such process. ", "The posterior parietal cortex (PPC) has been hypothesized to play a crucial role in implementing such operation in SC^[@CR35]^ and this region has been repetitively shown reorganized in EB^[@CR36]--[@CR39]^. The role of the PPC in touch localization is partially supported by an electroencephalographic study showing that the detection of deviant tactile stimuli at the hand induced event-related potentials that varied in crossed when compared to uncrossed condition of posture in sighted subjects, whereas changing the posture of the hand had no influence on the early blind subjects' brain activity^[@CR40],[@CR41]^.\n\nMotor sequence learning, on the other hand, has been shown to encompass two independent processes named \"spatial\" (external) and \"motor\" (internal)^[@CR42]--[@CR44]^. Within this view, learning a piano sonata not only requires performing specific series of finger movements (in an internal reference frame) but also requires learning the position of specific musical notes in an external reference frame. ", "In our second experiment, a motor sequence-learning task was used to characterize the effect of visual experience on the creation of both external and internal motor representations. ", "The existence of these two representations after an initial learning phase was measured using a \"transfer\" protocol in which all participants were tested on their ability to produce the internal or external-spatial sequence with the same hand, but with the keypad turned upside down (see Fig.", " [1](#Fig1){ref-type=\"fig\"}). ", "By reversing the keypad, the same finger movements were no longer associated with the identical spatial sequence in external space and vice versa^[@CR26]^. Accordingly, such a manipulation generated two different sequence representations: an internal representation that probed movement-based learning and an external representation that probed external spatial learning^[@CR26]^. As expected, we observed that SC developed both external and internal representations of the sequence. ", "Blocks' duration indeed decreased from the training to the representation test session in the external as well as in the internal conditions of the study. ", "Crucially, our results show that EB were similarly able to develop these two spatial representations. ", "As an absence of evidence that group differences exist is not necessarily an evidence for the true absence of such difference, one may suggest that our motor sequence learning task was not sensitive enough to highlight true differences in spatial representation between the two groups. ", "We however do not believe this hypothesis is the most parsimonious. ", "First, our complementary Bayesian statistics support the idea of a \"true\" absence of group differences. ", "Second, the observation that both groups of participants were able to implicitly create an internal and an external spatial representation of their motor action parallels previous studies also showing an absence of difference between the sighted and blind groups to support the idea that vision is not necessary to the development of external coordinates in motor coordination^[@CR17]^.\n\nWhile the effector-dependent representation is supported by a striato-motor network^[@CR45]--[@CR48]^, the effector-independent motor representation has been found to recruit an hippocampo-cortical network^[@CR35]^ involving prefrontal and parietal cortices^[@CR42]--[@CR44],[@CR46]^. Even if visual inputs are the predominant sensory inputs of the parietal cortex, auditory and somatosensory information also access this area^[@CR49],[@CR50]^. Makin, Holmes and Zohary^[@CR51]^ demonstrated that the posterior intraparietal sulcus (IPS) and lateral occipital complex represent hand-centered space in a predominantly visual manner, whereas the anterior IPS was characterized by a more proprioceptive representation of the space surrounding the hand. ", "It is therefore possible that EB mainly rely on the anterior IPS to code an external representation of the space surrounding the hand. ", "Through the proprioceptive and auditory modalities, EB people might therefore localize objects in the external space and produce a goal-directed action toward them. ", "Such non-visual sensory-motor loop may be sufficient to build an external sense of space, which is used to act in the external environment. ", "In support of this hypothesis, it was demonstrated that the parieto-occipital reach-related regions retain their functional role --- encoding of the spatial position of the reach target --- in EB^[@CR52]^.\n\nThe fact that SC and CB performed differently in the TOJ task could be explained by the idea that CB, in contrast to SC, do not integrate internal and external spatial information by default. ", "However, the fact that CB and SC behaved similarly in the motor sequence learning task is more in accordance with the idea that both groups integrate spatial information from different reference frames but do this integration according to different weighting schemes^[@CR4],[@CR18],[@CR19]^. While integration seems automatic in SC, external coordinates are used by the CB when the focus of the task is on external coordinates (as in the external condition of the motor sequence learning task). ", "To summarize, our results therefore suggest task-specific differences in the way blind and sighted use specific spatial frame of references for sensori-motor processing^[@CR4]^. It has been argued that tactile localization is a two-step process, in which tactile information is first remapped to an external representation^[@CR4]^. Then anatomical and external spatial information are integrated. ", "The weights used for integration are presumably determined by early visual experiences and by the current task demands. ", "While external coordinates are more weighted in the SC while they perform the TOJ experiment, this does not prevent the external representation of motor action in EB. ", "In other words, our data do not support the idea that early visual experience is necessary for the development of an external coordinate system for perception and action. ", "Our results rather suggest that, even if such external frame of reference is less automatically activated in early blind for the processing of touch, it is readily accessible when participants have to perform an action in the external world^[@CR17],[@CR18]^.\n\nElectronic supplementary material\n=================================\n\n {#Sec16}\n\nSupplementary info\n\nA correction to this article is available online at <https://doi.org/10.1038/s41598-017-16992-0>.", "\n\n**Electronic supplementary material**\n\n**Supplementary information** accompanies this paper at doi:10.1038/s41598-017-01158-9\n\n**Change History:** A correction to this article has been published and is linked from the HTML version of this paper. ", "The error has been fixed in the paper.", "\n\n**Publisher's note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.", "\n\nThis research and the authors were supported by the Canada Research Chair Program (FL), the Canadian Institutes of Health Research (FL; GA), the \"Fondation Sainte-Justine\" (OC), the Belgian National Funds for Scientific Research (VC), the Fonds Spéciaux de Recherche of the Université Catholique de Louvain (FSR; VC), a WBI. ", "World grant (VC), the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska Curie grant agreement No 70057 (VC) and the 'MADVIS' European Research Council starting grant (OC; ERC-StG 337573). ", "The authors are grateful to Xavier Seron for his valuable comments on an earlier version of this manuscript.", "\n\nG.A., V.C. and O.C designed research; V.C. performed research; V.C., G.A. and O.C. analyzed data; V.C., G.A.,F.L. and O.C. wrote the paper.", "\n\nCompeting Interests {#FPar1}\n===================\n\nThe authors declare that they have no competing interests.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.000958200020249933, 0.0005853072507306933, 0.0005501379491761327, 0.0007925663376227021, 0.0006130051915533841, 0.0005901023978367448, 0.0005770125426352024, 0.0005857794312760234, 0.0006481721065938473, 0.0006030799704603851, 0.000673046160954982, 0.004361624363809824, 0.0006138008902780712, 0.0006429314962588251, 0.0018975259736180305, 0.0005491597694344819, 0.0005894963978789747, 0.0006374405929818749, 0.0005821929080411792, 0.0005320974159985781, 0.0005998264532536268, 0.0005970716010779142, 0.0005891655455343425, 0.000534895749296993, 0.0009375365334562957, 0.0006465116166509688, 0.0006296992069110274, 0.0005666984943673015, 0.0007726851035840809, 0.0006250181468203664, 0.0005919302930124104, 0.0009613283327780664, 0.002363184466958046, 0.003329309867694974, 0.00201690592803061, 0.01125986035913229, 0.001120092929340899, 0.0005651327082887292, 0.11944210529327393, 0.0010212014894932508, 0.0006284620030783117, 0.0005728317773900926, 0.0005443543777801096, 0.0006450864602811635, 0.0005488269962370396, 0.0005346472025848925, 0.0005392893799580634, 0.0006496981950476766, 0.0006637769984081388, 0.0006471031229011714, 0.0008091504569165409, 0.0007281697471626103, 0.0009113485575653613, 0.0006646850961260498, 0.0005775779136456549, 0.0006652799202129245, 0.0006271327729336917, 0.0005815598415210843, 0.0006004697061143816, 0.0005909646861255169, 0.0006603747606277466, 0.0006491903914138675, 0.000775942811742425, 0.0014081548433750868, 0.0006335763027891517, 0.0006671034498140216, 0.0005492742056958377, 0.0006004113820381463, 0.0006556626176461577, 0.000623184023424983, 0.0005548743647523224, 0.0006902160821482539, 0.0006556626176461577, 0.0005888166488148272, 0.0006599919288419187, 0.000542949594091624, 0.0005972682265564799, 0.0006025332841090858, 0.0006556626176461577, 0.0005459168460220098, 0.0005863570258952677, 0.0005512735806405544, 0.000545809103641659, 0.00056464783847332, 0.000599080347456038, 0.0006248081917874515, 0.0005514798103831708, 0.0005486637819558382, 0.0005638765869662166, 0.0005545464809983969, 0.0006164005608297884, 0.0005893950001336634, 0.0006049474468454719, 0.0005958033143542707, 0.0005675520515069366, 0.0005862941034138203, 0.0005363758536987007, 0.0005465493886731565, 0.000578574079554528, 0.0005634325789287686, 0.0010781859746202826, 0.0005585528560914099, 0.0006471228552982211, 0.0006451479275710881, 0.0006613116129301488, 0.0005306701641529799, 0.031602900475263596, 0.0005889292224310338, 0.0006698852521367371, 0.0006117603043094277, 0.0006368563626892865, 0.000718823925126344, 0.0005802658852189779, 0.0007036421447992325, 0.13901960849761963, 0.0005641550524160266, 0.22409825026988983, 0.005728693213313818, 0.0006494174594990909, 0.0006195312598720193, 0.0007740809232927859, 0.000637768127489835, 0.000692361150868237, 0.0006883646710775793, 0.0006015784456394613, 0.0006553008570335805, 0.0006585072260349989, 0.0007026952225714922, 0.010656592436134815, 0.0005627321661449969, 0.0008076144731603563, 0.0006585072260349989, 0.440141886472702, 0.03959675505757332, 0.0005759380874224007, 0.0006168651743791997, 0.0006611691787838936, 0.0006486831698566675, 0.24256357550621033, 0.000658015429507941, 0.0005932202911935747, 0.0005213164258748293, 0.0006357462843880057, 0.0005812719464302063, 0.0006073744734749198, 0.0005951318889856339, 0.0006015460821799934, 0.0005517390673048794, 0.000546740076970309, 0.0006048356299288571, 0.0005440444801934063, 0.0006067614885978401, 0.0005758971674367785, 0.0006660621147602797, 0.0005725978990085423, 0.0005482578417286277, 0.0006556626176461577, 0.0006041978485882282, 0.0006141897174529731, 0.000530376797541976, 0.0005823691026307642, 0.0006881389999762177, 0.000596584111917764, 0.0007015159353613853, 0.0006605141679756343, 0.0006198324263095856, 0.0006393827497959137, 0.0005857425858266652, 0.0005694887368008494, 0.0005875230999663472, 0.0005431480822153389, 0.0006344289286062121, 0.0005733129801228642, 0.0006837192922830582, 0.0005910692270845175, 0.0005788399721495807, 0.000563348236028105, 0.00056823919294402, 0.0005728036630898714, 0.000519245455507189, 0.0008427622960880399, 0.0006851758225820959, 0.001994825666770339 ]

[ "package com.godcheese.nimrod.mail.controller;\n\nimport com.godcheese.nimrod.common.others.", "Common;\nimport com.godcheese.nimrod.mail.", "Mail;\nimport org.springframework.security.access.prepost.", "PreAuthorize;\nimport org.springframework.stereotype.", "Controller;\nimport org.springframework.web.bind.annotation.", "RequestMapping;\n\nimport static com.godcheese.nimrod.common.security.", "SimpleUserDetailsServiceImpl.", "SYSTEM_ADMIN;\n\n/**\n * @author godcheese [godcheese@outlook.com]\n * @date 2018-02-22\n */\n@Controller\n@RequestMapping(Mail.", "Page.", "MAIL)\npublic class MailController {\n\n /**\n * 发送邮件 页面\n *\n * @return String\n */\n @PreAuthorize(\"hasRole('\" + SYSTEM_ADMIN + \"') OR hasAuthority('/MAIL/SEND')\")\n @RequestMapping(\"/send\")\n public String send() {\n return Common.trimSlash(Mail.", "Page.", "MAIL + \"/send\");\n }\n\n /**\n * 编辑重发 对话框\n *\n * @return String\n */\n @PreAuthorize(\"isAuthenticated()\")\n @RequestMapping(\"/send_dialog\")\n public String sendDialog() {\n return Common.trimSlash(Mail.", "Page.", "MAIL + \"/send_dialog\");\n }\n\n /**\n * 编辑重发 对话框\n *\n * @return String\n */\n @PreAuthorize(\"isAuthenticated()\")\n @RequestMapping(\"/view_dialog\")\n public String viewDialog() {\n return Common.trimSlash(Mail.", "Page.", "MAIL + \"/view_dialog\");\n }\n\n /**\n * 邮件队列 页面\n *\n * @return String\n */\n @PreAuthorize(\"hasRole('\" + SYSTEM_ADMIN + \"') OR hasAuthority('/MAIL/LIST')\")\n @RequestMapping(\"/list\")\n public String list() {\n return Common.trimSlash(Mail.", "Page.", "MAIL + \"/list\");\n }\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.0013828672235831618, 0.0013074022717773914, 0.0007582446560263634, 0.0007063053199090064, 0.0006998851895332336, 0.0009040439617820084, 0.002185971476137638, 0.003126624273136258, 0.001026631100103259, 0.0009087036014534533, 0.001026631100103259, 0.0011053539346903563, 0.001026631100103259, 0.0009449773351661861, 0.001026631100103259, 0.0008719504112377763, 0.001026631100103259, 0.000901113438885659 ]

[ "Trust My Passport Ultra to help protect your precious memories and confidential files. ", "You can set an optional password to activate 256-bit hardware encryption and add an extra layer of security for your private files. ", "Because it's hardware-based encryption, it won't impact the speed of your transfers or slow down your computer.", "\n\nPowerful, smart backup software\n\nWD Backup is our most powerful backup software yet. ", "It's easier than ever to use and requires minimal system resources while it's running. ", "Set a backup schedule to automatically safeguard your files on a schedule that fits your life. ", "WD Backup can also back up to your Dropbox account to provide another level of file protection.", "\n\nSleek design with high capacity\n\nWith extreme capacities in the palm of your hand, My Passport Ultra is an ideal companion for your laptop or compatible tablets. ", "Available in a range of exciting colors, you can find your favorite and complement your lifestyle.", "\n\nUltra-fast transfer rates\n\nThe power of USB 3.0 lets you access and save files in blazing-fast speed. ", "Best of all, no separate power supply is needed.", "\n\nWorks great with Windows\n\nFormatted NTFS to work right out of the box with Windows. ", "Download the free Windows 8 app to easily discover the digital media stored on your My Passport Ultra drive. ", "Can also be reformatted to work with Mac OS X.\n\nWD knows your data is important, so we build our drives to demanding requirements for durability, shock tolerance and long-term reliability. ", "And for peace of mind, we back up our reliability with a 3-year limited warranty." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0007540156948380172, 0.0006946437060832977, 0.0008291982812806964, 0.0009077200666069984, 0.0006480239098891616, 0.006212342996150255, 0.0008323935326188803, 0.0005832504248246551, 0.0005514223012141883, 0.0008791361469775438, 0.0006403624429367483, 0.0006952324183657765, 0.0006946638459339738, 0.0006050472147762775, 0.0005577346892096102 ]

[ "Reliability of the corticospinal tract and arcuate fasciculus reconstructed with DTI-based tractography: implications for clinical practice.", "\nTo assess the reliability of diffusion tensor imaging (DTI)-based fibre tractography (FT), which is a prerequisite for clinical applications of this technique. ", "Here we assess the test-retest reproducibility of the architectural and microstructural features of two clinically relevant tracts reconstructed with DTI-FT. ", "The corticospinal tract (CST), arcuate fasciculus (AF) and its long segment (AFl) were reconstructed in 17 healthy subjects imaged twice using a deterministic approach. ", "Coefficients of variation (CVs) of diffusion-derived tract values were used to assess the microstructural reproducibility. ", "Spatial correlation and fibre overlap were used to assess the architectural reproducibility. ", "Spatial correlation was 68 % for the CST and AF, and 69 % for the AFl. ", "Overlap was 69 % for the CST, 61 % for the AF, and 59 % for the AFl. ", "This was comparable to 2-mm tract shift variability. ", "CVs of diffusion-derived tract values were at most 3.4 %. ", "The results showed low architectural and microstructural variability for the reconstruction of the tracts. ", "The architectural reproducibility results encourage the further investigation of the use of DTI-FT for neurosurgical planning. ", "The high microstructural reproducibility results are promising for using DTI-FT in neurology to assess or predict functional recovery." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.023263156414031982, 0.0005823976825922728, 0.000632663955911994, 0.011337914504110813, 0.0006070162635296583, 0.000557530322112143, 0.0006449564243666828, 0.0007536066696047783, 0.0005997164989821613, 0.0006221771473065019, 0.0006258920184336603, 0.0006039882428012788, 0.0007173044723458588 ]

[ "What makes one individual more susceptible than another to the harmful effects of air pollution? ", "If particulate matter (PM) differentially affects certain populations, which factors or characteristics are most likely to account for the heightened risk? ", "These are the questions behind a new review of studies that examined various characteristics linked with susceptibility **\\[*EHP*** **119(4):446--454; Sacks et al.\\]**.", "\n\nTo assess the differential effects of PM on specific populations, epidemiologic studies often conduct stratified analyses; a stronger association between PM and the health effect being measured in one subgroup compared with another provides evidence for a more susceptible population. ", "Additional insight can be gleaned via controlled human exposure studies (which examine individuals with a preexisting disease) and toxicologic studies using animal models of disease. ", "The authors of the current study integrated these various lines of evidence to determine whether there was coherence of associations across the scientific disciplines. ", "They also assessed the biological plausibility of specific characteristics identified in epidemiologic studies as potentially conferring susceptibility to PM-related health effects.", "\n\nThe authors focused on the collective evidence evaluated in the most recent science review of the PM National Ambient Air Quality Standards and also built upon the evidence presented in previous reviews. ", "The studies examined the health effects primarily due to both short- and long-term exposures to the fine and/or coarse fractions of PM.", "\n\nOverall, the characteristics of populations most associated with increased susceptibility to PM-related health effects included 1) life stage, specifically children and older adults; 2) preexisting cardiovascular and respiratory diseases; 3) specific genetic polymorphisms; and 4) low socioeconomic status, as measured by educational attainment and income. ", "The authors found more limited evidence suggesting an increase in PM-related health effects in individuals with diabetes, chronic obstructive pulmonary disease, and increased body mass index. ", "Potentially increased risks of PM-related health effects by sex and race/ethnicity also were indicated, although these associations were not consistent across health effects, PM size fractions, or, in some instances, study locations.", "\n\nThe authors concede they are unable to clearly state the overall strength of the evidence for some characteristics of potentially susceptible populations due to inconsistent evidence across epidemiologic studies as well as lack of information from experimental studies regarding biologically plausible mechanisms.", "\n\nHowever, the novel integrative approach used to identify characteristics of populations potentially susceptible to PM may be a valuable assessment tool for other air pollutants. ", "The authors also propose a comprehensive definition of \"susceptibility\" to encompass all populations potentially at increased risk of adverse health effects as a consequence of exposure. ", "Use of such a standardized definition could help reverse inconsistencies in terminology within the epidemiologic literature that may have complicated the identification of high-risk populations to date.", "\n\n{#f1-ehp-119-a176a}\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.0007850058609619737, 0.0005819848738610744, 0.00077043630881235, 0.000580598134547472, 0.0005736776511184871, 0.0005416242638602853, 0.0006505712517537177, 0.0005256665172055364, 0.0006286884308792651, 0.0006740440730936825, 0.0007474147714674473, 0.0006527344230562449, 0.0005731031997129321, 0.0007598943775519729, 0.0006575465085916221, 0.0005670767859555781, 0.0019054226577281952, 0.0019413778791204095 ]

[ "Q:\n\nA flow of a parallel vector field preserves the connection?", "\n\nLet $M$ be a closed manifold equipped with an affine connection $\\nabla$.\nLet $X \\in \\Gamma(TM)$, and suppose $X$ is a parallel vector field, i.e. $\\nabla X=0$.\nIs it true that the flow of $X$ preserves the connection? ", "i.e. let $\\phi_t$ be the flow of $X$. Is it true that $\\phi_t^* \\nabla=\\nabla$?", "\nHere, for a given diffeomorphism $\\phi:M \\to M$, I define $\\phi^* \\nabla$ by requiring\n$$ \\phi_*\\big((\\phi^* \\nabla)_XY\\big)= \\nabla_{\\phi_* X}\\phi_* Y,$$\nwhere $\\phi_*$ is the pushforward operation.", "\n(I think this is the 'right' definition).", "\nWhat about the converse, that is suppose that $\\phi_t^* \\nabla=\\nabla$. Is $X$ parallel?", "\nI am not sure how to compute the 'variational derivative' $\\frac{d}{dt}|_{t=0}\\phi_t^* \\nabla$.\n\nA:\n\nThe quantity you call the \"variational derivative\" is just the Lie derivative of $\\nabla$ along $X$: This is the tensor field $\\mathcal L_X \\nabla: TM \\to T^*M \\otimes TM$ characterized by\n$$(\\mathcal L_X \\nabla)(Y) = [\\mathcal L_X, \\nabla] Y = \\mathcal L_X (\\nabla Y) - \\nabla \\mathcal L_X Y ,$$ which measures the failure of $\\mathcal L_X$ to commute with $\\nabla$, that is, the infinitesimal failure of the flow of $X$ to preserve $\\nabla$. (For more see these expository notes of Mike Eastwood, which are ultimately concerned with infinitesimal projective symmetries, that is, vector fields whose flow preserves the projective class of a connection.) ", "It's straightforward to verify that this quantity really is tensorial (in $Y$).", "\nIf $\\nabla$ is torsion-free, which we henceforth assume, we may express the Lie derivative of a vector field in terms of $\\nabla$, and in fact in this case the object in $T^*M \\otimes T^*M \\otimes TM$ obtained by dualizing is actually in $S^2 T^*M \\otimes TM$ (this dualized object is the infinitesimal version of the difference tensor between two connections). ", "A straightforward calculation gives that\n$$(\\mathcal L_X \\nabla)_{ab}{}^c = \\nabla_a \\nabla_b X^c + \\color{red}{R_{da}{}^c{}_b X^d} ,$$\nwhere $R$ is the curvature tensor.", "\nIn the case that $X$ is parallel, the first term on the r.h.s. ", "vanishes by definition, and so the preservation of $\\nabla$ by the flow of $X$ is governed (at least in the torsion-free case) precisely by the vanishing of $\\color{red}{R_{da}{}^c{}_b X^d}$. In general this quantity need not be zero:\n\nExample Consider the (torsion-free) connection $\\nabla$ on $\\Bbb R^2$ characterized by\n $$\\nabla_{\\partial_1} \\partial_1 = x^2 \\partial_1$$\n and $\\nabla_{\\partial_i} \\partial_j = 0$ for all other $(i, j)$. We can read off immediately that $\\partial_2$ is parallel w.r.t. ", "$\\nabla$, but computing gives that $R = - dx^1 \\wedge dx^2 \\otimes \\partial_1 \\otimes dx^1$, so $\\mathcal L_X \\nabla = dx^1 \\otimes \\partial_1 \\otimes dx^1 \\neq 0$.\n\nOn the other hand, if $\\nabla$ is the Levi-Civita connection of some metric, the symmetries of a metric curvature tensor allow us to rewrite $\\color{red}{R_{da}{}^c{}_b X^d}$ as $g^{ce} g_{af} R_{be}{}^f{}_d X^d$, but this vanishes by the definition of curvature and the condition that $X$ is parallel. ", "In other words, if we specialize to Levi-Civita connections, the answer to the question is always positive.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0006736763170920312, 0.0008775446913205087, 0.017854968085885048, 0.015963660553097725, 0.0006177329341880977, 0.0015049687353894114, 0.0022067732643336058, 0.0006247164565138519, 0.00258067948743701, 0.0011415515327826142, 0.000785731477662921, 0.004427810199558735, 0.005403915885835886, 0.0005486413137987256, 0.001994825666770339 ]

[ "\nAsk HN: How do you choose which project to start? - ", "nazz\nI have a few projects in mind like motion graphics and starting drop shipping. ", "I have ideas for both and I am able to start now. ", "How do you decide on which project to start? ", "Both will take a whie.", "\n======\ntmaly\nCan you find an online audience, say a forum where there are people actively\ndiscussing some problem for which your project is the perfect solution?", "\n\n------\njadeydi\nI think you wouldn't get your answer from here. ", "I do not want to disappoint\nyou. ", "Most time, you did something out, you can hardly get feedback, to say\nnothing of target.", "\n\nYou have to figure out yourself, try and try, stop to think and try again. ", "If\nyou don't know how to do, keep trying.", "\n\n------\nfairpx\nHere's what works for me:\n\n1\\. Give each idea a quick title and write them down\n\n2\\. Write down the following questions:\n\n* Does this solve a problem for me/am I the target audience?", "\n\n* Am I part of an online/offline community that are also like me and would likely love this idea because it solves a problem?", "\n\n* Can I easily get 3 paying customers within the next 5 days, because I have easy access to the target audience?", "\n\n* Is this something I can launch by myself quickly?", "\n\nThere are more stuff you could ask to the list of questions, but basically the\nidea that has 'Yes' to all of these questions, is the one you should be\njumping on right away. ", "Cross away the other ideas that have No's, or try to\nfigure out how to turn it into a Yes. ", "But your time is limited, so don't waste\nit bouncing around with ideas that aren't a good fit.", "\n\n" ]

{ "pile_set_name": "HackerNews" }

[ 0.0006935998098924756, 0.0007747244671918452, 0.0005314289010129869, 0.0007190891192294657, 0.0076738628558814526, 0.0012297811917960644, 0.004825067240744829, 0.0029152575880289078, 0.0006645096582360566, 0.016052132472395897, 0.0011325004743412137, 0.0008495438378304243, 0.0007754741236567497, 0.0006265338743105531, 0.0008562869043089449, 0.0005971406935714185, 0.0009749059099704027, 0.008397163823246956, 0.001994825666770339 ]

[ "\"The Zoosemiotics of Sheep Herding with Dogs,\" in The Semiotics of Animal Representations (2013)\n\n\"Literature and Ecology,\" in Teaching Ecocrticism and Green Studies (2012)\n\n\"Merleau-Ponty's Ecophenomenology,\" in Ecocritical Theory: New European Approaches (2011)\n\n\"Merleau-Ponty's Human-Animal Intertwining,\" Configurations (2010\n\n\"Virginia Woolf and the Flesh of the World\" (New Literary History 1999)\n\n\"Darwin in Arcadia: Brute Being and the Human Animal Dance from Gilgamesh to Virginia Woolf\" (Anglia 2006)\n\n\"Literature, the Environment, and the Question of the Posthuman\" (Nature in Literary and Cultural Studies 2006)\n\n\"Heidegger and Merleau-Ponty: Ecopoetics and the Problem of Humanism\" (Culture, Creativity and Environment 2007).", "\n\nStatement\n\nI teach in both the English Department and the Environmental Studies Program. ", "My current research focuses on ecophenomenology and literature, animality, and embodiment in language. ", "A related activity is herding sheep with Australian Kelpies, a good way to learn and develop cross-species communication. ", "Recent conference presentations have been\n\n\"The Human/Animality Dance of Sheep Herding,\" which draws upon Vicki Hearne's and Donna Haraway's work but extends their considerations with the phenomenological attention to language of Maurice Merleau-Ponty." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0007314392132684588, 0.0006015554536134005, 0.0006241555092856288, 0.005410118959844112, 0.0008240772294811904 ]

[ "Submitted Photo A man holds on to the leash of his dog that viciously attacked a woman in Garrison Crossing near the Cheam Centre on Aug. 31.", "\n\nAnimal control has finally seized a pit bull involved in a vicious attack in Garrison Crossing in August and is applying to have the dog euthanized.", "\n\n[Ed. ", "note: Some photos below may be disturbing to some readers.]", "\n\nThe seizure took so long because the owner not only hid the pit bull named Magnum by taking to it to an unknown location but the colour of the dog had been altered, according to Fraser Valley Regional District (FVRD) spokesperson Jennifer Kinneman.", "\n\nREAD MORE: Violent pit bull attack leaves Chilliwack woman with tendon damage\n\nKinneman said with help from the RCMP, animal control staff tracked down the dog on Sept. 28. ", "The violent attack of the woman and her dog near the entrance to Save-On Foods on Tamihi Way happened in broad daylight around 4 p.m. on Aug. 31.", "\n\nThe owner, Kristopher Benson, fled the scene with Magnum.", "\n\nEight days later, the FVRD and RCMP executed a warrant to seize the dog but it was not at the residence searched. ", "But because of its aggressive history that required microchipping, and despite the colour alteration, staff found the dog on Sept. 28 and it was seized.", "\n\nA month after being attacked by a pit bull, a Chilliwack woman’s wounds have not healed and she is suffering with a serious antibiotic resistant infection. (", "Submitted)\n\nAs for the victim of the attack, things are not going well. ", "The woman, A.C. – who has requested The Progress not use her full name because of the owner’s criminal history – is suffering with a life-threatening infection from the pit bull’s saliva. ", "Her dog, Rux, is similarly infected with MRSI or Staphylococcus pseudo-intermedius, a methicillin-resistant infection.", "\n\n“I’ve been getting treatment and I’ve been in and out of ER for the last two weeks and they’ve been checking my vitals for sepsis,” A.C. said this week. “", "We realized that Rux’s wounds aren’t getting better either because of the infection…. ", "He is actually fighting for his life.”", "\n\nA month after the incident, which was witnessed by a number of people, and after which the dog’s owner took off, A.C.’s and Rux’s wounds are not healing. ", "In response to news of the seizure of the dog, A.C. said she wasn’t interested as her sole focus is on getting better.", "\n\n“I don’t really care right now as to what happens,” she said. “", "I just want to survive this. ", "I want to survive and just be healthy again and I want my dog to survive and be healthy again.”", "\n\nA.C. said her family has spent $10,000 in veterinarian bills so far and Rux is still fighting for his life. ", "Rux was actually raised and trained as an emotional support and therapy dog who was supposed to start volunteering at the end of October.", "\n\n“He provides support for our foster child who was shocked by the whole ordeal,” she said.", "\n\nAfter the incident, the owner of the dog defended his dog in social media comments. ", "He said the story was “blown way out of control” and that Rux was just as at fault as Magnum in the incident.", "\n\nA.C. said she and her family have been traumatized, and she is heartbroken by the owner’s actions.", "\n\nREAD MORE: Pit bull owner defends his dog after woman with dog attacked in Chilliwack\n\nA.C. and other witnesses confirmed that during the attack the dog, described as an extra large pit bull, latched on to Rux and would not let go. ", "A.C. was hitting the pit bull and later got help from a stranger who hit it with a piece of rebar unsuccessfully to get it to release its bite.", "\n\nIt was yet another stranger who stopped and used bear spray to finally get the dog to briefly release its grip, although A.C. said even that didn’t stop. ", "After the attack, a large pool of blood was visible on the sidewalk.", "\n\n“I am extremely hurt and saddened that no responsibility has been taken by the other party,” she said. “", "He has tried to fabricate a story when there were multiple eye-witnesses to confirm the actual facts of the event. ", "There is no acknowledgment, no remorse, and the victim-blaming makes everything so painful.”", "\n\nMuch was made of the issue of bully breeds such as pit bulls after the Aug. 31 attack, but A.C. actually agrees with what many pit bull defenders say: it isn’t about the breed or even the dog, it’s the owner.", "\n\n“I don’t want to vilify a particular breed,” she said. “", "It’s about responsible ownership for me. ", "We’ve experienced such trauma in our family that we just want to move on.”", "\n\nAs for the next steps with the dog in custody in an undisclosed location, the FVRD will now submit an application the court under Section 49, Subsection 10 of the Community Charter to seek permission to humanely euthanize the dog.", "\n\n“Since dogs are considered property, the FVRD is unable to euthanize the dog without the owner’s consent or a Provincial Court order,” Kinneman explained.", "\n\n@PeeJayAitch\n\npaul.henderson@theprogress.com\n\nLike us on Facebook and follow us on Twitter.", "\n\ndog attack\n\n\n\nSign up here Get local stories you won't find anywhere else right to your inbox.", "\n\nSubmitted Photo Injured poodle Rux after being attacked by a pit bull in Garrison Crossing Aug. 31." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.002139935502782464, 0.006126183085143566, 0.0007744720205664635, 0.0005512874922715127, 0.0008156111580319703, 0.00332735781557858, 0.0031898089218884706, 0.001470440300181508, 0.0015529815573245287, 0.0007916703470982611, 0.05083709955215454, 0.000618179386947304, 0.08180827647447586, 0.02032974176108837, 0.001673163496889174, 0.001526172854937613, 0.03282582014799118, 0.0013367993524298072, 0.0006057422724552453, 0.00842023640871048, 0.0038699184078723192, 0.0021521849557757378, 0.010396832600235939, 0.0012002616422250867, 0.0005693831481039524, 0.0011100020492449403, 0.0014517888193950057, 0.0008969170739874244, 0.0075045134872198105, 0.006187794730067253, 0.0026963865384459496, 0.020789097994565964, 0.0016365756746381521, 0.0006247384590096772, 0.0012069868389517069, 0.001302575459703803, 0.0012903688475489616, 0.0009392527281306684, 0.0005738665349781513, 0.0015697036869823933, 0.005481933709233999, 0.026458004489541054, 0.002273756079375744, 0.005581060890108347 ]

[ "using Network.", "Enums;\nusing Network.", "Packets;\nusing System;\nusing System.", "IO;\nusing System.", "Net;\nusing System.", "Net.", "Sockets;\nusing System.", "Threading;\n\nnamespace Network\n{\n /// <summary>\n /// Builds upon the <see cref=\"Connection\"/> class, implementing TCP and allowing for messages to be conveniently\n /// sent without a large serialisation header.", "\n /// </summary>\n public class TcpConnection : Connection\n {\n #region Variables\n\n /// <summary>\n /// The <see cref=\"TcpClient\"/> for this <see cref=\"TcpConnection\"/> instance.", "\n /// </summary>\n private readonly TcpClient client;\n\n /// <summary>\n /// The <see cref=\"NetworkStream\"/> on which to send and receive data.", "\n /// </summary>\n private readonly NetworkStream stream;\n\n /// <summary>\n /// The <see cref=\"Socket\"/> for this <see cref=\"TcpConnection\"/> instance.", "\n /// </summary>\n private readonly Socket socket;\n\n #endregion Variables\n\n #region Constructors\n\n /// <summary>\n /// Initializes a new instance of the <see cref=\"TcpConnection\"/> class.", "\n /// </summary>\n /// <param name=\"tcpClient\">The TCP client to use.</param>\n /// <param name=\"skipInitializationProcess\">\n /// Whether to skip the initialisation process for the underlying <see cref=\"Connection\"/>. ", "If <c>true</c>\n /// <see cref=\"Connection.", "Init()\"/> will have to be manually called later.", "\n /// </param>\n internal TcpConnection(TcpClient tcpClient, bool skipInitializationProcess = false) : base()\n {\n client = tcpClient;\n socket = tcpClient.", "Client;\n stream = client.", "GetStream();\n\n KeepAlive = true;\n ForceFlush = true;\n tcpClient.", "NoDelay = true;\n tcpClient.", "SendTimeout = 0;\n tcpClient.", "ReceiveTimeout = 0;\n tcpClient.", "LingerState = new LingerOption(false, 0);\n\n //The initialization has to be done elsewhere.", "\n //The caller of the constructor wants to apply\n //additional settings before starting the network comm.", "\n if (!", "skipInitializationProcess)\n Init();\n }\n\n #endregion Constructors\n\n #region Properties\n\n /// <inheritdoc />\n public override IPEndPoint IPLocalEndPoint { get { return (IPEndPoint)client?.Client?.LocalEndPoint; } }\n\n /// <summary>\n /// The local <see cref=\"EndPoint\"/> for the <see cref=\"socket\"/>.", "\n /// </summary>\n public EndPoint LocalEndPoint { get { return socket.", "LocalEndPoint; } }\n\n /// <inheritdoc />\n public override IPEndPoint IPRemoteEndPoint { get { return (IPEndPoint)client?.Client?.RemoteEndPoint; } }\n\n /// <summary>\n /// The remote <see cref=\"EndPoint\"/> for the <see cref=\"socket\"/>.", "\n /// </summary>\n public EndPoint RemoteEndPoint { get { return socket.", "RemoteEndPoint; } }\n\n /// <inheritdoc />\n public override bool DualMode { get { return socket.", "DualMode; } set { socket.", "DualMode = value; } }\n\n /// <inheritdoc />\n public override bool Fragment { get { return !", "socket.", "DontFragment; } set { socket.", "DontFragment = !", "value; } }\n\n /// <inheritdoc />\n public override int HopLimit\n {\n get { return (int)socket.", "GetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "HopLimit); }\n set { socket.", "SetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "HopLimit, value); }\n }\n\n /// <inheritdoc />\n public override bool IsRoutingEnabled\n {\n get { return !(", "bool)socket.", "GetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "DontRoute); }\n set { socket.", "SetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "DontRoute, !", "value); }\n }\n\n /// <inheritdoc />\n public override bool NoDelay\n {\n get { return client.", "Client.", "NoDelay; }\n set { client.", "Client.", "NoDelay = value; }\n }\n\n /// <inheritdoc />\n public override short TTL { get { return socket.", "Ttl; } set { socket.", "Ttl = value; } }\n\n /// <inheritdoc />\n public override bool UseLoopback\n {\n get { return (bool)socket.", "GetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "UseLoopback); }\n set { socket.", "SetSocketOption(SocketOptionLevel.", "Tcp, SocketOptionName.", "UseLoopback, value); }\n }\n\n #endregion Properties\n\n #region Methods\n\n /// <summary>\n /// Establishes a <see cref=\"UdpConnection\"/> with the remote endpoint.", "\n /// </summary>\n /// <param name=\"connectionEstablished\">The action to perform upon connection.</param>\n internal void EstablishUdpConnection(Action<IPEndPoint, IPEndPoint> connectionEstablished)\n {\n IPEndPoint udpEndPoint = new IPEndPoint(IPLocalEndPoint.", "Address, GetFreePort());\n RegisterPacketHandler<EstablishUdpResponse>((packet, connection) =>\n {\n UnRegisterPacketHandler<EstablishUdpResponse>(this);\n connectionEstablished.", "Invoke(udpEndPoint, new IPEndPoint(IPRemoteEndPoint.", "Address, packet.", "UdpPort));\n Send(new EstablishUdpResponseACK());\n }, this);\n\n Send(new EstablishUdpRequest(udpEndPoint.", "Port), this);\n }\n\n /// <inheritdoc />\n protected override byte[] ReadBytes(int amount)\n {\n if (amount == 0) return new byte[0];\n byte[] requestedBytes = new byte[amount];\n int receivedIndex = 0;\n\n while (receivedIndex < amount)\n {\n while (client.", "Available == 0)\n Thread.", "Sleep(IntPerformance);\n\n int clientAvailable = client.", "Available;\n int readAmount = (amount - receivedIndex >= clientAvailable) ? ", "clientAvailable : amount - receivedIndex;\n stream.", "Read(requestedBytes, receivedIndex, readAmount);\n receivedIndex += readAmount;\n }\n\n return requestedBytes;\n }\n\n /// <inheritdoc />\n protected override void WriteBytes(byte[] bytes)\n {\n stream.", "Write(bytes, 0, bytes.", "Length);\n if (ForceFlush) stream.", "Flush();\n }\n\n /// <inheritdoc />\n /// <remarks>\n /// Since TCP ensures the ordering of packets, we will always receive the <see cref=\"AddPacketTypeRequest\"/> before\n /// a <see cref=\"Packet\"/> of the unknown type. ", "Thus, it is theoretically impossible that this method is called for\n /// a <see cref=\"TcpConnection\"/> instance. ", "Still gotta handle it though :),\n /// </remarks>\n protected override void HandleUnknownPacket()\n {\n Logger.", "Log(\"Connection can't handle the received packet. ", "No listener defined.\", ", "LogLevel.", "Error);\n CloseHandler(CloseReason.", "ReadPacketThreadException);\n }\n\n /// <inheritdoc />\n protected override void CloseHandler(CloseReason closeReason) => Close(closeReason, true);\n\n /// <inheritdoc />\n protected override void CloseSocket()\n {\n stream.", "Close();\n client.", "Close();\n }\n\n #endregion Methods\n }\n}" ]

{ "pile_set_name": "Github" }

[ 0.0007362678297795355, 0.0007287435000762343, 0.0007297094562090933, 0.0008147435146383941, 0.0009532360709272325, 0.0014362848596647382, 0.0006889569340273738, 0.0006889828946441412, 0.0005945193115621805, 0.0006654069875366986, 0.0006151727866381407, 0.000672834285069257, 0.0006615258753299713, 0.000737709691748023, 0.0006297760410234332, 0.0011106821475550532, 0.0007165344431996346, 0.0013443699572235346, 0.001523509155958891, 0.0033219021279364824, 0.0021024493034929037, 0.0012312292819842696, 0.0006627156981267035, 0.0014503096463158727, 0.0007570435991510749, 0.0008886182331480086, 0.0007760285516269505, 0.0009098952868953347, 0.0020353717263787985, 0.0018751034513115883, 0.007268400862812996, 0.001264429884031415, 0.002889655064791441, 0.012797283008694649, 0.0012686144327744842, 0.00414573960006237, 0.0008779419586062431, 0.0012365132570266724, 0.0016116880578920245, 0.0008779419586062431, 0.005300841294229031, 0.006197135429829359, 0.00414573960006237, 0.0008779419586062431, 0.0013869141694158316, 0.0016116880578920245, 0.0008779419586062431, 0.011777509935200214, 0.00202464428730309, 0.0007727027405053377, 0.001180656487122178, 0.0007727027405053377, 0.001610853592865169, 0.0020765746012330055, 0.011887562461197376, 0.00414573960006237, 0.0008779419586062431, 0.001588223734870553, 0.0016116880578920245, 0.0008779419586062431, 0.0006659228820353746, 0.0008500106632709503, 0.000828880409244448, 0.001077587716281414, 0.0007016172166913748, 0.0010219743708148599, 0.0008993229130282998, 0.0007428550161421299, 0.000722908996976912, 0.0006822056602686644, 0.000660595134831965, 0.0020260890014469624, 0.0032121881376951933, 0.0007301268051378429, 0.0007687811157666147, 0.0006232088780961931, 0.001131637254729867, 0.0007087920093908906, 0.0006277798092924058, 0.0011307703098282218, 0.0009014226379804313, 0.0012060037115588784, 0.0006291797035373747, 0.0007539180223830044 ]

[ "Evidence for pH sensitivity of tumor necrosis factor-alpha release by alveolar macrophages.", "\nAlveolar macrophages (m phi) participate in inflammatory and immune responses in acidic microenvironments such as the interstitial fluids of tumors and abscesses. ", "Two plasmalemmal H+ extruders interact to control the acid-base status of alveolar m phi, namely a V-type H+ pump (V-ATPase) and a Na+/H+ exchanger. ", "The present study examined the effects of extracellular pH (pHo) and H+ transport inhibitors on tumor necrosis factor-alpha (TNF-alpha) release induced by endotoxin (lipopolysaccharide) in rabbit alveolar m phi. ", "The amount and activity of TNF-alpha in m phi-conditioned media were determined by enzyme-linked immunosorbent assay and L929 fibroblast bioassay, respectively. ", "TNF-alpha release was suppressed progressively at lower pHo values (< or = 7.0). ", "Also, bafilomycin A1 (a specific inhibitor of V-ATPases) significantly reduced the amount and activity of TNF-alpha in m phi-conditioned media (pHo 7.4). ", "However, bafilomycin caused a significant increase in the nonspecific cytotoxicity (i.e. bioactivity insensitive to TNF-alpha antibody) of m phi-conditioned media. ", "The effects of bafilomycin specifically on TNF-alpha release followed a time course similar to that of acidic pHo, suggesting that both treatments acted on similar events in the lipopolysaccharide signal transduction pathway. ", "Amiloride (an inhibitor of Na+ transporters including the Na+/H+ exchanger) also suppressed TNF-alpha release but displayed a time course of action different from the acidic pHo or bafilomycin." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0007837848970666528, 0.0017806506948545575, 0.0010080981301143765, 0.0006829352350905538, 0.0007357498398050666, 0.0005970353959128261, 0.0006756319780834019, 0.0009173698490485549, 0.0007023920188657939, 0.0007432047859765589 ]

[ "Q:\n\nEdit issue: Couldn't find Client with 'id'=\n\nI've searched for hours, and I can't seem to find anything that handles my problem here. ", "This might be easy for someone, but it'd be GREATLY appreciated if anyone can help.", "\nI'm creating an app to make a simple CRUD on clients in my database. ", "Index is working fine. ", "And Showing each client with an ID is working great. ", "I see all the details of the client. ", "\nImage example of index in app\nBut with the edit action I get this error in the browser: \nActiveRecord::RecordNotFound in ClientsController#edit \nCouldn't find Client with 'id'=\n\nExtracted source (around line #30):\n\n29 def edit\n30 @client = Client.find(params[:id])\n31 end\n32\n33 def update\n\nI don't understand this as I've used the same code in the edit action from the working show action:\ndef show\n @client = Client.find(params[:id])\nend\n\nIt appears as if the application is unable to fetch the :id parameter from my browser and place it in the edit form action. ", "The issue might also appear in the update action. ", "I've tried typing in @client = Client.find(1) and it works. ", "It gives me an edit-form with the client_id of 1 in the browser, but of course I want the ID from the browser like how the view action works. ", "So I'm guessing something is wrong with my routing, since the app understands both index and view, but not how to pass on the id to the edit page.", "\nThis is what my route file looks like:\nRails.application.routes.draw do\n\n resources :clients\n\n match ':controller(/:action(:/id))', :via => [:get, :post]\n\nend\n\nThis is what my edit.html.erb looks like\n<%= link_to(\"<< Back to List\", {:action => 'index'}, :class => 'back-link') %>\n\n<div class=\"clients edit\">\n<h2>Update client</h2>\n\n<%= form_for(:client, :url => {:action => 'update', :id => @client.id}) do |f| %>\n\n <table summary=\"Client form fields\">\n <tr>\n <th>Name</th>\n <td><%= f.text_field(:name) %></td>\n </tr>\n <tr>\n <th>Visible</th>\n <td><%= f.text_field(:visible) %></td>\n </tr>\n <tr>\n <th>Category</th>\n <td><%= f.text_field(:category_id) %></td>\n </tr>\n <tr>\n <th>Short description</th>\n <td><%= f.text_field(:shortdescription) %></td>\n </tr>\n <tr>\n <th>Long description</th>\n <td><%= f.text_field(:longdescription) %></td>\n </tr>\n <tr>\n <th>Phonenumber</th>\n <td><%= f.text_field(:phonenumber) %></td>\n </tr>\n <tr>\n <th>Email</th>\n <td><%= f.text_field(:email) %></td>\n </tr>\n <tr>\n <th>Country</th>\n <td><%= f.text_field(:country) %></td>\n </tr>\n <tr>\n <th>Lattitude</th>\n <td><%= f.text_field(:lattitude) %></td>\n </tr>\n <tr>\n <th>Longtitude</th>\n <td><%= f.text_field(:longtitude) %></td>\n </tr>\n </table>\n\n <div class=\"form-buttons\">\n <%= submit_tag(\"Update Client\") %>\n </div>\n\n<% end %>\n\nThis is what my rake routes looks like\n Prefix Verb URI Pattern Controller#Action\n clients GET /clients(.:format) clients#index\n POST /clients(.:format) clients#create\n new_client GET /clients/new(.:format) clients#new\nedit_client GET /clients/:id/edit(.:format) clients#edit\n client GET /clients/:id(.:format) clients#show\n PATCH /clients/:id(.:format) clients#update\n PUT /clients/:id(.:format) clients#update\n DELETE /clients/:id(.:format) clients#destroy\n root GET / clients#index\n\nAnd this is what my clients_controller.rb looks like\n `class ClientsController < ApplicationController\ndef index\n @clients = Client.order(\"name ASC\")\nend\n\ndef show\n @client = Client.find(params[:id])\nend\n\ndef new\n @client = Client.new({:country => 'DK'})\nend\n\ndef create\n @client = Client.new(client_params)\n if @client.save\n redirect_to(:action => 'index')\n else\n render('new')\n end\nend\n\ndef edit\n @client = Client.find(params[:id])\nend\n\ndef update\n @client = Client.find(params[:id])\n if @client.update_attributes(client_params)\n redirect_to(:action => 'show', :id => @client.id)\n else\n render('edit')\n end\nend\n\ndef delete\nend\n\nprivate\n\n def client_params\n\n params.require(:client).permit(:name, :visible, :category_id, :shortdescription, :longdescription, :phonenumber, :email, :country, :lattitude, :longtitude)\n end\nend`\n\nI hope anyone can help! ", "Anything, really, since i'm stuck. ", "\nI've tried reading http://guides.rubyonrails.org/routing.html but I cant seem to find out where it all goes wrong.", "\nEDIT: It could also be that I'm linking wrongly to the edit-action. ", "Not sure, but here is the index.html.erb\n<div class=\"clients index\">\n<h2>Clients</h2>\n\n<%= link_to(\"Add New Client\", {:action => 'new'}, :class => 'action new') %>\n\n<table class=\"listing\" summary=\"Clients list\">\n <tr class=\"header\">\n\n <th>id</th>\n <th>Name</th>\n <th>Category</th>\n <th>Visible</th>\n <th>Actions</th>\n </tr>\n <% @clients.each do |client| %>\n <tr>\n <td><%= client.id %></td>\n <td class=\"center\"><%= client.name %></td>\n <td class=\"center\"><%= client.category_id %></td>\n <td class=\"center\"><%= client.visible ? '", "Yes' : 'No' %></td>\n <td class=\"actions\">\n <%= link_to(\"Show\", {:action => 'show', :id => client.id}, :class => 'action show') %>\n <%= link_to(\"Edit\", {:action => 'edit'}, :class => 'action edit') %>\n <%= link_to(\"Delete\", '#', :class => 'action delete') %>\n </td>\n <td></td>\n </tr>\n <% end %>\n</table>\n</div> \n\nA:\n\nYou are missing id attribute in your path. ", "Make the following changes please:\n<%= link_to(\"Edit\", {:action => 'edit', :id => client.id}, :class => 'action edit') %>\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0007332891109399498, 0.0005266299122013152, 0.00101083901245147, 0.0007007979438640177, 0.0008634650148451328, 0.0005440081586129963, 0.0007072516018524766, 0.0005931264022365212, 0.0006000797729939222, 0.0006343557615764439, 0.0005870528984814882, 0.0015430747298523784, 0.0008640086161904037, 0.0005973741062916815, 0.0005768440314568579, 0.0008856087224557996, 0.0017663108883425593, 0.0006707386928610504 ]

[ "FIG. ", "14 is a block diagram showing configuration of a voltage controlling/oscillating device based on the conventional technology. ", "This voltage controlling/oscillating device 1 comprises a delay unit 11, a delay interpolator 12, and an inverting gate 13. ", "A signal outputted from the output terminal OUT1 of the delay interpolator 12 is finally outputted from an output terminal 15 of the voltage controlling/oscillating device 1 to an external device as a clock signal CLK. ", "The same signal as the output signal is also inputted into the inverting gate 13. ", "The signal inputted into the inverting gate 13 is inputted with the phase thereof inverted into a first input terminal FST1 of the delay interpolator 12 and delay unit 11. ", "The signal inputted into the delay unit 11 is delayed by a preset delay rate d1 and inputted into a second input terminal SLW1 of the delay interpolator 12. ", "An oscillation frequency control voltage (Namely, a voltage for controlling the oscillation frequency) VCTL is inputted into a control terminal CTL1 of the delay interpolator 12 through an oscillation frequency control terminal 14 of the voltage controlling/oscillating device 1.", "\nFIG. ", "15 is a circuit diagram showing detailed configuration of the voltage controlling/oscillating device 1. ", "The delay unit 11 comprises four pieces of first to fourth transistors 101, 102, 103, and 104; three pieces of first to third current sources 105, 106, and 107; two pieces of resistors 108 and 109; and two pieces of capacitors 110 and 111, and constitute a differential switching circuit and an emitter follower. ", "The circuit constant of the delay unit 11 is designed in such a way that a propagation delay between input and output thereof will be a desired delay rate d1.", "\nThe first transistor 101 of the differential switching circuit is connected to an input terminal IN of the delay unit 11 at the base terminal thereof, the collector terminal thereof is connected to a power supply terminal VCC through the loading resistor 108, and the emitter terminal thereof is connected to the first current source 105. ", "The second transistor 102 of the differential switching circuit is connected to an inverting input terminal /IN (expressed with a bar over IN in the figure) of the delay unit 11 at the base terminal thereof, the collector terminal thereof is connected to the power supply terminal VCC through the loading resistor 109, and the emitter terminal thereof is connected to the first current source 105. ", "The collector terminal of the first transistor 101 is connected to one electrode of the capacitor 110 and the collector terminal of the second transistor 102 is connected to one electrode of the capacitor 111, and the other electrodes of these capacitors are connected to the power supply terminal VCC. ", "It should be noted that the symbol \"/\" in front of a terminal symbol in this specification represents that an inverted signal of an input or an output signal to a terminal with the same terminal symbol is inputted or outputted.", "\nThe collector terminal of the second transistor 102 is connected to the base terminal of the third transistor 103 of the emitter follower. ", "In the third transistor 103, the collector terminal is connected to the power supply terminal VCC, and the emitter terminal is connected to the second current source 106 as well as to the output terminal OUT of the delay unit 11. ", "The collector terminal of the first transistor 101 is connected to the base terminal of the fourth transistor 104 as the emitter follower. ", "In the fourth transistor 104, the collector terminal is connected to the power supply terminal VCC, and the emitter terminal is connected to the third power supply terminal 107 as well as to the inverting output terminal /OUT of the delay unit 11. ", "The output terminal /OUT and inverting output terminal /OUT of the delay unit 11 are connected to the second input terminal SLW1 and second inverting input terminal /SLW1 of the delay interpolator 12 respectively.", "\nHerein, it is assumed that waveforms of signals inputted into the first input terminal FST1 and the second input terminal SLW1 of the delay interpolator 12 are Vfst (t) and Vslw (t); each input resistance, input capacity and delay constant of the first and second transistors 101 and 102 are rb, Cdif, and Kdif respectively. ", "Further, it is assumed that each input capacity and delay constant of the third and fourth transistors 103 and 104 are Ceh and Keh respectively; and a cutoff angle frequency of the transistor is .omega.t. ", "Also, it is assumed that the resistance of the resistors 108 and 109 is RL. ", "Further, it is assumed that the current of the first current source 105 is IEE0, and the current of the second and third current sources 106 and 107 is IEE1. ", "Then, the propagation delay d1 in the delay unit 11 can be expressed with the help of the following Equation (1). ", "EQU d1=Vslw(t)-Vfst(t)=rb/ (RL.multidot..omega.t)+rb.multidot.", "Cdif+In(2).multidot.", "RL.multidot.", "Ceh=rb/ (RL.multidot..omega.t)+rb.multidot.", "Kdif.multidot.", "IEE0+In(2).multidot.", "RL.mul tidot.", "Keh.multidot.", "IEE1 (1)\nThe first term and second term in the right side of this Equation (1) corresponds to a switching delay rate in the pair of differential transistors respectively, and the third term therein corresponds to a propagation delay rate in the emitter follower.", "\nThe delay interpolator 12 comprises eight pieces of the fifth to twelfth transistors 201, 202, 203, 204, 205, 206, 207, and 208; three pieces of the fourth to sixth current sources 209, 210, and 211; four pieces of resistors 212, 213, 214, and 215; and two pieces of capacitors 216 and 217, which constitute a current distributing circuit, a differential switching circuit, and an emitter follower. ", "The circuit constant of the delay interpolator 12 is designed in such a way that a propagation delay between input and output thereof will be a desired delay rate d2.", "\nIn the fifth transistor 201 of the current distributing circuit, the base terminal is connected to a control terminal CTL1 of the delay interpolator 12, and the emitter terminal is connected to the fourth current source 209 through the resistor 212. ", "In the sixth transistor 202 of the current distributing circuit, the base terminal is connected to an inverting control terminal /CTL1 of the delay interpolator 12, and the emitter terminal thereof is connected to the fourth current source 209 through the resistor 213.", "\nIn the seventh transistor 203 of the differential switching circuit, the base terminal is connected to the second input terminal SLW1 of the delay interpolator 12, the collector terminal is connected to the power supply terminal VCC through the loading resistor 214, and the emitter terminal is connected to the collector terminal of the fifth transistor 201. ", "In the eighth transistor 204 of the differential switching circuit, the base terminal is connected to the second inverting input terminal /SLW1 of the delay interpolator 12, the collector terminal thereof is connected to the power supply terminal VCC through the loading resistor 215, and the emitter terminal is connected to the collector terminal of the fifth transistor 201.", "\nIn the ninth transistor 205 of the differential switching circuit, the base terminal is connected to the first input terminal FST1 of the delay interpolator 12, the collector terminal is connected to the collector terminal of the seventh transistor 203, and the emitter terminal is connected to the collector terminal of the sixth transistor 202. ", "In the tenth transistor 206 of the differential switching circuit, the base terminal is connected to the first inverting input terminal /FST1 of the delay interpolator 12, the collector terminal is connected to the collector terminal of the eighth transistor 204, and the emitter terminal is connected to the collector terminal of the sixth transistor 202.", "\nThe capacitor 216 is connected in parallel with the resistor 214 between the collector terminal of the seventh and ninth transistors 203, 205 and the power supply terminal VCC. ", "On the other hand, the capacitor 217 is connected in parallel with the resistor 215 between the collector terminal of the eight and tenth transistors 204, 206 and the power supply terminal VCC.", "\nThe collector terminal of the eighth transistor 204 is connected to the base terminal of the eleventh transistor 207 of the emitter follower. ", "In the eleventh transistor 207, the collector terminal is connected to the power supply terminal VCC, and the emitter terminal is connected to the fifth current source 210 as well as to the output terminal OUT1 of the delay interpolator 12. ", "The collector terminal of the seventh transistor 203 is connected to the base terminal of the twelfth transistor 208 of the emitter follower. ", "In the twelfth transistor 208, the collector terminal is connected to the power supply terminal VCC, and the emitter terminal is connected to the sixth current source 211 as well as to the inverting output terminal /OUT1 of the delay interpolator 12.", "\nThe output terminal OUT1 of the delay interpolator 12 is connected to the inverting input terminal /IN of the delay unit 11 as well as to the first inverting input terminal /FST1 of the delay interpolator 12. ", "The inverting output terminal /OUT1 of the delay interpolator 12 is connected to the input terminal IN of the delay unit 11 as well as to the first input terminal FST1 of the delay interpolator 12.", "\nHerein, in the device shown in FIG. ", "14, although the phase of an output signal from the delay interpolator 12 is inverted at the inverting gate 13 and the inverted signal is inputted into the first input terminal FST1 of the delay interpolator 12 and the delay unit 11, the actual voltage controlling/oscillating device is designed in such a way that the differential output from the delay interpolator 12 is inputted with the phase thereof inverted into the first input terminal FST1 of the delay interpolator 12 as well as into the delay unit 11 in place of using the inverting gate 13 as shown in FIG. ", "15.", "\nFIG. ", "16 is a timing chart for explaining an operational timing of the delay interpolator 12. ", "Inputted into the second input terminal SLW1 of the delay interpolator 12 is the same signal as that inputted into the first input terminal FST1 with a delay equivalent to the propagation delay rate d1 in the delay unit 11. ", "The delay interpolator 12 synthesizes the signals inputted into the first input terminal FST1 as well as into the second input terminal SLW1 respectively at a synthesizing ratio corresponding to the oscillation frequency control voltage VCTL inputted into the control terminal CTL1, and outputs the synthesized signal. ", "A waveform V0(t) outputted from the delay interpolator 12 can be expressed with the help of the following Equation (2) and Equation (3) assuming that the synthesizing ratio is .beta.. EQU V0(t)=Vfst(t)+.beta.[Vslw(t)-Vfst(t)]=Vfst(t)+.beta..multidot.d1 (2)\nwhere EQU 0.ltoreq..beta.1 (3)\nFrom the Equation (2) and Equation (3), it is clear that the waveform of an output signal from the delay interpolator 12 is the same as that of the signal inputted into the first input terminal FST1 which is a waveform with the phase thereof is delayed by .beta..multidot.d1. ", "The synthesizing ratio .beta. ", "of the actual delay interpolator 12 is decided by changing a current distribution ratio of the fourth current source 209 utilizing the oscillation frequency control voltage VCTL fed to each base terminal of the pair of transistors 201 and 202.", "\nBecause the collector terminals of the pair of transistors 203 and 205 are commonly connected and also the collector terminals of the pair of transistors 204 and 206 are commonly connected, which are connected to the loading resistors 214 and 215 respectively, the waveform of an signal inputted into the first input terminal FST1 and the waveform of and signal inputted into the second input terminal SLW1 are synthesized. ", "Herein, in the actual delay interpolator 12, as a propagation delay rate d2 specific to the delay interpolator 12 is added to a delay time indicated by .beta..multidot.d1, the waveform V0(t) of an output signal from the delay interpolator 12 can be expressed with the help of the following Equation (4). ", "EQU V0(t)=Vfst(t)+.beta..multidot.d1+d2 (4)\nNamely, an actual output signal from the delay interpolator 12 is the same as that inputted into the first input terminal FST1 and has a waveform with the phase thereof delayed by .beta..multidot.d1+d2. ", "Herein, assuming that each input resistance and delay constant of the seventh to tenth transistors 203, 204, 205 and 206 are rb and Kdif respectively; each delay constant of the eleventh and twelfth transistors 207 and 208 is Keh; a cutoff angle frequency of the transistor is .omega.t; the resistance of the resistors 108 and 109 is RL; the current of the fourth current source 209 is IEE0, and the current of the fifth and sixth current sources 210 and 211 is IEE1, the propagation delay rate d2 can be expressed with the help of the following Equation (5). ", "EQU d2=rb/ (RL.multidot..omega.t)+rb.multidot.", "Kdif.multidot.", "IEE0+In(2).multidot.", "RL.mu ltidot.", "Keh.multidot.", "IEE1 (5)\nIn Equation (5), the first term and second term in the right side thereof are each switching delay rate in the pairs of differential transistors 203, 204, 205, and 206 respectively, and the third term therein is a propagation delay rate in the emitter follower.", "\nFIG. ", "17 is a timing chart for explaining an operational timing of the voltage controlling/oscillating device based on the conventional technology. ", "The delay interpolator 12 synthesizes, as described above, an input signal into the first input terminal FST1 and an input signal into the second input terminal SLW1 at a synthesizing ratio according to the oscillation frequency control voltage VCTL inputted into the control terminal CTL1 and outputs the synthesized signal. ", "The waveform of the output signal is the same as that of the input signal into the first input terminal FST1. ", "The delay interpolator 12 forms a waveform with the phase thereof delayed by .beta..multidot.d1+d2. ", "Namely, the change (indicated by timing T1 in FIG. ", "17) in a voltage level inputted into the first input terminal FST1 of the delay interpolator 12 is delayed by .beta..multidot.d1+d2, and outputted from the output terminal OUT1 of the delay interpolator 12 (timing T2).", "\nAs an output signal from the delay interpolator 12 is inputted with the phase thereof inverted by the inverting gate 13 into the first input terminal FST1 of the delay interpolator 12, the voltage level at the first input terminal FST1 is inverted at the point of time indicated by timing T2. ", "Similarly, at the point of time indicated by timing T3 delayed by .beta..multidot.d1+d2 from timing T2, the voltage level at the first input terminal FST1 is inverted again and the voltage level of an output signal from the output terminal OUT1 is also inverted. ", "By repeating this processing, the delay interpolator 12 outputs clock signals each of which output level is inverted at time intervals of .beta..multidot.d1+d2. ", "Oscillation frequency fvco of this clock signal, minimum oscillation frequency fmin, maximum oscillation frequency fmax, and oscillation central frequency f0 thereof can be expressed with the help of the following Equation (6) to Equation (9) respectively. ", "EQU fvco(.beta.)=1/[2.multidot.(.beta..multidot.d1+d2)] (6) EQU fmin=fvco(.beta.=0)=1/2[2.multidot.d2] (7) EQU fmax=fvco(.beta.=1)=1/2[2.multidot.(d1+d2)] (8) EQU f0=fvoc(.beta.=0.5)=1/(d1+2.multidot.d2) (9)\nAs described above, the conventional type of voltage controlling/oscillating device is designed, as clearly understood from the Equation (7) to Equation (9), to essentially control the oscillation frequency by setting a propagation delay rate d1 in the delay unit 11 and a propagation delay rate d2 in the delay interpolator 12 and adjusting an oscillation frequency control voltage VCTL for deciding .beta..\nHowever, when the conventional type of voltage controlling/oscillating device is made into an integrated circuit, input resistance rb, delay constants Cdif, Keh, and a cutoff angle frequency .omega.t of a transistor and the resistance RL have generally more than .+-.10% of variations derived from variations in manufacturing in the applied process. ", "Accordingly, even if propagation delay rates d1, d2 are designed to get the oscillation central frequency f0, there is a problem such that displacement may occur in an actual oscillation central frequency in a manufacturing step.", "\nGenerally, as the voltage controlling/oscillating device is used in many cases for a phase-locked loop (PLL), if the oscillation central frequency is displaced from a design value, a constant phase error in the phase-locked loop may occur, which is disadvantageous. ", "Therefore, loading resistance RL of the delay unit 11 and delay interpolator 12 is adjusted by laser trimming, and displacement of the oscillation central frequency due to variations in process is corrected. ", "In this method, however, as laser trimming is performed while an oscillation central frequency is measured when bare chips for an integrated circuit is selected, a costly measurement system such as a high frequency prober is required, which significantly increases the capital investment." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.000829310214612633, 0.0008260855684056878, 0.0007763077737763524, 0.0007407392258755863, 0.0006774020730517805, 0.0006526532815769315, 0.0006550042890012264, 0.0006858281558379531, 0.000829310214612633, 0.000811527599580586, 0.0008127251057885587, 0.0006172735593281686, 0.0006985082291066647, 0.0006883705500513315, 0.000795012223534286, 0.0005948523175902665, 0.0007952129817567766, 0.0007310270448215306, 0.0007863190257921815, 0.0007582580437883735, 0.0007868710672482848, 0.0006804035510867834, 0.0006927272188477218, 0.000726655765902251, 0.0006679743528366089, 0.0005597861600108445, 0.0020756341982632875, 0.0007697787950746715, 0.0010020522167906165, 0.0010859837057068944, 0.0010818621376529336, 0.000895220204256475, 0.0012167512904852629, 0.0014237811556085944, 0.0006349373143166304, 0.0007837364100851119, 0.0006293898914009333, 0.0007480372441932559, 0.0007283411687240005, 0.0007256733952090144, 0.0007687060278840363, 0.0006886779447086155, 0.0007433209684677422, 0.0007636196678504348, 0.0008147629559971392, 0.000733032647985965, 0.0006889034411869943, 0.000714578724000603, 0.0007003209320828319, 0.0007737951818853617, 0.0007707264157943428, 0.0006585451774299145, 0.0006686988053843379, 0.0013242698041722178, 0.000829310214612633, 0.0006073374534025788, 0.0007152297184802592, 0.0006604449590668082, 0.0008055047364905477, 0.0006541169132106006, 0.0006363249267451465, 0.000665903149638325, 0.0006080883904360235, 0.0010577610228210688, 0.0006512664258480072, 0.0013434527209028602, 0.0010818621376529336, 0.000895220204256475, 0.017502201721072197, 0.0014237811556085944, 0.0006268005236051977, 0.000829310214612633, 0.0006167587707750499, 0.000657298369333148, 0.0007034573354758322, 0.0007769335061311722, 0.000617649347987026, 0.0006920230807736516, 0.0006478293798863888, 0.0006872945232316852, 0.0007199915708042681, 0.0006414145464077592, 0.0009891489753499627, 0.0006463341997005045, 0.00066104851430282, 0.0006238364730961621, 0.0005981826107017696 ]

[ "Languages\n\nAvailable In\n\nSubmission to the Universal Periodic Review of the Central African Republic\n\n31st session of the Universal Periodic Review; 3rd cycle\n\nThis submission has been prepared by Human Rights Watch for the third cycle review of the Central African Republic in the framework of the Universal Periodic Review (UPR). ", "It is based on information obtained through research conducted since the second cycle review of the Central African Republic. ", "This submission covers a period of intense conflict, during which civilians have borne the brunt of violence perpetrated by armed groups. ", "While Human Rights Watch has reported on a range of human rights abuses in the country since the last UPR, this submission focuses on sexual violence committed by two main parties to the conflict, the Seleka and the anti-balaka.[1]\n\nConclusions and recommendations from the second cycle UPR of the Central African Republic include calls for strengthened measures to prevent sexual violence and attacks on civilians by armed groups, as well as to improve access to critical medical, mental health, and legal support for sexual violence survivors. ", "They also call for accountability for crimes of sexual violence, including through timely and thorough investigations of sexual violence by armed groups. ", "Human Rights Watch found that members of armed groups continue to commit rape and sexual slavery with impunity, and that survivors continue to suffer not only from the violence itself, but from long-term physical, emotional, and social consequences, often without timely access to essential services.", "\n\nSexual Violence as a Weapon of War\n\nIn interviews with 296 survivors, Human Rights Watch documented pervasive sexual violence against women and girls perpetrated by Seleka and anti-balaka fighters from early 2013 to mid-2017. ", "This includes cases of rape, sexual slavery, physical assault, and kidnapping of women and girls between the ages of 10 and 75, primarily in the capital, Bangui, and in and around the towns of Alindao, Bambari, Boda, Kaga-Bandoro, and Mbrès.", "\n\nArmed groups have not simply committed sexual violence as a byproduct of fighting, but, in many cases, used it as a tactic of war. ", "Commanders have consistently tolerated sexual violence by their forces and, in some cases, they appear to have ordered it or to have committed it themselves.", "\n\nIn many cases, survivors said their attackers used sexual violence as a form of retribution for perceived support of those on the other side of the sectarian divide. ", "Seleka fighters taunted women and girls by calling them “anti-balaka wives” and anti-balaka fighters accused their victims of supporting Muslims. ", "In some instances, armed groups used sexual violence as punishment for the alleged alliances of survivors’ male relatives.", "\n\nMembers of armed groups aggravated the humiliation by raping some women and girls in front of their husbands, children, and other family members. ", "Survivors also witnessed fighters rape, kill, or mutilate their husbands and other relatives. ", "In one instance, a survivor said fighters raped her husband, forcing her to watch, before killing him and raping her.", "\n\nMost survivors said that multiple perpetrators raped them—sometimes 10 men or more during a single incident. ", "The rapes of these women and girls, which resulted in injuries ranging from broken bones and smashed teeth to internal injuries and head trauma, constitute torture. ", "Torture was exacerbated in some cases by additional violence, including rape with a grenade and a broken bottle. ", "Perpetrators also tortured women and girls by whipping them, tying them up for prolonged periods, burning them, and threatening them with death.", "\n\nIn interviews with 257 women and 39 girls (ages 17 and under) Human Rights Watch documented 305 cases of sexual violence by members of armed groups. ", "Some survivors experienced sexual violence multiple times, on separate occasions. ", "Multiple women and girls said fighters raped them while they were pregnant.", "\n\nHuman Rights Watch interviewed 44 women and girl survivors of sexual slavery, wherein fighters committed sexual violence and exerted ownership over victims. ", "The survivors said that they were held captive with a total of at least 167 other women and girls who were also sexual slavery victims. ", "Sexual slavery survivors were held captive for up to 18 months, repeatedly raped—some taken as fighters’ “wives”—and forced to cook, clean, and collect food or water. ", "At least nine survivors became pregnant while held as sexual slaves, including girls aged 14 and approximately 16 at the time, and at least five gave birth to children from the rapes.[2]\n\nDue to stigma, under-reporting by survivors, and time constraints and security-related restrictions on research, the cases documented by Human Rights Watch likely represent a small proportion of all sexual violence incidents perpetrated by armed groups in the country during the period covered.[3]\n\nLack of Access to Services\n\nOnly 145 of the 296 sexual violence survivors had accessed any post-rape medical care due to a range of obstacles, such as a lack of medical facilities, cost of travel to such facilities, and fear of stigma and rejection. ", "Of these, only 83 survivors confirmed that they had disclosed the sexual violence to health care providers, thus allowing for comprehensive post-rape care. ", "Service providers’ failure to provide discreet, confidential, and sensitive care sometimes deterred survivors from disclosing sexual violence or successfully accessing help.", "\n\nAmong those who did disclose rape, many said service providers did not offer them critical elements of post-rape care, including post-exposure prophylaxis (PEP) to prevent HIV, emergency contraception, testing for HIV and other sexually transmitted infections (STIs), and psychosocial support. ", "Only 41 of the survivors Human Rights Watch interviewed said they accessed medical care within 72 hours of rape, the time period during which PEP can be effectively administered.", "\n\nNumerous women and girls who visited health centers and disclosed rape told Human Rights Watch that personnel did not inform them about nearby health or psychosocial services for rape survivors. ", "In only 66 cases had survivors received any psychosocial support. ", "Survivors described symptoms consistent with depression or post-traumatic stress disorder (PTSD) and, in some cases, suicidal thoughts.", "\n\nFifty-three women and girls told Human Rights Watch that costs hindered their access to medical care. ", "Though a Ministry of Health official told Human Rights Watch that health facilities offer free post-rape care, several survivors who disclosed sexual violence to health personnel told Human Rights Watch that medical providers asked for payment for exams, tests, or medications.[4] Even when services were free, survivors sometimes could not afford the cost of transport to health facilities.", "\n\nHuman Rights Watch interviewed 13 survivors, including three girls, who said they became pregnant from rape. ", "Survivors held as sexual slaves said they knew of at least five other women and girls who became pregnant while held captive. ", "Though abortion is legal in cases of rape in the Central African Republic, significant barriers to access remain. ", "An 18-year-old survivor who was pregnant following rape by an anti-balaka fighter said she wanted an abortion, but had not accessed medical care and did not know how to do so. “", "What am I going to do with this baby?” ", "she asked. “", "I did not want it. ", "Who will take care of it? ", "My family is all dead and I have a murderer’s baby.", "”[5]\n\nOnly 92 of the 296 survivors Human Rights Watch interviewed said that they had undergone HIV testing since experiencing sexual violence. ", "Even then, testing was often inconclusive as it had not been administered repeatedly or after the time delay necessary to determine infection. ", "A 28-year-old survivor who was raped by a Seleka fighter in 2013 echoed many others when she said that she constantly questions her condition: “I ask myself, ‘Did he give me AIDS? ", "What [other] disease? ", "How is my health? ", "Will I die soon?’”[6]\n\nMany survivors said they had not sought help, including essential medical care, due to fear of stigma and rejection. ", "They described family or community members blaming them for being raped and publicly humiliating them by “pointing fingers” at them or calling them names. ", "Human Rights Watch interviewed 38 women and girls who said that their husbands, partners, or family members abandoned them after rape.", "\n\nImpunity and Lack of Access to Justice\n\nThough the Central African Penal Code punishes rape and sexual assault as criminal offenses, no member of an armed group has been tried for rape during the conflict. ", "Only 11 of the 296 sexual violence survivors interviewed by Human Rights Watch said they attempted to file a criminal complaint. ", "They reported powerful deterrents to seeking justice, including inappropriate response from authorities, death threats and physical attacks for daring to come forward, lack of legal assistance, and feeling intimidated and powerless when seeing their known attackers move freely around their villages and towns.", "\n\nThose who informed authorities faced mistreatment, including victim-blaming, failure to investigate, and even demands to present their own perpetrators for arrest. ", "Economic strain and fear of reprisals further deter survivors from seeking justice. ", "A lawyer who assists victims of sexual violence told Human Rights Watch: “The perpetrators are still around. ", "They are walking free and the victims are too scared to denounce them.", "”[7] In at least three cases, survivors or their family members who directly confronted members of the armed group responsible for sexual violence were killed, beaten, or threatened with death.", "\n\nOther obstacles to investigation and prosecution include difficulty identifying perpetrators and inconsistent provision of medical reports attesting to signs of rape.", "\n\nThe Special Criminal Court\n\nIn June 2015, then-president Catherine Samba-Panza signed a law creating a temporary Special Criminal Court (SCC) to investigate and prosecute grave human rights violations committed in the country since 2003 “as defined by the Central African penal code and under international law obligations of the Central African Republic, notably the crimes of genocide, crimes against humanity and war crimes.", "”[8] Crimes against humanity, as defined by the Central African penal code, include “rape, sexual slavery, forced prostitution, forced pregnancy, forced sterilization, or any other form of sexual violence of comparable gravity.", "”[9]\n\nGiven the weakness of the Central African national judicial system and the International Criminal Court’s limited focus on prosecuting high-level perpetrators of the gravest crimes, the SCC could contribute significantly to combatting impunity for serious violations committed during armed conflict.[10] By delivering justice at a national level, the SCC offers victims and others most affected by the crimes increased accessibility to and resonance with trials, and can bolster domestic ownership and capacity in the delivery of justice for atrocity crimes.", "\n\nWhile the SCC cannot address or resolve the full range of complex problems the Central African Republic faces, experience suggests that lack of accountability fuels continued abuses. ", "Fair, credible trials of grave crimes can build respect for the rule of law, help break long-standing cycles of impunity, and contribute to long-term stability.", "\n\nThe SCC has made important progress, especially in 2017, but continues to face intense challenges. ", "While making the court operational has taken longer than anticipated, the process has involved important steps to protect the court’s credibility, independence, and impartiality.", "\n\nSince 2015, Central African victims, activists, and justice practitioners have consistently reaffirmed the urgent and unequivocal demand for justice for war crimes and crimes against humanity that have been committed over the last 15 years. ", "Alongside support from the Central African authorities, international partners will need to provide strong political backing and financial support, for the court to succeed.", "\n\nA key challenge for the SCC and national courts is providing robust protection for witnesses and victims of sexual violence. ", "At present, no such protection mechanism exists in the Central African Republic. ", "No victims participated in the UN-assisted 2015 criminal session in Bangui, either as a witness or a civil party, in part out of security concerns.[11] In the 2016 criminal session, four witnesses participated as civil parties; only one was a witness in a conflict-related case, which involved accusations of associating with criminals.", "\n\nRecommendations\n\nIssue a public and unambiguous message to Seleka and anti-balaka leadership that it will show zero tolerance for sexual violence and make every effort to bring all perpetrators of sexual violence to account.", "\n\nWith support from the United Nations agencies, donor governments, and nongovernmental organizations, ensure availability and provision of free, comprehensive, essential emergency post-rape medical care in adherence with the national clinical management of rape protocol, including—with the survivor’s informed consent—emergency contraception, post-exposure prophylaxis for HIV prevention, prevention of and treatment for other sexually transmitted infections, pregnancy testing and access to or referral for safe abortion.", "\n\nWith support from the United Nations agencies, donor governments, and nongovernmental organizations, ensure access to psychosocial support for sexual violence survivors and referral systems to psychosocial support where on-site care is not available.", "\n\nTrain police, gendarmes, prosecutors, and judges in how to respond to, investigate, and prosecute cases of sexual and gender-based violence.", "\n\nConduct awareness-raising and behavior change activities to educate community members about how and why survivors can access services in a timely manner and to combat stigma and rejection of survivors.", "\n\nIn cooperation with UN agencies and the UN mission, urgently develop and implement a national strategy to combat and respond to sexual violence, including conflict-related sexual violence.", "\n\nDevelop and implement, in collaboration with the United Nations mission, a civilian protection strategy, including specific measures to protect women and girls and to mitigate the risk of sexual violence.", "\n\nIn conjunction with the UN mission, give the Special Criminal Court full political support to fulfill its mandate, while respecting its independence. ", "Support the prompt adoption of the rules of procedure and evidence of the Special Criminal Court by the Central African parliament.", "\n\nExpedite the provision of work facilities for the investigators, magistrates, and SCC support staff, and residences for the SCC national magistrates and their families, and expedite renovation of the former Court of First Instance to serve as the Special Criminal Court premises.", "\n\n[2] Some survivors had not had pregnancy tests at the time of their interviews with Human Rights Watch and had not yet determined definitively whether they had become pregnant while held as sexual slaves.", "\n\n[3] Human Rights Watch also heard credible reports of armed groups committing sexual violence against men and boys, but the research referred to here focuses on violence against women and girls." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005318185430951416, 0.0005763188819400966, 0.000825560768134892, 0.0008594953687861562, 0.010224706493318081, 0.02029835805296898, 0.009577130898833275, 0.03168810158967972, 0.005005824379622936, 0.009540991857647896, 0.007120336871594191, 0.4060264527797699, 0.010885377414524555, 0.3549511730670929, 0.25416821241378784, 0.5856181979179382, 0.063773974776268, 0.2581585943698883, 0.03956592082977295, 0.891646146774292, 0.0021436060778796673, 0.014981363900005817, 0.8611111640930176, 0.011259383521974087, 0.02709355019032955, 0.7684451937675476, 0.010071675293147564, 0.005165657494217157, 0.005041066557168961, 0.0049774423241615295, 0.0010656827362254262, 0.026658155024051666, 0.001886481768451631, 0.0007724050083197653, 0.00357833132147789, 0.0012331746984273195, 0.02270132675766945, 0.12656575441360474, 0.0014124949229881167, 0.009914582595229149, 0.00280605792067945, 0.001089245779439807, 0.0017396524781361222, 0.0008330675773322582, 0.4285913109779358, 0.04041055962443352, 0.0006085194763727486, 0.03802730143070221, 0.0009201996144838631, 0.0008709190879017115, 0.013507595285773277, 0.41648009419441223, 0.0231182724237442, 0.020780757069587708, 0.008748394437134266, 0.0008689147653058171, 0.0010089206043630838, 0.001789689064025879, 0.0055192261934280396, 0.010794425383210182, 0.044144947081804276, 0.000784208532422781, 0.0005849768640473485, 0.015802817419171333, 0.0006939783343113959, 0.0006562993512488902, 0.0005666939541697502, 0.0005613784305751324, 0.0005329191917553544, 0.0006114218849688768, 0.0005203575128689408, 0.004355889745056629, 0.000627734640147537, 0.0006424956955015659, 0.018800877034664154, 0.0007131558377295732, 0.0016668005846440792, 0.0031198395881801844, 0.000890042691025883, 0.006223158910870552, 0.017345966771245003, 0.0005653734551742673, 0.0005831109010614455, 0.0005859661614522338, 0.026688599959015846, 0.010598097927868366 ]

[ "1. ", "Field of the Invention\nThe present invention relates to system interfaces for backplane technology. ", "More particularly, the present invention relates to bridges and switching systems for establishing transmission interfaces among circuit boards or cards installed in computing device backplanes. ", "The system enables the insertion of a greater number of cards in a backplane topology than has heretofore been possible.", "\n2. ", "Description of the Prior Art\nStandards have been established for the architecture of the hardware employed to enable the exchange of electrical signals among processing devices. ", "The processing devices include integrated circuit systems built on and using printed circuit boards by an increasingly wide array of suppliers. ", "The architecture standards ensure that the various devices will, in fact, be able to communicate with one another as well as with central processing units that control the operation of such peripheral devices. ", "These peripherals include, but are not limited to, printer interfaces, video, audio, and graphics interfaces, memory, external communications interfaces, or any other sort of discrete device performing particular computer-related functions.", "\nThe circuit boards associated with the peripherals may be activated upon connection with a primary hardware board, often referred to as a motherboard. ", "The motherboard establishes the interconnection of the central processing unit, power, memory structures, and a backplane bus. ", "The backplane bus is a primary communication interface coupling line having connections to one or more slots or sockets in parallel into which the peripheral circuit boards may be inserted. ", "The slots include physical connectors and input/output interfaces to establish reception and transmission of signals among all devices coupled to the motherboard through the backplane bus. ", "It is the architecture of the backplane bus that establishes the interface architectures required for the peripheral boards so that communication can occur between all peripherals and the central processing unit in an organized manner.", "\nSeveral communication hardware protocols have been developed, a number of which have been or are being phased out as being inadequate to support the faster signal exchange rates and increased bandwidth required by newer applications. ", "One of the first such architecture protocols that remains in use on older motherboards is the Industry Standard Architecture (ISA). ", "ISA is an expansion bus slot configuration that accepts plug-ins for peripherals including sound and video displays, for example. ", "Earlier ISA slots were of 8-bit configuration but they are mainly 16-bit slots now. ", "A modified version of ISA, Extended ISA (EISA) was developed to extend the bus capacity to 32-bit with essentially the same convention applied to the ISA backplane slot architecture. ", "Unfortunately, it is designed to run at the relatively slow ISA rate of 8 MHz clocking. ", "In today\"\"s computing world, that is often too slow.", "\nAlthough ISA had been the primary standard, the Peripheral Component Interconnect (PCI) bus is now the most frequently implemented interface architecture. ", "Although it continues to replace ISA, that architecture will be used by peripherals designers for as long as computing devices including ISA slots remain in use. ", "PCI provides a relatively high-speed data path (33 MHz) among connected boards. ", "PCI Local Bus is an open architecture specification that allows applications designers greater freedom in interface formation. ", "PCI provides xe2x80x9cplug and playxe2x80x9d capability in that any peripherals with PCI-based interfaces are automatically configured at start up and therefore generate little to no delay for the central processing unit to establish communication. ", "One advantage of PCI is that it permits the sharing of IRQs. ", "An IRQ (Interrupt ReQuest) signals the central processing unit that activity associated with a peripheral device has started or ended. ", "Since motherboards are configured with only a limited number of IRQ lines, any interface architecture that requires dedicated IRQ lines is necessarily limited. ", "Such is the case with ISA, but not with PCI. ", "For that reason, PCI architecture is ordinarily the first choice.", "\nWhile the PCI design is an improvement on ISA, it has a history of problems with edge connectors, poor thermal characteristics, and limited interface (input/outputxe2x80x94I/O) capability. ", "In fact, PCI backplane configuration is limited to only four slots. ", "That is due in part to the need to resolve signal reflections or noise at the board-to-backplane interface. ", "Subsequent developments to double the clock rate to 66 MHZ and to increase the bus width accommodated some of the reflection problems, resulting in a doubling to eight of the number of available PCI slots. ", "That improvement established a new slot architecture referred to as eXtended PCI (PCI-X) architecture. ", "Unfortunately, while providing more slot availability, PCI-X continues to suffer from the same problems associated with PCI.", "\nBecause of interconnection limitations associated with the PCI architectures, there are limits on the number of peripheral devices that may be coupled together. ", "Bridging together two PCI-based backplanes may increase slot capacity; however, that simply increases the size/number of the computer device required to establish desired functionality. ", "It also introduces its own latency and transmission complications. ", "As a result, the Personal Computer Industrial Computer Manufacturing Group (PICMG) developed a standard to address these problems with the PCI functionality. ", "The PICMG combined the architecture of the Eurocard interface with a passive backplane (that is, no active devices to regulate signal propagation, only passive elements), and a high-quality, high-density pin-and-socket arrangement to make improvements. ", "All motherboard components are hence moved from the now passive backplane to a Single Board Computer (SBC) card to be present in the system slot of the passive backplane. ", "The relatively new connection architecture, identified as COMPACTPCI, a registered trademark of PCI Industrial computers manufacturers Group (hereinafter referred to a cPCI), improved the peripheral board-to-backplane impedance match, thereby reducing unwanted reflections at that interface. ", "cPCI is designed to be a more robust interface connector to establish solid electrical connections.", "\nThe improvements established in cPCI generated the ability to provide eight PCI slots at a 33 MHz-lock rate. ", "However, at higher clock rates the number of available slots is reduced because of the reflective wave signaling technology being used. ", "Using reflected wave technology means the signal travels at half its intended amplitude until it reaches the end of the backplane where it doubles to its intended amplitude and propagates back down the backplane to its point of origin. ", "This round trip delay physically limits the backplane to the number of slot connections it can have for a given clock frequency. ", "The cPCI architecture at 66 MHz available in typical computing systems has thus been limited to five open slots.", "\nWhat is needed is a backplane architecture and interface system that allows for a greater number of slots available for peripheral connections without increasing the footprint of the backplane. ", "Further, what is needed is a backplane architecture and related system that expands the number of slots available without requiring bridging from one backplane to another. ", "Yet further, what is needed is such a backplane architecture and related system that does not compromise the integrity and rate of signal reception and transmission. ", "Still further, what is needed is such a backplane architecture and related system that may optionally be compatible with legacy interface architectures including, but not limited to, ISA.", "\nIt is an object of the present invention to provide a backplane architecture and interface system that provides for an increase in the number of slots available for peripheral connections without increasing the footprint of the backplane. ", "It is also an object of the present invention to provide a backplane architecture and related system that expands the number of slots available without requiring bridging from one backplane to another. ", "It is another object of the present invention to provide a backplane architecture and related system that does not compromise the integrity and rate of signal reception and transmission. ", "Still further, it is an object of the present invention to provide a backplane architecture and related system that may optionally be compatible with legacy interface architectures including, but not limited to, ISA.", "\nThese and other objects are achieved in the present invention by establishing a backplane bus driver arrangement that produces incident wave switching rather than reflective wave switching. ", "That is, the driver establishes a voltage swing or step that is of sufficient amplitude to ensure that all receivers coupled to the bus recognize that swing as a valid change of logic state on the first signal edge. ", "Presently, much of the signal propagation associated with PCI architecture is generated at the board level through CMOS, TTL, and LVTTL drivers and receivers, and their equivalents. ", "Those drivers/receivers generate voltage swings that exceed 1.5 volts in order to produce changes in logic state. ", "When those swing requirements are combined with existing bus impedances related to the connector traces, and the variations in impedances associated with different load impedances, impedance mismatches result. ", "That is particularly the case as increasingly faster switching rates are desired. ", "Those faster switching rates further exacerbate the impedance mismatches, thereby increasing signal noise. ", "The resultant noise must be accounted for so that there is no confusion on the bus. ", "This is achieved by reducing the wave path defined by the bus traces so that the noise settles in time to provide a voltage on the bus that is sufficient to provide a clear logic signal to all receivers on the bus. ", "The path reduction limits the number of connector slots on the motherboard.", "\nThe reflective wave propagation is a limit on the bandwidth of the existing motherboard architecture. ", "Unfortunately, it is a common limitation since existing drivers/receivers requiring such reflections are in common commercial use. ", "The present invention involves the application of driver circuitry that generates incident waves rather than reflective waves. ", "One example of such circuitry is the Gunning Transceiver Logic Plus (GTLP) transceiver.", "\nThe function of the incident wave switching driver is to ensure a valid change of state on all receivers connected to a backplane bus on the first pass of a propagated transition. ", "For that, the potential of the signal must be strong enough to generate a logic HIGH (VIH) on a rising edge and a logic LOW (VIL) on a falling edge as each of the connected receivers dictates. ", "If the signal must reflect from the end of the backplane traces to reach a valid potential for signal transition, the driver does not produce incident wave switching. ", "Without incident wave switching, the connector slots must be sufficiently close to the end of the bus to ensure that the reflections generate enough switching potential within a required propagation rate. ", "Therefore, incident wave switching enables longer bus connections without sacrificing signal propagation rate.", "\nThe driving circuitry used to generate incident wave switching must be selected with the dynamic characteristics of the backplane in mind. ", "Specifically, variations in capacitance, inductance, and resistance of the bus and the receiver connections affect whether that form of switching is achieved. ", "That is, the driving circuitry must either overcome or balance that variability so that impedance mismatching does not occur, or that it does not generate signal reflection. ", "That resolution of dynamic variability is achieved in the present invention through the selection of appropriate signal driving circuitry and the coupling of appropriate impedance devices between the driving circuitry, its power supply, the bus, and, if required, the individual receivers associated with the individual cards.", "\nAs indicated, the driver used in the present invention must be capable of generating incident wave switching. ", "One type of circuit for doing so is described in pending U.S. patent application Ser. ", "No. ", "09/132,595 of Oscar Freitas, filed Aug. 11, 1998, and assigned to a common assignee. ", "The content of that application is incorporated herein by reference. ", "One example of such a driver is the GTLP transceiver, such as model GTLP18T612 offered by Fairchild Semiconductor of South Portland, Me. ", "This driver (transceiver) slows the signal transition enough to minimize noise significantly and therefore avoids reflections.", "\nIn addition to the introduction of an incident wave-switching driver, the present invention includes a fairly specific backplane layout to assist in minimizing impedance mismatches. ", "Specifically, the stub impedance (impedance of the connectors for connecting a daughter card to the backplane bus), and backplane impedance. ", "In general, the present invention shortens the connector stubs (thereby reducing their impedances), while maintaining the backplane impedance at or near its current typical value. ", "The present invention relates to selecting appropriate values for those characteristics of the layout and coupling that with suitable incident wave driver technology to increase the number of slots available on a cPCI backplane or PCI/PCI-X motherboard layout without compromising signal integrity or throughput. ", "It further includes resolution of appropriate signal clocking to minimize clock skew.", "\nAs earlier noted, most of the existing peripheral devices employ driver circuitry that generates reflective wave switching. ", "The fabrication of such devices on cards containing such drivers is well defined and well established. ", "For that reason, it would be difficult to conveniently convert those processes to substitute incident wave drivers that would be compatible with the backplane layout improvements described. ", "The present invention includes an interface bridge or interposer that addresses that difficulty. ", "Specifically, the present invention includes an interface circuit that translates the driver/receiver switching architecture associated with each daughter card into driver/receiver switching architecture that produces incident wave switching. ", "For example, the interface circuit may be a TTL-to-GTLP converter that produces the signal swing required to present a valid VIH on a rising edge and a valid VIL on a falling edge during a first propagation on the backplane bus.", "\nThe present invention includes a new backplane layout. ", "That combined with incident wave switching and an interface circuit to enable incident wave switching produce a decided advantage in the number of cPCI slots that may be supplied on a backplane without increasing the board footprint and without bridging between or among backplanes. ", "These and other advantages of the present invention will become apparent upon review of the following detailed description, the accompanying drawings, and the appended claims." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0009392039501108229, 0.0005547000910155475, 0.0005675052525475621, 0.0006674340693280101, 0.0011860732920467854, 0.0005669432575814426, 0.0006074135890230536, 0.0005611906526610255, 0.0006516608991660178, 0.0007151884492486715, 0.000620436214376241, 0.0006563109345734119, 0.00064402527641505, 0.0005991134676150978, 0.0005771217402070761, 0.0006914525292813778, 0.0007755809347145259, 0.0006679593934677541, 0.0006390954949893057, 0.0008640411542728543, 0.000774650601670146, 0.0006552833947353065, 0.0006412030779756606, 0.0005814969772472978, 0.0006097427103668451, 0.0008156555122695863, 0.0007050013518892229, 0.0007356948335655034, 0.0007105603581294417, 0.0006991189438849688, 0.0005916511290706694, 0.0007780259475111961, 0.000628622539807111, 0.0005856471252627671, 0.00064410938648507, 0.0006766255828551948, 0.0008459950913675129, 0.0006044204346835613, 0.0005829167203046381, 0.0006315301870927215, 0.0006888771895319223, 0.0006167560932226479, 0.0008751315763220191, 0.0006045186310075223, 0.0005246265791356564, 0.0005991268553771079, 0.0006178612820804119, 0.0006087276851758361, 0.0006856200052425265, 0.000622315623331815, 0.0005666990182362497, 0.0005658023292198777, 0.0006232615560293198, 0.0005796832265332341, 0.0005893907509744167, 0.0006131764384917915, 0.0006154498551040888, 0.0005805502878502011, 0.0006655954057350755, 0.0006524570053443313, 0.0005857099313288927, 0.000750504492316395, 0.000699354859534651, 0.0006272128666751087, 0.0010094624012708664, 0.0007011300185695291, 0.0007182642002590001, 0.0007116635679267347, 0.0008417804492637515, 0.000585953879635781, 0.0006810434861108661, 0.0008006083662621677, 0.0007132921600714326, 0.0006064388435333967, 0.0006480201845988631, 0.0006359796389006078, 0.0007587285945191979, 0.000600482861045748, 0.0006228770362213254, 0.0007507234113290906, 0.0005781404906883836, 0.0006174669251777232, 0.0005974122323095798, 0.0013787426287308335, 0.0006431217771023512, 0.0005596906412392855, 0.0006413412047550082, 0.0007557630888186395, 0.0006494973204098642, 0.0006579442415386438, 0.0007331419619731605, 0.0005855374038219452, 0.0007245778106153011, 0.0006285107810981572, 0.0005839365185238421, 0.0005850116722285748, 0.000573251280002296, 0.0006387499161064625, 0.0007034771842882037, 0.0005852015456184745, 0.000692785601131618, 0.0005291394772939384 ]

[ "This invention relates to the pulping of waste paper products for recovery of reusable paper making fibers therefrom, and especially to improvement of such pulping operations from the standpoints of both efficiency and high quality of yield.", "\nA problem of increasing magnitude in the pulping of waste paper products has been the steady increase in the amount and nature of the contaminants mixed therewith in commercially obtainable waste paper, the contaminants now commonly averaging of the order of 15% by weight. ", "Of particular importance is the amount of lightweight contaminant junk, primarily in the form of plastic products of many kinds and especially plastic sheet and film and also pieces of plastic foam.", "\nIn the past, many of the common contaminants of waste paper could be eliminated from the pulper tub by the use of a junk remover, a typical example being shown in Baxter U.S. Pat. ", "No. ", "3,549,092. ", "Such a junk remover relies on gravity discharge through a downward chute from the pulper tub of iron and other junk material of substantially higher specific gravity than paper fibers. ", "But such junk removers have proved to be ineffective for removing lightweight junk, for two principal reasons.", "\nOne reason is the obvious one that material lighter than water will not readily flow down the chute which connects a pulper tub with its junk remover. ", "The other is that the normal operation of a pulper rotor tends to force sufficient liquid from the tub to the junk remover when the pulping operation commences to maintain a higher static head in the junk remover than in the tub, commonly of the order of 12 inches. ", "Further, the common practice is to add fresh liquid to the tub by way of the junk remover, in order to wash fiber back into the tub from the high specific gravity pieces traveling through the chute from the tub, and this increases the opposition to the flow of light materials from the tub.", "\nThe result of these conditions is that when a waste paper pulper -- whether or not it is equipped with a junk remover -- is operated on a continuous basis, with continuous extraction, through a perforate extraction plate, of a slurry of sufficiently small particle size and continuous replacement of water and furnish, plastic tends to accumulate in the tub until the amount of extracted fiber drops below an acceptable rate, a condition which the industry calls \"constipated\". ", "It is then necessary to discontinue pulping and empty the accumulated junk manually from the tub.", "\nThe development of this condition has three significant disadvantages. ", "Running of the pulper until the paper fiber can no longer be extracted produces increased and unnecessary wear on the pulper rotor and its extraction plate. ", "In addition it results in extraction of a substantial amount of small plastic particles with the paper fiber, as the quantity of plastic in the tub increases to the point where it comes into contact with thr rotor, and such small pieces of plastic are difficult to separate from the paper fiber, especially if the holes in the extraction plate are small. ", "At the same time, manual emptying of accumulated plastic is expensive and time consuming, and it also results in the loss of a substantial amount of a fiber which remains commingled with the plastic and is therefore eliminated along with the plastic." ]

{ "pile_set_name": "USPTO Backgrounds" }

[ 0.0007134511834010482, 0.0009257142664864659, 0.0006330101750791073, 0.001102736103348434, 0.0013787426287308335, 0.0009546657092869282, 0.0022722550202161074, 0.0071299937553703785, 0.002714436501264572, 0.0008998702978715301, 0.0006760035757906735, 0.0011810619616881013, 0.012267068959772587, 0.0006823200965300202, 0.0007124266703613102, 0.0005871838657185435, 0.0007663954165764153 ]

[ "This coronavirus disease 2019 (COVID-19) pandemic has grappled the world. ", "The severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) causing the disease has proved quite contagious and deadly. ", "Confusion and anxiety have consumed healthcare providers as we plan for surges or actively manage the high demand. ", "Nearly 3 million people have been infected and mortality has approached 200 000.[@bib1] Anaesthesiologists have taken a central role in perioperative operations and critical care.[@bib2] Our experience is needed at the table as we make difficult decisions moving forward. ", "Central to our role is our expertise as airway providers. ", "Herein lies the fear. ", "A critically ill patient potentially succumbing to the disease in our hands is now shedding their maximal viral load. ", "Both the patient and provider are at a risk that has not been seen to this severity and scale in our field. ", "The city of Wuhan in the Hubei province of China was the first to experience this pandemic and is now sharing their experiences in the literature. ", "In this issue of the *British Journal of Anaesthesia*, Yao and colleagues[@bib3] describe their process for intubation, personal protective equipment (PPE) interventions, intubation performance, and complications. ", "We now have several important insights that we can learn from.", "\n\nIt is apparent that a dedicated airway response team was formulated. ", "Amongst the two hospitals reporting data, a team of 52 anaesthesiologists handled all intubations. ", "These highly skilled providers were best equipped to perform intubation and allowed for focused training of important practice pathways including anaesthetic management, a PPE plan, and intubation approach. ", "Other centres would be prudent to model this approach because it appeared to work well while other observations make important calls for practice change. ", "Several of those findings are reflected upon below.", "\n\nTheir PPE strategy was robust. ", "An inner and outer gown with double gloving provided contact precautions and an additional barrier during doffing procedures. ", "All providers wore an N-95 or equivalent respirator and a standard surgical mask, in addition to a powered air-purifying respirator or a hood. ", "While the hood does not provide airborne protection itself, it serves as an additional contact barrier. ", "However, their experience with the hood is noteworthy because 80% of those intubators reported fogging of the shield, which significantly impairs visualisation during laryngoscopy. ", "The teams further protected themselves by utilising the services of a spotter who observed their donning and doffing practices to ensure quality control. ", "Several reports in press in this journal describe PPE practice from other institutions that may serve to formulate local PPE plans.[@bib4], [@bib5], [@bib6]\n\nThe team took another important step to protect their anaesthesiologists that may not be utilised in much of the world. ", "They were quarantined in a private hotel for 14 days with monitoring of symptoms and required testing for COVID-19 even if asymptomatic. ", "This step provided some likely needed rest for the team and further reduced the risk that this team would contract disease from the community or the hospital itself. ", "Ultimately, none of these 52 anaesthesiologists contracted disease. ", "So, it appears that their process worked to protect their providers. ", "It remains unknown what the risk of providers contracting COVID-19 is. ", "Reports from Northern Italy indicate that at least 4824 healthcare workers have contracted disease, which is quite alarming.[@bib7] It is also not known if this infection is caused from engagement in such high-risk activity or from community interaction. ", "This important question stands to be addressed by an ongoing study of providers conducting airway management for COVID-19 (or suspect) patients. ", "The IntubateCOVID research group is an international registry aimed at determining the disease contraction rate of intubating providers and is open across many nations for provider registration.[@bib8] In a short time span, more than 4000 intubations have already been registered in this database (Neuman M, personal communication, 2020). ", "We will soon have a better understanding if the isolation and robust PPE steps taken by these Wuhan hospitals are practiced by others and what the associated infection rate is amongst various practices and PPE interventions across the world.", "\n\nThe 202 intubations were performed with a remarkably high success rate. ", "The first attempt success rate was 89% and 100% of patients were successfully intubated without the need for rescue surgical airway management. ", "Many patients had clear anatomic indicators of difficult laryngoscopy. ", "Most were intubated with the use of videolaryngoscopy which may add some distance from the provider to the patient and offer protection. ", "The use of videolaryngoscopy may have also served to optimise success. ", "Clinical trials to date have demonstrated mixed results regarding the benefit of videolaryngoscopy over direct laryngoscopy for tracheal intubation in critical care settings.[@bib9] However, the success rate achieved in this study exceeds that observed in other studies when utilising either direct or videolaryngoscopy. ", "It appears that the COVID-19 patient may not be any more difficult to intubate than other critically ill patients with respiratory failure, which is an important finding because of the fear that an associated cytokine storm[@bib10] might cause airway oedema. ", "Ultimately, I believe that the most important intervention was the application of a highly skilled intubation team who used tools that they were most comfortable with and recognised that physiologic features of difficult airway management are perhaps as important as the anatomic features.[@bib11]\n\nThe complications observed during airway management offer some needed reflection. ", "While the 24 h mortality rate of 10% appears high, the longer-term mortality rate of critically ill COVID-19 patients is known to be 49%[@bib12] and even higher (86%) after tracheal intubation.[@bib13]\n\nMore than 80% of the patients in this series had been bridged with noninvasive ventilation indicating advanced progression of their disease. ", "It is apparent that many of these patients may have simply been intubated late in their disease progression, as reflected by pre-intubation hypoxaemia. ", "Subsequently, 73% of patients suffered hypoxaemia during airway management. ", "Debate exists regarding the use of high-flow nasal oxygen therapies or noninvasive ventilation for concerns of aerosolisation of the virus, so it is commonly not recommended.[@bib14] Therefore, these authors and many others have come to a reasonable conclusion that it is best to intubate earlier in the disease progression. ", "The authors also observed a high rate of pneumothorax (5.9%) after intubation. ", "Pneumothorax is known to occur at higher rates in patients with acute respiratory distress syndromes (ARDS).[@bib15] The study group anecdotally observed that it occurred less frequently in patients who were positioned prone early after intubation. ", "Prone positioning is not new to ARDS management, but these data suggest that it may be particularly useful in this COVID-19 disease state, and this practice has been endorsed for COVID-19 patients with moderate to severe ARDS.[@bib16]\n\nIn conclusion, we now know that COVID-19 patients can be intubated with a high success rate by utilising a highly skilled team, and that provider protection can be optimised with a robust PPE implementation process and provider isolation. ", "We stand to learn a lot more about the intubation practice of COVID-19 patients as the rest of the world shares their experience. ", "We will be better prepared for the next pandemic because of this information dissemination than we had from previous diseases. ", "While we mourn the losses across the world, we take some comfort that we share this experience together and help each other provide the best clinical care. ", "Thank you for sharing your experiences, Wuhan.", "\n\nDeclaration of interest {#sec1}\n=======================\n\nThe author is member of the associate editorial board of the *British Journal of Anaesthesia*.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.0010989222209900618, 0.0007683720323257148, 0.0005721625639125705, 0.000706302875187248, 0.0005490522598847747, 0.0044246334582567215, 0.032850999385118484, 0.0006473831599578261, 0.0005437901127152145, 0.0005476471269503236, 0.0005276667070575058, 0.0005870257737115026, 0.0006099182064644992, 0.0005329682026058435, 0.0005599291762337089, 0.000533620361238718, 0.0006012843805365264, 0.0011324286460876465, 0.0010195329086855054, 0.0007588298758491874, 0.0009225787362083793, 0.0008983167354017496, 0.0005648771184496582, 0.0007227116730064154, 0.0007820354076102376, 0.0009688662830740213, 0.000552691170014441, 0.0006399884587153792, 0.0005734589067287743, 0.0005280544282868505, 0.0005482534179463983, 0.0005403750692494214, 0.0005965214804746211, 0.0006270966259762645, 0.007651397027075291, 0.0006218585185706615, 0.0006694241892546415, 0.0011545132147148252, 0.002626699861139059, 0.0005297813913784921, 0.0006999916513450444, 0.000835030572488904, 0.0010726271430030465, 0.0006119229947216809, 0.0007823756895959377, 0.0006712954491376877, 0.0005898133968003094, 0.0005516814417205751, 0.0007163590053096414, 0.0005314651061780751, 0.0005740878405049443, 0.0006720536621287465, 0.001994825666770339 ]

[ "Fakes, Frauds and Facelifts\n\nHow to identify counterfeit and altered Magic cards\n\nI've been maintaining this guide since 1997. ", "All text and images are my own creation and I'm grateful that it is still used 20+ years later! ", "A lot of other sites have used this site as reference for their own guides, including using my images. ", "Some credit me, some don't, but this is the original. ", "What's important is that the information in this guide is readily available to the MTG community so everyone can remain informed about the risk of counterfeits and how to spot them. ", "Thank you all!", "\n\n1.0 There are fake Magic cards???", "\n\n1.1 Why in god's name would anyone make fake cards?", "\n\n1.2 What is an altered card?", "\n\n2.0 Am I in danger of being scammed?", "\n\n2.1 When/Where should I be the most cautious?", "\n\n2.2 I was ripped! ", "What do I do???", "\n\nIn fact there are quite a lot of them. ", "I have no official statistics or anything, but this web page is a result of me seeing one too many.", "Many people make them just to play with when they don't own the real things (or enough of them). ", "These are called proxies and usually aren't even close to the real thing. ", "They are usually cheap inkjet printouts or color copies pasted on to another card.", "However, Magic is a very profitable and lucrative market, and some people create very convincing counterfeit and altered cards as a way to scam money or other cards out of people. ", "This FAQ will focus on how to spot these cards.", "Altered cards are real cards. ", "They have just been modified to either hide their true condition or make a card appear to be an earlier print than it really is. ", "Later in the FAQ are some examples of altered cards. ", "I do not consider cleaning the gunk off a card or flattening a bent card as altering it. ", "What I'm talking about here is modifying a card by adding something that wasn't there before.", "Sure. ", "We all are. ", "Although there are a lot of things that increase the risk such as where you live, where you play, where you buy/trade cards and what cards you usually deal in.", "Most counterfeits are found in the cities and/or on college campuses. ", "If you are near any sort of printing school or business be especially cautious. ", "If Magic is very popular in your town, it is more likely counterfeit cards will show up. ", "Most frequently these cards will turn up at tournaments or conventions, and sometimes at other large trade gatherings that are open to the public. ", "It is less likely to find one on the shelf at the local store or from a large mail order company since they should know of the danger and inspect all their cards closely.", "There's lots of things you can do, but this goes a little beyond the scope of this FAQ." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.008433998562395573, 0.0006843095761723816, 0.0005802089581266046, 0.0007260058191604912, 0.0005612743552774191, 0.0006362305721268058, 0.0037970286794006824, 0.0024260622449219227, 0.0007020604098215699, 0.005094415973871946, 0.000830864068120718, 0.0722287967801094, 0.004582210443913937, 0.0006414087256416678, 0.0007479598862119019, 0.0009163185022771358, 0.0008043621783144772, 0.0008401180966757238, 0.0009734251070767641, 0.0009535144199617207, 0.0010752512607723475, 0.0006964642088860273, 0.0007414136198349297, 0.014917424879968166, 0.0006143159116618335, 0.0008486696169711649, 0.00093197071691975, 0.0010561735834926367, 0.0007480739732272923, 0.0006900319713167846, 0.0007186999428085983, 0.0005532667273655534, 0.0005886962753720582, 0.005538675468415022 ]

[ "Bedford Museum & Genealogical Library\n\nThe Bedford Museum & Genealogical Library is the county museum and genealogical library for Bedford County, Virginia It was started in 1932 by the General William R. Terry chapter of the United Daughters of the Confederacy and the Peaks of Otter chapter of the National Society Daughters of the American Revolution. ", " It was in multiple locations in the town of Bedford, VA including the Courthouse and the library. ", " It finally found its permanent home in 1979 when it moved into the former Masonic Hall for Liberty Lodge #95. ", " It is part of the Bedford Historic District and is known as Bedford Masonic Hall on that Wiki page. ", " It is located at 201 E. Main St. Bedford, VA.", "\n\nAnnual Events\nThe Bedford Museum & Genealogical Library holds several events throughout the year including: An Annual train layout, Fridays at the Museum summer kids program, and Women's History Month essay contest for children.", "\n\nTrain Layout\nThe Bedford Museum is home to an annual O Gauge train layout on its third floor. ", "Children are entertained as the train goes past villages and across a trestle and through a tunnel. ", " They can also run a trolley that goes back and forth in the village. ", " During the two weeks of Christmas Break, the Polar Express runs on the track as well. ", " There are other interactive train possibilities as well, depending on the year.", "\n\nFridays at the Museum\nEvery summer the Bedford Museum & Genealogical Library hosts a weekly summer activity that is geared to children coming out of 2nd to 6th grades. ", " The program is every Friday afternoon during the summer and children learn about local history and its interaction with national and sometimes international connections. ", " Some of the activities have included a visit from the Monancan Tribe and the Bedford County Sheriff. ", " There have also been trips to Avenel and the Avoca Museum. ", " The Museum's program has seen great results with some of the children that participated in the program to get Passed Advanced in history on their VA SOL.", "\n\nWomen's History Month Essay Contest\nEvery February the Bedford Museum & Genealogical Library hosts an annual Women's History Month Essay Contest open to students in the second to eighth grades. ", " Students must write about a woman who lived during that years theme (American Revolution, Civil War, etc.) ", "and why they admired them. ", " Grand Prize winners are awarded $50 and 1st place and runners up get an award as well.", "\n\nMonthly\nThe Museum holds a Genealogy and History Forum on the 2nd Saturday of every month from February to November. ", "Some of the speakers share personal genealogy stories, others talk about their experiences like Carl Overstreet, who was the first U2 pilot to fly over Soviet Air Space.", "\n\nIt also offers a free beginning genealogy class every month from February to November that offers tips and advice for students just getting started in Genealogy.", "\n\nWeekly\nThe Museum holds free weekly Bluegrass Jams on the third floor most Friday nights from 7 to 9 pm.", "\n\nDisplays\nThe Museum features three floors of exhibits that feature African Americans, Native Americans, World War I, World War II, Korean War, Vietnam War, Operation Enduring Freedom, Co. A 1/116 29th Division (AKA Bedford Boys), Civil War, American Revolution, as well as household furniture. ", "The changing exhibit room that has highlighted local Manufacturing like Piedmont/Smyth Label and Lacey Putney, the longest serving Delegate in all of Virginia's History.", "\n\nGenealogy Library\nThe first floor is the home location for the Genealogy Library. ", " It features over 1,600 books and over 1,000 files on family names and local history.", "\n\nReferences\n\nExternal links\n\nCategory:Museums in Bedford County, Virginia\nCategory:Genealogical libraries\nCategory:1932 establishments in Virginia\nCategory:Museums established in 1932" ]

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

[ 0.0006586497183889151, 0.0005734742153435946, 0.0006446721963584423, 0.0009064141777344048, 0.0009809386683627963, 0.0006921866443008184, 0.0006584827788174152, 0.0030903308652341366, 0.000603717751801014, 0.0006653468008153141, 0.0005357381305657327, 0.000884185777977109, 0.0006996484589762986, 0.0005542736034840345, 0.000579520536120981, 0.0005960498237982392, 0.0009952076943591237, 0.0005993099184706807, 0.0006957518053241074, 0.0007691170321777463, 0.0005739204352721572, 0.0005841736565344036, 0.0005556062096729875, 0.0007343650213442743, 0.0006097179721109569, 0.0005884993588551879, 0.000677345902658999, 0.0006399244302883744, 0.0005690735997632146 ]

[ "Calculating average surface enhancement factors of randomly nanostructured electrodes by a combination of SERS and impedance spectroscopy.", "\nPolyhedron Ag nanostructures were created on top of a polished Au electrode via step-wise electrodeposition and tested as substrates for SERS spectroscopy. ", "Average Raman enhancement factors were derived by combining SERS measurements with electrochemical impedance spectroscopy (EIS), which is able to determine the electroactive surface area of a randomly nanostructured surface. ", "Depending on the deposition step an alternating increase and decrease of surface area was observed while the SERS intensity showed a clear maximum for the first deposition cycle. ", "SEM pictures reveal the formation of Ag polyhedrons that are randomly dispersed on the Au surface. ", "Furthermore the presence of a sub nanostructure on top of the polyhedron after the first deposition cycle is observed which becomes smoother after subsequent deposition cycles. ", "Correlating the SEM pictures with SERS and EIS measurements it is concluded that the coral-like sub nanostructure is dominating the enhancement factor while the polyhedron structure itself only plays a minor role for electromagnetic field enhancement." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0005868327571079135, 0.0006011342047713697, 0.0005938935209996998, 0.000537727726623416, 0.0005853050388395786, 0.0006006935145705938, 0.0005566735635511577 ]

[ "- Welcome -At Carl J. Mowell & Son, our mission is to recognize and honor, with compassion and respect, the value of a life lived.", "Our purpose is to provide a time and place for gathering, reflecting, celebrating, and healing." ]

{ "pile_set_name": "Pile-CC" }

[ 0.0005512638599611819, 0.0005762368091382086 ]

[ "Salah to Liverpool imminent\n\nBy Football Italia staff\n\nItalian sources confirm Liverpool are prepared to offer €45m to Roma, so Mohamed Salah’s medical will be Tuesday or Wednesday.", "\n\nMultiple reports in the Peninsula, including Il Tempo newspaper and Sky Sport Italia, agree with KingFut claims in Egypt that Tuesday will be decisive.", "\n\nRoma made it clear they would sell Salah for no less than €40m guaranteed cash and it’s reported the deal is worth €40m plus €5m in various performance-related bonuses.", "\n\nThis would explain the variation in the figures over various reports.", "\n\nThe Giallorossi have already identified his replacement, as Rachid Ghezzal is available as a free agent when his contract with Olympique Lyonnais expires.", "\n\nWatch Serie A live in the UK on Premier Sports for just £9.99 per month including live LaLiga, Eredivisie, Scottish Cup Football and more. ", "Visit: https://www.premiersports.com/subscribenow" ]

{ "pile_set_name": "OpenWebText2" }

[ 0.000629708229098469, 0.0006317583611235023, 0.000865722366143018, 0.0005652466206811368, 0.0009295723284594715, 0.0006205899990163743, 0.0006382268620654941 ]

[ "Introduction\n============\n\nCardiovascular disease (CVD) is one of the major causes of mortality worldwide. ", "An increase in blood total cholesterol (TC) levels, which is regulated by cholesterol absorption, synthesis, storage and excretion, is one of the major risk factors leading to the development of CVD ([@b1-etm-08-01-0260]). ", "At present, the levels of TC in the serum under hyperlipidemic conditions may be lowered by diet or medication.", "\n\nCurcumin, a hydrophobic polyphenol derived from the rhizome of the herb *Curcuma longa,* has been widely used as a spice and a coloring agent, and is a major ingredient of curry powder ([@b2-etm-08-01-0260]). ", "However, several studies have demonstrated that curcumin also possesses anti-oxidant, anti-tumor and anti-inflammatory properties ([@b3-etm-08-01-0260]--[@b11-etm-08-01-0260]). ", "In addition, previous studies on animals and humans have demonstrated that curcumin is capable of decreasing the levels of TC in the blood ([@b12-etm-08-01-0260]--[@b16-etm-08-01-0260]). ", "However, curcumin has not yet been approved as a therapeutic agent for hyperlipidemia (HLP), mainly due to problems with its bioavailability ([@b17-etm-08-01-0260]).", "\n\nPiperine is responsible for the pungency of spices gained from *Piper nigrum* and *Piper longum* (sources of black or long pepper) ([@b18-etm-08-01-0260]). ", "Piperine is capable of affecting the metabolism of other substances, and if consumed with curcumin, it significantly increases the bioavailability of curcumin by inhibiting hepatic and intestinal glucuronidation ([@b17-etm-08-01-0260],[@b19-etm-08-01-0260],[@b20-etm-08-01-0260]). ", "For example, piperine as an adjuvant increases the efficacy of curcumin by mitigating benzo(a)pyrene toxicity and enhancing the protective effect of curcumin against chronic unpredictable stress-induced cognitive impairment and depressive disorders ([@b21-etm-08-01-0260]--[@b23-etm-08-01-0260]).", "\n\nA previous study investigated the effect of curcumin, piperine and quercetin in high-fat diet (HFD) and low-dose streptozotocin-induced diabetic rats; however, the study focused on glucose intolerance and oxidative stress ([@b24-etm-08-01-0260]). ", "Therefore, whether piperine is able to affect the hypocholesterolemic effects of curcumin remains to be elucidated. ", "The aim of the present study was to investigate the hypocholesterolemic effect of curcumin plus piperine on cholesterol metabolism in rats fed on a HFD.", "\n\nMaterials and methods\n=====================\n\nMaterials\n---------\n\nCurcumin and piperine were purchased from Sigma-Aldrich (St. Louis, MO, USA). ", "TC, triglyceride (TG), high-density lipoprotein cholesterol (HDL-C), low-density lipoprotein cholesterol (LDL-C) and total bile acid (TBA) kits were purchased from Nanjing Jiancheng Bioengineering Institute (Nanjing, Jiangsu, China). ", "The free cholesterol (FC) kit was purchased from Applygen Technologies Inc. (Beijing, China). ", "Apolipoprotein AI (ApoAI) and ApoB kits were purchased from Shanghai Rongsheng Biotech Co., Ltd. (Shanghai, China). ", "The bicinchoninic acid assay kit was obtained from Tiangen Biotech Co., Ltd. (Beijing, China). ", "Ethanol and isopropanol of analytical grade were purchased from Dikma Technologies, Inc. (Beijing, China). ", "TRIzol^®^ reagent was purchased from Invitrogen Life Technologies (Carlsbad, CA, USA). ", "The RevertAid™ First Strand cDNA Synthesis kit and the Maxima™ SYBR-Green/Fluorescein qPCR Master mix (2X) were purchased from Thermo Fisher Scientific (Burlington, ON, Canada).", "\n\nAnimals, diets and treatments\n-----------------------------\n\nThirty male Sprague-Dawley (SD) rats weighing between 180 and 220 g were purchased from the Guangdong Medical Laboratory Animal Center (Guangzhou, Guangdong, China). ", "All rats were kept in a specific pathogen-free room under controlled conditions. ", "A 12 h light-dark cycle was maintained, with lights on between 6:00 a.m. and 6:00 p.m., and the temperature was maintained at 23±1°C. ", "The rats were provided with the standard laboratory diet and tap water and allowed to acclimatize to the environment for 1 week prior to the start of the experiment. ", "Following 1 week, the rats were randomly divided into five groups with six rats in each group. ", "The rats in the normal control (N) group were fed on a normal diet, whilst rats in the other groups were fed on a HFD, which contained 10% fat and 2% cholesterol for 8 weeks, in order to induce hypercholesterolemia. ", "Following 5 weeks, with the exception of rats in the N group and the HFD control (H) group, rats were administered curcumin (100 mg/kg/day; C group), piperine (5 mg/kg/day; P group) or curcumin (100 mg/kg/day) plus piperine (5 mg/kg/day; CP group), dissolved in corn oil for 4 weeks. ", "Rats in the N and H groups were orally administered corn oil for 4 weeks. ", "At the end of 8 weeks all the rats were sacrificed in a 100% ether atmosphere and the blood, liver and feces were collected.", "\n\nAll experimental protocols were approved by the Animal Ethics Committee of Guangdong Provincial Institute of Traditional Chinese Medicine (Guangzhou, Guangdong, China). ", "The care and treatment of the animals were conducted in accordance with the guidelines (publication no. ", "85-23, revised 1996) provided by the National Institutes of Health (Betheseda, MA, USA) and the U.S. Department of Agriculture (Washington, DC, USA).", "\n\nSerum sampling\n--------------\n\nBlood was collected from the abdominal aorta and left at room temperature for coagulation. ", "The serum samples were obtained by centrifugation at 3,300 × g, 4°C for 10 min and stored at 4°C for further analysis.", "\n\nLiver sampling\n--------------\n\nLiver samples (0.3 g) from each rat were immediately removed and homogenized in phosphate-buffered saline (PBS; pH 7.2; 0.15 g/ml) at 4°C. ", "The supernatant was centrifuged at 3,300 × g at 4°C for 10 min and stored at −80°C for analysis of the hepatic lipid levels. ", "In addition, 0.1 g liver samples from each rat were immediately removed, washed with PBS, dried on filter paper and stored at −80°C for further analysis using polymerase chain reaction (PCR).", "\n\nFeces sampling\n--------------\n\nFeces from each rat were collected following 8 weeks for 3 days and dried at 60°C. ", "Feces were then weighed and ground into a powder. ", "A total of 0.5 g of feces powder from each rat was extracted three times with 10 ml 95% ethanol at 60°C and then filtered as well as extracted three times with 10 ml 95% ethanol at 60°C and then filtered. ", "The residue was dissolved in PBS by sonication. ", "The final solution was adjusted to a suitable concentration and frozen at −80°C for further analysis.", "\n\nMeasurement of lipid levels in the serum, liver and feces\n---------------------------------------------------------\n\nThe serum, liver and fecal levels of TC, TG, HDL-C, LDL-C, ApoAI and ApoB were determined using the respective assay kits in accordance with the manufacturer's instructions. ", "All samples were detected using the 722 Grating Spectrometer (Shanghai Cany Precision Instrument, Co., Ltd., Shanghai, China).", "\n\nMeasurement of TBA levels in feces\n----------------------------------\n\nThe TBA level in the feces extract was analyzed as previously described by Feldmann *et al* ([@b25-etm-08-01-0260]) using an assay kit in accordance with the manufacturer's instructions. ", "All samples were detected using the 722 Grating Spectrometer (Shanghai Cany Precision Instrument, Co., Ltd.).", "\n\nMeasurement of lecithin cholesterol acyltransferase (LCAT) activity in serum\n----------------------------------------------------------------------------\n\nFor the serum LCAT activity, the auto-matrix method was used to transfer 15 μl of serum into tubes A and B. Tube A was placed in an ice bath and tube B was placed at 37°C. ", "The FC level in the two tubes was measured 60 min after using an assay kit in accordance with the manufacturer's instructions. ", "The LCAT activity was then calculated according to the decrement in non-esterified cholesterol by comparing the FC content in each tube. ", "The LCAT activity was then determined using the previously described formula ([@b26-etm-08-01-0260]). ", "All samples were detected using the 722 Grating Spectrometer (Shanghai Cany Precision Instrument, Co., Ltd.).", "\n\nMeasurement of cholesterol 7α-hydroxylase (CYP7A1) activity in the liver\n------------------------------------------------------------------------\n\nThe rat liver microsomes were prepared as previously described ([@b27-etm-08-01-0260]--[@b29-etm-08-01-0260]). ", "CYP7A1 activity in the rat liver was determined using high-performance liquid chromatography quantification of cholesterol metabolites, as described by Hylemon *et al* ([@b30-etm-08-01-0260]).", "\n\nQuantitative PCR (qPCR) analysis of hepatic mRNA levels\n-------------------------------------------------------\n\nTotal RNA was extracted from the rat liver samples using TRIzol reagent in accordance with the manufacturer's instructions. ", "A total of 3 μg of total RNA was reverse transcribed into cDNA using the First Strand cDNA Synthesis kit at 42°C for 1 h. qPCR was performed using the iQ5™ real-time PCR detection system (Bio-Rad, Hercules, CA, USA) and performed in a reaction mix containing 1 μl cDNA, 12.5 μl Maxima™ SYBR-Green/Fluorescein qPCR Master mix (2X), 1 μM forward primer and 1 μM reverse primer in a total volume of 25 μl. ", "The cDNA was amplified using specific primers under the following conditions for 45 cycles: 94°C for 30 sec, an annealing temperature of 55°C for 30 sec and then 72°C for 50 sec, with a final incubation at 72°C for 7 min. ", "The PCR primers used were as follows: ATP-binding cassette transporter A1 (ABCA1; GenBank accession no. ", "NM_178095; 145 bp) forward, 5′-CAGCAACTACAGTGGCGGTAACA-3′ and reverse 5′-AATGCTTAGGGCACAATTCCACA-3′; ApoAI (GenBank accession no. ", "NM_012738; 149 bp) forward, 5′-AAGGCATCTAAAGGTTGT-3′ and reverse 5′-TCAGGGTAGGGTGGTT-3′; CYP7A1 (GenBank accession no. ", "NM_012942; 291 bp) forward, 5′-TGCCGTGTTGGTGAG-3′ and reverse 5′-TTCGCAGAAGTAGTGTAAT-3′; HMG-CoA reductase (HMGCR; GenBank accession no. ", "NM_013134; 249 bp) forward, 5′-TGACGCTCTGGTGGA-3′ and reverse 5′-GTTACTGGGTTTGGTTTAT-3′; LCAT (GenBank accession no. ", "NM_017024; 163 bp) forward, 5′-GCTACCGAAAGACAGAGG-3′ and reverse 5′-CCAAAGCCAGGGACA-3′; low-density lipoprotein receptor (LDLR; GenBank accession no. ", "NM_175762; 117 bp) forward, 5′-CAGACCCAGAGCCATCGTAGTG-3′ and reverse 5′-GTCACCAGAGAGTAGATGTCTAC-3′; scavenger receptor B1 (SR-B1; GenBank accession no. ", "NM_031541; 141 bp) forward, 5′-TACTTGTCCGTCTACT-3′ and reverse 5′-CGTGTCATTGTCATTG-3′; 18S (GenBank accession no. ", "M11188; 205 bp) forward, 5′-TTCAGCCACCCGAGAT-3′ and reverse 5′-GCTTATGACCCGCACTTA-3′. The products were analyzed using the CT value and all values were normalized against the 18S mRNA level. ", "The final result was calculated using the 2^−ΔΔCt^ method.", "\n\nStatistical analysis\n--------------------\n\nAll the data are presented as the mean ± standard deviation (n=6). ", "Statistical analysis was performed using the SPSS version 17.0 statistical software (SPSS, Inc., Chicago, IL, USA). ", "A one-way analysis of variance was used to analyze differences between the biochemical parameters among the groups, followed by Dunnett's significant post-hoc test for pairwise multiple comparisons. ", "P\\<0.05 was considered to indicate a statistically significant difference.", "\n\nResults\n=======\n\nEffects of C, P and CP administration on the growth parameters of rats fed on a HFD\n-----------------------------------------------------------------------------------\n\nAs shown in [Table I](#tI-etm-08-01-0260){ref-type=\"table\"}, no significant difference between the initial body weight, final body weight, body weight gain, food intake and relative liver weight among the groups was identified.", "\n\nEffects of C, P and CP administration on the serum lipid levels of rats fed on a HFD\n------------------------------------------------------------------------------------\n\n[Table II](#tII-etm-08-01-0260){ref-type=\"table\"} shows the serum levels of TC, TG, HDL-C and LDL-C from rats in each group. ", "TC, TG, HDL-C and LDL-C levels in the H group were significantly different compared with the N group. ", "The levels of TC, TG and LDL-C in the H + C and H + CP groups were markedly lower compared with those in the H group, whilst the level of HDL-C in the H + CP group was markedly elevated compared with the H group. ", "In addition, compared with the N group, the levels of ApoAI and ApoB were significantly different in the H group. ", "Administration of CP significantly increased the levels of ApoAI.", "\n\nEffects of C, P and CP administration on the hepatic and fecal lipid levels of rats fed on a HFD\n------------------------------------------------------------------------------------------------\n\nThe hepatic TC and TG levels were significantly increased in the H group compared with the N group, whilst the hepatic TC and TG levels in the H + C group and H + CP group were significantly decreased compared with the H group ([Table III](#tIII-etm-08-01-0260){ref-type=\"table\"}). ", "The fecal TC, TG and TBA levels were also significantly increased in the H group compared with the N group. ", "In addition, compared with the H group, the TC, TG and TBA levels in the H + C and H + CP groups were significantly increased. ", "Furthermore, the TC, TG and TBA levels in the H + CP were significantly different from those in the H + C group.", "\n\nEffects of C, P and CP administration on the activity of serum LCAT and hepatic CYP7A1 in rats fed on a HFD\n-----------------------------------------------------------------------------------------------------------\n\nAs shown in [Table IV](#tIV-etm-08-01-0260){ref-type=\"table\"}, compared with the N group, serum LCAT activity was markedly decreased in the H group. ", "Administration of CP markedly increased the LCAT activity compared with the H or H + C group. ", "Compared with the N group, hepatic CYP7A1 activity was significantly increased in the H group. ", "Administration of CP clearly increased the CYP7A1 activity compared with the H or H + C group.", "\n\nEffects of C and CP administration on the hepatic mRNA levels of rats fed on a HFD\n----------------------------------------------------------------------------------\n\nqPCR analysis was performed to measure the mRNA levels in the rat livers in each group ([Fig. ", "1](#f1-etm-08-01-0260){ref-type=\"fig\"}). ", "Compared with the H and H + C groups, administration of CP caused a marked increase in ApoAI, CYP7A1, LCAT and LDLR mRNA levels. ", "However, no significant differences were observed between the groups for other mRNAs associated with cholesterol metabolism.", "\n\nDiscussion\n==========\n\nIn the present study, a significant increase in TC, TG and LDL-C levels, as well as a decrease in HDL-C levels in the H group was observed, indicating that HLP in SD rats was successfully induced via administration of a HFD. ", "Administration of curcumin plus piperine resulted in a significant decrease in the serum TC, TG and LDL-C levels compared with the H and H + C groups. ", "Notably, the results from the present study demonstrated that curcumin did not significantly alter the HDL levels, which is consistent with the results from Kim *et al* ([@b16-etm-08-01-0260]); however, they are inconsistent with the results from Arafa *et al* ([@b12-etm-08-01-0260]). ", "In addition, only curcumin plus piperine significantly increased the levels of ApoAI and HDL-C, as well as LCAT activity.", "\n\nNotably, only curcumin plus piperine significantly increased the levels of HDL-C. Previous studies have demonstrated that HDL is synthesized through a complex pathway ([@b31-etm-08-01-0260]). ", "HDL assembly initially involves the cell surface ABCA1 transporter-mediated transfer of phospholipids and cholesterol to the extracellular lipid-poor ApoAI. ", "The plasma compartment of HDL particles is then remodeled by the esterification of cholesterol via the LCAT enzyme, the exchange between HDL and other lipoproteins and the putative transfer of cellular cholesterol to the growing particles by SR-B1, which is also an important receptor in cholesterol metabolism ([@b32-etm-08-01-0260]). ", "In the present study, no significant differences in ABCA1 and SR-B1 mRNA levels were observed. ", "Previous studies have demonstrated that the increase in LCAT activity and ApoAI levels may contribute to an increase in HDL-C concentrations ([@b33-etm-08-01-0260]--[@b35-etm-08-01-0260]). ", "However, in the present study, a significant increase in the level of ApoAI and the activity of LCAT was observed in the H + CP group. ", "Therefore, to further explain the increase of serum HDL-C level in rats in the H + CP group, the expression of ApoAI and LCAT mRNA was analyzed. ", "It was found that the mRNA levels of LCAT and ApoAI significantly increased following administration of curcumin and piperine, suggesting a co-ordinated regulatory mechanism of ApoAI and LCAT mRNA expression. ", "This suggests that the higher level of HDL-C in rats in the H + CP group may be due to alterations in the mRNA expression of ApoAI and LCAT. ", "Therefore, this indicates that curcumin plus piperine increases cholesterol efflux to HDL particles by elevating the ApoAI and LCAT mRNA levels, resulting in a significant increase in serum HDL-C levels.", "\n\nCholesterol metabolism is primarily conducted in the liver. ", "The conversion of cholesterol to bile acids in the liver is an important pathway for the elimination of cholesterol from the body ([@b36-etm-08-01-0260]), which accounts for \\~50% of daily cholesterol excretion ([@b37-etm-08-01-0260]). ", "CYP7A1 is a liver-specific enzyme that catalyzes the rate-limiting step in the biosynthesis of bile acid from cholesterol ([@b38-etm-08-01-0260]). ", "An increase in hepatic CYP7A1 gene expression may contribute to the enhancement of CYP7A1 activity and therefore increase the fecal bile acid levels. ", "This may lead to an increase in the quantity of cholesterol that is excreted out of the body and thus lead to a decrease in serum cholesterol levels. ", "In the present study, the expression level of CYP7A1 was found to be markedly upregulated by high plasma cholesterol in the H group, suggesting that the synthesis of bile acid is positively associated with plasma cholesterol levels ([@b39-etm-08-01-0260]). ", "Increased CYP7A1 mRNA levels were also observed in rats treated with curcumin, which is in accordance with the results obtained by Kim *et al* ([@b16-etm-08-01-0260]). ", "Furthermore, the present study found that curcumin plus piperine increased CYP7A1 activity and gene expression to a greater extent than curcumin alone. ", "This demonstrated that curcumin plus piperine increased the rate of bile acid production, which is the precursor molecule for cholesterol synthesis and, therefore, curcumin and piperine induce a more efficient removal of excessive cholesterol from the blood. ", "However, a certain amount of cholesterol may also be transformed into fecal cholesterol by microbes in the intestine and excreted through the feces ([@b26-etm-08-01-0260]). ", "The results from the present study demonstrated that fecal TC and TG levels were greater in rats administrated with curcumin plus piperine compared with rats in the other groups. ", "These results are consistent with the previous studies that found a curcumin-mediated increase in fecal excretion of cholesterol ([@b16-etm-08-01-0260],[@b40-etm-08-01-0260]).", "\n\nThe mRNA levels of genes associated with cholesterol synthesis were measured in the present study. ", "HMGCR is a rate-limiting enzyme in cholesterol synthesis ([@b14-etm-08-01-0260],[@b41-etm-08-01-0260]). ", "The present study demonstrated that the mRNA expression of HMGCR in the H group was inhibited due to feedback inhibition induced by an increase in exogenous cholesterol. ", "In addition, no significant differences were observed among the three groups, including the H, H + C and H + CP groups, suggesting neither C nor CP affected the synthesis of cholesterol. ", "LDLR is an important receptor that mediates the clearance of LDL-C in the blood. ", "It has previously been demonstrated that curcumin treatment upregulated LDLR mRNA levels in human hepatoma HepG2 cells ([@b42-etm-08-01-0260],[@b43-etm-08-01-0260]) and SD rats ([@b16-etm-08-01-0260]). ", "The present study revealed that curcumin plus piperine had a more significant effect on LDLR mRNA expression levels than curcumin alone, leading to a marked decrease in LDL-C levels.", "\n\nIn combination, the results from the present study demonstrated that piperine was able to enhance the hypocholesterolemic effect of curcumin via modulating the expression of a number of genes involved in cholesterol metabolism. ", "In the presence of piperine, curcumin was found to increase the mRNA expression levels of ApoAI, CYP7A1, LCAT and LDLR, leading to an increase in the transformation of cholesterol to bile acid, an increase in HDL-C levels and a reduction of LDL-C levels. ", "Therefore, this suggests that redundant TC in the blood may be removed by HDL and transferred to the feces. ", "It has previously been demonstrated that the combination of piperine and curcumin was able to increase bioavailability of curcumin ([@b17-etm-08-01-0260],[@b20-etm-08-01-0260]). ", "The present study demonstrated that administration of piperine alone (5 mg/kg/day) had no significant hypocholesterolemic effect; however, administration of piperine plus curcumin markedly increased the hypocholesterolemic effect, via upregulation of the activity and gene expression levels of ApoAI, CYP7A1, LCAT and LDLR. ", "This suggests that the enhanced ability of curcumin plus piperine compared with curcumin alone in lowering serum cholesterol level is due to an increase in the bioavailability of curcumin.", "\n\nIn conclusion, co-administration of curcumin plus piperine was found to decrease the serum and liver levels of TC, TG and LDL-C, as well as increase the fecal levels of TC, TG and TBA to a greater extent compared with curcumin alone. ", "In addition, curcumin plus piperine markedly increased the levels of HDL-C. Furthermore, compared with administration of curcumin alone, administration of curcumin plus piperine resulted in a more significant upregulation of the activities and gene expression levels of ApoAI, LCAT, CYP7A1 and LDLR. ", "Therefore, the results from the present study demonstrate that co-administration of curcumin plus piperine is better than administration of curcumin alone against HLP, providing a promising combination for the treatment of HLP.", "\n\nThis study was supported by the Natural Science Foundation of Guangdong Province, China (grant no. ", "S2011010005928 and S2013010012360), the Administration of Traditional Medicine of Guangdong Province, China (grant no. ", "2010268) and the Guangzhou Science and Technology and Information Bureau (grant no. ", "2010Y1-C761).", "\n\n{#f1-etm-08-01-0260}\n\n###### \n\nGrowth parameters of rats fed on a HFD.", "\n\n Parameter N H H + C H + P H + CP\n ------------------------------------------------------------------------ -------------- -------------- -------------- -------------- --------------\n Initial body weight (g)[\\*](#tfn2-etm-08-01-0260){ref-type=\"table-fn\"} 314.33±6.38 307.15±5.25 305.18±5.84 303.98±8.12 306.65±8.80\n Final body weight (g)[\\*\\*](#tfn3-etm-08-01-0260){ref-type=\"table-fn\"} 369.58±20.85 358.83±19.69 360.05±13.68 365.93±11.04 354.65±9.79\n Body weight gain (g) 55.25±14.42 51.68±15.23 54.87±12.10 54.37±12.18 48.00±9.34\n Food intake for 4 weeks (g) 393.77±12.22 386.87±11.34 374.25±13.77 382.44±12.16 361.32±12.09\n Relative liver weight (g/100 g of body weight) 3.73±0.26 3.65±0.38 3.36±0.10 3.44±0.18 3.35±0.09\n\nThe results are presented as the mean ± standard deviation obtained from six rats in each group.", "\n\nBody weight at the beginning of the 4-week oral administration of C, P or CP.", "\n\nBody weight at the end of the 4-week oral administration of C, P or CP.", "\n\nHFD, high-fat diet; N, normal control; H, HFD control; H + C, HFD plus curcumin; H + P, HFD plus piperine; H + CP, HFD plus curcumin plus piperine.", "\n\n###### \n\nEffects of C, P and CP on the serum lipid levels of rats fed on a HFD.", "\n\n Parameter N H H + C H + P H + CP\n ---------------- ------------- ----------------------------------------------------------- --------------------------------------------------------- ------------- -----------------------------------------------------------------------------------------------------------\n TC (mmol/l) 4.02±0.96 7.16±1.59[b](#tfn7-etm-08-01-0260){ref-type=\"table-fn\"} 5.18±1.47[c](#tfn8-etm-08-01-0260){ref-type=\"table-fn\"} 6.63±1.89 4.52±1.36[d](#tfn9-etm-08-01-0260){ref-type=\"table-fn\"},[e](#tfn10-etm-08-01-0260){ref-type=\"table-fn\"}\n TG (mmol/l) 1.94±1.05 4.28±1.17[b](#tfn7-etm-08-01-0260){ref-type=\"table-fn\"} 3.07±1.30[c](#tfn8-etm-08-01-0260){ref-type=\"table-fn\"} 4.07±1.16 1.96±1.33[d](#tfn9-etm-08-01-0260){ref-type=\"table-fn\"},[e](#tfn10-etm-08-01-0260){ref-type=\"table-fn\"}\n HDL-C (mmol/l) 2.85±0.58 1.70±0.16[a](#tfn6-etm-08-01-0260){ref-type=\"table-fn\"} 1.84±0.51 1.61±0.24 2.88±0.46[d](#tfn9-etm-08-01-0260){ref-type=\"table-fn\"},[e](#tfn10-etm-08-01-0260){ref-type=\"table-fn\"}\n LDL-C (mmol/l) 1.16±0.66 5.34±0.52[b](#tfn7-etm-08-01-0260){ref-type=\"table-fn\"} 3.30±1.18[c](#tfn8-etm-08-01-0260){ref-type=\"table-fn\"} 5.01±0.43 1.64±0.77[d](#tfn9-etm-08-01-0260){ref-type=\"table-fn\"},[e](#tfn10-etm-08-01-0260){ref-type=\"table-fn\"}\n ApoAI (g/l) 0.063±0.006 0.018±0.006[b](#tfn7-etm-08-01-0260){ref-type=\"table-fn\"} 0.024±0.010 0.021±0.009 0.064±0.011[d](#tfn9-etm-08-01-0260){ref-type=\"table-fn\"},[e](#tfn10-etm-08-01-0260){ref-type=\"table-fn\"}\n ApoB (g/l) 0.075±0.017 0.112±0.010[a](#tfn6-etm-08-01-0260){ref-type=\"table-fn\"} 0.109±0.011 0.114±0.019 0.107±0.012\n\nThe results are presented as the mean ± standard deviation obtained from six rats in each group.", "\n\nP\\<0.05,\n\nP\\<0.01 vs. N group;\n\nP\\<0.05,\n\nP\\<0.01 vs. H group;\n\nP\\<0.05, vs. H + C group.", "\n\nHFD, high-fat diet; TC, total cholesterol; TG, triglyceride; HDL-C, high-density lipoprotein cholesterol; LDL-C, low-density lipoprotein cholesterol; Apo, apolipoprotein; N, normal control; H, HFD control; H + C, HFD plus curcumin; H + P, HFD plus piperine; H + CP, HFD plus curcumin plus piperine.", "\n\n###### \n\nEffect of C, P and CP administration on hepatic and fecal lipid levels of rats fed on a HFD.", "\n\n Parameter N H H + C H + P H + CP\n --------------------------------------------------------------------------- ------------- ------------------------------------------------------------- ------------------------------------------------------------- -------------- ------------------------------------------------------------------------------------------------------------\n TC (μmol/g liver)[\\*](#tfn13-etm-08-01-0260){ref-type=\"table-fn\"} 9.97±3.12 34.76±4.31[b](#tfn16-etm-08-01-0260){ref-type=\"table-fn\"} 20.38±2.86[c](#tfn17-etm-08-01-0260){ref-type=\"table-fn\"} 29.91±3.17 12.52±2.27[d](#tfn18-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn19-etm-08-01-0260){ref-type=\"table-fn\"}\n TG (μmol/g liver)[\\*](#tfn13-etm-08-01-0260){ref-type=\"table-fn\"} 17.26±3.78 40.35±4.84[b](#tfn16-etm-08-01-0260){ref-type=\"table-fn\"} 27.90±3.06[c](#tfn17-etm-08-01-0260){ref-type=\"table-fn\"} 36.46±4.38 22.56±3.44[d](#tfn18-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn19-etm-08-01-0260){ref-type=\"table-fn\"}\n TC (μmol/g of feces/day)[\\#](#tfn14-etm-08-01-0260){ref-type=\"table-fn\"} 5.69±1.47 11.10±2.29[b](#tfn16-etm-08-01-0260){ref-type=\"table-fn\"} 14.77±2.51[c](#tfn17-etm-08-01-0260){ref-type=\"table-fn\"} 12.05±2.40 17.33±3.16[d](#tfn18-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn19-etm-08-01-0260){ref-type=\"table-fn\"}\n TG (μmol/g of feces/day)[\\#](#tfn14-etm-08-01-0260){ref-type=\"table-fn\"} 1.71±0.36 3.84±2.25[b](#tfn16-etm-08-01-0260){ref-type=\"table-fn\"} 6.16±2.37[c](#tfn17-etm-08-01-0260){ref-type=\"table-fn\"} 4.92±2.12 7.05±2.40[d](#tfn18-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn19-etm-08-01-0260){ref-type=\"table-fn\"}\n TBA (μmol/g of feces/day)[\\#](#tfn14-etm-08-01-0260){ref-type=\"table-fn\"} 169.21±30.8 218.10±16.65[a](#tfn15-etm-08-01-0260){ref-type=\"table-fn\"} 241.82±20.50[c](#tfn17-etm-08-01-0260){ref-type=\"table-fn\"} 225.63±18.47 266.44±29.43[d](#tfn18-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn19-etm-08-01-0260){ref-type=\"table-fn\"}\n\nThe results are presented as the mean ± standard deviation from six rats in each group.", "\n\nHepatic lipids and\n\nFecal lipids.", "\n\nP\\<0.05,\n\nP\\<0.01, vs. N group;\n\nP\\<0.05,\n\nP\\<0.01 vs. H group;\n\nP\\<0.05,\n\nP\\<0.01 vs. H + C group.", "\n\nHFD, high-fat diet; TC, total cholesterol; TG, triglyceride; TBA, total bile acid; N, normal control; H, HFD control; H + C, HFD plus curcumin; H + P, HFD plus piperine; H + CP, HFD plus curcumin plus piperine.", "\n\n###### \n\nEffect of C, P and CP administration on the activity of CYP7A1 and LCAT in rats fed on a HFD.", "\n\n Parameter N H H + C H + P H + CP\n ---------------------------- ----------- ---------------------------------------------------------- ---------------------------------------------------------- ----------- ----------------------------------------------------------------------------------------------------------\n LCAT (nmol/h/ml) 16.3±2.01 9.68±1.37[b](#tfn24-etm-08-01-0260){ref-type=\"table-fn\"} 10.29±1.17 9.70±0.87 13.95±1.00[d](#tfn26-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn27-etm-08-01-0260){ref-type=\"table-fn\"}\n CYP7A1 (nmol/h/mg protein) 1.12±0.39 1.77±0.46[a](#tfn23-etm-08-01-0260){ref-type=\"table-fn\"} 2.23±0.75[c](#tfn25-etm-08-01-0260){ref-type=\"table-fn\"} 1.75±0.48 3.04±0.61[d](#tfn26-etm-08-01-0260){ref-type=\"table-fn\"}[e](#tfn27-etm-08-01-0260){ref-type=\"table-fn\"}\n\nThe results are presented as the mean ± standard deviation obtained from six rats in each group.", "\n\nP\\<0.05,\n\nP\\<0.01, vs. N group;\n\nP\\<0.05,\n\nP\\<0.01, vs. H group;\n\nP\\<0.05,\n\nP\\<0.01, vs. H+C group.", "\n\nLCAT, lecithin cholesterol acyltransferase; CYP7A1, cholesterol 7α-hydroxylase; HFD, high-fat diet; N, normal control; H, HFD control; H + C, HFD plus curcumin; H + P, HFD plus piperine; H + CP, HFD plus curcumin plus piperine.", "\n" ]

{ "pile_set_name": "PubMed Central" }

[ 0.001103165908716619, 0.0009553327108733356, 0.0005689114332199097, 0.001278176554478705, 0.0006966209039092064, 0.0007492104778066278, 0.0007059368654154241, 0.0008757588802836835, 0.0006963679916225374, 0.0007723663584329188, 0.000830034026876092, 0.0007697438704781234, 0.0010368416551500559, 0.0006976071163080633, 0.0007572078029625118, 0.0005963810835964978, 0.000713043671566993, 0.0006174513255245984, 0.0005834200419485569, 0.0006629605195485055, 0.000586730195209384, 0.0007152801845222712, 0.0010292541701346636, 0.000637746590655297, 0.0007832890842109919, 0.000866802001837641, 0.0024422851856797934, 0.000712223700247705, 0.0007995759951882064, 0.011292997747659683, 0.0005345889367163181, 0.0006816234090365469, 0.0005615921691060066, 0.003336692927405238, 0.000575310958083719, 0.0006682649836875498, 0.0007181885885074735, 0.0008495883084833622, 0.0014530143234878778, 0.0056139081716537476, 0.007978541776537895, 0.000577612838242203, 0.0005480211693793535, 0.0006445204489864409, 0.0005949778715148568, 0.0006008386262692511, 0.0006048560608178377, 0.0007063341909088194, 0.0005995983956381679, 0.0006716470816172659, 0.000567060022149235, 0.0006048560608178377, 0.0006737534422427416, 0.0007206614827737212, 0.0006326045840978622, 0.0006099121528677642, 0.0005867111613042653, 0.0006037712446413934, 0.008684984408318996, 0.008139112032949924, 0.00450516864657402, 0.014424433931708336, 0.005625475198030472, 0.0040989285334944725, 0.0016935741296038032, 0.0011821947991847992, 0.0006312236073426902, 0.0005975093226879835, 0.0005723207723349333, 0.0005363090895116329, 0.0006411777576431632, 0.0007573192706331611, 0.0008953341166488826, 0.0007243748405016959, 0.000658964563626796, 0.0007169626769609749, 0.0006412342190742493, 0.0009843080770224333, 0.0007593600894324481, 0.0006184331141412258, 0.000690859742462635, 0.0008459355449303985, 0.000618894468061626, 0.0006637513870373368, 0.0006579185137525201, 0.0008749351836740971, 0.0006321191322058439, 0.0007170833996497095, 0.0005900661344639957, 0.0006258221692405641, 0.000691818306222558, 0.0006227318663150072, 0.000757260830141604, 0.0006363827851600945, 0.0009297180222347379, 0.0007454380975104868, 0.0005747165996581316, 0.000626198947429657, 0.0005809626309201121, 0.0005905175930820405, 0.0006161577184684575, 0.0006710044108331203, 0.0009266111883334816, 0.0007114720065146685, 0.0009652881417423487, 0.0009220541105605662, 0.000827284122351557, 0.00927379447966814, 0.0006327037699520588, 0.0006136177689768374, 0.0006970575195737183, 0.001464241766370833, 0.0014098898973315954, 0.0007686372264288366, 0.011068511754274368, 0.0005632151151075959, 0.0007165744318626821, 0.0006151343695819378, 0.000675783958286047, 0.0018760381499305367, 0.0008656942518427968, 0.0006865652394481003, 0.0006695246556773782, 0.0008031796314753592, 0.011741412803530693, 0.00069168780464679, 0.0007553480099886656, 0.0007160811801441014, 0.0007193581550382078, 0.0007301759324036539, 0.0007080777431838214, 0.0005525518790818751, 0.0006643715896643698, 0.0005978249246254563, 0.0007870607660152018, 0.0019054226577281952, 0.0006188310217112303, 0.0006045762565918267, 0.002213516039773822, 0.005090577062219381, 0.002035299316048622, 0.0008825163240544498, 0.000969570828601718, 0.03387013450264931, 0.0046931905671954155, 0.007140709087252617, 0.001819731667637825, 0.015662385150790215, 0.0035540962126106024, 0.006963436491787434, 0.0015310680028051138, 0.0021383853163570166, 0.016471372917294502, 0.0013711615465581417, 0.006435967981815338, 0.0019467421807348728, 0.009623317047953606, 0.001994825666770339 ]

[ "Frederick Williams-Taylor\n\nSir Frederick Williams-Taylor (October 23, 1863 – August 3, 1945) was a Canadian banker. ", "He was general manager of the Bank of Montreal.", "\n\nEarly life\nFrederick was born in Moncton, New Brunswick on October 23, 1863. ", " He was the son of Ezekiel Moore Taylor and Rosalind (née Beatty) Taylor, both of whom came from the north of Ireland.", "\n\nHis paternal great-grandfather was Capt. ", "Moore (d. 1849) of Buncrana Castle in Inishowen, Ireland (third son of William Thornton-Todd, heir of both Isaac Todd, the prominent Montreal merchant with the North West Company, and William Thornton, a British Army officer who served as Lieutenant Governor of Jersey) and his maternal great-grandfather was Col. ", "Joseph Morse, the United Empire Loyalist commandant of Fort Cumberland (formerly known as Fort Beauséjour under the French) in Nova Scotia.", "\n\nWilliams-Taylor was educated privately until he began working in 1878. ", "In 1914, he was honored with the honorary degree of doctor of laws by the University of New Brunswick.", "\n\nCareer\nIn 1878, Williams-Taylor joined the Bank of Montreal and by 1897, he was appointed Assistant Inspector, Head Office. ", " In 1903, he became the Joint Manager of the bank in Chicago and by 1906, he was promoted to Manager of the bank in London, England, and eventually, and General Manager of the bank in 1913.", "\n\nIn 1913, Frederick Williams-Taylor was knighted by King George V, and combined his middle name and birth surname into a new hyphenated surname. ", "He received an honorary degree of Doctor of Laws from the University of New Brunswick in 1915.", "\n\nPersonal life\nIn athletics, he \"earned great distinction in skating, rowing, tennis, squash, racquets, and stroked the Wanderers four-oared crew\" in Halifax, in 1886.", "\n\nIn June 1888, he married the former Jane Fayrer Henshaw (1868–1950), a daughter of Mr. Joshua Henshaw of Montreal. ", "Together, they had a daughter:\n\n Brenda Germaine Henshaw Williams-Taylor (1889–1948), who married Frank Duff Frazier of the prosperous Boston family in 1917. ", "They divorced in January 1926 (he died of throat cancer in 1933) and she married Frederic Newell Watriss (1871–1938). ", " After his death, she married Henry Pierrepont Perry (1878–1966) in 1942.", "\n Frederick Travers Williams-Taylor (1894–1926), a Lt. ", "formerly of the 13th Hussars, Bimbashi Sudan Defence Force and veteran of World War I who died in 1926.", "\n\nJust before her daughter's wedding in Montreal in December 1917, Lady Williams-Taylor was painted by the Swiss-born American society artist Adolfo Muller-Ury at his palatial home, Star Acres, in Nassau in the Bahamas, after which he attended the wedding ceremony. ", " While living in the Bahamas, Sir Frederick and Lady Williams-Taylor were close friends of the Duke (formerly Edward VIII) and Duchess of Windsor.", "\n\nWilliams-Taylor died in Montreal, Quebec on August 3, 1945.", "\n\nDescendants\nThrough his daughter Brenda, he was the grandfather of Brenda Frazier (1921–1982), known as one of the most famous American debutantes during the Depression era.", "\n\nReferences\n\nExternal links\n\n Photograph of Sir Frederick Williams-Taylor, General Manager of the Bank of Montreal, c. 1915 at the McCord Museum.", "\n\nCategory:1863 births\nCategory:1945 deaths\nCategory:Canadian bankers\nCategory:Canadian Knights Bachelor\nCategory:Bank of Montreal people" ]

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

[ 0.0007970386650413275, 0.0007188990130089223, 0.0006357296369969845, 0.0009623533114790916, 0.0006780896219424903, 0.0008275167201645672, 0.0006012737285345793, 0.0006030942895449698, 0.0005756236496381462, 0.0006567529635503888, 0.0006023920723237097, 0.0006102979532442987, 0.0006626569665968418, 0.0006211707950569689, 0.0007846996304579079, 0.0006569232791662216, 0.0018277533818036318, 0.0009953139815479517, 0.0007202186970971525, 0.0012045835610479116, 0.0006404750747606158, 0.0005907909362576902, 0.0007661347044631839, 0.0009497440187260509, 0.0005824590916745365, 0.000582221255172044 ]

[ "Great work & persistence throughout the Lynx Roadshow, we have received some terrific feedback internally and couldn’t have done it without your hard work” Rob Hango-Zada, Head of Shopper Solutions, Unilever\nRead More" ]

{ "pile_set_name": "Pile-CC" }

[ 0.0006643001106567681 ]

[ "// Code generated by go-swagger; DO NOT EDIT.", "\n\npackage models\n\n// This file was generated by the swagger tool.", "\n// Editing this file might prove futile when you re-run the swagger generate command\n\nimport (\n\tstrfmt \"github.com/go-openapi/strfmt\"\n\n\t\"github.com/go-openapi/errors\"\n\t\"github.com/go-openapi/validate\"\n)\n\n// ChannelID channel id\n// swagger:model channel_id\ntype ChannelID string\n\n// Validate validates this channel id\nfunc (m ChannelID) Validate(formats strfmt.", "Registry) error {\n\tvar res []error\n\n\tif err := validate.", "MinLength(\"\", \"body\", string(m), 1); err !", "= nil {\n\t\treturn err\n\t}\n\n\tif err := validate.", "Pattern(\"\", \"body\", string(m), `^[a-z][\\da-z_]+$`); err !", "= nil {\n\t\treturn err\n\t}\n\n\tif len(res) > 0 {\n\t\treturn errors.", "CompositeValidationError(res...)\n\t}\n\treturn nil\n}\n" ]

{ "pile_set_name": "Github" }

[ 0.0020430758595466614, 0.0007353376713581383, 0.0016873576678335667, 0.0008980857091955841, 0.0013434292050078511, 0.002087150700390339, 0.0009777555242180824, 0.004330371506512165, 0.0015291229356080294 ]

[ "Billionaire tech investor and philanthropist Robert Smith has erased the burden of student loan debt for the entire 2019 class at Morehouse College in Atlanta. ", "Tuition and other expenses at all-male, historically black college total more than $48,000 a year. ", "Now, the billionaire's donation will allow graduates to focus on their dreams instead of their debt.", "\n\nSmith is the founder and CEO of a private equity firm. ", "According to Forbes, he's worth an estimated $5 billion.", "\n\n\"On behalf of the eight generations of my family who have been in this country, we're gonna put a little fuel in your bus,\" said Smith, who dropped a $40 million surprise during his commencement address Sunday, with a promise to pay off every penny of their student loans.", "\n\n\"This is my class, 2019, and my family is making a grant to eliminate their student loans,\" he said.", "\n\nThe announcement appeared to stun even school administrators.", "\n\nDwytt Lewis, who just graduated from Morehouse College with a degree in business administration, danced his way across stage after learning his more than $150,000 student debt was just wiped away. ", "CBS News\n\n\"Just imagine the weight lifted off your shoulders when you have a clean slate coming out of college,\" said Dwytt Lewis, who just graduated from Morehouse with a degree in business administration. ", "He danced his way across stage after learning his more than $150,000 debt was just wiped away.", "\n\n\"It's just an overwhelming feeling, in a good way,\" Lewis told correspondent Mark Strassmann. \"", "I'm so motivated to go change the world.\"", "\n\nThe 21-year-old from Compton, Calif., used to be homeless, and often didn't know where his next meal was coming from, let alone how he would one day pay for college.", "\n\n\"'Wow, okay, I'm going into a few hundred thousand dollars in debt,' right? ", "And then your last 30 seconds of being an undergrad student, someone tells you, 'I'm taking the burden of your student loan; go change the world.'\"", "\n\nSmith's generous gift comes at a time where student loan debt has soared to roughly $1.5 trillion. ", "The average student loan debt is more than $33,000.", "\n\nLewis says Smith's gift motivates him to help others who struggled just as he did. \"", "There is room for you in this world,\" he said. \"", "You can do what you want to do. ", "You can follow your dreams. ", "And I think that's where it starts. ", "I think once you have that mindset of, 'I want to be impactful and I want to change the world,' I promise you that energy just transpires.\"", "\n\nThe total amount of the student debt for the class is still being calculated.", "\n\nIn return, Smith says he expects the recipients to \"pay it forward,\" and challenged alumni to give future classes the same opportunity." ]

{ "pile_set_name": "OpenWebText2" }

[ 0.0006198747432790697, 0.005374920088797808, 0.0007247580215334892, 0.0007435763254761696, 0.0015068372013047338, 0.0022467232774943113, 0.0008470078464597464, 0.018072720617055893, 0.0008579681743867695, 0.0007742568850517273, 0.0010279096895828843, 0.0005974466912448406, 0.0007973861647769809, 0.0016075577586889267, 0.002078152261674404, 0.041068367660045624, 0.0005856831558048725, 0.0007372205727733672, 0.0006016111001372337, 0.0018083826871588826, 0.000964539882261306, 0.0008494697394780815, 0.0006456876872107387, 0.0005653562839142978, 0.0006567285745404661, 0.0005582803278230131 ]

[ "Q:\n\nWhy code-as-data?", "\n\nWhat is code-as-data? ", "I've heard it's superior to \"code-as-ascii-characters\" but why? ", "I personally find the code-as-data philosophy a bit confusing actually.", "\nI've dabbled in Scheme, but I never really got the whole code-as-data thing and wondered what exactly does it mean?", "\n\nA:\n\nIt means that your program code you write is also data which can be manipulated by a program. ", "Take a simple Scheme expression like\n(+ 3 (* 6 7))\n\nYou can regard it as a mathematical expression which when evaluated yields a value. ", "But it is also a list containing three elements, namely +, 3 and (* 6 7). ", "By quoting the list,\n '(+ 3 (* 6 7))\n\nYou tell scheme to regard it as the latter, namely just a list containing three elements. ", "Thus, you can manipulate this list with a program and then evaluate it. ", "The power it gives you is tremendous, and when you \"get\" the idea, there are some very cool tricks to be played.", "\n\nA:\n\nCode-as-data is actually only one side of the coin. ", " The other is data-as-code.", "\nThe possibility to embed arbitrary data in Lisp code and load and reload it on the fly makes it (the data) very convenient to handle because it can eliminate any potential impedance mismatch between the way the data is represented and the way the code works.", "\nLet me give you an example.", "\nLet's say you want to write some kind of computer game with various monster classes. ", " You have basically two choices: model the monster classes within your programming language or use a data-driven approach where the class descriptions are read from, say, an XML file.", "\nDoing the modelling within the programming language has the benefits of ease of use and simplicity (which is always a good thing). ", " It's also easy to specify custom behaviour depending on the monster class as needed. ", " Finally, the implementation is probably pretty optimised.", "\nOn the other hand, loading everything from data files is much more flexible. ", " You can do multiple inheritance where the language doesn't support it; you can do dynamic typing; you can load and reload things at run-time; you can use simple, to-the-point, domain-specific syntax, and much more. ", " But now you need to write some kind of runtime environment for the whole thing, and specifying behaviour means either splitting the data up between the data files and the game code or embedding a scripting language, which is yet another layer of incidental complexity.", "\nOr you can do it the Lisp way: specify your own sublanguage, translate that into code, and execute it. ", " If the programming language you're using is sufficiently dynamic and syntactically flexible, you get all the benefits from using a data-driven approach (since code is data) combined with the simplicity of keeping everything in the code (since data is code).", "\nThis isn't specific to Lisp, by the way. ", " There are various shades of code-data-equivalence gray in between Lisp and, say, C++. ", " Ruby, for example, makes embedding data within the application easier than Python does, and Python makes it easier than Java does. ", " Both data-as-code and code-as-data are more of a continuum than they are either-or questions.", "\n\nA:\n\nAs a Lisp programmer you learn to think of a program source as data. ", "It is no longer static text, but data. ", "In some forms of Lisp the program itself is that data structure, which gets executed.", "\nThen all the tools are oriented that way. ", "Instead of a textual macro processor Lisp has a macro system which works over programs as data. ", "The transformation of programs to and from text has also its tools.", "\nLet's think about adding two elements of a vector:\n(let ((v (vector 1 2 3)))\n (+ (aref v 0)\n (aref v 1)))\n\nThere is nothing unusual about it. ", "You can compile and run it.", "\nBut you could also do this:\n(let ((v (vector 1 2 3)))\n (list '+\n (list 'aref v 0)\n (list 'aref v 1)))\n\nThat returns a list with a plus symbol and two sublists. ", "These sublists have the symbol aref, then the array value of v and the index value.", "\nThat means that the constructed program contains actually symbols, but also data. ", "The array is really a part of the sublists. ", "So you can construct programs and these programs are data and can contain arbitrary data.", "\nEVAL then evaluates the program as data.", "\nCL-USER 17 > (setf *print-circle* t)\n=> T\n\nAbove tells us that the printer should print circular data structures such that the identities are preserved when read back.", "\nCL-USER 18 > (let ((v (vector 1 2 3)))\n (list '+\n (list 'aref v 0)\n (list 'aref v 1)))\n=> (+ (AREF #1=#(1 2 3) 0) (AREF #1# 1))\n\nNow let's eval the data as a Lisp program:\nCL-USER 19 > (EVAL (let ((v (vector 1 2 3)))\n (list '+\n (list 'aref v 0)\n (list 'aref v 1))))\n\n=> 3\n\nIf your compiler expects text as source one can construct these texts, but they can never reference data directly. ", "For these text based source construction many tools have been developed, but many of these tend to work in stages. ", "In Lisp the functionality of manipulating data can be directly applied to manipulate programs and this functionality is directly built-in and part of the evaluation process.", "\nSo Lisp gives you an additional degree of freedom and new ways to think.", "\n\n" ]

{ "pile_set_name": "StackExchange" }

[ 0.0008172752568498254, 0.0008813802269287407, 0.0006821823189966381, 0.0005987444310449064, 0.0005910638137720525, 0.0008296271553263068, 0.0006412699585780501, 0.0006367838359437883, 0.0006228761048987508, 0.0006953271804377437, 0.0006814730004407465, 0.0008385528926737607, 0.0007892716093920171, 0.0006566140218637884, 0.0008367489790543914, 0.0011425981065258384, 0.0006566262454725802, 0.0005522038554772735, 0.0006227932753972709, 0.0005739792250096798, 0.000638952071312815, 0.0006670690490864217, 0.0006900079897604883, 0.0016794363036751747, 0.0006413629744201899, 0.0006725252023898065, 0.0006660624640062451, 0.0006631646538153291, 0.0007951504085212946, 0.0007927736733108759, 0.000693407142534852, 0.0007575571071356535, 0.0005803430685773492, 0.0007781271124258637, 0.000579040206503123, 0.0006424188031814992, 0.0007126429118216038, 0.0008065385627560318, 0.0006969881360419095, 0.0006607336108572781, 0.0006638807826675475, 0.0008268247474916279, 0.0006448203348554671, 0.0006900829030200839, 0.0007357147405855358, 0.0005333300214260817, 0.0005837281350977719, 0.0007839036406949162, 0.001994825666770339 ]

[ "David Hare (philanthropist)\n\nDavid Hare (1775–1842) was a Scottish watchmaker and philanthropist in Bengal, India (see East India Company and their rule in India). ", "He founded many important and prestigious educational institutions in Calcutta (now Kolkata), such as the Hindu School, and Hare School and helped in founding Presidency College.", "\n\nEarly life\nDavid Hare was born in Scotland in 1775. ", "He came to India in 1800 to make a fortune as a watch maker. ", "However, while he prospered in his business his mind was distracted by the deplorable conditions of the native population and unlike most of the other people who returned to their native land after gathering a fortune to live a life in peace and prosperity, he decided to stay back in the country and devote himself entirely to the cause of its uplift. ", "However, he was no missionary, seeking to convert others to his religion. ", "He lived his own life and allowed others to live their own, only helping to improve their condition.", "\n\nContribution\nHare felt that the need of the country was English education. ", "He used to discuss the topic with many of his customers, who came to buy watches in his shop. ", "Raja Rammohun Roy went to Kolkata in 1814 and within a short time, they became friends. ", "In 1816, he went on his own and attended a session of the Raja’s Atmiya Sabha. ", "Both of them discussed at length the proposal to establish an English school at Kolkata. ", "Babu Buddi Nath Mukherjee - another member of Atmiya Sabha - later discussed the matter with Sir Hyde East, Chief Justice of the Supreme Court. ", "That led to the foundation of Hindu College, later renamed Presidency College, Kolkata, on 20 January 1817.", "\n\nThereafter, David Hare was instrumental in establishing the School Book Society on 6 May 1817. ", "It took the initiative to print and publish text books in both English and Bengali. ", "This society contributed substantially to the flowering of the Bengal Renaissance.", "\n\nOn 1 September 1818, he established the Calcutta School Society. ", "He and Radhakanta Deb were secretaries of the society. ", "He worked tirelessly to establish some schools to teach in English and Bengali, according to new methods of teaching, at such places as Thanthania, Kalitala and Arpuly. ", "Every day, he visited the schools and Hindu College and met almost every student. ", "So great was his attachment and commitment to these students that it acted as a great inspiration of many of them. ", "Some of the greatest names in subsequent years were all his students. ", "It was much later that Alexander Duff or Henry Louis Vivian Derozio came on the scene and influenced the course of events.", "\n\nAdditionally, David Hare was a subscriber to the Ladies' Society for Native Female Education (formed in 1824), and would be present in the periodical examinations held by the society.", "\n\nLater life\nIn later life, he did not find time to devote to his watch business and so he sold it to a friend named Grey and spent some of the money to buy a small house for himself and the rest for the development of the schools. ", "After a long life of activity he fell ill. ", "He was attacked by cholera. ", "One of his students, Dr. Prasanna Kumar Mitra, tried his best but all efforts failed and David Hare died on 1 June 1842. ", "As news spread around the city, a pall of gloom spread over the city. ", "The Christian missionaries refused to allot him land in their cemeteries, as they thought that he was a non-believer. ", "He was buried in what was then the compound of Hare School-Presidency College that he had donated. ", "The tomb, marked with a bust statue, currently falls within the College Square (recently renamed Vidyasagar Udyan) swimming pool, opposite to Hare School.", "\n\nAccording to Sivanath Sastri, “As his body was brought out of Mr. Gray’s house, thousands of people, some in vehicles, others on foot, followed it. ", "The scene that was witnessed by Kolkata on that day will not be witnessed again. ", "Right from Bowbazar crossing to Madhab Dutta’s bazaar, the entire road was flooded with people.”", "\n\nThe road where he lived, is called Hare Street, just off Binoy-Badal-Dinesh Bagh (earlier Dalhousie Square). ", "A life-size statue (pictured) was built with public donations and placed in the compound of Hare School.", "\n\nFurther reading \n Reverend Krishnamohan Bandyopadhyaya (in Bengali) by Mayukh Das, Kolkata:Paschimbanga Anchalik Itihas O Loksanskriti Charcha Kendra (2014) \n \"A biographical sketch of David Hare\" by Peary Chand Mittra. ", "\n Ramtanu Lahiri O Tatkalin Banga Samaj in Bengali by Sivanath Sastri (English Translation)\n\nReferences\n\nExternal links\n \n\nCategory:1775 births\nCategory:1842 deaths\nCategory:Scholars from Kolkata\nCategory:Bengali educators\nCategory:Founders of Indian schools and colleges\nCategory:Sheriffs of Kolkata\nCategory:18th-century Indian educators\nCategory:19th-century Indian educators\nCategory:Presidency University, Kolkata" ]

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

[ 0.0006171789136715233, 0.0006649059359915555, 0.0006624034722335637, 0.0006836831453256309, 0.0007954376633279026, 0.0020449687726795673, 0.008097704499959946, 0.0008742272621020675, 0.0006350196781568229, 0.0005958293913863599, 0.0007534788455814123, 0.0005772765725851059, 0.0006478716968558729, 0.0006619607447646558, 0.0006084527121856809, 0.0005883608828298748, 0.0006706013227812946, 0.0007214915822260082, 0.0009406825411133468, 0.0006819652044214308, 0.0006960989558137953, 0.0005566420149989426, 0.0006548208184540272, 0.0006217574700713158, 0.0007923016673885286, 0.0009481518645770848, 0.018725425004959106, 0.0014277433510869741, 0.002203326905146241, 0.0006565483054146171, 0.005160070955753326, 0.0007793641998432577, 0.0007871834677644074, 0.0009435050887987018, 0.0006224521202966571, 0.0014030240708962083, 0.0008172986563295126, 0.0007029176340438426, 0.0006741301040165126, 0.0006153850699774921 ]

[ "Complete nucleotide sequence and experimental host range of Okra mosaic virus.", "\nOkra mosaic virus (OkMV) is a tymovirus infecting members of the family Malvaceae. ", "Early infections in okra (Abelmoschus esculentus) lead to yield losses of 12-19.5%. ", "Besides intensive biological characterizations of OkMV only minor molecular data were available. ", "Therefore, we determined the complete nucleotide sequence of a Nigerian isolate of OkMV. ", "The complete genomic RNA (gRNA) comprises 6,223 nt and its genome organization showed three major ORFs coding for a putative movement protein (MP) of M r 73.1 kDa, a large replication-associated protein (RP) of M r 202.4 kDa and a coat protein (CP) of M r 19.6 kDa. ", "Prediction of secondary RNA structures showed three hairpin structures with internal loops in the 5'-untranslated region (UTR) and a 3'-terminal tRNA-like structure (TLS) which comprises the anticodon for valine, typical for a member of the genus Tymovirus. ", "Phylogenetic comparisons based on the RP, MP and CP amino acid sequences showed the close relationship of OkMV not only to other completely sequenced tymoviruses like Kennedya yellow mosaic virus (KYMV), Turnip yellow mosaic virus (TYMV) and Erysimum latent virus (ErLV), but also to Calopogonium yellow vein virus (CalYVV), Clitoria yellow vein virus (CYVV) and Desmodium yellow mottle virus (DYMoV). ", "This is the first report of a complete OkMV genome sequence from one of the various OkMV isolates originating from West Africa described so far. ", "Additionally, the experimental host range of OkMV including several Nicotiana species was determined." ]

{ "pile_set_name": "PubMed Abstracts" }

[ 0.0007039264892227948, 0.0030773980543017387, 0.0006518522277474403, 0.0005480750114656985, 0.0005674923304468393, 0.0006323264096863568, 0.0007114242180250585, 0.0007607812294736505, 0.0005979180568829179, 0.0005712343263439834 ]

[ "What are Moovly partners?", "\n\nCan someone else make a video for me? (", "Moovly Studio)\n\nWritten by Chana Van Ryzeghem Updated over a week ago\n\nAlthough Moovly is meant to be a user-friendly platform and we want to enable everyone to create blended content in a simple and intuitive way, we sometimes receive requests from users seeking professional help.", "\n\nOur users range from single users, education, small to medium business to large brands and corporations. ", "All of them have different needs and types of projects, so these types of requests can vary and we rely on our Moovly partners to handle these.", "\n\nOnce a certain request comes in, we refer them to one or some of our partners. ", "At that point, the partner is in direct contact with the Moovly user to set up the project, make arrangements, agree on pricing and deliverables." ]

{ "pile_set_name": "Pile-CC" }

[ 0.001086824107915163, 0.0010565423872321844, 0.0005938802496530116, 0.0005805679829791188, 0.0006270075682550669, 0.0005204666522331536, 0.0005998268024995923 ]

[ "<?", "xml version=\"1.0\" encoding=\"UTF-8\"?", ">\n<mime-info xmlns=\"http://www.freedesktop.org/standards/shared-mime-info\">\n <mime-type type=\"text/x-csharp\">\n <comment xml:lang=\"en\">C# source</comment>\n <glob pattern=\"*.cs\"/>\n </mime-type>\n <mime-type type=\"text/x-msil\">\n <comment xml:lang=\"en\">IL source</comment>\n <glob pattern=\"*.il\"/>\n </mime-type>\n <mime-type type=\"text/x-nemerle\">\n <comment xml:lang=\"en\">Nemerle source</comment>\n <glob pattern=\"*.n\"/>\n </mime-type>\n <mime-type type=\"text/x-vb\">\n <comment xml:lang=\"en\">VB source</comment>\n <glob pattern=\"*.vb\"/>\n </mime-type>\n <mime-type type=\"text/x-js\">\n <comment xml:lang=\"en\">JScript source</comment>\n <glob pattern=\"*.js\"/>\n </mime-type>\n <mime-type type=\"application/x-aspx\">\n <comment xml:lang=\"en\">ASP.NET page</comment>\n <glob pattern=\"*.aspx\"/>\n </mime-type>\n <mime-type type=\"application/x-ashx\">\n <comment xml:lang=\"en\">ASP.NET handler</comment>\n <glob pattern=\"*.ashx\"/>\n </mime-type>\n <mime-type type=\"application/x-ascx\">\n <comment xml:lang=\"en\">ASP.NET user control</comment>\n <glob pattern=\"*.ascx\"/>\n </mime-type>\n <mime-type type=\"application/x-asix\">\n <comment xml:lang=\"en\">ASP.NET image generator</comment>\n <glob pattern=\"*.asix\"/>\n </mime-type>\n <mime-type type=\"application/x-axd\">\n <comment xml:lang=\"en\">ASP.NET handler</comment>\n <glob pattern=\"*.axd\"/>\n </mime-type>\n <mime-type type=\"application/x-web-config\">\n <comment xml:lang=\"en\">ASP.NET web config</comment>\n <glob pattern=\"web.config\"/>\n </mime-type>\n <mime-type type=\"application/x-machine-config\">\n <comment xml:lang=\"en\">Mono machine config</comment>\n <glob pattern=\"machine.config\"/>\n </mime-type>\n <mime-type type=\"application/x-config\">\n <comment xml:lang=\"en\">Mono application config</comment>\n <glob pattern=\"*.config\"/>\n </mime-type>\n <mime-type type=\"application/x-master-page\">\n <comment xml:lang=\"en\">ASP.NET master page</comment>\n <glob pattern=\"*.master\"/>\n </mime-type>\n <mime-type type=\"application/x-resources\">\n <comment xml:lang=\"en\">resources bundle</comment>\n <glob pattern=\"*.resources\"/>\n </mime-type>\n <mime-type type=\"application/x-resourcesx\">\n <comment xml:lang=\"en\">resx bundle</comment>\n <glob pattern=\"*.resx\"/>\n </mime-type>\n <mime-type type=\"application/x-remoting\">\n <comment xml:lang=\"en\">remoting handler</comment>\n <glob pattern=\"*.rem\"/>\n </mime-type>\n <mime-type type=\"application/x-soap-remoting\">\n <comment xml:lang=\"en\">soap remoting handler</comment>\n <glob pattern=\"*.soap\"/>\n </mime-type>\n <mime-type type=\"application/x-asmx\">\n <comment xml:lang=\"en\">ASP.NET web service</comment>\n <glob pattern=\"*.asmx\"/>\n </mime-type>\n <mime-type type=\"application/x-prjx\">\n <comment xml:lang=\"en\">SharpDevelop project</comment>\n <glob pattern=\"*.prjx\"/>\n </mime-type>\n <mime-type type=\"application/x-cmbx\">\n <comment xml:lang=\"en\">SharpDevelop solution</comment>\n <glob pattern=\"*.cmbx\"/>\n </mime-type>\n <mime-type type=\"application/x-mdsx\">\n <comment xml:lang=\"en\">SharpDevelop solution extension</comment>\n <glob pattern=\"*.mdsx\"/>\n </mime-type>\n <mime-type type=\"application/x-mdp\">\n \t<sub-class-of type=\"text/plain\"/>\n <comment xml:lang=\"en\">MonoDevelop project</comment>\n <glob pattern=\"*.mdp\"/>\n </mime-type>\n <mime-type type=\"application/x-mds\">\n \t<sub-class-of type=\"text/plain\"/>\n <comment xml:lang=\"en\">MonoDevelop solution</comment>\n <glob pattern=\"*.mds\"/>\n </mime-type>\n <mime-type type=\"application/x-csproj\">\n \t<sub-class-of type=\"text/plain\"/>\n <comment xml:lang=\"en\">Visual Studio .NET C# project</comment>\n <glob pattern=\"*.csproj\"/>\n </mime-type>\n <mime-type type=\"application/x-vbproj\">\n \t<sub-class-of type=\"text/plain\"/>\n <comment xml:lang=\"en\">Visual Studio .NET VB.NET project</comment>\n <glob pattern=\"*.vbproj\"/>\n </mime-type>\n <mime-type type=\"application/x-sln\">\n \t<sub-class-of type=\"text/plain\"/>\n <comment xml:lang=\"en\">Visual Studio .NET Solution</comment>\n <glob pattern=\"*.sln\"/>\n </mime-type>\n <mime-type type=\"application/x-disco\">\n <comment xml:lang=\"en\">Static Discovery File</comment>\n <glob pattern=\"*.disco\"/>\n </mime-type>\n <mime-type type=\"application/x-asax\">\n <comment xml:lang=\"en\">ASP.NET Global Application Class</comment>\n <glob pattern=\"*.asax\"/>\n </mime-type>\n <mime-type type=\"application/x-wsdl\">\n <comment xml:lang=\"en\">Webservices Description File</comment>\n <glob pattern=\"*.wsdl\"/>\n </mime-type>\n</mime-info>\n" ]

{ "pile_set_name": "Github" }

[ 0.0009998893365263939, 0.0006191950524225831, 0.0011151103535667062 ]