Datasets:

nickypro
/

minipile

Dataset card Viewer Files Files and versions Community

Split (3)

train · 80k rows

text stringlengths 0 1.59M	meta dict
Q: Math History books I'm teaching a course over the summer (it's a sort of make-your-own course for non-majors) and I'm planning on organizing it as a math history course, hitting on major threads through about 1900, and focusing on the evolution of ideas and on people, rather than on the details of proofs. I've also been having a lot of trouble finding a good book covering this material (none finding books on ancient mathematics, but I want to focus on Renaissance to 19th Century, if possible), and so, here's my question: What would be a good textbook for a course of this nature? Specifically, for a math history course targeted at non-science majors. A: I'm pleased to hear that some MOers like my book, but I have to say that I think it has too much math for a class of non-science majors. At best, you might mine it for some homework problems because other, more suitable, books tend to be lacking in that department. Here are a few I would recommend. A Concise History of Mathematics by Dirk J. Struik. This is an oldie but goodie, a very readable blend of mathematics with general history, written by a distinguished historian of math. Unfortunately, no exercises. Math through the Ages by W.P. Berlinghoff & F.O. Gouvea. Also a good blend of math with general history. The math is fairly low-level -- high-school and early undergrad -- but treated from an enlightened point of view. The Honors Class by Ben Yandell. Like Bell's Men of Mathematics, this is a very readable set of biographical essays on mathematics. Since it is organized around the Hilbert problems, it starts roughly where Bell leaves off. Also, it is more factually accurate than Bell. A: Here are three possibilities. You'll have to judge if they will be accessible to non-science majors. Mathematics and Its History by John Stillwell. Since Stillwell is on MO, perhaps he can say more on this book. Mathematical Expeditions: Chronicles by the Explorers, by Reinhard Laubenbacher and David Pengelley. It covers geometry, set theory, analysis, number theory, and algebra. Mathematical Masterpieces: Further Chronicles by the Explorers, by Art Knoebel, Reinhard Laubenbacher, Jerry Lodder, and David Pengelley. A history of math class was taught in my department a few years ago using the second book above. I covered for the instructor once and looked at the book. It seemed nice. I have not looked at the third book, but discovered it right now on amazon as a follow up to the second book, so I threw it on the list (but think carefully about how non-science students would respond to the last chapter if you were seriously considering the third book). A: It's hard to teach anything at all even as far back as the 18th century about the history of mathematics to students with little math backgroound (or motivation), but one option is to emphasize a "great theorems" approach starting with ancient times. A popular and very inexpensive paperback by W.W. Dunham Journey through Genius might be useful (or not) for your course once you get past the title. Some of us at UMass found it reasonable as a resource for an ill-defined university requirement in "junior year writing" for prospective math majors, since the early chapters of Dunham require little background and provide some research/writing/presentation possibilities. You'd find the approach of Laubenbacher, Pengelley, and colleagues quite different and probably more demanding, since they try to get back to original sources. In any case, Stillwell has provided a good option for history which should be considered.	{ "pile_set_name": "StackExchange" }
Q: iOS -- Calling contentsOfDirectoryAtPath leaks memory in loop I'm not well versed in objective-c, so forgive me if this is a stupid question. I've created a background thread to parse a list of files that exists in a directory, where the files in the directory can change at any time. I call "contentsOfDirectoryAtPath" in every iteration of the loop, and my allocations suddenly go over 300mb. I can't figure out how to get ARC to release the returned array. Can someone maybe point me in the right direction here? -(void) offlineModeThread { NSString dataDir = [ViewController getDataDirectory]; NSFileManager nfm = [NSFileManager defaultManager]; while(1) { NSArray files = [nfm contentsOfDirectoryAtPath:dataDir error:nil]; / if(files == nil) break; if([files count] <= 0) { files = nil; [NSThread sleepForTimeInterval: 5.0f]; continue; } if(![ViewController obtainLock]) { files = nil; continue; } / //[ViewController releaseLock]; files = nil; } } As you can see, i've tried releasing the array by setting 'files' to nil, but it doesn't work. A: how are you creating this thread? NSThread? NSOperation and NSOperationQueue? GCD? For NSThread and NSOperation, you're supposed to create your own autorelease pool as part of setting up the thread. That way temporary objects get managed correctly within that thread. I believe GCD takes care of this detail for you. In newer versions of Objective C (Objective C 2.0, I believe) you should use the new syntax @autoreleasepool { //Code to use a local autorelease pool } For loops that generate a ton of temporary objects, you can create a local autorelease pool for any block of code. You could refactor your code like this: while(1) { @autoreleasepool { NSArray files = [nfm contentsOfDirectoryAtPath:dataDir error:nil]; /* if(files == nil) break; if([files count] <= 0) { files = nil; [NSThread sleepForTimeInterval: 5.0f]; continue; } if(![ViewController obtainLock]) { files = nil; continue; } */ //[ViewController releaseLock]; files = nil; } } That would cause it to create a new autorelease pool for each iteration of the loop, and drain it at the end (thus releasing all temporary objects created in that iteration.) By the way, if you're using NSThread, don't. Learn how to use GCD instead. GCD (Grand Central Dispatch) makes MUCH more efficient use of system resources than NSThread. NSThread is based on POSIX threads, which are very expensive to create, and tie up physical memory on the device for the life of your application. NSOperationQueues have been refactored in recent OS versions to use GCD under the covers, so they are similarly efficient internally, although harder to use than GCD for most things.	{ "pile_set_name": "StackExchange" }
ose -4 = -w + 2. Suppose 2f - 4h - w = 0, -4f - 4h = -0f - 24. Sort -2, f, -1/3. -2, -1/3, f Let a(l) = -l - 2. Let u be a(0). Suppose -4w + 1 + 7 = 0. Sort w, u, 3. u, w, 3 Let x = 4.3 - 8. Sort -2/5, 4, x in increasing order. x, -2/5, 4 Suppose -6c - 6 + 18 = 0. Sort c, -4, 7. -4, c, 7 Let b be (-6)/(-9) - 76/6. Let o = b - -27. Suppose o = 2n + 3n. Put -4, n, 4 in ascending order. -4, n, 4 Let f be 0 + -2 - (-2 + 1). Let i = 8 + -6. Let l be (-2)/(-3) - 17/3. Sort l, i, f in decreasing order. i, f, l Suppose 2t + 7 = 5. Put 3, -5, t, -6 in descending order. 3, t, -5, -6 Let m = -173 + 173. Put m, 5, -3 in ascending order. -3, m, 5 Let z = -5 + 7. Let l = z + -6. Put 3, l, 1 in decreasing order. 3, 1, l Suppose o = 3d + 1, 5o + d + 2d - 5 = 0. Sort 7, 0.1, o, -0.4 in descending order. 7, o, 0.1, -0.4 Let j = 40.31 + -40. Let x = -0.01 + j. Let t = -2 + 3. Sort t, x, 2. x, t, 2 Let s = 13 + -24. Let o = -14 - s. Sort o, 1, 2 in descending order. 2, 1, o Suppose -2d = d - 9. Sort d, -5, -1, 5 in increasing order. -5, -1, d, 5 Let o = -0.14 + 0.54. Let b = 20 - 20.1. Put -6, b, o in ascending order. -6, b, o Let b(q) = -q*2 + 5q + 3. Let p be b(6). Suppose 2r + 9 + 11 = 4h, -35 = -5h + 5r. Let k = p + h. Sort 5, k, -1. -1, k, 5 Suppose -2 = -l + 1. Suppose -la - 25 = -4z + 7, z - 21 = 4a. Let i(m) = -m2 - 3m + 2. Let t be i(a). Sort 2, t, 3. t, 2, 3 Suppose 2d + 2d - 20 = 0, -3m - 5d + 37 = 0. Put 5, 0, m in decreasing order. 5, m, 0 Suppose -3g + 31 = 5k, 6g + 24 = 4k + 8g. Sort k, -29, 1. -29, 1, k Let v be 64/2721/2. Let t be -1 + 0 + (-5)/(-7). Sort v, 0.1, t in decreasing order. v, 0.1, t Let a = -17 - -29. Suppose 0o + 2o - z = -7, -a = 4z. Put 3, 1, o in descending order. 3, 1, o Let b(j) = 6j*2 + 2j + 1. Let c be b(-1). Suppose 2x - 4x + 6 = -2i, -2x = 3i - 11. Sort 3, c, i. i, 3, c Suppose -f - 20 = 4f. Let r = 2 - 1. Let b = -2/45 + 4/9. Put b, r, f in decreasing order. r, b, f Suppose x + 0b = 5b + 10, -2x + 4b + 2 = 0. Suppose 3w + q + 1 = 7w, 5w - 2q - 5 = 0. Sort 2, w, x in decreasing order. 2, w, x Let r = -3 - -8. Let w be r5/((-50)/(-32)). Let l = -11 + w. Sort -0.2, 2, l in ascending order. -0.2, 2, l Let t = 0 + -5. Let j be 1 + 239/(-60). Sort -0.2, j, t in ascending order. t, j, -0.2 Let v = 22.98 + -23. Sort -5, v, -1/11 in ascending order. -5, -1/11, v Suppose -4q + 20 = 0, 0 = 4w - 5q + 9 - 0. Suppose 0 = t + wj - 8, -3t + 13 = -t + 5j. Suppose -19 = 3p - 4. Put p, t, -1 in descending order. t, -1, p Let r(b) = b3 - 8b*2 - 6b - 12. Let o be r(9). Let d be (-26)/(-5) + (-3)/o. Put -5, d, -3 in decreasing order. d, -3, -5 Let c = -31 + 30.8. Let m = 0.7 + -0.2. Sort 1/8, m, c in decreasing order. m, 1/8, c Let q(y) = -y*2 - 4y + 2. Suppose 2o + 2p + 9 = -5, -2o - 4 = -3p. Let f be q(o). Suppose 100 = 17j + 3j. Sort j, 2, f in decreasing order. j, 2, f Let l be 1 + ((-4)/1 - 1). Sort -1, l, 2 in increasing order. l, -1, 2 Let l(q) = -2q - 3. Let v be l(-4). Let o(s) = -3s3 - s2 - 2s - 1. Let u be o(-1). Let c = -3 + u. Put c, v, 1 in decreasing order. v, 1, c Let n = 0.13 - 4.13. Put 2/11, -0.2, n in increasing order. n, -0.2, 2/11 Let u = 11904889 - 15869214233/1333. Let t = u - 96/43. Let v = 43/93 + t. Put 5, v, -3 in descending order. 5, v, -3 Let r be (1/(-17))/(3/(-6)). Let i(h) = 3h*3 + 2h*2 - 1. Let q be i(-1). Let x = q - -7. Sort r, x, 0.4 in increasing order. r, 0.4, x Let g be ((-9)/(-24))/(126/(-1304)). Let c = -25/6 - g. Let s = -16 - -210/13. Put c, s, -0.3 in ascending order. -0.3, c, s Suppose 0k = 3a + 3k, -2k = 5a - 15. Put a, -6, 1 in increasing order. -6, 1, a Let c(s) = 4s. Let k be c(1). Suppose v = -4v. Let o(j) = -j - 5. Let g be o(-8). Sort k, g, v in descending order. k, g, v Let t = -215/3 - -70. Put 2, 14, t in decreasing order. 14, 2, t Suppose m - 5m + 2s - 2 = 0, -5m + 5s + 5 = 0. Let z be (0 + -6)/((-3)/m). Suppose 2w = -p + 1, -2w = -0w + 4. Put z, 4, p in ascending order. z, 4, p Let f(z) = 2z3 + z2. Let a be f(1). Suppose u - 8 = -a. Let t = -6 + 3. Sort u, -1, t in descending order. u, -1, t Suppose -50 = 5r - 8c + 5c, 0 = r - c + 10. Let f be 14/70 - 48/r. Sort -3, f, 0.3 in increasing order. -3, 0.3, f Let k = -3.24 - -0.24. Sort -1/10, k, 1 in ascending order. k, -1/10, 1 Let v(a) = a3 + 46a*2 - 51a - 192. Let t be v(-47). Suppose -3d - 20 = 4. Let s be d/(-3) - 1/(-3). Sort t, -5, s in ascending order. -5, t, s Suppose -20 - 16 = 4q. Let n = q + 14. Let v(o) = o + 1. Let a be v(-4). Sort 2, n, a in descending order. n, 2, a Let p = 0.8 + 2.2. Let a be (-30)/(-9)54/(-45). Put 0.5, p, a in decreasing order. p, 0.5, a Suppose -5l - 11 = -31. Suppose 0 = 2z - 6z + 12. Suppose -15 = -5o, -2o = -2k - 3o - 1. Sort z, l, k in descending order. l, z, k Let v = 8 - 7.6. Put 4, -3, v in descending order. 4, v, -3 Suppose 0w = 5z - 5w + 25, 22 = -5z + 2w. Let d = -0.12 + 6.12. Let y = 5.6 - d. Sort 0.1, y, z in decreasing order. 0.1, y, z Let z = 5.7 - 10.7. Put -3, z, -6 in decreasing order. -3, z, -6 Suppose -v - 36 = -5v - 4b, 4v = -b + 30. Let g be (1 - -1)1 - v. Let a(s) = s - 7. Let z be a(5). Sort z, -4, g in increasing order. g, -4, z Let r = 24 + -23. Let p = r + 0. Put p, 5, 2 in descending order. 5, 2, p Let a = -6 - -4. Let t = 443/45 - 94/9. Sort a, 0.1, t in ascending order. a, t, 0.1 Let m(t) = t2 - 3t - 6. Let v be m(-3). Sort v, -4, -2 in descending order. v, -2, -4 Let l = 58.5 + -59. Sort -1/16, l, -2/5. l, -2/5, -1/16 Suppose 0 = -2n + r - 5, -5r + 27 - 2 = 5n. Sort 5, n, -3 in descending order. 5, n, -3 Let b(i) = i3 - 9i*2 + 4. Let q be b(9). Put 1, -3, 5, q in decreasing order. 5, q, 1, -3 Suppose r - 2a = -38, -2a = -4r + 8r + 102. Let z = r - -31. Sort z, 4, 6. z, 4, 6 Let d = -11.3 - -12. Let a = d + -0.7. Put 5, -0.4, a in descending order. 5, a, -0.4 Let v be -2 - ((-2 - -1) + -5). Suppose q + v = -2. Let c = 8 + q. Sort c, -2/9, -0.3 in increasing order. -0.3, -2/9, c Let r be (-31)/8 + 1 + 3. Let q = -7.1 - -7. Let t = 0.3 + -0.2. Sort r, q, t in ascending order. q, t, r Let x = 66 - 65. Let l(w) = 3w*3 - 2w + 1. Let u be l(1). Put u, 0, x in ascending order. 0, x, u Let v = 207 - 212. Sort 45, -2, v, -4 in decreasing order. 45, -2, -4, v Suppose -4i = -4g, -2i = 1 + 1. Let d = 1.33 + -1.4. Let p = 0.13 - d. Put p, g, 2/7 in ascending order. g, p, 2/7 Suppose m = 2m - 4. Let o be (0/1)/3 - m. Sort o, 5, 1 in descending order. 5, 1, o Let c be 1/((4/6)/(-2)). Let o(f) = f*2 + 8f + 2. Let v be o(-8). Let n be 11/v + 2/(-4). Sort c, n, -4 in increasing order. -4, c, n Let k(q) = -5q - 5 + 0q*2 + 5q*2 + 0q - 6q2. Let j be k(-4). Put -3, -1/3, j in descending order. -1/3, j, -3 Suppose w - 2 = -6. Let y be 2/8 - 2/w. Sort 3, y, -4/9 in descending order. 3, y, -4/9 Let k be (1 - 1)/((-8)/(-4)). Let b be (k - -1)/(6/24). Put 1/3, 1, b in ascending order. 1/3, 1, b Suppose v - t = -4v - 23, -12 = 2v + t. Put 1, 13, v in increasing order. v, 1, 13 Let q be ((-1)/(-18))/((-2)/4). Let n be 46 - 47 - (-5)/1. Sort -2, n, q in descending order. n, q, -2 Let c = -88 + 80.8. Let l = -7 - c. Sort 3/2, -3, l in increasing order. -3, l, 3/2 Let y be ((-48)/21 - -2)-7. Sort -5, y, -4 in increasing order. -5, -4, y Let j = -4 + 7. Sort -2/33, j, 1. -2/33, 1, j Let c = 1 + -1. Suppose c = -2y + 6y. Put -2, y, -0.1 in descending order. y, -0.1, -2 Let h = 21 + -20. Put h, 2, -3 in decreasing order. 2, h, -3 Let u = -31 - -31.23. Let c = u - 0.13. Sort 6, -4, c in descending order. 6, c, -4 Let u(a) = -2a + 2. Let o be u(-8). Let l be (o/(-12))/(6/(-8)). Put -1, 1, l in decreasing order. l, 1, -1 Let q be (-1 - 0)/(7/14). Sort -12, 3, q in decreasing order. 3, q, -12 Let a(x) = x3 + x2 + 1. Suppose 4 = 2f - 4f. Let d be a(f). Sort d, 5, 2 in increasing order. d, 2, 5 Suppose 3v + 7 = -z + 3z, 0 = 5z + 2v - 8. Suppose -4 = 2u + 2. Sort z, -4, u in decreasing order. z, u, -4 Let g(p) = p*2 + 7p + 6 - 2 - 3. Let t be g(-7). Put 4, 0, t in decreasing order. 4, t, 0 Suppose -3d = d. Let m(f) = 2f*3 - 4f*2 + 2f. Let q be m(2). Put q, -4, d in ascending order. -4, d, q Let k = 33 - 37. Put k, 0.3, 5 in	{ "pile_set_name": "DM Mathematics" }
351 U.S. 79 (1956) AMERICAN AIRLINES, INC. v. NORTH AMERICAN AIRLINES, INC., ET AL. No. 410. Supreme Court of United States. Argued March 6-7, 1956. Decided April 23, 1956. CERTIORARI TO THE UNITED STATES COURT OF APPEALS FOR THE DISTRICT OF COLUMBIA CIRCUIT. Howard C. Westwood argued the cause for petitioner. With him on the brief was J. Randolph Wilson. Walter J. Derenberg argued the cause for North American Airlines, Inc., respondent. With him on the brief was Hardy K. Maclay. 80 Solicitor General Sobeloff, Assistant Attorney General Barnes, Daniel M. Friedman, Franklin M. Stone, O. D. Ozment and Gerald F. Krassa filed a brief for the Civil Aeronautics Board, respondent. MR. JUSTICE MINTON delivered the opinion of the Court. Twentieth Century Airlines, Inc., was issued a letter of registration as a large irregular air carrier by the Civil Aeronautics Board in 1947. For some reason, beginning in 1951 it conducted its business under the name of North American Airlines. On March 3, 1952, it amended its articles of incorporation so as legally to change its name to North American Airlines, Inc. By letter dated March 11, 1952, it requested the C. A. B. to reissue its letter of registration in the new corporate name. The Board took no action on that request, but rather, in August 1952, adopted an Economic Regulation requiring every irregular carrier after November 15, 1952, to do business in the name in which its letter of registration was issued. 14 CFR § 291.28. The Board explained that under the Regulation it would allow continued use of a different name to which good will had become attached, except where use of such name constitutes a violation of § 411 of the Civil Aeronautics Act, 52 Stat. 1003, as amended, 66 Stat. 628, 49 U. S. C. § 491, which prohibits unfair or deceptive commercial practices and unfair methods of competition. 17 Fed. Reg. 7809. On October 6, 1952, respondent applied for permission to continue use of its name, "North American Airlines." Petitioner, American Airlines, on October 17, 1952, filed a memorandum with the Board requesting denial of North American's application for the reasons, among others, that use of the name "North American" infringed upon its long-established trade name, "American," and constituted an unfair method of competition in violation of § 411 of 81 the Act. The Board, as authorized by § 411, on its own motion instituted an investigation and hearing into whether there was a violation of § 411 by North American. It consolidated with that proceeding an investigation and hearing into the matter of North American's application for change of name in its letter of registration. American was granted leave to intervene in the consolidated proceeding. After extensive hearings, the Board found that respondent's use of the name "North American" in the air transportation industry, in which it competed with American, had caused "substantial public confusion," which was "likely to continue" and which constituted "an unfair or deceptive practice and an unfair method of competition within the meaning of Section 411." Docket Nos. 5774 and 5928 (Nov. 4. 1953), 14-15 (mimeo). It found that the public interest required elimination of the use of the name, and accordingly it denied the application of North American and ordered it to "cease and desist from engaging in air transportation under the name `North American Airlines, Inc.,' `North American Airlines,' `North American,' or any combination of the word `American.' " Id., at 15-16. On petition for review by North American, the Court of Appeals for the District of Columbia set aside the Board's order. 97 U. S. App. D. C. 85, 228 F. 2d 432. American, having been admitted as a party below by intervention, sought, and we granted, certiorari. 350 U. S. 894. As we understand its opinion, the Court of Appeals set aside the order because the public interest in this proceeding was inadequate to justify exercise of the Board's jurisdiction under § 411. Although the court was critical of the finding of "substantial public confusion," it did not, on its disposition of the case, expressly disturb that or any other of the Board's findings. For the purposes of review here, we will accept the findings, and there is no cause 82 for this Court to review the evidence. Universal Camera Corp. v. Labor Board, 340 U. S. 474, has no application in the present posture of the case before us. The questions then presented are whether confusion between the parties' trade names justified a proceeding by the Board to protect the public and whether the kind of confusion found by the Board could support a conclusion of a violation of the statute by respondent. This is a case of first impression under § 411. That section provides that "The Board may, upon its own initiative or upon complaint . . . if it considers that such action by it would be in the interest of the public, investigate and determine whether any air carrier . . . has been or is engaged in unfair or deceptive practices or unfair methods of competition in air transportation or the sale thereof." If the Board finds that the carrier is so engaged, "it shall order such air carrier . . . to cease and desist from such practices or methods of competition." Section 411 was modeled closely after § 5 of the Federal Trade Commission Act,[] which similarly prohibits "unfair methods of competition in commerce, and unfair or deceptive acts or practices" and provides for issuance of a complaint "if it shall appear to the Commission that a proceeding by it . . . would be to the interest of the public." 38 Stat. 719, as amended, 15 U. S. C. § 45. We may profitably look to judicial interpretation of § 5 as an aid in the resolution of the questions raised here under § 411. 83 It should be noted at the outset that a finding as to the "interest of the public" under both § 411 and § 5 is not a prerequisite to the issuance of a cease and desist order as such. Rather, consideration of the public interest is made a condition upon the assumption of jurisdiction by the agency to investigate trade practices and methods of competition and determine whether or not they are unfair. Thus, this Court has held that, under § 5, the Federal Trade Commission may not employ its powers to vindicate private rights and that whether or not the facts, on complaint or as developed, show the public interest to be sufficiently "specific and substantial" to authorize a proceeding by the Commission is a question subject to judicial review. Federal Trade Comm'n v. Klesner, 280 U. S. 19. See also Federal Trade Comm'n v. Keppel & Bro., Inc., 291 U. S. 304; Federal Trade Comm'n v. Royal Milling Co., 288 U. S. 212. In the Klesner case, two District of Columbia retailers, with a long history of acrimonious personal and business relations, were both operating stores called the "Shade Shop." This Court held that the public interest merely in resolving their private unfair competition dispute would not justify the Commission in issuing a complaint. The courts of law are open to competitors for the settlement of their private legal rights, one against the other. The Board, under a mandate from Congress, is charged with the protection of the public interest as affected by practices of carriers in the field of air transportation. In exercising our function of review of the Board's jurisdiction to protect the public interest by a proceeding which may be generated from facts also giving rise to a private dispute, we must take account of the significant differences between § 5 and § 411. Section 5 is concerned with purely private business enterprises which cover the full spectrum of economic activity. On the 84 other hand, the air carriers here conduct their business under a regulated system of limited competition. The business so conducted is of especial and essential concern to the public, as is true of all common carriers and public utilities. Finally, Congress has committed the regulation of this industry to an administrative agency of special competence that deals only with the problems of the industry. The practices of the competitors here clashed in a field where Congress was specifically concerned to protect the public interest. Demonstrated confusion of the public as to the origin of major air transportation services may be of obvious national public concern. The criteria which the Board employed to determine whether the confusion here created a problem of concern to the public are contained in the following quotation from its report: ". . . the record is convincing that the public interest requires this action in order to prevent further public confusion between respondent and intervenor due to similarity of names. The maintenance of high standards in dealing with the public is expected of common carriers, and the public has a right to be free of the inconveniences which flow from confusion between carriers engaging in the transportation of persons by air. The speed of air travel may well be diminished when passengers check in for flights with the wrong carrier, or attempt to retrieve baggage from the wrong carrier, or attempt to purchase transportation from the wrong carrier, or direct their inquiries to the wrong carrier. Friends, relatives or business associates planning to meet passengers or seeking information on delayed arrivals are subject to annoyance or worse when confused as to the carrier involved. The proper handling of complaints from members of the public is impeded 85 by confusion as to the carrier to whom the complaint should be presented. The transportation itself may differ from what the confused purchaser had anticipated (e. g., in terms of equipment), even though the time and place of arrival may be about the same. It is obvious that public confusion between air carriers operating between the same cities is adverse to the public interest . . . ." Docket Nos. 5774 and 5928 (Nov. 4, 1953), 12-13 (mimeo). Under § 411 it is the Board that speaks in the public interest. We do not sit to determine independently what is the public interest in matters of this kind, committed as they are to the judgment of the Board. We decide only whether, in determining what is the public interest, the Board has stayed within its jurisdiction and applied criteria appropriate to that determination. The Board has done that in the instant case. Considerations of the high standards required of common carriers in dealing with the public, convenience of the traveling public, speed and efficiency in air transport, and protection of reliance on a carrier's equipment are all criteria which the Board in its judgment may properly employ to determine whether the public interest justifies use of its powers under § 411. It is argued that respondent's use of the name "North American" cannot amount to an unfair or deceptive practice or an unfair method of competition authorizing the Board's order within § 411. "Unfair or deceptive practices or unfair methods of competition," as used in § 411, are broader concepts than the common-law idea of unfair competition. See Federal Trade Comm'n v. Keppel & Bro., Inc., supra; Federal Trade Comm'n v. Raladam Co., 283 U. S. 643, 648. The section is concerned not with punishment of wrongdoing or protection of injured competitors, but rather with protection of the public interest. See Federal Trade Comm'n v. Klesner, supra, at 27-28. 86 The courts have held, in construing § 5 of the Trade Commission Act, that the use of a trade name that is similar to that of a competitor, which has the capacity to confuse or deceive the public, may be prohibited by the Commission. Federal Trade Comm'n v. Algoma Lumber Co., 291 U. S. 67; Juvenile Shoe Co. v. Federal Trade Comm'n, 289 F. 57. And see Pep BoysManny, Moe & Jack, Inc. v. Federal Trade Comm'n, 122 F. 2d 158, where the confusing name was not that of any competitor. The Board found that respondent knowingly adopted a trade name that might well cause confusion. But it made no findings that the use of the name was intentionally deceptive or fraudulent or that the competitor, American Airlines, was injured thereby. Such findings are not required of the Trade Commission under § 5, and there is no reason to require them of the Civil Aeronautics Board under § 411. Federal Trade Comm'n v. Algoma Lumber Co., supra, at 81; Eugene Dietzgen Co. v. Federal Trade Comm'n, 142 F. 2d 321, 327; D. D. D. Corp. v. Federal Trade Comm'n, 125 F. 2d 679, 682; Gimbel Bros., Inc. v. Federal Trade Comm'n, 116 F. 2d 578, 579; Federal Trade Comm'n v. Balme, 23 F. 2d 615, 621. See also S. Rep. No. 221, 75th Cong., 1st Sess. 2. The Board had jurisdiction to inquire into the methods of competition presented here, and its evidentiary findings concerned confusion of the type which can support a finding of violation of § 411. The judgment of the Court of Appeals must therefore be reversed. However, since we do not understand the court to have decided whether the Board's findings were supported by substantial evidence on the record as a whole, the case is remanded to the Court of Appeals for further proceedings in the light of this opinion. Reversed and remanded. 87 MR. JUSTICE DOUGLAS, with whom MR. JUSTICE REED concurs, dissenting. The Court decides that a finding of "substantial public confusion" resulting from respondent carrier's use of the name "North American" constitutes a violation of § 411 of the Civil Aeronautics Act, 52 Stat. 1003, as amended, 66 Stat. 628, 49 U. S. C. § 491. If the Court held that the public confusion must be substantial enough to impairor imminently threaten to impairthe efficiency of air service, I would agree. That construction would give practical content to the phrase "substantial public confusion." The Court, however, does not require a Board finding that the confusion has diminished the efficiency of air service. There is, indeed, no such finding by the Board in this case. There is only a naked finding of "substantial public confusion" and that such confusion is "likely to continue." There is no finding that any flight was delayed because a passenger was confused; there is no finding that any passenger missed his plane because of checking in at the wrong ticket counter; there is no finding that a confused passenger boarded the wrong plane. The Board conceded that its order requiring respondent to cease and desist from using the name "North American" was "a serious sanction which necessarily involves disturbance and loss to the carrier. . . . The maintenance of high standards in dealing with the public is expected of common carriers, and the public has a right to be free of the inconveniences which flow from confusion between carriers engaging in the transportation of persons by air. The speed of air travel may well be diminished when passengers check in for flights with the wrong carrier, or attempt to retrieve baggage from the wrong carrier, or attempt to purchase transportation from the wrong carrier, 88 or direct their inquiries to the wrong carrier." Docket Nos. 5774 and 5928 (Nov. 4, 1953), 12-13 (mimeo). (Italics added.) I would not permit the Board to find a violation of § 411 so easily. We should require a finding that the confusion has actually caused some impairment of air service or that at least there is an imminent threat of such impairment. Certainly the type of confusion found here "may well" diminish the speed of air travelif it grows to such major proportions that flights are delayed and passengers begin missing flights or boarding the wrong planes. But it is mere conjecture that will ever happen as a result of respondent's use of the name "North American." The type and extent of public confusion found by the Board here would probably also be found if the Board conducted a similar inquiry into passenger confusion between Pan-American and American Airlines. It would also be surprising if the Board could not find similar confusion between Eastern and Northeast Airlines, Western and Northwest Airlines, or, if the Board had jurisdiction in the railroad industry, among Northern Pacific, Union Pacific, Western Pacific and Southern Pacific. As the dissenting member of the Board said: "Since American Airlines, Inc., carries approximately 5 1/2 million passengers each year over its system, I am not impressed with the fact that witnesses in this case (principally those employed by American Airlines itself) have testified that some confusion has existed between the services offered by American, on the one hand, and North American on the other. On the contrary, I would be greatly surprised, (in view of the several million phone calls and other communications which American Airlines receives every year over and above those received from passengers which it actually carries) if there were not some demonstrable public confusion between American 89 Airlines and the respondent in this case." Id., at 1-2 (dissenting opinion). The Court relies on the cases arising under § 5 of the Federal Trade Commission Act, 38 Stat. 719, as amended, 15 U. S. C. § 45. Federal Trade Comm'n v. Algoma Lumber Co., 291 U. S. 67; Juvenile Shoe Co. v. Federal Trade Comm'n, 289 F. 57; Pep Boys v. Federal Trade Comm'n, 122 F. 2d 158. Those cases are quite different. In each the Commission made more than a bald finding of "substantial public confusion." It found, in the Algoma Lumber case, that a substantial number of purchasers had been misled into buying something other than what they thought they were buying. 291 U. S., at 72. In the Juvenile Shoe case, the competitor took a name so similar ("Juvenile Shoe Corporation" and "Juvenile Shoe Company, Inc.") that confusion in the public mind was "inevitable." 289 F., at 58. And the Commission made a finding that the use of the word "Juvenile" caused confusion and led purchasers to believe that the goods of one company were the goods of the other company. Id., at 59. In the Pep Boys case, the court approved the following test: ". . . whether the natural and probable result of the use by petitioner of the name . . . makes the average purchaser unwittingly, under ordinary conditions purchase that which he did not intend to buy." 122 F. 2d, at 161. There are no similar findings in the instant case. There is no finding here that a passenger bought a North American ticket and flew North American under the mistaken belief that he was flying American. There is no finding that any passenger missed a plane because of the confusion. If passengers mistakenly bought North American service, believing it to be American, a finding of unfair or deceptive practices or unfair methods of competition under § 411 would be justified. That is a type of public 90 confusion quite different from the confusion found in this casereporting to the wrong ticket counter or attempting to retrieve baggage from the wrong carrier. By analogy to the § 5 cases, we have here a situation where a few prospective purchasers walked into the wrong store, but never made any purchases there. I would affirm the judgment of the Court of Appeals. NOTES [*] See Hearings before a Subcommittee of the Senate Committee on Interstate Commerce on S. 3659, 75th Cong., 3d Sess. 5; 83 Cong. Rec. 6726; Hearings before a Subcommittee of the Senate Committee on Interstate Commerce on S. 2 and S. 1760, 75th Cong., 1st Sess., Pt. 1, 74.	{ "pile_set_name": "FreeLaw" }
Joe became sick of dehydration and decided to stay home with Amy while Pete went grocery shopping for the apartment. Amy woke to see him sitting on the couch upside down, flipping through the movie channels. "You baby-sit now?" she asked yawning and plopping down next to him. He laughed and sat up properly. "Lard ass is shopping and I'm sick," he coughed and Amy patted him on the back. "Well, tell me a story," Amy said in a baby voice. "Why?" Joe whined. "You're my babysitter, right?" Amy stuck out her bottom lip and he sighed leaning into the corner of the couch. "I've noticed how Pete acts around you, so I'll tell you his story, because I think you deserve the truth to his odd behavior around /women/," Joe paused and looked over to Amy. "Ok then," she said. Joe looked around and turned off the TV. "Well, a few years ago, I was friends with Pete before we met Andy and Patrick. Pete got wrapped up in an intense relationship with this chick that I totally disapproved of named Amanda," Joe paused and Amy nodded her head, telling him to keep going. "Amanda was a high maintenance girl, wanted Pete to do everything for her, even steal booze for her wild parties. And that's when Pete got in trouble with the cops, and got his license suspended. I ended up having to help out as well, and one day I stopped," Joe smirked suddenly at Amy's facial expressions. "What happened?" she asked leaning forward. "Imagine Pete as a maid. He still did everything for her, he was so focused on his feelings for her, he didn't care that she was treating him like shit," he looked up to the ceiling. "And when she told him it was over, he went crazy, had a near over dose on anxiety pills and isolated himself, it had been two years and even though they were together, she had cheated since the first day," Amy skewed her mouth to the side and started to feel heartache for Pete. "It sucked seeing him like that. So Andy suggested that we all live together to help him out. And let me tell you, he was feeling fine," Amy interrupted him. "And then I came along," she whispered. Joe looked shocked. "It's not like that. I think you could do him good. This, you being here, is like...phase two," Amy smiled and they looked up to see Pete walk through the door. "Do you think you can help?" Pete shuffled through with four bags balanced in his arms. Joe shot up and Amy slowly took one bag and smiled at Pete. He seemed focused on something, but he smiled back. I wonder if he will start to be nice, as long I am. Chapter Fourteen-Let's Get It On A whole week later, Amy found herself best friends with Patrick. She figured she could get along with him the most and that he was the listener of the group. Joe became her buddy, as he put it for when they went partying. It was nearing the end of April and Amy woke up to shuffling in her bedroom. Joe, Andy and Pete stood in their boxers standing over Patrick's bed. She sat up suddenly and Andy placed a finger over his mouth and helped her out of bed. She ignored Pete looking over at her and glancing her up and down and joined them in whatever they were doing. Joe noticed Amy's confused look and whispered to her it was Patrick's birthday. Amy bit her lip in embarrassment from not knowing and listened in on the plan. In three seconds time, they all jumped on him and started poking him and screaming "happy birthday". Amy laughed as he fell out of bed along with the others. "That was great," Amy laughed as she leaded up against her mattress. "We need to get you a proper bed," Patrick said yawning and standing up. Amy smirked. "Forget my needs! It's your birthday! Let's party!" Amy watched as he smiled and they all filed out of the room. Patrick and Amy were left in their room to get ready. "Mind if I got ready in here?" Patrick asked as Amy made her bed, still in her underwear and cami. Patrick let his eyes travel a little low and caught himself before temptation set in.Amy and I are close enough...I wonder if...maybe it could be closer... Shaking his head he watched her turn around and hum a yes. Amy went through her bag and picked out a pair of jeans and her blue polo. Slipping her t-shirt on, she shook her hair and turned to see Patrick pulling his own t-shirt on. Amy herself let her eyes travel and bit her lip. He's a friend...right? Amy shook her head turning around again and pulling her jeans on. She grabbed her makeup and headed for the bathroom. Later that night, the gang found themselves getting ready to play twister. Andy laughed as Joe placed out the mat out and looked worried. "What?" Andy asked as Joe whimpered. He sighed. "I just think this is gonna be so weird with just one girl playing," Amy giggled as she looked around her. "Alright, so who is gonna control the spinner this round?" Andy asked. Joe rose is hand first. "There is no way I'm doing this without watching it first," Amy smiled and stood near the mat waiting for the first commandment. Many placements later, Amy found herself squished between Patrick and Pete. "Man, Amy, it looks like your having an orgy with Patrick and Pete!" Joe laughed and shouted out the next command. Before he was even finished, Amy's knees went weak and she collapsed right on top of Patrick. Andy laughed from where he landed and Amy felt Pete fall on top of her as well. Joe fell on the ground laughing and held his sides as Pete laughed as well for the first time in a while. Amy propped herself up on her elbows and blew the hair out of her face. "Well that was fun while it lasted," she smiled threw her words and looked at the clock. "It's almost midnight," Andy yawned. "And that really wore me out," Joe nodded his head. "I'm ready for bed anyways," Pete mumbled retreating to his room. Patrick hoisted Amy up and they shared a smile. She yawned on her way down to her room and collapsed on her bed.	{ "pile_set_name": "Pile-CC" }
Think big holographic surfaces: Building facades. Outdoor sculpture. Murals. Art animated by the sun and the motion of people. On towers, doors, windows, walls, ships. In subway and escalator tunnels. Instead of billboards. Anywhere the world needs to be made more interesting...	{ "pile_set_name": "Pile-CC" }
English Usage for Earnest Professionals Don’t use ‘after’ before a verb with ‘having’ in it: ‘after having written’, ‘after having eaten’, etc. Unidiomatic: ‘After having texted the message to Martha, Jack waited with bated breath for her response.’ ‘having texted’ means ‘after texting’, so ‘after’ is redundant in the sentence. Write either ‘After texting the message…’ or ‘Having texted the message…’ amidst; amongst Obliterate the useless ‘..st’ from the above words. Another similarly ugly word that appears now and then in modern communications is ‘whilst’. Doesn’t ‘while’ serve the same purpose? blatant; flagrant Often thought of as interchangeable words. ‘blatant’ is associated with noise and unpleasant sounds. ‘flagrant’ means doing something bad openly and unashamedly. ‘His flagrant vice is exceeded only by his blatant boasting of it.’ careen; career ‘careen’ means to tilt or heel over. ‘The speedboat careened sharply as it rounded the buoy.’ ‘career’ means to move uncontrollably at high speed. ‘The speeding car careered into a crowded pavement.’ deadline; dateline ‘deadline’ originally meant the line round a military prison beyond which a prisoner was liable to be shot. The whole of the 20th century was a time when corporate bosses threatened subordinates with this word to ensure they finish a task in time…or else something was going to drop dead. Join ESF in eliminating this morbid word from the English vocabulary and substituting ‘dateline’ for it. ellipsis ‘A senior-aged lady, prim and prudish, was on her way [to] or returning from church on a Sunday.’ The bracketed prepositions in such cases can be ellipsed. Definition: ellipsis [pl. ellipses] a. the omission from a sentence or other construction of one or more words that would complete or clarify the construction, as the omission of who are, while I am, or while we are from I like to interview people sitting down.b. the omission of one or more items from a construction in order to avoid repeating the identical or equivalent items that are in a preceding or following construction, as the omission of been to Paris from the second clause of I’ve been to Paris, but they haven’t.c. Printing . a mark or marks as ——, …, or * * *, to indicate an omission or suppression of letters or words. transfer ‘transfer has an idiotic system of spelling for its derivative words: ‘transferable’ or ‘transferrable’ – both are traditionally accepted as correct but ‘transferred’ and ‘transferring’ cannot be spelt ‘transfered’ and ‘transferring’. I recommend the consistent spelling: ‘transfered’, ‘transfering’ utilize ‘utilize’ is not the same as ‘use’. The writer of the following sentence has not used the right word: ‘She utilized all her savings on a new Fendi handbag.’ ‘utilize’ means ‘make good use of something that is generally not intended for that purpose’. ‘The school’s facilities may be utilized for the convenience of visitors to the carnival.’	{ "pile_set_name": "Pile-CC" }
1921 Brown Bears football team The 1921 Brown Bears football team represented Brown University during the 1921 college football season. References Brown Category:Brown Bears football seasons Brown Bears Football	{ "pile_set_name": "Wikipedia (en)" }
Timeline of cannabis law The list includes and details significant events that occurred in the global history of national-level implementations of, or changes made to, laws surrounding the use, sale, or production of the psychoactive drug cannabis. 1300s Soudoun Sheikouni, the emir of the Joneima in Arabia, outlawed the use of cannabis across his jurisdiction. Sheikouni's prohibition is one of the earliest, if not the earliest, attested cannabis bans, and so can be considered one of the world's first. 1700s 1787: Madagascar's King Andrianampoinimerina took the throne, and soon after banned cannabis throughout the Merina Kingdom, implementing capital punishment as the penalty for its use. 1800s 1800: Shortly following Napoleon's invasion of Egypt and concerned by his troops' smoking of hashish and drinking of cannabis-based beverages, he banned the drug and the establishments that provided it. 1830: The Municipal Council of Rio de Janeiro, Brazil, prohibited bringing cannabis into the city, and punishing its use by any slave. 1840: the British colony of Mauritius banned cannabis. 1861: British Guiana passed a law entitled An Ordinance to Regulate the Sale of Opium and Bhang. 1867: the British colonial government of Sri Lanka introduced the Opium and Bhang Ordinance, restricting the sale of cannabis to licensed dealers only. 1870: Natal Colony (now in South Africa) passed the Coolie Law Consolidation prohibiting: "the smoking, use, or possession by and the sale, barter, or gift to, any Coolies [Indian indentured workers] whatsoever, of any portion of the hemp plant (Cannabis sativa)..." 1870: Singapore banned cannabis. 1877: the Ottoman government in Constantinople mandated that all hashish in Egypt be destroyed, and in 1879 importation of cannabis was banned by the Khedivate of Egypt. 1890: Morocco's Sultan Hassan I instituted strict regulations on cultivation and trade, but also conferred clear cannabis production privileges on several Rif tribes. 1890: Greece banned the cultivation, importation, and use of cannabis. 1894: In British India the Indian Hemp Drugs Commission released its findings, concluding that "The moderate use practically produces no ill effects. In all but the most exceptional cases, the injury from habitual moderate use is not appreciable." 1900s 1913: Jamaica banned cannabis with the Ganja Law, supported by the white ruling class and the Council of Evangelical Churches in Jamaica 1914: British East Africa Protectorate banned cannabis. 1920: Sierra Leone banned cannabis. 1920: Mexico banned the cultivation, sale, and recreational use of cannabis. 1922: South Africa banned cannabis nationally, under the Customs and Excises Duty Act. 1923: Canada banned cannabis. 1923: Panama banned the cultivation and use of cannabis. 1924: Sudan banned the cultivation and use of cannabis. 1925: The League of Nations signs the revised International Opium Convention, for the first time adding cannabis among prohibited drugs. 1925: Trinidad and Tobago banned cannabis. 1926: Lebanon prohibited hashish. 1926: Australia banned cannabis. 1927: Indonesia banned cannabis. 1928: The United Kingdom first prohibited cannabis as a drug, in accordance with the 1925 International Opium Convention, adding cannabis as an addendum to the Dangerous Drugs Act 1920. 1928: Romania established laws for countering narcotics, including hashish and its preparations. 1934: The Irish Free State prohibited cannabis and cannabis resin with the Dangerous Drugs Act 1934. 1935: Thailand criminalized cannabis. 1937: The United States passed the Marijuana Tax Act, effectively prohibiting all use of cannabis on a federal level. 1939: Burma legalized and licensed the production and sale of cannabis. 1948: Japan adopted the Cannabis Control Law, establishing a licensing system for dealers, and punishments for unlicensed use or sale. 1951: Poland classified cannabis as a narcotic. 1953: Tunisia banned cannabis. 1953: The Netherlands criminalized cannabis. 1956: Morocco becomes independent, and banned cannabis by royal decree. 1961: The United Nations Single Convention on Narcotic Drugs decreed: "The use of cannabis for other than medical and scientific purposes must be discontinued as soon as possible but in any case within twenty-five years..." 1965: New Zealand banned cannabis under the Narcotics Act. 1966: Finland prohibited cannabis. 1968: The government of the Republic of Vietnam "publicly condemned" the use or trafficking of cannabis, and instructed local chiefs to prevent its cultivation. 1969: Iceland & Denmark banned cannabis. 1970: The United States passed the Controlled Substances Act, prohibiting cannabis federally along with several other drugs and replacing the 1937 act. 1972: The Netherlands divided drugs into more- and less-dangerous categories, with cannabis being in the lesser category. Accordingly, possession of 30 grams or less was made a misdemeanor. 1973: Nepal canceled the licenses of all cannabis shops, dealers, and farmers, under pressure from the United States and the international community. 1973: Afghanistan's King Zahir Shah outlawed cannabis production, followed by genuine commitment to eradication, backed by $47 million in funding from the United States government. 1975: Comoros' Ali Soilih seized power, and among other radical reforms to gain the support of youth, legalized cannabis in Comoros. 1976: South Korea passed the Cannabis Control Act. 1988: Paraguay decriminalized personal possession of 10 grams of cannabis or less. 1989: Bangladesh banned the sale of cannabis. 1992: Lebanon banned and eradicates cannabis, under US pressure. 1997: Poland criminalized possession of cannabis. 2000s 2001: Luxembourg decriminalized cannabis. 2001: Canada legalized medical cannabis 2001: Portugal decriminalized all drugs, including cannabis. 2003: Belgium decriminalized cannabis. 2004: The United Kingdom re-classified cannabis as a Class C (less-harmful) drug, before restoring it to Class B in 2009. 2005: Chile decriminalized cannabis. 2006: Russia reduced the limits for criminal possession of many drugs, with the criminal threshold for cannabis being reduced from 20 to 6 grams for cannabis, and 5 to 2 grams for hashish. 2006: Brazil decriminalized possession and cultivation of personal amounts of cannabis. 2008: Austria legalized medical cannabis. 2009: Mexico decriminalized possession of up to 5 grams of cannabis. 2009: Argentina decriminalized cannabis. 2010: Czech Republic reduced the penalty for small possession and up to five cannabis plants to a misdemeanor. 2011: Denmark approves several cannabis-derived drugs for medical use. 2012: Switzerland decriminalized possession of 10 grams or less to a fine. 2012: Colombia decriminalized possession of 20 grams or less. 2013: Croatia decriminalized possession of cannabis. 2013: Uruguay legalized cannabis, becoming the first country in the modern era to explicitly do so. 2013: Italy legalized medical cannabis. 2013: Romania became the tenth EU country to legalise medical cannabis. 2013: Czech Republic legalized cannabis for medical use. 2013: France legalized the sale of medications containing cannabis derivatives. 2015: Malta decriminalized cannabis. 2015: Colombia legalized medical cannabis. 2015: Croatia legalized cannabis-based drugs for specified medical purposes. 2015: Jamaica decriminalized possession of up to 2 ounces of cannabis and legalised the cultivation for personal use of up to 5 plants. 2016: Austria decriminalized possession of small amounts of cannabis. 2016: North Macedonia legalized medical cannabis. 2016: Australia legalized medicinal cannabis at the federal level. 2016: Poland legalized medical cannabis. 2016: Norway made allowances for medical cannabis. 2016: Georgia's Supreme Court ruled that imprisonment for possession of small amounts of cannabis is unconstitutional. 2017: Germany legalized medical cannabis. 2017: Cyprus legalized the medical use of cannabis oil for advanced stage cancer patients. 2017: Belize decriminalized possession or use of 10 grams or less on private premises. 2017: Greece legalized medical cannabis. 2017: Mexico legalized medical cannabis having a THC content of 1% or less. 2017: Peru legalized cannabis oil for medical use. 2017: Luxembourg legalized medical cannabis extracts. 2017: Lesotho granted modern Africa's first medical cannabis license. 2017: Georgia decriminalized cannabis. 2018: Denmark legalized cannabis-based medicines. 2018: Malta legalized medicinal cannabis with a prescription. 2018: Portugal legalized medical cannabis. 2018: Zimbabwe legalized cannabis for medical and scientific purposes. 2018: Canada legalized cannabis. 2018: Thailand legalized medical cannabis. 2018: South Africa decriminalized cannabis. 2019: Ireland legalized medical cannabis as part of a 5-year pilot program 2019: Israel decriminalized cannabis. 2020: Australian Capital Territory legalizes cannabis possession and growth for personal use See also Timeline of cannabis laws in the United States Legality of cannabis External links Cannabis general timeline. Erowid.org References Cannabis Category:History of drug control Category:Cannabis-related lists	{ "pile_set_name": "Wikipedia (en)" }
Q: Implementing MVP on a single activity with two (or multiple) fragments I'm developing a small application that shows a list, and when an item is clicked it opens a secondary screen with the item details. I want to implement MVP as my architecture for this app, and i have been struggling figuring out how to do that when I have a single activity with 2 fragments. Some questions came up as when an item from the list is clicked, a callback is sent to the first presenter, but at this point, who is in charge of opening the second fragment? do the presenters 'talk' to each other? should i do it through the activity? Been looking around for examples of single activity with multiple fragments implementing MVP, but couldn't find something like that yet. (Yes, it can be done otherwise, but the purpose of the app is to learn implementing MVP on a single activity with multiple fragments) Appreciate any help! Thanks! A: After looking into different existing MVP sample projects I've decided to follow most of the concepts in the 'TODO-MVP-TABLET' git project by Google which can be found here: https://github.com/googlesamples/android-architecture/tree/dev-todo-mvp-tablet I've chosen this solution due to the level of abstraction and the ability to later on reuse any fragment in other activities without changing any code. Solution principles: Each fragment has a presenter defined by an interface. There is a bigger presenter implementing all the smaller presenters. The bigger presenter holds references to all of the smaller presenters and when a method is invoked it simply delegates the action to the relevant presenter. Fragments are given the 'big' presenter as their presenter without actually being aware this is the case. Smaller presenters should hold the reference to the view. Diagram taken from Google's github page: Update: Link isn't valid, seems like Google removed the project from their samples. Will leave it in case they reupload it.	{ "pile_set_name": "StackExchange" }
Evaluation of left ventricular contractile performance from baseline stress-shortening data in humans: comparison with pharmacological afterload challenge. The purpose of this study was to evaluate whether the baseline stress-shortening data reflect the contractile state adequately and give results comparable to the evaluation of the end-systolic stress-shortening relationships using pharmacological manipulation of afterload. Five groups were studied (total 152 patients): a control group of 30 healthy volunteers, 32 patients after surgical correction of infantile tetralogy of Fallot, 50 patients treated for childhood malignancies with doxorubicin, 17 patients with left ventricular hypertrophy due to systemic hypertension, and 23 patients with congestive cardiomyopathy. In all patients except those with congestive cardiomyopathy, afterload was altered pharmacologically to evaluate the individual stress-shortening relationship. In all patients the baseline stress-shortening data were evaluated, as well as their relative positions to two predefined normal ranges for the relationship between end-systolic stress and shortening. Additionally, a slope value was calculated from the baseline data of the five groups studied and compared with the data obtained by pharmacological afterload increment. Our data show that the comparison of individual baseline data of end-systolic wall stress and fractional shortening with predefined normal ranges for the relationship between end-systolic stress and shortening is inadequate. The appropriate normal range to compare with is the 95% confidence interval of baseline stress-shortening data in normal subjects. Also the calculation of a slope value from the baseline stress-shortening data of a group of patients seems to be inappropriate.(ABSTRACT TRUNCATED AT 250 WORDS)	{ "pile_set_name": "PubMed Abstracts" }
Nonalcoholic fatty liver disease (NAFLD): a comprehensive review. Nonalcoholic fatty liver disease (NAFLD) is defined as fatty infiltration of the liver exceeding 5% to 10% by weight. It is a spectrum of disorders ranging from simple fatty liver (steatosis without liver injury), nonalcoholic steatohepatitis (steatosis with inflammation), and fibrosis/cirrhosis that resembles alcohol-induced liver disease but which develops in individuals who are not heavy drinkers. NAFLD is likely the most common cause of chronic liver disease in many countries. NAFLD may also potentiate liver damage induced by other agents, such as alcohol, industrial toxins and hepatatrophic viruses. The lack of specific and sensitive noninvasive tests for NAFLD limits reliable detection of the disease. It is often diagnosed on a presumptive basis when liver enzyme elevations are noted in overweight or obese individuals without identifiable etiology for liver disease, or when imaging studies suggest hepatic steatosis. NAFLD is now considered to be a component of the insulin resistance syndrome (metabolic syndrome X). Controversy exists relative to optimal recognition, diagnosis and management of these conditions, and treatment recommendations are evolving.	{ "pile_set_name": "PubMed Abstracts" }
using System; using Android.App; using Android.Content.PM; using Android.Runtime; using Android.Views; using Android.Widget; using Android.OS; namespace StepSliderDemo.Droid { [Activity(Label = "StepSliderDemo", Icon = "@drawable/icon", Theme = "@style/MainTheme", MainLauncher = true, ConfigurationChanges = ConfigChanges.ScreenSize \| ConfigChanges.Orientation)] public class MainActivity : global::Xamarin.Forms.Platform.Android.FormsAppCompatActivity { protected override void OnCreate(Bundle bundle) { TabLayoutResource = Resource.Layout.Tabbar; ToolbarResource = Resource.Layout.Toolbar; base.OnCreate(bundle); global::Xamarin.Forms.Forms.Init(this, bundle); Xamarin.FormsBook.Platform.Android.Toolkit.Init(this, bundle); LoadApplication(new App()); } } }	{ "pile_set_name": "Github" }
Q: Python запуск файла из командной строки Пытаюсь запустить файл из командной строки. таким образом: python filename.py Не запускается. Python: can't open file 'filename.py': [Errno 2] No such file or directory. Дословно от автора: Не забывайте заменять слово «python» на полный путь к исполняемому файлу интерпретатора, если переменная окружения PATH у вас не настроена. Да, если указать путь, то файл запускается. Но, если следовать логики автора, то можно и не указывать путь. Я правильно понял? То есть, если всё настроено правильно, то слово python остается и через пробел пишем имя файла с расширением .py. Вот мои настройки переменной окружения PATH: C:\Python35\Scripts\;C:\Python35\ Именно по этому пути питон и находится. A: Вам необходимо перейти в папку со скриптом. (Пример: cd C:\\Projects\py\Project1, где полный путь до скрипта C:\\Projects\py\Project1\filename.py) Затем вписать вашу команду. (python filename.py ) Также есть 2-той вариант. Надо указать абсолютный путь до файла. (Пример: python "C:\\Projects\py\Project1\filename.py" Кавычки нужны если в пути есть пробелы)	{ "pile_set_name": "StackExchange" }
Cardiopulmonary evidence of exercise-induced silent ischaemia. Exercise-induced ST changes, suggestive of cardiac ischaemia, are found in asymptomatic patients. Gas exchange kinetics were studied during exercise to help to separate patients affected by epicardial coronary disease from those without. Forty-eight patients, without angina symptoms and showing significant changes of ST during exercise, underwent a coronarography and maximal cardiopulmonary exercise test. Thirty-five healthy individuals of matched age and sex underwent a cardiopulmonary exercise test as controls. Patients were grouped according to the presence (group 1, n = 35) or the absence (group 2, n = 13) of significant coronary lesions at angiography. When corrected for predicted oxygen consumption (VO2) at peak exercise and at anaerobic threshold, results showed a low VO2 at peak exercise and anaerobic threshold in group 1 (68 +/- 19 and 84 +/- 17% of predicted, respectively) compared with normal subjects (91 +/- 19 and 96 +/- 24% of predicted VO2) and group 2 patients (86 +/- 17 and 96 +/- 18%). Also the ischaemic threshold, when normalized for predicted workload at peak exercise, occurred earlier in group 1 (67 +/- 22%) than in group 2 (87 +/- 19%). The time-related (Delta)VO2/Deltawork relationship showed a significant flattening above the anaerobic threshold in group 1 (7.4+/-2.2 versus 9.4+/-1.4 ml/watt per minute, P < 0.01), but not in controls or in group 2. Also the DeltaVO2/Deltawork relationship, above the ischaemic threshold, flattened in group 1, but not in group 2. The suggestion of major coronary disease in patients with exercise-induced ST changes is given by: (i) a flattening of the DeltaVO2/Deltawork relationship, above both the ischaemic and anaerobic thresholds; and (ii) low VO2 values at anaerobic and ischaemic thresholds.	{ "pile_set_name": "PubMed Abstracts" }
Q: What should be the filename for files with date name so it would order by desc I'm creating an application which writes log files daily and i'd like to know what should be the file name for each day so if all files located in the same folder they would be ordered in a desc order (from the newest to the oldest)? A: I would recommend using the following format: "yyyy-MM-dd_hh_mm_ss" and sort your files in your folder by name, descending.	{ "pile_set_name": "StackExchange" }
Friday, June 27, 2008 "why do sane, rational, educated people choose to live in the desert? On purpose?!" I remember very clearly asking myself this question in the hotter months while I was walking to my car accross the ASU campus. I don't think I ever came up with a clear answer. But here I am, still in the desert. On purpose. I have been having a hard time with the heat lately. True I have lived in AZ since I was seven, but I don't think you ever really get used to it. This is not my first summer pregnancy. It is my third. I usually like being pregnant in the summer. I think it keeps me from getting so huge, because I can't cover up with layers. And one of my favorite sayings, (you've heard me say it if you know me in real life), is "tan fat looks better then white fat". This is very true. I like being tan when I would otherwise look like a beached whale on the delivery table. I like being tan in my babies' first pictures. But lately I have been sweating from the moment I wake up. And it will only get worse. Right now we are still using our evap cooler, so by evening I am covering up with a blanket. This is probably our last weekend for that. Like I said, it will only get worse. I think it has to do with size. Right now, at 22 weeks, I weigh as much as I did when I gave birth to Brenley. Which was the biggest I had ever ever been. Who knows how much more I will gain in the next 18 weeks. I know what you are thinking. "How can you be gaining so much weight when you are still throwing up?" Wendell says I only throw up the stuff that is good for me, and the peanut butter and chocolate stays right where it is. I am afraid he is right;)Add that to almost no activity, and there you go. So Rachael e mailed me this list, and I thought it was mostly appropriate. She got a kick out of the part about driving with oven mitts, because she has noticed that I can't really touch my stearing wheel with out a napkin, or a rag or something. I thought you might all enjoy it. A lot of you can relate;) You Know You're From Arizona If...40 Crazy things you only see in the southwestern desert... 1. You buy salsa by the gallon. 2. Your Christmas decorations include a half a yard of sand and l00 paper bags. 3. You think a red light is merely a suggestion. 4. All of your out-of-state friends start to visit after October but clear out come the end of April. 5. You think someone driving wearing oven mitts is clever. 6. Most of the restaurants in town have the first name "El" or "Los". 7. You think 60 tons of crushed rock makes a beautiful yard. 8. You've signed so many petitions to recall governors that you can't remember the name of the incumbent. 9. You notice your car overheating before you drive it. 10. Your house is made of stucco and has a red clay tile roof. 11. You can say "Hohokam" and people don't think you're laughing funny. 12. You no longer associate bridges (or rivers) with water. 13. You see more irrigation water on the street than there is in the Salt River. 14. You know a swamp cooler is not a happy hour drink. 15. You can say 115 degrees without fainting. 16. Every other vehicle is a 4x4. 17. You can be in the snow, then drive for an hour and it will be over 100 degrees. 18. Vehicles with open windows have the right-of-way in the summer. 19. People break out coats when temperature drops below 70 degrees. 20. You discover, in July, it only takes two fingers to drive your car. 21. The pool can be warmer than you are. 22. You can make sun tea instantly. 23. You run your air conditioner in the middle of winter so you can use your fireplace. 24. Most homes have more firearms than people. 25. Kids will ask, "What's a mosquito?" 26. People who have black cars or black upholstery in their car are automatically assumed to be from out-of-state or nuts. 27. You notice the best parking place is determined by shade instead of distance. 28. The AC is on your list of best friends. 29. Monday Night Football starts at 7:00 instead of 6:00. 30. You realize that Valley Fever isn't a disco dance. 31. You can finish a Big Gulp in 10 minutes and go back for seconds. 32. The water from the cold water tap is the same temperature as the hot one. About Me I have been a wife for nearly 15 years now and a mother for 13. That makes me sound pretty old, but I won't admit to over 30;) I am happily married to Wendell and am fully occupied as the mother to Rachael age 13, Kindyl age 12, Mitchell age 9, Brenley age 5, and Abigail our little Queenie just turned 2. Feel free to comment, even if I don't know you. I love to hear what everyone has to say!	{ "pile_set_name": "Pile-CC" }
Norinco NHM 91 The NHM-91 is a semi-automatic civilian development of the Russian Kalashnikov AKM and RPK infantry small arm built by Norinco of China and marketed in the U.S. by China Sports Inc. of Ontario, California (CSI Ont, CA). Background A civilian semi-auto variant of the Chinese Type 56 assault rifle, the NHM-91 was built to imitate the appearance of the Russian RPK light machine gun. First imported and marketed in the United States in 1991 by ChinaSports Inc., NHM-91's were modified to meet the requirements of a 1989 Executive Order by President George H. W. Bush prohibiting importation of certain 'assault rifle' configurations of military-style semi-automatic rifles such as the Norinco AKM/AK-47. These modifications included a one-piece U.S.-made thumbhole stock to replace the separate Chinese-made buttstock and pistol grip of the original AKM/RPK rifle and the inclusion of a rivet on the receiver preventing use of standard AK-47, RPK, or AKM magazines. All Chinese rifles were banned under the 1994 Clinton administration or AWB Ban and no Chinese AK variants were allowed to be imported. Features Based on the Russian RPK light machine gun, the NHM features a stronger receiver and a longer, thicker-profile chrome-lined barrel measuring 20 inches (508mm) compared to the 590 mm (23.2 in) of the original RPK, along with a forward-mounted steel bipod. The NHM-91 was equipped from the factory with two 30-round magazines and a 75-round Chinese drum magazine. Like the RPK, the NHM-91 utilizes a heavier-gauge stamped sheet metal receiver built from 1.5mm-thick stamped sheet metal instead of the 1mm thickness typical of a Soviet or European AKM. Other Chinese-made AKM rifles such as the MAK 90 and NHM 90 have thicker receivers as well, resulting in increased rigidity, heavier weight, and improved overall accuracy. The MAK 90 rifles may have either a straight cut stamped receiver or a slant cut stamped receiver. Both were imported after the 1989 ban with thumb hole stocks. The MAK 91 has the long barrel as well, but features a milled, slant cut receiver. The longer, heavier barrel reduces shot dispersion and gives the NHM-91 and MAK 91 rifles a longer sight radius, again resulting in improved accuracy over the typical semi-auto AKM. Trigger pull weight is also lighter than other AK designs, and some users report the rifle capable of 2-2.5 minutes of angle accuracy or better with factory 7.62×39mm ammunition. All post ban rifle stocks on the NHM-91 are of a one-piece thumbhole design with integral pistol grip, and are thicker and longer than the standard AKM/AK-47 buttstock. Made by E.C. Bishop or Boyd and constructed from birch wood or hackberry, the NHM-91 buttstock lacks a separate pistol grip, though the rifle may be retrofitted with a separate buttstock by simply cutting off the lower portion of the stock and grip with a band saw, then fitting a new pistol grip. Like its RPK counterpart, the NHM-91 does not come equipped from the factory with a bayonet lug. However, on post ban models, the front of the barrel is threaded and capped off with a thread protector welded onto the threads or the threads are deleted altogether. By removing the thread protector, a muzzle brake can be fitted. Some factory NHM-91 rifles were manufactured with a rivet in the magazine release button, preventing use of some Soviet or German-made AKM or AK-47 magazines. Instead, special magazines with a modified tang were manufactured by Norinco for the NHM-91. Since the sunset of the 1994 Public Safety and Recreational Firearms Use Protection Act, removal of the rivet in the receiver and magazine release allows use of any and all AKM, RPK, or AK-47 magazines. References Category:7.62×39mm semi-automatic rifles Category:Firearms of the People's Republic of China	{ "pile_set_name": "Wikipedia (en)" }
Q: return value from string prototype using javascript I am using prototype method to replace comma in string but the function giving same string String.prototype.removeLastComma = function(){ return this.replace(/,/g, '.'); } A: String.prototype.removeLastComma = function(){ return this.replace(/,/g, '.'); } Works just fine. I guess you're expecting the following effect: var str = 'foo,bar,baz'; str.removeLastComma(); console.log(str); //foo.bar.baz Unfortunately, this is not possible because the strings in JavaScript are immutable. Try this instead: var str = 'foo,bar,baz'; str = str.removeLastComma(); console.log(str); //foo.bar.baz NOTE: better call your method "removeCommas" or something like that. Remove last comma means that you're going to remove only the last one. For removing the last comma you can use the following regular expression: String.prototype.removeLastComma = function(){ return this.replace(/,(?=[^,]*$)/, '.'); }	{ "pile_set_name": "StackExchange" }
Q: Calling C# code from JavaScript in SharePoint Ok here's what I'm trying to do. I have this custom action (button on my SharePoint-ribbon). This should call a Javascript, which in turn should call a C#-code. I have the following: <CustomAction Id="Ribbon.Documents.DocsetZip" Title="Download Document Set as ZIP" RegistrationType="ContentType" RegistrationId="0x0120D520" Location="CommandUI.Ribbon" > <CommandUIExtension> <CommandUIDefinitions> <CommandUIDefinition Location="Ribbon.Documents.Share.Controls._children"> <Button Id="Ribbon.Document.Share.DownasZip" Sequence="20" Command="Ribbon.ManageDocumentSet.MDS.Manage.DownZip" Alt="Download as ZIP" Image16by16="/_layouts/images/zipfile16x.png" Image32by32="/_layouts/images/zipfile32x.png" LabelText="Download as ZIP file" ToolTipTitle="Download as ZIP file" ToolTipDescription="Compress the document set and download" TemplateAlias="o1"/> </CommandUIDefinition> </CommandUIDefinitions> <CommandUIHandlers> <CommandUIHandler Command="Ribbon.ManageDocumentSet.MDS.Manage.DownZip" CommandAction="javascript:__doPostBack('DownloadZipDelegateEvent', '')" /> </CommandUIHandlers> </CommandUIExtension> And i have a class: public class MyRibbonDelegateClass : WebControl { protected override void OnLoad(EventArgs e) { this.EnsureChildControls(); base.OnLoad(e); if (this.Page.Request["__EVENTTARGET"] == "DownloadZipDelegateEvent") { using (TextWriter writer = File.CreateText("C:\\temp\\perl.txt")) { // // Write one line. // writer.WriteLine("First line"); // // Write two strings. // writer.Write("A "); writer.Write("B "); // // Write the default newline. // writer.Write(writer.NewLine); } } } It seems my code gets executed, but I cannot find my file anywhere. What am I missing? A: I've solved it as follows : function getOutlook() { var xmlHttpReq = createXMLHttpRequest(); xmlHttpReq.open("GET", _spPageContextInfo.siteServerRelativeUrl + "/_layouts/SendDocuments/MyCustomHandler.ashx?ItemsArray=" + fileRefArray, false); xmlHttpReq.send(null); } function createXMLHttpRequest() { try { return new XMLHttpRequest(); } catch (e) { } try { return new ActiveXObject("Msxml2.XMLHTTP"); } catch (e) { } try { return new ActiveXObject("Microsoft.XMLHTTP"); } catch (e) { } alert("XMLHttpRequest not supported"); return null; }	{ "pile_set_name": "StackExchange" }
Q: Google ndb -- how to do range queries on 2 (or more) attributes I have a table with [Event \| LAT \| LONG \| time ... etc.]. Given a lat-&-long values, I would like to fetch all events that fall within a certain range of the lat/long (say roughly 5 miles around it). In SQL, I would probably do something like: SELECT * WHERE LAT > lat+5 and LAT < lat-5 AND LONG > long+5 and LONG < long-5. Can I do something similar in google's ndb database ? I see a filter query on one single attribute given as example: qry = Account.query(Account.userid >= 40, Account.userid < 50) But it doesn't seem to allow more than one attribute. regards GA A: It's a restriction of the Datastore (not just NDB) that you can't do this. You may try to use geohashing, or if you don't have much data, just do a range query on one dimension and filter the other dimension using Python code.	{ "pile_set_name": "StackExchange" }
UNPUBLISHED UNITED STATES COURT OF APPEALS FOR THE FOURTH CIRCUIT UNITED STATES OF AMERICA, Plaintiff-Appellee, v. No. 00-4021 JACQUEL MASELLI KITCHENS, Defendant-Appellant. Appeal from the United States District Court for the District of Maryland, at Greenbelt. Deborah K. Chasanow, District Judge. (CR-99-107) Submitted: August 18, 2000 Decided: September 8, 2000 Before MICHAEL and KING, Circuit Judges, and HAMILTON, Senior Circuit Judge. _________________________________________________________________ Dismissed by unpublished per curiam opinion. _________________________________________________________________ COUNSEL Kenneth B. Folstein, Greenbelt, Maryland; Thomas A. Pavlinic, Annapolis, Maryland, for Appellant. Lynne A. Battaglia, United States Attorney, Deborah A. Johnston, Assistant United States Attor- ney, Greenbelt, Maryland, for Appellee. _________________________________________________________________ Unpublished opinions are not binding precedent in this circuit. See Local Rule 36(c). _________________________________________________________________ OPINION PER CURIAM: Jacquel Maselli Kitchens pled guilty pursuant to a plea agreement to one count of possession with intent to distribute cocaine in viola- tion of 21 U.S.C.A. § 841 (West 1999), and one count of possession of a firearm after conviction of a felony in violation of 18 U.S.C. § 922(g)(1) (1994). On appeal, Kitchens claims that the district erred by considering hearsay from undisclosed confidential informants in determining that Kitchens was not eligible for the"safety valve" pro- visions of 18 U.S.C.A. § 3553(f) (West Supp. 2000). Because Kitch- ens waived his right to appeal any sentence except an upward or downward departure from the sentencing guidelines, we dismiss the appeal.1 Kitchens entered into a plea agreement in which he agreed to waive any right to appeal "whatever sentence is imposed, including any issues that relate to the establishment of the guideline range, except reserving the right to appeal any upward or downward departure from the guideline range as determined by the court at the time of sentenc- ing." At the Rule 11 plea colloquy,2 the district court determined that Kitchens was a high school graduate and not under the influence of any medications, alcohol or drugs. Kitchens was informed that the mandatory minimum penalty for the drug offense was ten years. The district court expressly addressed the waiver provision. The court _________________________________________________________________ 1 We have considered the effect of Apprendi v. New Jersey, 530 U.S. ___, No. 98-478, 2000 WL 807189 (June 26, 2000), and find that, because Kitchens received a sentence of imprisonment and term of supervised release that did not exceed the statutory maximums set out in 21 U.S.C.A. § 841(b)(1)(C) (West 1999), no plain error occurred. See United States v. Aguayo-Delgado, ___ F.3d ___, 2000 WL 988128, *6 (8th Cir. July 18, 2000). 2 Federal Rule of Criminal Procedure 11. 2 noted that normally defendants have the right to appeal decisions made by the judge at sentencing. The court stated that: In this case both you [Kitchens] and the Government have given up your right to appeal my guideline decisions, unless I decide to depart, that is to sentence you above or below the guideline range. If I should do that and either side thinks I have made a mistake, you will have the right to appeal, to complain about that mistake and get it corrected. Other than that, though, you and the Government have given up your rights to appeal my guideline decisions. Kitchens stated that he understood. The court further stated that Kitchens waived his right to challenge his conviction in a 28 U.S.C.A. § 2255 (West Supp. 2000) motion except for ineffective assistance of counsel or prosecutorial misconduct. The court also stated that: You [Kitchens] will always have the right to complain if you think I have imposed an illegal sentence, that is one that's higher than those statutory maximums we talked about at the beginning of the procedure. Kitchens indicated that he understood. The district court informed Kitchens that he faced a minimum term of ten years' imprisonment and at least five years' supervised release. The district court denied Kitchens' motion requesting application of the safety valve and sentenced Kitchens to the minimum statutory term of ten years' imprisonment and five years' supervised release. A waiver of a criminal defendant's right to appeal contained in a valid plea agreement "is enforceable against the defendant so long as it is the result of a knowing and intelligent decision to forgo the right to appeal." United States v. Attar, 38 F.3d 727, 731 (4th Cir. 1994) (internal quotation and citations omitted). In the instant appeal, Kitch- ens' plea agreement contained a provision expressly waiving the right to appeal any sentence and any issues involving the sentencing guide- 3 lines except for an upward or downward departure from the sentenc- ing guidelines range. The district court expressly addressed the waiver provisions during Kitchens' Rule 11 colloquy. Kitchens stated that he understood the provision and agreed to it. There is nothing in the record to suggest that the plea or the plea agreement was unknowing or involuntary. Accordingly, we find that the plea waiver provision is enforceable. Because Kitchens was sentenced within the sentence authorized by statute and the court did not impose an upward or downward departure from the sentencing guidelines, we find that Kitchens waived his right to appeal his sentence.3,4 Accordingly, we dismiss Kitchens' appeal. We dispense with oral argument because the facts and legal contentions are adequately presented in the materi- als before the court and argument would not aid in the decisional pro- cess. DISMISSED _________________________________________________________________ 3 The statutory minimum sentence was ten years' imprisonment which became the sentencing guidelines range of imprisonment because the maximum sentence under the sentencing guidelines was less than the statutory maximum. See Ch. 5, Part A of the U.S. Sentencing Guidelines Manual; see also USSG § 5G1.1(b) (1998). 4 Despite a waiver of appeal rights, a defendant may retain the right to appeal a sentence imposed in an unconstitutional manner. See Attar, 38 F.3d at 731. Kitchens did not have a constitutional right to confront con- fidential informants at a sentencing hearing. See United States v. Young, 981 F.2d 180, 187-88 (5th Cir. 1992). 4	{ "pile_set_name": "FreeLaw" }
Vertical Kuijken & Gilmore potential ==================================== .. autoclass:: galpy.potential.KGPotential :members: __init__	{ "pile_set_name": "Github" }
Delayed separation of the umbilical cord in two siblings with Interleukin-1 receptor-associated kinase 4 deficiency: rapid screening by flow cytometer. We describe 2 siblings who had interleukin-1 receptor-associated kinase 4 deficiency with a novel mutation in exon 2. They had delayed separation of the umbilical cord. The flow cytometric analysis of monocytic intracellular tumor necrosis factor-alpha production in response to lipopolysaccharide may be a useful method to screen for the disease.	{ "pile_set_name": "PubMed Abstracts" }
Kindness, simple really. To kick us off, we were asked to see if we could come up with any examples of kindness being offered in the bible. We came up with quite a few, some of which are listed below (in no chronological order!): The story of Ruth, who first gives, and then receives tremendous and unexpected kindness. Joseph helping his brothers in Egypt (although admittedly he played a little trick on them too) The fathers’ attitude to both his sons in the parable of the prodigal son Quite a list, and as I said, nowhere near all of the examples in the Bible. As we reflected on the character of kindness, it occurred to us that it so easily has a lasting impact on both the giver and receiver. Kindness is something that goes beyond the minimum expected, offering someone something that brings comfort and pleasure – and often in very simple ways. We shared examples of kindness we had received, and began to see certain patterns emerging. Kindness is expressed as the gift of time, space, a service; it leaves the recipient feeling as if they are worth something, appreciated. Kindness, like so many of the fruit of the spirit, is self-replicating – it is hard to receive it and not feel inclined to offer kindness in turn. Kindness blurs into other things, especially unconditional love. At St Luke’s in the High Street, we would love to be known as a people of kindness. This can only happen if we are consistent in demonstrating this quality. One act of unkindness will deeply impact and shape our relationship with not only the individual concerned, but will have ripples of effect far beyond that. And unkindness can easily be passive – simply a lack of kindness, not necessarily something done which is unkind in itself. To nurture and grow in kindness, we need to consciously make the effort to discern and act on opportunities that present themselves, and we cannot act in kindness from a motivation of wanting something in return – kindness cannot be forged in this way, but must be a generous act of self-giving, even if the act itself is as simple as taking 5 minutes to talk to a homeless person as an equal, or smiling at someone as they walk past.	{ "pile_set_name": "Pile-CC" }
Assessing crash risk considering vehicle interactions with trucks using point detector data. Trucks have distinct driving characteristics in general traffic streams such as lower speeds and limitations in acceleration and deceleration. As a consequence, vehicles keep longer headways or frequently change lane when they follow a truck, which is expected to increase crash risk. This study introduces several traffic measures at the individual vehicle level to capture vehicle interactions between trucks and non-trucks and analyzed how the measures affect crash risk under different traffic conditions. The traffic measures were developed using headways obtained from Inductive Loop Detectors (ILDs). In addition, a truck detection algorithm using a Gaussian Mixture (GM) model was developed to identify trucks and to estimate truck exposure from ILD data. Using the identified vehicle types from the GM model, vehicle interaction metrics were categorized into three groups based on the combination of leading and following vehicle types. The effects of the proposed traffic measures on crash risk were modeled in two different cases of prior- and non-crash using a case-control approach utilizing a conditional logistic regression. Results showed that the vehicle interactions between the leading and following vehicle types were highly associated with crash risk, and further showed different impacts on crash risk by traffic conditions. Specifically, crashes were more likely to occur when a truck following a non-truck had shorter average headway but greater headway variance in heavy traffic while a non-truck following a truck had greater headway variance in light traffic. This study obtained meaningful conclusions that vehicle interactions involved with trucks were significantly related to the crash likelihood rather than the measures that estimate average traffic condition such as total volume or average headway of the traffic stream.	{ "pile_set_name": "PubMed Abstracts" }
--- abstract: 'We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the infinite graphs.' author: - 'Nicolas Delfosse[^1] and Gilles Zémor[^2]' title: A homological upper bound on critical probabilities for hyperbolic percolation --- Introduction ============ Let ${{\EuScript G}}=({{\EuScript V}},{{\EuScript E}})$ be an infinite connected graph. Every edge is declared to be [ open]{} with probability $p$, otherwise it is [closed]{}. This endows subsets of edges with a product probability measure by declaring edges to be open or closed independently of the others, and creates a random open subgraph $\varepsilon$. If a given edge $e$ belongs to an infinite connected component of $\varepsilon$, we say that (bond) percolation occurs. If the graph ${{\EuScript G}}$ is edge-transitive, then the probability of percolation does not depend on $e$ and we may denote this probability by $f(p)$. Arguably, the most studied parameter of percolation theory is the [critical probability]{} $p_c=p_c({{\EuScript G}})$ which is the supremum of the set of $p$’s for which $f(p)=0$. Ever since the seminal work of Kesten [@K80] percolation was extensively studied on the lattices associated to ${\mathbb{Z}}^d$, for background see [@G89]: in the present paper, we are interested in percolation on regular tilings of the hyperbolic plane. This topic was first introduced by Benjamini and Schramm [@Be96], and further studied in [@Be01; @GZ11; @BMK09] among other papers. Specifically, our focus is on the family of graphs that we shall denote by $G(m)$, for $m\geq 4$, that are regular of degree $m$, planar, and tile the plane by elementary faces of length $m$. For $m=4$, the graph $G(m)$ is exactly the square ${\mathbb{Z}}^2$ lattice. The local structure of the graph $G(5)$ is represented in Figure \[fig:G(5)\]. =\[circle, draw, fill=black!100, inner sep=0pt, minimum width=2pt\] (0:1.3) in [72,144,...,359]{} [ – (:1.3) ]{} – cycle (0:1.3) node (a) (72:1.3) node (b) (144:1.3) node (c) (216:1.3) node (d) (288:1.3) node (e) ; (0:.9) node (a2) (60:.9) node (a3) (300:.9) node (a1) ; (a1)–(a)–(a2) (a)–(a3); (72:.9) node (b2) (132:.9) node (b3) (12:.9) node (b1) ; (b1)–(b)–(b2) (b)–(b3); (144:.9) node (c2) (204:.9) node (c3) (84:.9) node (c1) ; (c1)–(c)–(c2) (c)–(c3); (216:.9) node (d2) (276:.9) node (d3) (156:.9) node (d1) ; (d1)–(d)–(d2) (d)–(d3); (288:.9) node (e2) (348:.9) node (e3) (228:.9) node (e1) ; (e1)–(e)–(e2) (e)–(e3); (36:2.1) node (f) (108:2.1) node (g) (180:2.1) node (h) (252:2.1) node (i) (324:2.1) node (j); (a3)–(f)–(b1) (b3)–(g)–(c1) (c3)–(h)–(d1) (d3)–(i)–(e1) (e3)–(j)–(a1); (70:.4) node (a24) (290:.4) node (a21); (345:.4) node(a31); (15:.4) node (a14); (a2)–(a24)–(a31)–(a3) (a1)–(a14)–(a21)–(a2); (142:.4) node (b24) (2:.4) node (b21); (57:.4) node(b31); (87:.4) node (b14); (b2)–(b24)–(b31)–(b3) (b1)–(b14)–(b21)–(b2); (214:.4) node (c24) (74:.4) node (c21); (129:.4) node(c31); (159:.4) node (c14); (c2)–(c24)–(c31)–(c3) (c1)–(c14)–(c21)–(c2); (286:.4) node (d24) (136:.4) node (d21); (201:.4) node(d31); (231:.4) node (d14); (d2)–(d24)–(d31)–(d3) (d1)–(d14)–(d21)–(d2); (358:.4) node (e24) (218:.4) node (e21); (273:.4) node(e31); (303:.4) node (e14); (e2)–(e24)–(e31)–(e3) (e1)–(e14)–(e21)–(e2); Our goal is to study the critical probabilities of these lattices. The simple lower bound $1/(m-1)\leq p_c$ can be derived since $1/(m-1)$ is the critical probability for the $m$-regular tree, and our main concern here is on dealing with upper bounds. Critical probabilities for hyperbolic tilings were studied numerically by Baek et al. [@BMK09] and also by Gu and Ziff [@GZ11] who obtain a “Monte Carlo” upper bound $p_c<0.34$ for $G(5)$. In previous work by the present authors [@DZ13], the rigorous upper bound $p_c < 0.38$ was obtained for $G(5)$ as a by-product of the study of the erasure-correcting capabilities of a family of quantum error-correcting codes. In the present paper we shall obtain a substantially improved upper bound on critical probabilities that gives $p_c<0.30$ for $G(5)$. We remark that we restrict ourselves to the hyperbolic tilings $G(m)$ because they are self-dual and our method is better suited for this case, but results on the critical probabilities for the self-dual case can lead to results for the general case [@LB12]. Classically, one uses finite portions of the infinite graph ${{\EuScript G}}$ to devise intermediate tools for studying percolation. For example, in the original ${\mathbb{Z}}^2$ setting, the standard (by now) method that leads to the computation $p_c=1/2$ is to consider $n\times n$ finite grids and study the probability of the appearance of an open path linking the south boundary to the north boundary (or east to west) [@G89]. In the hyperbolic setting however, trying to mimic this approach directly quickly leads to serious obstacles: what finite portion of the infinite graph $G(5)$ (say) should one consider, and which parts of the boundary should be matched when looking for the appearance of finite open paths ? We shall overcome this difficulty by appealing to finite graphs $G_t(m)$ that are everywhere locally isomorphic to $G(m)$, meaning that every ball of radius $t$ of $G_t(m)$ is required to be isomorphic to a ball of radius $t$ in the infinite graph $G(m)$. We shall derive an upper bound $p_c\leq p_h$ on the critical probability by defining a quantity $p_h$ such that, when $p>p_h$, then with probability tending to $1$ when $t$ tends to infinity, $G_t(m)$ must contain an open cycle that can not be expressed as a sum modulo $2$ of elementary faces. Our end result will be an expression for the upper bound $p_h$ that involves only the structure of the infinite graph $G(m)$, but the existence of the finite graphs $G_t(m)$ (which is non-obvious) will be crucial to the derivation of $p_h$. #### [Outline and results:]{} Sections \[section:siran\_graphs\] and \[section:homology\] are background. In Section \[section:siran\_graphs\] we give a short description of a construction of the graphs $G_t(m)$ due to Širáň. We shall need to consider the cycles of those graphs that are not expressible as sums of faces, i.e. that are homologically non-trivial: we shall therefore need background on homology that is dealt with in Section \[section:homology\]. In Section \[section:rank\] we study the appearance of homology in random subgraphs of the finite graphs $G_t(m)$. We introduce a crucial quantity $D(p)$ that we name the [rank difference function]{} and that captures the limiting behaviour of the difference of the dimensions of the homologies of the two random subgraphs of $G_t(m)$ chosen through the parameters $p$ and $1-p$. We then define the quantity $$p_h=\sup\left\{p, p-\frac 2m + D(p)=0\right\}.$$ The main result of this section, Theorem \[theo:Dequation\], is that $p_h$ is an upper bound on the critical probability of $G(m)$. We actually conjecture that for $m\geq 5$ (i.e. the genuinely hyperbolic, or non-amenable, case) this upper bound is also a lower bound, i.e. $p_c=p_h$. This would show that for these graphs the critical probability is local in a sense close to [@Be11]. That $p_c\leq p_h$ was derived in [@DZ13] in a roundabout way, through the study of the erasure-decoding capabilities of quantum codes associated to the tilings $G_t(m)$. The present proof not only removes the reference to quantum coding, it is intrinsically shorter and more direct. Section \[section:D(p)\] is dedicated to finding an explicit expression for the rank difference function $D(p)$, and hence for the upper bound $p_h$. Our main result is Theorem \[theo:D\_graphical\], which expresses $D(p)$ as the series: $$\label{eq:D(p)} D(p) = \frac 2 m \sum_{ C } \left( \frac 1 {\|V(C)\|} \left(p^{\|E(C)\|} (1-p)^{\|\partial(C)\|} - (1-p)^{\|E(C)\|} p^{\|\partial(C)\|} \right) \right),$$ where $C$ ranges over all connected subgraphs of $G(m)$ containing a given vertex, where $V(C),E(C)$ denote the vertex and edge set of $C$, and where $\partial (C)$ denotes the set of edges with at least one endpoint in $C$, which are not in $E(C)$. As mentioned, this expression for $D(p)$ does not involve the graphs $G_t(m)$ anymore, but its proof crucially relies on their existence. Section \[section:approximation\] proves that replacing $D(p)$ in by a truncated series continues to yield an upper bound on the critical probability $p_c$ of $G(m)$ (Theorem \[theo:bound\]). This allows us to compute explicit numerical upper bounds on $p_c$. Finally, Section \[section:conclusion\] summarizes the results with Theorem \[theo:final\] and gives some concluding comments. Finite quotient of the regular hyperbolic tilings {#section:siran_graphs} ================================================= We are unaware of any method for constructing the required finite versions of $G(m)$ that does not involve a fair amount of algebra. In this section, we briefly recall Širáň’s method to construct such finite versions of the regular hyperbolic tiling $G(m)$. The first step is to construct $G(m)$ from a group of matrices over a ring of algebraic integers. Then this group is reduced modulo a prime number to yield the desired finite graph. Denote by $P_k(X) = 2\cos(k\arccos(X/2))$ the $k$-th normalized Chebychev polynomial and let $\xi = 2\cos(\pi/m^2)$. Let $m \geq 5$ and consider the group $T(m)$ generated by the two following matrices of $SL_3({\mathbb{Z}}[\xi])$. $$a = \left( \begin{array}{ccc} P_m(\xi)^2-1 & 0 & P_m(\xi)\\ P_m(\xi) & 1 & 0\\ -P_m(\xi) & 0 & -1 \end{array} \right) \quad \text{and} \quad b = \left( \begin{array}{ccc} -1 & -P_m(\xi) & 0\\ P_m(\xi) & P_m(\xi)^2-1 & 0\\ P_m(\xi) & P_m(\xi)^2 & 1 \end{array} \right).$$ The group $T(m)$ admits the presentation $$\label{eq:presentation} T(m) = {\langle { a, b \ \| \ a^m = b^m = (ab)^2 = 1 }\rangle}.$$ With this group we associate its coset graph. The coset graph associated with is defined to be the infinite planar tiling whose vertex set, respectively edge set and face set, is the set of left cosets of the subgroup ${\langle {a}\rangle}$, respectively the set of left cosets of the subgroup ${\langle {ab}\rangle}$ and the subgroup ${\langle {b}\rangle}$. A vertex and an edge, or an edge and a face, are incident if and only if the corresponding cosets have a non-empty intersection. For example, the coset ${\langle {a}\rangle} = \{1, a, a^2, \dots, a^{m-1} \}$ defines a vertex of the graph $G(m)$ and is incident to the $m$ edges represented by the cosets $${\langle {ab}\rangle},\ a{\langle {ab}\rangle},\ a^2{\langle {ab}\rangle},\ \dots,\ a^{m-1} {\langle {ab}\rangle}.$$ We can see that the coset graph is $m$-regular and that its faces contain $m$ edges. It is straightforward to check that the coset graph associated with is the infinite planar graph $G(m)$ [@Si00]. The basic idea to derive a finite version of this tiling is to reduce the matrices defining the group $T(m)$ modulo a prime number. We can reduce the coefficients of the matrices of $T(m)$ thanks to the ring isomorphism ${\mathbb{Z}}[\xi] \simeq {\mathbb{Z}}[X]/h(X)$, where $h(X) \in {\mathbb{Z}}[X]$ is the minimal polynomial of the algebraic number $\xi$. This induces a ring morphism $\pi_p: SL_3({\mathbb{Z}}[\xi]) \rightarrow SL_3({\mathbb{F}}_p[X]/\bar h(X))$ where $\bar h(X)$ is the reduction modulo $p$ of the polynomial $h(X)$. Denote by $\bar T^p(m)$ the image of the group $T(m)$ by the morphism $\pi_p$. The coset graph associated with the group $\bar T^p(m)$ is defined from the cosets of $\bar T^p(m)$, exactly like the coset graph of $T(m)$. Širáň proved that for a well chosen family of prime numbers $p$, this construction provides a sequence of finite tilings $(G_t(m))_t$ which is locally isomorphic to the infinite tiling $G(m)$ [@Si00]. Precisely: \[theo:siran\] For every integer $m \geq 5$, there exists a family of finite tilings $(G_t(m))_{t \geq m}$ and some constant $K$ such that every ball of radius $t$ of $G_t(m)$ is isomorphic to every ball of radius $t$ in $G(m)$. Furthermore, the number of vertices of $G_t(m)$ is at most $K^t$. By construction, the graphs $G_t(m)$ are vertex transitive. Indeed, each element of the group $\bar T(m)$ induces a graph automorphism of the coset graph by left multiplication. An automorphism which sends a vertex $x {\langle {a}\rangle}$ onto the vertex $y {\langle {a}\rangle}$ is given by the left multiplication by $yx^{-1}$ of the cosets representing the vertices. For the same reason, $G_t(m)$ is also edge-transitive and face-transitive. To be sure that the faces of the graph $G_t(m)$ are not degenerate, we require $t \geq m$. We will also use the fact that $G_t$ is a self-dual graph. This is a consequence of the local structure of the graph: every vertex has degree $m$ and every face has length $m$. Background on homology {#section:homology} ====================== Homology of a tiling of surface {#subsection:homology} ------------------------------- A tiling of a surface is a graph cellularly embedded in a smooth surface. For us only the combinatorial structure of the surface plays a role, therefore a face of the tiling is represented as the set of edges on its boundary. We denote by $G=(V, E, F)$ such a tiling, where $F$ is the set of faces that, as far as homology is concerned, can be thought of simply as a privileged set of cycles of the graph $(V,E)$. With a tiling of a surface, we associate a dual tiling $G^=(V^,E^,F^)$. The vertices of this dual tiling are given by the faces of $G$. Two vertices of $G^$ are joined by an edge if the corresponding faces of $G$ share an edge. Since every edge of $E$ belongs to exactly two faces of $F$, there is a one-to-one correspondence between edges of $G$ and edges of $G^$. Finally, for every vertex $v$ of $V$ the set of edges of $E$ incident to $v$ defines a face of $F^$ through the above correspondence between $E$ and $E^$. We assume the graph and its dual have neither multiple edges nor loops. We shall also use $G$ to refer indifferently to the graph $(V,E)$ and to the associated tiling $(V,E,F)$. In the remainder of this section, we consider only finite tilings, and we order the three sets $V, E$ and $F$ by $V = \{v_1, v_2, \dots, v_{\|V\|}\}$, $E = \{e_1, e_2, \dots, e_{\|E\|}\}$ and $F = \{f_1, f_2, \dots, f_{\|F\|}\}$. The incidence matrix of the graph $(V,E)$ is defined to be the matrix $B(G) = (b_{ij})_{i, j}$ of ${\mathcal{M}}_{\|V\|, \|E\|}({\mathbb{F}}_2)$ such that $b_{ij} = 1 $ if the vertex $v_i$ is incident to the edge $e_j$, and $b_{ij} = 0$ otherwise. To emphasize the ${\mathbb{F}}_2$-linear structure of some subsets of $V$, $E$ and $F$, we introduce the spaces of $i$-chains $C_i$: $$C_0 = \bigoplus_{v \in V} {\mathbb{F}}_2 v, \quad C_1 = \bigoplus_{e \in E} {\mathbb{F}}_2 e, \quad C_2 = \bigoplus_{f \in F} {\mathbb{F}}_2 f.$$ In other words, the space $C_0 = \{\sum_v \lambda_v v \ \| \ \lambda_v \in {\mathbb{F}}_2\}$ is the set of formal sums of vertices. The sets $C_1$ and $C_2$ are defined similarly. These chain spaces are equipped with two ${\mathbb{F}}_2$-linear mappings $ \partial_2: C_2 \rightarrow C_1 $ and $ \partial_1: C_1 \rightarrow C_0 $ defined by $\partial_2(f) = \sum_{e \in f} e$ and $\partial_1(e) = \sum_{u \in e} u$. These mappings are called boundary maps. A subset of the vertex set, respectively the edge set or the face set, can be regarded as its indicator vector in $C_0$, respectively $C_1$ or $C_2$. This yields one-to-one correspondences between subsets and vectors, which allow us to interpret geometrically the boundary maps. In subset language, the map $\partial_2$ sends a subset of faces onto the set of edges on its boundary in the standard sense, and the map $\partial_1$ sends a subset of edges onto its “endpoints” which should be understood modulo $2$, i.e. the set of vertices incident to an odd number of edges in the subset. The singletons $\{v_i\}$, respectively $\{e_i\}$ and $\{f_i\}$, form a basis of the space $C_0$, respectively $C_1$ and $C_2$. The matrix of the map $\partial_1$ in these singleton bases is equal to the incidence matrix $B(G)$ of the graph $(V, E)$ and the matrix of the map $\partial_2$ is equal to the transpose of the incidence matrix $B(G^)$ of $(V^,E^)$. We can easily prove that the composition of these applications is $\partial_1 \circ \partial_2 = 0$, implying the inclusion $\operatorname{Im}\partial_2 \subset \operatorname{Ker}\partial_1$. We can now introduce the ${\mathbb{F}}_2$-homology of tilings of surfaces. The first homology group* of a finite tiling of a surface $G$, denoted $H_1(G)$, is the quotient space $$H_1(G) = \operatorname{Ker}\partial_1 / \operatorname{Im}\partial_2.$$ Note that $H_1(G)$ is also an ${\mathbb{F}}_2$-vector space. The vectors of $\ker \partial_1$ are called cycles. They correspond to the subsets of edges that meet every vertex an even number of times. The set $\ker \partial_1$ of cycles of a graph is an ${\mathbb{F}}_2$-linear space that we refer to as the cycle code of the graph. The vectors of $\operatorname{Im}\partial_2$ are called boundaries or sums of faces and they describe the sets of edges on the boundary of a subset of $F$. In what follows, we shall study the dimension of the homology group of different tilings of surfaces. The following well known property (see e.g. [@Berge73] for a proof) is used repeatedly . \[lemma:Dcycle\] The dimension of the cycle code of a graph $G=(V, E)$ composed of $\kappa$ connected components, is $ \|E\| - \|V\| + \kappa. $ Figure \[fig:torus\](a) represents a square lattice of the torus. A cycle of trivial homology is drawn on Figure \[fig:torus\](b). This cycle is clearly a sum of faces. Two examples of cycles with non trivial homology are given in Figure \[fig:torus\](c) and (d). The first homology group of this tiling of the torus is a binary space of dimension 2. It is generated, for example, by an horizontal cycle which wraps around the torus, such as the one in Figure \[fig:torus\](c) and a vertical cycle which wraps around the torus. The cycle of Figure \[fig:torus\](d) is equivalent to the sum of these horizontal and vertical cycles, up to a sum of faces. =\[circle, draw, fill, inner sep=0pt, minimum width=4pt\]; (0,0) grid (5,5); (0,0)–(5,0) (0,5)–(5,5); (0,0)–(0,5) (5,0)–(5,5); in [0,1,...,5]{} in [0,1,...,5]{} (, ) node ; =\[inner sep=0pt, minimum width=4pt\]; at (0.5,4.5) [$(a)$]{}; =\[circle, draw, fill, inner sep=0pt, minimum width=4pt\]; (0,0) grid (5,5); (0,0)–(5,0) (0,5)–(5,5); (0,0)–(0,5) (5,0)–(5,5); in [0,1,...,5]{} in [0,1,...,5]{} (, ) node ; (5,2)–(3,2)–(3, 1)–(4,1)–(4,3)–(5,3) (0,2)–(2,2)–(2,3)–(0,3); =\[inner sep=0pt, minimum width=4pt\]; at (0.5,4.5) [$(b)$]{}; =\[circle, draw, fill, inner sep=0pt, minimum width=4pt\]; (0,0) grid (5,5); (0,0)–(5,0) (0,5)–(5,5); (0,0)–(0,5) (5,0)–(5,5); in [0,1,...,5]{} in [0,1,...,5]{} (, ) node ; (0,2)–(5,2); =\[inner sep=0pt, minimum width=4pt\]; at (0.5,4.5) [$(c)$]{}; =\[circle, draw, fill, inner sep=0pt, minimum width=4pt\]; (0,0) grid (5,5); (0,0)–(5,0) (0,5)–(5,5); (0,0)–(0,5) (5,0)–(5,5); in [0,1,...,5]{} in [0,1,...,5]{} (, ) node ; (0,2)–(3,2)–(3,3)–(4,3)–(4,2)–(5,2) (2,0)–(2,5); =\[inner sep=0pt, minimum width=4pt\]; at (0.5,4.5) [$(d)$]{}; Induced homology of a subtiling {#section:subhomology} ------------------------------- Percolation theory deals with random subgraphs of a given graph. In what follows, we introduce the homology of a subgraph of a given tiling $G$. The subgraphs that we consider are obtained by selecting a subset of edges. Denote by $G = (V, E, F)$ a tiling of surface and let us consider the subgraph $G_{{\varepsilon}}$ of $G$ whose vertex set is exactly $V$ and whose edge set is a given subset ${\varepsilon}$ of $E$. This graph is not immediately endowed with a set of faces and with a homology group. The proper notion of homology for our purpose is obtained by considering the boundaries of the tiling $G$ which are included in the subgraph $G_{{\varepsilon}}$. More precisely, the subset of edges ${\varepsilon}$ defines the subspace $C_0^{\varepsilon}=C_0$, the subspace $C_1^{\varepsilon}$ of $C_1$ made up of all formal sums of edges of ${\varepsilon}$, and the subspace $C_2^{\varepsilon}$ of $C_2$ made up of all those vectors of $C_2$ whose image under $\partial_2$ is included in $C_1^{\varepsilon}$. The mappings $\partial_1^{\varepsilon}$ and $\partial_2^{\varepsilon}$ are defined as the restrictions of $\partial_1$ and $\partial_2$ to $C_1^{\varepsilon}$ and $C_2^{\varepsilon}$. Let $G=(V, E, F)$ be a tiling of a surface and let ${\varepsilon}\subset E$. The induced homology group of $G_{{\varepsilon}}$ is the quotient space $$H_1(G_{{\varepsilon}}) = \operatorname{Ker}\partial_1^{{\varepsilon}} / ( \operatorname{Im}\partial_2^{\varepsilon}).$$ For more detailed background on the homology of surfaces and their tilings see [@Ha02; @Gi10]. Appearance of homology in a random subgraph of $G_t$ {#section:rank} ==================================================== Homology of a subgraph ---------------------- This section is devoted to the analysis of the induced homology of a subgraph of $G_t(m)$. To lighten notation we omit the indices $m$ and $t$ and write $G=G_t(m)$. Following the notation of Section \[section:subhomology\], ${\varepsilon}$ denotes a subset of $E$ and $G_{{\varepsilon}}$ denotes the subgraph of $G$ induced by ${\varepsilon}$. The decomposition of the graph $G_{{\varepsilon}}$ into connected components induces a partition of the edges of ${\varepsilon}$: the set ${\varepsilon}$ is the disjoint union of the subsets ${\varepsilon}_i \subset E$, for $i=1, 2, \dots, r$ and where each set ${\varepsilon}_i$ is the edge set of a connected component of $G_{{\varepsilon}}$. The following lemma proves that this decomposition of the graph $G_{{\varepsilon}}$ induces a decomposition of its homology group. \[lemma:H\_decomposition\] Let ${\varepsilon}= \cup_{i=1}^r {\varepsilon}_i$ be the partition of ${\varepsilon}$ derived from the decomposition of the graph $G_{{\varepsilon}}$ into connected components. Then, the dimension of the first homology group of $G_{{\varepsilon}}$ is at most $$\dim H_1(G_{{\varepsilon}}) \leq \sum_{i=1}^r \dim H_1(G_{{\varepsilon}_i}).$$ Remark that the chain space $C_1^{\varepsilon}$ decomposes as $C_1^{\varepsilon}= \oplus_i C_1^{{\varepsilon}_i}$. This leads to a similar decomposition of the cycle code of $G_{\varepsilon}$. $$\operatorname{Ker}\partial_1^{{\varepsilon}} = \bigoplus_{i=1}^r \operatorname{Ker}\partial_1^{{\varepsilon}_i}.$$ However, the image of $\operatorname{Im}\partial_2^{\varepsilon}$ has a slightly different structure. First, the chain space $C_2^{\varepsilon}$ is has no similar decomposition but it still contains the direct sum $\oplus_i C_2^{{\varepsilon}_i}$. Hence, the image of $\operatorname{Im}\partial_2^{\varepsilon}$ contains the direct sum $ \bigoplus_{i=1}^r \operatorname{Im}\partial_2^{{\varepsilon}_i} $ as a subspace. This implies $$\begin{aligned} \dim H_1(G_{{\varepsilon}}) & = \dim \left( \bigoplus_{i=1}^r \operatorname{Ker}\partial_1^{{\varepsilon}_i} / \operatorname{Im}\partial_2^{{\varepsilon}} \right) \\ & \leq \dim \left( \bigoplus_{i=1}^r \operatorname{Ker}\partial_1^{{\varepsilon}_i} / \bigoplus_{i=1}^r \operatorname{Im}\partial_2^{{\varepsilon}_i} \right).\end{aligned}$$ To conclude, notice that this last quotient is exactly the direct sum $\oplus_i H_1(G_{t, {\varepsilon}_i})$. The next lemma proves that if ${\varepsilon}$ is composed of small clusters, then it covers no homology. \[lemma:smallclusters\] Let $G_{{\varepsilon}}$ be a connected subgraph of $G=G_t(m)$. If ${\varepsilon}$ contains at most $t$ edges, then we have $H_1(G_{{\varepsilon}}) = \{0\}$. Since $G_{{\varepsilon}}$ is connected and contains less than $t$ edges, it is included in a ball of radius $t$. From Theorem \[theo:siran\], this ball is isomorphic with a ball of the planar graph $G(m)$. But this ball is itself planar and in a planar graph, every cycle is a boundary. Thus the group $H_1(G_{{\varepsilon}})$ is trivial. The next lemma will allow us to compute the dimension of the induced homology group of every subgraph $G_{{\varepsilon}}$ of $G=G_t(m)$. Since a set ${\varepsilon}\subset E$ can be regarded as a subset of $E^$, it also defines a subgraph $G^_{{\varepsilon}}$ of the graph $G^$. Let us denote by $\operatorname{rank}G_{\varepsilon}$ ($\operatorname{rank}G_{\varepsilon}^$) the rank of an incidence matrix of $G_{\varepsilon}$ (of $G^_{{\varepsilon}}$). By Lemma \[lemma:Dcycle\] these ranks do not depend on the choice of the incidence matrix of the graph. The dimension of the induced homology group is given by: \[lemma:dimH\] For every ${\varepsilon}\subset E$, we have $$\dim H_1(G_{{\varepsilon}}) = \|{\varepsilon}\| - \frac{2}{m} \|E\| + 1 + \operatorname{rank}G^_{\bar {\varepsilon}} - \operatorname{rank}G_{{\varepsilon}}.$$ The group $H_1(G_{{\varepsilon}})$ is the quotient of the cycle code of $G_{{\varepsilon}}$ by $\operatorname{Im}\partial_2^{\varepsilon}$, the set of boundaries of $G$ which are included in the subgraph ${\varepsilon}$. By definition, the cycle code of $G_{{\varepsilon}}$ is the kernel of the map $\partial_1^{{\varepsilon}}$. Moreover, the incidence matrix of $G_{{\varepsilon}}$ is a matrix of this linear map. Therefore, the dimension of the cycle code of the subgraph $G_{{\varepsilon}}$ is $$\label{eq:ker} \dim\ker\partial_1^{{\varepsilon}}=\|{\varepsilon}\| - \operatorname{rank}G_{{\varepsilon}}.$$ The set of boundaries of $G$ is the image of the map $\partial_2$. We noticed in Section \[subsection:homology\] that a matrix of the map $\partial_2$ is given by the transpose of $B(G^)$, the incidence matrix of $G^$. This means that the boundaries of $G$ correspond to the sums of rows of $B(G^)$. These are the vectors of the form $x B(G^)$, where $x$ is a binary vector. Consider the incidence matrix of $G^_{\bar {\varepsilon}}$, where $\bar {\varepsilon}$ denotes the complement of ${\varepsilon}$ in $E$. This matrix can be obtained from $B(G^)$ by selecting the columns indexed by the edges in $\bar {\varepsilon}$. Let us define a map $\phi$ which sends a sum of rows of $B(G^)$ onto the same sum of rows in the matrix $B(G^_{\bar {\varepsilon}})$. It is the map $$\begin{aligned} \phi : \operatorname{Im}\partial_2 &\longrightarrow C_1^{\bar {\varepsilon}}\\ x B(G^) & \longmapsto x_{\bar {\varepsilon}} B(G^_{\bar {\varepsilon}}),\end{aligned}$$ where $x$ is a row vector of ${\mathbb{F}}_2^{\|V\|}$ and $x_{\bar {\varepsilon}}$ is its restriction to the columns indexed by the edges of $\bar {\varepsilon}$. Then, the boundaries of $G$ included in ${\varepsilon}$, are exactly the vectors of the kernel of $\phi$. The dimension of this space is $$\label{eq:kerphi} \dim\operatorname{Im}\partial_2^{\varepsilon}=\dim \ker \phi = \dim\operatorname{Im}\partial_2 - \dim\operatorname{Im}\phi = \operatorname{rank}G^* - \operatorname{rank}G^_{\bar {\varepsilon}}.$$ Now $\operatorname{rank}G^=\dim\operatorname{Im}\partial_1^* = \|E^\|-\dim\ker\partial_1^$. Applying Lemma \[lemma:Dcycle\] to the dimension of the cycle code $\ker\partial_1^$ of $G^$ and the fact that $G=G_t(m)$ is connected, we get $\operatorname{rank}G^* = \|F\| - 1 = (2/m)\|E\| -1$. Injecting this last fact into , we obtain, together with , the formula for $\dim H_1(G_{{\varepsilon}})=\dim\ker\partial_1^{\varepsilon}- \dim\operatorname{Im}\partial_2^{\varepsilon}$. The rank difference function ---------------------------- We now consider the probabilistic behaviour of the induced homology of a random subgraph of $G_t=G_t(m)$. To get a distribution which locally coincides with the distribution of percolation events, the subset of edges ${\varepsilon}$ is chosen by selecting each edge of $G_t$ independently with probability $p$. This defines a random subgraph $G_{t, {\varepsilon}}$ of the graph $G_t$. The intuition we follow is that if we are below the critical probability of the graph $G(m)$, then most connected components appearing in the random subgraph $G_{t, {\varepsilon}}$ should be small. Thanks to Lemma \[lemma:smallclusters\], these clusters do not support any non trivial homology. This implies that if $p < p_c(G(m))$ then the dimension of the induced homology of $G_{t, {\varepsilon}}$ must be small. Conversely, if we compute, using Lemma \[lemma:dimH\], the expected dimension of $H_1(G_{t, {\varepsilon}})$ and find it to be large, we know that $p$ must be above the critical probability $p_c$. These considerations lead us to introduce the following quantity. The rank difference function associated with the family of graphs $(G_t)_t$ is defined to be $$D(p) = \limsup_t {{\mathbb E}}_p \left( \frac{\operatorname{rank}G^_{t, \bar {\varepsilon}} - \operatorname{rank}G_{t, {\varepsilon}}}{\|E_t\|} \right).$$ The rank difference function satisfies the folowing equation when $p$ is below the critical probability of $G(m)$. \[theo:Dequation\] If $p<p_c(G(m))$ then the rank difference function associated with the family $(G_t)_t$ satifies $$p - \frac 2 m + D(p) = 0.$$ \[cor:phom\] Defining $p_h = \sup\{p,p - \frac 2 m + D(p) = 0\}$ we have $p_c\leq p_h$. Assume that $p<p_c(G(m))$. By definition of the critical probability, for any fixed edge $e$ of the infinite graph $G(m)$, the probability that $e$ is contained in an open connected component $C(e)$ of $G(m)$ of size strictly larger than $t$ vanishes when $t \rightarrow \infty$. The following lemma shows that we observe a similar behaviour in the finite graphs $G_t$. It will be instrumental in proving Theorem \[theo:Dequation\]. \[lemma:leaving\_components\] For every $t \geq 0$, fix an edge $e_t$ of the graph $G_t$ and denote by $C(e_t)$ its (possibly empty) connected component in the random subgraph $G_{t, {\varepsilon}}$. Then, the probability that $C(e_t)$ contains strictly more than $t-2$ edges tends to $0$ when $t$ goes to infinity. The complementary event depends only on what occurs inside the ball of radius $t$ centered on an endpoint of the edge $e_t$. Since this ball is isomorphic to the ball with the same radius in $G(m)$, this event has the same probability in the space $G(m)$ and in $G_t(m)$. Hence the result by the remark preceding the lemma. [Theorem]{}[\[theo:Dequation\]]{} Thanks to Lemma \[lemma:H\_decomposition\], we have the following upper bound on the dimension of the first homology group of $G_{t, {\varepsilon}}$: $$\dim H_1(G_{t, {\varepsilon}}) \leq \sum_{i=1}^r \dim H_1(G_{t, {\varepsilon}_i}).$$ where ${\varepsilon}_i$ is the edge set of the $i$-th connected component of $G_{t, {\varepsilon}}$. From Lemma \[lemma:smallclusters\], all the components ${\varepsilon}_i$ of size smaller than $t$ have a trivial contribution to $H_1(G_{t, {\varepsilon}})$. For the other components, the dimension of $H_1(G_{t, {\varepsilon}_i})$ is bounded by the number of edges in the component ${\varepsilon}_i$. Indeed, the induced homology group of $G_{t, {\varepsilon}_i}$ is a quotient of the cycle code of this graph, whose dimension is at most the number of egdes in ${\varepsilon}_i$. This implies $$\dim H_1(G_{t, {\varepsilon}}) \leq \|\{ e \in E_t \ \text{such that} \ \|C(e)\| > t \}\|,$$ where $C(e)$ denotes the connected component in $G_{t, {\varepsilon}}$ of the edge $e$ and $\|C(e)\|$ is its number of edges. Let us denote by $X_t=X_t(G_{t, {\varepsilon}})$ the cardinality of the set $\{ e \in E_t \ \text{such that} \ \|C(e)\| > t \}$. To study the expectation of $X_t$, we define a random variable $X_e$, associated with each edge $e \in E_t$, which takes the value $X_e(G_{t, {\varepsilon}}) = 1$ if the size of $C(e)$ is larger than $t$ and which is 0 otherwise. Consequently, we have $$X_t = \sum_{e \in E_t} X_e,$$ and by linearity of expectation, ${{\mathbb E}}(X_t) = \sum_e {{\mathbb E}}(X_e)$. For every edge $e \in E_t$, this expectation of the random variable $X_e$ is ${{\mathbb E}}(X_e) = {{\mathbb P}}(\|C(e)\| > t)$. By edge-transitivity of the graph $G_t$, this quantity does not depend on the edge $e$, thus ${{\mathbb E}}(X_t) = \|E_t\| \ {{\mathbb P}}(\|C(e_t)\| > t)$, for some fixed edge $e_t$ of the graph $G_t$. Moreover, from Lemma \[lemma:leaving\_components\], this probability vanishes when $t$ goes to infinity. This allows us to bound the expected dimension of the induced homology: $${{\mathbb E}}_p \left( \frac{\dim H_1(G_{t, {\varepsilon}})}{\|E_t\|} \right) \leq {{\mathbb E}}_p \left( \frac{X_t}{\|E_t\|} \right) = {{\mathbb P}}_p( \|C(e_t)\| > t) \rightarrow 0.$$ Since the right-hand side tends to 0 when $t$ goes to infinity, taking the superior limit gives exactly 0, i.e.* $$\limsup_t {{\mathbb E}}_p \left( \frac{\dim H_1(G_{t, {\varepsilon}})}{\|E_t\|} \right) = 0.$$ To conclude the proof, we determine the expected dimension of the induced homology group with the help of Lemma \[lemma:dimH\]. We find $$\limsup_t {{\mathbb E}}_p \left( \frac{\dim H_1(G_{t, {\varepsilon}})}{\|E_t\|} \right) = p - \frac 2 m + D(p).$$ Computation of the rank difference function of hyperbolic tilings {#section:D(p)} ================================================================= The behaviour of the function $D(p)$ is difficult to capture directly from its definition. The aim of this section is to provide an explicit combinatorial description of the rank difference function $D(p)$ associated with the finite tilings $(G_t)_t$. The next lemma enables us to replace the rank which appears in the definition of $D(p)$ by a strictly graph-theoretical quantity. \[lemma:kappa\] Let $\kappa_{t, {\varepsilon}}$ denote the number of connected components of the graph $G_{t, {\varepsilon}}$. We have: $$\operatorname{rank}G_{t, {\varepsilon}} = \|V_t\| - \kappa_{t, {\varepsilon}}.$$ By definition, the rank of the graph $G_{t, {\varepsilon}}$ is the rank of an incidence matrix of this graph. The kernel of this incidence matrix is the cycle code of the graph $G_{t, {\varepsilon}}$, which has dimension $\|{\varepsilon}\| - \|V_t\| + \kappa_{t, {\varepsilon}}$ from Lemma \[lemma:Dcycle\]. The result follows. The function $D(p)$ depends on the expected rank of the random submatrix $G_{t, {\varepsilon}}$. This encourages us to examine the expected number of connected components of the random subgraph $G_{t, {\varepsilon}}$. A key ingredient of our study is the following decomposition of the random variable $\kappa_{t, {\varepsilon}}$. \[lemma:kappa\_decomposition\] Let $C$ be a connected subgraph of $G_t$. Denote by $X_C$ the random variable which takes the value 1 if $C$ is a connected component of the random graph $G_{t, {\varepsilon}}$ and 0 otherwise. Then, we have $$\kappa_{t, {\varepsilon}} = \sum_{C \in {\mathcal{C}}_t} X_C$$ where ${\mathcal{C}}_t$ denotes the set of connected subgraphs $C$ of $G_t(m)$. Moreover, we have ${{\mathbb E}}_p(X_C) = p^{\|E(C)\|}(1-p)^{\|\partial(C)\|}$ where $\partial(C)$ is the set of edges of $G_t$ which are incident to at least one vertex of $C$, but which do not belong to $E(C)$. The proof of the above lemma is self-evident. Using this decomposition of $\kappa_{t, {\varepsilon}}$, we derive the following exact expression of the rank difference function as a function of the subgraphs of the infinite graph $G(m)$. \[theo:D\_graphical\] For $m\geq 5$ and $0<p\leq 1/2$, The rank difference function associated with the graphs $(G_t(m))_t$ is equal to $$D(p) = \frac 2 m \sum_{ C \in {\mathcal{C}}(v) } \left( \frac 1 {\|V(C)\|} \left(p^{\|E(C)\|} (1-p)^{\|\partial(C)\|} - (1-p)^{\|E(C)\|} p^{\|\partial(C)\|} \right) \right),$$ where ${\mathcal{C}}(v)$ denotes the set of connected subgraphs $C$ of $G(m)$ containing a fixed vertex $v$. From Lemma \[lemma:kappa\], the rank difference function can be rewritten $$\begin{aligned} D(p) & = \limsup_t {{\mathbb E}}_p\left( \frac{\kappa_{t, {\varepsilon}} - \kappa_{t, \bar {\varepsilon}}} {\|E_t\|} \right)\\ &= \limsup_t \left( {{\mathbb E}}_p \left( \frac{\kappa_{t, {\varepsilon}} } {\|E_t\|} \right) - {{\mathbb E}}_{1-p} \left( \frac{\kappa_{t, {\varepsilon}} } {\|E_t\|} \right) \right).\end{aligned}$$ where we used the fact that, $\bar {\varepsilon}$ being the complement of ${\varepsilon}$ in $E_t$, we have ${{\mathbb E}}_p(\kappa_{t, \bar {\varepsilon}}) = {{\mathbb E}}_{1-p}(\kappa_{t, {\varepsilon}})$. Then, using the decomposition of $\kappa_{t, {\varepsilon}}$ proposed in Lemma \[lemma:kappa\_decomposition\] and the linearity of expectation, we obtain $$D(p) = \limsup_t \frac 1 {\|E_t\|} \sum_{ C \in {\mathcal{C}}_t } \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right).$$ [Elimination of the large components—]{} Now, remark that the main contribution in this sum is given by the small components. To prove this, consider a sequence of integers $(M_t)_t$ such that $M_t \rightarrow +\infty$. Then, we have $$\begin{aligned} \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| \geq M_t}} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right) & \leq \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| \geq M_t}} \left( {{\mathbb E}}_p(X_C) + {{\mathbb E}}_{1-p}(X_C)\right)\\ & = \frac 1 {\|E_t\|} {{\mathbb E}}_p \left( \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| \geq M_t}} X_C \right) + \frac 1 {\|E_t\|} {{\mathbb E}}_{1-p} \left( \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| \geq M_t}} X_C\right)\\ & \leq \frac 1 {\|E_t\|} \frac {2 \|E_t\|}{M_t} = \frac {2}{M_t} \rightarrow 0\end{aligned}$$ To obtain the last inequality, remark that the sum of all the random variables $X_C$ such that $\|E(C)\| \geq M_t$ counts the number of connected components of the subgraph $G_{t, {\varepsilon}}$ of size larger than $M_t$. Since connected components are disjoint, this number cannot be larger than $\|E_t\|/M_t$. The previous paragraph proves that, for every sequence $M_t$ going to infinity, the rank difference function is given by $$D(p) = \limsup_t \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| < M_t}} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)$$ [Recentralization—]{} In order to remove the dependency on $t$, we would like to apply the local isomorphism between $G_t(m)$ and $G(m)$ and to express everything as a function of the infinite graph $G(m)$. First, we have to recenter all the components $C$ around a fixed vertex $v_t$ of the graph $G_t$. To move a connected component $C$ of the graph $G_t$ onto a component which contains the vertex $v=v_t$, we use a family of automorphisms of the graph $G_t(m)$. For every vertex $w$ of the graph $G_t(m)$, select $\sigma_{v, w}$, an automorphism of the graph $G_t(m)$ sending $v$ onto $w$. We take the identity for $\sigma_{v, v}$. Such an automorphism exists because the graph $G_t$ is vertex transitive, as explained in Section \[section:siran\_graphs\]. From this fixed family of automorphisms, we can reach all the connected subgraphs of $G_t$, starting from the subgraphs containing $v$. Stated differently, we have $${\mathcal{C}}_t =\{ C \ \| \ C \text{ connected } \} = \bigcup_{w \in V_t} \{ \sigma_{v, w}(C) \ \| \ C \text{ connected }, v \in V(C) \}$$ At the right-hand side of this equality, each component $C$ of the graph appears $\|V(C)\|$ times. Moreover, the contribution ${{\mathbb E}}_p(X_C)$ of the subgraph $C$, computed in Lemma \[lemma:kappa\_decomposition\], depends only on $\|E(C)\|$ and $\|\partial(C)\|$, which are both invariant under the application of an automorphism $\sigma_{v, w}$. Hence, $D(p)$ is equal to $$\begin{aligned} D(p) & = \limsup_t \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t \\ \|E(C)\| < M_t}} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)\\ & = \limsup_t \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t(v) \\ \|E(C)\| < M_t}} \sum_{w \in V_t} \frac{1}{\|V(C)\|} \left( {{\mathbb E}}_p(X_{\sigma_{v,w}(C)}) - {{\mathbb E}}_{1-p}(X_{\sigma_{v,w}(C)})\right)\\ & = \limsup_t \frac 1 {\|E_t\|} \sum_{\substack{C \in {\mathcal{C}}_t(v) \\ \|E(C)\| < M_t}} \frac {\|V_t\|} {\|V(C)\|} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)\\ & = \limsup_t \frac 2m \sum_{\substack{C \in {\mathcal{C}}_t(v) \\ \|E(C)\| < M_t}} \frac {1} {\|V(C)\|} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)\end{aligned}$$ where we have used $\frac{\|V_t\|}{\|E_t\|}=\frac 2m$ since $G_t$ is $m$-regular. [Application of the local isomorphism—]{} We now replace the graph $G_t(m)$ by the infinite graph $G(m)$. Since the balls of radius $t$ are isomorphic in $G_t(m)$ and in $G(m)$, we have that every fixed subgraph $C$ inside such a ball has the same probability of being a connected component whether it is of the random subgraph $G_{t,{\varepsilon}}$ or of the open subgraph of $G(m)$. By choosing $M_t=t-1$, we therefore get $$\label{eq:limsup} D(p) = \limsup_t \frac 2 m \sum_{\substack{C \in {\mathcal{C}}(v) \\ \|E(C)\| < M_t}} \frac {1} {\|V(C)\|} \left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)$$ where ${\mathcal{C}}(v)$ denotes the set of connected subgraphs $C$ of $G(m)$ containing the fixed vertex $v$. We can now conclude the proof. From Lemma \[lemma:kappa\_decomposition\], the quantity $\left( {{\mathbb E}}_p(X_C) - {{\mathbb E}}_{1-p}(X_C)\right)$ is equal to $\left(p^{\|E(C)\|} (1-p)^{\|\partial(C)\|} - (1-p)^{\|E(C)\|} p^{\|\partial(C)\|} \right)$, which is positive by Lemma \[lemma:series\_positivity\] to be proven just below. Therefore all the terms of the sum in are positive, which means that the $\limsup$ is in fact a limit. Since $M_t \rightarrow +\infty$, we get $$D(p) = \frac 2 m \sum_{ C \in {\mathcal{C}}(v) } \left( \frac 1 {\|V(C)\|} \left(p^{\|E(C)\|} (1-p)^{\|\partial(C)\|} - (1-p)^{\|E(C)\|} p^{\|\partial(C)\|} \right) \right).$$ It remains to prove that the series has positive terms. This result relies on an isoperimetric inequality. \[lemma:series\_positivity\] Let $0<p<1/2$. For every connected subgraph $C$ of $G(m)$, we have $$p^{\|E(C)\|}(1-p)^{\|\partial(C)\|} - (1-p)^{\|E(C)\|} p^{\|\partial(C)\|} > 0.$$ The parameter $p$ is assumed to be smaller than $1/2$. Thus, to prove that this quantity is strictly positive it suffices to show that for every connected subgraph $C$ of $G(m)$, we have $\|E(C)\| < \|\partial(C)\|$. This inequality is somewhat analogous to the isoperimetric inequality that we recall now. The isoperimetric constant of the graph $G(m)$ is defined to be $$i_E(G(m)) = \inf \left\{ \frac{\|\partial(C)\|}{\|V(C)\|} \right\}$$ with $C$ ranging over all finite subgraphs (that can be assumed connected) of $G(m)$. This number was computed exactly for hyperbolic graphs in [@HJL02]. It is $$\label{eqn:i_E} i_E(G(m)) = (m-2) \sqrt{1-\frac{4}{(m-2)^2}}.$$ In order to apply this to our problem, we write $$\begin{aligned} \label{eqn:isoperimetric} \frac{\|\partial(C)\|}{\|E(C)\|} = \frac{\|\partial(C)\|}{(m/2)\|V(C)\|-(1/2)\|\partial(C)\|} \geq \frac {i_E(G(m))}{m/2 - i_E(G(m))/2}\end{aligned}$$ where we have used the fact that the smallest rate $\|\partial(C)\|/\|E(C)\|$ is achieved when $\partial(C)$ contains only edges with exactly one endpoint in $C$. In that case, we have $m\|V(C)\| = 2\|E(C)\| + \|\partial(C)\|$. Using Equation (\[eqn:i\_E\]) and (\[eqn:isoperimetric\]), it is then easy to check that, for all $m \geq 5$, we have $$\frac{\|\partial(C)\|}{\|E(C)\|} \geq \frac {i_E(G(5))}{5/2 - i_E(G(5))/2} \approx 1.62 > 1.$$ This proves the lemma. Bound on the critical probability of the hyperbolic lattice $G(m)$ {#section:approximation} ================================================================== We showed in Theorem \[theo:Dequation\] that the critical probability of $G(m)$ is bounded from above as $p_c(G(m))\leq p_h$ with $p_h$ defined in Corollary \[cor:phom\]. Theorem \[theo:D\_graphical\] provides an exact formula for the rank difference function $D(p)$ as a sum of a series depending on the connected subgraphs of $G(m)$. This gives a new expression for $p_h$ that does not involve the finite graphs $G_t(m)$ anymore, but it still leaves $p_h$ difficult to compute. We now show that by replacing the series $D(p)$ by its partial sums, we obtain explicit upper bounds on $p_h$ and hence on $p_c$. \[theo:bound\] Let $n \geq 0$ and let $D_n(p)$ be a partial sum of the series $D(p)$ associated with the hyperbolic graph $G(m)$. Then, the solution $p_h(n) \in [0, 1]$ of the equation $$p - 2/m + D_n(p)=0$$ is an upper bound on $p_h$ and hence on $p_c(G(m))$. We have seen in Lemma \[lemma:series\_positivity\] that all the terms of the series $D(p)$ are strictly positive when $p>0$. Thus, every partial sum $D_n(p)$ satisfies $D_n(p) < D(p)$. As a consequence, if $p_h(n)$ is a solution of the equation $p - 2/m + D_n(p)=0$, then we have $p_h(n) - 2/m + D(p_h(n))>0$. This proves that $D(p)$ does not satisfy the criterion of Theorem \[theo:Dequation\] at $p=p_h(n)$. Therefore $p_h(n)$ is an upper bound on $p_h$. As a first application of this theorem, using only the fact that $D_n(p) \geq 0$, we recover the upper bound $p_c(G(m)) \leq 2/m$, proved in [@DZ10]. The first terms of the series, corresponding to the components of small size can be computed easily. For example the number of connected subgraphs of size 0, that is with 0 edges, containing a fixed vertex of $G(m)$ is 1 and this subgraph has a boundary $\partial(C)$ of size $m$. This gives the partial sum $$D_0(p) = \frac 2 m ( (1-p)^m-p^m ).$$ Applying Theorem \[theo:bound\] to $D_0(p)$, we get an upper close to $0.35$. This is already more precise than the upper bound in [@DZ13]. The next partial sum is given by $$D_1(p) = D_0(p) + \frac 2 m \left( \frac m 2 ( p(1-p)^{2(m-1)} - p^{2(m-1)}(1-p) ) \right),$$ since there are $m$ different connected subgraphs of $G(m)$ composed of one edge and containing a fixed vertex. The first terms can be computed easily in this way. In a tree it is possible to get an exact formula for the number of rooted connected subgraphs using the Lagrange inversion threorem. However this enumeration problem becomes extremely difficult when the subgraphs start covering cycles. Moreover, the size of the boundary and the number of vertices of the subgraph do not depend only on its number of edges. We enumerated all the connected subgraphs of $G(5)$ (hyperbolic animals, as in [@MW10]) of size at most 8 by computer. The results are given in Table \[tab:components\]. Using the partial sum $D_8(p)$ that takes into acount all the subgraphs of size at most 8, we get an upper bound on $p_c(G(5))$ which is approximately $0.299973$: $$p_c(G(5)) \leq 0.299973.$$ To the best of our knowledge, the previous best upper bound was close to $0.38$ [@DZ13]. Gu and Ziff proposed a Monte-Carlo estimation of this threshold of $0.265$ [@GZ11] which is coherent with our upper bound. $\|E(C)\|$ $\|V(C)\|$ $\partial(C)$ occurrence ---------- ---------- --------------- ------------ 0 1 5 1 1 2 8 5 2 3 11 30 3 4 14 200 4 5 17 1400 4 5 16 25 5 6 20 10146 5 6 19 450 5 5 15 5 6 7 23 75460 6 7 22 5775 6 6 18 90 7 8 26 572720 7 8 25 64200 7 8 24 480 7 7 21 1155 8 9 29 4418190 8 9 28 661950 8 9 27 13005 8 8 24 12840 8 8 23 180 : Enumeration of the rooted subgraphs of $G(5)$ up to size 8.[]{data-label="tab:components"} Concluding comments {#section:conclusion} =================== Summarising Theorems \[theo:Dequation\] and \[theo:D\_graphical\] we have proved : \[theo:final\] For $m\geq 5$ we have $p_c(G(m))\leq p_h$ with $$\begin{aligned} p_h &= \sup \{ p \in [0, 1/2] \ \| \ D(p)+p-\frac 2m = 0 \} \ \text{and}\\ D(p) &= \frac 2 m \sum_{ C \in {\mathcal{C}}(v) } \left( \frac 1 {\|V(C)\|} \left(p^{\|E(C)\|} (1-p)^{\partial(C)} - (1-p)^{\|E(C)\|} p^{\partial(C)} \right) \right) \end{aligned}$$ where ${\mathcal{C}}(v)$ denotes the set of connected subgraphs $C$ of $G(m)$ containing a fixed vertex $v$ of the graph $G(m)$. The value $p_h$ can be thought of as a critical value for the appearance of homology in the graph $G(m)$. It captures the following threshold : for $p>p_h$, open subgraphs of large finite versions of $G(m)$ must have a first homology group of dimension that scales linearly with the total number of edges of the finite graph. For $p<p_h$, the dimension of the homology group is sublinear instead. This bound is really meaningful only for the hyperbolic case $m\geq 5$ since for $m=4$ (the square lattice), the dimension of the total homology group of finite versions of the infinite grid (tori) is limited to $2$. A consequence of Theorem \[theo:final\] is that $p_h$ gives an upper bound on the parameters of the quantum erasure channel that hyperbolic surface codes built on the family $G_t(m)$ can sustain [@DZ13]. We conjecture : \[conj:p\_c=p\_h\] For $m\geq 5$, $p_c=p_h$. Recall that in hyperbolic lattices it has been shown that immediately beyond the critical probability, the open subgraph contains infinitely many infinite connected components [@Be96]. The conjecture could be seen as a “finite” (but unbounded) version of this fact. Acknowledgements {#acknowledgements .unnumbered} ================ Nicolas Delfosse was supported by the Lockheed Martin Corporation. The authors wish to thank Robert Ziff for his comments and Russell Lyons for pointing out an inaccuracy in Lemma \[lemma:H\_decomposition\] in a preliminary version of this article. [1]{} S. K. Baek, P. Minnhagen, and B. Jun Kim. Percolation on hyperbolic lattices. , 79:011124, Jan 2009. I. Benjamini, A. Nachmias and Y. Peres. Is the critical percolation probability local ? [Probability Theory and Related Fields]{}, 149, pp. 261–269, 2011. I. Benjamini and O. Schramm. Percolation beyond ${Z}^d$, many questions and a few answers. , 1:71–82, 1996. I. Benjamini, O. Schramm. Percolation in the hyperbolic plane. , 29 pp. 487–507, 2001. C. Berge. . Elsevier, 1973. N. Delfosse and G. Zémor. Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane. In [Proc. of IEEE Information Theory Workshop, ITW 2010]{}, pages 1–5, 2010. N. Delfosse and G. Z[é]{}mor. Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel. , 13(9-10):793–826, 2013. P. Giblin. . Cambridge University Press, 2010. G. Grimmett. [Percolation.]{} Springer-Verlag, New York, 1989. H. Gu and R. M. Ziff. Crossing on hyperbolic lattices. 85:051141, May 2012. O. Haggstrom, J. Jonasson, and R. Lyons. Explicit isoperimetric constants and phase transitions in the random-cluster model. , pages 443–473, 2002. A. Hatcher. . Cambridge University Press, 2002. H. Kesten. The critical probability of bond percolation on the square lattice equals 1/2. , 74:41–59, 1980. J.F. Lee and S.K. Baek. Bounds of percolation thresholds on hyperbolic lattices. [Phys. Rev. E]{} 86, 062105 2012. N. Madras and C.C. Wu. Trees, Animals, and Percolation on Hyperbolic Lattices [Electronic J. of Probability]{}, Vol. 15, pp. 2019-2040, 2010. J. Širáň. Triangle group representations and constructions of regular maps. , 82(03):513–532, 2000. [^1]: Département de Physique, Université de Sherbrooke, Sherbrooke, Québec, J1K 2R1 Canada, [email protected] [^2]: Institut de Mathématiques de Bordeaux, UMR 5251, université de Bordeaux, [email protected]	{ "pile_set_name": "ArXiv" }
config BOARD_PURISM_BASEBOARD_LIBREM_BDW def_bool n select SYSTEM_TYPE_LAPTOP select BOARD_ROMSIZE_KB_8192 select HAVE_ACPI_RESUME select HAVE_ACPI_TABLES select INTEL_GMA_HAVE_VBT select INTEL_INT15 select MAINBOARD_HAS_LIBGFXINIT select MAINBOARD_HAS_TPM1 select SOC_INTEL_BROADWELL if BOARD_PURISM_BASEBOARD_LIBREM_BDW config VARIANT_DIR string default "librem13v1" if BOARD_PURISM_LIBREM13_V1 default "librem15v2" if BOARD_PURISM_LIBREM15_V2 config OVERRIDE_DEVICETREE string default "variants/\$(CONFIG_VARIANT_DIR)/overridetree.cb" config DRIVERS_UART_8250IO def_bool n help This platform does not have any way to get standard serial output so disable it by default. config PCIEXP_L1_SUB_STATE def_bool n config PCIEXP_AER def_bool n config MAINBOARD_DIR string default "purism/librem_bdw" config MAINBOARD_PART_NUMBER string default "Librem 13 v1" if BOARD_PURISM_LIBREM13_V1 default "Librem 15 v2" if BOARD_PURISM_LIBREM15_V2 config MAINBOARD_FAMILY string default "Librem 13" if BOARD_PURISM_LIBREM13_V1 default "Librem 15" if BOARD_PURISM_LIBREM15_V2 config MAINBOARD_VERSION string default "1.0" if BOARD_PURISM_LIBREM13_V1 default "2.0" if BOARD_PURISM_LIBREM15_V2 config MAX_CPUS int default 8 config PRE_GRAPHICS_DELAY int default 50 config VGA_BIOS_ID string default "8086,1616" if BOARD_PURISM_LIBREM13_V1 default "8086,162b" if BOARD_PURISM_LIBREM15_V2 # Override the default variant behavior, since the data.vbt is the same # for both variants. config INTEL_GMA_VBT_FILE default "src/mainboard/\$(MAINBOARDDIR)/data.vbt" # This platform has limited means to display POST codes config NO_POST default y endif	{ "pile_set_name": "Github" }
Hypothalamic-pituitary-adrenal axis and clinical symptoms in first-episode psychosis. Abnormalities in hypothalamic-pituitary-adrenal (HPA) axis activity have been reported in patients with psychosis, but it is still unclear how these are related to the clinical symptomatology. Inconsistent findings have emerged from previous studies on the association between cortisol levels and clinical symptoms. Methodological and/or clinical factors, such as patients' diagnosis or illness phase, might partially account for these inconsistencies. The aim of this study was to investigate the association between HPA axis activity and clinical symptoms in first-episode psychosis, taking into account diagnosis and illness phase. Saliva samples were collected in 55 subjects with first-episode psychosis to assess the Cortisol Awakening Response (CAR) and diurnal cortisol levels (AUC-DAY). Severity of symptoms was assessed with the Positive and Negative Syndrome Scale (PANSS). Scores for subscales and symptom dimensions were used as predictors in multivariate analyses in different diagnostic subgroups and in clinically remitted patients. In addition, a systematic review of the literature on this topic was conducted. In subjects with schizophrenia (n=36), the CAR was predicted by the severity of positive symptoms (beta=0.47, p=0.04); in subjects with depressive psychoses (n=8) the CAR was predicted by excitement (beta=0.58, p=0.005), disorganization (beta=0.39, p=0.007) and depressive symptoms (beta=0.32, p=0.005). In patients with bipolar psychoses (n=11) AUC-DAY was predicted negatively by disorganization (beta=-2.82, p=0.009) and positively by excitement (beta=2.06, p=0.009) and positive symptoms (beta=1.28, p=0.02). In the sample in clinical remission (n=9), the CAR was associated with the severity of positive symptoms (beta=1.34, p=0.009) and, negatively, with excitement (beta=-1.05, p=0.04). The systematic review (on a total of 28 papers, including n=1022 patients), found that in patients with psychosis cortisol levels have been associated with the severity of multiple symptom dimensions. HPA axis activity is associated with the severity of multiple types of symptoms in first-episode psychosis. Patients' diagnosis and clinical phase partially influence these associations.	{ "pile_set_name": "PubMed Abstracts" }
Saint Marie (manhwa) Saint Marie (세인트 마리, Seinteu Mari) is a manhwa series created by Yang Yuh-jin. It is about a fictional private school, Saint Marie, that becomes a battleground between good and evil. Story Dah-In Hyun, a normal everyday schoolgirl, discovers that she and the other students at Saint Marie have become pawns in a proverbial chess game. When her best friend dies trying to defend herself, Dah-In finds herself trapped in a battle where no one is who they seem, and the line between black and white is blurred. Characters Dah-In "Illumina" HyunA normal, spunky teenager who just happens to be stuck in between a battle between sides. Dah-In's roommate, Na-Na, is a pawn in a battle between sides, and unintentionally involves Dah-In. Undecided side. Na-NaDah-In's roommate and best friend. She has the power to project pictures onto items, which she passes onto Dah-In upon her death. White pawn. Yoon-Ha Dah-in's "crush" and boyfriend—for a while. Carefree, rebellious, and downright foxy, he enjoys toying with Dah-In's emotions. Unknown side. Seung-Hae "Elphege" Kim He's a freshman in high school, "Matthew" Class. Pessimistic and of noble descent (French), he prefers classy clothes. When it comes to people, he's very cautious and cold-hearted. A perfectionist. Being stubborn and insensitive, some people call him "Whiney". His hobbies are finding other people's weaknesses and screaming. A talent of his is playing the violin. (Seung-Hae even played a violin solo during a choir performance.) His specialty is teleporting, being the fastest among the white chess pieces, and his after school activity is the English club. White Knight. Suh-Rin "Fabian" Kim Freshman in middle school, "Matthew" Class. He's the younger brother of Seung-Hae, and he's two years younger than most middle school students, being a child prodigy. This makes him more immature than most other students at Saint Marie. For some reason, he's in love with Shi-Young. Liking old-fashioned clothes, he almost always has a hat to complement his outfit. He extremely dislikes glamorous girls (like Hyun-Jin). His hobby is assembling plastic models and his talent is fixing electronics. He has great fighting skills, and his after school club is the Geology club. White chess piece. Reception Critical reception for Saint Marie was positive, with Mania.com calling the book "confusing" and an "intriguing piece of work". Anime News Network wrote that the first volume was "A diamond in the rough; Saint Marie is as beautiful to look at as it is intriguing to read." Publishing notes Saint Marie was originally published in the United States by ADV Manga but was put on hold due to budget cuts. ADV has since announced that they have no plans on finishing the series. References External links ADV's entry on Saint Marie Category:Action-adventure comics Category:Daewon C.I. titles Category:2004 comics debuts Category:Manhwa titles	{ "pile_set_name": "Wikipedia (en)" }
Geology Geology classes are designed for students interested in the Earth’s natural features and history. Geology is a great place to start for students thinking of exploring a career in Geology or just looking to understand their planet better. Courses include topics such as earthquakes, volcanoes, minerals, rocks, fossils, rivers, glaciers, landslides, weathering, plate tectonics, climate change, evolution and extinction, and the Pacific Northwest. After taking a Geology class many students claim that they look at the Earth in a different way. Most classes are designed for non science majors and do not have any course specific prerequisite. The classes are designed to engage the student in scientific inquiry and stress interactive learning. The class credits can be used to meet general education requirements for transfer degrees. Transferable Credits Geology courses are lower division collegiate courses that transfer to a four-year college or university. Geology courses may transfer as:	{ "pile_set_name": "Pile-CC" }
Leadership in Nursing Homes: Directors of Nursing Aligning Practice With Regulations. Nursing homes use team nursing, with minimal RN presence, leaving the majority of direct care to licensed practical/vocational nurses (LPNs/LVNs) and unlicensed assistive personnel (UAP), including medication aides. The current article describes challenges faced by nursing home directors of nursing (DONs) leading and managing a team nursing approach, including consideration of scope of practice, delegation and supervision regulations, and related policy implications. A secondary data analysis was performed of qualitative data from a study to develop and test DON guidelines for delegation in nursing home practice. A convenience sample (N = 29) of current or previous DONs and other nursing home leaders with knowledge and expertise in the DON role participated in in-depth, guided interviews. The findings highlight a core concern to nursing licensure policy and regulation: knowledge and practice gaps related to scope of practice and delegation and supervision among DONs, RNs, and LPNs/LVNs, as well as administrators, and the role of nursing leaders in supporting appropriate delegation practices. The findings offer directions for research and practice in addressing challenges in aligning team nursing practices with regulatory standards as well as the related gaps in knowledge among DONs, administrators, and nursing staff. [Journal of Gerontological Nursing, 44(6), 10-14.].	{ "pile_set_name": "PubMed Abstracts" }
Crystal Clear Images Uncover Secrets of Hormone Receptors Many hormones and neurotransmitters work by binding to receptors on a cell’s exterior surface. This activates receptors causing them to twist, turn and spark chemical reactions inside cells. NIH scientists used atomic level images to show how the neuropeptide hormone neurotensin might activate its receptors. Their description is the first of its kind for a neuropeptide-binding G protein-coupled receptor (GPCR), a class of receptors involved in a wide range of disorders and the target of many drugs. “G protein-coupled receptors are found throughout the body. Knowing how they work should help scientists devise better treatments,” said Reinhard Grisshammer, Ph.D., an investigator at the NIH’s National Institute of Neurological Disorders and Stroke (NINDS) and the senior author of the study. Neurotensin is thought to be involved in Parkinson’s disease, schizophrenia, temperature regulation, pain, and cancer cell growth. Previously, Dr. Grisshammer and his colleagues showed how neurotensin binds to the part of its receptor located on a cell’s surface. In this study, they demonstrated how binding changes the structure of the rest of the receptor, which passes through a cell’s membrane and into its interior. There neurotensin receptors activate G proteins, a group of molecules inside cells that controls a series of chemical chain reactions. For these experiments, scientists shot X-rays at crystallized neurotensin receptor molecules. Making crystals of receptors that activate G proteins is difficult. In most studies, scientists have investigated inactive receptors. “The receptor we crystallized is very close to the active form found in nature,” said Dr. Grisshammer. “We may have the first picture of a peptide-binding G protein-coupled receptor just before it engages with the G protein.” To achieve their results, the scientists made multiple genetic modifications to a less active version of the neurotensin receptor they had used before. Experiments performed in test tubes showed that mixing the receptor with neurotensin sparked the G protein reactions for which the scientists were looking. When the scientists looked at the structure of the new crystals, they discovered how binding of neurotensin to the receptor caused critical parts of the receptor located below a cell’s surface to change shape. In particular, they saw that a region in the middle of the receptor dropped like a draw bridge to link the neurotensin binding site to parts of the receptor found inside cells that are important for G protein activation. The scientists concluded that this change may prepare the receptor for activating G proteins. “For years scientists have made educated guesses about how peptide receptors work. Now we may finally know,” said Dr. Grisshammer. His lab plans to continue its work in order to fully understand how neurotensin and other G protein-coupled receptors translate messages delivered by neuropeptides into reactions inside cells. RELATED ARTICLES Modern, sophisticated scans should be used in hospitals to pick out men whose prostate cancers have only spread to a limited number of sites, so they can be offered the chance of cure, a new assessment concludes. UCLA biologists have discovered how head injuries adversely affect individual cells and genes that can lead to serious brain disorders, proposing gene candidates to treat brain diseases associated with traumatic brain injury, such as Alzheimer’s disease and post-traumatic stress disorder.	{ "pile_set_name": "Pile-CC" }
Shooting zombies Young filmmaker infected with urge to produce zombie flick He's only 9 years old, but his mother says Jack Murphy of Ashland is a natural-born director. And with $1,511 raised on Kickstarter, he bought a video camera to shoot and produce an hourlong film about hunting zombies. Comment By John Darling DailyTidings.com By John Darling Posted Oct. 10, 2012 at 2:00 AM Updated Oct 10, 2012 at 2:38 PM By John Darling Posted Oct. 10, 2012 at 2:00 AM Updated Oct 10, 2012 at 2:38 PM » Social News He's only 9 years old, but his mother says Jack Murphy of Ashland is a natural-born director. And with $1,511 raised on Kickstarter, he bought a video camera to shoot and produce an hourlong film about hunting zombies. A homeschooled kid who now attends Willow Wind Community Learning Center, Jack got his idea from watching "Super 8" last year. He thought, "Why not have me, a real kid, make a real zombie movie?" "The idea just popped in my head that I could do it," he said. With the help of his mom, art therapist and nutritional consultant Delaine Due, Jack proposed the movie, called "Z-Minus," on Kickstarter, asking only $80 for a cheap video camera to fulfill his requirement for a summer project. Jack also is the son of Myles Murphy, who works for the Daily Tidings. The project quickly charmed 79 backers, who donated almost 20 times what he asked. When combined with $80 from selling home-squeezed lemonade at "a buck a glass," plus saved-up allowances, it was enough for a $400 Canon Vixia camcorder, lights, sound equipment, tripod and special effects, with plenty left over to throw a pizza party for a growing cast — now at seven neighborhood kids. The project's fundraising period ended Aug. 17. According to his Kickstarter page, Jack will reward donors with credits in the film, a DVD of it, a signed copy of the script and other goodies, depending on their level of gifting. Some backers joined from as far away as the United Kingdom and Germany. "It's been amazing," says Due. "We thought we'd cover the $80 from just family members, but backers were almost all people we didn't know. It was a great learning experience, and the more money that got pledged, the more serious we've had to get about making a really quality movie." Per his mother's deadline, Jack finished the script in June and launched into rehearsing and making phone calls to complete production tasks. The family found mentors to teach Jack the various phases of making his first movie, including Jim Teece of Project A in Ashland, who advised Jack on the purchase of a good video camera. Due says she's pleased with her son's ingenuity, focus and creativity. He showed directorial skills at age 4 and 5, she said, when as a member of the Ashland Children's Theater company he wanted to stop the show so he could block the next scene and tell the actors what to do. The neighborhood actors are thrilled about playing (or killing) zombies, with seventh-grader Kendall Chaspell demonstrating how loud and shrill she can scream — her main acting duty before she faints from fright. Sixth-grader Rees Meads is the chief zombie hunter, which he says is "great fun." Gahl Falkner, already an actor at Oregon Shakespeare Festival, plays the wife of Rees and says she must be slain in her role, just as she is at OSF (she plays Medea's son in "Medea/ Macbeth/ Cinderella"). Jack and his cast recently shot the first sighting of a zombie, at Standing Stone Brewing Co., using the big brewing tanks and instrument panels as a factory scene. "It's great fun shooting. I want to be a famous movie producer really bad when I grow up and also an actor," he says. Jack cut his teeth on movie production by doing video reviews of burger joints as the family drove across the country to Washington, D.C., says Due. "Then I pumped out three scenes for the zombie movie," says Jack, "and got creative block. It was a little difficult, definitely a big delay — but I got over it. After this movie, I'm going to do 'Z-Minus II,' and then I have another movie in the works after that." To read of the project, see www.kickstarter.com/projects/1183199505/z-minus-0. John Darling is a freelance writer living in Ashland. Email him at [email protected].	{ "pile_set_name": "Pile-CC" }
Fabrication of graphene/polyaniline composite for high-performance supercapacitor electrode. Composite films of graphene and polyaniline nanofibers are prepared by in situ polymerization of aniline monomer in graphene suspension. The morphology and microstructure of samples are examined by scanning electron microscopy (SEM), transition electron microscopy (TEM), and X-ray diffraction (XRD). Electrochemical performances are characterized by cyclic voltammetry (CV) and galvanostatic charge/discharge measurements. Graphene is homogeneously coated by polyaniline nanofibers with diameter of 40 nm. Supercapacitors based on the graphene/polyaniline conductive composite films exhibit large electrochemical capacitance (994 F/g) at a discharge rate of 2.0 A/g in 1 M H2SO4 solution, which is much higher than the graphene (320 F/g) and polyaniline electrode (210 F/g). The excellent performance is not only due to the graphene which can provide more active sites for nucleation of polyaniline, but also associated with a good redox activity of ordered polyaniline nanofibers. Moreover, the composite films exhibit excellent long cycle life during charge/discharge processes. After 1000 cycles, the specific capacitance decreases 11% of initial capacitance compared to 28% for polyaniline nanofibers. The resulting composite is a promising electrode material for high-performance electrical energy storage devices.	{ "pile_set_name": "PubMed Abstracts" }
NMR and NQR study of Si-doped (6,0) zigzag single-walled aluminum nitride nanotube as n or P-semiconductors. Density functional theory (DFT) calculations were performed to investigate the electronic structure properties of pristine and Si-doped aluminum nitride nanotubes as n or P-semiconductors at the B3LYP/6-31G* level of theory in order to evaluate the influence of Si-doped in the (6,0) zigzag AlNNTs. We extended the DFT calculation to predict the electronic structure properties of Si-doped aluminum nitride nanotubes, which are very important for production of solid-state devices and other applications. To this aim, pristine and Si-doped AlNNT structures in two models (Si(N) and Si(Al)) were optimized, and then the electronic properties, the isotropic (CS(I)) and anisotropic (CS(A)) chemical shielding parameters for the sites of various (27)Al and (14)N atoms, NQR parameters for the sites of various of (27)Al and (14)N atoms, and quantum molecular descriptors were calculated in the optimized structures. The optimized structures, the electronic properties, NMR and NQR parameters, and quantum molecular descriptors for the Si(N) and Si(Al) models show that the Si(N) model is a more reactive material than the pristine or Si(Al) model.	{ "pile_set_name": "PubMed Abstracts" }
Japanese Government: Stop the slaughter of dolphins in Taiji Why this is important This is the shame of Japan. Again, hundreds of dolphins were slaughtered in Taiji. For how long will Japan shame itself amongst nations as being the only country to allow the cruel mass murder and hunting of dolphins, an intelligent mammal that does no harm to humans? This is sickening. Please do not pretend it is a valued culture. It only started recently, it did not start 400 years ago. It is driven by greed and violence. Do not defend it. If something is wrong, then it is time to improve your behaviour and move onwards to a better future. This is not a case of the West attacking Japan, it is a case of your fellow humans showing you that something you are doing is evil. Stop the posturing. Stop the pretending. Stop trying to divert blame elsewhere. Do the right thing. We beg you. To all those signing, thank you! Remember that this is word of mouth. It is not being sent out by Avaaz. Please forward it to everyone that you know. We nearly have the 20, 000 signatures!! Do not let the pressure drop because the main season is over. Lets keep it up!	{ "pile_set_name": "Pile-CC" }
The aim of the paper is to validate the use of measurement methods in the study of GFRP joints. A number of tests were carried out by means of a tensile machine. The studies were concerned with rivet connection of composite materials. One performed two series of tests for two different forces and two fibre orientations. Using Finite Element Method (FEM) and Digital Image Correlation (DIC), strain maps in the test samples were defined. The results obtained with both methods were analysed and compared. The destructive force was analysed and, with the use of a strain gauge, the clamping force in a plane parallel to the annihilated sample was estimated. Destruction processes were evaluated and models of destruction were made for this type of materials taking into account their connections, such as riveting.	{ "pile_set_name": "Pile-CC" }
package org.zstack.header.identity import org.zstack.header.errorcode.ErrorCode doc { title "配额清单" ref { name "error" path "org.zstack.header.identity.APIUpdateQuotaEvent.error" desc "错误码，若不为null，则表示操作失败, 操作成功时该字段为null", false type "ErrorCode" since "0.6" clz ErrorCode.class } ref { name "inventory" path "org.zstack.header.identity.APIUpdateQuotaEvent.inventory" desc "配额清单" type "QuotaInventory" since "0.6" clz QuotaInventory.class } }	{ "pile_set_name": "Github" }
The effect of bacterial biofilms on post-sinus surgical outcomes. Although the existence of biofilms on the sinus mucosa of patients with chronic rhinosinusitis (CRS) is now well established, the role that these structures play remains unclear. It is thought that biofilms may contribute to the recalcitrant and persistent nature that characterizes CRS, but little research exists documenting the effect that they have on postoperative mucosal outcomes. This article presents a retrospective analysis of sinus surgical patients and correlates the presence of biofilms with mucosal outcomes. This study was performed to evaluate the role that bacterial biofilms have on post-sinus surgical outcomes. A retrospective analysis of prospectively collected data was performed on 40 patients undergoing endoscopic sinus surgery (ESS) for CRS. Preoperative demographic, clinical, and radiologic data were recorded from each patient and, intraoperatively, sinus culture specimens and mucosal samples were obtained for microbiological and microscopic examination. Biofilm determination was performed using confocal scanning laser microscopy. Postoperatively, patients were followed up for a minimum of 8 months with endoscopic evaluation of their sinonasal mucosa. The presence of ongoing symptoms was recorded also. Bacterial biofilms were found in 20 (50%) of the 40 CRS patients. Patients with biofilms had significantly worse preoperative radiological scores and, postoperatively, had statistically worse postoperative symptoms and mucosal outcomes. The only other factor that was statistically related to an unfavorable outcome was the presence of fungus at the time of surgery. In this study the presence of polyps, eosinophilic mucin, or pus was not related to poor outcomes. This retrospective study showed that bacterial biofilms and fungus were correlated with the persistence of postoperative symptoms and mucosal inflammation after sinus surgery for CRS. This provides evidence that biofilms indeed may play an active role in perpetuating inflammation in CRS patients and may explain the recurrent and resistant nature of this disease. Therapies targeted at removing biofilms may be important in the management of recalcitrant CRS.	{ "pile_set_name": "PubMed Abstracts" }
The gendered experiences of children in child-headed households in Swaziland. This study investigated the gender dynamics of living in child-headed households (CHHs) in a rural area in Swaziland that experiences high levels of drought, poverty and HIV and AIDS. Using a qualitative research methodology, the study examined ways in which children in CHHs meet their daily family needs and address their vulnerabilities according to their gender, focusing on the experiences of the children. The study sample consisted of 10 households, with 5 boy and 5 girl-headed households from the chiefdoms within the area. A semi-structured interview guide was used to conduct interviews in the respondents' own homes. The study focused on the gendered coping strategies used by the children to sustain their household welfare. Three factors were examined: leadership, food provision and education. The findings show that birth order conferred headship or leadership to the eldest sibling irrespective of their gender. Variations in the performance of the three factors, which were influenced by the gender of the household head, were observed. Generally, the children acted in accordance with their socio-cultural norms demanded in fulfilling the role of leadership and food provision. Boy-headed households become disadvantaged because of the boys' reluctance to take tasks which would contravene traditional Swazi notions of masculinity. This was exacerbated by societal expectations of the independence of boys. Hegemonic masculinity puts boys at a disadvantage when societal expectations require them to enact their masculinity through independence, rather than by drawing on the support of their neighbours/family/social networks. However, girls conformed to traditional Swazi norms. Societal compassion with the vulnerability of girls produced sustainable social arrangements and fostered resilience in girl-headed households.	{ "pile_set_name": "PubMed Abstracts" }
Russian hackers infiltrated voter databases and software systems in 39 states during the 2016 presidential election, an incursion so brazen, it prompted the Obama administration to call Moscow on the hotline to complain, it was reported Tuesday. The cyberattack targeted software used by poll workers on Election Day, accessed a campaign finance database in at least one state and tried to delete or alter voter data in Illinois, Bloomberg News reported. The interference in the election process led the Obama White House to use the “red phone,” a direct line between Washington and the Kremlin, to warn that Russia’s action could instigate a broader conflict, Bloomberg reported. The details of the cyber-assault on the election, some of which were also contained in reporting by the Intercept using leaked classified documents from the National Security Agency, show the extent of Russian meddling and warn of potential weaknesses that could be exploited down the road. A former senior US official told Bloomberg that Moscow now has three years to build on their knowledge of the voting process before the next presidential election and is confident they will use what they have learned. Former FBI Director James Comey, testifying last week before the Senate Intelligence Committee, which is investigating Russian interference in the election, warned that the Kremlin “will be back.” “If they are patriotic, they contribute in a way they think is right, to fight against those who say bad things about Russia,” Putin said. After the Obama administration complained to Russia about the aggressive intrusions, Moscow asked for more information and said it would investigate the allegations, Bloomberg reported. “Last year, as we detected intrusions into websites managed by election officials around the country, the administration worked relentlessly to protect our election infrastructure,” Eric Schultz, a spokesman for former President Barack Obama, told Bloomberg. “Given that our election systems are so decentralized, that effort meant working with Democratic and Republican election administrators from all across the country to bolster their cyber-defenses.”	{ "pile_set_name": "Pile-CC" }
San Francisco urban planninghttp://kalw.org enThe Source: Doyle Drive and the Father of the Golden Gate Bridgehttp://kalw.org/post/source-doyle-drive-and-father-golden-gate-bridge <p>You can’t talk transportation in the Bay Area without talking about bridges. Everybody knows the Bay Bridge and the Golden Gate Bridge. And if you’re driving between the two, you travel on another bridge: an elevated and windy two-lane road through San Francisco's Presidio called Doyle Drive. That's changing this weekend, as the old Doyle Drive, built in 1937, continues the transformation into the Presidio Parkway.</p>Wed, 25 Apr 2012 22:19:05 +0000Steven Short9636 at http://kalw.orgThe Source: Doyle Drive and the Father of the Golden Gate Bridge	{ "pile_set_name": "Pile-CC" }
Diadelia vadoni Diadelia vadoni is a species of beetle in the family Cerambycidae. It was described by Breuning in 1957. References Category:Diadelia Category:Beetles described in 1957	{ "pile_set_name": "Wikipedia (en)" }
Synopsis: Awe is a Telugu film directed by Prasanth Varma and produced by Telugu star Nani. It stars Kajal Aggarwal, Nithya Menen, Regina Cassandra, Eesha Rebba, Srinivas Avasarala, and Murali Sharma in the lead roles Share your reviews about Telugu movie Awe Trailers & Video Clips Times & Tickets We couldn't find any session times for this movie. There are a number of possible reasons for this: 1) The session times are not yet finalised. 2) We are not showing the past session times which are not relevant.	{ "pile_set_name": "Pile-CC" }
Q: frames layout using tkinter I'm playing with tkinter frames layout. I got a great anwser from Bryan yestarday, unfortunetly I run into problem filling my frames. For some reason right upper frame is getting some extra space from the main frame and that breaks my layout, how can I prevent this from happening ? its OK if the label_frame expands but I don't want it to get an extra space from the main frame. import sys import os import Tkinter as tk import ttk as ttk # # Right Window # class RightUpperWindow(tk.Frame): def __init__(self, master=None): self.parent = master tk.Frame.__init__(self, self.parent, bg='bisque', borderwidth=0, relief="sunken") self.__create_layout() def __create_layout(self): self.label_frame = tk.LabelFrame(self, text="I'm a Label frame", padx=0, pady=0, borderwidth=0, width = 1) self.label1=tk.Label(self.label_frame, text="text1") self.label2=tk.Label(self.label_frame, text="text2") self.label3=tk.Label(self.label_frame, text="text3") self.entry1 = tk.Entry(self.label_frame) self.entry2 = tk.Entry(self.label_frame) self.entry3 = tk.Entry(self.label_frame) self.label_frame.grid(row=0, column=0, sticky=(tk.N, tk.S, tk.W, tk.E)) self.label1.grid(row=0, column=0, sticky=(tk.N, tk.S, tk.W, tk.E)) self.label2.grid(row=1, column=0, sticky=(tk.N, tk.S, tk.W, tk.E)) self.label3.grid(row=2, column=0, sticky=(tk.N, tk.S, tk.W, tk.E)) self.entry1.grid(row = 0, column = 1, sticky=(tk.N, tk.S, tk.W, tk.E)) self.entry2.grid(row = 1, column = 1, sticky=(tk.N, tk.S, tk.W, tk.E)) self.entry3.grid(row = 2, column = 1, sticky=(tk.N, tk.S, tk.W, tk.E)) self.label_frame.columnconfigure(0, weight=1) self.label_frame.rowconfigure(0, weight=1) # # MainWindow # class MainWindow(tk.Frame): def __init__(self, master=None): self.parent = master tk.Frame.__init__(self, self.parent, bg='bisque', borderwidth=1, relief="sunken") self.__create_layout() def __create_layout(self): self.frame1 = tk.Frame(self, bg="grey") self.frame2 = RightUpperWindow(self) #tk.Frame(self, bg="blue") self.frame3 = tk.Frame(self, bg="green") self.frame4 = tk.Frame(self, bg="brown") self.frame5 = tk.Frame(self, bg="pink") self.frame1.grid(row=0, column=0, rowspan=4, columnspan=8, sticky=(tk.N, tk.S, tk.W, tk.E)) self.frame2.grid(row=0, column=8, rowspan=4, columnspan=2, sticky=(tk.N, tk.S, tk.W, tk.E)) self.frame3.grid(row=4, column=0, rowspan=2, columnspan=5, sticky=(tk.N, tk.S, tk.W, tk.E)) self.frame4.grid(row=4, column=5, rowspan=2, columnspan=5, sticky=(tk.N, tk.S, tk.W, tk.E)) self.frame5.grid(row=5, column=0, rowspan=1, columnspan=10, sticky=(tk.N, tk.S, tk.W, tk.E)) for r in range(6): self.rowconfigure(r, weight=1) for c in range(10): self.columnconfigure(c, weight=1) # # MAIN # def main(): root = tk.Tk() root.title("Frames") root.geometry("550x300+525+300") root.configure(background="#808080") root.option_add("*font", ("Courier New", 9, "normal")) window = MainWindow(master=root) window.pack(side="top", fill="both", expand=True) root.mainloop() if __name__ == '__main__': main() planned layout A: The only problem is that you haven't given a weight to the row and the column that the label frame is in. You've given weights to the widgets in the label frame, but not weights to RightUpperWindow. Add this to RightUpperWindow.__create_layout self.rowconfigure(0, weight=1) self.columnconfigure(0, weight=1) Every time you use grid in a container, you need to give at least one row and one column in that container a weight. This needs to be done for every container that is using grid to manage its children. Personally, if this were my code I'd use pack to put the labelframe inside of UpperRightWindow since it's the only window in that frame. With pack yo don't have to use extra lines to add weights to rows and columns. There's nothing wrong with mixing grid and pack in the same application, as long as you use them in different frames. The above fixes the problem that the inner labelframe wasn't expanding to fill the space given to it. You also have the problem that the wrong widgets inside the label frame are expanding. You're currently giving a weight to row and column 0 inside the labelframe, which will not give you the expected output. Since you want all of the rows to be a uniform height, give the row below the last widget a weight so that it takes up all the extra space. Also, you probably want to give column one a weight, since it makes more sense to grow and shrink the input field rather than the label. Change this: self.label_frame.columnconfigure(0, weight=1) self.label_frame.rowconfigure(0, weight=1) ... to this: self.label_frame.columnconfigure(1, weight=1) self.label_frame.rowconfigure(3, weight=1)	{ "pile_set_name": "StackExchange" }
/* Copyright (c) 2003-2014, CKSource - Frederico Knabben. All rights reserved. For licensing, see LICENSE.md or http://ckeditor.com/license */ CKEDITOR.plugins.setLang("devtools","en",{title:"Element Information",dialogName:"Dialog window name",tabName:"Tab name",elementId:"Element ID",elementType:"Element type"});	{ "pile_set_name": "Github" }
Kobresia simpliciuscula Kobresia simpliciuscula is a species of sedge known by the common names false sedge, simple bog sedge and simple kobresia. It has a circumpolar distribution, occurring throughout the northern latitudes of the Northern Hemisphere. This perennial plant forms tufts of several triangular stems reaching up to 50 centimeters in height. It lacks rhizomes. The leaves are up to 20 centimeters long. The inflorescence contains up to 12 spikes of flowers. Light is required for the seeds to germinate. This plant occurs on tundra and in alpine climates. It grows in wet habitat types such as ponds and meadows. It often grows in calcareous substrates such as limestone. References External links Category:Cyperaceae Category:Flora of Subarctic America Category:Flora of Russia Category:Plants described in 1803 Category:Taxa named by Kenneth Kent Mackenzie	{ "pile_set_name": "Wikipedia (en)" }
Effects of Photodynamic Therapy on the Growth and Antifungal Susceptibility of Scedosporium and Lomentospora spp. Scedosporium and Lomentospora species are the second most frequent colonizing, allergenic, or invasive fungal pathogens in patients with cystic fibrosis, and are responsible for infections varying from cutaneous and subcutaneous tissue infections caused by traumatic inoculation to severe systemic diseases in immunocompromised patients. The clinical relevance of fungal airway colonization for individual patients harboring Scedosporium and Lomentospora species is still an underestimated issue. The high resistance of Scedosporium and Lomentospora species to antifungal drugs has highlighted the need for alternative treatment modalities, and antimicrobial photodynamic therapy may be one such alternative. In this study, methylene blue was applied as a photosensitizing agent to 6 type strains of Scedosporium and Lomentospora species, and we irradiated the strains using a light-emitting diode (635 ± 10 nm, 12 J/cm2). We evaluated the effects of photodynamic therapy on strain growth and on the in vitro susceptibility of the strains to itraconazole, voriconazole, posaconazole, and amphotericin B. A colony-forming unit reduction of up to 5.2 log10 was achieved. Minimal inhibitory concentration ranges also decreased significantly with photoinactivation. Photodynamic therapy improved both the inactivation rates and the antifungal susceptibility profile of all fungal isolates tested.	{ "pile_set_name": "PubMed Abstracts" }
Introduction ============ Asymmetric cell divisions are critical for cell fate determination during embryogenesis, organogenesis, and differentiation ([@bib65]). Since the budding yeast Saccharomyces cerevisiae undergoes an asymmetric division, it is an effective model for identifying factors that are actively segregated along the polarity axis and the underlying molecular mechanisms responsible for their segregation ([@bib68]). In yeast, the two type V myosin motors Myo2 and Myo4 deliver organelles, secretory vesicles, and mRNAs to the daughter cell ([@bib68]; [@bib15]; [@bib29]). Myo2 also plays a role in nuclear migration by guiding spindle microtubules along actin cables in concert with a complex of proteins at the plus ends of microtubules, including Kar9 and Bim1 ([@bib51]; [@bib62]; [@bib92]). A redundant nuclear positioning pathway requires the dynein--dynactin complex ([@bib27]; [@bib53]; [@bib39]). Recent data also implicates the exocyst complex in anchoring ER tubules that extend from the mother nuclear envelope (NE) to the bud cortex in maintaining nuclear position at the bud neck ([@bib50]). Further, the ubiquitylation of a component of the nuclear pore complex (NPC) was shown to function in nuclear migration through the recruitment of dynein light chain to the NE ([@bib41]). The latter process reflects several connections uncovered between NPCs and the cytoskeleton ([@bib82]; [@bib80]; [@bib11]; [@bib81]). NPCs are massive protein assemblies embedded in the NE that control the flux of molecules between the nucleus and cytoplasm. Each NPC is composed of ∼30 individual protomers termed nucleoporins (nups; [@bib71]; [@bib18]) found in distinct subcomplexes ([@bib78], [@bib79]; [@bib38]; [@bib59]; [@bib10]; [@bib84]; [@bib2],[@bib3]; [@bib66]). These subcomplexes are thought to form modular building blocks that contribute to the formation of the concentric membrane, inner and outer ring complexes that surround a central transport channel ([@bib2],[@bib3]). The channel itself is rich in unstructured nups like Nsp1/Nup62 that contain repetitive peptide motifs of Phe-Gly (FG-nups; [@bib2],[@bib3]). Nsp1 helps form two subcomplexes at the NPC composed of Nup49, Nup57, and Nic96, or Nup82 and Nup159 ([@bib64]; [@bib63]; [@bib37]; [@bib74]; [@bib6], [@bib7]). Because transport through NPCs is essential for cell life, there are likely mechanisms to ensure that NPC numbers can accommodate cell type--specific nuclear transport loads. We understand little about mechanisms that control NPC number. Lymphocyte stimulation results in a doubling of NPC number, which suggests that external inputs can up-regulate the NPC assembly pathway ([@bib60]). Further, the S-phase doubling of NPCs observed in cell culture suggests that NPC assembly is linked to the cell cycle ([@bib60]), perhaps through cyclin-dependent kinases ([@bib57]). Mutations in nups important for NPC assembly can also impact differentiation programs ([@bib56]; [@bib23]; [@bib20]). These studies cumulatively suggest that NPCs themselves might be important for cell fate determination and underscore the importance of identifying mechanisms that control NPC number. One way to modulate NPC number is to regulate the de novo assembly of NPCs, which occurs by postmitotic and interphase mechanisms ([@bib24]). During de novo NPC assembly in interphase, the membrane and inner ring complexes assemble at the NE first and might directly contribute to fusion of the inner and outer nuclear membranes ([@bib58]; [@bib66]; [@bib24]; [@bib26]; [@bib32]; [@bib86]). Other conserved ER and inner nuclear membrane proteins might also act at these early steps ([@bib22]; [@bib14]; [@bib83]; [@bib91]), which are followed by the recruitment of the outer ring complex, Nic96, and the FG-nups ([@bib93]; [@bib24]). Since budding yeast NEs/NPCs remain intact during mitosis, determining NPC number relies on both de novo assembly and mechanisms that segregate NPCs between mother and daughter cells. One study suggests that mother NPCs are restricted from being inherited by the daughter, placing a burden on de novo NPC assembly to support daughter viability ([@bib75]). Since the known NPC assembly mechanism is relatively slow compared to yeast mitosis ([@bib88]; [@bib26]), there might be a faster daughter-specific NPC assembly mechanism that has yet to be uncovered. It is also plausible that there is a mechanism that ensures NPC inheritance. Such mechanisms exist for several organelles including mitochondria ([@bib46]), vacuoles ([@bib42]), peroxisomes ([@bib43]; [@bib30]), cortical ER ([@bib25]; [@bib28]) and late Golgi ([@bib70]). Consistent with the idea that NPCs are also actively transmitted to daughter cells, the use of a tandem fluorescent "timer" protein showed a bias of "old" nups in daughters ([@bib49]). In an effort to identify putative inheritance and/or de novo NPC assembly mechanisms needed to ensure that adequate numbers of NPCs are present in daughter cells, we investigated the distribution of newly synthesized and assembled pools of representative components of distinct nup subcomplexes through mitotic divisions in budding yeast. We identified a newly synthesized pool of the nup Nsp1 that accumulates between S and G2 phase and is directed into the bud by interactions with ER in a pathway that requires Myo2. Inactivation of newly synthesized Nsp1 results in a dramatic loss of NPC inheritance by daughter cells. Our data are consistent with a model in which Nsp1 is a critical player in a pathway governing NPC number in daughter cells, which ensures their viability. Results ======= Bud-directed distribution of newly synthesized Nsp1 --------------------------------------------------- To investigate how budding yeast nups are segregated between mother and daughter cells, we visualized both newly synthesized and existing pools of representative members of the membrane (Ndc1) and inner (Nup170) and outer ring (Nup85) complexes, in addition to the FG-nup Nsp1 ([Fig. 1 A](#fig1){ref-type="fig"}) using a recombination induced tag exchange (RITE) approach ([Fig. 1 B](#fig1){ref-type="fig"}; [@bib85]). Nup-RITE fusions are expressed from their endogenous gene loci, and tag exchange between mCherry and GFP genes is initiated by an estradiol-induced activation of a constitutively expressed Cre recombinase--estradiol-binding domain (EBD) fusion ([Fig. 1 B](#fig1){ref-type="fig"}; [@bib55]). Unlike photoconvertible proteins like Dendra2, which mature slowly (t~1/2~ of maturation ∼1.5 h; [@bib94]), the RITE approach leverages the fast maturation of GFP (t~1/2~ of maturation \<15 min; [@bib45]) to visualize the production of "new" nups. Further, the "old" mCherry signal did not increase after the first appearance of "new" green fluorescence, which supports the finding that we can accurately assess the distribution of both old and new versions of these nups through anaphase ([Fig. S1](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp1}). ![A newly synthesized bud-directed pool of Nsp1. (A) Schematic of the NPC with major structural units and representative nups indicated in bold. ONM and INM, outer and inner nuclear membrane, respectively. (B) Schematic of the RITE cassette inserted in frame at the 3′ end of nup genes. Nup-mCherry fusions (old) are produced in cells. The addition of estradiol releases a Cre recombinase--EBD fusion that promotes loxP-mediated recombination, which leads to the replacement of the mCherry gene with a GFP ORF and the production of a nup-GFP (new) protein. (C--F) Cells expressing the indicated Nup-RITE fusions (PCCPL520, PCCPL522, PCCPL526, and WZCPL2) were incubated in the presence of estradiol, and both Nup-GFP and Nup-mCherry were imaged every 3 min through the indicated anaphase stages. Each fluorescence micrograph is a maximum-intensity projection of a deconvolved z series. Note the arrowhead in F showing a bud-localized focus of Nsp1 that does not colocalize with the NE until the last time point (see MERGE and [Video 1](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp2}). C1--F2 are plots (left) of a ratio of tf (green and red) in daughters (tf~d~) versus mothers (tf~m~). These ratios were then divided by a ratio of the surface area of the proportion of the dividing nucleus (through a middle z plane) found in either the daughter (sa~d~) or mother (sa~m~) to yield plots at right. 6 ≤ n ≤ 13. Error bars represent the standard deviation from the mean value. Bars, 2 µm.](JCB_201305115_Fig1){#fig1} Consistent with published data ([@bib48]), we observed that the "old" mCherry nups segregated with the NE ([Fig. 1, C--F](#fig1){ref-type="fig"}, bottom panels), which suggests that NPCs are inherited by daughter cells. We simultaneously visualized the appearance and segregation of the "new" GFP nups. Since the genetic switch is not synchronous between cells, we focused on those in which green fluorescence appeared late in the cell cycle to enable the visualization of NPC protomers rather than newly assembled NPCs. GFP fusions of Nup85, Ndc1, and Nup170 segregated equivalently to their "old" counterparts, as reflected in similar daughter/mother total nuclear fluorescence ratios (tf~d~/tf~m~) of red and green proteins ([Fig. 1, C1, D1, and E1](#fig1){ref-type="fig"}). To normalize for the amount of NE in the daughter and mother, we divided the tf~d~/tf~m~ ratio for a given daughter--mother pair by a daughter/mother ratio of nuclear surface area (sa~d~/sa~m~). In general, this number hovers around unity for both the newly synthesized and old nups, which indicates a strong correspondence between NE surface area and the number of NPCs ([Fig. 1, C2, D2, and E2](#fig1){ref-type="fig"}). These data suggest that for the membrane and inner and outer ring complexes (the scaffold of the NPC), there is little bias in the enrichment of these NPC protomers in either the mother or daughter. Thus, we find that NPCs are segregated concomitantly with the NE between mother and daughter cells and that asymmetry in the NPC assembly pathway is minimal for these components. In contrast to the scaffold nups, the FG-nup Nsp1-GFP did not display a symmetrical distribution. First, although low levels of NE fluorescence could be visualized in the mother and daughter, a discrete Nsp1-GFP focus was visualized in the daughter at the cell cortex ([Fig. 1 F](#fig1){ref-type="fig"}, arrowheads). As anaphase progressed, the focus moved from the cortex and integrated into the NE ([Fig. 1 F](#fig1){ref-type="fig"} and [Video 1](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp3}). Consistent with these observations, the calculated tf~d~/tf~m~ of the GFP fluorescence remained at ∼0.2 for the first three stages of anaphase, but by cytokinesis the ratio reached ∼0.7, as exhibited by old and new ratios of all nups ([Fig. 1, F1](#fig1){ref-type="fig"}). To rule out that this pool of Nsp1 resulted from an aggregation or instability of the GFP-tagged Nsp1, we confirmed that the cytoplasmic Nsp1-GFP accumulation could be reproduced with monomeric GFP ([Fig. S2 A](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp4}), and there was no change in protein levels or stability of Nsp1-GFP compared to untagged Nsp1 by Western blotting (Fig. S2 B). Further, as shown in Fig. S2 C, we could observe bud-localized foci of untagged Nsp1 by immunofluorescence using specific anti-Nsp1 antibodies. In addition, we affinity purified Nsp1-GFP and confirmed that all established interacting partners including Nup49, Nup57, Nic96, Nup159, Dyn2, and Nup82 ([@bib64]; [@bib36], [@bib37]; [@bib93]; [@bib74]; [@bib7]; [@bib82]) were specifically enriched compared to controls (Fig. S2 D). Last, the Nsp1 fusion proteins generated in this study support viability ([Fig. 2 B](#fig2){ref-type="fig"}). Collectively, these data support the finding that the Nsp1-GFP foci represent a previously undiscovered pool of Nsp1 localized to daughter cells before completion of anaphase. ![Conditional and specific trapping of newly synthesized nups. (A) Schematic of the "anchor-away" strategy where nup genes are genomically tagged with ORFs encoding FRB or FRB-GFP and expressed in cells containing a plasma membrane--localized anchor (Pma1-FKBP12; hook). In the presence of rapamycin, only newly synthesized/cytoplasmic nups (Nup-FRB-GFP~CYT~, green ovals) are sequestered, but not those bound to NPCs (Nup-FRB-GFP~NPC~, red ovals). (B) Yeast strains containing the indicated Nup-FRB fusions (PCCPL260, PCCPL251) with wild-type control (HHY110), and indicated plasmids were plated in 10-fold serial dilutions on YPD plates containing rapamycin or carrier (DMSO) and imaged after 48 h at 30°C. (C) Deconvolved fluorescence micrographs (with bright field) of a top and middle z section of cells expressing the indicated Nup-FRB-GFP fusions (PCCPL259, PCCPL302, CPL1238, and CPL1239) incubated for 4 h with rapamycin or with rapamycin and cycloheximide. Bars, 2 µm.](JCB_201305115_Fig2){#fig2} "Anchor-away" of newly synthesized cytoplasmic nups --------------------------------------------------- To directly query the function of this bud-localized pool of Nsp1, we needed an experimental system capable of rapid and specific abrogation of the function of a newly synthesized cytoplasmic pool of nups (which we term nup~CYT~) without affecting the pool assembled into NPCs (nup~NPC~). We adopted the "anchor-away" system ([@bib40]), which exploits the conditional high-affinity dimerization of the FRB and FKBP12 protein domains in the presence of the drug rapamycin ([Fig. 2 A](#fig2){ref-type="fig"}). By expressing nups as an FRB fusion, we selectively recruit their newly synthesized nup~CYT~ pools to an abundant plasma membrane trap (Pma1-FKBP12; [Fig. 2 A](#fig2){ref-type="fig"}). Growth of Nup-FRB fusion--containing strains on medium with carrier alone (DMSO) showed that the FRB moiety does not appreciably influence their fitness ([Fig. 2 B](#fig2){ref-type="fig"}), whereas the addition of rapamycin led to growth arrest, which is consistent with the trapping of essential proteins ([Figs. 2 B](#fig2){ref-type="fig"} and [S3](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp5}). Further, plasmid-expressed NSP1 and NIC96 were able to suppress rapamycin-induced growth inhibition, ensuring that nup trapping did not act as a dominant-negative ([Fig. 2 B](#fig2){ref-type="fig"}). As expected, we observed an accumulation of all tested Nup-FRB-GFP fusions at the plasma membrane after incubation in the presence of rapamycin ([Fig. 2 C](#fig2){ref-type="fig"}). To test whether our trap was specific to nup~CYT~ over nup~NPC~, we incubated strains expressing Nup-FRB-GFP fusions in the presence of rapamycin and cycloheximide (to inhibit protein synthesis). Under these conditions, the Nup-FRB-GFP plasma membrane pool was completely absent, and nup~NPC~ was unaffected ([Fig. 2 C](#fig2){ref-type="fig"}). These data are consistent with the interpretation that the plasma membrane pool is made up exclusively of Nup-FRB-GFP~CYT~. Thus, this system is capable of specifically inhibiting nup~CYT~ without affecting nup~NPC~. Trapping of the Nsp1 complex reduces NPC number in daughter cells ----------------------------------------------------------------- Since the Nsp1~CYT~ foci are newly synthesized and appear to be integrated into the NE at the end of anaphase ([Fig. 1 F](#fig1){ref-type="fig"}), we reasoned that they might represent NPC assembly intermediates. We therefore examined how trapping of Nsp1-FRB-GFP~CYT~ impacted the relative levels of NPCs in mother and daughter cells after anaphase completion. Because there is little turnover of nups~NPC~ ([Fig. 2 C](#fig2){ref-type="fig"}), we assume that Nup-FRB-GFP~NPC~ represents NPCs; we localized Nup170-mCherry in the same cells as an independent NPC marker. Nsp1-FRB-GFP--expressing cells were grown to mid-log phase, incubated in the presence of rapamycin or carrier alone (DMSO), and imaged over one to two cell cycles ([Fig. 3 A](#fig3){ref-type="fig"}). Strikingly, the trapping of Nsp1-FRB-GFP~CYT~ resulted in a dramatic reduction in the levels of Nsp1-FRB-GFP~NPC~ in daughter cells after mitosis, while also affecting (although to a lesser extent) the daughter levels of Nup170-mCherry ([Fig. 3B](#fig3){ref-type="fig"}). When expressed as a tf~d~/tf~m~ ratio, we observed a 72% reduction in daughter levels of Nsp1-FRB-GFP~NPC~ from an average tf~d~/tf~m~ of 0.57 in DMSO-treated cells compared to 0.16 in trapped cells ([Fig. 3 C](#fig3){ref-type="fig"}). This change in NPC levels could not be explained by the relatively modest (34%) change in nuclear size observed upon trapping Nsp1-FRB-GFP~CYT~ ([Fig. S4](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp6}). Similar experiments were performed with additional members of the Nsp1 complex including Nup49-FRB-GFP, Nup57-FRB-GFP, and Nic96-FRB-GFP. In these cells, the tf~d~/tf~m~ ratios were also significantly reduced in the presence of rapamycin ([Fig. 3 C](#fig3){ref-type="fig"}). Because we did not observe a restriction of NPC inheritance under wild-type conditions ([Fig. 1](#fig1){ref-type="fig"}), these data suggest that there is a specific inhibition of the transmission of NPCs upon sequestering newly synthesized, cytoplasmic components of the Nsp1 complex. ![Trapping of newly synthesized components of the Nsp1 complex inhibits NPC inheritance. (A) Schematic of the experimental design where anchor-away (see [Fig. 2](#fig2){ref-type="fig"}) strains expressing Nup-FRB-GFP fusions were grown to mid-log phase and treated with DMSO or rapamycin (to trap Nup-FRB-GFP~CYT~). Unbudded cells were imaged through one or two cell cycles (∼4 h). Quantification of Nup-FRB-GFP~NPC~ was performed at a time point directly after anaphase is completed in mother (M) and daughter (D) cells. (B) Deconvolved fluorescent images showing the distribution of Nsp1-FRB-GFP and Nup170-mCherry (CPL1229) in a middle z plane of cells treated with DMSO or rapamycin after anaphase. Pixels in the GFP channel have been digitally saturated to aid in the visualization of the daughter NE. Cell boundaries are denoted by the outlines. Bar, 2 µm. (C) In each of the indicated Nup-FRB-GFP/Nup170-mCherry--expressing strains (CPL1229, PCCPL510, PCCPL511, and PCCPL293), the tf of the GFP and mCherry fluorescence of daughter (tf~d~) and mother (tf~m~) NEs was measured after completion of anaphase under DMSO- or rapamycin-treated conditions. 30 ≤ n ≤ 75. A ratio of tf~d~/tf~m~ was plotted for individual cells in a box plot: boxes are the 25th to 75th percentiles and whiskers are the 10th and 90th percentiles. Outliers are shown as individual points. The mean is indicated by "+." Significance was assessed using the Student's t test. \\\, P = 0.0003; \\\\, P \< 0.0001. (D) Small-budded cells expressing Nsp1-FRB and Nup133-2xDendra (CPL1231) were treated with DMSO or rapamycin. Nup133-2xDendra was photoconverted to its red form (photoconversion) and allowed to progress through anaphase. The fluorescence images are a middle focal plane from a deconvolved z series in red (old) and green (new) channels. Cell boundaries are denoted by the outlines. Bar, 2 µm. (E) tf~d~/tf~m~* for both red and green fluorescence (and statistics) are plotted as in C. 36 ≤ n ≤ 47. \, P \< 0.05; \\\\, P \< 0.0001. (F) CPL1229 expressing Nsp1-FRB-GFP and Nup170-mCherry was treated with DMSO or rapamycin. G1 cells were imaged until anaphase (2 h), and tf* was measured for both GFP and mCherry every 30 min. tf measurements were normalized to the minimum value in each time series and plotted against time (h). Error bars are the standard deviation from the mean. n = 6.](JCB_201305115_Fig3){#fig3} To further test if trapping of the Nsp1 complex leads to the specific loss of the transmission of NPCs to daughter cells, we localized an assembled and stable component of the NPC, Nup133, tagged with the photoconvertible Dendra fluorescent protein in an Nsp1-FRB--containing strain. We irreversibly photoconverted the majority of Dendra from its green to red form in G1/S-phase cells such that any remaining Nup133 protomers would complete assembly into NPCs before anaphase ([Fig. 3 D](#fig3){ref-type="fig"}; "photoconversion"). We then tracked the red fluorescent (assembled/old) NPCs through the cell cycle in the presence of either DMSO or rapamycin. Strikingly, rapamycin treatment resulted in a severe loss of the inheritance of old Nup133-Dendra ([Fig. 3 D](#fig3){ref-type="fig"}), which is reflected in the change of tf~d~/tf~m~ ratios from 0.56 to 0.15 ([Fig. 3 E](#fig3){ref-type="fig"}). These data support the conclusion that NPCs are not inherited when Nsp1~CYT~ is inhibited. Interestingly, we observed a weak accumulation of the green "new" Nup133-Dendra in daughter cells ([Fig. 3 D](#fig3){ref-type="fig"}) shown by the difference in the mean red and green tf~d~/tf~m~ ratios (0.15 and 0.44, respectively; [Fig. 3 E](#fig3){ref-type="fig"}), which suggests that NPC assembly continues after Nsp1~CYT~ is trapped. To test this, we monitored the levels of Nsp1-FRB-GFP~NPC~ and Nup170-mCherry in cells progressing from G1 to G2/M. In DMSO-treated cells, both GFP and mCherry fluorescence increased with similar kinetics, which we interpret to represent de novo NPC assembly ([Fig. 3 F](#fig3){ref-type="fig"}). In contrast, in rapamycin-treated cells, Nsp1-FRB-GFP levels remain constant while Nup170-mCherry increases, perhaps reflecting the accumulation of an NPC assembly intermediate ([Fig. 3 F](#fig3){ref-type="fig"}). Consistent with this idea, the tf~d~/tf~m~ ratios of Nup170-mCherry were significantly higher than the tf~d~/tf~m~ ratios of their Nsp1 complex FRB-GFP~NPC~ partners ([Fig. 3 C](#fig3){ref-type="fig"}). Thus, the Nup170-mCherry--containing NPC assembly intermediates might either be transmitted or assembled in the daughter when the Nsp1 complex is trapped. NPC assembly blocks do not affect NPC inheritance ------------------------------------------------- To test if the mechanism of NPC transmission required de novo NPC assembly, we generated a strain expressing the essential inner ring nup Nup192 as a FRB-GFP fusion ([Fig. S3](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp7}). Because the inner ring complex is thought to assemble upstream of the Nsp1 complex ([@bib52]; [@bib34]; [@bib58]; [@bib66]), trapping of Nup192 allowed us to ask whether inhibition of NPC assembly influences the transmission of NPCs. As shown in [Fig. 4 A](#fig4){ref-type="fig"}, under rapamycin and DMSO conditions the relative levels of Nup192-FRB-GFP~NPC~ between mother and daughter cells did not change (tf~d~/tf~m~ ratios of ∼0.6; [Fig. 4 B](#fig4){ref-type="fig"}), which suggests that compromised NPC assembly does not influence the mechanism of NPC transmission. Similar results were obtained upon trapping the outer ring component Nup120 ([Fig. 4, A and B](#fig4){ref-type="fig"}). ![NPC inheritance does not depend on de novo NPC assembly but is required for daughter viability. (A) Deconvolved image of a middle z plane showing Nup192-FRB-GFP (PCCPL528) or Nup120-FRB-GFP (WZCPL5) after completion of anaphase in the presence of rapamycin. M and D, mother and daughter, respectively. Bars, 2 µm. (B) Plot of tf~d/~tf~m~ for Nup192-FRB-GFP and Nup120-FRB-GFP as in [Fig. 3](#fig3){ref-type="fig"}. 42 ≤ n ≤ 55. (C) Single mother (M) cells expressing Nsp1-FRB-GFP (PCCPL487) or Nup192-FRB-GFP (PCCPL552) were grown in a microfluidic chamber perfused with rapamycin for 24 h. Each daughter was assigned a number (starting with 1) and their daughters assigned the same number followed by a letter to denote their parentage and order of appearance (starting with "a"). Bars, 5 µm. (D) Quantification of C where the average number of buds from mother and daughter cells is plotted. 29 and 32 mother cells (from two independent experiments) were analyzed for PCCPL487 and PCCPL552 strains, respectively. Error bars indicate standard deviation from the mean.](JCB_201305115_Fig4){#fig4} If there is a mechanism to specifically drive NPC transmission to daughter cells, we hypothesized that inhibition of this pathway would lead to daughter-specific phenotypes distinct from those in NPC assembly mutants. To test this idea, we grew Nsp1-FRB-GFP-- and Nup192-FRB-GFP--containing cells in the presence of rapamycin. In both cases, the cells ceased to grow after ∼24 h and were vacuolated, suggesting a loss of viability ([Fig. 4 C](#fig4){ref-type="fig"}). Interestingly, while the initial Nsp1-FRB-GFP mother cell (time 0) was able to give rise to multiple progeny (mean of 3.2; [Fig. 4 D](#fig4){ref-type="fig"}), almost all of its daughters failed to bud, which indicates a daughter-specific growth arrest. In contrast, daughter cells from the Nup192-FRB-GFP mother continued to bud with a frequency reflecting the order by which they were born; the first daughter budded an average of 2.3 times, whereas the fifth daughter never budded ([Fig. 4 D](#fig4){ref-type="fig"}). These data are consistent with the interpretation that the transmission of NPCs to daughters results in their dilution after each division, leading to a loss of viability of all cells. We suggest that the loss of viability of the Nsp1-GFP-FRB mother cell is not due to the retention of NPCs, rather it is likely the result of the assembly of NPCs lacking Nsp1, which would ultimately compromise nuclear--cytoplasmic compartmentalization. Specific bud localization of components of the Nsp1 complex ----------------------------------------------------------- To unravel the mechanism of NPC transmission, we performed experiments to understand the production, dynamics, and localization of Nsp1~CYT~ foci. We first investigated whether Nsp1~CYT~ production is cell cycle stage dependent. We localized Nsp1-GFP after blocking cell cycle progression in G1, S, or G2 using α-factor, hydroxyurea, and SWE1 overexpression, respectively ([Fig. 5 A](#fig5){ref-type="fig"}). In G1-arrested cells, no Nsp1-GFP accumulated within cytoplasmic structures. In contrast, upon S and G2 arrests, Nsp1-GFP could be visualized within cytoplasmic foci ([Fig. 5 A](#fig5){ref-type="fig"}, arrowheads). Consistent with our RITE experiments, these foci were specific for the Nsp1 complex, with Nsp1, Nup82, Nup49, and Nup57 appearing in a cytoplasmic pool in ∼80% of S-phase--arrested cells ([Fig. 5 B](#fig5){ref-type="fig"}), whereas analogous structures were not observed with Nup170-GFP or Pom34-GFP ([Fig. 5, A and B](#fig5){ref-type="fig"}). We observed Nup85-GFP in cytoplasmic foci in 16% of cells, but our inability to similarly localize either membrane (Pom34) or inner ring (Nup170) nups argues against the idea that these cytoplasmic foci are annulate lamellae ([@bib47]). ![The Nsp1 complex has a cytoplasmic pool localized to the daughter bud. (A) Fluorescence micrographs (and bright field) of Nsp1-GFP-- and Nup170-GFP--expressing cells (CPL1234, BWCPL437, PCCPL423, and PCCPL409) arrested in G1, S, or G2 phase with α-factor--, hydroxyurea-, or galactose-induced overexpression of SWE1, respectively. To visualize cytoplasmic foci, we show maximum-intensity projections of a deconvolved z series where 0.4% of pixels have been digitally saturated. Bars, 5 µm. (B) Plot showing the percentage of cells where the indicated nups were found in cytoplasmic foci in α-factor-- or hydroxyurea-arrested cells. 90 ≤ n ≤ 190. Error bars indicate standard error of the mean. (C) Plot showing the number of Nsp1-GFP~CYT~ foci and their distribution in daughter buds and mother cells during 3 h of a G2 arrest. At the indicated times, \>100 cells were scored. Error bars indicate standard deviations from the mean. Bud size is the surface area of the bud (µm^2^). (D) NSP1-(PCCPL506)-- and NUP85-RITE (PCCPL523)--containing strains were grown in the presence of galactose (to induce a G2 arrest) and estradiol and imaged over several hours (see [Videos 2](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp8} and [3](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp21}). Fluorescence micrographs (maximum-intensity projections of a deconvolved z series) of the GFP and mCherry forms of Nsp1 and Nup85 are shown at the indicated time points. Note the specific appearance of Nsp1-GFP "new" (arrowheads) in the elongated bud. Bars, 5 µm.](JCB_201305115_Fig5){#fig5} Interestingly, the distribution of the Nsp1~CYT~ foci was biased toward the daughter bud ([Fig. 5 C](#fig5){ref-type="fig"}). This bud bias was most evident in cells arrested in G2 in which the polarized/apical growth pathway is hyperactivated ([@bib76]; [@bib61]); under these conditions the number of foci increased with bud size, with greater numbers found in the bud ([Fig. 5 C](#fig5){ref-type="fig"}). These data suggest an active targeting or retention mechanism for Nsp1~CYT~ in daughter cells. To further establish that this bud pool is distinct from Nsp1~NPC~, we arrested cells containing the Nsp1-RITE cassette in G2 in the presence of estradiol. In these cells, the first "new" Nsp1-GFP signal appeared as a focus in the daughter bud ([Fig. 5 D](#fig5){ref-type="fig"}, arrowheads; and [Video 2](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp9}). As we prolonged the arrest, additional Nsp1-GFP~CYT~ foci accumulated in the bud concomitantly with a NE pool. We did not observe any "old" Nsp1-mCherry in the cytoplasm, nor did we detect a similar bud-localized accumulation of "new" or "old" Nup85 ([Fig. 5 D](#fig5){ref-type="fig"} and [Video 3](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp10}). These data further support the existence of two pools of Nsp1: one that is assembled into NPCs (Nsp1~NPC~) and another that is actively targeted and/or retained in the daughter cell (Nsp1~CYT~). Nsp1~CYT~ foci localize to ER connected to the mother NE ---------------------------------------------------------- We felt that understanding the role of Nsp1 in NPC transmission required defining how Nsp1~CYT~ is localized to the bud. We therefore tested colocalization of Nsp1-GFP~CYT~ with components of the polarity apparatus and organelles actively transported to daughters, like ER. For these experiments, we delayed cells before anaphase using a temperature-sensitive cdc6-1 allele ([@bib54]). By arresting cdc6-1 cells in G2/M at the nonpermissive temperature and then imaging them under permissive conditions, we can exert consistent control over the production of the Nsp1-GFP~CYT~ foci. Using this strategy, we failed to observe colocalization between Nsp1-GFP~CYT~ and several bud-directed factors including Kar9 ([Fig. 6 A](#fig6){ref-type="fig"}), Myo2, Abp140 ([@bib89]), Abp1 ([@bib87]; [@bib35]; [Fig. S5](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp11}), or Bud6 (unpublished data; [@bib4]). We did observe a transient colocalization of Nsp1-GFP~CYT~ with the exocyst subunit, Exo70 ([Fig. 6 B](#fig6){ref-type="fig"}). Interestingly, mammalian Nsp1/Nup62 interacts with Exo70 at the leading edge of migrating cells ([@bib44]; [@bib8]), raising the possibility that this interaction is conserved, even if transient. ![*Nsp1-GFP~CYT~* foci interact with ER in the daughter cell.** In all images shown, cdc6-1 cells were arrested in G2/M for 3 h at 34°C and then imaged at RT. (A--C) Deconvolved fluorescence micrographs of one z section of cdc6-1 cells expressing Nsp1-GFP and either Kar9-mCherry (PCCPL535), Exo70-mCherry (PCCPL532), or HDEL-DsRed (PCCPL533). Green and red channels are shown in addition to the merge. Arrowheads point to Nsp1-GFP~CYT~ foci. (D) A time-lapse series (Δt = 5 s) of PCCPL533 cells. Each time point is a merge of Nsp1-GFP and HDEL-DsRed images from one z plane. Arrowheads point to a Nsp1-GFP~CYT~ focus ([Video 4](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp12}). (E) PCCPL533 cells were treated with latrunculin A (lat A), nocodazole, or DMSO. Deconvolved micrographs from one z section of a representative cell are shown (green, red, and merged images). Nsp1-GFP~CYT~ foci are indicated by arrowheads. (F) Quantification of E showing the distribution of Nsp1-GFP~CYT~ between the cortical and tubular ER under the indicated conditions. 58 ≤ n ≤ 71. Bars, 2 µm.](JCB_201305115_Fig6){#fig6} In contrast to the fleeting Nsp1-Exo70 colocalization, we observed a stable association between Nsp1-GFP~CYT~ foci and ER (visualized with HDEL-DsRed; [Fig. 6 C](#fig6){ref-type="fig"}). For example, in [Fig. 6 D](#fig6){ref-type="fig"}, an Nsp1-GFP~CYT~ focus (arrowhead) remains associated with an ER tubule that extends from the mother NE to the daughter cortex for \>95 s ([Video 4](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp13}). Moreover, we colocalized Nsp1-GFP~CYT~ with a bolus of ER originating from the mother NE and traveling to the daughter cortex over 15 min (Fig. S5 B). Because ER morphology in yeast requires an intact actin cytoskeleton ([@bib67]; [@bib31]), we tested the association of Nsp1~CYT~ with ER after disrupting actin filaments by treatment with latrunculin A. Under this condition, we observed a reduction in tubular ER in the bud ([Fig. 6 E](#fig6){ref-type="fig"}), and the majority of Nsp1-GFP~CYT~ foci localized to the cell cortex, presumably with cortical ER ([Fig. 6, E and F](#fig6){ref-type="fig"}). No effect on ER structure, or Nsp1~CYT~ distribution, was observed after disrupting the spindle with nocodazole ([Fig. 6, E and F](#fig6){ref-type="fig"}). The association of Nsp1~CYT~ with ER was further confirmed by immuno-EM using anti-Nsp1 antibody staining followed by gold-labeled secondary antibodies on ultrathin sections. The anti-Nsp1 antibody was highly specific, as quantification of gold particles at the nucleus showed that \>93% were at the NE ([Fig. 7 A](#fig7){ref-type="fig"}). Further, NPCs were often decorated with two or more gold particles ([Fig. 7 B](#fig7){ref-type="fig"}). Outside the nucleus, we observed gold particles in the cytoplasm and on membranes ([Fig. 7 C](#fig7){ref-type="fig"}, arrowheads). We assessed that 40% of the gold particles were associated with membranes that could be morphologically identified as either internal ER ([Fig. 7, A and D](#fig7){ref-type="fig"}) or cortical ER ([Fig. 7, E and F](#fig7){ref-type="fig"}). Collectively, the combination of our fluorescence and EM data support the conclusion that Nsp1~CYT~ associates with ER, which likely plays a role in its localization to the bud. ![*Nsp1~CYT~* interacts with ER at high resolution.** cdc6-1 cells (PCCPL393) were arrested in G2/M phase for 3 h at 34°C, released for 3 h at RT, and then processed for immuno-EM. An anti-Nsp1 antibody followed by a 10 nm gold--conjugated secondary antibody were used to localize Nsp1. (A) Plot of the percentage of gold particles from a single experiment both at (left; n = 71) and outside (right; n = 46) the nucleus in association with the indicated cellular structures. (B and C) EM micrographs of a mother and bud (daughter) of the same cell. N, nucleus; V, vacuole. Asterisks indicate NPCs and arrowheads point to gold particles. Bars, 1 µm. (D--F) High-magnification views of gold particles in association with internal ER (D) and cortical ER (E and F). Arrows delimit the two ER membranes with intervening cistern. Arrowheads point to gold particles. PM, plasma membrane. Bars, 100 nm.](JCB_201305115_Fig7){#fig7} Nsp1~CYT~ interacts with nucleopodia (NP) and functions in nuclear positioning -------------------------------------------------------------------------------- The association of Nsp1~CYT~ with ER extending from the mother NE and the potential interaction with Exo70 prompted us to investigate whether Nsp1's role in NPC transmission might function alongside a recently described nuclear positioning pathway ([@bib50]). In this pathway, ER tubules connect the mother NE to the daughter cortex through the exocyst complex (of which Exo70 is a member; [Fig. 8 A](#fig8){ref-type="fig"}). This interaction is thought to help drive the formation of NP; dynamic bud extensions of the mother NE are proposed to help maintain nuclear position at the bud neck ([@bib50]; [Fig. 8 A](#fig8){ref-type="fig"}). We first tested whether the Nsp1~CYT~ foci might be physically connected to NP by time-lapse imaging of cdc6-1 cells. After release from the cdc6-1 arrest, NP are observed as the mother NE vectorially extends into the bud and dynamically retracts throughout the ∼1 h time lapse shown in [Fig. 8 B](#fig8){ref-type="fig"} (see [Video 5](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp14} and also [Videos 6](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp15} and [7](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp22}). Remarkably, NP move toward a bud-localized Nsp1-GFP~CYT~ focus ([Fig. 8 B](#fig8){ref-type="fig"}, arrowheads), appear to "kiss" it, and retract to the mother. This occurs multiple times before the NE absorbs the focus at the end of the time lapse. NP in strains expressing Nup170-GFP do not extend substantially beyond the bud neck, and the NE signal is continuous between mother and bud portions ([Fig. 8 B](#fig8){ref-type="fig"}, right; and [Video 8](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp16}). ![*Nsp1~CYT~* associates with NP and contributes to nuclear positioning.** (A) Schematic of the association of Nsp1~CYT~ with ER tubules that connect the mother NE and daughter cortex through the exocyst complex and contribute to the formation of NP. Red ovals, NPCs; green triangles, Nsp1~CYT~; grey square, exocyst complex. The arrow indicates NP dynamics. (B) Maximum-intensity projections of two time lapses (Δt is 3 min) of a deconvolved z series of fluorescence images. Left panels show the distribution of Nsp1-GFP (PCCPL393; [Video 5](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp17}) and right panels of Nup170-GFP (PCCPL392; [Video 8](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp18}) in cdc6-1 cells. Arrowheads point to an Nsp1-GFP~CYT~ focus that interacts with NP. Bar, 2 µm. (C) Nsp1-FRB-GFP/Hmg1-mCherry (PCCPL487)-- or Nup192-FRB-GFP/Hmg1-mCherry (PCCPL552)--expressing cells were imaged in the presence of DMSO or rapamycin. Individual unbudded cells were followed by time-lapse microscopy until anaphase completion (∼2 h). The images shown are maximum-intensity projections of a z series of deconvolved images of cells at the time point just before and after anaphase. M and D, mother and daughter, respectively. The position of the bud neck is indicated by the arrows. Bars, 2 µm. (D) Quantification of C where the percentage of cells showing a mispositioned nucleus is plotted under DMSO and rapamycin conditions. 36 ≤ n ≤ 96. Error bars indicate the standard error of the mean.](JCB_201305115_Fig8){#fig8} The interaction between Nsp1~CYT~ and NP prompted us to investigate whether trapping of Nsp1-FRB~CYT~ might, in addition to affecting NPC transmission, impact nuclear positioning at the bud neck. To test this idea, we treated cells expressing either Nsp1-FRB-GFP or Nup192-FRB-GFP with rapamycin and monitored nuclear position in small or unbudded cells as they moved through the cell cycle. Hmg1-mCherry was used to visualize the NE ([Fig. 8 C](#fig8){ref-type="fig"}). As expected, under DMSO-treated conditions, 94% of nuclei moved to the bud neck before anaphase and 98% of nuclei were properly positioned when Nup192-FRB-GFP was trapped ([Fig. 8, C and D](#fig8){ref-type="fig"}). In contrast, in 25% of rapamycin-treated Nsp1-FRB-GFP cells, the nuclei were found at a distal location to the neck, which supports the conclusion that the inhibition of Nsp1~CYT~ impacted the ability of cells to position their nuclei correctly ([Fig. 8, C and D](#fig8){ref-type="fig"}). Nsp1~CYT~ distribution and daughter NPC density require MYO2 ---------------------------------------------------------------- Our observations that trapping of Nsp1~CYT~ impacts NPC inheritance and nuclear positioning suggested that these two processes might be coupled. To explore this idea, we investigated Nsp1~CYT~ distribution and NPC inheritance in strains with mutations in the canonical myosin- and dynein-dependent nuclear positioning pathways. We tested the distribution of Nsp1-GFP by arresting strains containing temperature-sensitive alleles of MYO2 or knockouts of dynein heavy (DYN1) and light (DYN2) chain in S phase ([Fig. 9 A](#fig9){ref-type="fig"}). Remarkably, in the myo2 strains, we observed a substantial redistribution of the Nsp1-GFP~CYT~ foci from a predominantly bud-biased distribution to one that was unbiased or biased to the mother ([Fig. 9, A and B](#fig9){ref-type="fig"}). In contrast, Nsp1-GFP~CYT~ was not affected in dyn1Δ, dyn2Δ, and myo4Δ strains ([Fig. 9, A and B](#fig9){ref-type="fig"}). These data predict that NPC transmission requires Myo2 function. To test this idea, we calculated the mean fluorescence intensity (mfi) of a scaffold component of the NPC (Nup85-GFP) at the NE as an indirect measure of NPC density and expressed this as a daughter/mother ratio (mfi~d~/mfi~m~). Consistent with an active mechanism to deliver NPCs to the daughter, in wild-type cells the average mfi~d~/mfi~m~ ratio was \>1 (1.20), which suggests a higher density of NPCs in daughter cells compared to mother cells after anaphase completion ([Fig. 9, C and D](#fig9){ref-type="fig"}). These results were mirrored in dyn1Δ, dyn2Δ, and myo4Δ cells. In contrast, in myo2-14 cells the mean mfi~d~/mfi~m~ was 0.94 ([Fig. 9 D](#fig9){ref-type="fig"}), a significant difference (P \< 0.0001) from wild-type cells. Collectively, these data provide support to the conclusion that NPC transmission to the daughter cell specifically depends on the Myo2-dependent localization of Nsp1. ![*The distribution of Nsp1~CYT~* and the density of daughter NPCs require MYO2.** (A) Maximum-intensity projections of a deconvolved z series of images showing the distribution of Nsp1-GFP in wild-type (WT; CPL1234), myo2-14 (PCCPL317), myo2-20 (PCCPL316), dyn1Δ (PCCPL559), dyn2Δ (PCCPL427), and myo4Δ (PCCPL365) cells after 3 h of arrest in hydroxyurea at RT. Arrowheads point to Nsp1-GFP~CYT~ foci. Bars, 2 µm. (B) The number and distribution of Nsp1-GFP~CYT~ foci were assessed in the indicated hydroxyurea-arrested cells. For each cell it was determined whether there was a bud-biased (BB), unbiased (UB), or mother-biased (MB) localization in the total number of Nsp1-GFP~CYT~ foci per cell. These numbers were plotted as a percentage of total cells. 40 ≤ n ≤ 60. Error bars are standard deviations from the mean. (C) Deconvolved fluorescence micrographs showing a middle z section of WT (BWCPL42), myo2-14 (PCCPL529), dyn1Δ (PCCPL561), dyn2Δ (PCCPL445), and myo4Δ (PCCPL530) cells expressing Nup85-GFP after anaphase. The bottom panel is a "heatmap" representation of fluorescence intensities normalized to a 1-256 arbitrary scale (legend on the left) of the same mother (M) and daughter (D) cells as in the top panel. Cell boundaries are denoted by outlines. Bars, 2 µm. (D) In a middle z plane of a deconvolved z series, the mfi of the NE of a mother and daughter cell were measured and plotted as a ratio (mfi~d~/mfi~m~) as an indirect readout of relative NPC density. 50 ≤ n ≤ 98. Box plot and statistics are as in [Fig. 3](#fig3){ref-type="fig"}. P \< 0.0001.](JCB_201305115_Fig9){#fig9} Discussion ========== We have uncovered a mechanism that controls the inheritance of NPCs in budding yeast based on a bud-directed pool of the Nsp1 complex. Such a mechanism helps explain why daughter cells have a higher density of NPCs ([Fig. 9, C and D](#fig9){ref-type="fig"}) and are enriched in "old" nups ([@bib49]). We conclude that inheriting, as opposed to assembling, NPCs provides the cell the most efficient means to ensure daughter viability. Consistent with this idea, newly synthesized components of the scaffold of the NPC show no preference for the mother or daughter side of the anaphase NE, which argues against a daughter-specific NPC assembly mechanism ([Fig. 1](#fig1){ref-type="fig"}). Furthermore, there is no detectable bias in the NPC assembly reaction, as inhibiting assembly by the conditional trapping of either Nup120 or Nup192 did not affect the relative levels of NPCs between mother and daughter cells ([Fig. 4, A and B](#fig4){ref-type="fig"}). Indeed, after inhibiting NPC assembly, we and others ([@bib93]; [@bib58]) show that daughter cells are capable of additional rounds of division, whereas restriction of NPC transmission results in a daughter-specific growth arrest ([Fig. 4, C and D](#fig4){ref-type="fig"}). We suggest that an actively controlled NPC inheritance mechanism might be most relevant when NPC assembly rates cannot keep up with rapid cell divisions. While the mechanism described here likely varies throughout eukaryotes, the principle that it is more efficient to ensure that components of the NPC are reused as opposed to resynthesized/assembled is likely universal and might help to explain why nups are so stable ([@bib21]; [@bib19]; [@bib72]). NPC transmission requires the production of an ER-bound pool of Nsp1~CYT~ synthesized before anaphase, likely between S and G2 phase ([Fig. 5](#fig5){ref-type="fig"}). Collectively, our data argue that Nsp1~CYT~ acts autonomously from NPCs to carry out this function. First, "old" Nsp1~NPC~ rarely, if ever, exchanges into Nsp1~CYT~ even over many hours of G2 arrest ([Fig. 5 D](#fig5){ref-type="fig"}). Consistent with this observation, Nsp1-FRB~NPC~ cannot be trapped at the plasma membrane ([Fig. 2](#fig2){ref-type="fig"}). Further, depleting Nsp1~CYT~ has a highly penetrant and rapid effect on daughter viability, whereas a general inhibition of NPC assembly (which would not be predicted to affect Nsp1~CYT~ or NPC transmission; [Fig. 4 A](#fig4){ref-type="fig"}) manifests gradually in both mother and daughter cells over several cell cycles ([Fig. 4, C and D](#fig4){ref-type="fig"}). Last, the reduction in NPC density in myo2 daughters more likely reflects a loss of bud targeting of the Nsp1 complex rather than NPC malfunction as nups localize normally to NPCs in these strains ([Fig. 9](#fig9){ref-type="fig"}). There are two general models for how Nsp1~CYT~ might function in promoting the inheritance of NPCs: it helps NPCs either overcome a mother cell retention mechanism similar to that proposed for mitochondria ([@bib90]) or a diffusional barrier at the bud neck ([@bib75]). We favor the model presented in [Fig. 10](#fig10){ref-type="fig"} that invokes the existence of a diffusion barrier since a retention mechanism would be predicted to restrict NPC mobility, which has not been observed ([@bib13]; [@bib9]). Further, since diffusion barriers would be more likely to impede the passage of large complexes such as NPCs, it predicts that smaller proteins like Hmg1 are able to access daughter cells ([Fig. 8 C](#fig8){ref-type="fig"}), as well as putative NPC assembly intermediates ([Fig. 3](#fig3){ref-type="fig"}). ![Model of the mechanism of NPC transmission to daughter cells. (A) In wild-type cells, a diffusion barrier at the bud neck is established (orange). (B) We envision that the delivery of Nsp1~CYT~ (green triangles) to the daughter through a mechanism that requires Myo2 and an association with ER (blue, which bind the daughter cortex through the exocyst complex \[grey box\]) licenses NPC passage by disrupting the diffusion barrier. (C) Forces applied to the mother NE through NP and/or spindle elongation result in the transmission of NPCs (red ovals). Under conditions in which Nsp1~CYT~ is inhibited or Myo2 function is impaired, the barrier remains intact and restricts the passage of NPCs, leading to the specific loss of viability of daughter cells. De novo NPC assembly continues as indicated by the white ovals.](JCB_201305115_Fig10){#fig10} In our model, Nsp1~CYT~ moves into the bud by interacting with ER targeted to the daughter ([Fig. 10](#fig10){ref-type="fig"}). Interestingly, while the canonical ER inheritance pathway uses Myo4 ([@bib28]), neither Nsp1~CYT~ distribution nor NPC inheritance are impacted in myo4Δ strains ([Fig. 9](#fig9){ref-type="fig"}). These data suggest that ER bound by Nsp1~CYT~ may be transmitted to the daughter in a mechanism mediated by the exocyst complex, which subsequently contributes to the formation of NP ([Fig. 10](#fig10){ref-type="fig"}; [@bib50]). A functional relationship between NP and Nsp1~CYT~ is consistent with our observation that NP dynamics are directed toward Nsp1~CYT~ ([Fig. 8 B](#fig8){ref-type="fig"}). Moreover, both the formation of NP and the localization of Nsp1~CYT~ depend on an intact actin cytoskeleton and Myo2 ([Fig. 6, E and F](#fig6){ref-type="fig"}; and [9, A and B](#fig9){ref-type="fig"}) and are required for nuclear positioning at the bud neck ([Fig. 8 D](#fig8){ref-type="fig"}). Last, our data point to a potentially conserved interaction between Nsp1 and Exo70, first observed in mammalian tissue culture cells ([Fig. 6 B](#fig6){ref-type="fig"}; [@bib44]). We propose that the passage of Nsp1~CYT~ through the bud neck licenses NPC transmission during anaphase by either directly (or through an unidentified factor) overcoming the diffusion barrier ([Fig. 10](#fig10){ref-type="fig"}). In the absence of Nsp1~CYT~ and/or Myo2 function, the barrier remains intact and NPCs are not able to enter the daughter, leading to a loss of daughter viability ([Fig. 10](#fig10){ref-type="fig"}). At this point we can only speculate as to the molecular composition of the bud neck barrier and the signaling factors and/or forces that modulate its function. We envision a mechanism analogous to the recently described ER stress surveillance pathway in which ER stress is signaled through the MAP kinase Slt2 to regulate septin function and impede cortical ER inheritance ([@bib5]). Future experiments will be focused on identifying the internal and/or external inputs that impact Nsp1~CYT~ function that might modulate NPC number. Materials and methods ===================== Yeast strain generation and growth ---------------------------------- All yeast strains used in this study and their derivation are listed in [Table S1](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp19}. ABY530 and ABY534 were gifts from A. Bretscher (Cornell University, Ithaca, NY). YB0044 and PCCPL397 were gifts from B. Stillman (Cold Spring Harbor Laboratory, Cold Spring Harbor, NY), and D. Lew (Duke University, Durham, NC), respectively. Most experiments were performed on yeast grown at 30°C, with the exception of those containing temperature-sensitive alleles (myo2-14, myo2-20, and cdc6-1), which were grown at RT or at 34°C as described in the figure legends. All strains were grown in YP (1% yeast extract and 2% peptone) with 2% dextrose (YPD), 2% raffinose (YPR), or 2% galactose (YPG). Standard yeast manipulations including transformation, tetrad dissection, and PCR-based integration were performed as described in [@bib4]. Plasmids -------- All plasmids and their derivation are listed in [Table S2](http://www.jcb.org/cgi/content/full/jcb.201305115/DC1){#supp20}. To generate PLPMR2, the GFP and mRFP genes encoded in pKV015 (a gift from F. van Leeuwen, Netherlands Cancer Institute, Amsterdam, Netherlands; [@bib85]) were sequentially replaced by mCherry and GFP genes, respectively. ORFs encoding NSP1 and NIC96 with their cognate promoters and 3′ UTRs were inserted into pRS416 ([@bib77]) to generate PLPC19 and PLPC20. pKW2329 and pKW1358 were gifts from K. Weis (University of California, Berkeley, Berkeley, CA). Cell cycle arrests ------------------ To arrest cells in different phases of the cell cycle, strains were grown to mid-log phase. For G1 arrests, α-factor (Keck Biotechnology Resource Laboratory) was added to a final concentration of 50 µg/ml for 2 h. For S-phase arrest, hydroxyurea (Sigma-Aldrich) was added to the growth medium at a final concentration of 0.2 M for 3 h. G2 arrests were achieved by overexpressing the Swe1 kinase as described in [@bib12]. Strains containing SWE1 behind the control of the GAL1 promoter were grown in YPR to mid-log phase and were shifted to YPG for 3 h. In all cases, cell cycle arrests were confirmed visually by microscopy. For experiments using strains containing the cdc6-1 allele, cells were grown at RT to mid-log phase and arrested in G2/M by shifting to the nonpermissive temperature of 34°C for 3 h. Cells were then placed on an agarose pad and imaged at RT. Microscopy ---------- For all imaging experiments, cells were grown to mid-log phase and immobilized on a 1.4% agarose pad containing complete synthetic medium (CSM) with 2% glucose and sealed with VALAP (1:1:1 Vaseline/lanolin/paraffin). All the microscopy experiments were carried out on a wide-field deconvolution microscope (DeltaVision; Applied Precision/GE Healthcare) equipped with a 100×, 1.40 NA objective lens and solid state illumination. The images were acquired using a charge-coupled device (CCD) camera (CoolSNAP HQ^2^; Photometrics) or an Evolve EMCCD camera (Photometrics). Temperature control was achieved through the enclosure of the microscope within an environmental chamber. In all cases, a z series of images (0.2--0.5-μm sections) were acquired and further processed as described under "Image processing and analysis." Time-lapse series were performed with different time intervals as described in the figure legends. Immunofluorescence ------------------ Cells grown to mid-log phase were collected by centrifugation and fixed in 2% PFA in PBS for 20 min at RT. Cells were subsequently washed in PBS and cell walls were permeabilized by an incubation for 30 min in sorbitol citrate buffer (0.1 M K~2~HPO~4~, 0.04 M citric acid, 1.2 M sorbitol, and 0.5 mM MgCl~2~, pH 6.5) containing 0.02% zymolyase 100T (MP Biomedicals). Cells were washed in sorbitol citrate and transferred to a slide pre-coated with 0.1% poly-[l]{.smallcaps}-lysine (Electron Microscopy Sciences). The slide was incubated for 4 min in methanol (−20°C), followed by 4 min in acetone (−20°C). Slides were air dried. The processed cells were then blocked for 20 min with PBS containing 1% BSA and 0.1% Triton X-100 before incubation with an anti-Nsp1 primary antibody (32D6; Abcam) followed by a Alexa Fluor 594--conjugated secondary antibody (Invitrogen). Image processing and analysis ----------------------------- In all images shown, a z series was deconvolved using the iterative algorithm in softWoRx (version 5.5; Applied Precision). In some cases (indicated in the figure legends), maximum-intensity projections were also generated by softWoRx. Subsequent image processing and analysis was performed using Fiji/ImageJ ([@bib73]). To measure tf in daughter and mother cells (tf~d~ and tf~m~), a z stack was sum-projected and background subtracted, and the integrated density of a region of interest (ROI) encompassing the mother or daughter NE was calculated. As an indirect measure of NPC density, we calculated the mfi over an ROI that surrounded only the NE in mother or daughter cells of one middle z plane. To calculate nuclear volume, we measured the ferret diameter of the nucleus through a middle z section. An approximate nuclear volume was calculated by considering that the nucleus was a sphere using the equation V = 4/3 πr^3^. All plots and statistical analysis were performed using Prism software (GraphPad Software). RITE ---- Nup-RITE--containing strains were grown to mid-log phase in YPD or YPR in the presence of 300 µg/ml hygromycin (Invitrogen) to maintain selection for mCherry expression ([@bib85]). Cells were synchronized in G1 with α-factor, washed in YPD or YPR, and released for 1 h in YPD or YPG containing 1 µM estradiol before imaging on an agarose pad. Anchor-away experiments ----------------------- For plate-based growth assays, cells were grown overnight and plated in 10-fold serial dilutions on YPD plates containing DMSO or rapamycin (EMD Millipore) at a concentration of 1 µg/ml. Growth was assessed after 48 h at 30°C. For microscopy, mid-log phase cells expressing Nup-FRB-GFP fusions were grown in YPD and placed onto agarose pads containing DMSO, rapamycin (10 µg/ml), or rapamycin and cycloheximide (10 µg/ml; VWR International). Cells expressing Nup133-2xDendra were exposed to seven 0.5-s pulses of UV light to photoconvert Dendra from its green to red fluorescent form. In all experiments, cells that were unbudded or small budded were imaged through at least one cell cycle. For long-term viability/growth assays, cells were transferred to a microfluidic plate (Y04C/CellASIC) within the ONIX microfluidic platform (CellASIC) inserted onto the microscope stage. YPD containing DMSO or rapamycin (10 µg/ml) was perfused into the microfluidic plate at a pressure of 2 psi for 24 h. Affinity purification of Nsp1-GFP and stable isotope labeling of amino acids in cell culture (SILAC) ---------------------------------------------------------------------------------------------------- For SILAC labeling, lys2Δ (PCCPL314) and lys2Δ NSP1-GFP (PCCPL322) yeast cells were grown in CSM-Lys. Lysine (Sigma-Aldrich) or "heavy" \[^13^C~6~/^15^N~2~\][l]{.smallcaps}-lysine (Cambridge Isotope labs) was added to a final concentration of 30 mg/liter. 100 OD of cells were harvested by centrifugation and resuspended in 500 µl of lysis buffer (150 mM KOAc, 20 mM Hepes, pH 7.4, 10% glycerol, and complete protease inhibitor cocktail \[Roche\]). 500 µl of zirconia beads (0.1 mm in diameter; BioSpec Products Inc.) were added and cells were lysed using a bead mill (Retsch) running at 30 Hz for 5 min. The beads were removed by centrifugation, and Triton X-100 was added to a final concentration of 1%. After a 30-min incubation at 4°C, the lysate was clarified by a 10-min centrifugation at 1,000 g. Equivalent amounts of PCCPL329 and PCCPL322 lysates were incubated (separately) with GFP-Trap agarose beads (Allele Biotechnology) for 30 min at 4°C. After washing, the beads were combined, and 100 µl of 8 M urea and 50 mM Tris-HCl, pH 7.4, was added. Bound proteins were reduced, alkylated, and digested with the endoproteinase LysC directly on beads. The resulting peptide mixture was removed from the beads, acidified with trifluoroacetic acid, and desalted using stop-and-go extraction tips (StageTips; [@bib69]), which are pipette tips packed with C18 solid phase chromatography resin (3M). Peptides were washed with 0.1% formic acid, eluted with 60 µl of 80% acetonitrile and 0.1% formic acid, and reduced to 5 µl in a speed vacuum centrifuge (Eppendorf). The peptide mixture was subjected to reversed phase chromatography on an Easy nLC system (Thermo Fisher Scientific) using a 50-cm column (New Objective) with an inner diameter of 75 µm, packed in-house with 3 µm C18 resin (Dr. Maisch GmbH). Peptides were eluted with an acetonitrile gradient (5--30%) and directly electrosprayed into a mass spectrometer (LTQ Orbitrap Velos; Thermo Fisher Scientific; [@bib1]). Data were acquired with Xcalibur software (version 2.1; Thermo Fisher Scientific) and analyzed with MaxQuant (version 1.2.2.5; [@bib16]; [@bib17]) as described previously ([@bib33]). In brief, peak lists were searched against a local database for S. cerevisiae (obtained from Saccharomyces Genome Database). Maximum allowed mass deviation for tandem mass spectrometry (MS/MS) peaks and missed cleavages were 20 ppm and 3, respectively. Maximum false discovery rates were 0.01 both on the peptide and on the protein levels. Minimum required peptide length was six residues. Proteins with at least two peptides were considered identified. All calculations and plots were performed with the R software package. Western blots ------------- Exponentially growing cells were collected by centrifugation and lysed in 0.1 M NaOH for 5 min at RT. The pellet was resuspended in SDS-PAGE sample buffer, and proteins were separated on SDS-PAGE gels and transferred to a nitrocellulose membrane (Bio-Rad Laboratories). We used anti-Nsp1 antibodies (32D6; Abcam) followed by HRP-conjugated secondary antibodies and ECL for detection. Immuno-EM --------- Cells were fixed in PBS containing 4% PFA and 0.1% glutaraldehyde for 1 h at RT and embedded in 10% gelatin. They were subsequently infiltrated with 2.3 M sucrose at 4°C overnight and frozen in liquid nitrogen. Thin sections (∼60 nm) were cut with a cryo-ultramicrotome (EM FC6; Leica). Immunolabeling was carried out with the anti-Nsp1 primary antibody for 30 min followed by 10 nm of gold-conjugated secondary antibody for an additional 30 min. Grids were visualized with a transmission electron microscope (Tecnai Biotwin; FEI) at 80 kV. Images were taken using a CCD camera (Morada) fitted with iTEM software (both from Olympus). Online supplemental material ---------------------------- Fig. S1 demonstrates that Nup-mCherry levels do not increase after RITE is induced. Fig. S2 presents multiple experiments confirming the functionality of the Nsp1-GFP protein. Fig. S3 shows the growth of strains containing Nup-FRB-GFP alleles. Fig. S4 is the quantification of the change of daughter nuclear size upon trapping of Nsp1-FRB-GFP. Fig. S5 examines colocalization between Nsp1-GFP~CYT~ and several components of the polarity apparatus and ER. In Video 1, the production and NE integration of Nsp1-GFP~CYT~ is shown during mitosis. Video 2 is a RITE experiment performed under G2 arrest showing the specific bud localization of only Nsp1-GFP and not Nsp1-mCherry. Video 3 shows the distribution of green and red versions of Nup85-RITE during G2 arrest. In Video 4, the interaction between an Nsp1-GFP~CYT~ focus with an ER tubule is highlighted. Videos 5--7 demonstrate the physical connection between the Nsp1-GFP~CYT~ foci and NP. Video 8 shows the absence of a cytoplasmic pool of Nup170-GFP during NP formation. Online supplemental information is available at <http://www.jcb.org/cgi/content/full/jcb.201305115/DC1>. Supplementary Material ====================== ###### Supplemental Material We are indebted to the generous support from the G. Harold and Leila Y. Mathers Foundation. Thank you to Xinran Liu and Morven Graham for their electron microscopy expertise, T. Walther for use of his mass spectrometer, and C. Vogel for image analysis. We are grateful for the reagents sent by F. van Leeuwen, B. Stillman, L. Weisman, A. Bretscher, D. Lew, and K. Weis in addition to helpful criticisms of the manuscript from M.C. King. Funding was also provided by the National Institutes of Health, grant R01GM105672 to C.P. Lusk. Abbreviations used in this paper:EBDEstradiol-binding domainmfimean fluorescence intensityNEnuclear envelopeNPnucleopodiaNPCnuclear pore complexnupnucleoporinRITErecombination induced tag exchangetftotal nuclear fluorescence	{ "pile_set_name": "PubMed Central" }
GOLDMAN: Will gay Virginians make it more expensive to get married? This is an archived article and the information in the article may be outdated. Please look at the time stamp on the story to see when it was last updated. Paul Goldman is a local lawyer who helped run Doug Wilder's historic campaign for governor of Virginia. GOLDMAN: Will gay Virginians make it more expensive to get married? Paul Goldman is a local lawyer who helped run Doug Wilder's historic campaign for governor of Virginia. RICHMOND, Va. – Don’t be surprised to see our politicians triple the marriage fee. There is soon going to be a lot bigger demand for a marriage license. They are likely to see a way to tax us more. So if you are thinking of getting married, do it quick before they hike the cost. And since half of marriages end in divorce, you might want to pre-pay this fee since the politicians will be raising that one too. Supply and demand right? The federal judge in Norfolk didn’t merely strike down Virginia’s ban on same sex marriage. She gave elected officials a new group of citizens to tax. Let me ask you, why exactly, is the government in the business of giving out marriage licenses, a ceremony rooted for centuries and centuries in religious law and conviction, not civil statutes administered by the local clerk of the circuit court? Or put another way, why is government in this thing at all except to get folks to pay some money on the front side – getting married – and then on the back side – divorce – so the politicians have the money to hire more of their friends and supporters? The vital and other records government may need to collect can be collected without requiring a marriage license. This is how it had been for thousands of years. Marriage never needed any government help. Why do you need a government sanctioned piece of paper? No one in the Bible, in England for the longest time, or the folks landing at Jamestown needed it? I have never understood why the government gets to decide who gets a marriage license except as to protecting individuals of certain age, health, mental, family status along with the children connected to that couple. Marriage isn’t for everyone. But it’s not for the government to make that decision. But social conservatives have for years insisted on everyone wanting to get married had to pay the government. I thought they were for limited government? Now they too may have to pay a lot more. Governor McAuliffe, Mayor Jones or former Attorney General Ken Cuccinelli ain’t got nothing to do with it in my book. Jesus, Moses, never said I had to pay them or anyone else. Why should some government official? This fight over the marriage law is going to wind up changing no one’s mind but increase everyone’s costs. As usual, the government can’t lose. Even if it screwed up passing an unconstitutional law, getting to charge us more money is their penalty! Now ADD higher marriage fees and costs to death, taxes and the other stuff you can’t avoid in Virginia. Paul Goldman is in no way affiliated with WTVR. His comments are his own, and do not reflect the views of WTVR or any related entity. Neither WTVR nor any of its employees or agents participated in any way with the preparation of Mr. Goldman’s comments.	{ "pile_set_name": "Pile-CC" }
In recent years, we have discovered that certain drugs (methylxanthines, phosphodiesterase inhibitors and selective A1 adenosine receptor antagonists) will induce plasticity in the respiratory pathways which results in recovery of the diaphragm after cervical spinal cord injury. Furthermore, we discovered that after rats are exposed to 3 days of multiple systemic drug administrations (3 injections/day);the drug-induced recovery persists long after the animals are weaned from the drug. In an effort to test our basic science work at the clinical level, we conducted 3 clinical studies using the methylxanthine, theophylline. The results of these theophylline studies were mixed. Some patients showed promising results whereas others did not following the required systemic administration of the drug (either by mouth or intravenous administration). The lack of complete success at the clinical level could not be attributed to any single factor. However, it was very clear that the majority of the patients could not tolerate the theophylline doses necessary to induce recovery without experiencing significant side effects (nausea, nervousness, vomiting, etc.) which forced them to discontinue drug therapy. To directly address the problem of side effects following systemic theophylline therapy in cervical SCI patients, we recently developed a novel approach which combines nanotechnology and proven neurobiological principals to "selectively target" only the respiratory motor (phrenic) and pre- motor (rVRG) neurons responsible for diaphragmatic function to induce recovery. We have shown that by using this method we can induce recovery of the diaphragm in spinal cord injured rats using 1/160th the dose of theophylline necessary to induce recovery following systemic drug administration. This approach to inducing motor recovery after SCI has never been taken by any other laboratory in the world. The purpose of this application is to optimize this technique so that it may be developed for clinical use. There will be three specific aims to address the following hypotheses: 1) that following a non-systemic administration (injection into the paralyzed hemidiaphragm) of one of three different drug-delivering conjugate nanodevices, optimal recovery will be induced. 2) that the "site(s) of action" of the conjugate nanodevice in inducing recovery will be determined by using different retrograde transporters to selectively target different respiratory neurons. 3) that following the single administration of either a slow-drug release, a fast-drug release, or a combination (cocktail) of both conjugate nanodevices, long-lasting functional recovery will be achieved in the hemidiaphragm paralyzed by spinal hemisection. PUBLIC HEALTH RELEVANCE: The ability to induce diaphragmatic recovery in SCI rats with conjugate nanodevices using only a small fraction of the theophylline previously necessary to induce recovery, has major translational implications for the use of this drug (and others like it) in treating SCI patients with respiratory muscle weakness. The obvious advantage is the low dose of the drug should reduce (or completely eliminate) the adverse side effects normally associated with administering theophylline systemically (i.e., orally or intravenously). The purpose of this application is to optimize our newly developed technique so that it may be further developed for clinical use as soon as possible.	{ "pile_set_name": "NIH ExPorter" }
Q: Переход по ссылкам без перезагрузки Как переходить по ссылкам на сайте без её перезагрузке с помощью JavaScript? A: Это single page application (SPA), реализовано там это динамической подгрузкой html через Ajax и вставки этого html в страницу. Наивная реализация - это делать маршрутизацию по якорям и при смене этих якорей загружать определённый html фрагмент и вставлять в нужное место, более сложный вариант, писать клиентскую часть веб приложения на фреймворке типа angular, react, vue которые это умеют из коробки	{ "pile_set_name": "StackExchange" }
drawinghowtodraw.com How to Draw Step by Step Drawing Tutorials - Learn How to Draw with Easy Lessons Drawing tutorials and how to draw. Learn how to draw step by step for kids of all ages. Our simple steps will guide you to drawing cartoons, illustrations, and cartoon characters with fun lessons for children.	{ "pile_set_name": "Pile-CC" }
Utilizing generalized autocalibrating partial parallel acquisition (GRAPPA) to achieve high-resolution contrast-enhanced MR angiography of hepatic artery: initial experience in orthotopic liver transplantation candidates. To evaluate feasibility of using GRAPPA to acquire high-resolution 3D contrast-enhanced MR angiography (CE-MRA) of hepatic artery and value of GRAPPA for displaying vessels anatomy. High-resolution CE-MRA using GRAPPA was performed in 67 orthotopic liver transplantation recipient candidates. Signal intensity (SI) and relative SI, i.e., Cv-ro (vessel-to-liver contrast) of the aorta and the hepatic common artery (HCA), were measured. The SI and the relative SI were compared and analyzed using T-test. For purpose of qualitative evaluation, the vessel visualization quality and the order of depicted hepatic artery branches were evaluated by two radiologists independently and assessed by weighted kappa analysis. The depiction of hepatic arterial anatomy and variations was evaluated, and results were correlated with the findings in surgery. The mean SI values were 283.29+/-65.07 (mean+/-S.D.) for aorta and 283.16+/-64.07 for HCA, respectively. The mean relative SI values were 0.698+/-0.09 for aorta and 0.696+/-0.09 for HCA, respectively. Homogeneous enhancement between aorta and HCA was confirmed by statistically insignificant differences (p-values were 0.89 for mean SI values and 0.12 for mean relative SI values, respectively). The average score for vessel visualization ranged from good to excellent for different artery segments. Overall interobserver agreement in the visualization of different artery segments was excellent (kappa value>0.80). The distal intrahepatic segmental arteries were well delineated for majority of patients with excellent interobserver agreement. Normal hepatic arterial anatomy was correctly demonstrated in 53 patients, and arterial anomalies were accurately detected on high-resolution MRA image of all 14 patients. High-resolution hepatic artery MRA acquired using GRAPPA in a reproducible manner excellently depicts and delineates small vessels and can be routinely used for evaluating OLT candidates.	{ "pile_set_name": "PubMed Abstracts" }
Preliminary experiments on effects of microwave irradiation (1 mWatts/cm2) on barbiturate induction time and sleeping time in mice indicate the following interactions. Barbital and phenobarbital induction times were shortened by irradiating for 10 minutes immediately before intravenous administration of the barbiturate. The second distinct interaction seen was that the sleeping time to these two barbiturates were prolonged. Sleeping times to hexobarbital and pentobarbital were less affected. Since it is the long acting barbiturates (where metabolism is not as important a factor in terminating drug action) which were affected more by irradiation and the shorter acting barbiturates which penetrate into the central nervous system quickly (and are the ones where metabolism is important in terminating action) were not affected as much, the working hypothesis is that microwave irradiation increased blood brain permeability. Another separate effect was manifested when mice which were already asleep from phenobarbital were continuously irradiated. These mice regained their righting reflex. This separate effect appears to be an analeptic effect. Another indication of microwave irradiation increasing blood brain barrier permeability was indicated by the increased mortality seen in Japanese Encephalitis Virus (JEV). Two days after innoculation with JEV, mice irradiated with 1 mWatt/cm2 for 5 min showed increase neurotropic mortality to JEV. This irradiation dosage was well below that which caused any lethality by itself. In the coming year, the experiments will be aimed toward substantiatig the postulated increase in blood brain permeability. This will be examined by determining time dependent brain concentrations of the barbiturates and the increased presence of JEV in the brain.	{ "pile_set_name": "NIH ExPorter" }
Q: Is it allowed to use an ex-military aircraft overseas? We are considering using an ex US military helicopter in our counter poaching operations in the Central African Republic, while keeping it registered as a US aircraft with the US "N" number. We are not exporting it to sell and we will and we will maintain ownership and the US "N" number. What restrictions are there for taking an aircraft like this out of the US, if any? I know of a good many former US military helicopters in private and commercial uses in some African countries. And I know that some ex US military helicopters are not "eligible" to export, and some are. What is the difference? A: If it has an N-number and an airworthiness certificate that allows the operations you want to perform with the aircraft, it doesn't matter what it did in a past life, you can operate wherever the country that controls the airspace will allow you to do so. As was mentioned before, the regulations of the country in which you wish to operate the aircraft are more relevant to what you want to do. If on other other hand you have an ex-military aircraft that has an N-number but an exhibition-only experimental airworthiness certificate for a warbird, to pick an example, or some other type of restricted certificate, you're likely to be required to notify the FAA where and when you intend to fly it, and that may trigger additional oversight and possibly a denial of the permission to do so in a foreign country. The operating limitations document of the airworthiness certificate may also limit you to specific airspace within the US. Check the aircraft documentation and see if the FAA already put limits on the helo's operations. That's where you will find the answer from the FAA point of view.	{ "pile_set_name": "StackExchange" }
The invention relates generally to methods for dispersing additives effective to reduce constituents such as carbon monoxide in cigarette smoke into the cigarettes. More specifically, the invention relates to methods for making cigarettes, which involve evenly dispersing very fine particles of additives capable of reducing the amounts of various constituents in tobacco smoke throughout the tobacco rod portion of a cigarette. Smoking articles, such as cigarettes or cigars, produce both mainstream smoke during a puff and sidestream smoke during static burning. One constituent of both mainstream smoke and sidestream smoke is carbon monoxide (CO). The reduction of carbon monoxide in smoke is desirable. Catalysts, sorbents, and/or oxidants for smoking articles, which contribute to the reduction of constituents in the smoke, such as carbon monoxide, are disclosed in the following: U.S. Pat. No. 6,371,127 issued to Snider et al., U.S. Pat. No. 6,286,516 issued to Bowen et al., U.S. Pat. No. 6,138,684 issued to Yamazaki et al., U.S. Pat. No. 5,671,758 issued to Rongved, U.S. Pat. No. 5,386,838 issued to Quincy, III et al., U.S. Pat. No. 5,211,684 issued to Shannon et al., U.S. Pat. No. 4,744,374 issued to Deffeves et al., U.S. Pat. No. 4,453,553 issued to Cohn, U.S. Pat. No. 4,450,847 issued to Owens, U.S. Pat. No. 4,182,348 issued to Seehofer et al., U.S. Pat. No. 4,108,151 issued to Martin et al., U.S. Pat. No. 3,807,416, and U.S. Pat. No. 3,720,214. Published applications WO 02/24005, WO 87/06104, WO 00/40104 and U.S. Patent Application Publication Nos. 2002/0002979A1, 2003/0037792 A1and 2002/0062834 A1 also refer to catalysts, sorbents, and/or oxidants.	{ "pile_set_name": "USPTO Backgrounds" }
3o + fo*4 wrt o. 12o*2 Let g = -10 - -14. Differentiate -3 - 12l*4 + 9l*g + 4l*4 wrt l. 4l*3 Let r(y) = 4y + 5. Let k be r(-5). Let c be ((-12)/k)/((-6)/(-15)). Find the second derivative of -5f3 - 3f + 3f + cf + 3f3 wrt f. -12f Let o(a) = 11a2 - 11. Let i(c) = 21c*2 - 23. Let s(r) = -3i(r) + 7o(r). Find the first derivative of s(m) wrt m. 28m Let h(p) = p4 + p3 - 1. Let f(n) = 28n4 + 9n*3 - n - 11. Let i(d) = -2f(d) + 18h(d). Find the second derivative of i(k) wrt k. -456k*2 Let j = -1 + 3. Let p be -3(j - (-1 + 4)). What is the first derivative of 0 - 3 + 4 + pc wrt c? 3 Let z(t) = 7t*4 + 6t*3 - 4t*2 - 6t. Let v(a) = a3 - a2 - a. Let q(f) = 6v(f) - z(f). What is the third derivative of q(i) wrt i? -168i What is the third derivative of 39k6 - 54k*6 + 33k*6 + 6k*2 + 6k*2 wrt k? 2160k3 Let k(l) be the first derivative of l2 + l - 5 + l2 + 0 + 0. Find the first derivative of k(b) wrt b. 4 Let g(x) be the third derivative of x6/3 - 37x4/24 - 16x*2. Find the second derivative of g(a) wrt a. 240a Let w be (0 - 0)/(5/(-5)). What is the second derivative of -t*2 + wt + 3t - 5t wrt t? -2 Let y(i) be the second derivative of -6i5/5 + 7i*2 + 24i. Differentiate y(g) wrt g. -72g2 Let g(b) be the second derivative of -b10/2520 - b6/360 + b3/2 + 3b. Let j(r) be the second derivative of g(r). Find the third derivative of j(q) wrt q. -240q3 Let h(f) = f + 8. Suppose -2d - 9 = 3. Let z be h(d). What is the third derivative of z - x*3 - 2x2 - 2 wrt x? -6 Let x(o) = o2 - o - 2. Let n be x(-1). Find the third derivative of 4w4 - 27w*2 + 29w*2 + nw*4 wrt w. 96w Let r(x) = -2x - 2. Let k be r(-5). Let m be (k - 1)(-6)/(-21). Differentiate 6w2 + 1 - 6w*m - 4w*4 wrt w. -16w*3 Let f(a) be the second derivative of 0a*5 - 1/14a*7 - 1/6a*3 + 0a*4 + 0a*6 + 0a*2 + 4a + 0. Find the second derivative of f(p) wrt p. -60p3 Suppose 3g = 6g. Let s(i) be the second derivative of 0 + gi*4 - 1/30i*6 + 0i*5 + 0i*3 + 2i - i*2. What is the derivative of s(a) wrt a? -4a*3 Let i(y) be the second derivative of 0 - 2y + 1/10y5 + 0y*3 + 0y*2 + 1/3y4. Find the third derivative of i(t) wrt t. 12 Let q(x) = x2 + x. Let k(h) = -6h2 - 3 - h + 0h*2 - 1 + 3h*2. Let j(m) = -2k(m) - 2q(m). Find the first derivative of j(c) wrt c. 8c Suppose 0 = 6v - 3v - 54. Find the first derivative of -13 - 5d3 - 5d*3 + v + 3d*3 wrt d. -21d2 Let v(i) be the first derivative of -i7/70 + i5/30 - i2 - 1. Let t(r) be the second derivative of v(r). What is the third derivative of t(d) wrt d? -72d Suppose 5d = 4u + u + 25, 0 = 4u + 8. Suppose -3o = -6 - d. What is the first derivative of -2z*o + 4 - 3 + 4z*3 wrt z? 6z*2 Let d(y) be the second derivative of 0y*3 - 6y + 0y2 - 1/2y*4 + 0 + 1/10y*5. Find the third derivative of d(a) wrt a. 12 Let q(v) be the third derivative of 1/15v*5 + 4v*2 + 0v + 1/24v4 + 0v*3 + 0. Find the second derivative of q(x) wrt x. 8 Let m(h) be the first derivative of -3h*4/4 + 21h*2/2 + 3. Find the second derivative of m(c) wrt c. -18c Let k(z) be the second derivative of z + 0z5 + 2/3z*4 + 0z*3 + 0 + 7/30z*6 + 0z*2. What is the third derivative of k(b) wrt b? 168b Suppose -22 = -h - 3c - c, -8 = h - 2c. Let v(g) be the third derivative of 0 - 1/6g3 + 0g + 1/8g4 + 3gh. Differentiate v(m) with respect to m. 3 Let y(a) be the first derivative of -a5 - 8a3/3 + 4. What is the third derivative of y(p) wrt p? -120p Let p(i) be the first derivative of 0i + 0i3 - i4 + 3/2i2 - 4. What is the second derivative of p(f) wrt f? -24f Find the third derivative of 3z2 - 5z + 5z - 21z6 + z2 wrt z. -2520z3 Let x(j) be the first derivative of 35j*4/4 - 41j*2/2 - 1. What is the second derivative of x(p) wrt p? 210p Let d(r) = -r - 2. Let k be d(-6). What is the second derivative of kg4 + 2g - 12g4 + g wrt g? -96g*2 Find the third derivative of -100l*2 + 92l*2 + 6l*4 + 25l*4 wrt l. 744l Let c(g) be the first derivative of g6/10 - g4/4 + 4g + 4. Let h(w) be the first derivative of c(w). What is the third derivative of h(l) wrt l? 72l Let y(c) be the third derivative of c*5/4 - 17c*3/6 - 38c*2. What is the first derivative of y(h) wrt h? 30h Let w(n) = -5n3. Let m be w(-1). Suppose 0 = -4f - 5p + 40, -mf + 12 = -f - 2p. What is the derivative of 2 + fi - 4i + 0i wrt i? 1 What is the third derivative of 22y2 - 24y*2 - 9y*5 + 0y*5 wrt y? -540y*2 Let u = 11 - 11. Suppose 4f + 0 = -3z + 2, u = 2z + 4f. Find the second derivative of 2o*z - 2o*2 + 2o*2 - 2o + 0o wrt o. 4 What is the third derivative of -9k*5 + 3k*2 - 19k*5 + 0k*2 wrt k? -1680k2 Let c(f) be the second derivative of f9/5040 + f5/24 - f4/2 + 7f. Let g(x) be the third derivative of c(x). Find the first derivative of g(s) wrt s. 12s*3 Let r = 1 + 1. Find the second derivative of 0l*r + 2l - 5l2 + l3 + 5l*2 wrt l. 6l Let j(g) = -10g3 - 6. Let t = 51 + -34. Let s(r) = -3r*3 - 2. Let x(p) = ts(p) - 6j(p). Find the first derivative of x(f) wrt f. 27f*2 Find the second derivative of -1 - 2s*3 + 3 - 8s - 13s + 2s*4 + 79s wrt s. 24s2 - 12s Let j(p) be the second derivative of 1/3p3 + 3/2p*2 + 3p + 0. Differentiate j(n) wrt n. 2 Let h(v) = -5v2 - 3v. Let p(s) = -s*2 + s. Let n(z) = -3h(z) + 6p(z). Find the second derivative of n(i) wrt i. 18 Suppose -5o + 2 = 32. Let m(u) = -5u3 + u2 + 6. Let r(c) = 15c*3 - 3c*2 - 17. Let x(a) = or(a) - 17m(a). What is the third derivative of x(d) wrt d? -30 Let a = 3 - 2. Let p(u) = 4u*2 + 4u - 4. Let y(t) = -t. Let c(j) = -j + 1. Let h be c(-3). Let q(d) = ap(d) + hy(d). What is the derivative of q(s) wrt s? 8s Let f(c) be the second derivative of -3/56c*8 + 0c*5 + 0c*2 - 4c + 0c7 + 0 + 1/6c*4 + 0c*3 + 0c*6. Find the third derivative of f(p) wrt p. -360p*3 Find the second derivative of 24y + 3y2 - 3y*2 - 9y - 26y4 wrt y. -312y*2 What is the second derivative of 4s*2 - 3s + 8s2 - 4s - 9s2 wrt s? 6 Suppose -5g = -3z, -5g - 5z + 27 + 13 = 0. Let o be (-10)/(3(-2)/g). What is the derivative of b - b + o - 4 + 3b2 wrt b? 6b Suppose -5c + 2l = l - 19, -14 = -3c - 2l. Let x be (c + -5)/((-1)/2). Differentiate 4 - xm2 + m2 - 3 with respect to m. -2m Let b be (3/3 - 1) + 2. Let l be 24/6b/4. Find the third derivative of 12t + t*l - 12t - t*4 wrt t. -24t Suppose -9 = -3b + 9. Suppose -bo = -2o - 16. What is the second derivative of -of*2 + 4f + f*2 + 7f*2 - 2f2 wrt f? 4 Let p(f) be the third derivative of f8/56 + f*4/6 + 6f*2. Find the second derivative of p(q) wrt q. 120q3 Let a(u) be the third derivative of u4/24 - u*3/6 - 5u*2. What is the derivative of a(p) wrt p? 1 Let x(y) = 2y*3 + 6y*2 - 6y - 7. Let t(z) = -z*2 + z. Let i(c) = 6t(c) + x(c). Find the first derivative of i(f) wrt f. 6f2 What is the second derivative of -181 + 12o + 9o2 + 181 wrt o? 18 Let g(n) be the second derivative of 5n*4/2 - 5n*3/2 + 8n. What is the second derivative of g(v) wrt v? 60 Let v(m) be the second derivative of m7/280 + m6/120 + m*3/3 - 3m. Let y(a) be the second derivative of v(a). Find the third derivative of y(l) wrt l. 18 Suppose -4 - 4 = -2f. Find the second derivative of 2k - 15kf - 9k + 22k4 wrt k. 84k*2 Suppose -3n + 7 = -8. Find the second derivative of y*4 + 2y + 0y + ny - 5y4 wrt y. -48y*2 Let k(q) = -47q*4 + 8q*3 + 37q*2 - 8q. Let t(h) = 31h4 - 5h*3 - 25h*2 + 5h. Let d(a) = -5k(a) - 8t(a). Find the third derivative of d(y) wrt y. -312y Let s(q) be the third derivative of q8/280 + q5/30 - q3/3 - 5q*2. Let v(m) be the first derivative of s(m). What is the second derivative of v(c) wrt c? 72c*2 Let h(t) be the third derivative of 0t*6 + 0 + 0t + 0t3 + 1/6t*4 + 0t*5 + 2/105t*7 - 3t*2. What is the second derivative of h(p) wrt p? 48p*2 Find the third derivative of -4h2 - h2 + 9h4 + 2h*2 wrt h. 216h Let j(k) be the thir	{ "pile_set_name": "DM Mathematics" }
Día de la Chupina The Día de la Chupina (Spanish, literally Hooky Day) is a popular event and self-styled "holiday" created by secondary school students in the city of Rosario, Argentina. It is held annually, on the last Friday of every April. On this day, the students (with or without knowledge and/or consent of their parents) do not attend their classes, but gather instead in some particular spots of the city center, especially the National Flag Memorial and the highly commercial pedestrian-only section of Córdoba Street (Peatonal Córdoba). History The first instance of the Día de la Chupina recorded in the press dates from 2001. On that occasion the event turned into a riot, in some cases fueled by alcohol consumption, since the first morning hours. Female students were harassed, and certain groups of students were attacked. The police intervened only later, detaining 13 students. These incidents were repeated in 2002, on a larger scale. A large group or gang of students (between 100 and 200 according to witnesses) threw stones at windows, broke into shops to rob them, and attacked several people. The police detained 38 students. Similar incidents took place again in 2003, with about 50 students attempting to steal merchandise from shops. The police acted quickly this time, and detained 10 offenders. The celebrations in 2004 were considerably less problematic, though many shop owners chose to keep their doors temporarily closed. No incidents were reported in 2005 and 2006. References Día de la Chupina in Rosario's local newspapers: La Capital, 2001 (Internet Archive) La Capital, 2004 La Capital, 2006 Rosario3.com, 2008 Category:Education in Rosario, Santa Fe Category:Argentine culture Category:Unofficial observances Category:April observances	{ "pile_set_name": "Wikipedia (en)" }
Q: Formatting keywords, data in algorithm2e I am just wondering if there is a way to reference the keyword data outside the algorithm in algorithm2e package. For example, given the example in algorithm2e, if I want to reference \KwData{this text} in my text outside the algorithm, how should I do it? \begin{algorithm}[H] \SetLine \KwData{this text} \KwResult{how to write algorithm with \LaTeX2e } initialization\; \While{not at end of this document}{ read current\; \eIf{understand}{ go to next section\; current section becomes this one\; }{ go back to the beginning of current section\; } } \caption{How to write algorithms} \end{algorithm} A: In the example you've given, this text is completely unformatted, and it's best to use it as-is in your text. However, components of an algorithm are styled using various macros: \DataSty{<stuff>} Used to set data (default is \textsf): \ArgSty{<stuff>} Used to set arguments (to functions; default is \textit): \KwSty{<stuff>} Used to prefix input parameters for an algorithm (default is \textbf): \FuncSty{<stuff>} Formatting of a function name (default is \texttt): \CommentSty{<stuff>} Formatting of comments (default is \texttt): \TitleSty{<stuff>} Used to set the title of the algorithm via \TitleOfAlgo (default is regular text): ... I would use the appropriate style in the text as well, like in the following example: \documentclass{article} \usepackage{algorithm2e} \begin{document} \SetKwData{matrixinput}{some matrix}% \begin{algorithm}[H] \KwIn{\matrixinput} \KwResult{how to write algorithm with \LaTeX2e } initialization\; \While{not at end of this document}{ read current\; \eIf{understand}{ go to next section\; current section becomes this one\; }{ go back to the beginning of current section\; } } \caption{How to write algorithms} \end{algorithm} We use \matrixinput as input. \end{document} The input \matrixinput is defined outside the algorithm environment in order to make it usable outside of that scope (without your text).	{ "pile_set_name": "StackExchange" }
Q: Jquery UI Drag N Drop duplication issue Here is the link to my page. I am having an issue with the jQuery UI drag n drop functionality. I need it to be able to drag multiple of the same item to the container next to it, and all me to reorder them. So far it allows me to drag and drop 3 as i set in the code, but the problem is when i drag anything else into the box and try to reorder the list, the current list item i am trying to drag duplicate itself until there are 3 before it allows me to reorder them. Any help in preventing duplication unless I am dragging from the container on the left? Here is my HTML: <div id="products" class="column large-4 row"> <h1 class="ui-widget-header">Drag hiring steps to the box on the right.</h1> <div class="ui-widget-content"> <ul> <li data-id="1"><span>Phone Interview</span></li> <li data-id="2"><span>In-Person Interview</span></li> <li data-id="3"><span>Technical Test</span></li> <li data-id="4"><span>Personality Test</span></li> <li data-id="5"><span>Background Check</span></li> <li data-id="6"><span>Drug Test</span></li> <li data-id="7"><span contenteditable>Custom Addition</span></li> </ul> </div> </div> <div id="shoppingCart1" class="shoppingCart column large-6 push-1"> <h1 class="ui-widget-header">Drag & drop steps to reorder the hiring process.</h1> <div class="ui-widget-content"> <ol> </ol> </div> </div> And here is my JS: var $start_counter = $( "#event-start" ), $drag_counter = $( "#event-drag" ), $stop_counter = $( "#event-stop" ), counts = [ 0, 0, 0 ]; $("#products li").draggable({ appendTo: "body", helper: "clone", cursor: "url(grab.cur), url(img/hand.png), auto", start: function() { var dd = $(this).text(); console.log( dd + ' is dragging'); } }); $(".shoppingCart ol").droppable({ activeClass: "ui-state-default", hoverClass: "ui-state-hover", drop: function(event, ui) { var self = $(this); self.find(".placeholder").remove(); var productid = ui.draggable.attr("data-id"); if (self.find("[data-id=" + productid + "]").length == 3) return; $("<li></li>", { "text": ui.draggable.text(), "data-id": productid, "class": 'editable' }).appendTo(this); $("<span></span>", { "class": 'close pull-2' }).appendTo('.editable'); $('.ui-droppable li').wrapInner('<span class="white"> </span>'); // To remove item from other shopping chart do this var cartid = self.closest('.shoppingCart').attr('id'); $(".shoppingCart:not(#"+cartid+") [data-id="+productid+"]").remove(); var removeMom = function(el) { el.on('click', function() { var closeBtn = $(this).parents('.editable'); closeBtn.slideUp(200, function() { $(this).remove();} ); }) } $('.ui-draggable, .editable').each( function() { handTrick( $(this) ); } ); $('.close').each( function() { removeMom( $(this) ); } ); } }).sortable({ items: "li:not(.placeholder)", sort: function() { $(this).removeClass("ui-state-default"); } }); var removeMom = function(el) { el.on('click', function() { var closeBtn = $(this).parents('.editable'); closeBtn.remove(); }) } var handTrick = function(el) { el.on('mouseover', function() { $(this).css({cursor: "pointer"}); }); el.on('mouseoout', function() { $(this).css({cursor: "auto"}); }); el.on('mousedown', function() { $(this).css({cursor: "url(grab.cur), url(img/hand.png), auto"}); }); el.on('mouseup', function() { $(this).css({cursor: "pointer"}); }); } $('.close').each( function() { removeMom( $(this) ); } ); $('.ui-draggable').each( function() { handTrick( $(this) ); } ); var yy = $('.ui-widget-content').height(); $('.ui-droppable').css('min-height', yy); CSS you can see for yourself when you go to the page. I hope someone can help! A: Found a solution. I had to wrap the drop in a conditional. It still allows me to drop into the container without each item being able to duplicate itself when dragged while, inside the container. if(!ui.draggable.hasClass('editable')){ var self = $(this); var productid = ui.draggable.attr("data-id"); if (self.find("[data-id=" + productid + "]").length == 9) return; $("<li></li>", { "text": ui.draggable.text(), "data-id": productid, "class": 'editable', }).appendTo(this); $("<span></span>", { "class": 'close pull-2' }).appendTo('.editable'); $('.ui-droppable li').wrapInner('<span class="white"> </span>'); var cartid = self.closest('.shoppingCart').attr('id'); $(".shoppingCart:not(#"+cartid+") [data-id="+productid+"]").remove(); var removeMom = function(el) { el.on('click', function() { var closeBtn = $(this).parents('.editable'); closeBtn.slideUp(200, function() { $(this).remove();} ); }) } $('.ui-draggable, .editable').each( function() { handTrick( $(this) ); } ); $('.close').each( function() { removeMom( $(this) ); } ); }	{ "pile_set_name": "StackExchange" }
PostgreSQL vs. SQL Server from the point of view of a data analyst (2014) - insulanian https://www.pg-versus-ms.com/ ====== netcraft My previous job(s) were primarily MSSQL and I was excited to get to use PG in my current position. In general I agree with the premise of the article - for just about everything PG is better. For me, the only places where MSSQL has an edge is: \- Management Studio is superior to any standard query manager ive found for PG. I currently use what is in intellij (which is similar to their datagrip product) which I find perfectly acceptable and in some ways superior to Management Studio, but PGAdmin isn't in the same ballpark. \- MSSQL visual query explainer is great - ive found some alternatives ([http://tatiyants.com/pev/#/plans](http://tatiyants.com/pev/#/plans)) and in general ive gotten much better at reading and understanding the text output of PG's explain, but I do miss MSSQL in this regard. \- MSSQL CTE's not being optimization fences meant that I got to use them in more places. But I can do more things with CTE's in PG (such as using an ORDER BY) - this is relatively minor but annoying - readability with CTE's vs subqueries is much improved. \- Snapshot and transaction logs with MSSQL is much better than any alternative ive found with PG, but tbf I haven't looked into it very far. When it comes up though it would be really nice to be able to restore to point in time easily with PG. \- I do occassionally come across missing functions in PG, but thats getting more and more rare. \- Cloud offerings - they exist for PG and are great for what they offer, but many extensions are not available or not fully configurable which is also sometimes hard to even determine. All that said - if you aren't already invested in the MS ecosystem, PG would be my preference for sure. JSON/hstore/arrays alone make so many things possible even if you arent using those datatypes in your tables. ~~~ zie pgbarman [0] will handle the restore to point in time use case above. There are other solutions as well, but I've found pgbarman to work great, and can't speak for others. [0] [http://www.pgbarman.org/](http://www.pgbarman.org/) ~~~ snuxoll Barman is awesome, have been using it in production for two years now - I cannot reccomend it enough. Funny enough, I found it easier to work with than trying to set up a maintenance plan with SSMS and restores are dead-easy too. ------ WesBrownSQL This is a completely anecdotal analysis. Every time this comes up it makes me cringe. Yes, I use MSSQL. Yes, I really like MSSQL. I know loads more about MSSQL than I do PostgreSQL and that plays a huge part in it. Like this person I am qualified to tell you how totally awesome MSSQL is. Also, like this person I AM NOT qualified to compare it to PostgreSQL even though I do use PG too. This isn't a problem of bias, this is a lack of knowledge on the part of the author. I don't know how to do X in MSSQL so PostgreSQL is clearly better. What needs to happen is experts on both sides sit down and do a true comparative analysis and then the reader can decide which product suits their needs best. ~~~ teh_klev Thanks, saved me the bother of saying this as well. That section on "Reliability" is pure comedy, the only time I had SQL Server "crash" was due to faulty hardware. And despite the best efforts of our previous data centre company (who we've since ditched) dropping the ball and losing power across the site multiple times over two years our MS SQL servers never lost any data, despite the rug being pulled whilst under some fairly heavy workloads. I should add that neither did any of the MySQL fleet, even the ones running replication. One day when I get time I'll get around disembollocking this flawed article. I don't say that as a MS SQL "fanboy", but as a DBA with coming on for 20 years experience managing and programming SQL Server in banks, blue chips and ISP's (yeah I know, "appeal to authority"-fail, but who the hell is this anonymous author, and what are his credentials?). Edit: sorry I should add I quite like PostgreSQL, and I'm hoping to roll it out as a service offering to our client base in the next few months, so no axe to grind from me with regards to its features and capabilities. ~~~ j_s My experience: SQL Server kicks its NAS off the network due to the NAS's own flakiness, but SQL Server has always recovered fine. I've had to boot it in single-user mode many times to cut the thundering herd down to size on startup/recovery, but then it's back to business. ------ breakingcups I'll repeat my comment from the last time this was posted: The last time this article came up the consensus was that the author was pretty biased towards Postgres and had little to no experience with actual MS SQL Server use. Also, the lack of author identity was frowned upon. Lastly, the conjecture and attitude towards Microsoft lacks some substance. Conclusion: The author is free to write whatever he likes, but take this resource with a pinch of salt. I use both Postgres and MS SQL Server professionally and whilst philosophically I prefer Postgres, for practical reasons I truly prefer MS SQL Server, if only because of its excellent development tools. ~~~ gaius What - other than fanaticism - would motivate an individual to register the domain name etc to put this up? I've been doing databases professionally for 20+ years. I've used all of the big names apart from DB2, just never encountered it. Whether it's SQLite, PG, MariaDB, SQL Server, Sybase, Informix, Oracle, there's a right tool for the job. Also a "data analyst" who never encounters a situation where parallel query will help is a person who works on very small datasets on a single disk or maybe a small RAID5 array. ------ dhd415 The fact that the author just dismisses columnar indexes because he doesn't use them leads me to question his credibility as a serious critic of tools for typical analytics workloads since columnar indexes make a huge difference in performance on many of those workloads. SQL Server has them built in and they're available as extensions for PostgreSQL. ------ okket Previous discussions: [https://news.ycombinator.com/item?id=9464505](https://news.ycombinator.com/item?id=9464505) (2 years ago, 135 comments, "dupe") [https://news.ycombinator.com/item?id=8615320](https://news.ycombinator.com/item?id=8615320) (2.3 years ago, 103 comments) ------ iblaine >But I have MS SQL Server skills, not PostgreSQL skills! >You'd rather stick with a clumsy, awkward, unreliable system than spend the trivial amount of effort it takes to learn a slightly different dialect of a straightforward querying language? Well, just hope you never end up in a job interview with me. I imagine anyone who easily dismisses MSSQL would be an easy interview. A good engineer will recognize the pros and cons of each database and make their decision based on their requirements. To dismiss MSSQL outright is pretty noobish, even for a lowly data analyst. ------ juliangoldsmith I'm a fan of Postgres, but I have to take issue with point 1.4. Last I knew, Postgres had no support for stored procedures, which makes integration with procedural languages almost useless. ~~~ dragonwriter > Last I knew, Postgres had no support for stored procedures, which makes > integration with procedural languages almost useless. So, going through old docs, Postgres seems to have had stored procs using procedural languages since at least version 7.1, released in April 2001. It clearly has had them for quite some time, at any rate. ------ jpster Any recommendations for a really good PostgresSQL tutorial? ~~~ rallycarre [https://pgexercises.com/](https://pgexercises.com/) I've found it one of the best tutorials of anything on the web. It's challenging and you learn through example. ~~~ nallerooth Thanks, that looks great! ------ sankyo I cannot stand it when a post is not dated. How can I know that this isn't some old, irrelevant comparison from 2001? It doesn't take much effort to add a posting date. ~~~ anshou- There doesn't appear to be any date on the site to indicate when it was written or updated. ------ frik MSSQL's SQL syntax like that found in MSSQL 2012 is very outdated. Many old rusty parts of MSSQL date back to the Sybase, MSSQL is a fork of it. Also WinNT (incl Win10), MSSQL and most other MSFT software is UCS-2 which they often mislabel as UTF-16. UCS-2 cannot manage emoticons and other newer unicode characters. Whereas everyone on the planet decided on UTF-8. So everything OP mentioned in the article is true. ------ krystiangw Base on the stats below seems that Mysql is still more popular than PostgreSQL. # Name \| Popularity \| Avg salary global 1\. Mysql \| 7.44% \| $56,506 2\. PostgreSQL \| 4.32% \| $61,505 3\. MongoDB \| 3.2% \| $64,206 4\. Sql Server \| 2.71% \| $65,959 5\. Oracle \| 2.09% \| $52,312 6\. Redis \| 1.92% \| $51,728 More stats and details here [https://jobsquery.it/stats/databases/group](https://jobsquery.it/stats/databases/group) ~~~ netcraft not sure if it was intended, but the article is discussing MSSQL not MYSQL. I think MYSQL has a popularity advantage over PGSQL because of a long tail of historical reasons, but this is just my opinion. ~~~ collyw Its a bit like PHP, its easy to install and get started compared to PG (I need to look up the docs every time I do a PG install to get the initial users started - Mysql often offers me that from the OS package manager).	{ "pile_set_name": "HackerNews" }
Justin Leahy Justin graduated from the U.S. Naval Academy in 2012 with a degree in Economics. Upon receiving his commission in the U.S. Navy, he entered the submarine training pipeline which culminated in orders to the USS Florida in Kings Bay, GA. He served several roles during his 3-years onboard the USS Florida prior to separating from the U.S. Navy in December of 2017. Justin will be starting at Chicago Booth in the Fall of 2018.	{ "pile_set_name": "Pile-CC" }
Storm 40, Soul 44 Storm Insider Recap With just over seven minutes remaining in ArenaBowl XXX, Tampa Bay Storm kicker Mark Lewis booted an onside kick that was recovered by teammate Allen Chapman, and moments later, Storm quarterback Randy Hippeard threw a touchdown bomb to Justin Hilton, the long strike cutting Philadelphia’s lead to 37-34. Prior to the onside recover and subsequent touchdown, the Storm were teetering on the brink of defeat. The sudden-change sequence gave new life to the Storm. The Soul summarily snuffed it out one offensive play later. Following a second Lewis onside attempt recovered by Philadelphia, Soul quarterback Dan Raudabaugh hit receiver Shaun Kauleinamoku in the corner of the end zone to push Philly’s lead back to 10. The Soul held on over the final minutes to defeat the Storm 44-40 in front of its home crowd of 13,648 at the Wells Fargo Center, winning their second-consecutive ArenaBowl. A valiant effort by the Storm to capture what would have been an Arena Football League-best sixth championship fell just short.	{ "pile_set_name": "Pile-CC" }
--- bibliography: - 'journals\_apj.bib' - 'psrrefs.bib' - 'modjoeri.bib' - 'modrefs.bib' - 'repeaters.bib' - 'yreferences.bib' date: 'Received date / Accepted date' title: 'Repeating fast radio bursts with WSRT/Apertif' --- [Repeating fast radio bursts (FRBs) present excellent opportunities to identify FRB progenitors and host environments, as well as decipher the underlying emission mechanism. Detailed studies of repeating FRBs might also hold clues to the origin of FRBs as a population.]{} [We aim to detect bursts from the first two repeating FRBs: (R1) and (R2), and characterise their repeat statistics. We also want to significantly improve the sky localisation of R2 and identify its host galaxy.]{} [We use the Westerbork Synthesis Radio Telescope to conduct extensive follow-up of these two repeating FRBs. The new phased-array feed system, Apertif, allows covering the entire sky position uncertainty of R2 with fine spatial resolution in a single pointing. The data were searched for bursts around the known dispersion measures of the two sources. We characterise the energy distribution and the clustering of detected R1 bursts.]{} [We detected 30 bursts from R1. The non-Poissonian nature is clearly evident from the burst arrival times, consistent with earlier claims. When combined with previous reports, our measurements indicate an increase of $2.7(2) {{\ensuremath\mathrm{\,pc\,cm^{-3}}}}\, \mathrm{yr^{-1}}$ in the dispersion measure along the line of sight. Assuming a constant position angle across the burst, we place an upper limit of 8% on the linear polarisation fraction for the brightest burst in our sample. We did not detect any bursts from R2.]{} [A single power-law might not fit the R1 burst energy distribution across the full energy range or widely separated detections. Our observations provide improved constraints on the clustering of R1 bursts. Our stringent upper limits on the linear polarisation fraction imply a significant depolarisation, either intrinsic to the emission mechanism or caused by the intervening medium, at 1400MHz that is not observed at higher frequencies. The non-detection of any bursts from R2, despite nearly 300hrs of observations, imply either a highly clustered nature of the bursts, a steep spectral index, or a combination of both assuming the source is still active. Another possibility is that R2 has turned off completely, either permanently or for an extended period of time.]{} Introduction {#sec:introduction} ============ Fast radio bursts (FRBs) are transient, highly luminous events characterised by their short timescales of typically only a few milliseconds and dispersion measures (DMs) which are generally much larger than those expected from the Galactic electron density. These properties suggest FRBs to have originated from compact, highly energetic extra-galactic sources [@Lorimer07; @Thornton13]. Despite extensive follow-up, the majority of the discovered FRBs have been found to be one-off events [@Petroff2015]. However, to date, 11 FRBs have been reported to exhibit repeat bursts [@spitler16; @R2CHIME19; @CHIME19c; @Patek19]. For a recent review of FRBs, see @phl19. The repeat bursts from some FRBs enable studies of several FRB properties which are otherwise very hard to do for one-off sources. For example, deep follow-up of the repeating FRBs makes it possible to determine their sky positions with extremely high precision, identify the host galaxies and even associated persistent radio, optical or high-energy sources, if present. The localisation precision also helps in following-up any transient, multi-wavelength emission associated with the bursts. The repetition of bursts from the same source constrains FRB theory as well. A distinct constraint is that a cataclysmic event cannot produce repeating FRBs, and the underlying emission process should be able to sustain and/or repeat itself over considerably long periods of at least several years. The repetition also helps in much detailed investigations of the individual bursts, e.g., using coherently dedispersed high time and frequency resolution and/or over a wide frequency span. At the time of observations used in this work, two FRBs were known to repeat — and [hereafter R1 and R2, respectively, @spitler16; @R2CHIME19]. R1 is precisely localised [@Chatterjee17; @Marcote17] to a low-mass, low-metallicity dwarf galaxy [@Tendulkar-2017], which has helped in theoretically exploring the potential progenitors. Detailed radio follow-up has uncovered several intriguing features of R1. One particularly noteworthy feature is the complex time-frequency structures noted in several individual bursts, in the form of nearly 250MHz wide frequency bands (at 1400MHz) drifting towards lower frequencies [@hss+19]. These bands are not caused by interstellar scintillation, and rather likely to be either intrinsic to the emission process or caused by exotic propagation effects like plasma lensing. Similar frequency bands, albeit without the drifting in some cases, have also been observed from a number of galactic neutron stars (the Crab pulsar PSR B0531+21, @Hankins16; the Galactic Center Magnetar PSR J1745$-$2900, @Pearlman18; Magnetar XTE J1810$-$197, @Maan19b). However, any links between these galactic neutron stars and FRBs are as yet unclear, and require further study. In this work we therefore focus on repeating-FRB pulse-energy distribution and repetition statistics, and compare them to those of pulsar giant pulses and bursts from soft gamma ray repeaters (SGRs). The arrival times of R1 bursts are not well-described by a homogeneous Poisson process [@scholz16; @orp18], implying a clustered nature of the bursts. The clustering of the bursts has important implications for accurately determining the repeat rate as well as optimal observing strategies. It might also contain clues about the emission mechanism. Furthermore, R1 bursts exhibit nearly 100% linear polarisation at 4500MHz and an exceptionally large, rapidly varying rotation measure [RM; $1.33-1.46\times10^5{{\ensuremath\mathrm{\,rad\,m^{-2}}}}$; @msh+18]. This indicates that the R1 bursts are emitted in, or propagate through, an extreme and varying magneto-ionic environment. Due to the potential inter-channel depolarisation caused by the exceptionally large RM, the polarisation characteristics at 1400MHz are not fully known. A polarimetric characterisation at this frequency needs observations with reasonably narrow ($\lesssim$100kHz) frequency channels. R2 was discovered using the pre-commissioning data from the CHIME telescope. Some of the bursts from R2 showed strong similarities with those from [R1]{} in terms of the complex time-frequency structures. However, the uncertainties in the sky position [$\pm4'$ and $\pm10'$ in RA and Dec, respectively @R2CHIME19] have limited any more detailed comparisons between the two repeating FRBs as well as extensive studies of the R2 bursts themselves. A precise localisation using an interferometer will enable detailed polarimetric and high resolution studies of the R2 bursts as well as probes of the host galaxy and any associated persistent radio or high-energy source. In this work, we aim to characterise the 1400MHz polarisation and clustering nature of the bursts from R1, particularly for the bursts at the brighter end of the energy distribution, and localise R2 as well as study many of the above-mentioned aspects of both the repeating FRBs. For this purpose, we have utilised primarily the commissioning data from the new Apertif system on the Westerbork Synthesis Radio Telescope (WSRT). Using the large data sets acquired on R1 and R2, we present here the emission statistics of these two FRBs, over the highest pulse energies, and the longest timescales so-far reported. In the following sections, we provide more details on the time-domain observing modes used in this work (Sect. \[sec:apertif\]) as well as observations and data reduction methods (Sect. \[sec:obs\_and\_data\_reduction\]). We present and discuss our results obtained for R1 and R2 in Sects. \[sec:121102\] and \[sec:r2\], respectively. The overall conclusions are summarised in Sect. \[sec:conclusion\]. The Apertif observing modes {#sec:apertif} =========================== Aperture Tile in Focus (Apertif) is the new phased-array feed system installed on WSRT. It increased the field-of-view (FoV) to ${\sim}8.7\,$ square degrees, turning WSRT into an efficient survey instrument (@ovc10 [@2019NatAs...3..188A]; van Capellen et al. in prep). The system operates in the frequency range of $1130-1760\,$MHz with a maximum bandwidth of $300\,$MHz. The frequency resolution depends on the observing mode, as explained in the next subsections. Each of the WSRT dishes beam-forms the 121 receiver elements into up to 40 partly-overlapping beams on the sky (hereafter compound beams), each with a diameter of roughly $35\arcmin$ at $1400\,\mathrm{MHz}$. The data are then sent to the central system, which either operates as a correlator for imaging (cf. Adams et al. in prep), or as a beamformer for time-domain modes [@leeu14]. The time-domain observing mode system exploits the wide FoV to search for new FRBs as well as to localise any poorly localised repeating FRBs. This mode is enabled by a back-end that is capable of detecting such highly dispersed events in . We commissioned this system on pulsars and repeating FRBs (van Leeuwen et al. in prep). The following two time-domain modes were used to obtain the data presented here. Baseband mode {#sec:sub:sc1} ------------- In baseband mode, the central beam of up to ten telescopes is combined to obtain a high-sensitivity beam in one direction. The pulsar backend then either performs real-time pulsar folding, or records the raw voltages with a time resolution of $1.28\mathrm{\,\mu s}$ and frequency resolution of $0.78125\,$MHz. This allows for coherent dedispersion, as well as choosing an optimal trade-off between time and frequency resolution. During commissioning, we were at first limited to a bandwidth of $200\,$MHz and a single polarisation. The total sensitivity of the single-polarisation system is a factor $\sqrt{2}$ lower than that of the full dual-polarisation system. In early 2019 the system was upgraded to dual-polarisation and in March 2019 the bandwidth was increased to $300\,$MHz. Survey modes {#sec:sub:sc4} ------------ In survey mode, the system beamforms all 40 dish beams either coherently or incoherently. In coherent mode, voltage streams are combined across dishes with the appropriate complex weights. The resulting tied-array beams (TABs) are narrow (${\sim} 25\arcsec$) in East-West direction, but retain the dish resolution of ${\sim} 35\arcmin$ in North-South direction. In incoherent mode, intensity data are summed across dishes for all 40 compound beams individually. The incoherent-array beams (IABs) retain the full dish field-of-view, but at a sensitivity loss of $\sqrt{N_\mathrm{dish}}$ compared to the TAB mode. For survey mode data, both polarisations are summed. The resulting Stokes I data are stored to disk in filterbank format with a time resolution of $81.92\,\mathrm{\mu s}$ and frequency resolution of $0.1953125\,$MHz [@2017arXiv170906104M]. Observations and data reduction {#sec:obs_and_data_reduction} =============================== Observations {#sec:sub:obs} ------------ R1 and R2 were observed with Apertif between November 2018 and August 2019. R1 was observed in baseband mode, as well as both the incoherent and coherent survey modes. R2 is not well enough localised to be observed in the baseband mode, which is only suitable if the source is localised to within one Apertif tied-array beam. It was, however, observed with the incoherent and coherent survey modes. In total we spent ${\sim}130$ hrs on R1 and ${\sim}300$ hrs on R2. An overview of the observations is given in Fig. \[fig:obs\]. ![Overview of Apertif observations of R1 (top) and R2 (bottom). Blue diamonds indicate observations without detected bursts, red triangles indicate observation with detected bursts. Along the vertical axis the observing mode is noted. R1 was observed for a total of ${\sim}130$ hours, and R2 for ${\sim}$300 hours.[]{data-label="fig:obs"}](obs_r1 "fig:"){width="\columnwidth"}\ ![Overview of Apertif observations of R1 (top) and R2 (bottom). Blue diamonds indicate observations without detected bursts, red triangles indicate observation with detected bursts. Along the vertical axis the observing mode is noted. R1 was observed for a total of ${\sim}130$ hours, and R2 for ${\sim}$300 hours.[]{data-label="fig:obs"}](obs_r2 "fig:"){width="\columnwidth"} Reduction of R1 baseband data {#sec:sub:analysis_sc1} ----------------------------- The baseband data were coherently dedispersed using the typical R1 DM of $560.5{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ [@hss+19] and converted to filterbank using `digifil`. In this process, the time resolution was reduced from $1.28\,\mathrm{\mu s}$ to $51.2\,\mathrm{\mu s}$. This reduces the computation time while ensuring any burst of at least $51.2\,\mathrm{\mu s}$ in duration, less than the narrowest burst thus far reported, is still detectable. The filterbank data were then searched for any bursts with a DM between $520{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ and $600{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ in steps of $0.1{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ with `PRESTO` [@presto], using a threshold signal-to-noise (S/N) of 8. All candidates were visually inspected. The raw data of a 20 second window around each detected burst were saved for further analysis. Reduction of survey data {#sec:sub:analysis_sc4} ------------------------ For both survey modes, the data were analysed in real-time by our GPU pipeline, AMBER[^1] [@slb+16]. AMBER incoherently dedisperses the incoming Stokes I data to DMs between $0{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ and $3000{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ in steps of $0.2{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ below $820{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ and steps of $2.5{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ above $820{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$, and writes a list of candidates with $\mathrm{S/N}\ge8$ to disk. These candidates are automatically further analysed by the offline processing mode of the ARTS processing pipeline, DARC[^2]. First, the candidates are clustered in DM and time to identify bursts that were detected at multiple DMs or in multiple beams simultaneously. Of each cluster, only the candidate with the highest S/N is kept. For all remaining candidates, a short chunk of data (typically 2s) surrounding the candidate arrival time is extracted from the filterbank data on disk and dedispersed to the DM given by AMBER. These data are then given to a machine learning classifier [@cl18], which determines whether a candidate is most likely a radio transient or local interference. For all candidates with a probability greater than $50\%$ of being a real transient, inspection plots are generated and e-mailed to the astronomers. Because the pipeline was still in the commissioning phase, the data were also searched with a `PRESTO`-based pipeline as was done for the baseband data. For R1 we used the same DM range as for the baseband data. For R2, the DM range was set to $150 - 230 {{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$, covering a wide range around the source DM of ${\sim}189{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ [@R2CHIME19]. Both pipelines yielded identical results. R1 {#sec:121102} == In total, 30 bursts were detected from R1. Of those, 29 were found in targeted baseband mode observations between 12 and 22 November 2018. One burst was found during regular TAB survey observations in August 2019. An overview of the bursts is shown in Fig. \[fig:burst\_overview\]. ![image](allbursts){width="\textwidth"} Flux calibration ---------------- The S/N of all bursts identified by the pipelines is determined using a matched filter with boxcar widths between 1 and 50 samples ($0.3$ to $16.4\,$ms). The noise is determined in an area around the burst visually confirmed to be free of interference. We used the modified radiometer equation [@CM03; @MA14] to convert the obtained S/N to peak flux density. For an interferometer, the radiometer equation can be written as $$\label{eq:radiometer} S = \frac{\mathrm{S/N}\,T_\mathrm{sys}}{G N_\mathrm{dish}^{\,\beta} \sqrt{N_\mathrm{pol} \Delta\nu W}},$$ where $S$ is the peak flux density, $T_\mathrm{sys}$ is the system temperature, $G$ is the gain of a single dish, $N_\mathrm{dish}$ is the number of dishes used, $\beta$ is the coherence factor, $N_\mathrm{pol}$ is the number of polarisations, $\Delta\nu$ is the bandwidth, and $W$ is the observed pulse width. We cannot readily measure $T_\mathrm{sys}$ and $G$ independently, but we can measure the system-equivalent flux density ($\mathrm{SEFD} = T_\mathrm{sys}/G$) of each dish. In order to do this, we performed drift scans of calibrator sources 3C147 and 3C286. The flux densities of both sources were taken from @pb17. In TAB mode, we typically find an SEFD of $700\,\mathrm{Jy}$ for the central beam of each dish. In addition, $\beta$ was shown to be consistent with $1$ for the TAB mode and with $1/2$ for the IAB mode [@2018PhDT.......155S], as theoretically expected. These values were used to determine the sensitivity for each of the observations. Although no bursts were detected in IAB mode, we can still use the radiometer equation to set an upper limit to the peak flux density of any bursts during those observations. For each detected burst, the peak flux density was converted to fluence by multiplying with the observed pulse widths, where the pulse width is defined as the width of a top-hat pulse with the same peak and integrated flux density as the observed pulse. This method of calculating the fluence is valid as long as the bursts are resolved in time, which all detected bursts are. Additionally we recorded the interval between that burst and the previous burst, or limits on the interval in case the burst was the first or last of an observation. An overview of the burst parameters is given in Table \[tab:121102\_overview\]. [\7l]{} Burst & Arrival time & $\mathrm{DM_{S/N}}$ & $\mathrm{DM_{struct}}$ & Boxcar width & Fluence & Wait time\ & (barycentric MJD) & ${{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ & ${{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ & (ms) & (Jy ms) & (s)\ 1 & 58434.875313559 & 566.2 & 565(2) & 4.6 & 4.5(9) & ${>}638.51$\ 2 & 58434.889509584 & 565.8 & 567(1) & 4.6 & 4.3(9) & 1226.537\ 3 & 58434.894775566 & 567.6 & 569(2) & 2.3 & 3.9(8) & 454.980\ 4 & 58434.947599142 & 567.0 & 564(3) & 2.9 & 6(1) & 4563.957\ 5 & 58434.966276186 & 577.3 & 566(2) & 3.6 & 11(2) & 1613.701\ 6 & 58434.973174288 & 564.1 & 564(2) & 2.3 & 3.1(6) & 595.991\ 7 & 58435.990826444 & 567.0 & 563(1) & 7.5 & 18(4) & $1236.717$ – $87925.148$\ 8 & 58436.040343161 & 569.6 & 566(2) & 5.9 & 3.8(8) & 4278.245\ 9 & 58436.051467039 & 561.6 & 564(3) & 6.9 & 11(2) & 961.100\ 10 & 58436.054576797 & 568.0 & 569(2) & 4.3 & 6(1) & 268.683\ 11 & 58436.107672326 & 567.8 & 569(3) & 3.6 & 6(1) & $3231.773$ – $4587.543$\ 12 & 58436.110830017 & 567.6 & 565(3) & 2.9 & 8(2) & 272.825\ 13 & 58436.121982835 & 565.0 & 571(4) & 3.3 & 3.1(6) & 963.604\ 14 & 58436.123751681 & 565.6 & 565(4) & 4.9 & 10(2) & 152.828\ 15 & 58436.132117748 & 568.2 & 564(6) & 5.9 & 4.6(9) & 722.828\ 16 & 58436.192189901 & 563.8 & 569(2) & 1.6 & 3.9(8) & $2433.671$ – $5190.235$\ 17 & 58436.235117618 & 565.8 & 566(1) & 2.6 & 20(4) & 3708.959\ 18 & 58436.237531175 & 565.8 & 566(3) & 5.2 & 10(2) & 208.529\ 19 & 58436.242119138 & 565.2 & 568(2) & 4.9 & 11(2) & 396.399\ 20 & 58436.919260205 & 566.6 & 565(2) & 5.9 & 6(1) & $3149.344$ – $58504.989$\ 21 & 58436.964309370 & 567.8 & 564(2) & 2.3 & 3.4(7) & 3892.246\ 22 & 58436.991334107 & 566.6 & 566(2) & 2.9 & 10(2) & $1276.105$ – $2334.933$\ 23 & 58437.051643347 & 572.0 & 569(3) & 8.8 & 12(3) & 5210.724\ 24 & 58437.899455547 & 563.9 & 563(2) & 3.3 & 4.3(9) & $1433.866$ – $73250.973$\ 25 & 58437.924610245 & 567.2 & 569(4) & 8.5 & 9(2) & 2173.365\ 26 & 58437.993893047 & 561.2 & 565(3) & 4.9 & 12(2) & $1492.858$ – $5986.033$\ 27 & 58441.030569351 & 566.8 & 569(5) & 4.3 & 6(2) & $4649.438$ – $262368.833$\ 28 & 58450.903309478 & 566.2 & 565(3) & 2.3 & 3.9(8) & $821.270$ – $853004.746$\ 29 & 58450.974554110 & 564.6 & 569(2) & 2.6 & 3.7(7) & 6155.538\ 30 & 58714.255429157 & 564.6 & 569(1) & 3.3 & 3.9(8) & $1233.459$ – $22747467.604$\ Dispersion measure {#sub:dm} ------------------ The dispersion measure as determined by the pipelines ($\mathrm{DM_{S/N}}$) is optimised for S/N. This S/N value was used to determine the burst peak flux densities. The bursts, however, have complex frequency-time structure [@hss+19]. This is clearly visible in our sample as well, for example in bursts 18 and 19 (Fig. \[fig:burst\_overview\]). We thus also calculated a structure-optimised DM ($\mathrm{DM_{struct}}$) for each burst, which were determined using [dm\_phase]{}[^3]. While the S/N-optimised DM best captures the total energy output of the bursts, it is affected by the complex features that mimic dispersive effects. Though it is unclear whether these features are intrinsic or a propagation effect, their narrowband nature clearly distincts them from cold-plasma dispersion, which is described by a simple power law $\tau \propto \nu^{-2}$, where $\tau$ is the time delay at frequency $\nu$. As $\mathrm{DM_{S/N}}$ is based on the invalid assumption that the signal can be completely described by a $\nu^{-2}$ power law, while $\mathrm{DM_{struct}}$ is not, $\mathrm{DM_{struct}}$ is more likely to represent the actual dispersive effect. Assuming the overall DM remains constant for contemporaneous bursts, we averaged the $\mathrm{DM_{struct}}$ of the 29 bursts detected during the same period in November 2018. The data are not consistent with a single mean, but after visual inspection we concluded that the uncertainties given by [dm\_phase]{} are underestimated for our data, perhaps because many bursts have a relatively low S/N ($<$15). Therefore, we scaled the uncertainties such that the reduced $\chi^2$ of fitting a constant value is unity. The same scaling factor was then applied to burst 30, which was detected several months after the first 29 bursts. The average DM$_\mathrm{struct}$ of the first 29 bursts is $566.2(4){{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$. The average DM we found is higher than the previously reported value of DM$_\mathrm{struct} = 560.5{{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ [@hss+19]. We ran our pipeline on Apertif data of the Crab pulsar taken in November 2018 to verify the frequency labelling of our data. Several giant pulses were detected, all at the expected DM; We are thus confident the higher DM for this source is real. This increased DM of R1 as detected by Apertif is in line with an R1 burst detected by CHIME, with a DM of $563.6(5){{\ensuremath\mathrm{\,pc\,cm^{-3}}}}$ [@CHIMER1], and several bursts in Arecibo data (Seymour et al. in prep). These were all detected in the same week in November 2018 where most of the Apertif bursts were found. In Fig. \[fig:burst\_overview\], where we display the bursts after dedispersion at the old value, this increase is already apparent in the residual dispersion slope. As noted by @CHIMER1, the DM variation is likely to be local to the source, as such large changes are not seen in Galactic pulsars nor expected in the inter-galactic medium. However, it remains unclear whether these variations are stochastic or a secular trend [@hss+19; @CHIMER1]. To investigate this further, we compared the DM$_\mathrm{struct}$ at different epochs (Fig. \[fig:dm\]). We only considered observations at 1400MHz for this analysis, to avoid any frequency-dependent DM effects as predicted by e.g. the decelerating blast wave model [@metzger19]. We do note that the DM as observed by Apertif is indeed slightly higher than the DM of the burst detected by CHIME in the same week, which is consistent with the model presented by @metzger19. The data are consistent with a monotonically increasing DM of ${\sim} 2.7(2){{\ensuremath\mathrm{\,pc\,cm^{-3}}}}\,\mathrm{yr^{-1}}$. We note that even when fitting a straight line through the first two data points, the predicted DMs for the Apertif data points fall within 1$\sigma$ of the observed values. Hence the good fit is not the result of the relatively large error on the first data point. We suggest that the observed increase in DM is indeed a secular trend. The increasing DM, together with decreasing RM, show that R1 is in a highly magnetised, chaotic environment, where the RM and DM are unlikely to arise from the same region. The DM increase might be explained by a high-density filamentary structure moving into our line-of-sight, although several more complex models also predict changes in both DM and RM over time [e.g. @piro18; @metzger19]. However, the rate at which the DM is increasing remains hard to explain. The origin of the rapid DM increase will be an important aspect for future modelling efforts. ![Structure-optimised DM of R1 at 1400MHz as measured at different epochs. The two Arecibo data points are from @scholz16 and @hss+19, respectively. For Apertif, we averaged the DMs of the 29 bursts detected contemporaneously in November 2018, and show the 30th burst detect in August 2019 separately. The error bars indicate 1$\sigma$ uncertainties. A linear fit is shown in black, with a slope of $2.7(2){{\ensuremath\mathrm{\,pc\,cm^{-3}}}}\,\mathrm{yr^{-1}}$.[]{data-label="fig:dm"}](dm_change){width="\columnwidth"} Energy distribution {#sub:energy_dist} ------------------- From the burst parameters, the intrinsic energy can be calculated as $$E = 4\pi\,d_L^2\,f_\mathrm{b}\,F\,\Delta\nu,$$ were $E$ is the burst energy, $d_L$ is the luminosity distance [$972\,$Mpc, @Tendulkar-2017], $f_\mathrm{b}$ is the beaming fraction of the emission, $F$ is the fluence as observed on Earth, and $\Delta\nu$ is the intrinsic emission bandwidth. Following @law17, we assume isotropic emission, $f_\mathrm{b}=1$. To investigate the energy distribution of R1 bursts, we consider the cumulative distribution of the mean burst rate, defined as the number of detected bursts divided by the total observing time including* observations without any detected bursts, as function of energy. It is known that the bursts show clustering in time (see @orp18 and Sect. \[sub:rates\]). Therefore it is important to consider the time scales probed by each set of observations: Ten observations spread over a year may yield very different results from ten identical observations spread over one week. Our data are supplemented with the data presented in @law17 and @gourdji19, who have performed similar analyses. An overview of the data used is shown in Table \[tab:rates\_data\]. The resulting cumulative energy distributions are shown in Fig. \[fig:energy\_dist\]. The distribution of burst energies has previously been characterised by a power law, $R({>}E) \propto E^{\gamma}$, where $R$ is the burst rate above energy $E$, and $\gamma$ is the power-law slope. @law17 find a typical slope of $-0.7$ for VLA, GBT, and early Arecibo data. However, @gourdji19 find a significantly steeper slope of $-1.8(3)$ using Arecibo data only, and suggest several reasons why the slope may be different. In some cases, the calculated burst energy is a lower limit. Moving some bursts to a higher energy would flatten the distribution. Additionally, the energies probed by the data presented in @gourdji19 are lower than the others, where perhaps the slope is actually different or cannot be described by a power law at all. The slope is also strongly dependent on the chosen completeness threshold. Perhaps the different timescales probed by the different observations are also important. The 2016 Arecibo data used by @gourdji19 (Table \[tab:rates\_data\]) consist of two observations, one day apart, with detections of several bursts in each observation. This data set thus probes a relatively short timescale, which perhaps influences both the burst rate and energy distribution slope due to the clustered nature of the bursts. To estimate the power-law slope of the Apertif burst energy distribution, we used Eq. \[eq:radiometer\] to set a completeness threshold for WSRT, using the threshold S/N of 8 and a typical pulse width of $4\,$ms. The least sensitive observations were using 8 dishes in IAB mode. The corresponding energy threshold is $1.5\times10^{39}\,$erg. We then calculated the power-law slope using a maximum-likelihood estimator. If we include all data points, we find $\gamma=-1.3(3)$. When including only bursts above $1.5\times10^{39}\,$erg, the slope is $\gamma=-1.7(6)$. Although consistent with both $-0.7$ and $-1.8$ at the 2$\sigma$ level, the slope of the Apertif burst energy distribution favours the value found by @gourdji19. Although care must be taken in comparing slopes, this at least suggests that the probed energy range is not the reason for the steeper slope found in the 2016 Arecibo data that contain the lowest energy bursts, as with Apertif we are probing the highest burst energies at 1400MHz so far reported. The most luminous Apertif burst presented here has an isotropic energy of ${\sim}4.5\times10^{39}\,$erg. During early commissioning, we reported the potential detection of a bright burst from R1 [@atel121102]. Its estimated isotropic energy was $1.2\times10^{40}\,$erg. At that time, such bright bursts were not known to exist. The current energy distribution does, however, credibly allow for a burst this bright. Our slope $\gamma = -1.7(6)$ is the same as the power-law indices found for the giant pulses emitted by Crab pulsar at the same observing frequency of 1400MHz (Table \[tab:rates\_data\]). The steepness is basically unchanged at frequencies a decade lower: at 150MHz it is still $-$2.04(3) [@lkk+19]. The similarity between the brightness distribution fall-off seen in both FRBs and giant pulses suggests these could be related. The distribution steepness matches less convincingly with a neutron-star emission mode that has also been put forward as a source model for FRBs: the soft gamma-ray bursts from magnetars [see, e.g., @2019arXiv191006979W]. The brightness distribution seen in SGR 1900+14 bursts is less steep, following a $-$0.66(13) trend [@1999ApJ...526L..93G]. [\6l]{} Source & Telescope & Bursts & T$_\mathrm{obs}$ (hr) & Date span & Power-law index ($\gamma$)\ R1* & Arecibo$^{(1,3)}$ & 11 & 4.5 & 2012-11-02 – 2015-06-02 & $-$0.8$^{+0.3}_{-0.5}$\ & GBT$^{(2,3)}$ & 5 & 15.3 & 2015-11-13 – 2016-01-11 & $-$0.8$^{+0.4}_{-0.5}$\ & VLA$^{(3)}$ & 9 & 28.9 & 2016-08-23 – 2016-09-22 & $-$0.6$^{+0.2}_{-0.3}$\ & Arecibo$^{(4)}$ & 41 & 3.2 & 2016-09-13 – 2016-09-14 & $-$1.8(3)\ & WSRT$^{(5)}$ & 30 & 128.4 & 2018-11-12 – 2019-08-30 & $-$1.7(6)\ Crab pulsar giant pulses & WSRT$^{(6)}$ & 13,000 & 6 & 2005-12-10 & $-$1.79(1)\ &ATCA$^{(7)}$ & 700 & 3 & 2006-01-31 & $-$1.33(14)\ SGR 1900+14 bursts & BATSE+RXTE$^{(8)}$ & 1,000 & ${\sim}$50 & 1998-1999 & $-$0.66(13)\ ![Cumulative distribution of R1 burst energies detected with VLA (3000MHz), GBT (2000MHz), Arecibo (1400MHz), and Apertif (1400MHz). The data used are described in Table \[tab:rates\_data\]. Poissonian errors on the rates are shown for illustrative purposes. The typical power-law value for the early Arecibo, GBT, and VLA data is $-0.7$, while the later Arecibo data suggest a slope of $-1.8(3)$ above a completeness threshold of $2\times10^{37}\,$erg. The Apertif data suggest a slope of $-1.7(6)$ above the completeness threshold of $1.5\times10^{39}\,$erg, which is indicated by the vertical dashed line.[]{data-label="fig:energy_dist"}](rates){width="\columnwidth"} Burst repetition rate {#sub:rates} --------------------- If repeating FRB burst rates follow Poissonian statistics, the distribution of wait times would be an exponential distribution. However, it has been shown that R1 bursts are highly clustered, which is incompatible with Poissonian statistics [@orp18]. A generalisation of the exponential distribution that allows for clustering is the Weibull distribution, defined as $$\label{eq:wb} \mathcal{W}(\delta\|k,r) = \frac{k}{\delta} \, \left[\delta \, r\, \Gamma\left(1 + 1/k\right)\right]^k \, \mathrm{e}^{-\left[\delta \, r \, \Gamma\left(1 + 1/k\right)\right]^k},$$ where $\delta$ is the burst interval, $r$ is the mean burst rate, $\Gamma(x)$ is the gamma function, and $k$ is a shape parameter. $k=1$ is equivalent to Poissonian statistics, $k<1$ indicates a preference for short burst intervals, i.e. bursts are clustered in time, and $k\gg1$ indicates a constant burst rate $r$. In order to apply the Weibull formalism to the R1 bursts observed with Apertif (cf. Table \[tab:121102\_overview\]), we need to consider that subsequent observations may have correlated burst rates as some observations occurred in short succession. This requires small modifications to the equations presented by @orp18. We add a maximum burst interval to their equations to allow for correlated observations. A derivation of the modified equations is given in Appendix \[app:weibull\]. We assume a flat prior on both $k$ and $r$, only requiring that both are positive, and calculate the posterior as the product of the likelihoods of all Apertif observations. The posterior distribution is shown in Fig. \[fig:posterior\_r1\_wsrt\]. The best-fit parameters are $r=6.9^{+1.9}_{-1.5}\,\mathrm{day^{-1}}$ and $k=0.49^{+0.05}_{-0.05}$. Although @orp18 used data from different instruments with different sensitivity thresholds, they all have a lower sensitivity threshold than Apertif. Given the negative slope of the energy distribution (Fig. \[fig:energy\_dist\]), we had thus expected to find a lower rate with Apertif than the rate reported by @orp18. Given the uncertainties, the Apertif rate could still be lower, although we note that our best-fit rate and shape are consistent with that of @orp18 at the $2\sigma$ level. A Poissonian burst rate distribution ($k=1$) is excluded at high significance. This is not surprising, given that all bursts except one were detected within the first 30 observing hours out of a total of ${\sim}130$ hrs. The burst rate, however, is consistent with the Poissonian estimate of $5.6(1)\,\mathrm{day^{-1}}$, even though Poissonian statistics cannot explain the distribution of burst intervals. Thus, at the time scales probed by our data set, the clustering effect is not important in determining the average burst rate, but it does strongly influence the expected number of detected bursts for any single observation. ![Posterior distribution of R1 burst rate and shape parameters. A lower $k$ indicates a higher degree of clustering. The green and blue areas indicate the result from @orp18 and this work, respectively. The contours indicate 1, 2, and 3$\sigma$ limits on $r$ and $k$. The best-fit parameters are indicated by the cross and plus.[]{data-label="fig:posterior_r1_wsrt"}](posterior_wsrt){width="\columnwidth"} While the Weibull distribution does not fit previously observed R1 burst wait times very well, it is a significant improvement over Poissonian statistics [@orp18]. There are, however, other ways to describe the clustered behaviour R1 shows. For example, the burst rate might be described by several distinct Poisson processes: one (or more) with a high rate (the “active” state), and one (or more) with a low or zero rate (the “inactive” state). If the burst rate follows Poissonian statistics during an active period, i.e. there is only one burst rate during an active state, the wait time distribution is an exponential distribution. Samples of R1 wait times have indeed been shown to be consistent with exponential [@lin19], but also with log-normal [@gourdji19] and power-law [@lin19] distributions, where in some cases it is not possible to distinguish between these distributions. Considering our observations in November 2018, where 29 out of the 30 bursts were detected, as the active state, we looked at the observed wait times during that time frame. In total, 19 wait times were determined (cf. Table \[tab:121102\_overview\]). The resulting wait time distribution is shown in Fig. \[fig:wait\_times\]. The Apertif sample shows a bi-modal wait time distribution. There is a dearth of burst times between ${\sim}2300\,$s and ${\sim}3600\,$s. The sample of wait times below $2300\,$s does not fit an exponential distribution, but can be fit with a power-law with slope $-0.38(2)$. The sample above $3600\,$s can be fit by an exponential distribution, but the steep slope requires a Poissonian burst rate of ${>}25\,\mathrm{day^{-1}}$, which is incompatible with the observed rate. However, it can be fit equally well with a power-law with slope $-3.5(1)$. In Fig. \[fig:wait\_times\], the best-fit power law is shown for both samples. Care has to be taken when interpreting these results, as there is a maximum wait time that can be detected in our observations of typically 2 hrs in duration. The chance of not detecting a given wait time increases linearly with the wait time, and any wait time larger than the observation duration is of course not observable. However, this effect cannot explain the bi-modality nor change in power-law index as those are non-linear in wait-time. Our results indicate that during the active state in November 2018, the burst intervals did not follow a stationary Poisson process. This is incompatible with the wait time distribution of Crab giant pulses, which can be described by an exponential distribution [@L95]. However, a non-stationary Poisson process can result in a power-law wait time distribution at long wait times, which flattens towards shorter wait times. This is seen in for example X-ray solar flares [@aschwanden10; @wheatland00]. The power-law slope depends on the exact form of the burst rate as function of time, but is generally flatter if the burst rate varies rapidly [@aschwanden10]. In magnetar SGR 1900+14, the waiting time distribution between bursts follows a log-normal function, also indicative of a self-organized critical system [@1999ApJ...526L..93G]. ![Wait time distribution of R1 bursts as detected by Apertif. Error bars are 1$\sigma$ Poissonian uncertainties. The distribution is bi-modal. The lower part can be fit by a power-law with slope $-0.38(2)$, but does not fit an exponential distribution. The higher part can be fit by either an exponential distribution or a power law with slope $-3.5(1)$. For both parts, the power-law fit is shown.[]{data-label="fig:wait_times"}](wait_time){width="\columnwidth"} Polarisation properties {#sub:pol} ----------------------- Our baseband data came from only a single linear polarisation receptor, which makes it impossible to determine the total polarisation fraction. Even though the bursts from R1 are known to be highly linearly polarised, its high rotation measure [RM > $10^5{{\ensuremath\mathrm{\,rad\,m^{-2}}}}$; @msh+18] implies that the polarisation angle sweeps around multiple times even within one Apertif frequency channel, so we do not expect to miss any bursts because of misalignment of the polarisation angle between a burst and the receiver elements. However, we can only estimate the RM and degree of linear polarisation [@ramkumar99; @Maan15] if the depolarisation within a single channel is sufficiently small, which is clearly not the case at the native frequency resolution of Apertif. Following @msh+18, the intra-channel polarisation angle rotation ($\Delta\theta$) is given by $$\Delta\theta = \frac{RM \mathrm{c}^2 \Delta\nu}{\nu^3},$$ where $c$ is the speed of light, $\Delta \nu$ is the channel width and $\nu$ is the observing frequency. Evidently, $\Delta\theta$ is higher at lower frequencies, hence a much higher frequency resolution is required at 1400MHz than at 4500MHz. @msh+18 find an intra-channel rotation of $~9\degr$, for a depolarisation fraction of $1.6\%$ for their data. At native frequency resolution, the Apertif data would be over $90\%$ depolarised. Therefore, we reprocessed the baseband data around the bursts and increased the number of channels to 4096 over a bandwidth of $200\,$MHz, implying a frequency resolution of ${\sim}49\,$kHz. This decreased the time resolution to $20.48\,\mathrm{\mu s}$, which is still sufficient to resolve the bursts. The resulting depolarisation fraction is $3\%$ for an RM of $10^5{{\ensuremath\mathrm{\,rad\,m^{-2}}}}$. Following the procedure of @Maan15, we performed a discrete Fourier transform on the intensity spectra in the $\lambda^2$-domain, at each of the time samples in the bursts to obtain corresponding Faraday spectra. The Faraday spectrum represents linearly polarised power as a function of RM if there is only one RM component, which is the case [@msh+18]. We did not find any significant linearly polarised power in the RM range $10^4 - 3.4{\times}10^5{{\ensuremath\mathrm{\,rad\,m^{-2}}}}$. However, due to the low S/N of individual samples within the bursts, we were sensitive to only a reasonably high degree of linear polarisation (50% for the brightest burst, but $>$95% for the other bursts). The R1 bursts are known to exhibit a constant polarisation position angle (PA) over the full burst duration [@msh+18]. To probe linearly polarised emission with higher sensitivity, we used the intensity spectra averaged over the entire burst widths which is valid if the PA is constant. We again did not detect any significant linearly polarised emission. At a 5$\sigma$ level detection threshold, our upper limits on the linearly polarised fractions for the 3 brightest bursts in our sample, burst numbers 17, 7 and 5 in Fig. \[fig:burst\_overview\], are 8%, 14% and 16%, respectively. At 4500MHz, the linear polarisation fraction was measured to be close to 100% [@msh+18]. Hence there must be some additional intrinsic or extrinsic depolarisation at 1400MHz to explain our non-detection. R2 {#sec:r2} == Despite several hundred hours of observations with equivalent or better sensitivity than reported in @R2CHIME19, no bursts from R2 were detected by Apertif. This is in contrast to the six bursts detected by CHIME in 23 hrs of R2 transits. Due to difficulty in measuring their time-dependent sensitivity, @R2CHIME19 calculate R2’s repetition rate with three bursts above their fluence completeness threshold of 13Jyms, found in a total of 14 hrs of exposure. The least sensitive observations in our data set were performed with ten dishes in IAB mode, resulting in a fluence completeness threshold of $8.5 \sqrt{\frac{W}{10 \mathrm{\, ms}}}\,\mathrm{Jy\,ms}$, where $W$ is the pulse width. Most observations were more sensitive, meaning the limits we place on our non-detection are conservative. Our ${\sim}$300 hrs of exposure corresponds to several years worth of CHIME transits, and yet Apertif detected no R2 bursts. We offer two possible explanations, which are addressed independently. Temporal clustering ------------------- R2 shows some striking similarities to R1. Beyond repetition, R2 also has distinct time/spectral structure, with a march-down in frequency of adjacent sub-pulses. It may also exhibit non-Poissonian, or clustered, repetition. As has been previously noted, temporal clustering of bursts can drastically increase the probability of zero events being discovered in a given observation, even if the average repetition rate is high [@connor-2016b; @orp18]. Therefore, it is possible that the reason Apertif did not detect R2 is that it is highly clustered. The posterior for the burst rate $r$ and shape parameter $k$ of a Weibull distribution is shown in Fig. \[fig:posterior\_r2\], where small $k$ corresponds to high clustering. The burst rate as observed by CHIME [>2.16 per day above 13 Jy ms @R2CHIME19] is indicated by the shaded yellow region. If we assume the same rate, $r$, of detectable pulses at CHIME and Apertif (i.e. a flat spectral index in repetition rate), then within the Weibull framework, we can constrain the shape parameter, $k$, to be no greater than 0.12 at $3\sigma$. In other words, if R2’s behaviour at 1400MHz and 600MHz are comparable, then the source’s repetition has to be highly clustered, more so even than R1, for us not to detect any repeat bursts in ${\sim}300$ hrs of exposure. There are reasons to be sceptical of clustering as the sole explanation for our non-detection. For instance, if R2’s repetition statistics were well-described by a Weibull distribution, then the values of $k$ allowed by our non-detection imply that CHIME should have seen many bursts in a single transit, because the temporal clustering would be so significant. From a simple Monte Carlo simulation, we find that with $k\lesssim0.3$, half or more transits in which the FRB is seen to repeat should contain more than one repeat burst. Since CHIME saw its six repeat bursts in six distinct transits, $k$ is either not that small, or clustering only happens on longer time scales. Under our assumptions, the upper-bound on clustering set by our non-detection is inconsistent with the lower-bound on R2’s clustering set by CHIME’s observations. We also emphasise here that the Weibull distribution was chosen as a useful generalisation of the Poisson distribution, in order to account for the observed temporal clustering of R1. However, such clustering may not hold on all time scales, and FRB repetition wait times may not easily be described by a simple continuous distribution. Some FRBs may turn off entirely for extended periods, similar to X-ray binaries in quiescence, and then start back up with Poissonian repetition. Indeed, another explanation for our non-detection of R2 is that the source has turned off, either permanently or for a long, extended period. This will either be corroborated or falsified by CHIME’s daily observing of R2 over the past year. Frequency dependence -------------------- If R2 is not significantly clustered, and the bursts follow Poissonian statistics ($k=1$), we set a $3\sigma$ upper limit to the burst rate at 1400MHz of $r<0.12$ per day above a fluence of $8.5\,$Jy ms. This limit is clearly inconsistent with the CHIME rate of $>$2.16 per day above 13Jyms. This indicates the source may be significantly less bright at 1400MHz than at 600MHz. Under the simplified assumption that R2’s pulses were always the same brightness at a given frequency, and were given by a power law across frequency such that $F(\nu)\propto \nu^{-\alpha}$, then $\alpha$ must be greater than 3.6 at the 3$\sigma$ level. However, it has become increasingly clear that bursts from repeating FRBs are given by bottom-heavy distributions, with many more dim events than bright ones [@gourdji19; @CHIME19c]. The combination of frequency-dependence in the brightness of the source, as well as a power-law brightness distribution of repeat bursts (i.e. $F(\nu)\propto \nu^{-\alpha}$ and $N(>F)\propto F^{-\gamma}$), results in strong frequency-dependence in the detection rate. As we show in Appendix B, the frequency-dependent detection rate scales as $N(\nu) \propto \nu^{-\alpha\gamma}$, not as $N(\nu) \propto \nu^{-\alpha}$. In other words, if a source has a red spectrum ($\alpha>0$) and a steep brightness function, then it will be difficult to detect at high frequencies. The analysis holds even if individual bursts from repeaters do not have power-law frequency spectra, so long as their average brightness as a function of frequency is a power law. This new effect may explain our non-detection of R2 at Apertif: From the S/N listed in @R2CHIME19, $\gamma$$\approx$$2.2\pm1.3$, so even a moderate red frequency spectrum could result in considerably lower detection rates at 1400MHz vs 600MHz. ![Posterior distribution of R2 burst rate and shape parameters. The contours indicate 1, 2, and 3$\sigma$ upper limits on $r$ and $k$. A lower $k$ indicates a higher degree of clustering. The yellow region indicates the CHIME rate with Poissonian error bars. The red region is the CHIME rate modified by a spectral index of -3.6, where the CHIME lower limit on the rate matches the Apertif upper limit at $k=1$, i.e. under the assumption of Poissonian statistics.[]{data-label="fig:posterior_r2"}](posterior_r2){width="\columnwidth"} Conclusions {#sec:conclusion} =========== We have detected 30 bursts from R1 with Apertif. Their structure-optimised DM is higher than previously reported, consistent with an overall increase of ${\sim}2.7(2){{\ensuremath\mathrm{\,pc\,cm^{-3}}}}\,\mathrm{yr^{-1}}$. The isotropic energy distribution of the bursts as determined by several instruments cannot be described by a single power law over the three decades of burst energies. The power-law slope as detected by Apertif, $\gamma = -1.7(6)$, is consistent with that of the Crab pulsar giant pulses. Less convincingly it matches the bursts from magnetar SGR1900+14. The repetition rate of the bursts matches with earlier found values, and confirms their highly clustered nature. Even when considering only the observations during an active period of the source, the burst arrival times are inconsistent with a stationary Poisson process and hence inconsistent with the wait time distribution of Crab giant pulses. However, the wait-time distribution can be described by a double power law, similar to solar flares. We place stringent upper limits on the linear polarisation fractions of some of the brightest bursts in our sample. For the brightest burst, the upper limit is $8\%$, assuming a constant polarisation angle across the burst. These limits suggest that there is an additional depolarising effect at 1400MHz that is not present at 4500MHz. No bursts from R2 were detected. This might be because it has turned of either completely or for an extended period of time. If it has not turned off, the non-detection requires a high degree of clustering within the Weibull framework, assuming a flat spectral index. This is inconsistent with CHIME not having detected several bursts during one transit of R2. Alternatively, R2 may not emit in the Apertif band, or its emission may be intrinsically fainter. We find it unlikely that R2’s statistical frequency spectrum can be described by a power-law. If it can, the spectral index has to be at least $\alpha>3.6$ to explain the Apertif non-detection. This work makes use of data from the Apertif system installed at the Westerbork Synthesis Radio Telescope owned by ASTRON. ASTRON, the Netherlands Institute for Radio Astronomy, is an institute of NWO. Burst wait time formalism {#app:weibull} ========================= We describe the FRB wait time distribution by a Weibull distribution, following @orp18. The Weibull distribution is described by two parameters: the burst rate $r$ and clustering parameter $k$. $k=1$ is equivalent to Poissonian statistics, while a value much smaller or great indicate clustering in time and a constant burst rate, respectively. We incorporate that subsequent observations can be correlated. Here we derive the modifications to the equations presented by @orp18. The probability of measuring some set of burst arrival times $t_\mathrm{1}, t_\mathrm{2}, \dots t_\mathrm{N}$ in a single observation of duration $T$ can be split into three parts: 1. The probability of the interval between the start of the observation and the first burst: $P(t_1)$ 2. The probabilities of the intervals between subsequent bursts in a single observation: $P(t_2 \dots t_\mathrm{N}) = \prod_\mathrm{i=1}^\mathrm{N-1} P(t_\mathrm{i+1} - t_\mathrm{i})$ 3. The probability of the interval between the last burst and the end of the observation: $P(T - t_\mathrm{N})$ Assuming different observations are not correlated, points 1) and 3) describe minimum burst intervals. To include that subsequent observations can be correlated, we include a maximum burst interval, which is simply the interval between the last burst of an observation and the arrival time of next observed burst. Only for the intervals before the first detected burst and after the last burst, there is no constraint on the maximum burst interval. The addition of a maximum burst interval ($\delta_\mathrm{max}$) leads to several minor changes in the probability density functions of @orp18. The probability density distribution of the interval between the start of the observation and the first burst [Eq. 13 of @orp18] is given by $$\label{eq:wb_pdf_start} \begin{aligned} &\mathcal{P}(t_1,\delta_\mathrm{max}\|k,r) = r \, \int_{t_1}^{\delta_\mathrm{max}} \mathcal{W}(\delta\|k,r) \, \mathrm{d}\delta \\ &= r \, \left[\mathrm{CCDF}(t_1\|k,r) - \mathrm{CCDF}(\delta_\mathrm{max}\|k,r)\right], \end{aligned}$$ where $\delta$ is the interval between the last unobserved burst and the first observed burst, and CCDF is the cumulative complementary distribution function, defined as $$\label{eq:wb_ccdf} \mathrm{CCDF}(\delta\|k,r) = \int_\delta^\infty \mathcal{W}(\delta^\prime\|k,r) \, \mathrm{d}\delta^\prime = \mathrm{e}^{-\left[\delta \, r \, \Gamma(1+1/k)\right]^k}.$$ The probability density of the intervals between subsequent bursts in a single observation is unchanged by our addition of correlated observations, and simply given by a product of Weibull distributions for the given intervals, $$\label{wb_pdf_intervals} \mathcal{P}(t_1\|k,r) = \prod_\mathrm{i=1}^\mathrm{N-1} \mathcal{W}(t_{\mathrm{i}+1} - t_\mathrm{i}).$$ The probability density of the interval between the last burst and the end of the observation is changed in a similar way as Eq. \[eq:wb\_pdf\_start\] and given by $$\label{eq:wb_pdf_end} \begin{aligned} &\mathcal{P}(T-t_\mathrm{N},\delta_\mathrm{max}\|k,r) = \int_{T-t_\mathrm{N}}^{\delta_\mathrm{max}} \mathcal{W}(\delta\|k,r) \, \mathrm{d}\delta\\ &= \mathrm{CCDF}(T-t_\mathrm{N}\|k,r) - \mathrm{CCDF}(\delta_\mathrm{max}\|k,r). \end{aligned}$$ Lastly, we need to consider an observation without any detected bursts [Eq. 17 of @orp18]. The probability density distribution of such an observation is given by $$\label{eq:wb_pdf_0} \begin{aligned} &P(N=0,\delta_\mathrm{max}\|k,r) = r \int_T^{\delta_\mathrm{max}} \mathrm{CCDF}(t_1\|k,r) \, \mathrm{d}t_1 \\ &= \frac{\Gamma_\mathrm{i}{\left(1/k, \left(T\,r\,\Gamma(1+1/k)\right)^k\right)}}{k\,\Gamma{\left(1+1/k\right)}} \, - \, \\ &\frac{\Gamma_\mathrm{i}{\left(1/k, \left(\delta_\mathrm{max}\,r\,\Gamma(1+1/k)\right)^k\right)}}{k\,\Gamma{\left(1+1/k\right)}}, \end{aligned}$$ where $\Gamma_i(x, z)$ is the upper incomplete gamma function. Note that in the limit $\delta_\mathrm{max} \rightarrow \infty$, all modified equations return to their equivalent versions for non-correlated observations. Frequency-dependent detection rate ================================== Suppose an FRB emits broad-band bursts with a power-law in frequency, given by $L(\nu)\propto \left(\frac{\nu}{\nu_0}\right)^{-\alpha}$. If we assume the differential luminosity function of an individual repeater is given by a power-law $N(L)\propto L^{-(1+\gamma)}$, then the number of events above some minimum detectable luminosity is $$N(>\!L_{\mathrm{min}}) \propto \int\displaylimits_{L_{\mathrm{min}}}^{\infty} N(L)\,dL,$$ where $L_\mathrm{min}$ is determined by the detection instrument’s brightness threshold and the source’s distance scale, such that $L_{\mathrm{min}}=4\pi d^2 S_{\mathrm{min}}$. If we then include the fact that the source is $\left(\frac{\nu}{\nu_0}\right)^{-\alpha}$ times brighter at frequency $\nu$ than at $\nu_0$, we find that $L_{\mathrm{min}}$ is decreased by that same factor, so $$N(>\!L_{\mathrm{min}}, \nu) \propto \int\displaylimits_{L_{\mathrm{min}}(\nu)}^{\infty} L^{-(1+\gamma)}\,dL.$$ For $\gamma>0$, $$N(>\!L_{\mathrm{min}}, \nu) \propto \left [ \left(\frac{\nu}{\nu_0}\right)^\alpha L_{\mathrm{min}} \right ]^{-\gamma},\, $$ and we find a strong relationship between observed repeat rate, $N(>\!L_{\mathrm{min}}, \nu)$, the source’s spectral index $\alpha$, and its luminosity function index $\gamma$, such that $$N(>\!L_{\mathrm{min}}, \nu) \propto \nu^{-\gamma\alpha}.$$ This is striking, because it means that if a repeating FRB’s brightness distribution deviates from $\gamma\approx1$, the source’s detectability across frequency is significantly different from its brightness across frequency. As an example, if R2 has $\gamma=2$, similar to the Crab, and $L(\nu)\propto \left(\frac{\nu}{\nu_0}\right)^{-2}$, there will be almost 30 times fewer detectable bursts in the middle of the Apertif band vs. the middle of the CHIME band, assuming $S_{\mathrm{min}}$ is the same at both telescopes. [^1]: <https://github.com/AA-ALERT/AMBER> [^2]: <https://github.com/loostrum/darc> [^3]: <https://github.com/danielemichilli/DM_phase>	{ "pile_set_name": "ArXiv" }
Q: How do I set an SSL certificate for Resque on Heroku? I'm trying to debug a failed job on a production environment version of Resque because this is all the web interface gives me to work with: Worker: 9c9fe9d3-8ee0-43fe-afcd-c6806fc75f0d:2 on sentiment_pull at just now Class: SentimentJob Arguments: [16, 17, 18]13 Exception: OpenSSL::SSL::SSLError Error: SSL_connect returned=1 errno=0 state=SSLv3 read server certificate B: certificate verify failed This works in development and I'm not sure why I'd get an OpenSSL error on Heroku. I am also using Omniauth so in that initializer I have already set: Rails.application.config.middleware.use OmniAuth::Builder do provider #... :client_options => {:ssl => {:ca_path => "/etc/ssl/certs"}} end I haven't found any examples of Resque requiring an SSL certificate on Heroku so I'm a bit stumped because the job is set to do requests on an HTTPS URL. A: I've recently had this problem and despite there being plenty of answers out there on how to fix it, this was the only one that worked for me (I'm not on Heroku but instead a Debian VPS). This is a bad idea most of the time but is fine for my usage case where I need to accept self-signed SSL records. OpenSSL::SSL::VERIFY_PEER = OpenSSL::SSL::VERIFY_NONE This will cause OpenSSL to not verify SSL records and will suppress the error.	{ "pile_set_name": "StackExchange" }
	{ "pile_set_name": "FreeLaw" }
Benefit-cost analysis of antimicrobial prophylaxis in abdominal and vaginal hysterectomy. We performed a benefit-cost analysis of antimicrobial prophylaxis for hysterectomy using data from a randomized, placebo-controlled clinical trial of the efficacy of three doses of cefazolin sodium. The excess cost per patient with either operative site or urinary tract infection, or febrile morbidity diagnosed during hospitalization, was +1,777 for vaginal and +716 for abdominal hysterectomy. In patients undergoing vaginal hysterectomy, prophylactic cefazolin reduced in-hospital infectious morbidity from 52% to 23% (preventive fraction, 56%), resulting in an average net benefit of +492 per patient. In abdominal hysterectomy, cefazolin decreased in-hospital morbidity from 43% to 25% (preventive fraction, 42%), resulting in an average net savings of +102 per patient. These benefits would be eroded by use of newer, more expensive cephalosporins unless they were considerably more effective than cefazolin. The benefits also would be diminished by inappropriate prolongation of the duration of prophylaxis.	{ "pile_set_name": "PubMed Abstracts" }
*Erratum* *in:* "Light-Induced Thickening of Photoreceptor Outer Segment Layer Detected by Ultra-High Resolution OCT Imaging" by Yichao Li, Robert N. Fariss, Jennifer W. Qian, Ethan D. Cohen, and Haohua Qian (Invest Ophthalmol Vis Sci. 2016;57:OCT105-OCT111) doi:[10.1167/iovs.15-18539](http://dx.doi.org/10.1167/iovs.15-18539) The following wording has been added to the Acknowledgments in the article online: "The mention of commercial products, their sources, or their use in connection with material reported herein is not to be construed as either an actual or implied endorsement of such products by the Department of Health and Human Services." Citation: Li Y, Fariss RN, Qian JW, Cohen ED, Qian H. Erratum in: Light-induced thickening of photoreceptor outer segment layer detected by ultra-high resolution OCT imaging. Invest Ophthalmol Vis Sci. 2016;57:4016. doi:[10.1167/iovs.15-18539](http://dx.doi.org/10.1167/iovs.15-18539)	{ "pile_set_name": "PubMed Central" }
United States Court of Appeals FOR THE EIGHTH CIRCUIT ___________ No. 06-4012 ___________ Lanna J. Meyers, * * Appellant, * * v. * Appeal from the United States * District Court for the Western Hartford Life and Accident * District of Arkansas. Insurance Company, * * Appellee. * ___________ Submitted: June 14, 2007 Filed: July 6, 2007 ___________ Before LOKEN, Chief Judge, and ARNOLD and COLLOTON, Circuit Judges. ___________ ARNOLD, Circuit Judge. Lanna Meyers appeals from the order of the district court1 denying her disability claim under ERISA against Hartford Life and Accident Insurance Company. See 29 U.S.C. §§ 1001-1461. The district court, after a trial on a stipulated record, concluded that the applicable insurance policy gave Hartford the discretion to determine a claimant's eligibility for benefits (a conclusion not challenged here), and 1 The Honorable Robert T. Dawson, United States District Judge for the Western District of Arkansas. held that Hartford had not abused its discretion in rejecting Ms. Meyers's claim. We affirm. Ms. Meyers was employed by Wal-Mart Stores, Inc., for a number of years in a position that the parties agree is properly classified as sedentary. She quit in 2004 and soon thereafter claimed that she was totally disabled within the meaning of her benefits plan, which, as relevant here, requires her to show that she was unable to do the job that she was doing when she quit. Ms. Meyers has suffered from numerous ailments over the years. Her attending physician, Dr. James Baker, diagnosed her as suffering primarily from Churg-Strauss syndrome, interstitial lung disease, and peripheral neuropathy, with secondary diagnoses (among others) of ocular migraines and lumbar degenerative disc disease. He noted her secondary symptoms as chronic back pain, chronic diarrhea, bladder and bowel incontinence, drop foot, and paresthesia. It was his opinion that Ms. Meyers was unable to stand for more than 10 minutes, sit more than 15 minutes (due to pain and paresthesia), carry more than 20 pounds (due to pain and weakness), or walk without a cane and then no more than 15 minutes. When Hartford asked Dr. Baker why he had put severe sitting limitations on Ms. Meyers but had put no driving limitations on her, he explained that while driving she would simply have to stop and rest at appropriate intervals. When Hartford asked Dr. Baker whether Ms. Meyers could engage in a sedentary occupation, he said that she could not, stating that "patient has other issues with urine and bowel incontinence problems." In a clinic note, Dr. Baker wrote that "Ms. Meyers has become progressively more disabled due to her back pain, intractable diarrhea, as well as her intractable infections which seem to be recurrent." Ms. Meyers was also seen by Dr. Steven Moon, a neurologist, who performed an MRI that revealed a multilevel degenerative disc disease. He opined that from a strictly objective neurological viewpoint Ms. Meyers could sit for two hours at a time -2- and was able to perform sedentary work. Dr. Regan Gallaher, a neurosurgeon, reviewed the MRI and said that it did not provide a good explanation for Ms. Meyers's symptoms. Because of the conflict between the opinions of Dr. Baker and Dr. Moon with respect to whether Ms. Meyers could perform sedentary work, Hartford engaged the services of an independent physician, Dr. Todd Lyon, to assist in the determination of whether Ms. Meyers was disabled. Dr. Lyon reviewed Ms. Meyers's medical records and spoke with Dr. Baker on the telephone. According to Dr. Lyon, Dr. Baker told him that from an objective medical viewpoint there was no evidence that Ms. Meyers was not capable of working at her former job and that "she physically retained the capacity for full time sedentary to light demand work." He did say, however, that he "did not know if Ms. Meyers could tolerate working based solely upon her continual back pain complaints." He did not mention any other condition that would render Ms. Meyers disabled. Dr. Lyon produced an extensive report that concluded that Ms. Meyers's main subjective complaint was her chronic back pain. (Her Churg-Strauss syndrome, he said, was "not producing symptomology sufficient enough to impair non-physically demanding work.") He noted that she had complained of back pain for upwards of two years before she quit work and that there was no objective medical evidence to confirm her symptoms. He observed, moreover, that it was "highly unlikely that the degenerative disc disease fully explains Ms. Meyers's low back complaints." He also opined that "she would not have the ability for unrestricted standing and walking, nor would she have the ability for repetitive stooping, bending or heavy lifting." He nevertheless concluded that "Lanna Meyers retains the capacity for full-time sedentary to light demand work." Dr. Lyon sent a copy of his report to Dr. Baker, inviting him to make additions or corrections if he thought them necessary and noting that if he did not respond, "I will assume that you essentially agree with my understanding of our conversation." There is no response from Dr. Baker in the record. A few days later, -3- Hartford denied Ms. Meyers's claim on the ground that she was capable of performing her former job. Ms. Meyers then indicated that she wanted to appeal that decision. In connection with the appeal, Hartford engaged the services of yet another independent physician, Dr. Jerome Siegel; he examined Ms. Meyers's medical records and spoke with Dr. Baker several times and at length by telephone. Dr. Siegel observed that Ms. Meyers had been treated with increasing doses of narcotics, including a Duragesic patch, Neurontin, and Zanaflex, but nevertheless believed that she was "physically capable of performing sedentary to light physical demand activities," a conclusion in which Dr. Baker concurred. Hartford thereupon denied the appeal. Ms. Meyers maintained in the district court and on appeal that the combined effect of her multiple medical difficulties rendered her totally disabled. But there is little evidence in the record that Ms. Meyers suffers from any potentially disabling condition aside from the pain that she experiences. There is indeed a good deal of evidence that she has or has had a number of painful conditions, including low back pain, myalgia, and arthralgia; but there is no evidence that the medicine that she takes is not effective in relieving the pain. Drs. Lyon and Siegel, moreover, both noted that Ms. Meyers had complained about pain for quite some time before she quit and had nevertheless been able to work, an assessment with which Dr. Baker agreed. At least four physicians, moreover, concluded that there is no objective evidence supporting Ms. Meyers's subjective complaints of back pain. We observe, in addition, that there is no personal statement in the record from Ms. Meyers about the extent of her pain or when, how often, and how long she experiences it. Though her brief asserts that "on any given typical day" she "wakes up to a life riddled with constant pain and discomfort," there is no record evidence that this is true. Indeed, as we have already said, her own attending physician, Dr. Baker, asserted only that he "did not know if Ms. Meyers would tolerate working and this was based solely upon her continued low back pain." -4- We review de novo the district court's decision that Hartford did not abuse its discretion in denying Ms. Meyers's claim. Maune v. International Bhd. of Elec. Workers, 83 F.3d 959, 962 (8th Cir. 1996). In the present circumstances we would be hard-pressed to conclude that Hartford abused its discretion. An abuse of discretion occurs when a decision may properly be called extremely unreasonable, extraordinarily imprudent, or arbitrary and capricious. Shell v. Amalgamated Cotton Garment, 43 F.3d 364, 366 (8th Cir. 1994). Here there was considerable medical evidence to support Hartford's action, especially when one considers the highly equivocal nature of Dr. Baker's opinion about whether Ms. Meyers's pain would prevent her from performing the duties of her previous job and his evident conclusion in his conversation with Dr. Lyon that pain was her only potentially disabling condition. We therefore affirm the judgment of the district court. ______________________________ -5-	{ "pile_set_name": "FreeLaw" }
Show us what you got! Track Information Peacocks Hey MX is a practice track based in the midlands.. located in Tunstall, Stoke-on-Trent, easy access from the M6 and A500. Holding a ACU Track Certificate. The track is clay wood chip mix, 1.6km long and between 5m and 10m width. Fast flowing with tabletops and drop offs. Used as a practice and race track, on site we have toilets, catering and trained first aid staff. Auto's Quads and Sidecars are welcome on practice days. Peacocks also has a small track ideal for beginners & young children from the age of 3years and up. For more information on practice days and prices click here Peacocks Hey is available for private and race hire, please contact us for more details. white for sale transit swb 2008 (85) 150000 crew cab 7 seater (need body work cleaning up) in side the van is in very good and all seat are clean as been cover with seat covers we only selling as just bought other van still been used daily it mot till December 4th 2018 it a crew cab with 7 seat it will come with another white side door we bought it got in it glass so the new buyer can install or you could sell it it cost us Â£300 just for this door van is rusty and need the body work clean and repairing dents it a cheap van need a good clean inside and out just had 4 month ago clutch and 2 lower arms /new discs front brakes and pads and rack ends/2 new tyre it got tow bar but no ball on and heavy duty leaf springs so could carry motor bike or heavy equipment 2 keys there are a few dent on the van could be repaired sign write removed might need t-cuting it need a NEW EGR VALVE NEED CHANGING COST Â£80 it does not effect its running it only uses slit more fuel it best cash price and no dreamer or no exchanges or delivery it pick up only stoke on trent cash payment or bank draft it will only be released when payment clear Â£2300	{ "pile_set_name": "Pile-CC" }
Bisphenol A, or BPA, is used to line food cans and also to make strong plastic baby bottles. Eating large amounts of canned food – particularly canned soups or drinking hot liquids from baby bottles – can result in elevated amounts of BPA being detected in people’s urine. BPA acts as an estrogen mimic – albeit a very weak one – and some research has suggested a link between large doses of BPA and an increase of blood pressure. While this does sound worrying, remember that the dose is extremely important and that the molecules of BPA that do leech into food are too few to have any measurable effect. The United States Food and Drug Administration (the FDA) conducted a four-year review of over 300 scientific studies and concluded that the traces of BPA that do migrate into canned food are so tiny that they have no effect on human health. The decision to abandon the use of BPA in baby bottles was therefore based on public pressure not based on safety or on scientific evidence.	{ "pile_set_name": "Pile-CC" }
Q: preposition choice: on; close the gap on "Wal-Mart says it wants to double its stores in China by the end of 2006 to close the gap on its rival Carrefour. -CNN I'm unsure if the preposition 'on' was properly used in the line quoted above. Shouldn't it be something like 'close the gap between it and its rival'? A: To "close the gap on something" is a valid phrase, when only the object ("something", usually a [proper] noun) is specified. He wants to close the gap on the competition If you use 'between' then you need to reiterate the subject as well as specifying the object He wants to close the gap between himself and the competition Using 'with' sounds a bit odd: He wants to close the gap with the compeition	{ "pile_set_name": "StackExchange" }
Q: Smoothing splines with a boundary constraint Is there a way to set a boundary constraint when one uses smoothing splines? For example, I usually fit the data with the following code using the R package mgcv : library(mgcv) x <- runif(100, 1, 9) y <- sin((x^2)/10)+rnorm(100) plot(gam(y~s(x))) Suppose I would like to set a boundary constraint at the two points of x at 0 and 10 so that y = 0 when x = 0, 10. Notice that the two end points are outside the range [1, 9] of x. Is this achievable with mgcv? A: As pointed in the comments, the pc argument of the s() function included in the mgcv package does not allow for multiple constraint points. This is unfortunate but I think should not be too complicated to achieve the objective outside the realm of the specific package. Intro I think we can obtain the result we wish using two strategy: approximate the conditions (we will not get exactly $y = 0$ at $x = [0, 10]$) exact constraints The first strategy has the advantage to allow for easy inference and can also be easily translate in Bayesian settings if one wish so (and might also be possible to achieve within mgcv but I am not a super expert of the package). However I will not go so much into the details but I will point to some reference. I will discuss both solutions using P-splines smoothing as introduced by Eilers and Marx, 1991 (option bs = ps in s() function). P-splines combine B-spline bases and finite difference penalties (you can read more about this here and here...please give a look at the extrapolation properties of the P-splines because it is relevant in your case). In what follows I will indicate with $B$ a matrix of B-spline bases, with $P$ a finite difference penalty matrix and with $\lambda$ the smoothing parameter (I will keep it fixed for convenience in the codes). Strategy 1 - extra penalty This 'trick' consists in adding an extra penalty term to the penalized problem. The penalized least squares problem becomes then $$ \min_{c} S_{p} = \\|y - B c\\|^{2} + \lambda c^{\top} P c + \kappa (\Gamma c - v(x_{0}))^{\top} (\Gamma c - v(x_{0})) $$ where $\Gamma$ is the B-spline functions evaluated at the boundary points, $\kappa$ is a large constant (say $10^8$) and $v(x_{0})$ are the boundary abscissa (n your case a vector of zero of dim 2). Strategy 2 - Lagrange multipliers The previous strategy gives only a sort of 'soft' approximations. We can obtain an exact match using Lagrange multipliers (a reference in this context is here). In this case the penalized least squares problem is slightly different: $$ \min_{c} S_{l} = \\|y - B c\\|^{2} + \lambda c^{\top} P c + \gamma^{\top} (\Gamma c - v(x_{0})) $$ where $\gamma$ is a vector of Lagrange multipliers to be estimated. A small R code I will now use both strategies to smooth your data. I hope the code is clear enough (anyway I left some comments to guide you). The code supposes that you have a function to compute the B-splines $B$ (see for example Eilers and Marx, 2010). rm(list =ls()); graphics.off() # Simulate some data set.seed(2020) xmin = 1 xmax = 9 m = 200 x = seq(xmin, xmax, length = m) ys = sin((x^2)/10) y = ys+rnorm(m) * 0.2 # Boundary conditions bx = c(0, 10) by = c(0, 0) # Compute bases for function, first and second derivative bdeg = 3 nseg = 50 B0 = bbase(x, bx[1], bx[2], nseg, bdeg) nb = ncol(B0) Gi = bbase(bx, bx[1], bx[2], nseg, bdeg) # Set syste penalty and with extra penalty D = diff(diag(nb), diff = 2) P = t(D) %% D Bb = t(B0) %% B0 Ci = t(Gi) %% Gi lam = 1e1 kap = 1e8 # Solve system strategy 1 cof_p = solve(Bb + lam P + kap * Ci) %% (t(B0) %% y + kap * t(Gi) %% by) # Solve system strategy 2 LS = rbind((Bb + lam P), Gi) RS = rbind(t(Gi), 0 * diag(0, nrow(Gi))) cof_l = solve(cbind(LS, RS)) %% c(t(B0) %% y, by) # Plot results plot(x, y, xlim = bx, pch = 16) lines(x, ys, col = 8, lwd = 2) points(bx, by, pch = 15) # Strategy 1 lines(x, B0 %% cof_p, lwd = 2, col = 2) points(bx[1], (Gi %% cof_p)[1], col = 2, pch = 16) points(bx[2], (Gi %% cof_p)[2], col = 2, pch = 16) # Strategy 2 lines(x, B0 %% cof_l[1:nb], lwd = 2, col = 3, lty = 2) points(bx[1], (Gi %% cof_l[1:nb])[1], col = 3, pch = 16, cex = 0.75) points(bx[2], (Gi %% cof_l[1:nb])[2], col = 3, pch = 16, cex = 0.75) legend('bottomleft', c('data', 'signal', 'strategy1', 'strategy2'), col = c(1, 8, 2, 3), pch = 16) The final results should look like this: I hope this helps somehow. A: This might be a bit long so I will reply in another answer. Following the comment to my previous answer I will attempt a solution to the following problem: fit an additive model with a shared smooth trend effect subject to boundary constraint and a random Id intercept. Extra penalty in matrix augmentation form In the comments above I mentioned that strategy 1 of my previous answer can be used to achieve the constrained fit in a GAMM setting. This becomes clear if we write the extra penalty solution in augmented matrix form (in what follows I will use the same notation as in my previous answer). We can say that: $$ \min_{c} S_{p} = \\|W^{1/2} (y_{p} - B_{p}c)\\|^{2} + \lambda \\|D_{d} c\\|^{2} $$ where $c$ is a $(m \times 1)$ vector of unknown spline coefficients, $y_{p}$ is a $((n+ 2) \times 1)$ vector obtained stacking the observed $y$ and boundary values $v(x_{0})$, $B_{p}$ is a $((n+2) \times m)$ B-splines basis matrix obtained placing matrices $B$ and $\Gamma$ on top of each other, $W^{1/2}$ is a $((m + 2) \times (m+2))$ diagonal matrix with first $m$ non-zero elements equal to 1 and last two equal to $\sqrt{\kappa}$ and $D_{d}$ is a $d$ order finite difference matrix operator (the penalty matrix is equal to $P = D_{d}^{\top} D_{d}$). P-splines as mixed models P-splines (and all the penalized smoothing techniques included in the s() function of the mgcv package) can be written in a linear 'mixed model form'. For P-splines different re-parameterization are possible (see e.g. par 10 of Eilers et al. (2015)). We can for example define $$ \begin{array}{ll} X = [1, x_{p}^{1}, ..., x_{p}^{d-1}] \\ Z = B_{p}D_{d}^{\top} (D_{d}D_{d}^{\top})^{-1} \end{array} $$ where $x_{p}$ is the $(m+2)$ vector of time points including the last two boundary ordinates. With this in mind we can then rwrite the normal equations for the min problem above as follows (see also this): $$ \left[ \begin{array}{lll} X^{\top} W X & X^{\top} W Z \\ Z^{\top} W X & Z^{\top} W Z + \lambda I \end{array} \right] \left[ \begin{array}{ll} \beta\\ b \end{array} \right] = \left[ \begin{array}{ll} X^{\top} W y_{p} \\ Z^{\top} W y_{p} \end{array} \right] $$ where $\lambda$ is still the smoothing parameter and it is equal to the ratio of variances $\sigma^{2}/\tau^{2}$ with $b \sim N(0, \tau^{2} I)$ and $\epsilon \sim N(0, \sigma^{2} I)$. Include random intercept To solve the original problem, we would like to include also a random intercept. This can be achieved by modifying the form of the Z matrix as follows (see also this link ): $$ Z = \left( \begin{array}{lll} Z_{1} ,& \texttt{1}_{1},& 0,& \dots ,& 0 \\ Z_{2} ,& 0,& \texttt{1}_{2},& \dots ,& 0 \\ \vdots ,& \vdots,& \vdots,& \vdots,& \vdots \\ Z_{J} ,& \dots,& \dots, & \dots,& \texttt{1}_{J} \end{array} \right) $$ where $\texttt{1}_{j}$ is a $((n_{j} + 2) \times 1)$ vector of ones used to model the $j-$th subject-specific intercept. Of course this also 'adds' $J$ elements to the vector of random effects $b$ with $\text{Cov}(b) = \begin{pmatrix} \tau^2 \boldsymbol{I} & 0 \\ 0 & \sigma_{\texttt{1}}^2 \boldsymbol{I} \end{pmatrix}$ Small R-code I will suppose here that you have a function for the definition of the B-spline matrices and their mixed model representation. I left comments and references in the code. In principle, I think this can be achieved within the mgcv package but unfortunately I do not know the package well enough. Instead, I will use nlme package (on which I thing mgcv is written on at least partially). ##################### # Utility functions # ##################### Conf_Bands = function(X, Z, f_hat, s2, s2.alpha, alpha = 0.975) { # cit: #http://halweb.uc3m.es/esp/Personal/personas/durban/esp/web/cursos/Maringa/gam-markdown/Gams.html#26_penalized_splines_as_mixed_models C = cbind(X, Z) lambda = s2/s2.alpha D = diag(c(rep(0, ncol(X)), rep(lambda, ncol(Z)))) S = s2 * rowSums(C %% solve(t(C) %% C + D) * C) CB_lower = f_hat - qnorm(alpha) * sqrt(S) CB_upper = f_hat + qnorm(alpha) * sqrt(S) CB = cbind(CB_lower, CB_upper) CB } basesMM = function(B, D, dd, ns, x) { # NB: needs to be modified if n_{j} is different for some j Z0 = B %% t(D) %% solve(D %% t(D)) X0 = outer(x, 1:(dd-1), '^') Z = do.call('rbind', lapply(1:ns, function(i) Z0)) X = do.call('rbind', lapply(1:ns, function(i) X0)) return(list(X = X, Z = Z)) } ######################### # Utility functions end # ######################### # Simulate some data set.seed(2020) xmin = 1 xmax = 9 m = 100 x = seq(xmin, xmax, length = m) ys = sin((x^2)/10) ns = 3 y = ys + rnorm(m) 0.2 yl = c(-2 + y, -0 + y, 2 + y) sb = factor(rep(1:3, each = m)) dat = data.frame(y = yl, x = rep(x, ns), sub = sb) # Boundary conditions bx = c(0, 10) by = c(-0, -0) xfine = seq(bx[1], bx[2], len = m * 2) # Create bases # see https://onlinelibrary.wiley.com/doi/10.1002/wics.125 bdeg = 3 nseg = 25 dx = (bx[2] - bx[1]) /nseg knots = seq(bx[1] - bdeg * dx, bx[2] + bdeg * dx, by = dx) B0 = bbase(x, bx[1], bx[2], nseg, bdeg) nb = ncol(B0) Gi = bbase(bx, bx[1], bx[2], nseg, bdeg) Bf = bbase(xfine, bx[1], bx[2], nseg, bdeg) # Penalty stuffs dd = 3 D = diff(diag(1, nb), diff = dd) kap = 1e8 # Augmented matrix Bp = rbind(B0, Gi) # Mixed model representation for lme # see https://www.researchgate.net/publication/290086196_Twenty_years_of_P-splines yp = do.call('c', lapply(split(dat, dat$sub), function (x) c(x$y, by))) datMM = data.frame(y = yp) mmBases = basesMM(Bp, D, dd, ns, x = c(x, bx)) datMM$X = mmBases$X datMM$Z = mmBases$Z datMM$w = c(rep(1, m), 1/kap, 1/kap) datMM$Id = factor(rep(1, ns * (m + 2))) datMM$sb = factor(rep(1:ns, each = m + 2)) # lme fit: # https://www.researchgate.net/publication/8159699_Simple_fitting_of_subject-specific_curves_for_longitudinal_data # https://stat.ethz.ch/pipermail/r-help/2006-January/087023.html # https://stats.stackexchange.com/questions/30970/understanding-the-linear-mixed-effects-model-equation-and-fitting-a-random-effec fit = lme(y ~ X, random = list(Id = pdIdent(~ Z - 1), sb = pdIdent( ~ w - 1)), data = datMM, weights = ~w) # Variance components s2 = fit$sigm ^ 2 s2.alpha = s2 * exp(2 * unlist(fit$modelStruct)[1]) # Extract coefficients + get fit + value at boundaries X0 = datMM$X[1:(m+2), ] Z0 = datMM$Z[1:(m+2), ] beta.hat = fit$coef$fixed b.hat = fit$coef$random f.hat = cbind(1, X0[1:m, ]) %% beta.hat + Z0[1:m, ] %% t(b.hat$Id) f.hatfine = cbind(1,basesMM(Bf, D, dd, ns = 1, x = xfine)$X) %% beta.hat + basesMM(Bf, D, dd, ns = 1, x = xfine)$Z %% t(b.hat$Id) f.cnt = cbind(1, X0[-c(1:m), ]) %% beta.hat + Z0[-c(1:m), ] %% t(b.hat$Id) fit_bands = Conf_Bands(cbind(1, X0[1:m, ]) , Z0[1:m, ], f.hat, s2, s2.alpha) # Plots fits par(mfrow = c(2, 1), mar = rep(2, 4)) plot(rep(x,ns), yl, xlim = range(c(x, bx) + c(-0.5, 0.5)), main = 'Fitted curves', col = as.numeric(dat$sub), pch = 16) abline(h = 0, lty = 3) lines(x, f.hat[1:m] + fit$coefficients$random$sb[1], col = 8, lwd = 2) lines(x, f.hat[1:m] + fit$coefficients$random$sb[2], col = 8, lwd = 2) lines(x, f.hat[1:m] + fit$coefficients$random$sb[3], col = 8, lwd = 2) # Plot smooths plot(x, f.hat, type = 'l', main = 'Smooth-term', xlim = range(c(x, bx) + c(-0.5, 0.5)), ylim = range(fit_bands + c(-0.5, 0.5))) rug(knots[knots <= bx[2] & knots >= bx[1]]) polygon(x = c(x, rev(x)), y = c(fit_bands[, 1], rev(fit_bands[, 2])), lty = 0, col = scales::alpha('black', alpha = 0.25)) abline(h = by) points(bx, f.cnt, pch = 16) lines(xfine, f.hatfine, col = 2, lty = 2) legend('topleft', legend = c('Smooth', 'Extrapolation', 'Constraint'), col = c(1, 2, 1), lty = c(1, 2, 0), pch = c(-1, -1, 16)) I hope everything here is correct (if you find some mistake, things that are not clear or suggestions please let me know). Finally, I hope my answer will be useful.	{ "pile_set_name": "StackExchange" }
Q: Как легко сортировать числа? (1 минутА, 2 минутЫ и т.д) У меня есть дискорд бот на python. Но при выдаче бана/мута пишет не правильно (например: 1 минуТ). Но таких примеров реально много и написать все в if 2 or 3 or 4 не очень... Как можно обучить бота понимать какое это число и правильно писать слово? A: def conv(n): es = ['а', 'ы', ''] n = n % 100 if n>=11 and n<=19: s=es[2] else: i = n % 10 if i == 1: s = es[0] elif i in [2,3,4]: s = es[1] else: s = es[2] return s for i in range(1,150): print('{} минут{}'.format(i, conv(i))) A: Ответил бы в комментарии, но нет рейтинга. Никакого машинного обучения не надо. Классическая задача, гуглить "склонение существительных после числительных", "Генерация множественных числительных в согласовании с существительным" и т.д.	{ "pile_set_name": "StackExchange" }
When communication is performed in a WLAN system, errors of transmitted information bits often occur serially. However, channel coding works only in a case of detecting and correcting a single error or a short string of errors. To resolve the foregoing problem, an interleaving processing technology is used to process transmitted data bits. After the interleaving processing technology is used, consecutive transmitted data bits are scattered, and the transmitted data bits can be sent in a non-consecutive manner. In this way, even if a string of errors occurs in a transmission process, when a message of a successive bit string is restored, the errors become a single (or relatively short) error. In this case, the error is corrected by using a correction function of the channel coding, so that the original transmitted data bits can be restored more accurately. In the 802.11a/g protocol, sub-interleaving processing needs to be performed on the transmitted data bits twice. In the 802.11n/ac/ah protocol, sub-interleaving processing needs to be performed three times. An interleaving processing parameter of any time of sub-interleaving processing may be determined according to a quantity of data subcarriers, that is, when the quantity of data subcarriers changes, the interleaving processing parameter also needs to change accordingly. In addition, in the 802.11a/g/n/ac/ah protocol, an OFDM (Orthogonal Frequency Division Multiplexing) technology is used to perform data transmission. OFDM is a multi-carrier technology in which a frequency domain is divided into multiple mutually orthogonal data subcarriers, modulated signals that are corresponding to transmitted data bits and that are obtained after interleaving processing and modulation are respectively mapped to corresponding data subcarriers for transmission, and a quantity of data subcarriers is fixed. To further improve transmission efficiency of a multi-user system, an orthogonal frequency division multiple access (OFDMA) technology is introduced into a next-generation WLAN standard. According to OFDMA, a transmission bandwidth is divided into a series of orthogonal subcarrier sets that do not overlap with each other, and different subcarrier sets are allocated to different orthogonal frequency division multiple access users, to achieve multiple access. Compared with the OFDM technology, an OFDMA system may dynamically allocate an available bandwidth resource to a user in need, thereby facilitating optimized utilization of system resources. Different subcarrier sets in each OFDM symbol are allocated to different users. Consequently, an original fullband interleaving solution causes data interleaving between different users, thereby affecting optimized user subcarrier allocation. Therefore, in the next-generation WLAN technology, an effective bit interleaving solution needs to be redesigned for a frequency band occupied by each user in the OFDMA system, to improve system performance with a lowest possibility of increasing system complexity.	{ "pile_set_name": "USPTO Backgrounds" }
Q: Convert mcrypt_generic to openssl_encrypt PHP no longer supports mcrypt. I have to make an OpenSSL alternative that has the exact same output as I only have access to half the code base. My attempts have all failed. As you can see below OS doesn't match MC. I've tried different $methods and combinations of OPENSSL_RAW_DATA \| OPENSSL_ZERO_PADDING. Where am I going wrong? const n = "\n"; $text= 'hello my friends'; $method = 'AES-128-CBC'; $key = base64_decode('AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA'); $text = base64_decode('MDEyMzQ1Njc4OUFCQ0RFRgAAAAYxMjM0NTYxMjMDAwM='); $size = openssl_cipher_iv_length($method); $iv = substr($key, 0, $size); // MCRYPT METHOD $module = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', MCRYPT_MODE_CBC, ''); mcrypt_generic_init($module, $key, $iv); $mcrypt = mcrypt_generic($module, $text); // OPENSSL METHOD $method = 'AES-128-CBC'; $openssl = openssl_encrypt($text, $method, $key, OPENSSL_RAW_DATA \| OPENSSL_ZERO_PADDING, $iv); echo "MC: " . base64_encode($mcrypt) . n; echo "OS: " . base64_encode($openssl) . n; /* MC: 9+gMhSSAHhJ4g4rdjwP02YQJTfU2qEThBco+W9ob9UU= OS: Qsz5HitF4X+2DV48wh7ExCjWjGEOAl88MKXk/g24Z/I= */ A: Mcrypts: MCRYPT_RIJNDAEL_128, MCRYPT_MODE_CBC is equivalent to: OPENSSL: AES-256-CBC I have no idea why there's the difference, but changing the 128 to 256 solved it for me.	{ "pile_set_name": "StackExchange" }
Debbie Douglas Debbie Douglas may refer to: Debbie Douglas (The Only Way Is Essex) Debbie Douglas (Freakazoid!)	{ "pile_set_name": "Wikipedia (en)" }
Details Options Product Rating Share this Product Product Description A paper set that coordinates with the 13th Anniversary products; a mix and match collaboration. These ten gorgeous papers, including watercolor, quilt patterns, ceramic, sweater knit and leaves. The bold colors will be perfect for fall layouts. When you complete your purchase, you will receive (via email) a download key which will allow you to download your product files directly from a download area that is assigned specifically for your use. You will also be able to locate your download and pass code information in your Scrap Girls Boutique account area.Notice: When you download or use files from Scrap Girls, you are automatically accountable to our Terms of Use and License Agreements. If you have questions about these items, please look here. Related Customers Also Bought Reviews An Alpha and Word Art set that coordinates with the 13th Anniversary products; a mix and match collaboration. Two coordinating alphas, with painted and burlap textures, and fall inspired word art. The bold colors will be perfect for fall layouts. A word art set that coordinates with the 13th Anniversary products; a mix and match collaboration. Word art is often what catches your eye in a layout: they can be used as the title, to help tell the story and bring your photos to life. A paper set that coordinates with the 13th Anniversary products; a mix and match collaboration. These ten beautifully subtle textured papers, including watercolor, damask, denim and leaves, with their bold colors will enhance any layout. An embellishment set that coordinates with the Finally Fall products, with embellishments that evoke cool autumn days, designed to help you scrapbook those special days spent with friends and family. The bold colors will be perfect for fall layouts. A Value Pack that coordinates with the 13th Anniversary products; a mix and match collaboration. Three great “Finally Fall” digital scrapbooking products packaged together to give you the best value. The bright and bold colors will be perfect for fall layouts.	{ "pile_set_name": "Pile-CC" }
# Copyright (c) 2020 The Orbit Authors. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE file. set(DIR third_party/multicore/common) add_library( multicore OBJECT ${DIR}/inmemorylogger.cpp ${DIR}/autoresetevent.h ${DIR}/autoreseteventcondvar.h ${DIR}/benaphore.h ${DIR}/bitfield.h ${DIR}/diningphilosophers.h ${DIR}/inmemorylogger.h ${DIR}/rwlock.h ${DIR}/sema.h) target_include_directories(multicore SYSTEM PUBLIC ${DIR}) target_compile_features(multicore PUBLIC cxx_std_11) target_link_libraries(multicore PUBLIC Threads::Threads) add_library(multicore::multicore ALIAS multicore)	{ "pile_set_name": "Github" }
--- abstract: 'We study neutrino conversions in a recently envisaged source of high energy neutrinos ($E {\buildrel > \over {_{\sim}}} \, 10^{6}$ GeV), that is, in the vicinity of cosmological Gamma-Ray Burst fireballs (GRB). We consider the effects of flavor and spin-flavor conversions and point out that in both situations, a some what higher than estimated high energy tau neutrino flux from GRBs is expected in new km$^{2}$ surface area under water/ice neutrino telescopes.' address: \| Department of Physics, Tokyo Metropolitan University, Minami-Osawa 1-1, Hachioji-Shi,\ Tokyo 192-0397, Japan; E-mail: [email protected] author: - 'H. Athar' title: 'Neutrino conversions in cosmological gamma-ray burst fireballs' --- Introduction ============ Recently, cosmological fireballs are suggested as a possible production site for gamma-ray bursts as well as the high energy ($E {\buildrel > \over {_{\sim}}} \, 10^{6}$ GeV) neutrinos [@WB]. Although, the origin of these cosmological Gamma-Ray Burst fireballs (GRB) is not yet understood, the observations suggest that generically a very compact source of linear scale $\sim \, 10^{7}$ cm through internal or/and external shock propagation produces these gamma-ray bursts (as well as the burst of high energy neutrinos) [@P]. Typically, this compact source is hypothesized to be formed possibly due to the merging of binary neutron stars or due to collapse of a supermassive star. The main source of high energy tau neutrinos in GRBs is the production and decay of $D^{\pm}_{S}$. The production of $D^{\pm}_{S}$ may be through $p\gamma $ and/or through $pp$ collisions. In [@PX], the $\nu_{e}$ and $\nu_{\mu}$ flux is estimated in $pp$ collisions, whereas in [@WB], the $\nu_{e}$ and $\nu_{\mu}$ flux is estimated in $p\gamma$ collisions for GRBs. In $pp$ collisions, the flux of $\nu_{\tau}$ may be obtained through the main process of $p+p\rightarrow D^{+}_{S}+X$. The $D^{+}_{S}$ decays into $\tau^{+}$ lepton and $\nu_{\tau}$ with a branching ratio of $\sim \, 3\%$. This $\tau^{+}$ lepton further decays into $\nu_{\tau}$. The cross-section for $D^{+}_{S}$ production, which is main source of $\nu_{\tau}$’s, is $\sim $ 4 orders of magnitude lower than that of $\pi^{+}$ and/or $\pi^{-}$ which subsequently produces $\nu_{e}$ and $\nu_{\mu}$. The branching ratio for $\nu_{e}$ and/or $\nu_{\mu}$ production is higher up to an order of magnitude than that for $\nu_{\tau}$ production (through $D^{\pm}_{S}$). These imply that the $\nu_{\tau}$ flux in $pp$ collisions is suppressed up to 5 orders of magnitude relative to corresponding $\nu_{e}$ and/or $\nu_{\mu}$ fluxes. In $p\gamma$ collisions, the main process for the production of $\nu_{\tau}$ may be $p+\gamma \rightarrow D^{+}_{S}+ \Lambda^{0}+\bar{D}^{0}$ with similar relevant branching ratios and corresponding suppression for cross-section values. Here the corresponding main source for $\nu_{e}$ and $\nu_{\mu}$ production is $p+\gamma \, \rightarrow \Delta^{+}\rightarrow \pi^{+}+n$. Therefore, in $p\gamma $ collisions, the $\nu_{\tau}$ flux is also suppressed up to 5 orders of magnitude relative to $\nu_{e}$ and/or $\nu_{\mu}$ flux. Thus, in both type of collisions, including the relevant kinematics, the intrinsic $\nu_{\tau}(\bar{\nu}_{\tau})$ flux is estimated to be rather small relative to $\nu_{e} (\bar{\nu}_{e})$ and/or $\nu_{\mu} (\bar{\nu}_{\mu})$ fluxes from GRBs, typically being, $F^{0}_{\tau} /F^{0}_{e,\mu}\, <10^{-5}$ [@VZA]. In this paper, we consider the possibility of obtaining higher $\nu_{\tau}$ flux, that is, $F^{0}_{\tau}/F^{0}_{e,\mu}\, >\, 10^{-5}$, from GRBs through neutrino conversions as compared to no conversion situation. The present study is particularly useful as the new under ice/water Čerenkov light neutrino telescopes namely AMANDA and Baikal (also the NESTOR and ANTARES) will have energy, angle and flavor resolution for high energy neutrinos originating at cosmological distances [@M]. Recently, there are several discussions concerning the signatures of a possible neutrino burst from GRBs correlated in time and angle [@W]. In particular, there is a suggestion of measuring $\nu_{\tau}$ flux from cosmologically distant sources through a double shower (bang) event [@L] or through a small pile up of up ward going $\mu$-like events near (10$^{4}-10^{5}$) GeV [@HS]. The plan of this paper is as follows. In Sect. II, we briefly describe the matter density and magnetic field in the vicinity of GRBs. In Sect. III, we discuss in some detail, the range of neutrino mixing parameters that may give rise to relatively large precession/conversion probabilities resulting from neutrino flavor/spin-flavor conversions. In Sect. IV, we give estimates for separable but contained double shower event rates induced by high energy $\nu_{\tau}$’s originating from GRBs without/with conversions for km$^{2}$ surface area under water/ice neutrino telescopes for illustrative purposes and finally in Sect. V, we summarize our results. matter density and magnetic field in the vicinity of GRB ======================================================== According to [@WB], the isotropic high energy neutrino production may take place in the vicinity of $r_{p}\, \sim \, \Gamma^{2}c\Delta t$. Here $\Gamma $ is the Lorentz factor (typically $\Gamma \, \sim \, 300$) and $\Delta t$ is the observed GRB variability time scale (typically $\Delta t\, \sim \, 1$ ms). In the vicinity of $r_{p}$, the fireball matter density is $\rho \, \sim \, 10^{-13}$ g cm$^{-3}$ [@WB]. In these models, the typical distance traversed by neutrinos may be taken as, $\Delta r\, {\buildrel < \over {_{\sim}}}\, (10^{-4}-1)$ pc, in the vicinity of GRB, where 1 pc $\sim \, 3\times 10^{18}$ cm. Matter effects on neutrino oscillations are relevant if $G_{F}\rho /m_{N}\, \sim \, \delta m^{2}/2E$. Using $\rho$ from Ref. [@WB], it follows that matter effects are absent for $\delta m^{2}\, {\buildrel > \over {_{\sim}}} \, {\cal O}(10^{-10})$ eV$^{2}$. Matter effects due to coherent forward scattering of neutrinos off the background for high energy neutrinos originating from GRBs are not expected to be important in the neutrino production regions around GRBs and will not be further discuss here. Taking the observed duration of the typical gamma-ray burst as, $\Delta t\, {\buildrel < \over {_{\sim}}} \, 1$ ms, we obtain the mass of the source as, $M_{GRB}\, {\buildrel < \over {_{\sim}}}\, \Delta t/G_{N}$, where $G_{N}$ is the gravitational constant. For the relatively shorter observed duration of gamma-ray burst from a typical GRB, $\Delta t\, \sim \, 0.2 $ ms, implying $M_{GRB}\, \sim \, 40\, M_{\odot}$ (where $M_{\odot}\, \sim \, 2\times 10^{33}$ g is solar mass). We use $M_{GRB}\, \sim \, 2\times 10^{2}\,M_{\odot}$ in our estimates. The magnetic field in the vicinity of a GRB is obtained by considering the equipartition arguments [@WB]. We use the following profile of magnetic field, $B_{GRB}$, as an example, for $r\, > \, r_{p}$ [@mag] $$B_{GRB}(r)\, \simeq \, B_{0}\left(\frac{r_{p}}{r}\right)^{2}, \label{bprofile}$$ where $B_{0}\, \sim \, L^{1/2}c^{-1/2}(r_{p}\Gamma)^{-1}$ with $L$ being the total wind luminosity (typically $L\, \sim \, 10^{51}$ erg s$^{-1}$). Neutrino conversions in GRB =========================== Flavor oscillations ------------------- In the framework of three flavor analysis, the flavor precession probability from $\alpha $ to $\beta $ neutrino flavor is [@book] $$P(\nu_{\alpha}\rightarrow \nu_{\beta}) \equiv P_{\alpha \beta} = \sum^{3}_{i=1}\|U_{\alpha i}\|^{2}\|U_{\beta i}\|^{2} +\sum_{i \neq j} U_{\alpha i}U^{\ast}_{\beta i} U^{\ast}_{\alpha j}U_{\beta j} \cos\left(\frac{2\pi L}{l_{ij}}\right), \label{3flvp}$$ where $\alpha, \beta = e, \mu, $ or $\tau $. $U$ is the 3$\times $3 MNS mixing matrix and can be obtained in usual notation through $$U\, \equiv R_{23}(\theta_{1}) \mbox{diag}(e^{-i\delta /2},1,e^{i\delta /2}) R_{31}(\theta_{2}) \mbox{diag}(e^{i\delta /2},1,e^{-i\delta /2}) R_{12}(\theta_{3}), \label{defU}$$ thus coinciding with the standard form given by the Particle Data Group [@pdg]. In Eq. (\[defU\]), $l_{ij}\simeq 4\pi E/ \delta m^{2}_{ij}$ with $\delta m^{2}_{ij} \equiv \|m^{2}_{i}-m^{2}_{j}\|$ and $L$ is the distance between the source and the detector. For simplicity, we will assume here a vanishing value for $\theta_{31}$ and CP violating phase $\delta $ in $U$. At present, the atmospheric muon and solar electron neutrino deficits can be explained with oscillations among three active neutrinos [@RECENT]. For this, typically, $\delta m^{2} \sim {\cal O}(10^{-3})$ eV$^{2}$ and $\sin^{2}2\theta \sim {\cal O}(1)$ for the explanation of atmospheric muon neutrino deficit, whereas for the explanation of solar electron neutrino deficit, we may have $\delta m^{2} \sim {\cal O}(10^{-10})$ eV$^{2}$ and $\sin^{2}2\theta \sim {\cal O}(1)$ \[just so\] or $\delta m^{2} \sim {\cal O}(10^{-5})$ eV$^{2}$ and $\sin^{2}2\theta \sim {\cal O}(10^{-2})$ \[SMA (MSW)\] or $\delta m^{2} \sim {\cal O}(10^{-5})$ eV$^{2}$ and $\sin^{2}2\theta \sim {\cal O}(1)$ \[LMA (MSW)\]. The present status of data thus permits multiple oscillation solutions to solar neutrino deficit. We intend to discuss here implications of these mixings for high energy cosmic neutrino propagation. In the above explanations, the total range of $\delta m^{2}$ is $10^{-10}\leq \delta m^{2}/$ eV$^{2} \leq 10^{-3}$ irrespective of neutrino flavor. The typical energy span relevant for possible flavor identification for high energy cosmic neutrinos is $2\times 10^{6}\leq E/$GeV$\leq 2\times 10^{7}$ (see Sect. IV). Taking a typical distance between the GRB and our galaxy as $L \sim 1000$ Mpc, we note that $\cos $ term in Eq. (\[3flvp\]) vanishes and so Eq. (\[3flvp\]) reduces to $$P_{\alpha \beta} \simeq \sum^{3}_{i=1}\|U_{\alpha i}\|^{2}\|U_{\beta i}\|^{2}. \label{preduced}$$ It is assumed here that no relatively dense objects exist between the GRB and the earth so as to effect significantly this oscillations pattern. Since $P_{\alpha \beta }$ in above Eq. is symmetric under the exchange of $\alpha $ and $\beta $ indices implying that essentially no $T$ (or $CP$) violation effects arise in neutrino vacuum flavor oscillations for high energy cosmic neutrinos [@cabibbo]. Let us denote by $F^{0}_{\alpha }$, the intrinsic neutrino fluxes. From the discussion in the previous Sect., it follows that $F^{0}_{e} : F^{0}_{\mu} :F^{0}_{\tau} = 1 :2 : < 10^{-5}$. For simplicity, we take these ratios as 1 : 2 : 0. In order to estimate the final flux ratios on earth for high energy cosmic neutrinos originating from cosmologically distant GRBs, let us introduce a 3$\times $3 matrix of vacuum flavor precession probabilities such that $$F_{\alpha} = \sum_{\beta}P_{\alpha \beta} F^{0}_{\beta}, \label{falpha}$$ where the unitarity conditions for $ P_{\alpha \beta} $ read as $$\begin{aligned} P_{ee} + P_{e\mu } + P_{e\tau } & = & 1,\nonumber \\ P_{e\mu} + P_{\mu \mu } + P_{\mu \tau }& = & 1,\nonumber \\ P_{e\tau }+ P_{\mu \tau } + P_{\tau \tau } & = & 1. \label{unitarity} \end{aligned}$$ The explicit form for the matrix $P $ in case of just so flavor oscillations as solution to solar neutrino problem along with the solution to atmospheric neutrino deficit in terms of $\nu_{\mu}$ to $\nu_{\tau}$ oscillations with maximal depth is $$P = \left( \begin{array}{ccc} 1/2 & 1/4 & 1/4 \\ 1/4 & 3/8 & 3/8 \\ 1/4 & 3/8 & 3/8 \end{array} \right). \label{justso}$$ Using Eq. (\[justso\]) and Eq. (\[falpha\]), we note that $F_{e}: F_{\mu }: F_{\tau } = 1: 1: 1$ at the level of $F^{0}_{e}$. Also, Eq. (\[unitarity\]) is satisfied. The same final flux ratio is obtained in remaining two cases for which the corresponding $P$ matrices are \[for SMA (MSW)\] $$P = \left( \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1/2 & 1/2 \\ 0 & 1/2 & 1/2 \end{array} \right), \label{sma}$$ whereas in case of LMA (MSW), $$P = \left( \begin{array}{ccc} 5/8 & 3/16 & 3/16 \\ 3/16 & 13/32 & 13/32 \\ 3/16 & 13/32 & 13/32 \end{array} \right). \label{lma}$$ Thus, independent of the oscillation solution for solar neutrino problem, we have $F_{e}: F_{\mu }: F_{\tau } = 1: 1: 1$. Importantly, these ratios do not depend on neutrino energy or $\delta m^{2}$ at least in the relevant energy interval. Summarizing, although intrinsically the high energy cosmic tau neutrino flux is negligibally small however because of vacuum flavor oscillations it becomes comparable to $\nu_{e}$ flux thus providing some prospects for its possible detection. Spin-flavor oscillations ------------------------ We consider here an example of a possibility that may lead to an energy dependence and/or change in the above mentioned final flux ratios. We consider spin-flavor oscillations resulting from an interplay of possible Violation of Equivalence Principle (VEP) parameterized by $\Delta f$ and the magnetic field in the vicinity of GRBs. We obtain the range of neutrino mixing parameters giving $F_{\tau}/F_{e,\mu} > \, 10^{-5}$. The possibility of VEP arises from the realization that different flavors of neutrinos may couple differently to gravity [@G]. Consider a system of two mixed neutrinos ($\bar{\nu}_{e}$ and $\nu_{\tau}$) for simplicity. The difference of diagonal elements of the $2\times 2$ effective Hamiltonian describing the dynamics of the mixed system of these oscillating neutrinos in the basis $\psi^{T}\, =\, (\bar{\nu}_{e}, \nu_{\tau})$ for vanishing vacuum and gravity mixing angles is [@AK] $$\Delta H\, =\, \delta - V_{G}, \label{deltaH}$$ whereas each of the off diagonal elements is $\mu B$ ($\mu $ is magnitude of neutrino magnetic moment). In Eq. (\[deltaH\]), $\delta \, =\, \delta m^{2}/2E$, where $\delta m^{2}\, =\, m^{2} (\nu_{\tau})-m^{2}(\bar{\nu}_{e}) \, >\, 0$. Here $V_{G}$ is the effective potential felt by the neutrinos at a distance $r$ from a gravitational source of mass $M$ due to VEP and is given by [@G] $$V_{G} \, \equiv \, \Delta f \phi(r)E, \label{defVg}$$ where $\Delta f \, =\, f_{3}-f_{1}$ is a measure of the degree of VEP and $\phi(r)\, = \, G_{N}Mr^{-1}$ is the gravitational potential in the Keplerian approximation. In Eq. (\[defVg\]), $f_{3}G_{N}$ and $f_{1}G_{N}$ are respectively the gravitational couplings of $\nu_{\tau}$ and $\bar{\nu}_{e}$, such that $f_{1}\, \neq \, f_{3}$. We assume here same gravitational couplings for $\nu $ and $\bar{\nu}$ for simplicity. This implies that the sign of $V_{G}$ is same for $\bar{\nu}_{e}\rightarrow \nu_{\tau}$ and $\nu_{e}\rightarrow \bar{\nu}_{\tau}$ conversions [@AK]. If this is not the case then the sign of $V_{G}$ will be different for the two conversions and only one of the two conversions can occur. This may lead to a change in expected $\nu_{e}/\bar{\nu}_{e}$ ratio. We briefly comment on the possibility of empirical realization of this situation in next Sect.. There are at least three relevant $\phi (r)$’s that need to be considered [@MS]. The effect of $\phi (r)$ due to supercluster named Great Attractor with $\phi_{SC} (r)$ in the vicinity of GRB; $\phi (r)$ due to GRB itself, which is, $\phi_{GRB} (r)$, in the vicinity of GRB and the galactic gravitational potential, which is, $\phi_{G}(r)$. Therefore, we use, $\phi(r)\, \equiv \, \phi_{SC}(r)+\phi_{GRB}(r)+\phi_{G}(r)$. However, $\phi_{G}(r)\, \ll \, \phi_{SC}(r),\, \phi_{GRB}(r)$ in the vicinity of GRB. Thus, $\phi(r)\, \simeq \, \phi_{SC}(r)+\phi_{GRB}(r)$. If the neutrino production region $r_{p}$ is ${\buildrel < \over {_{\sim}}} 10^{13}$ cm then at $r\, \sim \, r_{p}$, we have $\phi_{GRB}(r)\, >\, \phi_{SC}(r)$. At $r\, \sim \, 6\times 10^{13}$ cm, $\phi_{GRB}(r)\, \sim \, \phi_{SC}(r)$ and for $r\, {\buildrel > \over {_{\sim}}}\, 10^{14}$ cm, $\phi_{GRB}(r)\, <\, \phi_{SC}(r)$. If the supercluster is a fake object then $\phi(r)\, \simeq \, \phi_{GRB}(r)$. Here we assume the smallness of the effect of $\phi (r)$ due to an Active Galactic Nucleus (AGN), if any, nearby to GRB. The possibility of vanishing gravity and vacuum mixing angle in Eq. (\[deltaH\]) allows us to identify the range of $\Delta f$ relevant for the neutrino magnetic moment effects only. Latter in this Sect., we briefly comment on the ranges of relevant neutrino mixing parameters for non vanishing gravity mixing angle with vanishing neutrino magnetic moment. The case of $\bar{\nu}_{\mu}\rightarrow \nu_{\tau}$ can be studied by replacing $\bar{\nu}_{e}$ with $\bar{\nu}_{\mu}$ along with corresponding changes in $V_{G}$ and $\delta m^{2}$. The intrinsic flux of $\bar{\nu}_{\mu}$ may be greater than that of $\bar{\nu}_{e}$ by a factor of $\sim $ 2 [@WB], thus also possibly enhancing the expected $\nu_{\tau}$ flux from GRBs through $\bar{\nu}_{\mu}\rightarrow \nu_{\tau}$. However, we have checked that observationally this possibility leads to quite similar results in terms of event rates and are therefore not discussed here further. We now study in some detail, the various possibilities arising from relative comparison between $\delta $ and $V_{G}$ in Eq. (\[deltaH\]). Let us first ignore the effects of VEP ($\Delta f\, =\, 0$). For constant $B$, the spin-flavor precession probability $P(\bar{\nu}_{e}\rightarrow \nu_{\tau})$ is obtained using Eq. (\[deltaH\]) as $$P(\bar{\nu}_{e}\rightarrow \nu_{\tau})\, =\, \left[\frac{(2\mu B)^{2}}{(2\mu B)^{2}+\delta^{2}}\right] \sin^{2}\left(\sqrt{(2\mu B)^{2}+\delta^{2}} \cdot \frac{\Delta r}{2}\right). \label{Pdeltaf0}$$ We take $\mu \, \sim \, 10^{-12}\, \mu_{B}$ or less, where $\mu_{B}$ is Bohr magneton, which is less than the stringent astrophysical upper bound on $\mu$ based on cooling of red giants [@R]. We here consider the transition magnetic moment, thus allowing the possibility of simultaneously changing the relevant neutrino flavor as well as the helicity. Therefore, the precessed $\nu_{\tau}$ is an active neutrino and interacts weakly. In Eq. (\[Pdeltaf0\]), $\Delta r$ is the width of the region with $B$. If $\delta \, < \, 2\mu B$, then, for $E\, \sim \, 2\times 10^{6}$ GeV and using Eq. (\[bprofile\]), we obtain $\delta m^{2}\, < \, 5\times 10^{-8}$ eV$^{2}$. We take, $\delta m^{2}\, \sim \, 10^{-9}$ eV$^{2}$, as an example and consequently we obtain from Eq. (\[Pdeltaf0\]) an energy independent large ($P\, >\, 1/2$) spin-flavor precession probability for $\mu \, \sim \, 10^{-12}\mu_{B}$ with $10^{-4}\, {\buildrel < \over {_{\sim}}}\, \Delta r/\mbox{pc} {\buildrel < \over {_{\sim}}}\,1$. This relatively small value of $\delta m^{2}$ is also interesting in the context of sun and supernovae [@ss]. Thus, for $\mu $ of the order of $10^{-12}\, \mu_{B}$, the $\nu_{\tau}$ flux may be higher than the expected one from GRBs, that is, $F_{\tau}/F_{e}\, > \, 10^{-5}$ due to neutrino spin-flavor precession effects. The neutrino spin-flavor precession effects are essentially determined by the product $\mu B$ so one may rescale $\mu $ and $B$ to obtain the same results. For $\delta \, \simeq 2\mu B$ and $\delta \, > \, 2 \mu B$, we obtain from Eq. (\[Pdeltaf0\]), an energy dependent $P$ such that $P\, <\, 1/2$. With non vanishing $\Delta f$ ($\Delta f\, \neq \, 0$), a resonant character in neutrino spin-flavor precession can be obtained for a range of values of relevant neutrino mixing parameters[^1]. Two conditions are essential to obtain a resonant character in neutrino spin-flavor precession: the level crossing and the adiabaticity at the level crossing (resonance). The level crossing condition is obtained by taking $\Delta H\, =\, 0$ and is given by: $$\delta m^{2}\, \sim \, 10^{-3} \mbox{eV}^{2} \left(\frac{\|\Delta f\|}{10^{-28}}\right). \label{levelcrossing}$$ These $\Delta f$ values are well below the relevant upper limits on $\Delta f$ which are typically in the $10^{-20}$ range [@recent]. Conversely speaking, the prospective detection of high energy neutrinos from cosmologically distant GRBs may be sensitive to $\Delta f$ values as low as $\sim 10^{-28}$. The other essential condition, namely, the adiabaticity in the resonance reads [@adiabaticity] $$\kappa \, \equiv \, \frac{2(2\mu B)^{2}}{\|\mbox{d}V_{G}/\mbox{d}r\|} \, {\buildrel > \over {_{\sim}}}\, 1. \label{adiabaticity}$$ Note that here $\kappa $ depends explicitly on $E$ through $V_{G}$ unlike the case of ordinary neutrino spin-flip induced by the matter effects. A resonant character in neutrino spin-flavor precession is obtained if $\kappa \, {\buildrel > \over {_{\sim}}}\, 1$ such that Eq. (\[levelcrossing\]) is satisfied. We notice that $B_{ad}/B_{GRB}\, {\buildrel <\over {_{\sim}}}\, 1$ for $\mu \, \sim 10^{-12}\mu_{B}$. Here $B_{ad}$ is obtained by setting $\kappa \, \sim \, 1$ in Eq. (\[adiabaticity\]). The general expression for relevant neutrino spin-flavor conversion probability is given by [@ICTP] $$P(\bar{\nu}_{e}\rightarrow \nu_{\tau})\, =\, \frac{1}{2}-\left(\frac{1}{2}-P_{LZ}\right)\cos 2\theta_{f}\cos 2\theta_{i}, \label{PLZ}$$ where $P_{LZ}\, =\, \exp(-\frac{\pi}{4}\kappa)$ and $ \tan 2\theta_{i}\, =\, (2\mu B)/\Delta H$ is being evaluated at the high energy neutrino production site in the vicinity of GRB, whereas $\tan 2\theta_{f}\, =\, (2\mu B)/\delta $ is evaluated at the exit. In Fig. 1, we plot $P(\bar{\nu}_{e}\rightarrow \nu_{\tau})$ given by Eq. (\[PLZ\]) as a function of $\Delta f $ as well as $\delta m^{2}$ with $E \sim 5\times 10^{6}$ GeV. Four equi $P$ contours are also shown in Fig. 1. Note that the resonant spin-flavor precession probability is relatively small ($P < 1/2$) for $\Delta f {\buildrel > \over {_{\sim}}} 10^{-26}$ essentially irrespective of $\delta m^{2}$ values. The expected spectrum $F_{\tau}$ of the high energy tau neutrinos originating from GRBs due to spin-flavor conversions is calculated as [@ICTP] $$F_{\tau}\simeq P(\bar{\nu}_{e}\rightarrow \nu_{\tau})F^{0}_{e}. \label{FTAU}$$ The energy dependence in $F_{\tau}$ is now evident \[as compared to $F_{\tau}$ given by Eq. (\[falpha\])\] when we convolve $P(\bar{\nu}_{e}\rightarrow \nu_{\tau})$ given by Eq. (\[PLZ\]) with $F^{0}_{e}$ taken from Ref. [@WB]. The degree of energy dependence clearly depends on the extent of spin-flavor conversions. With the improved information on either $\Delta f$ and/or $\mu $, one may be able to distinguish between the situations of resonant and non resonant spin-flavor precession induced by an interplay of VEP and $\mu $ in $B_{GRB}$. Let us now consider briefly the effects of non vanishing gravity mixing angle $\theta_{G}$ for vanishing neutrino magnetic moment. In the case of massless or degenerate neutrinos, the corresponding vacuum flavor oscillation analog for $\nu_{e}\rightarrow \nu_{\tau}$ is obtained through $\theta \rightarrow \theta_{G}$ and $\frac{\delta m^{2}}{4E} \rightarrow V_{G}$ in the standard flavor precession probability formula in 2 flavor approxiamtion. For maximal $\theta_{G}$, the sensitivity of $\Delta f$ may be estimated by equating the argument of second $\sin$ factor equal to $\pi/2$ in the corresponding expression for $P$ [@MS]. This implies $\Delta f\, \sim \, 10^{-41}$ with $\phi(r)\, \simeq \, \phi_{SC}(r)$. This value of $\Delta f$ is of the same order of magnitude as that expected for neutrinos originating from AGNs. In case of non zero $\delta m^{2}$, a resonant or/and non resonant flavor conversion between $\nu_{e}$ and $\nu_{\tau}$ in the vicinity of a GRB is also possible due to an interplay of vanishing/non vanishing vacuum and gravity mixing angles. For instance, a resonant flavor conversion between $\nu_{e}$ and $\nu_{\tau}$ may be obtained if $\sin^{2}2\theta_{G}\, \gg \, 0.25$ with $\Delta f \, \sim 10^{-31}$ ($\theta \, \rightarrow \, 0$). Here the relevant level crossing may occur at $r\, \sim \, 0.1 $ pc with corresponding $\delta m^{2}\, \sim \, 10^{-6}$ eV$^{2}$. Signatures of high energy $\nu_{\tau}$ in neutrino telescopes ============================================================= The km$^{2}$ surface area under water/ice high energy neutrino telescopes may be able to obtain first examples of high energy $\nu_{\tau}$, through [double showers]{}, originating from GRBs correlated in time and direction with corresponding gamma-ray burst or may at least provide relevant useful upper limits [@L]. The first shower occurs because of deep inelastic charged current interaction of high energy tau neutrinos near/inside the neutrino telescope producing the tau lepton (along with the first shower) and the second shower occurs due to (hadronic) decay of this tau lepton. The calculation of down ward going contained but separable double shower event rate for a km$^{2}$ surface area under ice/water neutrino telescope can be carried out by replacing the muon range expression with the tau one ($\sim E(1-y)\tau c/m_{\tau} c^{2}$) and then subtracting it from the linear size of a typical high energy neutrino telescope in the event rate formula while using the expected $\nu_{\tau}$ flux spectrum given by Eq. (\[falpha\]) and/or by Eq. (\[FTAU\]). Here, $y$ is the fraction of the neutrino energy carried by the hadrons in lab frame. Thus, $(1-y)$ is the fraction of energy transferred to the associated tau lepton having life time $\tau c$ and mass $m_{\tau}c^{2}$. We take here $y \sim 0.25$ [@L]. The condition of containdness of the two showers is obtained by requiring that the separation between the two showers is less than the typical $\sim $ km size of the neutrino telescope. It is obtained by equating the range of tau neutrino induced tau leptons with the linear size of detector implying $E \, {\buildrel < \over {_{\sim}}}\, 2\times 10^{7}$ GeV. The condition of separableness of the two showers is obtained by demanding that the separation between the two showers is larger than the typical spread of the showers such that the amplitude of the second shower is essentially 2 times the first shower. This leads to $E \, {\buildrel > \over {_{\sim}}}\, 2\times 10^{6}$ GeV [@L]. Thus, the two showers may be separated by a $\mu$-like track within these energy limits. To calculate the event rates, we use Martin Roberts Stirling (MRS 96 R$_{1}$) parton distributions [@mrs] and present event rates in units of yr$^{-1}$ sr$^{-1}$. We have checked that other recent parton distributions give quite similar event rates and are therefore not depicted here. Following [@APZ; @apz], we present in Table I, the expected contained but separable double shower event rates for down word going $\nu_{\tau}$ in km$^{2}$ size under water/ice Čerenkov high energy neutrino telescopes for illustrative purposes. In Table I, the vacuum oscillation situation is essentially independent of the choice of the oscillation solution to solar neutrino problem. From Table I, we notice that the event rates for neutrino flavor/spin-flavor precession are up to $\sim $ 5 orders of magnitude higher than that for typical intrinsic (no oscillations) tau neutrino flux. The possibility of measuring the contained but separable double shower events may enable one to distinguish between the high energy tau neutrinos and electron and/or muon neutrinos originating from cosmologically distant GRBs while providing useful information about the relevant energy interval at the same time. The chance of having double shower events induced by electron and/or muon neutrinos is negligibly small for the relevant energies [@L]. Collective information about directionality of the source, rate and energy dependence of neutrino fluxes will be needed to possibly isolate the mechanism of neutrino oscillation. The up ward going tau neutrinos at these energies may lead to a small pile up of up ward going $\mu$-like events near (10$^{4}-10^{5}$) GeV with fairly flat zenith angle dependence [@HS]. We now briefly discuss the potential of the under water/ice high energy neutrino telescopes to possibly determine an observational consequence of neutrino spin-flip in GRB induced by VEP. In the electron neutrino channel, the $\bar{\nu}_{e}$ interaction rate (integrated over all angles) is estimated to be an order of magnitude higher than that of $(\nu_{e}+\bar{\nu}_{e})$ per Megaton year [@APZ]. This an order of magnitude difference in interaction rate of [down ward going]{} $\bar{\nu}_{e}$ is due to Glashow resonance encountered by $\bar{\nu}_{e}$ with $E\, {\buildrel > \over {_{\sim}}} \, 10^{6}$ GeV when $\bar{\nu}_{e}$ interact with electrons inside the detector as compared to corresponding deep inelastic scattering. The up ward going $\bar{\nu}_{e}$, on the other hand, while passing through the earth, at these energies, are almost completely absorbed by the earth mainly due to same resonant effect. Thus, for instance, if $E \, \sim \, 6.4\times 10^{6}$ GeV, an energy resolution $\Delta E/E\, \sim \, 2\Gamma_{W}/M_{W}\, \sim \, 1/20$, where $\Gamma_{W}\, \sim $ 2 GeV is the width of Glashow resonance and $M_{W}\, \sim \, $80 GeV, may be needed to empirically differentiate between $\bar{\nu}_{e}$ and $(\nu_{e}+\bar{\nu}_{e})$. The existing/planned high energy neutrino telescopes may thus in principle attempt to measure the $\nu_{e}/\bar{\nu}_{e}$ ratio in addition to identifying ($\nu_{\tau}+\bar{\nu}_{\tau}$) and ($\nu_{\mu}+\bar{\nu}_{\mu}$) events separately. This feature may be utilized, for instance, to explain a situation in which a [change]{} in $\nu_{e}/\bar{\nu}_{e}$ ratio is observed as compared to GRB neutrino flux predictions in [@WB]. This situation, if realized obsevationally may be an evidence for the neutrino spin-flip in GRB due to VEP, provided if neutrinos and antineutrinos couple differently to gravity. This follows from the possibility discussed in previous Sect. that an interplay between VEP and neutrino magnetic moment in $B_{GRB}$ may leads to conversions in either $\nu_{e}$ or $\bar{\nu}_{e}$ channel but not in both channels simultaneously. Results and discussion ====================== 1\. Intrinsically, the flux of high energy cosmic tau neutrinos is quite small, relative to non tau neutrino flavor, typically being $F^{0}_{\tau}/F^{0}_{e, \mu}\, <\, 10^{-5}$ (whereas $F^{0}_{e}/F^{0}_{\mu} \sim 1/2$) from cosmologically distant GRBs. 2\. Because of neutrino oscillations, this ratio can be greatly enhanced. In the context of three flavor neutrino mixing scheme which can accommodate the oscillation solutions to solar and atmospheric neutrino deficits in terms of oscillations between three active neutrinos, the final down ward going ratio of fluxes of high energy cosmic neutrinos on earth is $F_{e}\sim F_{\mu}\sim F_{\tau} \sim F^{0}_{e}$, essentially irrespective of the oscillation solution to solar neutrino problem. The (vacuum) flavor oscillations leads to an essentially energy independent flux of high energy neutrinos of all flavors originating from cosmologically distant GRBs at the level of electron neutrino flux, whereas spin-flavor precessions/conversions may lead to an energy dependence or/and change in this situation. The spin-flavor conversions may occur possibly through several mechanisms. We have discussed in some detail mainly the spin-flavor precession/conversion situation induced by a non zero neutrino magnetic moment and by a relatively small VEP as an example to point out the possibility of obtaining some what higher tau neutrino fluxes as compared to no oscillations/conversions scenarios from GRBs. The matter density in the vicinity of GRB is quite small (up to 4$-$5 orders of magnitude) to induce any resonant flavor/spin-flavor neutrino conversion due to normal matter effects. We have pointed out that a resonant character in the neutrino spin-flavor conversions may nevertheless be obtained due to possible VEP. The corresponding degree of VEP may be $\sim \, (10^{-35}-10^{-25}$) depending on $\delta m^{2}$ value for vanishing gravity mixing angle. 3\. This enhancement in high energy cosmic tau neutrino flux may lead to the possibility of its detection in km$^{2}$ surface area high energy neutrino telescopes. For $2\times 10^{6}\leq E$/GeV $\leq 2\times 10^{7}$, the down ward going high energy cosmic tau neutrinos may produce a double shower signature because of charged current deep inelastic scattering followed by a subsequent hadronic decay of associated tau lepton The double shower event rate for intrinsic (no oscillations/conversions) high energy tau neutrinos originating from GRBs turns out to be small as compared to that due to precession/conversion effects up to a factor of $\sim \, 10^{-5}$. Thus, the high energy neutrino telescopes may possibly provide useful upper bounds on intrinsic properties of neutrinos such as mass, mixing and magnetic moment, etc.. The relevant tau neutrino energy range for detection in km$^{2}$ surface area under water/ice neutrino telescopes may be $2\times 10^{6} {\buildrel < \over {_{\sim}}}\, E/\mbox {GeV}\, {\buildrel < \over {_{\sim}}} \, 2\times 10^{7}$ through characteristic contained but separable double shower events. Observationally, the high energy $\nu_{\tau}$ burst from a GRB may possibly be [correlated]{} to the corresponding gamma-ray burst/highest energy cosmic rays (if both have common origin) in time and in direction thus raising the possibility of its detection. If the range of neutrino mixing parameters pointed out in this study is realized terrestially/extraterrestially then a relatively large (energy dependent) $\nu_{\tau}$ flux from GRBs is expected as compared to no oscillation/conversion scenario. #### Acknowledgments. {#acknowledgments. .unnumbered} The author thanks Japan Society for the Promotion of Science for financial support. E. Waxman and J. Bahcall, Phys. Rev. Lett. 78 (1997) 2292 ; Phys. Rev. D 59 (1999) 023002. For a recent review, see, E. Waxman, astro-ph/9911395. For a recent review, see, for instance, T. Piran, Nucl. Phys. B (Proc. Suppl.) 70 (1999) 431 and references cited therein. For a latest discussion, see, P. Meszaros, astro-ph/9904038; T. Piran, astro-ph/9907392. B. Paczyński and G. Xu, Ap. J 427 (1994) 708. A somewhat detailed numerical study supports this order of magnitude estimate, H. Athar, R. A. Vázquez and E. Zas (to be submitted). See, for instance, L. Moscoso, in Proc. [Sixth International Workshop on Topics in Astroparticle and Underground Physics]{} (TAUP 99), September 1999, Paris, France (to be published, edited by M. Froissart, J. Dumarchez and D. Vignaud) \[preprint DAPNIA-SPP-00-01 (Jan 2000)\]. T. J. Weiler et al., hep-ph/9411432; F. Halzen and G. Jaczko, Phys. Rev. D 54 (1996) 2779. J. G. Learned and S. Pakvasa, Astropart. Phys. 3 (1995) 267. F. Halzen and D. Saltzberg, Phys. Rev. Lett. 81 (1998) 4305. See also, S. Bottai and F. Becattini, in Proc. [26th International Cosmic Ray Conference]{}, Salt Lake City, Utah, 17-25 August, 1999, edited by D. Kieda, M. Salamon and B. Dingus, Vol.2, p. 249; S. Iyer, M. H. Reno and I. Sarcevic, hep-ph/9909393. See, for instance, P. Mészáros, P. Laguna and M. J. Rees, Ap. J 415 (1993) 181. Ta-Pei Cheng and Ling-Fong Li, in [Gauge theory of elementary particle physics]{} (Claredon press, Oxford, 1984). C. Caso et al., The Euro. Phys. J. C 3 (1998) 103. See, for instance, E. Lisi, in [New Era in Neutrino Physics]{}, Proceedings of the Satellite Symposium after Neutrino 98, Tokyo, Japan, edited by H. Minakata and O. Yasuda, p. 153. N. Cabibbo, Phys. Lett. B 72 (1978) 333. M. Gasperini, Phys. Rev. D 38 (1988) 2635; D 39 (1989) 3606. For an independent similar possibility of testing VEP by neutrinos, see, A. Halprin and C. N. Leung, Phys. Rev. Lett. 67 (1991) 1833. See, for instance, E. Kh. Akhmedov, S. T. Petcov and A. Yu. Smirnov, Phys. Rev. D 48 (1993) 2167. For details in the context of AGNs, see, H. Minakata and A. Yu. Smirnov, Phys. Rev. D 54 (1996) 3698. G. G. Raffelt, Phys. Rev. Lett. 64 (1990) 2856. For a recent up date in the context of sun, see, M. M. Guzzo and H. Nunokawa, Astropart. Phys. 12 (1999) 87, whereas in the context of supernovae, see, for instance, Athar Husain, in Proc. [New Worlds in Astroparticle Physics]{}, Eds. A. Mourão, M. Pimento and P. Sá, World Scientific Pub., Singapore, p. 244 (hep-ph/9902222). Athar Husain, Nucl. Phys. B (Proc. Suppl.) 76 (1999) 419 and references cited therein. For a recent analysis, see, G. L. Fogli et al., Phys. Rev. D 60 (1999) 053006 and references cited therein. C.-S. Lim and W. J. Marciano, Phys. Rev. D 37 (1988) 1368; E. Kh. Akhmedov, Sov. J. Nucl. Phys. 48 (1988) 382; Phys. Lett. B 213 (1988) 64. See, C. W. Kim and A. Pevsner, in [Neutrinos in Physics and Astrophysics]{} (Harwood Academic Publishers, Switzerland, 1993). A. D. Martins, R. G. Roberts and W. J. Stirling, Phys. Lett. B 387 (1996) 419. R. Gandhi, C. Quigg, M. H. Reno and I. Sarcevic, Astropart. Phys. 5 (1996) 81; Phys. Rev. D 58 (1998) 093009. H. Athar, G. Parente and E. Zas (to be submitted). See also scanned transperacies by Athar Husain at URL http://taup99.in2p3.fr/TAUP99/; hep-ph/9912417. ---------------------------------------------------------------- ------------------- ------------------- ------------------------------ [Energy Interval]{} [no osc]{} [vac osc]{} [spin-flavor precession]{} $2\times 10^{6}{\buildrel < \over {_{\sim}}}\, E/\mbox {GeV}\, $10^{-6}$ $1\times 10^{-1}$ $0.5\times 10^{-1}$ {\buildrel < \over {_{\sim}}} \, 5\times 10^{6}$ $5\times 10^{6}{\buildrel < \over {_{\sim}}}\, E/\mbox {GeV}\, $2\times 10^{-7}$ $2\times 10^{-2}$ $10^{-2}$ {\buildrel < \over {_{\sim}}} \, 7\times 10^{6}$ $7\times 10^{6}{\buildrel < \over {_{\sim}}}\, E/\mbox {GeV}\, $2\times 10^{-7}$ $2\times 10^{-2}$ $10^{-2}$ {\buildrel < \over {_{\sim}}} \, 1\times 10^{7}$ $1\times 10^{7}{\buildrel < \over {_{\sim}}}\, E/\mbox {GeV}\, $2\times 10^{-7}$ $2\times 10^{-2}$ $10^{-2}$ {\buildrel < \over {_{\sim}}} \, 2\times 10^{7}$ ---------------------------------------------------------------- ------------------- ------------------- ------------------------------ : Event rate (yr$^{-1}$sr$^{-1}$) for down word going high energy tau neutrino induced contained but separable double showers connected by a $\mu-$ like track in various energy bins using MRS 96 R$_{1}$ parton distributions. For spin-flavor precessions, we use $\delta m^{2}\, {\buildrel < \over {_{\sim}}}\, 10^{-9}$ eV$^{2}$ and $\mu \, \sim 10^{-12}\mu_{B}$ \[see Eq. (\[Pdeltaf0\]) in the text\], whereas for vacuum flavor oscillations, we used Eq. (\[falpha\]). [^1]: From above discussion, it follows that $E$ dependent/independent spin-flavor precession may also be obtained for non zero $\Delta f$, however, given the current status of the high energy neutrino detection, for simplicity, we ignore these possibilities which tend to overlap with this case for a certain range of relevant neutrino mixing parameters; for details of these possibilities in the context of AGN, see [@athar].	{ "pile_set_name": "ArXiv" }
Regional variation in root dentinal tubule infection by Streptococcus gordonii. The purpose of this study was to investigate the pattern of bacterial invasion of dentinal tubules at different regions in human roots. Specimens were obtained from single-rooted teeth that had their root canals prepared in a standard manner. Roots were then sectioned longitudinally through the canals and the resulting specimens chemically treated to remove the smear layers. Specimens were immersed in a suspension of Streptococcus gordonii for 3 weeks and then prepared for histological analysis. Sections from the cervical, midroot, and apical areas were examined. The pattern of bacterial infection of the cervical and midroot areas was similar, characterized as a heavy infection with bacteria penetrating as deep as 200 microns. Invasion of the apical dentin was significantly different, with a mild infection and maximum penetration of 60 microns.	{ "pile_set_name": "PubMed Abstracts" }
The invention relates to an operating device for an electrical appliance, preferably an electrical heating appliance such as a cooker. DE 198 59 105 discloses an operating device for an electrical appliance having a type of magnetic sliding key. The sliding key is placed on a glass ceramic plate of a cooker and has a magnetic guide. By so-called keying, i.e. linear movements in different and in particular opposing directions, it is possible to release switching signals and therefore operate the electrical appliance. However, only a limited number of operating functions is possible. The problem of the invention is to provide an operating device for an electrical appliance permitting further extensions to operating functionalities. This problem is solved by an operating device having the features of claim 1. Advantageous and preferred developments of the invention form the subject matter of further claims and are described in greater detail hereinafter. By express reference the wording of the claims is made into part of the content of the description. According to the invention the operating device and in particular the entire operating means, which can in particular assume the complete operation of at least one functional unit of the electrical appliance, has an operating unit with a rotary toggle. A rotary toggle has the advantage that radial position signals can be very readily differentiated. On generating a position signal as a function of a specific rotation, in the case of several rotations of the rotary toggle a randomly large number of position signals can be generated. The rotary toggle is mounted so as to rotate on a bearing device forming part of the operating device. There are also signalling means with which, as a function of a position and/or a position change of the rotary toggle, signals can be generated. For processing said signals the operating device has a control mechanism. As a function thereof the electrical appliance or a functional unit thereof is influenced or controlled. According to the invention, in addition to a rotary movement, the rotary toggle is movably mounted in at least one direction in such a way that it can perform a linear movement. For this purpose further signalling means are provided for detecting the linear movement of the rotary toggle and which can be converted into signals for the control mechanism. Thus, a combined rotary-sliding toggle for operating an electrical appliance is created. It is advantageously possible by a linear or sliding movement in a specific direction to make a specific choice for a power scale or the like. This power scale can then be adjusted by a subsequent rotary movement. It is also possible by means of a rotary movement to pass or leaf through a menu. With a corresponding linear movement it is then possible to jump into a submenu or to perform a selection or confirmation. According to a further development of the invention, the bearing device can be constructed in such a way that the operating unit is removably fixed to a cover of the electrical appliance. For this purpose a holding power is provided, which is preferably non-contacting or has an external power effect. Advantageously use is e.g. made of holding magnets, which can be provided in the bearing device and/or on the electrical appliance cover. With such a construction it is possible to remove the operating unit, e.g. for safety reasons. This also makes it possible to operate several electrical appliances with the same operating unit. The rotary toggle can be rotated about a rotation axis and in particular a single rotation axis. A linear movement advantageously takes place substantially radially thereto. In particular, the bearing device is constructed in such a way that the rotary toggle is automatically reset following the performance of a linear movement or following release. As a result the rotary toggle more particularly and in particular exclusively can perform the rotary operation in one position, which is advantageously a middle or normal position. In a particularly preferred development of the invention not only is the operating unit constructed so as to be removable from the cover, but this also applies to at least most of the bearing device. It is possible for the rotary toggle and bearing device to form a constructional unit or a separate operating unit. The latter can be fixed in different ways to a cover or the like of an electrical appliance and held there. It is merely necessary to either place the signalling means on the cover or, if they are also provided in the operating unit, to have a signal transmission from the operating unit to the electrical appliance. This can make it possible to bring about a simpler construction of the electrical appliance. The operating functionalities together with the detection of position signals are completely present in the operating device. The bearing device can have a type of base plate or case, which can be fixed or engaged on the cover. The base plate is preferably fixed to the cover by external power action, which can be magnetically. According to a further development of the invention it is possible for the rotary toggle to perform the linear movement relative to a base plate or mounting support of the bearing device. Alternatively or additionally it is possible for the rotary toggle and base plate to perform a linear movement with respect to the cover. Thus, the linear movement of the rotary toggle can take place either with respect to the base plate or, together with said base plate, with respect to the cover. A guidance of the linear movement and in particular also the rotary movement can take place advantageously in contact-free manner by external power action, such as by magnetic power or force. Thus, such a guidance involves a certain expenditure. However, it has the advantage of being free from wear and of permitting a closed surface of the cover. Alternatively it is possible for certain variants of the invention to have guidance by mechanical guidance means. Part of the signalling means are advantageously provided in the rotary toggle and can be a functional half of signalling means comprising at least two cooperating parts. Advantageously the signalling means or the other functional half of the signalling means can be located on the bearing device or on a base plate of the latter. It is also possible to provide the signalling means or the other functional half thereof below the cover. Rotary and linear movements can be detected by said signalling means. According to a further development of the invention the operating unit can contain display means making it possible to display optical effects, operating parameters or settings. For this purpose lighting means can be provided on a display in order to draw the attention of the observer thereto. In an embodiment of the invention a display can be provided in the rotary toggle. As the latter can be removed from the electrical appliance and is to have no electric lines or connections, the power transmission for the display means can have a transformer-like construction. For this purpose corresponding coils can be provided on the cover, as well as the rotary toggle or bearing device. The signalling means can also have position determining means with which it is possible to determine a position, preferably also the rotation angle position of the rotary toggle relative to a reference point or dead centre of the cover. For this purpose they can have, particularly as in each case one functional half of the signalling means, at least one signalling or signal magnet and at least one magnetic field sensor or Hall sensor. Advantageously there are several magnetic field sensors, which can in each case detect one position change of a signalling magnet. The magnetic field sensors are advantageously located in the movement path of the rotary toggle or the corresponding signalling magnets. To permit a clear detection of an operation of the rotary toggle as a linear operation, but so that it is appropriate for use, not too complicated or costly and can be readily detected, up to the release of a signal or up to a stop member, it should be shorter than the radius of the rotary toggle or the extension of the latter in the operating direction. This makes it possible to leave the dead centre of the rotary toggle, which is advantageously used as the point predetermining the linear operation, within the extension of the rotary toggle in the inoperative position. These and further features can be gathered from the claims, description and drawings and the individual features, both singly and in the form of subcombinations, can be implemented in an embodiment of the invention and in other fields and can represent advantageous, independently protectable constructions for which protection is claimed here. The subdivision of the application into individual sections and the subheadings in no way restricts the general validity of the statements made thereunder.	{ "pile_set_name": "USPTO Backgrounds" }
Q: Motorola Defy Plus - Apps are automatically closing few minutes after screen switches off This is driving me crazy. I just bought a new Motorola Defy Plus (MB526) this week and plugged in a 16 GB SD card to it. Like the features it offered like Moto-Blur and all that. So after 2 days of use I dumped some songs to listen while traveling to office. I started the playlist (in Connected Music Player,i.e., the stock music player provided in defy plus) to listen to music. But after 30 seconds or so phone goes to standby and song continues. But before song duration is complete, the sound shuts off. If I check the phone there is no app running. I tried listening to radio, and it was same thing with radio as well. I thought it was some sleep timer problem in music player, but I did not find any settings to do so. I browsed for solution in many places in Internet. But could not find solution. I found similar problem for Android v2.2. But my phone has Android v2.3.6. In between I tried using other apps such as Live 365 and Remote for VLC. Live 365 felt like it ran for little longer but even that closed too. Same problem persisted for Remote for VLC also, i.e., it's active for a while. After 5-7 minutes or so the app has closed completely. Can I solve this problem by enabling Factory Reset? If I reset using that, I know that apps I installed will go away, and that is not a problem with me. But will the stock apps provided by Motorola go away too? Sometimes I found the irritating Voice Command(I dont know what is called exactly, maybe - Listen app) window popping up. How should I turn that off? A: Go to task manager icon from round lighted main icon at bottom center of phone. Once task manger is running , click on auto end list and remove your connect music app or any other app that plays music. Thats it. Also notice before you do the operatino above that musics would stops playing after about 2 minutes. Because that is the default setting for the auto end list in the task manager app.	{ "pile_set_name": "StackExchange" }
At dinner with Bob one night, I averred that I’m low maintenance. He regarded me skeptically. “What?” I said. “You think I’m high maintenance? You think this [thumping two flattened hands against my chest] is high maintenance?” He didn’t answer, but I presume he was thinking something like what Billy Crystal’s Harry said to Meg Ryan’s Sally in When Harry Met Sally: Harry: There are two kinds of women: high maintenance and low maintenance.Sally: Which one am I?Harry: You’re the worst kind. You’re high maintenance but you think you’re low maintenance. What does “high maintenance” even mean? It’s subjective, but here’s what I think: A high-maintenance woman can’t go out until she’s finished her beauty routine, which takes a half hour or more. She has manicures, pedicures, and various parts of her body waxed. A high-maintenance woman wants you to guess at her highly particular needs and pouts when you don’t get it right. She expects the world to revolve around satisfying those needs. She’s difficult to please. She requires a lot of attention. Let’s look at the evidence and see if Bob was on to something. Item 1: I’ve had one manicure—for my wedding. I do like hot wax, but only when poured off a candle onto my skin. (The pleasure of peeling it off it is worth the moment of pain.) I haven’t used wax for cosmetic purposes, though no doubt many will argue I should. At a party, I was the only woman out of 30 who had never had a pedicure. The guys I date use more personal care products than I do. Items 2 and 3: I don’t like asking for anything from anyone. I sure don’t want people running around in the dark trying to figure out what I want. Item 4: You could argue that I’m difficult to please. I would say I’m selective. It’s true that the chance of pleasing me is low unless I’ve made the plans or I’m with someone simpatico. But I’ll go along with someone else’s plans (within reason), and make a sincere effort to enjoy myself. So in this regard, I’m theoretically high maintenance but on a practical basis I’m low maintenance. Item 5: I might be accused of requiring a lot of attention. Surely that was what Bob was getting at when he gave me that look. In fact, I don’t require much attention. What I require is enough attention, which varies with each guy. Jonathan never called me two days in a row or the day after seeing me. Dale called me every day, without fail. Mike’s contact was sporadic, but he’d never go two days in a row without some form of contact. Gary called every night between 10 and 10:15. I was never the one to set the parameters, and I was fine with all of it. In terms of maintenance, all I need is to know the guy is thinking of me. And as long as he’s consistent, I have no reason to think he isn’t or that his feelings have changed. For example, Gary wanted to eliminate the nightly call, and that made me feel insecure, because what he was really saying was that daily contact had become a chore. He also wanted freedom; calling me every night was the antithesis of that. I was right to feel as I did: it signaled the beginning of the end. For months, Bob contacted me throughout the day—by e-mail, text, or IM. When he was walking to the train after work, he’d snap a picture and send it to me or tell me which train he caught. He shared the mundane details of his day with me, and I responded in kind. The communication was essentially constant, in both directions. And then suddenly it changed. He said he was just busy, but I honestly could not understand how he could be so busy that he couldn’t take one minute to text when he did so readily before. I let him know it bothered me, and thus the look: if I needed contact all day, every day, I must be high maintenance. Do I need that much attention? Unequivocally, no. But I don’t respond well to the withdrawal of attention I’ve come to expect. It seems to mean something, and so far I’m two for two that it does. Wanting reassurance that everything is all right in the face of quantifiable evidence that it’s not isn’t high maintenance. Search the web Custom Search BetsyG likes to write even more than she likes to talk. Her essays have been published in the Boston Globe Magazine. She has children who would be horrified to be associated with her and her blogazine. BetsyG is a happy divorcée and, suffering from a bad case of arrested development, has no idea how old she really is; her deluded belief is that she's your age, whatever it may be.	{ "pile_set_name": "Pile-CC" }
Cross-sensitivity in a child with anticonvulsant hypersensitivity syndrome. We describe a fulminant picture of anticonvulsant hypersensitivity syndrome (AHS) and the possible role of nitrazepam. A 5-month-old boy developed fever and rash after the use of phenobarbitone. Allergy to phenobarbitone was suspected. Nitrazepam was substituted for seizure control. Over the next few days he progressively collapsed with fever, facial oedema and multi-organ involvement. The diagnosis of AHS was delayed because nitrazepam has not been implicated in the development of cross-sensitivity. AHS is a severe multi-organ reaction to aromatic anti-epileptic drugs. It has been thought to occur as a consequence of pre-existing pharmacogenetic and immunologic abnormalities. Careful selection of anti-epileptic drugs is essential as cross-sensitivity is common. Intermittent benzodiazepines have been recommended in managing breakthrough seizures in AHS. However, the structure of benzodiazepines contains aromatic rings and potential cross-reactivity cannot be totally ignored. Although we do not have direct proof, we believe that nitrazepam prolonged the clinical course.	{ "pile_set_name": "PubMed Abstracts" }
System architectures that provide a solution by dividing a problem set into a number of smaller parts and processing the collection of parts in parallel at respective nodes have become increasingly common. Such distributed systems have come to represent an increasingly effective means of approaching complex problems due to a number of trends, including but not limited to improvements in parallel processing algorithms, the availability of low-cost power-efficient computing nodes, and the availability of high-bandwidth interconnect fabrics. Distributed system approaches are now used in a number of problem domains, including the processing of complex database queries, machine learning and other artificial intelligence algorithms, and so on. Overall system performance in such distributed systems may depend upon a number of factors such as the number of processing nodes, each node's performance capability, the scalability of the parallel processing algorithms, the amount of node intercommunication required, and the performance of the interconnect fabric or fabrics to which the nodes are attached. Some applications nay require considerable communication between nodes (at least during certain phases of an application), making the interconnect fabric performance an important factor in overall performance. Given this, the architecture of the interconnect fabric may represent a major part of the total system design. Ideally, at least for some applications, distributed systems would employ an all-to-all interconnect such that each node has a dedicated link to every other node in the system. However, in practice, this type of implementation may not scale as the number of nodes increases. Power, cost, size, and hardware/software complexity constraints may tend to make the all-to-all interconnect approach infeasible. Consequently, distributed systems containing hundreds or thousands of nodes may often employ a hierarchical interconnect architecture. In such an approach, some number of links in the fabric may have to handle traffic associated with multiple nodes. Such shared links may not be able to sustain the amount of traffic that could potentially be generated if all of the multiple nodes operated at their maximum traffic-generating capacity. In a well-balanced distributed system, the probability of overloading a shared link in this manner may typically be low, although such overload situations may nevertheless occur occasionally. Depending on the traffic management algorithms employed at the distributed system, data movement between application-layer components may be slowed substantially during such situations. As a result, overall application performance may be substantially degraded, especially in scenarios in which multiple nodes transmit traffic based on greedy approaches (e.g., approaches which consume as much bandwidth as permitted by the protocols in use).	{ "pile_set_name": "USPTO Backgrounds" }
Pre-school activities Exotic Creatures Concepts: Habitat, Fauna, FloraDid you know there are many plants and animals running loose around the Museum? What are they like? Will they be the same as those we are used to? Why can we find some but not others? Let’s try and discover them in this adventure… Many of them are well hidden… you need to search hard to hear and feel them. A visit-game that includes a discovery kit complete with magnifying glass, rulers, pictures, plans and maps to best explore the Museum… Treasure Chest Concepts: Collection, Museum, Heritage What is a museum? A treasure chest? A place to store objects of great worth? And a collection? How long does it take to build up? The visit begins with an empty chest and a large and diverse set of objects (including instruments, snuff boxes, replicas, images, clothes, props, etc.) words and emotions… Slowly, the chest gets filled with objects of great value to become a veritable treasure chest. Every Mask Tells a TaleConcepts: Narratives, Story Telling, CreativityOnce upon a time… a happy and charming gentleman or perhaps… a courageous monster wanting to destroy the demons surrounding his people! Come and help us tell the stories hidden behind the masks or invent totally new ones. This visit– game is based on the mask collection that, with a touch of magic, emerges out of the display cases. Shadow Theatre Concepts: Theatre, Narrative, History Three gongs, the curtain rises and the actors emerge: through their voices we learn of various countries and end this voyage in a small shadow theatre where we discover all about the secrets and mysteries of each puppet…	{ "pile_set_name": "Pile-CC" }
The several time-bound effects of prestimulation on the human startle reflex offer the possibility that different levels of neural processing may be distinguished and may elucidate the nature of changes occurring in early development. The first approach will be to determine the age at which effects ascribable to a short-time processing system can be demonstrated. This will involve manipulating duration, rise time, and spectral composition of startle and of lead stimuli and measuring the effects on primary and secondary components of startle. The second approach will be to determine whether facilitatory effects, presumed to depend on the classical activation system mediated via brain core mechanisms, are present at birth and are modulated with increasing age and cortical maturation. The third approach will investigate the development of effects presumed to depend on orienting-attentional processes.	{ "pile_set_name": "NIH ExPorter" }
Senator Murray says will support Iran nuclear deal WASHINGTON (Reuters) - Patty Murray, a senior member of the U.S. Senate, on Tuesday added her name to the list of Democrats who say they will support the Iran nuclear deal reached between world powers and Tehran in July. "I will be voting to support the agreement to prevent Iran from developing a nuclear weapon. I will vote against the resolution of disapproval, and, if needed, I will vote against overriding President (Barack) Obama's veto," Murray said in a statement. With Murray's announcement, at least 29 Democrats have publicly stated their support, only five short of the 34 needed to sustain an Obama veto of any disapproval resolution.	{ "pile_set_name": "Pile-CC" }
--- title: DocDB performance enhancements to RocksDB headerTitle: Performance linkTitle: Performance description: Learn how DocDB enhances RocksDB for scale and performance. aliases: - /latest/architecture/concepts/docdb/performance/ menu: latest: identifier: docdb-performance parent: docdb weight: 1148 isTocNested: true showAsideToc: true --- DocDB uses a highly customized version of [RocksDB](http://rocksdb.org/), a log-structured merge tree (LSM) based key-value store. ![DocDB Document Storage Layer](/images/architecture/docdb-rocksdb.png) A number of enhancements or customizations were done to RocksDB in order to achieve scalability and performance. These are described below. ## Enhancements to RocksDB ### Efficiently model documents To implement a flexible data model—such as a row (comprising of columns), or collections types (such as list, map, set) with arbitrary nesting—on top of a key-value store, but, more importantly, to implement efficient operations on this data model such as: * fine-grained updates to a part of the row or collection without incurring a read-modify-write penalty of the entire row or collection * deleting/overwriting a row or collection/object at an arbitrary nesting level without incurring a read penalty to determine what specific set of KVs need to be deleted * enforcing row/object level TTL based expiration A tighter coupling into the “read/compaction” layers of the underlying RocksDB key-value store is needed. Yugabyte uses RocksDB as an append-only store and operations, such as row or collection delete, are modeled as an insert of a special “delete marker”. This allows deleting an entire subdocument efficiently by just adding one key-value pair to RocksDB. Read hooks automatically recognize these markers and suppress expired data. Expired values within the subdocument are cleaned up/garbage collected by our customized compaction hooks. ### Raft vs RocksDB WAL logs DocDB uses Raft for replication. Changes to the distributed system are already recorded or journaled as part of Raft logs. When a change is accepted by a majority of peers, it is applied to each tablet peer’s DocDB, but the additional WAL mechanism in RocksDB (under DocDB) is unnecessary and adds overhead. For correctness, in addition to disabling the WAL mechanism in RocksDB, YugabyteDB tracks the Raft “sequence id” up to which data has been flushed from RocksDB’s memtables to SSTable files. This ensures that we can correctly garbage collect the Raft WAL logs as well as replay the minimal number of records from Raft WAL logs on a server crash or restart. ### MVCC at a higher layer Multi-version concurrency control (MVCC) in DocDB is done at a higher layer, and does not use the MVCC mechanism of RocksDB. The mutations to records in the system are versioned using hybrid-timestamps maintained at the YBase layer. As a result, the notion of MVCC as implemented in a vanilla RocksDB (using sequence IDs) is not necessary and only adds overhead. YugabyteDB does not use RocksDB’s sequence IDs, and instead uses hybrid-timestamps that are part of the encoded key to implement MVCC. ### Backups and snapshots These need to be higher level operations that take into consideration data in DocDB as well as in the Raft logs to get a consistent cut of the state of the system. ## Data model aware Bloom filters The keys stored by DocDB in RocksDB consist of a number of components, where the first component is a "document key", followed by a few scalar components, and finally followed by a timestamp (sorted in reverse order). The bloom filter needs to be aware of what components of the key need be added to the bloom so that only the relevant SSTable files in the LSM store are looked up during a read operation. In a traditional KV store, range scans do not make use of bloom filters because exact keys that fall in the range are unknown. However, we have implemented a data-model aware bloom filter, where range scans within keys that share the same hash component can also benefit from Bloom filters. For example, a scan to get all the columns within row or all the elements of a collection can also benefit from bloom filters. ## Range query optimizations The ordered (or range) components of the compound-keys in DocDB frequently have a natural order. For example, it may be an int that represents a message ID (for a messaging application) or a timestamp (for a IoT/time series use case). See example below. By keeping hints with each SSTable file in the LSM store about the minimum and maximum values for these components of the “key”, range queries can intelligently prune away the lookup of irrelevant SSTable files during the read operation. ```sql SELECT message_txt FROM messages WHERE user_id = 17 AND message_id > 50 AND message_id < 100; ``` Or, in the context of a time-series application: ```sql SELECT metric_value FROM metrics WHERE metric_name = ’system.cpu’ AND metric_timestamp < ? AND metric_timestamp > ? ``` ## Efficient memory usage There are two instances where memory usage across components in a manner that is global to the server yields benefits, as described below. ### Server-global block cache A shared block cache is used across the DocDB/RocksDB instances of all the tablets hosted by a YB-TServer. This maximizes the use of memory resources, and avoids creating silos of cache that each need to be sized accurately for different user tables. ### Server-global memstore limits While per-memstore flush sizes can be configured, in practice, because the number of memstores may change over time as users create new tables, or tablets of a table move between servers, we have enhanced the storage engine to enforce a global memstore threshold. When such a threshold is reached, selection of which memstore to flush takes into account what memstores carry the oldest records (determined using hybrid timestamps) and therefore are holding up Raft logs and preventing them from being garbage collected. ## Scan-resistant block cache We have enhanced RocksDB’s block cache to be scan resistant. The motivation was to prevent operations such as long-running scans (e.g., due to an occasional large query or background Spark jobs) from polluting the entire cache with poor quality data and wiping out useful/hot data.	{ "pile_set_name": "Github" }
Posts The net has modified our lives in limitless high-quality methods, but it has a darkish aspect. Personal privacy has been lost, leaving you at hazard from shady people, agencies and safety companies. But there are steps you could take to limit your exposure When Tim Berners-Lee changed into designing the technology that has transformed our international, he looked for a noun that would describe what he had in mind. The one he, in the end, settled on was “net,” that is how the sector huge internet was given its name. To its inventor, the noun has to have seemed flawlessly apposite: it defined the elaborate, natural linking of websites and pages that he had in mind. But “web” has other, metaphorical, connotations. Webs are matters that spiders weave with the intention of capturing prey. And if you need a metaphor for considering wherein we’re now with networked generation, here’s one to ponder. Imagine a big, global internet in which can be trapped upwards of billion flies. Most of these unlucky creatures don’t know – yet – that they’re trapped. After all, they wandered cheerfully, willingly, into the web. Some of them even consider that they could get away if they wanted to. We are the one’s insects. The simplest way of escaping our quandary is to give up the arena inside the way that Trappist clergymen as soon as did. Since we’re not going to try this, we need to face the truth: we’re trapped in a system in which the whole lot we do is monitored and logged and in which privateness is an element of the past. Everything which you do with cutting-edge communications equipment leaves a virtual path. And this path is accompanied assiduously no longer simply using giant groups, but also by way of governments and their protection offerings – as vividly illustrated by way of the revelations of Edward Snowden. What’s impressive is how unconcerned many people seem like about this. Is it because they are unaware of the volume and comprehensiveness of the surveillance? Or is it some weird manifestation of Stockholm syndrome – that odd condition in which prisoners showcase fine feelings towards their captors? What we’ve found out exceptionally from the Snowden leaks is that the size and functionality of the NSA surveillance are plenty greater than everybody imagined. Most people had assumed that maximum non-encrypted communications have been vulnerable and a few speculated that some encrypted communications (e.g., Skype) had a hidden backdoor for the NSA. But nobody realized that, because the modern day revelations showed, all of the encryption technology mechanically used to protect online transactions (https, SSL, VPN and 4G encryption), plus something going thru Google, Microsoft, Facebook, and Yahoo, have been cracked. What this means is that no shape of electronic, verbal exchange treated via business corporations can now be assumed to be at ease. In that feel, the NSA has genuinely fouled the nest of america net enterprise. And it is even suspected that about 90% of communications routed via the TOR community is the use of encryption which could additionally have been hacked by way of the NSA. What are you able to do in case you’re a person who feels uneasy approximately being stuck on this net? The sincere answer is that there is no comprehensive answer: if you are going to use telephones (cell or landline) and the net then you are going to leave a trail. But there are things you can do to make your communications less insecure and your path harder to observe. Here are ten ideas you might recollect. 1 Email Rethink your e mail setup. Assume that all “loose” e-mail and webmail offerings (Gmail and so on) are suspect. Be organized to pay for a provider, which includes FastMail, that isn’t based within the US – though some of its servers are in New York with backups in Norway. (My hunch is that greater non-US e-mail offerings will appear as marketers spot the business possibility created via the Snowden revelations.) It might also be worth checking that your agency has now not quietly outsourced its e mail and IT structures to Google or Microsoft – as many UK enterprises (including newspapers and universities) have. The real difficulty with e mail is that whilst there are methods of keeping the content of messages personal (see encryption), the “metadata” that goes with the message (the “envelope”, because it had been) can be very revealing, and there is no way of encrypting that because it’s needed with the aid of the net routing machine and is available to maximum safety offerings with out a warrant. 2 Encryption Encryption was the sole province of geeks and mathematicians. However, loads have modified in latest years. In specific, diverse publicly available gear have taken the rocket technological know-how out of encrypting (and decrypting) email and files. GPG for Mail, for example, is an open supply plug-in for the Apple Mail program that makes it smooth to encrypt, decrypt, signal and confirm emails the use of the OpenPGP fashionable. And for defensive files, more recent variations of Apple’s OS X operating device come with FileVault, an application that encrypts the hard drive of a computer. Those running Microsoft Windows have a similar application. This software will scramble your data, however, won’t defend you from authorities traumatic your encryption key under the Regulation of Investigatory Powers Act (2000), that’s why some aficionados propose TrueCrypt, a program with a few very thrilling facilities, which might have been useful to David Miranda. 3 Web browsing Since browsing is probably what internet customers do most, it is worth taking browser protection and privateness severely. If you are unhappy that your clickstream (the log of the web sites you go to) is in impact public property as some distance as the security offerings are involved, you may keep in mind the usage of freely to be had equipment which includes Tor Browser to obscure your clickstream. And to defend your self towards the amazingly brazen efforts by business companies to music your on-line behavior you have to, at the very minimal, configure your browser so that it repels many of those could-be boarders. 4 Cloud services The message of the Snowden revelations is that you should avoid all cloud services (Dropbox, cloud, Evernote, etc.) which might be based totally on the US, the UK, France and different jurisdictions are known to be tolerant of NSA-style snooping. Your operating assumption has to be that some thing stored on such systems is probably handy with the aid of others. And if you have to entrust statistics to them, ensure it is encrypted. 5 File storage and archiving An choice that increasing numbers of human beings are exploring is running their non-public cloud service the use of merchandise which includes PogoPlug and Transporter that provide Dropbox-kind facilities, however on internet connected drives that you very own and manipulate. And if you convey around private data on a USB stick, ensure it’s encrypted the usage of TrueCrypt. The net offers the visual art marketplace wonderful potential for boom and exchange. Currently, on-line sales make up simply 1.6% of overall worldwide sales. However, that is set to change. In the past couple of years, hundreds of thousands of dollars had been invested in online sales systems. In 2013 Artspace received $8.5m (£five.2m) of funding, Paddle8 obtained $6m (£3.6m) of investment – backers included Damien Hirst and Jay Jopling – and Amazon Art turned into release. A change in how art is sold has traditionally performed an essential function in the growth of the art marketplace. The salons helped expand the art market in the 19th century, the economic galleries inside the twentieth century and now the internet can assist increase the art market within the 21st. With an expanding artwork marketplace, we do not just see changes to how art is bought, however additionally modifications to what artwork is sold, why it is offered and via whom. Online sales systems are presenting some very exciting answers to these questions. The capacity of online art platforms to empower the general public as tastemaker is an instance of 1 such trade, one which has many effective outcomes: for the public, who could be capable of refining their decisions of artwork; for artists, who preference a level gambling subject; and for lifestyle, which turns into far greater consultant of all society, no longer simply the curator instructions. The internet is a first rate opportunity for rising artists and customers to enter the visual art marketplace and shape its improvement. Social media, art income systems, and person web sites – all of them provide some thing one-of-a-kind. Here are 5 top hints to help artists get commenced in the new and unexpectedly expanding online visual art market. Don’t confuse networking systems with sales structures Online income structures are designed to generate new sales from new customers, while man or woman artist websites and social media platforms are critical networking equipment, designed to assist manipulate existing customers. Social media is hardly ever considered an outlet for the purchase of artwork, and the web sites of individual artists are getting an increasing number of inconspicuous on the internet. Keep running with the traditional offline art market Never undercut mounted gallery marketplace prices on-line and do not use the net to dump inferior work. Online activities aren’t an opportunity income tool, however, an additional sales tool to complement and assist companies offline. Be proactive and spread your options Join an expansion of various on-line income systems. They provide awesome comfort and choice to art shoppers, just like artwork festivals, however they all function slightly differently and so appeal to distinctive art shoppers for distinctive reasons. Saatchi Online takes the concept of a gallery online, Axisweb presents a notable enterprise networking tool, and Visual Art Trader – a domain that I founded – is a web artwork community that appeals to local audiences. There are masses to choose from, so shop around. Online sales will by no means replace head to head income According to a record by ArtTactic and Hiscox, The Online Art Trade 2013, of these, not shopping for art on line, 79% stated it turned into due to the fact they couldn’t inspect the paintings earlier than purchase. Continue to exhibit works of art in as many offline spaces as possible, along with your studio. You need to additionally assessment the interesting log, which suggests your whole history of posts and allows you to test who can see them. Similarly, you ought to look at your image albums and take a look at you are glad about the sharing settings for every album. In the future you can need to don’t forget to construct “lists” – subsets of buddies, which include near friends and own family, who you may want to percentage infant pix with, as opposed to every Tom, Dick, and Harriet. Also, do away with your private home deal with, telephone quantity, date of birth and every other statistics that could use to faux your identification. Similarly, you might need to delete or edit your “likes” and “groups” – the greater hackers recognize about you, the greater convincing a phishing email they could spam you with. Facebook apps often proportion your facts, so delete any you do not use or do not don’t forget to install. Finally, use the “view as” tool to test what the public or even a selected man or woman can see for your profile, retain to “edit” and modify to taste. If this all sounds rather tedious, you just might opt to completely delete your account. Remember you’re human in any case While an awful lot of the above are technical answers to save you you being hacked and scammed, hacking achieved well is the skill of tricking human beings, not computers, by way of preying on their gullibility, taking gain of our trust, greed or altruistic impulses. Human blunders continue to be the maximum in all likelihood purpose why you will get hacked. Keep facts detailed and updated There are no sales teams on the line to answer customers’ questions. Buyers need to rely upon the up-to-date and accurate information supplied by using the artist. In the ArtTactic and Hiscox document, ninety-two% of artwork consumers stated that the best of the artwork photograph and the statistics supplied on the website had been the maximum crucial factors when buying artwork online. Searching with ordinary sentences will only get you thus far – in case you want to find something a bit difficult turn to these advanced yet easy methods Search engines are quite true at finding what you’re looking for nowadays, however, now and then they nevertheless come up quick. For those activities, there are a few little-acknowledged tricks which are available on hand. So right here are some hints for better googling (because it’s the most popular seek engine) however many will work on other serps too. 1. Exact phrase Exact search Facebook Twitter Pinterest Exact search Photograph: Samuel Gibbs for the Guardian The handiest and best manner to search for something unique is to apply quote marks round a phrase or call to search for the ones actual words in that exact order. For example, searching for Joe Bloggs will display effects with each Joe and Bloggs but not always positioned sequentially. Searching for “Joe Bloggs” will surface best people who mainly have the name Joe Bloggs someplace on the page. The specific or explicit word seek may be very beneficial for with the exception of greater common however much less applicable results. A look for “Joe Bloggs” -denim will find consequences for Joe Bloggs, but it’s going to exclude those outcomes for the Joe Bloggs brand of jeans. 3. Either OR OR search Facebook Twitter Pinterest OR search for matters that might be one thing or every other. However, you don’t want both phrases to existing on an unmarried web page. Default textual content searches discover consequences with all of the words of the query. By using the OR term, you may search for one or another term, now not just all the phrases. OR searches can be beneficial for finding things which you’re no longer sure which period will be used from an acknowledged list. 4. Synonym search Synonym search Facebook Twitter Pinterest Sometimes it’s beneficial to look for a less specific period. If you’re not positive which period can be used you can use synonym search. Searching for plumbing ~university will carry up outcomes for plumbing from colleges as well as universities, for instance. Five. Search inside a domain Google site seek Facebook Twitter Pinterest Use Google to search a specific site. Photograph: The search engines like google of maximum web sites are negative. You can search using Google rather with the aid of the usage of the website or area limiter. 6. The strength of the asterisk Wildcard seek Like the blank tile in Scrabble, the asterisk works as a wild card within searches. It may be utilized in place of a missing phrase or part of a phrase, that is useful for finishing terms, however additionally when you’re trying to look for a much less definite article. A look for architect* will search for an architect, however additionally architectural, structure, architected, architecting and every other phrase which starts of evolved with the architect. 7. Searching among values Searching for something with a qualifier between levels is a good way of answering questions. For instance, in case you’re searching out the who were the British prime ministers between 1920 and 1950 a search the use of British top minister 1920.. 1950 will bring up effects with dates ranging among 1920 and 1950. That’s your search period accompanied using two full stops and an area. 8. Search for phrase within the body, name or URL of a web page entitled: search Facebook Twitter Pinterest in a title: Sometimes you simplest need to discover textual content either in the URL, body or name of a web page. Using the qualifier injury: will seek just inside the URL. The qualifier intext: will search in the frame, even as in title: will seek best within a web page name. For instance, entitle: review will convey up all the articles with “evaluation” in the web page identified. 10. Combine them combined search terms Facebook Twitter Pinterest Combine the phrases and modifiers for effective searches. Photograph: All these seek equipment may be mixed to slim down or expand searches. While some of them may be used only rarely, some along with specific word searches are beneficial in nearly all instances. As Google and different search engines enhance their understanding of the way human beings obviously type or say seek queries, these electricity equipment will in all likelihood grow to be less and much less useful – as a minimum that’s the goal that engines like google are running closer to – however that’s absolutely not the case in the interim. Approaches to forestall hackers: ‘I’ve been the sufferer of on line credit card fraud.’ Banks have to refund a purchase if he or she has been the victim of fraud until they can prove that the patron has acted “fraudulently” or been “grossly negligent.” As with any case of fraud, the matter is always decided on an individual basis. “Anecdotally, a consumer who has been a sufferer of a phishing scam through unwittingly providing a fraudster with their account information and passwords handiest to be later defrauded might be refunded,” explains Michelle Whiteman, spokesperson for the Payments Council, an industry body. “However, have been they to fall sufferer to the same fraud inside the future, after their bank had knowledgeable them about the way to live safe, it’s miles viable a next refund may not be so sincere. Under price services rules, the onus is on the price-provider provider to show that the customer became negligent, now not vice versa. Credit card safety is furnished under the Consumer Credit Act and gives similar protection.” Managing information may be a nightmare. Louise Kidney explains the way to make the excellent use of Twitter and RSS feeds Information overload is affecting increasingly of us, as we sign in for yet greater web sites which promise to change our running life/deliver us greater time to our households/do our jobs for us. No one tool can ever live up to such grandiose guarantees, no matter which tech luminary is endorsing the subsequent large issue, however, you could honestly save your self a few walking around circles with a chunk of savvy attention to detail and some preliminary time funding. Twitter The first criticism I regularly listen is that people keep lacking tweets on Twitter from people they’re very interested in, due to the fact they get lost inside the noise generated with the aid of other human beings they may be following. The first-rate way to remedy that is to set up lists, a service which Twitter has presented given that the start, however, few human beings appear to experience over. Instructions on the way to set them up may be observed on the Twitter internet site and may be pretty time eating. However, it is worth bothering with. Essentially, you may create a listing called News, upload all and sundry who tweets news inclusive of @bbcbreaking to the list, and then in case you most effective want to read tweets which contain information, you simply go to your listing on Twitter by means of going to http://twitter.Com/<yourtwitterusenamehere>/<yourlistnamehere> so if I desired to visit my information feed list and simplest see tweets from news source, I could visit http://twitter.Com/loulouk/reputable-news-feeds. Once you have installation your lists, you can upload new human beings to those lists as you cross. As an addendum to this, it is well worth noting that in case you use Tweetdeck, it’s far viable to create any range of columns primarily based on lists. The 2d grievance is that humans see hyperlinks in tweets they had to want to comply with. However, they’re analyzing Twitter of their lunch hour or all through a short wreck between conferences, and they don’t have enough time to follow the link and read a full article. After all, Twitter is meant to be quick, sharp messages. This is where the “Favourite” button comes into its very own. If you favored a tweet from each person, even someone you are not following, it can be recalled at any point by way of going to http://twitter.Com/<yourtwitterusernamehere>/favorites, so if I desired to view my favorites, I could go to http://twitter.Com/loulouk/favorites (Note america spelling of favorites). Once you understand approximately favoring tweets, it all of sudden turns into a lot less overwhelming to maintain up with the hyperlinks people share on Twitter. You can constantly come lower back to them later – days or even weeks later if necessary. Again, Tweetdeck offers the functionality of making a column based totally on your Favourites. If it is your activity to keep the music of what grassroots are questioning in addition to senior management, blogs can be splendid; however, if you frequently examine a number blogs every day or week, checking again manually to each weblog to peer if it has been updated is going to speedy put on skinny. This is wherein RSS may be your friend. RSS stands for Really Simple Syndication (a identify some might talk to the Trade Descriptions Act), however once understood it corrals all of your reads into one location, highlighting in ambitious new posts from all the blogs you comply with, which can be an actual time saver. There are guides to setting up your RSS reader all over the net. However, the BBC provides a specifically beneficial one in conjunction with a list of all their news feeds – it’s now not simply blogs that will let you RSS their content. So there you have it. Two smooth steps to getting the facts you need, while you want it. These are just multiple examples of the equipment to be had that will help you manage your information but if there’s a selected trouble you are experiencing with virtual facts, why not comment underneath, we will do our high-quality to assist. eight. Play YouTube in gradual motion There are many amusing hints and guidelines, or easter eggs, to be found on YouTube. For instance, the capacity to play arcade games within the viewer, but there may be additionally a trick this is surely beneficial: playing motion pictures in slow motion. It’s less difficult to spot yourself in the history of a TV vox pop that manner. It’s distinctly simple: simply keep down the gap bar, and the video will start playing at a slower speed, best regarding grabbing the appropriate screenshot of a specific moment (and here’s the way to do this on Mac and PC). You’re welcome. Nine. Twitter shortcuts Just as Photoshoppers understand that shortcuts are the cornerstone of productiveness, avid tweeters recognize that shortcuts are your pal. Did you know that urgent “n” will open up a brand new tweet communicate container (on native internet Twitter)? Or that you could without problems favorite a tweet through certainly urgent “f”? Here’s a list of Twitter shortcuts: Also: remember to continually area a full forestall earlier than @-mention when tweeting something you want to be seen in your timeline, and no longer just any other’s point of the movement. 10. Free yourself from distractions Finally, we all recognize how damn distracting the net is. You need to get on with paintings, however … Gchats … and Twitter … You don’t need to rip the ethernet cable from the computer, due to the fact you continue to want the internet in some capacity. So how to get around this? Luckily, there is software you could use to help. Cold Turkey, as an instance, can be downloaded and will prevent a consumer from traveling websites, but whitelist others. You may even lock certain web sites and programs on a timer placing to truely ensure you keep away from Facebook. Cold Turkey is loose, with a paid-for seasoned model. However, there are other productiveness programs, including self-control. You can discover a listing here. Write or Die Facebook Twitter Pinterest Write or Die – a high-quality device for productivity. Illustration: Screengrab Oh, and on a cut-off date and need to just get phrases on the web page? WriteOrDie can help. It will sound a massive alarm while you forestall typing, and in its maximum intense model, begin deleting your wor The internet. Probably the best invention ever (with apologies to the wheel). But are you using it efficaciously? Here are ten ways to enhance the level in emojis feature photo 1. Logging out of Facebook remotely Ever checked Facebook on a friend’s or family member’s device after which realized, with horror, which you forgot to sign off? Never fear, there’s a simple, however little known, way to log off of your profile remotely. Navigate to “settings” using the drop-down within the proper hand corner of your display screen, then “security,” then “when you’re logged in.” From this display screen, you may be able to close an open consultation, on whichever device it’s nevertheless jogging on. Sign up to the Media Briefing: information for the information-makers Read greater When looking to recall a particular quote, phrase, proverb or lyric, it’s often the case that we half of-remember, missing words or skewing them barely. A little recognized Google trick makes it a lot simpler to become aware of them. Putting an asterisk in a quoted sentence will indicate that a word is missing (replaced with the asterisk). This makes it much more likely that the precise period you are seeking out might be returned, as opposed to effects which just happen to include the alternative words or rest of the sentence. For instance: I need to perceive the Foals’ music Give It All through attempting to find the subsequent lyric: “all that stays are words inside the rain,” but permit’s say I didn’t pretty capture “phrases” or “rain.” If I were to just look for “all that stays are within the,” I might return seek effects on a band called All That Remains. If, however, I google “all that remains are * inside the *” (which include citation marks), the Foals tune can be again within the outcomes. Clever. Three. Twitter soft block Twitter has a quite precise function inside the mute button, which allows you to stay following an account but hides its tweets and retweets out of your timeline. It’s a remarkable way of essentially ridding a person out of your Twitter revel in without offending them through unfollowing. (People do no longer recognize while you mute them. To mute: click on at the cogwheel to the right of someone’s profile.) Mute feature This is what it would love if I muted my boss. However what you often really need is to mute someone from reading your tweets. Here there’s an unofficial alternative that can assist; it’s referred to as “the smooth block.” This is a sly method of forcing a person to unfollow you by way of blocking off and straight away unblocking them. Once they’re unfollowing, your tweets and retweets will not appear in their timeline. The desire is which you are less seen, and so drawing much less engagement from this man or woman. It’s a good manner to manipulate stalkers and those who continuously favorite your tweets and slide into your mentions at every possibility. If someone’s keen, however, they will likely be manually checking in on your profile and recognize, perplexed, that they may be no longer following. In this example, blocking – or a well-mannered phrase – is the most effective alternative. I simply performed my first soft block. These milestones Retweets four four likes Twitter Ads information and privateness four. Incognito home windows It’s traumatic how many humans don’t use incognito mode when browsing the internet. For all of us who does the sort of component like spend seven minutes at paintings finding out how celebrities from the Nineteen Eighties have elderly, this is a should. Pretty lots all major browsers offer Incognito or personal browsing mode; this means that a person’s preceding pastime will not be logged and saved in records. This isn’t simply, as people anticipate, for looking at specific or otherwise embarrassing content, however, can show beneficial while, for example, attempting to find the opposite half’s birthday present or looking on line for a guide for an difficulty you’d rather any individual didn’t stumble throughout for your browser history. Turning surfing records off does no longer make you nameless on the net Here’s the way to browse privately the usage of Chrome, Firefox, Safari and Internet Explorer. ISPs (internet provider companies) and websites themselves, however, will realize while a website has been visited – so don’t think non-public browsing makes you anonymous on the internet. It doesn’t. You’d want Tor for that. 5. Mute an electronic mail thread There’s no longer an awful lot greater demanding than an workplace electronic mail thread or a series mail you’d want you’d in no way opened. Luckily, there may be an easy way to such suffering. Email threads can, blissfully, thank you, Lord, be muted. Using Gmail, click on at the “more” tab at the pinnacle of the email, after which the mute choice. In Outlook, the mute function can be discovered thru the home tab (the feature is known as ignore in Outlook). Muted email threads can be unmuted ought to you ever want to (never) be a part of returned in. 6. Use emoji on computer web Of course any individual has devised an real IRL emoji keyboard (well, fourteen certainly, to healthy all the emoji in, assume giant blending table), however, how do you go about writing emoji quick and easily on computing device web? If you are wedded to Gchat for intraoffice banter and aren’t au fait with all of the top notch shortcuts to produce stupid animations, you’re in for a deal with. There are hints to produce animations for your personal enjoyment, or ones as a way to display up within the recipients’ chat. Type in the following shortcuts (in italics) and spot what occurs. Following some simple recommendations have to shield you from the subtly miserable affect of social media, preserving you each glad and effective He’s been in the workplace for a little too long cropped shot of a mature businessman strolling his neck anxiously at the same time as running in his city officers of the United Arab Emirates’s Ministry for Happiness will begin their schooling in happiness technology, a software designed for them by the University of California, Berkeley, and Oxford University. The UAE mounted its Happiness Ministry in February. In July, the government of Madhya Pradesh kingdom in India observed in shape. Typically, while governments set out to enhance their residents’ subjective well being, they gift the idea as a worth result in itself. That’s no longer to be sniffed at. But there may be some other facet to this pursuit. Plenty of evidence indicates that glad human beings are not most effective more healthy in the long run (and consequently less luxurious to the kingdom), but additionally higher worker bees. A simple test demonstrates this. When volunteers are requested to perform clean mathematical responsibilities over in return for a modest per-challenge fee, they do about 10% more work if they have just watched a couple of minutes of a comedy show. If they watch an uneventful video rather, or simply don’t locate the show uplifting, the effect isn’t there. Outside of the lab, software program programmers are higher at solving analytical issues while they’re happier. Putting plenty of employees collectively, personnel’ task satisfaction levels today can even predict a firm’s price on Wall Street 12 months down the street. An emotional support animal is just a mouse click on away Read extra Beyond these slim measures of productivity, there’s a set of broader societal benefits – public items – that waft from preserving citizens smiling. In Germany, as an instance, the 7% of the populace that offers blood doesn’t suit into any smooth demographic generalization. It isn’t disproportionately male or woman, employed or now not – or more or less knowledgeable. However, Germans who report feeling usually satisfied within the previous month are more likely to donate blood than folks that don’t. As enlightened governments figure all of this out and are seeking for to inspire happiness and its spin-off consequences, there’s as a minimum one apparent bump in the street: a countervailing fashion that isn’t making a mass-happiness introduction so easy. The power to elevate residents’ wellness is taking vicinity as human beings are shifting their communications from in-character conferences to ever greater online exchange. Probably the most important have a look at of its type, intended to evaluate the consequences of social media use on every body in Italy, makes for gloomy reading. It links spending time on social networking web sites with lower degrees of man or woman happiness, and more especially, with a lower level of preferred agree with in society. Long before released its marketing campaign against cyberbullying, even before Monika Lewinsky received a pummeling inside the late 1990s, there has been the true purpose to suspect that on-line groups would foster terrible vibes. Fifty years of research has underscored the belief that swapping written messages is an ineffective way to generate cooperation in struggle conditions. Face-to-face communication is inordinately better. This implies, of direction, that the online global can also already be playing nicer than it did some years ago, as social media structures have made it simpler for people to share video and audio material. Companies together with Facebook have cottoned on to the idea that they need to develop a whole host of smooth talents to foster online harmony. What is regularly neglected in discussions of social media malaise is that individuals, armed with the modern-day happiness research, can also expand smooth skills in their very own, to guard themselves against the subtly negative impacts of on line interaction. To that cease, here are a few tips to preserve your subjective well being notably buoyant. Upset? How to find a happier region using Twitter Read greater First, don’t worry approximately what number of on-line friends you’ve got. Whatever your personality type, age or profits, a look at of five,000 humans (and their friends) in Canada exhibits that doubling your number of actual-global pals has a huge impact on your happiness. Doubling your pals on social media has almost none. Second, keep away from passively scrolling through your Facebook feed. Doing so has been proven in experiments to make people experience low and green with envy as they consume the rose-tinted edits of they pals’ lives. Actively messaging and commenting on Facebook is a long way less probable to present you the blues. Third, in case you insist on scrolling thru your Facebook feed, educate your self to pay selective attention to updates from friends with whom you’re near in the offline global. Their posts are probably as biased as every body else’s, but analyzing them fosters an excellent kind of envy of the high-quality, self-motivating range. By comparison, consuming a glut of handy romance and unique adventure sports from remote friends is in all likelihood to conjure up a choice to tug others down. Finally, if you sense low, indulge in net cats, the YouTube content class with extra perspectives-in keeping with-video than every other. Research out of Indiana University finds that the extra humans watch internet cats, the extra they experience the experience. (And in case you get clearly into it, you can constantly visit the net cat film festival.) Based on their happiness measurements, the authors of that examine go up to now as to signify a position for Grumpy Cat and the permanently kitten-sized Lil Bub in puppy remedy, potentially in the location of the real element. “A two-timer, truly. I came right here; I relapsed, I came again,” he says. He first arrived in 2013. “The first few days upon getting right here are weird. It’s a model of bloodless turkey due to the fact you’ve been gaming around the clock and unexpectedly, not anything. I might sweat loads at night time and get headaches. I would lie on the mattress and flawlessly visualize the video games I could play. I changed into yearning them, I dreamt approximately them,” he says. Fulton, 22, grew up near Seattle and his father labored for Microsoft. His mother and father limited his access to a video games console, but as a youngster, Fulton saved up and purchased his very own. “I turned into socially awkward. In center school, I went through the complete identity crisis component, and in high faculty, I never had a girlfriend or some thing,” he remembers. Fulton thought his gaming become beneath manage till he went to university. There, he located he had no choice to meet new human beings. “I had a couple of friendships, I guess. However, I placed no power in and they fell aside,” he says. “I went to lessons before everything after which I simply started out watching YouTube motion pictures all the time, bullshitting around with message boards, the meme tradition, and gaming,” he says. He pretended to be unwell and the notion he might catch up with magnificence quickly sufficient until he turned into gaming until 1 AM, then 3 AM, 5 AM, 8 AM. He offered a case of Coca-Cola and stocked up on bread and Lunchables and, for three weeks, immersed himself online and left his room only to use the toilet. “I suppose I had two showers in that point and I wasn’t truly brushing my tooth,” he recollects. When a pupil eventually raised the alarm and Fulton, then 19, noticed a counselor, he become identified with mild depressive disorder. “They just stated: ‘Here’s a few Prozac.’ I felt terrible; I weighed 127lbs, I become frail and felt nauseated a lot. I desired to numb myself and break out, so I’d wander away in the sports myth world however then I might feel worse, so I’d want to numb greater – it feeds on itself,” he says. He had “a few sort of breakdown” and took off on a west coast road experience, to San Diego and returned, doing little more than riding and logging on in hotels. Once back, he was given a name from certainly one of his grandparents, inviting him spherical to observe their vacation pics. “I went, and my grandparents and my parents have been there after which my little sister confirmed up from school and she or he had this ordinary man with her was known as Scott. They said: ‘This is an intervention.’ An hour later this man was using me to restarting, and I stayed there for eight months,” he says. In that hour, his own family informed him the impact his gaming dependancy had had on them. “I simply sat there and stared on the ground and shut off from my emotions while they talked,” he says. His 17-yr-antique sister’s words did penetrate, but, and had been “difficult to listen.” “She said that growing up she felt like she didn’t have a brother and that I wasn’t going to be there while she graduated or got married.” Eight months later, things were searching higher. He turned into healthful and had observed support most of the recuperating game enthusiasts at reSTART. He went again to university. “Big mistake,” he says. He didn’t have his pc however he additionally didn’t have his new rehab buddies and became not as emotionally robust as he’d thought. At the net dependancy center in Fall City, Washington. At the reSTART middle, in Fall City, Washington He found a new manner to escape. After quaffing his roommate’s Nyquil and finding it delightfully numbing, he began taking big doses of the over-the-counter cough syrup with dextromethorphan, aka DXM, a cough suppressant. “They call it indexing or Robotripping,” he says, after the popular cough medication logo Robitussin. If you chug sufficient DXM, it gives an excessive much like combining booze, weed and slight acid, Fulton explains. Side results encompass stumbling approximately like a hallucinating robotic that’s blown a fuse, a frazzled serotonin system and an engulfing feel of dread. Then there were the messy tries to find a female friend. “It was given creepy, form of stalky. It becomes terrible,” he says. All came crashing down while he overdosed and changed into lurching around a grocery store with a knife, texting one of the girls he became captivated with and making plans to kill himself within the grocery aisle. The female referred to as 911 and Fulton changed into handcuffed and taken away in an ambulance, spending three days locked in a psychiatric facility. “My dad and mom stated: ‘We personal your medical health insurance, we very own your vehicle, we own your phone plan and we’ll take these away if you don’t visit rehab.’ I said no. They took them away, I became homeless for two weeks, couch-browsing, and then I called Scott,” he recollects. He first went to drug rehab, in which some addicts scoffed at his cough syrup and gaming troubles, then went lower back to restarting. He says he faced the cravings, “faced me” and ultimately struggled out of the cycle of despair and escapism. He then embarked on a nine-month nature direction, swapping an emotional wilderness for real, verdant, Pacific north-west outside the desert. These stories of oblivion are tough to reconcile with the assured individual, all trendy beard and forehead stud, now jovially wrangling the rehab men to head outdoor. Fulton gathers them to take a seat on logs around the fire pit. He starts patting his chest rhythmically and singing a campfire song about wolves, ravens and a grandmother’s desires. Some sing alongside enthusiastically, while the more moderen men mumble self-consciously. Kevin is looking at the ground, and his lips are barely moving. He can’t bring himself to sing however he’s patting his chest in unity. It’s a poignant scene. Fulton leads some exercises in meditation and nature recognition, naming the timber and the flora round them. Then the men spend an uproarious hour playing ballgames and a version of cover-and-are trying to find inside the woods, crawling round within the undergrowth, sticking ferns of their hair. There’s a whole lot of face-to-face chat, exuberant laughter, and dirt. At a cabin in the Washington state woods, the reSTART center allows residents withdraw from technology that has consumed their lives “I changed into gambling video games 14 or 15 hours a day, I had Netflix on a loop inside the history, and any time there was the tiniest destroy in any of that, I might be playing a game on my cellphone or sending lonely texts to ex-girlfriends,” Carpenter says. We are sitting in a small, plain condominium in a nondescript condo complex in Redmond, Washington, on the outskirts of Seattle. Marshall shares the home with other men in their 20s, all of whom have lately emerged from a unique net addiction rehab application known as reSTART Life. “I changed into basically dwelling on Dr. Pepper, which is filled with caffeine and sugar. I could get weak from not consuming, but I might only be aware it when I was given so shaky I stopped being capable of think and play nicely,” he adds. By then, he’d already needed to drop out of college in Michigan and had lost his sports activities scholarship. His new pals Charlie and Peter nod sagely. Charlie Bracke, 28, was suicidal and had lost his activity when he realized his on-line gaming become completely out of manipulating. He can’t keep in mind a time in his life before he becomes now not playing video games of a few type: he reckons he commenced while he became approximately 4 and became addicted to the aid of the age of 9. Marshall and Charlie at reSTART, an internet dependancy center. Marshall and Charlie at reSTART, For Peter, 31, who desired to withhold his last call, the low got here while he had been homeless for six months and turned into living in his vehicle. “I might stay in church parking lots and put sunshades up on the home windows and spend all day in my automobile on my pill device,” he says. He turned into hooked on net porn, masturbating six to 10 times a day, to the point where he becomes bleeding but could hold. When he wasn’t doing that, he becomes so immersed in the fable conflict game World of Warcraft that during his mind, he became not someone sitting at a display, but an avatar: the bold dwarvish hero Tarokalas, “shooting guns and assassinating the enemy” as he ran via a Tolkien-esque virtual realm. And when he wasn’t doing that, he would examine on line news reviews obsessively and exercise his political opinions and a hair-cause mood within the remark phase of The Economist, projecting himself pseudonymously as a swaggering blogger-cum-troll. “I changed into a virgin until I was 29. Then I had sex with a lap dancer at a strip membership. That’s some thing I in no way idea I would do,” he says. After completing the preliminary $25,000, 45-day residential degree at the principle “campus” a few miles away, customers circulate into the cheaper, off-website secondary segment. Here they get to the percentage a regular rental, at the situation that they keep with psychotherapy, attend Alcoholics Anonymous-fashion 12-step meetings, look for work and keep away from the net for at least six months. Marshall, Charlie, and Peter successfully completed the second segment and featured graduated from the reSTART software. However, they have selected to live inside the equal apartment complex and lease with other improving game enthusiasts as they preserve to reboot their lives. Mostly they carry simplest flip telephones and should visit the library when they need to test email. “I’m taking my life in six-month chunks at this degree. So a long way I haven’t relapsed into gaming and I’m feeling positive,” says Bracke. An dependancy overwhelmingly afflicting men A climbing wall at the principle ReStart campus, deep within the woods. Facebook Twitter Pinterest A hiking wall at the principle reSTART campus, deep within the woods. Nine miles east, down a dust tune off a country road that winds thru forests, six younger guys are sitting in a timber cabin amid a cluster of moss-draped timber – the reSTART campus. Spring sunshine is flooding via the home windows, and the handiest sounds are birds singing and the guys cracking their knuckles as they stare on the floor. They have lately arrived at rehab. Hilarie Cash, a psychotherapist and the leader medical officer at reSTART, asks the guys to start a verbal exchange exercising. Philip, 22, steps into the middle of the institution. He’s been right here for three weeks and is on a 12 months’ medical leave from Duke University upon getting hooked on Dota 2, the sequel to the delusion battle recreation Defense of the Ancients. He asks Adam, who most effective arrived four days in the past and is fidgeting awkwardly, to arise and face him. (The real names of those presently within the residential program were withheld.) Kevin, who has been here for four weeks, coaches them thru an exercising recognized in counseling circles because of the “listening cycle,” designed to facilitate emotional conversations in relationships. It’s a primary introduction for the brand new guy. Fears grow for kids addicted to online video games Read more Philip, who become underweight when he arrived, says to Adam, who is obese: “I’m concerned that you’re not eating healthily. I noticed you’ve been skipping dinner.” Adam is supposed to repeat returned to Philip what he heard him say the trouble is. He mumbles, slightly audible, and might seem to bear in mind what he’s just been told. He’s unable to cognizance, and the air is thick with reluctance and embarrassment. Stephen, some other novice, is observing on the ceiling, yawning, sighing, then searching mildly irritated. Alex, 20, comes to the rescue. He arrived at rehab in January, however, has popped lower back to visit the group and explains: “It’s so difficult at the beginning. Day one here, I become a destroy, and the primary two weeks I was backsliding.” His games of desire were The Legend of Zelda, a solo motion adventure series, in which “rather than being the depressed piece of shit I become in actual lifestyles” he could exist as a swashbuckling hero. Adapting to a tech-unfastened world based on the rural communal dwelling and social skills became a nightmare, he says. “I wouldn’t be a part of in in the beginning, and I got called out for it using the others.” Internet-of-matters gadgets are conceived through human beings who have assimilated services along with Uber, Airbnb and Apple Pay into their day to day lives, at a time while figures from the Washington DC-based Pew Research Center suggest that a big percentage of the population has never used or maybe heard of them. For the people who design these products, those services are regular, and so, through the years, they turn out to be normalized for anybody else. There are different challenges presented by using this way of interacting with networked facts. It’s hard, for example, for a user to determine whether or not the alternatives they’re being offered using a virtual assistant result from what the enterprise calls an “natural” go back – some thing that legitimately came up as the result of a search system – or from paid placement. But the principle hassle with the virtual assistant is that it fosters an technique to the world this is thoughtless, leaving users disinclined to take a seat out any prolonged frustration of preference, and ever less critical about the tactics that bring about gratification. Virtual assistants are listening to the entirety that transpires of their presence, and are doing so always. As voice-activated interfaces, they need to be constantly attentive to be able to hit upon while the “wake phrase” that rouses them is spoken. In this manner, they’re able to harvest statistics that might be used to refine centered marketing, or for other business purposes which can be most effective disclosed deep within the terms and conditions that govern their use. The common sense operating right here is that of preemptive capture: the belief that businesses along with Amazon and Google might as well trawl up the whole thing they can, because no person knows what value is probably derived from it within the future. This results in situations that are probably comical were it not for what they imply about the networking of our domestic environments. These tales flow into as cautionary tales: one of the best-regarded became the time america National Public Radio network aired a story about the Amazon Echo, and various cues spoken on the broadcast have been interpreted as instructions through Echos belonging to participants of the target audience, inflicting domestic chaos. Put apart for one moment the query of disproportionate benefit – the concept which you because the consumer derive a bit convenience from your embody of a virtual assistant, even as its provider gets the entirety – all of the information about your lifestyles and all its value. Let’s honestly do not forget what receives lost inside the ideology of convenience that underlies this idea of the internet of things. Are the constraints supplied to us by using lifestyles in the non-related world honestly so onerous? Is it sincerely so difficult to wait until you get home before you preheat the oven? And is it worth giving away so much, simply so that you can do so remotely? Most of us are using now aware that our cell telephones are continuously harvesting records approximately our whereabouts and sports. But we tend to be quite ignorant of the diploma to which the contemporary streetscape has also been enabled to collect records. This improvement is often known as the “smart town.” If the ambition under the instrumentation of the frame is ostensible self-mastery, and that of the home is a comfort, the ambition in the heart of the clever town is nothing other than control – the desire to obtain a more efficient use of the area, power, and different resources. A broad variety of networked facts-amassing gadgets are an increasing number of being deployed in public area, including CCTV cameras; commercials and vending machines ready with biometric sensors; and the indoor micropositioning systems referred to as “beacons” that, whilst blended with a phone app, send signals offering facts about close by products and services. The image we are left with is that of our surroundings furiously vacuuming up data, every square meter of apparently banal pavement yielding a lot records approximately its uses and its customers that no one yet knows what to do with it all. And it is at this scale of interest that the guiding ideology of the internet of things comes into clearest focus. The strongest and most explicit articulation of this ideology inside the definition of a clever metropolis has been supplied by means of the house journal of the engineering business enterprise Siemens: “Several many years from now, cities can have endless independent, intelligently functioning IT structures that will have the best knowledge of users’ habits and energy intake, and provide surest carrier … The purpose of such a city is to optimally regulate and manage assets using independent IT systems.” There is a clear philosophical role, even a worldview, in the back of all of this: that the arena is in precept flawlessly knowable, its contents enumerable and their members of the family able to being meaningfully encoded in a technical gadget, with out bias or distortion. As implemented to the affairs of cities, that is efficaciously an issue that there may be one and only one correct method to every identified need; that this solution may be arrived at algorithmically, thru the operations of a technical system furnished with the proper inputs; and that this solution is something that may be encoded in public coverage, without distortion. (Left unspoken, however strongly implicit, is the presumption that anything policies are arrived at on this manner may be carried out transparently, dispassionately and in a manner loose from politics.) Every element of this argument is questionable. Perhaps most glaringly, the declare that anything in any respect is flawlessly knowable is perverse. However very well sensors are probably deployed in a metropolis, they will handiest ever seize what’s amenable to being captured. In different phrases, they will no longer be able to choose up every unmarried piece of statistics necessary to the method of sound civic policy.	{ "pile_set_name": "Pile-CC" }
Q: Core plot - Scatter graph used as trend graph I have implemented a scatter graph using core plot. I take my data array and sort it from highest to lowest. The result is the following graph: The graph looks great (core plot is great). However as you can see there are rises within the graph. To investigate this further I wrote some code that produces an array that has values that are the same and go from highest to lowest. [100, 90, 80, 80, 70, 60, 50, 50, 40]; When I used this array to test to see what happens, I get a very similar looking graph to above. It seems that when 2 numbers are either the same or very close the graph has a small spike and then starts dropping again even though the numbers are identical or one is slightly lower than the other. I was just wondering if someone could help clarify whether this is correct behaviour within core plot? A: Try different style on your scatter plot CPTScatterPlotInterpolationLinear: This is the default. CPTScatterPlotInterpolationStepped CPTScatterPlotInterpolationHistogram CPTScatterPlotInterpolationCurved example: CPTScatterPlot *yourPlot = [[CPTScatterPlot alloc] init]; yourPlot.dataSource = self; yourPlot.interpolation=CPTScatterPlotInterpolationCurved;	{ "pile_set_name": "StackExchange" }
Q: Remove white border and set final image size matplotlib How can i remove those white borders? Why axes are starting from -100,-100? And, finally, how can i set size for final png image? import matplotlib.pyplot as plt import matplotlib import numpy as np im = plt.imread('pitch.png') implot = plt.imshow(im, aspect='auto') dpi=96 if dpi is None: dpi = matplotlib.rcParams['savefig.dpi'] dpi = float(dpi) fig = plt.figure(figsize=(620/dpi, 579/dpi), dpi=dpi) ax = fig.add_axes([0, 0, 1, 1], frame_on=False) ax.imshow(im, interpolation='none') x, y = np.genfromtxt('coords.csv', delimiter=',', unpack=True) plt.plot(x,y, "o") plt.savefig('dybala.png', bbox_inches='tight') A: The white borders are caused by using imshow and plot in the same plot. When using imshow alone the limits of the axis will be set to the limit of the image. However, when plotting the axes are updated automatically. The simplest solution to this is to get the axes limits after imshow and re-apply them to the figure after plotting. For example, first get the limits: implot = plt.imshow(im, aspect='auto') xlim, ylim = plt.xlim(), plt.ylim() Then set them: plt.plot(x,y, "o") plt.xlim(xlim) plt.ylim(ylim) That should remove the whitespace. To set the size of the final figure saved, you can pass figsize=(w,h) (size in inches) to savefig, along with dpi (for dots per inch) to determine the final image size. If you are looking for a specific pixel size you can calculate this by wdpi, hdpi. plt.savefig('dybala.png', figsize=(8,6), dpi=200) This gives a (8in x 6in)*200 = 1600 x 1200 pixel image in PNG format. However, note that if you use bbox_inches='tight' to remove whitespace around the figure, this happens after the sizing, and will return a smaller image. You can work around this somewhat by removing the figure axes with plt.axis('off'). If you set the DPI to match that of the source image and scale the figsize accordingly, you should be able to save with bbox_inches='tight' and return an image matching the original dimensions.	{ "pile_set_name": "StackExchange" }
Acute visual loss. Acute visual loss is not an infrequent presenting complaint to the Emergency Department. The history of visual loss, physical examination of the eye, and indicated laboratory evaluation are keys to making the diagnosis. The etiology of nontraumatic visual loss is diverse, involving vascular, anatomic, infectious, autoimmune, toxicologic, and psychogenic causes. Appropriate treatment, as well as the need for timeliness of ophthalmologic consultation, is described.	{ "pile_set_name": "PubMed Abstracts" }
The invention relates to a lollipop display device and a method of erecting the display device. Lollipop display devices are utilized in retail stores for displaying lollipops. The display device can be formed of a paper (e.g., cardboard) blank that is erected along fold lines. Holes are punched in the blank through which the sticks of the lollipops can be inserted. Display devices of that type are disclosed, for example, in U.S. Pat. Nos. 1,647,154 and 1,966,734. Those display devices, once erected, present an outer housing having one or more rows of upper holes formed in an upper portion of the housing, and a panel disposed inside of the outer housing and possessing lower holes that are spaced below, and in vertical alignment with, respective ones of the upper holes. The stick of each lollipop is inserted downwardly through a respective pair of the upper and lower holes to be supported in a vertical manner, with the confection portion of the lollipop exposed at the top of the display device. While such display devices are effective, they possess certain drawbacks. For example, the need to provide an inside panel positioned such that the holes thereof are aligned with upper holes of the outer housing increases the cost of the display and complicates the erection procedure. Also, the need to insert each lollipop stick through two spaced-apart holes makes the lollipop insertion procedure more difficult and time consuming. Although it is possible to erect the display device and insert the lollipops at the store where the lollipops are to be sold, it is common for those operations to be performed by the lollipop supplier who then wraps the lollipop-containing display devices in plastic shrink wrap prior to shipping. It will be appreciated that the shipping space occupied by a multitude of such filled display devices is considerable, adding to the shipping costs. Another type of display device is depicted in FIG. 1 wherein the confection parts 2 of the lollipops 4 are laid into large slots 6 of the display device, and the sticks 7 are inserted into holes 8 so as to be inclined relative to vertical. While such a display device may facilitate the insertion of the lollipops, the other drawbacks described above are still present.	{ "pile_set_name": "USPTO Backgrounds" }
.(JavaScript must be enabled to view this email address) Illinois Public Media Rutherford Wins Champaign Co. Republican Straw Poll The Republican Primary for Illinois governor does not happen until early next year, but over the weekend voters in Champaign County heard from all four candidates and chose their favorite in a straw poll. Party faithfuls also had the chance to reflect on the GOP’s vision. In a straw poll at the Champaign County Republican Party’s annual Fall Festival in Urbana, State Treasurer Dan Rutherford came out on top. Rutherford’s message ahead of the vote was clear --- for the Republican Party to grow, it must diversify. “We have to accept that there are people out there that should be and could be good Republicans that are different skin colors than us,” Rutherford said. “They pray to a different God than us. They have a different mother country than some of us western Europeans got.” One example of that diversity can be seen in Rutherford’s choice for a running mate. He picked Chicago Attorney Steve Kim, who if elected, would be the state’s first Asian American lieutenant governor. Illinois State Treasurer Dan Rutherford (Sean Powers/WILL) Bruce Rauner, a Chicago Venture Capitalist, took second in the straw poll. Rauner called the GOP “the party of America.” He wants Republicans to rally around lower taxes, limited government, and personal responsibility. He said he can restore the state. “My youngest daughter said, ‘Daddy, don’t run for governor. I don’t want you to go to jail.’ I said, ‘Katie, that’s one of the reasons I want to run. I’m going to put all those corrupt guys in prison, and all their cronies,’” Rauner said. “The government union bosses who make their money from the taxpayers own the Democratic Party and unfortunately for us they own a lot of the Republicans in Springfield, too. We got to change that.” Rauner is pushing for a ballot initiative to make it more difficult to override a governor's veto. He also wants to change the makeup of the General Assembly, and push for term limits. Chicago Venture Capitalist Bruce Rauner (Sean Powers/WILL) State Sen. Kirk Dillard (R-Hinsdale) stressed the importance of fixing the state’s finances, and strengthening higher education at schools, like the University of Illinois. Dillard narrowly lost the Republican Primary for governor in 2010, and in Sunday’s straw poll, he came in third place. Dillard served as former Republican Gov. Jim Edgar’s chief of staff, and he is determined to see Democratic House Speaker Michael Madigan back in the minority. “We’re going to do the same thing that we did in the Edgar administration with Mike Madigan,” Edgar said. “We’re going to make him the minority leader. And we also want every, every constitutional office statewide. So, I am the electable Republican. I know how to make a Democratic legislature do things that’s not in its DNA to do like live within its means.” Dillard was the only candidate to bring his running mate, State Rep. Jil Tracy (R-Quincy). She also addressed the crowd of about 450 people. State Rep. Jill Tracy and Sen. Kirk Dillard (Sean Powers/WILL) Bill Brady, the Republican nominee for Illinois governor in 2010, came in last in Sunday’s straw poll. The state senator from Bloomington urged voters to give him another shot, so that he can fix Illinois’ unemployment rate, address the unfunded pension liability, and attract new businesses. “The Democrats and Pat Quinn are about supersizing things when we need a value meal, and that means lower taxes, more efficient government, and that’s what we need to do as Republicans and that’s what we need to promote,” Brady said. Sen. Bill Brady (Sean Powers/WILL) After the candidates spoke, Harriet Rose held onto flyers and pamphlets from each of them. Her son is State Sen. Chapin Rose (R-Mahomet). Rose is still undecided, and she said she likes what they all had to say. “Brady made a grammar mistake, which really he shouldn’t have done that,” Rose smirked, adding that will not affect whether she supports him. Rose explained that she wants a governor who can turn the state’s economy around. “The Illinois economy really needs a boost, and taxes are a problem,” Rose said. "I wish we could take back some of the power from Chicago.” Champaign resident Todd Hunter was also at the event. This is the first year the candidates can pick their own running mates, something Hunter said will be on his mind as he decides who to support. “It’s really the only insight into who else they’d pick, and whether they’re going for a strong personal relationship or something they think will be attractive to certain voters or all voters or fundraising,” he said. “It tells me what their priorities are. ” The final tally on the straw poll showd Dan Rutherford with 50.4 percent of the vote, followed by Bruce Rauner with 22.6 percent, then Kirk Dillard with 19.1 percent, and Bill Brady trailing with 7.8 percent. But like any campaign, a lot can change in six months.	{ "pile_set_name": "Pile-CC" }
Q: How to call php or apache to render a page from the command line? I am running apache2 as a web server. I have a local file, example.php, which I need to see as rendered by apache. The easiest way to do this would be to move or link the file to the folder apache exposes as part of my site, and then I could get the page with curl or wget. However, this is not possible in my situation - I cannot write to the directory apache is looking in, which means that I can't access it by the usual port 80 method. Is there a way I can call apache directly, giving it a php file to generate the result of? I'm looking for a command like $ apache ./example.php > output.html, is this possible? I'm asking about apache, because although I only really need it to run the php, the php-cli is not usable in this cases - apache php and cli php have access to different areas of memory, and I need the results to match the ones returned through apache. A: Can you just add it to Apache as a new virtualhost? The simplest way to get something to behave like a website is to treat it like a website. If you could just host this as a local website (eg only on the 127.0.0.1 interface) and wget it, that would probably be the cheapest and cleanest way to deal with this. Run it as a script with the php command You can run php example.php > output.html and that should work for most simple scripts. Note that this will use the php-cli configuration rather than mod_php, php-fpm, php-cgi, etc configurations. That might be important if you have a funny setup. Edit: I saw this question yesterday that might be of use. It's aimed at wordpress but the same logic should apply for most things where you need to fake a real request. You set up a load of PHP's $_SERVER variables so your script (whatever that might be) can execute correctly… And then include your script. Use the PHP built-in server (requires PHP 5.4+) If you cd into your directory and run php -S localhost:9000 you start a local server on port 9000 that will host your website. This is only for testing things like this and should never be exposed to the internet. This allows you to do a traditional wget lookup: wget -O output.html http://localhost:9000/example.php From my previous (now deleted) answer, if you find yourself needing to spoof the domain name, wget will let you pass the host in. This comes in handy if the PHP is doing lookups on server variables. wget -O output.html --header "Host: example.com" http://localhost:9000/example.php	{ "pile_set_name": "StackExchange" }
Q: Is it possible to put a mathematical formula (using Latex) next to the Slider widget in Matplotlib? My question is in the title, as you can see in the image below my variable is M2/M1 and I am wondering if it is possible to replace it by $\dfrac{M_2}{M_1}$. I tried: axmass = plt.axes([0.18, 0.1, 0.65, 0.03]) smass = Slider(axmass, '$\dfrac{M_2}{M_1}$', 1e-5, 1, 0) But I get the following error: ValueError: \dfrac{M_2}{M_1} ^ Unknown symbol: \dfrac (at char 0), (line:1, col:1) A: You can, this should work, it adds an r before the string, it uses \frac instead of \dfrac (display mode is not supported), it uses rc (if not, the result is ugly). After request I also added a line to vertically center the fraction (if not the fraction line is not aligned with the slider), I am open to suggestion for a better way to position correctly the legend ! Here is a minimal working exemple adapted from this STACK OVERFLOW question: import matplotlib.pyplot as plt import matplotlib.widgets fig = plt.figure() plt.rc('text', usetex=True) E0_slider_ax = fig.add_axes([0.6, 0.2, 0.25, 0.03], facecolor="skyblue") E0_slider = matplotlib.widgets.Slider(E0_slider_ax, r'$\frac{M_3}{M_1}$', 1, 100, valinit = 50) E0_slider.label.set_size(40) E0_slider.label.set_position((-0.1,0)) #Probably not the best solution plt.show() You can take a look at matplotlib official documentation on the subject: https://matplotlib.org/users/usetex.html	{ "pile_set_name": "StackExchange" }