text stringlengths 12 4.76M | timestamp stringlengths 26 26 | url stringlengths 32 32 |
|---|---|---|
220 F.Supp.2d 638 (2002)
Jessie NOYOLA and wife, Beatrice Noyola, Plaintiffs,
v.
OASIS CAR WASH, INC., Defendant.
No. Civ.A. 01:02-CV-290.
United States District Court, E.D. Texas, Beaumont Division.
June 14, 2002.
*639 Gregory F. Cox, Provost & Umphrey, Beaumont, TX, for Plaintiff.
Darryl Jan Silvera, Silvera & Associates, Dallas, TX, for Defendants.
MEMORANDUM OPINION
COBB, District Judge.
Before the court is Plaintiffs' Motion to Remand [Dkt. # 2], and the court having reviewed the motion and response on file is of the opinion that the motion be GRANTED. This case, originally filed in state court and removed to federal court by the defendant, Oasis Car Wash, Inc. (Oasis), arises out of an on-the-job injury suffered by one of the plaintiffs while employed by and working for Oasis. The plaintiffs have now filed a Motion to Remand.
I. The Burden is on Oasis to Demonstrate Entitlement to Removal
Oasis, as the party invoking federal court removal jurisdiction, bears the burden of establishing that this court has subject matter jurisdiction. See Carpenter v. Wichita Falls Indep. Sch. Dist., 44 *640 F.3d 362, 365 (5th Cir.1995); Willy v. Coastal Corp., 855 F.2d 1160, 1164 (5th Cir.1988). "[B]ecause the effect of removal is to deprive the state court of an action properly before it, removal raises significant federalism concerns...." Carpenter, 44 F.3d at 365. The court, therefore, must strictly construe the removal statute. Id. When removal is sought under 28 U.S.C. § 1441(b), as it is here, the right of removal depends on the existence of a claim or claims within the federal question jurisdiction of the court. Id. Remand is proper when there is any doubt as to the existence of federal jurisdiction. Delgado v. Shell Oil Co., 890 F.Supp. 1324, 1341 (S.D.Tex.1995); Samuel v. Langham, 780 F.Supp. 424, 427 (N.D.Tex.1992).
II. Background
According to the Original Complaint, which was filed in state court on April 1, 2002: Jessie Noyola worked for Oasis and while performing work for Oasis on March 12, 2002, he fell from a ladder when he received an electric shock. Oasis is a nonsubscriber to the Texas Workers' Compensation Act, but has established its own Employee Injury Benefit Plan. While Mr. Noyola received treatment for his injuries at the hospital, an agent of Oasis approached Beatrice Noyola, Jessie Noyola's wife, with a one-page document that the agent said needed to be signed in order for Oasis to pay Jessie Noyola's medical expenses. Mrs. Noyola questioned the purpose of the form, but the agent assured her that it was merely an insurance form that needed to be signed. Mrs. Noyola signed the form, which turned out to be only the last page of a thirty-two page document that included a waiver of worker compensation claims provision.
On April 1, 2002, the Noyolas filed suit in Texas state court against Oasis raising negligence claims and Mrs. Noyola also brought a claim for fraud. On May 8, 2002, Oasis removed the case to federal court contending that the Noyolas' claims are preempted by ERISA. Concerned with the propriety of exercising jurisdiction over this case, the court addressed a letter to the attorneys for both parties requesting briefing on the issue of jurisdiction. Presumably, in response to the court's letter, the Noyolas filed a Motion to Remand that argued ERISA did not preempt their state law claims. Oasis responded to the Motion to Remand by reurging ERISA preemption.
The Noyolas argue that their claims, negligence and fraud, are not preempted by ERISA and they cite Hook v. Morrison Milling Co., 38 F.3d 776 (5th Cir.1994) as support for their position. Naturally, Oasis disagrees with the Noyolas' view, and it contends that Hernandez v. Jobe Concrete Products, Inc., 282 F.3d 360 (5th Cir.2002) dictates that these claims are preempted and that removal is, therefore, proper.
III. Statutory Background
A. The Texas Workers' Compensation Act
The Texas Workers' Compensation Act (TWCA) governs the distribution of benefits to workers who are injured on the job. The TWCA provides that any benefits distributed pursuant to it are an employee's exclusive remedy for any work-related injuries or death. TEX.LAB.CODE ANN. § 406.034 (Vernon 1996). This statute is different from most other states in that it gives employers the option not to carry insurance under the TWCA. TEX.LAB.CODE ANN. § 406.002 (Vernon 1996). If an employer chooses not to carry TWCA coverage, the employer is referred to as a nonsubscriber. A non-subscriber's employees retain the right to sue their employer in state court, and the employer is deprived of traditional common law defenses. TEX. LAB.CODE ANN. § 406.033 (Vernon 1996).
*641 B. ERISA
On Labor Day 1974, President Gerald Ford signed the Employee Retirement Income Security Act of 1974 (ERISA) into law, enacting the first federal legislation protecting the rights of America's workers who earn pension benefits. ERISA: A COMPREHENSIVE GUIDE 1 (Martin Wald & David Kenty, eds.1991). Congress's goal in passing ERISA was to replace the patchwork of state laws governing this area with a uniform body of federal law. See N.Y. Conference of Blue Cross v. Travelers Ins., 514 U.S. 645, 656-57, 115 S.Ct. 1671, 131 L.Ed.2d 695 (1995); Fort Halifax Packing Co. v. Coyne, 482 U.S. 1, 9, 107 S.Ct. 2211, 96 L.Ed.2d 1 (1987). One of the tools Congress placed into ERISA to accomplish this goal was a preemption provision. See Wald & Kenty, supra at 249 ("The preemption by ERISA of state laws was designed to create a uniform national law governing employee benefit plans that would, among other things, permit the uniform administration of plans covering employees in several states.").
ERISA's preemption clause specifies, in pertinent part, that the provisions of ERISA "supersede any and all State laws insofar as they may now or hereafter relate to any employee benefit plan." ERISA § 514(a), 29 U.S.C. § 1144(a); Christopher v. Mobil Oil Corp., 950 F.2d 1209, 1217 (5th Cir.1992) cert. denied, 506 U.S. 820, 113 S.Ct. 68, 121 L.Ed.2d 35 (1992). The Supreme Court has repeatedly stressed that this "relate to" standard must be interpreted expansively, and that the words are to be given their "broad common-sense meaning." Egelhoff v. Egelhoff, 532 U.S. 141, 146, 121 S.Ct. 1322, 149 L.Ed.2d 264 (2001); Ingersoll-Rand Co. v. McClendon, 498 U.S. 133, 139, 111 S.Ct. 478, 112 L.Ed.2d 474 (1990); Pilot Life Ins. Co. v. Dedeaux, 481 U.S. 41, 47, 107 S.Ct. 1549, 95 L.Ed.2d 39 (1987); Metropolitan Life Ins. Co. v. Massachusetts, 471 U.S. 724, 739, 105 S.Ct. 2380, 85 L.Ed.2d 728 (1985). Any state law which has a connection with or reference to an employee benefit plan is generally preempted. Shaw v. Delta Air Lines, Inc., 463 U.S. 85, 96-97, 103 S.Ct. 2890, 77 L.Ed.2d 490 (1983). However, "[s]ome state actions may affect employee benefit plans in too tenuous, remote, or peripheral a manner to warrant a finding that the law `relates to' the plan." Id. at 100 n. 21, 103 S.Ct. 2890. Lawsuits against ERISA plans for "run-of-the-mill" state law claims, including certain tort actions, are therefore not preempted by ERISA, despite the fact that they plainly affect and involve employee benefit plans. See Mackey v. Lanier Collection Agency & Service, Inc., 486 U.S. 825, 833, 108 S.Ct. 2182, 100 L.Ed.2d 836 (1988).
According to the Supreme Court, a law relates to an ERISA plan if it: 1) has a connection with or 2) reference to such a plan. California Div. of Labor Standards Enforcement v. Dillingham Constr., N.A., Inc., 519 U.S. 316, 324, 117 S.Ct. 832, 136 L.Ed.2d 791 (1997). When a law acts "immediately and exclusively" upon an ERISA plan or where the existence of an ERISA plan is "essential" to the law's operation, the law makes reference to an ERISA plan. Id. at 325, 117 S.Ct. 832. To determine if a law has a connection with an ERISA plan, the Court instructed lower courts to look at "the objectives of the ERISA statute as a guide to the scope of the state law Congress understood would survive" and at "the nature of the effect of the state law on ERISA plans." Id. The Court has stated that state-law claims that are preempted by ERISA and came within the scope of ERISA's civil enforcement provision could be recharacterized as arising under federal law, and as such, are removable to federal court. Metropolitan Life, 481 U.S. at 64-67, 107 S.Ct. 1542; see also Ramirez v. Inter-Continental Hotels, 890 F.2d 760, 762 (5th Cir.1989).
*642 The Fifth Circuit has developed a two-prong test to aid courts in their preemption inquiry. Memorial Hosp. Sys. v. Northbrook Life Ins. Co., 904 F.2d 236, 244 (5th Cir.1990). The Fifth Circuit has found preemption of state law claims when: 1) the claim addresses areas of exclusive federal concern, such as the right to receive benefits under the terms of an ERISA plan, and 2) the claim directly affects the relationship among the traditional ERISA entities (i.e., plan administrators/fiduciaries and plan participants/beneficiaries). Id. at 245.
IV. Reviewing Hook v. Morrison Milling Company
In Hook, the Fifth Circuit affirmed a district court's remand of the plaintiff's negligence action against her employer. Hook, 38 F.3d at 778. In this case, Roxanne Hook, began working for Morrison Milling Company (MMC) in October 1990. Id. at 779. MMC had elected to discontinue workers' compensation insurance under the TWCA and it began offering its own employee benefit plan. Id. at 778. In December 1990, Hook fell down a staircase and suffered injuries. Id. at 779. She filed a claim under the plan with MCC and received benefits. Id. In February 1992, Hook filed a wrongful discharge and negligence action against MCC in Texas state court. Id. MMC removed the case to federal court arguing that ERISA preempted the wrongful discharge claim. Id. Hook filed a motion to remand, which the district court denied. Id. Hook then amended her complaint and dropped the wrongful discharge claim leaving only the negligence claim pending and again moved for remand. Id. This time the district court remanded the case and MMC appealed. Id.
In affirming the district court's decision to remand, the Fifth Circuit reviewed two grounds for establishing ERISA preemption: 1) whether the plaintiff's negligence claim was independently preempted by ERISA and 2) whether the fact that MMC's plan contained a waiver provision that Hook's claim related to resulted in preemption. Neither party disputed that the plan, itself, was governed by ERISA.
In deciding that ERISA did not independently preempt Hook's negligence claim, the Fifth Circuit stated that "Hook's unsafe workplace claim ... is totally independent from the existence and administration of MMC's ERISA plan." Id. at 784. The court noted that Hook neither sought benefits under the plan, nor claimed that MMC improperly processed her claim for benefits, but rather she sought only damages for MMC's alleged negligent maintenance of its workplace. Id. The Fifth Circuit concluded that "Hook's claim, standing alone, is not preempted by ERISA because it affects only her employer/employee relationship with MMC and not her administrator/beneficiary relationship with the company." Id. at 783 (emphasis in original).[1]
*643 After deciding that Hook's unsafe workplace claim standing alone did not lead to ERISA preemption, the Fifth Circuit turned its attention to the waiver provision in MMC's plan. MMC argued that Hook's claim was preempted because the waiver provision in the plan related to her claim and to consider her claim a court would be forced to examine the plan. Id. at 783, 785. The Fifth Circuit rejected this theory, stating that MMC's argument "turns ERISA preemption analysis on its head" because it would allow "employers to avoid any state law simply by referring to that law in its ERISA plan." Id. (emphasis in original). The Fifth Circuit concluded that "a law or claim is preempted when it relates to an ERISA plan and not the reverse." Id. (emphasis in original).[2]
V. Discussion
This court agrees with the Noyolas that Hook governs the outcome of this case. Like the unsafe workplace claim in Hook, the Noyolas' claims are completely independent from the existence and administration of Oasis's plan. The Noyolas neither seek benefits under the plan, nor claim that Oasis has improperly processed their claim, but rather they seek damages for Oasis's negligent maintenance of its workplace and for fraudulently inducing Mrs. Noyola to sign an insurance document. The Noyolas do not rely on the existence of an ERISA-governed plan to argue that they are entitled to damages. In fact, to put it quite simply, the Noyolas' claims would exist even if Oasis did not have an ERISA-governed plan. Nothing in the Noyolas' claims addresses an area of exclusive federal concern, nor do the claims affect the relationship among traditional ERISA entities. This is a case, similar to Hook, where an employee has sued his employer for maintaining an allegedly unsafe workplace.
Looking specifically at the negligence claim, the court notes that the Noyolas' negligent maintenance of the workplace claim is identical to the claim that the Fifth Circuit in Hook stated "standing alone, is not preempted by ERISA because it affects only [Mr. Noyolas's] employer/employee relationship with [Oasis] and not [his] administrator/beneficiary relationship with the company." Hook, 38 F.3d at 783. Courts have consistently held that common law negligence claims are not preempted by ERISA. See, e.g., Hook, 38 F.3d at 784 (concluding that the plaintiff's common law negligence claim is not preempted by ERISA); Lazo v. Inland Sales Co., 925 F.Supp. 463 (N.D.Tex.1995) (same); McCabe v. Henpil, Inc., 889 F.Supp. 983 (E.D.Tex.1995) (same); Westbrook v. Beverly Enters., 832 F.Supp. 188 (W.D.Tex.1993) (same); Pyle v. Beverly Enters. Texas, 826 F.Supp. 206 (N.D.Tex.1993) (same); Gibson v. Wyatt Cafeterias, 782 F.Supp. 331 (E.D.Tex.1992) (same); O'Neill v. Pro-Set Press, 1992 WL 404456 (N.D.Tex.1992) (same); Nunez v. Wyatt Cafeterias, 771 F.Supp. 165, 168 (N.D.Tex.1991) (same). In this particular case, the plaintiffs' negligence claim seeks damages for his personal injury and her loss of consortium, rather than benefits *644 under the plan. Like so many courts before today's ruling, this court finds that the plaintiffs' negligence claim is not rooted in the existence of an ERISA-governed plan, and as such, does not relate to one.
Turning to Mrs. Noyola's fraud claim, the court finds this claim is not preempted by ERISA either. In Smith v. Texas Children's Hospital, the Fifth Circuit found the plaintiff's fraud claim escaped preemption when it did not necessarily depend upon the scope of the plaintiff's rights under the defendant's plan. 84 F.3d 152, 155 (5th Cir.1996). The Fifth Circuit continued by stating that the plaintiff was not suing for benefits owed her under the defendant's plan, but rather, she was suing for vested benefits that she had acquired, but then relinquished in reliance upon the defendant's alleged misrepresentations. Id. at 157; see also Hand v. Church and Dwight Co., Inc., 962 F.Supp. 742, 746 (D.S.C.1997) ("The central issue of [the plaintiff's fraud] claim, therefore, involves the representations of the defendants that were made in order to induce the plaintiff to forego legal rights that she could have exercised."). The Fifth Circuit noted that if the defendant in Smith did not even have a plan, the plaintiff would still have had a claim against the defendant because the plaintiff's claim "ultimately" was not one for plan benefits. Smith, 84 F.3d at 155.
This court recognizes that to the extent that Mrs. Noyola is claiming that she is entitled to disability benefits under Oasis's ERISA plan, her claim is preempted. Fifth Circuit case law teaches that a state-law claim by an ERISA plan participant against her employer is preempted when based upon a denial of benefits under the defendant's ERISA plan. Perdue v. Burger King Corp., 7 F.3d 1251, 1255-56 (5th Cir.1993); Christopher v. Mobil Oil Corp., 950 F.2d 1209, 1217-20 (5th Cir. 1992); Cefalu v. B.F. Goodrich Co., 871 F.2d 1290, 1292-97 (5th Cir.1989). However, Oasis, as the party invoking federal court removal jurisdiction, bears the burden of establishing that this court has subject matter jurisdiction, and it does not appear at this time that Mrs. Noyola is claiming she is entitled to benefits under Oasis's plan. See Carpenter v. Wichita Falls Indep. Sch. Dist., 44 F.3d 362, 365 (5th Cir.1995); Willy v. Coastal Corp., 855 F.2d 1160, 1164 (5th Cir.1988).
In this case, Mrs. Noyola alleges that through fraud, deception and misrepresentation Oasis convinced her to sign on behalf of her husband Oasis's ERISA-governed insurance plan. Plaintiffs' Original Petition at 3. This court is unsure what the damages will be if Mrs. Noyola proved Oasis fraudulently induced her to sign this document, but the court is confident that Mrs. Noyola does not seek benefits due her under the plan. In fact, just the opposite appears to be occurring. Mr. Noyola contends that he did not join Oasis's plan, so neither he, nor his wife, could be claiming entitlement to plan benefits. Rather, like the plaintiffs in Smith and Hand, Mrs. Noyola appears to claim that Oasis's alleged misrepresentations caused her give up rights that she would otherwise have been able to exercise. In light of the defendant's argument that this case should be sent to binding arbitration because of Mrs. Noyola's signature, Oasis apparently would agree that the Noyolas lost a right that they would have otherwise been able to exercise the right to file a civil action against the defendant. See Defendant's Motion to Compel Arbitration and Stay Proceedings and Brief in Support Thereof at 1. There may be other damages Mrs. Noyola seeks to recover by bringing this claim, but again, Oasis bears the burden of showing the claim is preempted, and at this time, Oasis has failed to show that Mrs. Noyola is claiming entitlement to *645 plan benefits, and therefore that ERISA preemption exists.
Oasis argues that Hernandez v. Jobe Concrete Products, Inc., and not Hook, governs the outcome of this case and that the outcome should be that the Noyolas' claims are preempted. Defendant's Response to Plaintiffs' Motion to Remand and Brief in Support Thereof at 3. After reviewing Hook and Hernandez, the court disagrees with Oasis's conclusion that Hernandez dictates preemption in this case.
In Hernandez, the Fifth Circuit affirmed a district court's grant of a motion to compel arbitration and held that remand of the plaintiff's claims to state court would have been inappropriate. 282 F.3d at 364. In this case, Jose Hernandez worked for Jobe Concrete Products, Inc. (Jobe) and suffered an on-the-job injury. Id. at 361. Hernandez began receiving benefits under Jobe's occupational injury plan, but he later quit and ceased to receive these benefits. Id. Jobe was a nonsubscriber under the TWCA because it elected to adopt its own plan rather than subscribe to the TWCA. Id. at 363. Jobe's plan provided benefits resulting from work-related injuries for 1) short-term disability; 2) death, dismemberment, and permanent, total disability; and 3) medical care. Id. Jobe's plan also included a waiver that provided all claims for damages or harm resulting from an on-the-job injury were to be subject to binding arbitration. Id.
After quitting his job, Hernandez filed suit in Texas state court against Jobe asserting claims for unlawful retaliation, negligence, breach of contract, breach of the covenant of good faith and fair dealing, and intentional infliction of emotional distress. Id. at 361. Jobe removed the case to federal court alleging that Hernandez's state law claims were preempted by ERISA. Id. Jobe then filed a motion to compel arbitration and a 12(b)(6) motion to dismiss. Id. Hernandez filed a motion to remand. Id. The district court granted Jobe's motion to compel arbitration and denied all remaining motions, including the motion to remand, as moot. Id.
The parties agreed that Jobe's plan would normally be governed by ERISA, but Hernandez argued that this plan fell within one of ERISA's exceptions to preemption. Id. at 362. Specifically, Hernandez argued that § 1003(b)(3), which exempts from ERISA coverage any employee benefit plan if "such plan is maintained solely for the purpose of complying with applicable workmen's compensation or disability insurance laws," applies to Jobe's plan, and thus that it is not an ERISA-governed plan. Id. (quoting 29 U.S.C. § 1003(b)(3)). Jobe countered by arguing that because Texas does not require employers to provide workers' compensation insurance, it did not maintain a plan solely for the purpose of complying with Texas's workers' compensation law. Id. at 363. Thus, the issue before the court in Hernandez was "whether Jobe's plan is an ERISA plan subject to federal preemption, or whether it falls within the exception to preemption reserved for state workers' compensation plans." Id. at 361.
The Fifth Circuit agreed with Jobe's argument. Id. at 363. The court noted that in Shaw v. Delta Air Lines, Inc., the Supreme Court held that this exception will apply only to plans which are both separately administered and maintained solely to comply with state law. Id. at 362 n. 2 (citing 463 U.S. 85, 107-08, 103 S.Ct. 2890, 77 L.Ed.2d 490 (1983)). The Fifth Circuit found Jobe chose to adopt its own plan, a decision it stated that was not required under Texas law. Id. at 364. The court stated that "Jobe has undoubtedly created and maintained its plan in order to avoid the high cost of insurance under the TWCA, and in an effort to limit *646 its liability in the absence of such insurance." Id. (citing Nunez v. Wyatt Cafeterias, Inc., 771 F.Supp. 165, 167 (N.D.Tex. 1991)).[3] As such, the Fifth Circuit held that the § 1003(b)(3) exception did not apply to Jobe's plan, and therefore, Jobe's plan was an ERISA-governed plan. Id. at 363-64.
Again, in Hernandez, the issue before the Fifth Circuit was not whether the plaintiff's claims related to an ERISA plan because this point had been conceded by the parties, but rather the issue tackled by the Fifth Circuit in Hernandez was whether the defendant's plan actually constituted an ERISA plan. See Hernandez, 282 F.3d at 362 n. 3 (pointing out that the parties conceded that the plaintiff's claims related to the plan); id. at 362 (stating that the parties disagreed as to whether the defendant's plan is governed by ERISA for preemption purposes). In finding that ERISA governed this particular plan, the Fifth Circuit noted that it had previously held negligence claims against employers, like the one brought by Mr. Noyola in this case, do not relate to ERISA plans. Id. at 362 n. 3. Furthermore, in holding that the exception to ERISA preemption that the plaintiff in Hernandez had been arguing the plan fell under did not apply, the Fifth Circuit cited Pyle v. Beverly Enters. Tex., Inc., 826 F.Supp. 206, 210-11 (N.D.Tex.1993), which held similarly, but also held that the employee's negligence claim against her employer was not preempted by ERISA. Id. at 363. Finally, the Hernandez court stated that its opinion was consistent with Hook in that in Hook, the Fifth Circuit analyzed the issue of whether an employee's negligence claim related to an ERISA plan. Id. at 363 n. 5. The Hernandez court, thus recognized that it had addressed a different issue than the Hook court.
The Noyolas have not claimed that Oasis's plan is exempted from ERISA preemption by § 1003(b)(3) of ERISA, like the plaintiff did in Hernandez. Rather, like the plaintiff in Hook, the Noyolas merely argue that their claims do not relate to an ERISA-governed plan. Actually, the Noyolas do not argue one way or the other with regard to whether Oasis's plan is governed by ERISA because they argue Mr. Noyola never joined the plan and that their claims do not relate to any plan.
In Hernandez, the Fifth Circuit specifically stated that because the parties conceded the claims related to the plan, the court did not need to consider whether the plaintiff's claims related to the plan. Id. at 363 n. 3. The Noyolas pose the opposite scenario for this court as the Fifth Circuit faced in Hernandez in that the plaintiffs do not argue Oasis's plan is exempt from ERISA preemption, rather they contend their claims do not relate to a plan. Thus, the Noyolas argument mirrors the situation addressed by the Fifth Circuit in Hook, when it found Hook's negligence claim against her employer escaped ERISA preemption. Hook, 38 F.3d at 784. As such, this court finds Hook to be more instructive than Hernandez in resolving the issue presently before it.
Finally, while neither party raises this issue, the court notes that the arbitration provision within Oasis's plan does not create ERISA preemption. Similar to the reasoning employed in Hook with regard to a waiver of claims provision, the Noyolas' claims must relate to Oasis's plan to be preempted, not the other way around. Id. *647 at 785. To hold otherwise would, as the Fifth Circuit found, "turn[] ERISA preemption analysis on its head." Id. Whatever affect the arbitration clause in Oasis's plan may have on the Noyolas' state-law claims is an issue best left to the discretion of a court of the state of Texas.
VI. Conclusion
The Noyolas' complaint in this action makes no statement that ties together their tort claims with any claim under Oasis's plan, nor has Oasis demonstrated that any connection between the two exists that allows the court to find that the plaintiffs' claims relate to the defendant's plan. There being no relation between the plaintiffs' claims and the defendant's plan in such a sense, there is no preemption, and there has been no showing that this court has subject matter jurisdiction. It is, therefore,
ORDERED, that Plaintiff's Motion to Remand is hereby GRANTED and that this case is to be REMANDED to the state court from whence it came. It is further,
ORDERED, that Plaintiffs are awarded taxable costs associated with the removal and remand. It is further,
ORDERED, that all outstanding motions are DENIED as MOOT. It is further,
ORDERED, that the Clerk CLOSE this case.
NOTES
[1] In so concluding the Fifth Circuit stated that "[n]umerous federal district courts in Texas have concluded that a tort claim alleging an unsafe workplace does not relate to an ERISA plan." Hook, 38 F.3d at 784; see, e.g., Westbrook v. Beverly Enters., 832 F.Supp. 188 (W.D.Tex.1993) (concluding that the plaintiff's common law negligence claim was not preempted by ERISA); Pyle v. Beverly Enters. Texas, 826 F.Supp. 206 (N.D.Tex. 1993) (same); Gibson v. Wyatt Cafeterias, 782 F.Supp. 331 (E.D.Tex.1992) (same); O'Neill v. Pro-Set Press, 1992 WL 404456 (N.D.Tex. 1992) (same); Nunez v. Wyatt Cafeterias, 771 F.Supp. 165, 168 (N.D.Tex.1991) ("By the bringing of this action plaintiff has but exercised his common law rights, as those rights have been enhanced by the workers' compensation laws of Texas, to recover from defendant, a non-subscriber, if he is able to prove that defendant failed to comply with its common law duties to plaintiff. The rights plaintiff asserts in this action are entirely independent of the Plan. They would exist, and plaintiff presumably would assert them, even if the Plan were not in existence.").
[2] The district court concluded that the waiver provision does not preempt Hook's unsafe workplace claim because the waiver provision was incidental to the negligence claim, and alternatively, because such provisions are void under Texas law. Hook, 38 F.3d at 779. The Fifth Circuit explicitly stated that it did not reach the conclusion that the waiver was void under Texas law. Id. at 779 n. 4. The Fifth Circuit left the question of the validity of the waiver provision under Texas law to the Texas state court to be answered upon remand. Id.
[3] Interestingly, the Nunez court held that the plaintiff's negligence action against his employer escaped ERISA preemption because the claim was entirely independent of the defendant's plan. Nunez, 771 F.Supp. at 168.
| 2024-05-22T01:26:29.851802 | https://example.com/article/9086 |
The Spanish village formerly known as Kill Jews Town is twinning with an Israeli town.
On Sunday, Kfar Vradim in northern Israel hosted officials from Castrillo Mota de Judios, or Castrillo Jews’ Hill, for a ceremony to make the relationship official.
As part of the relationship, the towns will promote cultural, tourist and commercial ties with each other, The Associated Press reported.
Castrillo Jews’ Hill Mayor Lorenzo Rodriguez, who in 2014 submitted the proposal to return the town in northern Spain to its original name, attended the signing ceremony, as did the Spanish ambassador to Israel, Fernando Cardera, the AP reported.
“We’re here in the Promised Land to safeguard the roots of the town, established in 1035,” Rodriguez said at the ceremony.
The name of the village was changed to Castrillo Matajudíos, or Kill Jews Town, during the Spanish Inquisition in the late 15th and early 16th centuries. In June, the town used its new name of Castrillo Mota de Judios in the official state gazette. The name change was approved by the regional government of Castilla y Leon.
No Jews currently live in the Spanish village, but a Star of David can be found on its official shield. A massacre of Jewish people is believed to have taken place near the town in 1035, while another massacre happened inside the village in 1109. | 2023-12-23T01:26:29.851802 | https://example.com/article/5260 |
The Canadian Grayhound long-distance bus passenger Chinese suspect Li Weiguang who cuts the dismemberment document (Vince Weiguang Li, transliterates) in Friday the courtyard. 40 year-old Li Weiguang himself is a delivery boy, the boss described that his manner is genial, but the manner silence, the past 1 month behavior started to appear strangely, possible and the marital question concerned. A Li's neighbor refers to him always not to greet, “very counter-society”.
The Li Weiguang family is occupied by Edmonton (Edmonton), sends the newspaper for the local two newspapers. Li's boss Austria Gutt said that the Li manner is genial, and the silence is reliable, is a good staff. Austria said that Li Weiguang asked for leave the other day, said that must arrive at Winnipeg (Winnipeg) to look for the work, Monday after Edmonton the Claye Vyell area delivers the paper is missing. “I thought that he has had an accident, does not deliver the newspaper, this does not look like his disposition.” | 2023-11-29T01:26:29.851802 | https://example.com/article/6038 |
Require Import Coq.ZArith.ZArith.
Require Import bedrock2.Map.SeparationLogic.
Require Import compiler.FlatImp.
Require Import coqutil.Decidable.
Require Import coqutil.Tactics.Tactics.
Require Import coqutil.Tactics.simpl_rewrite.
Require Import coqutil.Datatypes.PropSet.
Require Import Coq.Lists.List. Import ListNotations.
Require Import riscv.Utility.Utility.
Require Import coqutil.Z.Lia.
Require Import coqutil.Map.Interface coqutil.Map.Properties.
Require Import coqutil.Tactics.Tactics.
Require Import compiler.Simp.
Require Import compiler.Simulation.
Require Import compiler.SeparationLogic.
Require Import compiler.SpillingMapGoals.
Require Import bedrock2.MetricLogging.
Open Scope Z_scope.
Module map.
Section MAP.
Context {key value} {map : map.map key value}.
Definition dom(l: map): key -> Prop := fun x => exists v, map.get l x = Some v.
Inductive mut_disj: list map -> Prop :=
| mut_disj_nil:
mut_disj []
| mut_disj_cons: forall m l,
(forall m', In m' l -> map.disjoint m m') ->
mut_disj l ->
mut_disj (m :: l).
Definition map_keys{key': Type}{map': map.map key' value}(f: key -> key'): map -> map' :=
map.fold (fun m' k v => map.put m' (f k) v) map.empty.
Definition join: list map -> map := List.fold_right map.putmany map.empty.
Definition splits(L R: list map): Prop := join L = join R /\ mut_disj L /\ mut_disj R.
Definition geto(a: option map)(k: key): option value :=
match a with
| Some m => map.get m k
| None => None
end.
Definition domo(a: option map): key -> Prop :=
match a with
| Some m => fun k => exists v, map.get m k = Some v
| None => fun k => True (* TODO depending on where it's used, this should be False *)
end.
Definition putmanyo(a b: option map): option map :=
match a, b with
| Some a, Some b => Some (map.putmany a b)
| _, _ => None
end.
(* domains need not be disjoint, but if they overlap, the two maps have to agree on the value *)
Definition agreeing_putmany{value_eqb: value -> value -> bool}{value_eq_spec: EqDecider value_eqb}
(a b: option map): option map :=
match a, b with
| Some a, Some b => map.fold (fun o k v => match o with
| Some m => match map.get m k with
| Some v' => if value_eqb v v'
then Some m else None
| None => Some (map.put m k v)
end
| None => None
end)
(Some a)
b
| _, _ => None
end.
Definition disj_putmany(a b: option map): option map :=
match a, b with
| Some a, Some b => map.fold (fun o k v => match o with
| Some m => match map.get m k with
| Some _ => None
| None => Some (map.put m k v)
end
| None => None
end)
(Some a)
b
| _, _ => None
end.
Lemma disj_putmany_empty_l: forall m: option map,
disj_putmany (Some map.empty) m = m.
Admitted.
Lemma disj_putmany_empty_r: forall m: option map,
disj_putmany m (Some map.empty) = m.
Admitted.
Context {ok : map.ok map} {key_eqb: key -> key -> bool} {key_eq_dec : EqDecider key_eqb}.
Lemma mut_disj_disjoint: forall m1 m2,
mut_disj [m1; m2] ->
map.disjoint m1 m2.
Proof.
intros. inversion H. subst. eapply H2. simpl. auto.
Qed.
Lemma disjoint_mut_disj: forall m1 m2,
map.disjoint m1 m2 ->
mut_disj [m1; m2].
Proof.
intros. repeat constructor; simpl; intros; subst; try contradiction.
destruct H0; subst; try assumption. contradiction.
Qed.
Lemma split_splits: forall m m1 m2,
map.split m m1 m2 ->
splits [m] [m1; m2].
Proof.
unfold map.split, splits, join. simpl. intros. destruct H. subst. split.
- rewrite ?map.putmany_empty_r. reflexivity.
- repeat constructor; simpl; intros; try contradiction.
destruct H; subst; firstorder idtac.
Qed.
Lemma splits_split: forall m m1 m2,
splits [m] [m1; m2] ->
map.split m m1 m2.
Proof.
unfold map.split, splits, join. simpl. intros. destruct H as (?&?&?).
apply mut_disj_disjoint in H1.
rewrite ?map.putmany_empty_r in H.
auto.
Qed.
Axiom split_spec: forall (M A B: map),
map.split M A B <-> forall k,
(exists v, map.get M k = Some v /\
((map.get A k = Some v /\ map.get B k = None) \/
(map.get B k = Some v /\ map.get A k = None))) \/
(map.get M k = None /\ map.get A k = None /\ map.get B k = None).
Axiom putmany_spec: forall (m1 m2: map) k,
(exists v, map.get (map.putmany m1 m2) k = Some v /\
(map.get m2 k = Some v \/ (map.get m2 k = None /\ map.get m1 k = Some v))) \/
(map.get (map.putmany m1 m2) k = None /\ map.get m2 k = None /\ map.get m1 k = None).
Axiom getmany_of_list_shrink: forall (l l1 l2: map) keys,
map.split l l1 l2 ->
Forall (fun k => map.get l2 k = None) keys ->
map.getmany_of_list l keys = map.getmany_of_list l1 keys.
Axiom putmany_of_list_zip_split: forall (l l' l1 l2: map) keys values,
map.putmany_of_list_zip keys values l = Some l' ->
map.split l l1 l2 ->
Forall (fun k => map.get l2 k = None) keys ->
exists l1', map.split l' l1' l2 /\ map.putmany_of_list_zip keys values l1 = Some l1'.
Axiom putmany_of_list_zip_grow: forall (l l1 l1' l2: map) keys values,
map.putmany_of_list_zip keys values l1 = Some l1' ->
map.split l l1 l2 ->
Forall (fun k => map.get l2 k = None) keys ->
exists l', map.split l' l1' l2 /\ map.putmany_of_list_zip keys values l = Some l'.
Lemma getmany_of_list_preserved: forall (l1 l2: map) ks,
(forall k, In k ks -> map.get l1 k = map.get l2 k) ->
map.getmany_of_list l1 ks = map.getmany_of_list l2 ks.
Proof.
induction ks; intros. 1: reflexivity.
unfold map.getmany_of_list in *. simpl.
rewrite IHks. 2: {
intros. eapply H. simpl. auto.
}
specialize (H a). simpl in H. rewrite H. 2: auto.
reflexivity.
Qed.
(* disjoint-unions *)
Definition dus'(l: list (option map)): option map :=
List.fold_left (fun res e => disj_putmany res e) l (Some map.empty).
Fixpoint dus (xs : list (option map)) : option map :=
match xs with
| [x] => x
| x :: xs => disj_putmany (dus xs) x
| nil => Some map.empty
end.
End MAP.
End map.
Section Spilling.
Notation stmt := (stmt Z).
Definition zero := 0.
Definition ra := 1.
Definition sp := 2.
Definition tmp1 := 3.
Definition tmp2 := 4.
Definition fp := 5. (* returned by stackalloc, always a constant away from sp: a wasted register *)
Definition regvar0 := 6.
(* TODO: storing value returned by stackalloc into a register is always a wasted register,
because it's constant away from the stackpointer
integrate spilling into FlatToRiscv?
Or make StackImp language with same syntax as FlatImp but with a stack in the memory and
which shares the register file among function calls? *)
(* Definition needs_spilling: Z -> bool := Z.leb 32. *)
Context {W: Utility.Words} {mem: map.map word byte} {mem_ok: map.ok mem}.
Definition stack_loc(r: Z): option Z :=
if Z.leb 32 r then Some ((r - 32) * bytes_per_word) else None.
Definition arg_reg1(r: Z): Z := if Z.leb 32 r then tmp1 else r.
Definition arg_reg2(r: Z): Z := if Z.leb 32 r then tmp2 else r.
Definition res_reg(r: Z): Z := if Z.leb 32 r then tmp1 else r.
Definition load_arg_reg1(r: Z): stmt :=
match stack_loc r with
| Some o => SLoad Syntax.access_size.word tmp1 fp o
| None => SSkip
end.
Definition load_arg_reg2(r: Z): stmt :=
match stack_loc r with
| Some o => SLoad Syntax.access_size.word tmp2 fp o
| None => SSkip
end.
Definition save_res_reg(r: Z): stmt :=
match stack_loc r with
| Some o => SStore Syntax.access_size.word fp tmp1 o
| None => SSkip
end.
Notation "s1 ;; s2" := (SSeq s1 s2) (right associativity, at level 100).
Definition prepare_bcond(c: bcond Z): stmt :=
match c with
| CondBinary _ x y => load_arg_reg1 x;; load_arg_reg2 y
| CondNez x => load_arg_reg1 x
end.
Definition spill_bcond(c: bcond Z): bcond Z :=
match c with
| CondBinary op x y => CondBinary op (arg_reg1 x) (arg_reg2 y)
| CondNez x => CondNez (arg_reg1 x)
end.
Fixpoint spill_stmt(s: stmt): stmt :=
match s with
| SLoad sz x y o =>
load_arg_reg1 y;;
SLoad sz (res_reg x) (arg_reg1 y) o;;
save_res_reg x
| SStore sz x y o =>
load_arg_reg1 x;; load_arg_reg2 y;;
SStore sz (arg_reg1 x) (arg_reg2 y) o
| SStackalloc x n body =>
SStackalloc (res_reg x) n (save_res_reg x;; spill_stmt body)
| SLit x n =>
SLit (res_reg x) n;;
save_res_reg x
| SOp x op y z =>
load_arg_reg1 y;; load_arg_reg2 z;;
SOp (res_reg x) op (arg_reg1 y) (arg_reg2 z);;
save_res_reg x
| SSet x y => (* TODO could be optimized if exactly one is on the stack *)
load_arg_reg1 y;;
SSet (res_reg x) (arg_reg1 y);;
save_res_reg x
| SIf c thn els =>
prepare_bcond c;;
SIf (spill_bcond c) (spill_stmt thn) (spill_stmt els)
| SLoop s1 c s2 =>
SLoop (spill_stmt s1;; prepare_bcond c) (spill_bcond c) (spill_stmt s2)
| SSeq s1 s2 => SSeq (spill_stmt s1) (spill_stmt s2)
| SSkip => SSkip
(* Note: these two are only correct if argvars and resvars all are registers! *)
| SCall argvars f resvars => SCall argvars f resvars
| SInteract argvars f resvars => SInteract argvars f resvars
end.
Definition valid_vars_bcond(c: bcond Z): Prop :=
match c with
| CondBinary _ x y => fp < x /\ fp < y
| CondNez x => fp < x
end.
(*
Fixpoint calls_use_registers(s: stmt): bool :=
match s with
| SLoad _ _ _ _ | SStore _ _ _ _ | SLit _ _ | SOp _ _ _ _ | SSet _ _ | SSkip => true
| SStackalloc x n body => calls_use_registers body
| SIf _ s1 s2 | SLoop s1 _ s2 | SSeq s1 s2 => calls_use_registers s1 && calls_use_registers s2
| SCall argvars _ resvars | SInteract argvars _ resvars =>
List.forallb (Z.gtb 32) argvars && List.forallb (Z.gtb 32) resvars
end.
*)
Definition max_var_bcond(c: bcond Z): Z :=
match c with
| CondBinary _ x y => Z.max x y
| CondNez x => x
end.
Fixpoint max_var(s: stmt): Z :=
match s with
| SLoad _ x y _ | SStore _ x y _ | SSet x y => Z.max x y
| SStackalloc x n body => Z.max x (max_var body)
| SLit x _ => x
| SOp x _ y z => Z.max x (Z.max y z)
| SIf c s1 s2 | SLoop s1 c s2 => Z.max (max_var_bcond c) (Z.max (max_var s1) (max_var s2))
| SSeq s1 s2 => Z.max (max_var s1) (max_var s2)
| SSkip => 0
(* Variables involved in function calls are not spilled, so we can ignore them *)
| SCall argvars f resvars | SInteract argvars f resvars => 0
end.
Definition spill_fbody(s: stmt): stmt :=
SStackalloc fp (bytes_per_word * (max_var s - 32)) (spill_stmt s).
Context {locals: map.map Z word}.
Context {localsOk: map.ok locals}.
Context {env: map.map String.string (list Z * list Z * stmt)}.
Context (ext_spec: list (mem * String.string * list word * (mem * list word)) ->
mem -> String.string -> list word -> (mem -> list word -> Prop) -> Prop).
Instance semanticsParams: FlatImp.parameters Z. refine ({|
FlatImp.varname_eqb := Z.eqb;
FlatImp.locals := locals;
FlatImp.ext_spec := ext_spec;
|}).
Defined.
Definition valid_vars_src(maxvar: Z): stmt -> Prop :=
Forall_vars_stmt (fun x => fp < x <= maxvar) (fun x => fp < x < 32).
Definition valid_vars_tgt: stmt -> Prop :=
Forall_vars_stmt (fun x => sp < x <= 32) (fun x => sp < x < 32).
Lemma spill_stmt_valid_vars: forall s m,
max_var s <= m ->
valid_vars_src m s ->
valid_vars_tgt (spill_stmt s).
Proof.
(* Wihtout the clear, firstorder becomes very slow COQBUG https://github.com/coq/coq/issues/11352.
Not using firstorder though because there's something higher order here: *)
clear mem mem_ok locals localsOk env ext_spec.
assert (forall vars, Forall (fun x : Z => 5 < x < 32) vars -> Forall (fun x : Z => 2 < x < 32) vars). {
intros. eapply Forall_impl. 2: eassumption. simpl. blia.
}
unfold valid_vars_src, valid_vars_tgt.
induction s; simpl; intros;
repeat match goal with
| c: bcond Z |- _ => destr c
| |- context[Z.leb ?x ?y] => destr (Z.leb x y)
| |- _ => progress simpl
| |- _ => progress unfold tmp1, tmp2, sp, fp, res_reg, arg_reg1, arg_reg2, res_reg,
spill_bcond, max_var_bcond, ForallVars_bcond, prepare_bcond,
load_arg_reg1, load_arg_reg2, save_res_reg, stack_loc in *
end;
try blia;
simp;
repeat match goal with
| IH: _, H: Forall_vars_stmt _ _ _ |- _ =>
specialize IH with (2 := H);
match type of IH with
| ?P -> _ => let A := fresh in assert P as A by blia; specialize (IH A); clear A
end
end;
eauto;
intuition try blia.
Qed.
Definition oeq{T: Type}(oL oR: option T): Prop := exists L R, oL = Some L /\ oR = Some R /\ oL = oR.
Notation "a \+/ b" := (map.disj_putmany a b) (at level 34, left associativity).
Notation "a \</ b" := (map.putmanyo a b) (at level 34, left associativity).
Notation "a \?/ b" := (map.agreeing_putmany a b) (at level 34, left associativity).
Notation "k ~> v" := (Some (map.put map.empty k v)) (at level 30).
Infix "==" := oeq (at level 38).
Definition one(sz: Syntax.access_size.access_size)(addr value: word): option mem :=
Some (map.putmany_of_tuple (Memory.footprint addr (@Memory.bytes_per width sz))
(LittleEndian.split (@Memory.bytes_per width sz) (word.unsigned value))
map.empty).
Definition array{T: Type}(elem: word -> T -> option mem)(size: word): word -> list T -> option mem :=
fix rec addr ls :=
match ls with
| [] => Some map.empty
| e :: es => elem addr e \+/ rec (word.add addr size) es
end.
Definition word_array: word -> list word -> option mem :=
array (one Syntax.access_size.word) (word.of_Z bytes_per_word).
Definition related(maxvar: Z)(frame: option mem)(done: bool)
(t1: trace)(m1: option mem)(l1: option locals)(mc1: MetricLog)
(t2: trace)(m2: option mem)(l2: option locals)(mc2: MetricLog): Prop :=
exists fpval tmp1val tmp2val lStack lRegs stackwords,
t1 = t2 /\
m2 == m1 \+/ word_array fpval stackwords \+/ frame /\
subset (map.domo lRegs) (fun x => fp < x < 32) /\
subset (map.domo lStack) (fun x => 32 <= x <= maxvar) /\
l1 = lRegs \+/ lStack /\
l2 = lRegs \+/ tmp1 ~> tmp1val \+/ tmp2 ~> tmp2val \+/ fp ~> fpval /\
forall r, 32 <= r <= maxvar -> forall v, map.geto lStack r = Some v ->
nth_error stackwords (Z.to_nat (r - 32)) = Some v.
(*
Notation "m [ k := v ]" := (map.put m k v) (at level 10, left associativity, format "m [ k := v ]").
Notation "m [ k ]" := (map.get m k) (at level 10, left associativity, format "m [ k ]").
(* this notation overrides the notation for applying a function m to the singleton list containing k,
but that's so rare that it's fine *)
Definition related(maxvar: Z)(frame: mem)(done: bool):
FlatImp.SimState Z -> FlatImp.SimState Z -> Prop :=
fun '(t1, m1, l1, mc1) '(t2, m2, l2, mc2) =>
exists fpval tmp1val tmp2val mStack lStack lRegs,
t1 = t2 /\
m2 = map.putmany m1 (map.putmany mStack frame) /\
disjoint (map.dom m1) (map.dom mStack) /\
disjoint (map.dom m1) (map.dom frame) /\
disjoint (map.dom mStack) (map.dom frame) /\
subset (map.dom lRegs) (fun x => fp < x < 32) /\
subset (map.dom lStack) (fun x => 32 <= x <= maxvar) /\
l1 = map.putmany lRegs lStack /\
l2 = lRegs[tmp1 := tmp1val][tmp2 := tmp2val][fp := fpval] /\
spilled_vars fpval maxvar lStack mStack.
Definition related(maxvar: Z)(frame: option mem)(done: bool)
(t1: trace)(m1: option mem)(l1: option locals)(mc1: MetricLog)
(t2: trace)(m2: option mem)(l2: option locals)(mc2: MetricLog): Prop :=
exists fpval tmp1val tmp2val mStack lStack lRegs,
t1 = t2 /\
m2 = m1 \+/ mStack \+/ frame /\
subset (map.domo lRegs) (fun x => fp < x < 32) /\
subset (map.domo lStack) (fun x => 32 <= x <= maxvar) /\
l1 = lRegs \+/ lStack /\
l2 = lRegs \+/ tmp1 ~> tmp1val \+/ tmp2 ~> tmp2val \+/ fp ~> fpval /\
spilled_vars fpval maxvar lStack mStack.
Definition related(maxvar: Z)(frame: mem)(done: bool):
FlatImp.SimState Z -> FlatImp.SimState Z -> Prop :=
fun '(t1, m1, l1, mc1) '(t2, m2, l2, mc2) =>
exists fpval tmp1val tmp2val mStack lStack lRegs,
t1 = t2 /\
Some m2 = Some m1 \+/ Some mStack \+/ Some frame /\
subset (map.dom lRegs) (fun x => fp < x < 32) /\
subset (map.dom lStack) (fun x => 32 <= x <= maxvar) /\
Some l1 = Some lRegs \+/ Some lStack /\
Some l2 = Some lRegs \+/ tmp1 ~> tmp1val \+/ tmp2 ~> tmp2val \+/ fp ~> fpval /\
spilled_vars fpval maxvar lStack mStack.
Notation "k ~> v" := (map.put map.empty k v) (at level 30).
Definition related(maxvar: Z)(frame: mem)(done: bool):
FlatImp.SimState Z -> FlatImp.SimState Z -> Prop :=
fun '(t1, m1, l1, mc1) '(t2, m2, l2, mc2) =>
exists fpval tmp1val tmp2val mStack lStack lRegs,
t1 = t2 /\
map.splits [m2] [m1; mStack; frame] /\
subset (map.dom lRegs) (fun x => fp < x < 32) /\
subset (map.dom lStack) (fun x => 32 <= x <= maxvar) /\
map.splits [l1] [lRegs; lStack] /\
map.splits [l2] [lRegs; tmp1 ~> tmp1val; tmp2 ~> tmp2val; fp ~> fpval] /\
spilled_vars fpval maxvar lStack mStack.
*)
Definition envs_related(e1 e2: env): Prop :=
forall f argvars resvars body1,
map.get e1 f = Some (argvars, resvars, body1) ->
map.get e2 f = Some (argvars, resvars, spill_fbody body1).
Lemma seq_cps: forall e s1 s2 t m l mc post,
exec e s1 t m l mc (fun t' m' l' mc' => exec e s2 t' m' l' mc' post) ->
exec e (SSeq s1 s2) t m l mc post.
Proof.
intros. eapply exec.seq. 1: eassumption. simpl. clear. auto.
Qed.
Lemma load_putmany_l: forall m1 m2 sz a v,
Memory.load sz m1 a = Some v ->
disjoint (map.dom m1) (map.dom m2) ->
Memory.load sz (map.putmany m1 m2) a = Some v.
Proof.
Admitted.
(* cps style
Lemma load_arg_reg1_correct: forall e a t m l mc post,
post ... ->
exec e (load_arg_reg1 a) t m l mc post. *)
(* seq style
Lemma load_arg_reg1_correct: forall e s a t m l mc post,
exec e s t
exec e (SSeq (load_arg_reg1 a) s) t m l mc post. *)
Arguments map.disj_putmany : simpl never.
Implicit Types post : trace -> option mem -> option locals -> MetricLog -> Prop.
Section WithE.
Variable (e: env).
(*
Definition ext_spec' t mGive action argvals (outcome: mem -> list word -> Prop) :=
match mGive with
| Some mGive => ext_spec t mGive action argvals outcome
| None => False
end.
Definition ext_spec' t mGive action argvals (outcome: option mem -> list word -> Prop) :=
match mGive with
| Some mGive => ext_spec t mGive action argvals
(fun mReceive resvals => outcome (Some mReceive) resvals)
| None => False
end.
*)
Inductive exec:
stmt ->
trace -> option mem -> option locals -> MetricLog ->
(trace -> option mem -> option locals -> MetricLog -> Prop)
-> Prop :=
| interact: forall t m mKeep mGive l l_not_read l_not_written oldresvals mc action argvars
argvals resvars outcome post,
m == mKeep \+/ Some mGive ->
l == l_not_read \+/ map.of_list_zip argvars argvals ->
l == l_not_written \+/ map.of_list_zip resvars oldresvals ->
ext_spec t mGive action argvals outcome ->
(forall mReceive resvals,
outcome mReceive resvals ->
exists l', l' == l_not_written \+/ map.of_list_zip resvars resvals /\
forall m', m' == mKeep \+/ Some mReceive ->
post (((mGive, action, argvals), (mReceive, resvals)) :: t) m' l'
(addMetricInstructions 1
(addMetricStores 1
(addMetricLoads 2 mc)))) ->
exec (SInteract resvars action argvars) t m l mc post
| call: forall t m l mc binds fname args params rets fbody (*argvs st0*) post (* outcome *),
map.get e fname = Some (params, rets, fbody) ->
(* TODO
map.getmany_of_list l args = Some argvs ->
map.putmany_of_list_zip params argvs map.empty = Some st0 ->
exec fbody t m st0 mc outcome ->
(forall t' m' mc' st1,
outcome t' m' st1 mc' ->
exists retvs l',
map.getmany_of_list st1 rets = Some retvs /\
map.putmany_of_list_zip binds retvs l = Some l' /\
post t' m' l' mc') ->
*)
exec (SCall binds fname args) t m l mc post
| load: forall t m mFrame l l' lFrame mc sz x a o v addr post,
l == lFrame \+/ a ~> addr ->
m == mFrame \+/ one sz (word.add addr (word.of_Z o)) v ->
l' == l \</ x ~> v ->
post t m l'
(addMetricLoads 2
(addMetricInstructions 1 mc)) ->
exec (SLoad sz x a o) t m l mc post
| store: forall t (m mFrame m': option mem) mc l lFrame sz a o addr v (val oldval: word) post,
l == lFrame \+/ (a ~> addr \?/ v ~> val) ->
m == mFrame \+/ one sz (word.add addr (word.of_Z o)) oldval ->
m' == mFrame \+/ one sz (word.add addr (word.of_Z o)) val ->
post t m' l
(addMetricLoads 1
(addMetricInstructions 1
(addMetricStores 1 mc))) ->
exec (SStore sz a v o) t m l mc post
| stackalloc: forall t mSmall l mc x n body post,
n mod bytes_per_word = 0 ->
(forall l0 a stacktrash mCombined,
mCombined == mSmall \+/ map.of_disjoint_list_zip (Memory.ftprint a n) stacktrash ->
l0 == l \</ x ~> a ->
exec body t mCombined l0 (addMetricLoads 1 (addMetricInstructions 1 mc))
(fun t' mCombined' l' mc' =>
exists mSmall' stacktrash',
mCombined' == mSmall' \+/ map.of_disjoint_list_zip (Memory.ftprint a n) stacktrash' /\
post t' mSmall' l' mc')) ->
exec (SStackalloc x n body) t mSmall l mc post
(*
| lit: forall t m l mc x v post,
post t m (map.put l x (word.of_Z v))
(addMetricLoads 8
(addMetricInstructions 8 mc)) ->
exec (SLit x v) t m l mc post
*)
| op: forall t m l l' lFrame mc x op y y' z z' post,
l == lFrame \+/ (y ~> y' \?/ z ~> z') ->
l' == l \</ x ~> Semantics.interp_binop op y' z' ->
post t m l'
(addMetricLoads 2
(addMetricInstructions 2 mc)) ->
exec (SOp x op y z) t m l mc post
(*
| set: forall t m l mc x y y' post,
map.get l y = Some y' ->
post t m (map.put l x y')
(addMetricLoads 1
(addMetricInstructions 1 mc)) ->
exec (SSet x y) t m l mc post
| if_true: forall t m l mc cond bThen bElse post,
eval_bcond l cond = Some true ->
exec bThen t m l
(addMetricLoads 2
(addMetricInstructions 2
(addMetricJumps 1 mc))) post ->
exec (SIf cond bThen bElse) t m l mc post
| if_false: forall t m l mc cond bThen bElse post,
eval_bcond l cond = Some false ->
exec bElse t m l
(addMetricLoads 2
(addMetricInstructions 2
(addMetricJumps 1 mc))) post ->
exec (SIf cond bThen bElse) t m l mc post
| loop: forall t m l mc cond body1 body2 mid1 mid2 post,
(* This case is carefully crafted in such a way that recursive uses of exec
only appear under forall and ->, but not under exists, /\, \/, to make sure the
auto-generated induction principle contains an IH for all recursive uses. *)
exec body1 t m l mc mid1 ->
(forall t' m' l' mc',
mid1 t' m' l' mc' ->
eval_bcond l' cond <> None) ->
(forall t' m' l' mc',
mid1 t' m' l' mc' ->
eval_bcond l' cond = Some false ->
post t' m' l'
(addMetricLoads 1
(addMetricInstructions 1
(addMetricJumps 1 mc')))) ->
(forall t' m' l' mc',
mid1 t' m' l' mc' ->
eval_bcond l' cond = Some true ->
exec body2 t' m' l' mc' mid2) ->
(forall t'' m'' l'' mc'',
mid2 t'' m'' l'' mc'' ->
exec (SLoop body1 cond body2) t'' m'' l''
(addMetricLoads 2
(addMetricInstructions 2
(addMetricJumps 1 mc''))) post) ->
exec (SLoop body1 cond body2) t m l mc post
| seq: forall t m l mc s1 s2 mid post,
exec s1 t m l mc mid ->
(forall t' m' l' mc', mid t' m' l' mc' -> exec s2 t' m' l' mc' post) ->
exec (SSeq s1 s2) t m l mc post
| skip: forall t m l mc post,
post t m l mc ->
exec SSkip t m l mc post
*)
.
End WithE.
Lemma mem_eq_trans: forall m1 m2 m3: option mem,
m1 == m2 -> m2 == m3 -> m1 == m3.
Admitted.
Lemma mem_eq_rewrite: forall F A L R: option mem,
L == R ->
A == L \+/ F ->
A == R \+/ F.
Admitted.
(* Note: does not hold if m is None! *)
Lemma mem_eq_refl: forall m A B: option mem,
A == B \+/ m -> (* <-- to assert that m is not None *)
m == m.
Proof.
unfold oeq, map.disj_putmany. intros. simp. clear. eauto.
Qed.
Section cancel_lemmas.
Let nth n xs := hd (@None mem) (skipn n xs).
Let remove_nth n (xs : list (option mem)) :=
(firstn n xs ++ tl (skipn n xs)).
Lemma mem_eq_cancel_at: forall (i j: nat) (xs ys: list (option mem)),
nth i xs = nth j ys ->
map.dus (remove_nth i xs) == map.dus (remove_nth j ys) ->
map.dus xs == map.dus ys.
Proof.
Admitted.
End cancel_lemmas.
Ltac cancel_at_indices i j :=
lazymatch goal with
| |- map.dus ?LHS == map.dus ?RHS =>
simple refine (mem_eq_cancel_at i j LHS RHS _ _);
cbn [firstn skipn List.app hd tl]
end.
Lemma spilling_correct (e e1 e2 : env) (Ev : envs_related e1 e2)
(s1 : stmt)
(t1 : trace)
(m1 : option mem)
(l1 : option locals)
(mc1 : MetricLog)
(post : trace -> option mem -> option locals -> MetricLog -> Prop):
exec e1 s1 t1 m1 l1 mc1 post ->
forall (frame : option mem) (maxvar : Z),
valid_vars_src maxvar s1 ->
forall (t2 : trace) (m2 : option mem) (l2 : option locals) (mc2 : MetricLog),
related maxvar frame false t1 m1 l1 mc1 t2 m2 l2 mc2 ->
exec e2 (spill_stmt s1) t2 m2 l2 mc2
(fun (t2' : trace) (m2' : option mem) (l2' : option locals) (mc2' : MetricLog) =>
exists t1' m1' l1' mc1',
related maxvar frame false t1' m1' l1' mc1' t2' m2' l2' mc2' /\
post t1' m1' l1' mc1').
Proof.
unfold related. induction 1; intros; simp; subst.
- (* exec.interact *)
eapply interact.
+ eapply mem_eq_trans. 1: eassumption.
eapply mem_eq_trans.
* eapply mem_eq_rewrite. 1: exact H.
match goal with
| |- ?L1 \+/ ?L2 \+/ ?L3 == ?R1 \+/ ?R2 =>
change (map.dus [L3; L2; L1] == map.dus [R2; R1])
end.
cancel_at_indices 2%nat 1%nat. 1: reflexivity.
cbv [map.dus].
eapply mem_eq_refl.
eapply mem_eq_trans. 1: exact H5p0.
match goal with
| |- ?L1 \+/ ?L2 \+/ ?L3 == ?R1 \+/ ?R2 =>
change (map.dus [L3; L2; L1] == map.dus [R2; R1])
end.
(*
Lemma spilling_sim(e1 e2: env):
envs_related e1 e2 ->
forall frame s1 maxvar,
valid_vars_src maxvar s1 ->
simulation (SimExec Z e1 s1) (SimExec Z e2 (spill_stmt s1))
(related maxvar frame).
Proof.
unfold simulation, SimExec.
intros Ev frame s1 maxvar V (((t1 & m1) & l1) & mc1) (((t2 & m2) & l2) & mc2) post1 R Exec.
revert frame maxvar V t2 m2 l2 mc2 R.
unfold compile_inv, related.
match type of Exec with
| FlatImp.exec _ _ _ _ _ _ ?P => remember P as post
end.
revert post1 Heqpost.
induction Exec; simpl; intros; simp; subst.
- (* exec.interact *)
- (* exec.interact *)
eapply map.split_splits in H.
eapply @exec.interact with (mGive := mGive) (mKeep := map.putmany mKeep (map.putmany mStack frame)).
+ eapply map.splits_split.
(*
disjoint union on "option map" ?
m \+/ mStack \+/ frame
lRegs \+/ tmp1 ~> tmp1val \+/ tmp2 ~> tmp2val
but what to pass to exec.interact? -> also "option map"
disjoint_putmany
just congruence:
a = c ->
b = d ->
a \+/ b = c \+/ d
*)
+ unfold map.split in *; simp. split.
* remember (map.putmany mStack frame) as A.
rewrite <- map.putmany_assoc.
{ erewrite <- (@map.putmany_assoc _ _ _ _ _ word.eqb_spec).
{ f_equal.
apply map.putmany_comm.
subst A.
1: exact mem_ok.
{ assert (map.ok FlatImp.mem = map.ok mem). {
clear.
reflexivity.
rewrite <- (@map.putmany_assoc _ _ _ mem_ok word.eqb).
subst. eapply split_interact; try eassumption.
+ erewrite map__getmany_of_list_shrink. 2: eassumption. 2: {
eapply Forall_impl. 2: eassumption.
clear -localsOk. unfold fp, tmp1, tmp2. intros.
rewrite ?map.get_put_dec.
rewrite ?(proj2 (Z.eqb_neq _ _ )) by blia.
apply map.get_empty.
}
erewrite <- map__getmany_of_list_shrink; [eassumption..|].
eapply Forall_impl. 2: eassumption.
simpl.
intros. unfold map__dom_in in *.
destr (map.get lStack a). 2: reflexivity.
match goal with
| H: forall _, _ |- _ => specialize H with (1 := E)
end.
blia.
+ eassumption.
+ intros.
match goal with
| H: context[outcome], A: context[outcome] |- _ =>
specialize H with (1 := A); move H at bottom
end.
simp.
pose proof H2l as P.
eapply map__putmany_of_list_zip_split in P. 2: eassumption. 2: {
eapply Forall_impl. 2: eassumption.
simpl.
intros. unfold map__dom_in in *.
destr (map.get lStack a). 2: reflexivity.
match goal with
| H: forall _, _ |- _ => specialize H with (1 := E)
end.
blia.
}
simp.
eapply map__putmany_of_list_zip_grow with (l := l2) in Pr. 2: eassumption. 2: {
eapply Forall_impl. 2: eassumption.
clear -localsOk. unfold fp, tmp1, tmp2. intros.
rewrite ?map.get_put_dec.
rewrite ?(proj2 (Z.eqb_neq _ _ )) by blia.
apply map.get_empty.
}
destruct Pr as (l2' & ? & ?).
eexists. split. 1: eassumption.
intros.
repeat match goal with
| |- exists (_: FlatImp.SimState _), _ => refine (ex_intro _ (_, _, _, _) _)
| |- exists _, _ => eexists
| |- _ /\ _ => split
end.
9: eapply H2r.
1: reflexivity.
8: eapply split_interact_shrink; eassumption.
1: eapply split_interact_assoc; eassumption.
1: eassumption.
5: eassumption.
4: eassumption.
3: eassumption.
2: eassumption.
assert (map__dom_in (map.put (map.put (map.put map.empty fp fpval) tmp2 tmp2val) tmp1 tmp1val)
(fun x => x = fp \/ x = tmp2 \/ x = tmp1)) as A. {
unfold map__dom_in. clear -localsOk. intros. rewrite ?map.get_put_dec in H.
repeat destruct_one_match_hyp; subst; auto.
rewrite map.get_empty in H. discriminate.
}
pose proof map__split_dom_in _ _ _ _ _ Rrrrrrrl Rrrrl A as B. simpl in B.
pose proof map__putmany_of_list_zip_dom_in as C.
specialize C with (1 := H4) (2 := B). simpl in C.
apply map__split_dom_spec in H2. simp.
assert (subset (of_list resvars) (fun x : Z => fp < x < 32)) as Vl' by admit.
assert (subset (of_list argvars) (fun x : Z => fp < x < 32)) as Vr' by admit.
change (map__dom_in l2' (union (fun x : Z => (fp < x < 32 \/ x = fp \/ x = tmp2 \/ x = tmp1)) (of_list resvars))) in C.
assert (subset (map__dom l2') (union (fun x : Z => (fp < x < 32 \/ x = fp \/ x = tmp2 \/ x = tmp1)) (of_list resvars))) as C' by admit.
clear - H2l0 H2r0 Vl' C'.
unfold fp, tmp1, tmp2 in *.
replace (map__dom (map.put (map.put (map.put map.empty 5 fpval) 4 tmp2val) 3 tmp1val)) with
(fun x => x = 5 \/ x = 4 \/ x = 3) in * by admit.
assert (subset (map__dom l1') (fun x : Z => fp < x < 32)). {
set_solver_generic Z; try blia.
}
admit. (* ok, but TODO use map__dom instead of map__dom_in *)
- (* exec.call *)
admit.
- (* exec.load *)
eapply seq_cps.
unfold load_arg_reg1, arg_reg1, save_res_reg, res_reg, stack_loc.
destr (Z.leb 32 a).
+ match goal with
| H: spilled_vars _ _ _ _ |- _ => pose proof H as A
end.
unfold spilled_vars in A.
assert (32 <= a <= maxvar) as B by blia. specialize A with (1 := B); clear B. simp.
eapply exec.load with (addr0 := fpval) (v1 := v0).
* admit. (* ok *)
* eapply grow_load. 1: eassumption.
jj
admit. (* growing from mStack to m2 preserves Memory.load *)
* eapply seq_cps. eapply exec.load. {
rewrite map.get_put_same. reflexivity.
} {
match goal with
| |- _ = ?opt => unify opt (Some v)
end.
assert (map.get lStack a = Some addr) as B by admit.
specialize Ar with (1 := B). subst v0.
(* growing from m to m2 preserves Memory.load *)
admit.
} {
destr (Z.leb 32 x).
- eapply exec.store.
+ rewrite ?map.get_put_diff by (cbv; discriminate).
match goal with
| |- _ = ?opt => unify opt (Some fpval)
end.
admit. (* ok *)
+ rewrite map.get_put_same. reflexivity.
+ admit. (* memory stuff... *)
+ repeat match goal with
| |- exists (_: FlatImp.SimState _), _ => refine (ex_intro _ (_, _, _, _) _)
| |- exists _, _ => eexists
| |- _ /\ _ => split
end.
1: reflexivity.
8: eassumption.
* admit.
* admit.
* admit.
* admit.
* admit.
* rewrite map.put_put_same. admit.
* admit.
- admit.
}
+ admit.
- (* exec.store *)
admit.
- (* exec.stackalloc *)
rename H1 into IH.
unfold save_res_reg, res_reg, stack_loc.
destr (Z.leb 32 x).
+ eapply exec.stackalloc. 1: assumption.
intros. eapply seq_cps. eapply exec.store.
* rewrite map.get_put_diff by discriminate.
match goal with
| |- _ = ?opt => unify opt (Some fpval)
end.
admit. (* ok *)
* rewrite map.get_put_same. reflexivity.
* unfold Memory.store, Memory.store_Z, Memory.store_bytes.
destruct_one_match. 2: admit. (* shouldn't happen *)
reflexivity.
* eapply exec.weaken. {
pose (fun m => (Memory.unchecked_store_bytes (Memory.bytes_per Syntax.access_size.word) m
(word.add fpval (word.of_Z ((x - 32) * bytes_per_word)))
(LittleEndian.split (@Memory.bytes_per width Syntax.access_size.word) (word.unsigned a)))) as upd.
match goal with
| |- exec _ _ _ ?M _ _ _ => change M with (upd mCombined)
end.
rename mStack0 into mStackHL.
(* mStack is our stack memory used for spilling, while mStackHL is allocated by this
SStackalloc and exposed as memory to the source program *)
eapply IH with (mCombined := map.putmany mSmall mStackHL) (frame := frame)
(post2 := fun '(t', m', l', mc') =>
exists mSmall' mStack',
Memory.anybytes a n mStack' /\ map.split m' mSmall' mStack' /\
post1 (t', mSmall', l', mc')).
1: eassumption.
1: eapply split_stackalloc_1; eassumption.
1: reflexivity.
1: eassumption.
(* existentials to pick to satisfy relation before invoking IH *)
eexists fpval, a, tmp2val, (upd mL), (upd mStack), (map.put lStack x a), lRegs.
ssplit.
1: reflexivity.
1: {
eapply split_stackalloc_2 with (m3 := upd m2). 1,2: admit. (* ok *)
}
1: admit. (* ok *)
1: eassumption.
1: eapply map__dom_in_put; [assumption|blia].
1: admit. (* ok *)
1: admit. (* ok *)
1: admit. (* ok *)
}
simpl. intros. simp.
exists (map.putmany mSmall' mL0), mStack'.
repeat match goal with
| |- exists (_: FlatImp.SimState _), _ => refine (ex_intro _ (_, _, _, _) _)
| |- exists _, _ => eexists
| |- _ /\ _ => split
end.
11: eassumption.
1: eassumption.
1: eapply split_stackalloc_2; eassumption.
1: reflexivity.
1: {
match goal with
| |- map.split _ _ ?M => unify M mL0
end.
eapply split_stackalloc_1; eassumption.
}
1: eassumption.
5: eassumption.
all: try eassumption.
+ admit. (* same but without spilling *)
- (* exec.lit *)
admit.
- (* exec.op *)
admit.
- (* exec.set *)
admit.
- (* exec.if_true *)
unfold prepare_bcond. destruct cond.
+ simpl. eapply seq_cps. eapply seq_cps. simpl in *. simp.
unfold load_arg_reg1, arg_reg1, load_arg_reg2, arg_reg2, save_res_reg, res_reg, stack_loc.
destr (Z.leb 32 x).
* match goal with
| H: spilled_vars _ _ _ _ |- _ => pose proof H as A
end.
unfold spilled_vars in A.
assert (32 <= x <= maxvar) as B by blia.
specialize A with (1 := B); clear B. simp.
eapply exec.load with (addr := fpval).
{ admit. }
{
Search Memory.load map.split.
exact Al. eassumption. }
match goal with
| H: spilled_vars _ _ _ _ |- _ => pose proof H as A
end.
unfold spilled_vars in A.
assert (32 <= a <= maxvar) as B by blia. specialize A with (1 := B); clear B. simp.
eapply exec.load with (addr0 := fpval) (v1 := v0).
* admit. (* ok *)
- (* exec.if_false *)
- (* exec.loop *)
- (* exec.seq *)
- (* exec.skip *)
*)
Abort.
End Spilling.
| 2024-03-08T01:26:29.851802 | https://example.com/article/2133 |
We do not know the status of the rebellion on Urantia, post 1900, SEla_Kelly. That is the issue. The Celestials present the history of Satania's rebellion in the papers up to that year. Currently, the status of the rebellion on Urantia is unknown, and we yet remain quarantined and open circuited. We would need a 6th epochal revelation to establish the facts of rebellion, post 1900.
As I type this post, Caligastia et al. freely roam the planet prosecuting nefarious designs. Both Dali- and Cali-gastia have not been interned. Why? Why are they being allowed to promote sophistries on a quarantined planet ?
SEla_Kelly wrote:
Pardon me fanofVan for interjecting here again without the text, but isn't there a part that mentions how the angels, at the dawn of Lucifer's grasp for power, could simply not fathom how such an exquisite Son of God (Lanonandek) could falter? Brooklyn if this is true, then the initial tide of angelic rebellion would represent a change from a single event. After this, is the civil defence, the learning from the mistakes, and in the creation of new orders of angeln, by the Divine Minister, would possess certain immunities, beyond some education they may receive before advancing the votives of the Infinite Spirit abroad in Nebadon.
So I think you are alluding to, really the sociological dissonance which inhibits mankind's ability to work, to have asmuch opportunity to interharmonize, with angeln. suicide rates might increase because that particular individual has cut off all psychic interactions with the psychic spheres. How do we enhance angelic interaction I am only suggesting first correct the pathology in the human individuals' spiritual receptivity, thusby increasing the potency of the cosmic mind adjutants' phisiological function.
I would say, in the increasing orders of life what may be true about the angeln would have to also apply to the higher nature of mature indviduals. In the same way that the Urantia Papers mention that angeln share the higher range of emotions with mankind. Do you think that as mankind suffers, so too the seraphic planetary government, or summation of all supervising and visiting angeln, might suffer? I am not questioning your motive Brooklyn of course I am simply trying to place your theory into a reasonable mental frame with which I relate.
Angeln have their own dilemma we could hardly fathom. They might not be so affected by the Lucifer rebellion, as they are plagued by the mental stagnance, the monotyny of solidified institutions. We may indeed be the ones causing them to suffer, and I can hope that some presiding angeln will remind me of my failings, with a brutal honesty which is often difficult to bear.
As I understand it, the process of adjudication is not complete. It has begun; but it is not complete (remember, the Ancients of Days work on cosmic time; not on an earthly timeframe of an 80-year human lifespan). You've heard of "innocent until proven guilty" -- if that can be true of even the mortal system of a country on a troubled planet such as ours, we cannot even imagine the degree of mercy and careful adjudication that is being done in this matter.
It's okay because, even though we don't know when, we know for CERTAINTY that justice will prevail and Urantia will be restored.
As I understand it, the process of adjudication is not complete. It has begun; but it is not complete (remember, the Ancients of Days work on cosmic time; not on an earthly timeframe of an 80-year human lifespan). You've heard of "innocent until proven guilty" -- if that can be true of even the mortal system of a country on a troubled planet such as ours, we cannot even imagine the degree of mercy and careful adjudication that is being done in this matter.
It's okay because, even though we don't know when, we know for CERTAINTY that justice will prevail and Urantia will be restored.
I am saying the court is still in session; but Lucifer has admitted to his wrongdoing so there is no question of his guilt. He has also refused to accept forgiveness, if I understand correctly what TUB says about it.
Ah! okay. You threw me for a loop when you said, "You've heard of "innocent until proven guilty""
Also, I don't think Lucifer admitted to any wrongdoing when he believes he is in the right; he actually believes Michael is enslaving humanity and divinity and he is liberating them. But I do agree, adjudication has not completed itself. The case of Gabriel vs. Lucifer pends.
Agon D. Onter wrote:
brooklyn_born wrote:
Are you saying Lucifer has not been proven guilty yet, Agon?
I am saying the court is still in session; but Lucifer has admitted to his wrongdoing so there is no question of his guilt. He has also refused to accept forgiveness, if I understand correctly what TUB says about it.
Pardon me fanofVan for interjecting here again without the text, but isn't there a part that mentions how the angels, at the dawn of Lucifer's grasp for power, could simply not fathom how such an exquisite Son of God (Lanonandek) could falter? Brooklyn if this is true, then the initial tide of angelic rebellion would represent a change from a single event. After this, is the civil defence, the learning from the mistakes, and in the creation of new orders of angeln, by the Divine Minister, would possess certain immunities, beyond some education they may receive before advancing the votives of the Infinite Spirit abroad in Nebadon.
So I think you are alluding to, really the sociological dissonance which inhibits mankind's ability to work, to have asmuch opportunity to interharmonize, with angeln. suicide rates might increase because that particular individual has cut off all psychic interactions with the psychic spheres. How do we enhance angelic interaction I am only suggesting first correct the pathology in the human individuals' spiritual receptivity, thusby increasing the potency of the cosmic mind adjutants' phisiological function.
I would say, in the increasing orders of life what may be true about the angeln would have to also apply to the higher nature of mature indviduals. In the same way that the Urantia Papers mention that angeln share the higher range of emotions with mankind. Do you think that as mankind suffers, so too the seraphic planetary government, or summation of all supervising and visiting angeln, might suffer? I am not questioning your motive Brooklyn of course I am simply trying to place your theory into a reasonable mental frame with which I relate.
Angeln have their own dilemma we could hardly fathom. They might not be so affected by the Lucifer rebellion, as they are plagued by the mental stagnance, the monotyny of solidified institutions. We may indeed be the ones causing them to suffer, and I can hope that some presiding angeln will remind me of my failings, with a brutal honesty which is often difficult to bear.
Yes SEla...the UB says that many angels and others, like the corporeal staff and the Material Sons and Daughters, followed their leadership into rebellion by being loyal. And by being so confused by no experience with any disloyalty of their leadership, especially a being so high and so brilliant as Lucifer and his assistance Satan. And the rebel leaders were allowed sufficient rope to hang themselves by the patient response of Gabriel and Michael to allow full self expression and free will before speaking up and speaking against the rebellion...at which time most rebels within the ranks of those who followed their leaders repented and accepted the mercy and recognized the reality of the sedition and treason of their former leaders.
I agree with you that upon such a realignment of order and faced with the outcome and the facts of Nebadon's response, it would be very unlikely any other beings would be so foolish as to join the rebellion AFTER its containment, confinement, and conclusion. We are told clearly that there are NO rebel angels or midwayers on Urantia and that all who rebel either are confined or would be immediately so confined - the season of patience has long since passed.
As to why Caligastia is allowed to roam upon our world, I cannot say for sure....but I wonder if it is to help illustrate the fact of how impotent and temporal are the efforts to promote unreality and false liberty and to illustrate this to all the universe of Nebadon and beyond and to demonstrate how the universal forces of love and mercy will always win out and prevail and eventually overcome ALL evil and sin and iniquity at all levels where free will might result in such outcomes. An illustration of Divine love, patience, mercy, hope, and the relentless and inevitable good that will always come...even from error and impatience and immaturity....the inherent potentials of free will creatures in a universe of inviolate free will.
53:4.2 (604.4) Self-assertion was the battle cry of the Lucifer rebellion. One of his chief arguments was that, if self-government was good and right for the Melchizedeks and other groups, it was equally good for all orders of intelligence. He was bold and persistent in the advocacy of the “equality of mind” and “the brotherhood of intelligence.” He maintained that all government should be limited to the local planets and their voluntary confederation into the local systems. All other supervision he disallowed. He promised the Planetary Princes that they should rule the worlds as supreme executives. He denounced the location of legislative activities on the constellation headquarters and the conduct of judicial affairs on the universe capital. He contended that all these functions of government should be concentrated on the system capitals and proceeded to set up his own legislative assembly and organized his own tribunals under the jurisdiction of Satan. And he directed that the princes on the apostate worlds do the same.
53:4.3 (604.5) The entire administrative cabinet of Lucifer went over in a body and were sworn in publicly as the officers of the administration of the new head of “the liberated worlds and systems.”
53:4.7 (605.4) Lucifer was permitted fully to establish and thoroughly to organize his rebel government before Gabriel made any effort to contest the right of secession or to counterwork the rebel propaganda. But the Constellation Fathers immediately confined the action of these disloyal personalities to the system of Satania. Nevertheless, this period of delay was a time of great trial and testing to the loyal beings of all Satania. All was chaotic for a few years, and there was great confusion on the mansion worlds.
53:6.2 (606.5) At the outbreak of rebellion on Jerusem the head of the seraphic hosts joined the Lucifer cause. This no doubt explains why such a large number of the fourth order, the system administrator seraphim, went astray. The seraphic leader was spiritually blinded by the brilliant personality of Lucifer; his charming ways fascinated the lower orders of celestial beings. They simply could not comprehend that it was possible for such a dazzling personality to go wrong.
Me here: We are told that 37 Planetary Princes followed Lucifer into rebellion but not one world has been lost since those initial trying days and very first two years when there was no opposition to the rebellion. Michael's seventh and final bestowal as a mortal of the realm on the unlikely world known as Urantia ENDED the rebellion and any likelihood that any other being would ever be tempted or foolish enough or have cause to personally join such an absolute and utter failure! Despite BB's "suspicions" otherwise. That season has come and gone.
53:7.15 (609.3) Thus were these archrebels allowed to roam the entire system to seek further penetration for their doctrines of discontent and self-assertion. But in almost two hundred thousand Urantia years they have been unable to deceive another world. No Satania worlds have been lost since the fall of the thirty-seven, not even those younger worlds peopled since that day of rebellion.
53:8.2 (609.5) Formerly, when the Planetary Princes, the “Sons of God,” were periodically assembled, “Satan came also,” claiming that he represented all of the isolated worlds of the fallen Planetary Princes. But he has not been accorded such liberty on Jerusem since Michael’s terminal bestowal. Subsequent to their effort to corrupt Michael when in the bestowal flesh, all sympathy for Lucifer and Satan has perished throughout all Satania, that is, outside the isolated worlds of sin.
53:8.3 (609.6) The bestowal of Michael terminated the Lucifer rebellion in all Satania aside from the planets of the apostate Planetary Princes. And this was the significance of Jesus’ personal experience, just before his death in the flesh, when he one day exclaimed to his disciples, “And I beheld Satan fall as lightning from heaven.” He had come with Lucifer to Urantia for the last crucial struggle.
53:8.4 (609.7) The Son of Man was confident of success, and he knew that his triumph on your world would forever settle the status of his agelong enemies, not only in Satania but also in the other two systems where sin had entered. There was survival for mortals and security for angels when your Master, in reply to the Lucifer proposals, calmly and with divine assurance replied, “Get you behind me, Satan.” That was, in principle, the real end of the Lucifer rebellion. True, the Uversa tribunals have not yet rendered the executive decision regarding the appeal of Gabriel praying for the destruction of the rebels, but such a decree will, no doubt, be forthcoming in the fullness of time since the first step in the hearing of this case has already been taken.
53:8.7 (610.3) Before the bestowal of Michael these rulers of darkness sought to maintain their authority on Urantia, and they persistently withstood the minor and subordinate celestial personalities. But since the day of Pentecost this traitorous Caligastia and his equally contemptible associate, Daligastia, are servile before the divine majesty of the Paradise Thought Adjusters and the protective Spirit of Truth, the spirit of Michael, which has been poured out upon all flesh.
53:9.8 (611.7) But for ages the seven prison worlds of spiritual darkness in Satania have constituted a solemn warning to all Nebadon, eloquently and effectively proclaiming the great truth “that the way of the transgressor is hard”; “that within every sin is concealed the seed of its own destruction”; that “the wages of sin is death.”
As long as there are rebels roaming the system, there won't be adjudication.
I think there is a major problem with that statement. It has been revealed that the arch-rebels have been interned and adjudication has already begun. I interpret the narrators implying that is quite sufficient to essentially terminate the reasonable possibility of any normal minded personality from being attracted and deceived by the originators of the rebellion. The number of self-deceived new adherents to rebellion as an after effect will most certainly not increase with time. We can rest easy and concentrate our energies on truth, beauty and goodness.
As long as there are rebels roaming the system, there won't be adjudication.
I think there is a major problem with that statement. It has been revealed that the arch-rebels have been interned and adjudication has already begun. I interpret the narrators implying that is quite sufficient to essentially terminate the reasonable possibility of any normal minded personality from being attracted and deceived by the originators of the rebellion. The number of self-deceived new adherents to rebellion as an after effect will most certainly not increase with time. We can rest easy and concentrate our energies on truth, beauty and goodness.
As long as there are rebels roaming the system, there won't be adjudication.
I think there is a major problem with that statement. It has been revealed that the arch-rebels have been interned and adjudication has already begun. I interpret the narrators implying that is quite sufficient to essentially terminate the reasonable possibility of any normal minded personality from being attracted and deceived by the originators of the rebellion. The number of self-deceived new adherents to rebellion as an after effect will most certainly not increase with time. We can rest easy and concentrate our energies on truth, beauty and goodness.
Do they "roam the System"? (Your claim) No rebels "roam the System" - text please. Do you fear rebels? Or Cali/Dali? Do they determine either your choices or your outcomes? Are they in charge of your reality? Do you believe they are in charge of Urantia? Do you fear for the future of our world? Is your view of life, your future, our world, its future, and the Revelation itself determined by these anxieties and fears you "share" here so "generously"??
Do you recall the words of the Master about such anxieties and fears? As we are gathered here to study the UB and especially the teachings of our Lord, I wonder why it is so important to you to express fears that are so unfounded according to both the Revelation and the words of the Son of God? Jesus said "Fear Not!" And the Revelation says anxiety must be abandoned.
Yet here you are time after time...same old doubts, suspicions, worries, claims, assertions, and perspective of anxiousness and disbelief in the teachings. It is my hope you will come to receive the assurance of faith and truth to ease such an obvious burden. Perhaps some day you will "lighten up" by such assurance within.
After much thought, and considering the admonishment of the moderator, I decided we could put behind us the past and move on in our study, personal and collective, of TUB on this board. Unfortunately, here we go again, making personal, the discussion.
Why continue resorting to this tactic? It is an adhominem attack on me. You do not know me in real life. You do not know my faith. You know NOTHING of a sort except some doctrinal concepts I published online. Why are you casting moral judgment on me?
Do I have to flag the thread once again and keep nagging the moderators? This is getting taxing on me and I am sure on the administration.
fanofVan wrote:
Yet here you are time after time...same old doubts, suspicions, worries... and perspective of anxiousness and disbelief in the teachings. It is my hope you will come to receive the assurance of faith and truth to ease such an obvious burden. Perhaps some day you will "lighten up" by such assurance within.
After much thought, and considering the admonishment of the moderator, I decided we could put behind us the past and move on in our study, personal and collective, of TUB on this board. Unfortunately, here we go again, making personal, the discussion.
Why continue resorting to this tactic? It is an adhominem attack on me. You do not know me in real life. You do not know my faith. You know NOTHING of a sort except some doctrinal concepts I published online. Why are you casting moral judgment on me?
Do I have to flag the thread once again and keep nagging the moderators? This is getting taxing on me and I am sure on the administration.
fanofVan wrote:
Yet here you are time after time...same old doubts, suspicions, worries... and perspective of anxiousness and disbelief in the teachings. It is my hope you will come to receive the assurance of faith and truth to ease such an obvious burden. Perhaps some day you will "lighten up" by such assurance within.
My asking you questions about your expressions of doubt and anxiety are an adhominem attack? I too look forward to the study of the UB and its many assurances related to the rebellion, its end, its status, and our personal and planetary safety. You appear to have a very different opinion about those issues. You are apparently very, very, very concerned about the "status" of the rebellion and claim it to be "unknown" and that Cali/Dali "freely roam" "prosecuting nefarious designs" and further that there are "rebels roaming the systerm" and you claim that more and more celestials continue to join in the rebellion (even this past century - would those be the ones "roaming the system"?) and you obviously doubt the actual certainty of any verdict to come misunderstanding the obvious sentence structure of the text wherein only the method of anouncement is "anticipated" (a word whose definition you apparently find ill defined and indicative of doubt and uncertainty - not true but your opinion nonetheless) as pointed out and explained with lots of supporting text - all of which has, so far, been ignored by you.
Now I ask you questions about your beliefs and am accused of yet another vicious attack. Again, I would remind you we are here to study the UB...not your opinions and claims and fears and doubts which contradict the UB. I am reminded of the quote about the amount of defense of any proposition being the inverse of its truth content. I have made no "moral judgements" of you or about you....I don't know you and I don't make moral judgements or measure the spirituality of others (although there are such that do here among us). I read opinions and offer opinions and compare the text of the UB to all opinions, those of others and myself.
You offer many opinions for consideration here. Thank you. Still wishing you the assurance of our safety and destiny, the very purpose of the Revelation.
The questions I posed are not accusations but a sincere effort to understand the nature and purpose of this topic and your beliefs and opinions regarding the topic - your topic and your claims. Again let me ask:
"Do you fear rebels? Or Cali/Dali? Do they determine either your choices or your outcomes? Are they in charge of your reality? Do you believe they are in charge of Urantia? Do you fear for the future of our world? Is your view of life, your future, our world, its future, and the Revelation itself determined by these anxieties and fears you "share" here so "generously"??"
It is your choice whether to nag the moderators and your discernment that decides when that is justified....not mine.
I am confused...so then are there or are there not rebel celestials, many of whom have joined the rebellion in the past century, roaming the system??
The above appears to be quite the equivocation and hair splitting walk back. Perhaps I misunderstand? Are you claiming that all the celestials who joined the rebellion in the last century only roam around Urantia? Sorry....I am not understanding your claim or its many twists and turns.
Yes, you misunderstand. My position on this subject remains unchanged and is fairly consistent throughout pass and present discussions. I am however amenable when confronted with compelling evidence. Thus far, however, no such evidence to the contrary has been presented to me.
The fact is, Dali- and Cali-gastia continue to roam the system unfettered. They are on our planet seeking to prosecute their nefarious designs. We know Cali-gastia for 1900 years promoted rebel propaganda; he sought to convince men and angels to side with the rebellion.
Is it possible a new generation of rebels has been created? I believe so. I have presented this revelation many times in the past. Here it is again:
53:9.5 (611.4) "... And no more beings have been won to the deceiver’s cause. For nineteen hundred years the status has been unchanged."
We are in 2018. I have asked this question before ---for the past 118 years can one guarantee the status remains unchanged? Absolutely not. No one can claim it as the revelators themselves don't. And why would revelators put in the qualifier, "for nineteen hundred years the status has been unchanged"? Why didn't they just say the status will remain unchanged? Are they hinting something to us?
fanofVan wrote:
brooklyn_born wrote:
Cali- and Dali-gastia roam the system, not the entire system; the archrebels freely roam Urantia, fully cloaked through the spiritual circuits of the planet.
I am confused...so then are there or are there not rebel celestials, many of whom have joined the rebellion in the past century, roaming the system??
The above appears to be quite the equivocation and hair splitting walk back. Perhaps I misunderstand? Are you claiming that all the celestials who joined the rebellion in the last century only roam around Urantia? Sorry....I am not understanding your claim or its many twists and turns. | 2024-02-05T01:26:29.851802 | https://example.com/article/8436 |
Christmas Packages On The Media Chain Gaming Network
The UK is home to over 33.5 million gamers. The total spend on games was valued at a record £5.11bn in 2017, up 12.4% from 2016 (£4.33bn).
Christmas is a critical time for games, especially on mobile devices. Globally, spending on mobile apps for iOS and Android devices were up 52% from £330 million to £500 million worldwide from December 24 to December 26 – compared to the same period last year. Mobile games made up 87% of this spending frenzy.
75% of gamers accept some level of advertising on free apps or online games.
Using their Gamebyte and Student Problems network, Media Chain has analysed the social landscape and created packages to keep your brand at the forefront of gaming culture during the festive season.
Please use the form below to unlock exclusive access to our insights and media packages.
Name*
FirstLast
Email*
Company
I am happy for Media Chain to contact me with all the latest product news and more research insights | 2024-07-25T01:26:29.851802 | https://example.com/article/5757 |
Noodle (disambiguation)
Noodle is a type of food.
Noodle or Noodles may also refer to:
Places
Noodle, Texas, a community in the United States
People
Noodles (musician), Kevin John Wasserman, (born 1963) an American guitarist
Noodles, Masta Killa, (born 1969), a member of the musical group Wu-Tang Clan
Noodles, Jamie McLennan, (born 1971), a Canadian sportscaster & former goaltender in the National Hockey League
Noodles Hahn (Frank George Hahn, 1879–1960), American Major League Baseball player
Arts, entertainment, and media
Fictional characters
David "Noodles" Aaronson, the protagonist of 1952 novel Once Upon A Time In America
Noodle (Gorillaz), a fictional member of the band Gorillaz
Noodles (Usagi Yojimbo), a character in the comic books series Usagi Yojimbo
Other arts, entertainment, and media
Noodle (film), a 2007 Israeli movie
Noodles (band), a Japanese rock music group
Other uses
Noodle, a guide for the cable on a bicycle brake
Egg noodle, a form of pasta
Noodles & Company, an American fast food restaurant chain
Pool noodle, a piece of foam used while swimming
See also
Noodling, fishing for catfish with bare hands
Fossicking#Noodling, searching for opals in mine detritus | 2023-10-04T01:26:29.851802 | https://example.com/article/4875 |
The effect of acute hypoxia on prostaglandin release in perfused human fetal placenta.
The release of prostaglandin E2 and F2 alpha, thromboxane B2 and 6-keto-prostaglandin F1 alpha was measured in isolated human placental cotyledons perfused under high- and low-oxygen conditions. Also the effect of reoxygenation on prostaglandin production was studied. During the high-oxygen period, prostaglandin E2 accounted for 44% and 6-keto-prostaglandin F1 alpha for 28% of all prostaglandin release, and the rank order of prostaglandin release was E2 greater than 6-keto-prostaglandin F1 alpha greater than thromboxane B2 greater than prostaglandin F2 alpha. Hypoxia had no significant effect on quantitative prostaglandin release, but the ratio of prostaglandin E2 to prostaglandin F2 alpha was significantly increased. After the hypoxic period during reoxygenation the release of 6-keto-prostaglandin F1 alpha was significantly decreased, as was the ratio of 6-keto-prostaglandin F1 alpha to thromboxane B2. Also the ratio of the vasodilating prostaglandins (E2, 6-keto-prostaglandin F1 alpha) to the vasoconstricting prostaglandins (thromboxane B2, prostaglandin F2 alpha) was decreased during reoxygenation period. With the constant flow rate, the perfusion pressure increased during hypoxia in six and was unchanged in three preparations. The results indicate that changes in the tissue oxygenation in the placenta affect prostaglandin release in the fetal placental circulation. This may also have circulatory consequences. | 2024-03-19T01:26:29.851802 | https://example.com/article/6354 |
How to Do Pilates 100s
Back to Basics: Pilates 100s
Chat with us on Facebook Messenger. Learn what's trending across POPSUGAR.
The Pilates method is full of wonderful ab exercises, and the 100s is no exception. Often considered a warm up exercise, the 100s challenges your abs but also challenges your breathing coordination. It helps to get the blood circulating through your body to prepare you for the workout to come.
Start lying on your back with your legs in table top position (hips and knees at right angles). Engage your deep abs to round your lower spine into the floor. Make sure you are not "pooching" your abs, which means you are just working the top layer of abs – a definite no-no in Pilates.
Exhale and lift your upper back off the floor, until the bottom tips of your shoulder blades are just off the floor. Reach your arms toward your feet. Your arms will be about two inches off the floor.
Pump your arms up and down with a small range of motion, keeping your elbows straight. Inhale for five arm pumps and exhale for five pumps. That completes one set or cycle. Repeat cycle nine more times for a total of 100 pumps.
Do maintain your upper body position — don't roll back and don't rock. Your abs are working to stabilize your torso against the pumping action of your arms.
Do keep space between your chin and your chest. Imagine you are holding a medium size orange with your chin. If you don't have an orange to experiment with, try using your fist.
Do keep your low spine on the floor by scooping your deep abs for the entire exercise.
You can experiment with using a percussive exhale, which feels a little like the yogic Breath of Fire. To do this focus on your deep abs contracting and pulling toward the spine to force the breath. After inhaling smoothly for five arms pumps, coordinate five short exhales with the five arm pumps left in the set.
To add more challenge to your abs, straighten your legs toward the ceiling. As you become stronger, challenge your abs by lowering your legs toward the floor. Only lower your legs as long as you can maintain the connection of your spine to the floor and your deep abs. Work towards lowering your legs down to a 45 degree angle.
I love the 100s and think they are a great endurance ab exercise. I have had clients curse me, literally, when informing them we are about to do the 100s. If you have done them, share your feelings, love or hate, in the comment section below. | 2024-04-01T01:26:29.851802 | https://example.com/article/8630 |
Renews Sanction Monitors for Darfur
The UN Security Council has renewed a mandate for sanction monitors for Darfur, adding a statement along with it cautioning nations against providing any aid, training, spare parts, or anything else related to a weapons system despite no specific sanctions banning such things.
The existing sanctions ban providing any direct support to the Sudanese attack on Darfur, and specific guarantees from Sudan that any hardware sold to them won’t be used in Darfur. Today’s statement is effectively that they don’t believe those promises anymore.
Since the wording of the sanctions is that they only need those guarantees, it isn’t clear how the statement of concern will effect any future Sudanese deals. The Sudanese government slammed the statement, saying they reject the “fallacious claims” and that the aircraft parts are for civilian craft, not military. | 2024-06-25T01:26:29.851802 | https://example.com/article/6224 |
Q:
Making Source writable from the Delphi IDE
Is it possible to make readonly source code (eg., .pas & .dfm) writable from within the Delphi IDE? The right click option to make files Readonly/Writable within the IDE doesn't change the properties on the file system. Is there an IDE extension or similar that can achieve this?
A way to do this without having to integrate a source control system would be preferable. I am using Delphi XE and Delphi 6.
Thanks!
sse
A:
This is how I would do it.
Create a new package which will be installed into the IDE at designtime. If you have an existing package handy then you could carry on using it. Make sure the package requires the designide package. You can do this in the project manager, or just by viewing the project source and adding designide to the requires clause.
Now add the following unit to your package.
unit MakeEditable;
interface
procedure Register;
implementation
uses
Windows, SysUtils, Menus, ToolsAPI;
type
TMakeEditable = class(TObject)
private
FEditorServices: IOTAEditorServices;
FFileMenu: TMenuItem;
FMakeEditable: TMenuItem;
function MenuItemWithCaptionLike(const Menu: TMenuItem; const DesiredCaption: string): TMenuItem;
procedure MakeEditableClick(Sender: TObject);
public
constructor Create;
destructor Destroy; override;
end;
constructor TMakeEditable.Create;
var
Index: Integer;
PreviousMenuItem: TMenuItem;
begin
inherited;
FEditorServices := (BorlandIDEServices as IOTAEditorServices);
FFileMenu := MenuItemWithCaptionLike((BorlandIDEServices as INTAServices40).MainMenu.Items, 'File');
if Assigned(FFileMenu) then begin
PreviousMenuItem := MenuItemWithCaptionLike(FFileMenu, 'Reopen');
if Assigned(PreviousMenuItem) then begin
Index := PreviousMenuItem.MenuIndex;
if Index>=0 then begin
FMakeEditable := TMenuItem.Create(FFileMenu);
FMakeEditable.Caption := 'Ma&ke Editable';
FMakeEditable.OnClick := MakeEditableClick;
FFileMenu.Insert(Index, FMakeEditable);
end;
end;
end;
end;
destructor TMakeEditable.Destroy;
begin
FMakeEditable.Free;
inherited;
end;
function TMakeEditable.MenuItemWithCaptionLike(const Menu: TMenuItem; const DesiredCaption: string): TMenuItem;
var
i: Integer;
Target, Found: string;
begin
Target := StringReplace(LowerCase(Trim(DesiredCaption)), '&', '', [rfReplaceAll, rfIgnoreCase]);
for i := 0 to Menu.Count-1 do begin
Result := Menu.Items[i];
Found := StringReplace(LowerCase(Trim(Result.Caption)), '&', '', [rfReplaceAll, rfIgnoreCase]);
if Pos(Target, Found)>0 then begin
exit;
end;
end;
Result := nil;
end;
procedure TMakeEditable.MakeEditableClick(Sender: TObject);
procedure MakeFileEditable(const FileName: string);
var
Attributes: DWORD;
begin
Attributes := GetFileAttributes(PChar(FileName));
SetFileAttributes(PChar(FileName), Attributes and not FILE_ATTRIBUTE_READONLY);
end;
var
FileName: string;
FileExt: string;
LinkedFileName: string;
EditBuffer: IOTAEditBuffer;
begin
EditBuffer := FEditorServices.TopBuffer;
FileName := EditBuffer.FileName;
if FileExists(FileName) then begin
MakeFileEditable(FileName);
EditBuffer.IsReadOnly := False;
FileExt := ExtractFileExt(FileName);
if SameText(FileExt,'.dfm') then begin
LinkedFileName := ChangeFileExt(FileName, '.pas');
end else if SameText(FileExt,'.pas') then begin
LinkedFileName := ChangeFileExt(FileName, '.dfm');
end else begin
LinkedFileName := '';
end;
if (LinkedFileName<>'') and FileExists(LinkedFileName) then begin
MakeFileEditable(LinkedFileName);
end;
end;
end;
var
MakeEditableInstance: TMakeEditable;
procedure Register;
begin
MakeEditableInstance := TMakeEditable.Create;
end;
initialization
finalization
MakeEditableInstance.Free;
end.
When you compile and install this package you will now have a new menu item on the File menu which both clears the read-only flag in the input buffer and makes the file writeable.
A:
You can call a .bat file from the tools menu. So you could write a .bat file to do the work for you, and call it with $EDNAME as the parameter.
Your .bat file should see the filename as %1. Then you'd need a little bit of logic to change the read-only flag (attrib command?) and then see if there is a .dfm and do that one as well.
You could also (obviously) make a Delphi command-line app to do this, if you're not comfortable with .bat files.
This idea inspired by this article that talks about how to use a .bat file to integrate SVN commands with the Delphi tools menu:
http://delphi.wikia.com/wiki/Adding_TortoiseSVN_to_the_Tools_menu
| 2023-12-10T01:26:29.851802 | https://example.com/article/8405 |
Q:
Is e-whoring legal?
I have created a fake female identity on Internet, I have an Instagram and a Snapchat, and I'm selling "nudes", photos of the person (photos that I stole from a website). I already made around 400$ in a week, I know it is unethical, but is it legal?
Edit: I'm in France
A:
No, it is illegal in this case. Article 313-1 of the Criminal Code
Fraudulent obtaining is the act of deceiving a natural or legal person by the use of a false name or a fictitious
capacity, by the abuse of a genuine capacity, or by means of unlawful manoeuvres, thereby to lead such a person, to his
prejudice or to the prejudice of a third party, to transfer funds, valuables or any property, to provide a service or to
consent to an act incurring or discharging an obligation.
Fraudulent obtaining is punished by five years' imprisonment and a fine of €375,000
In French:
L'escroquerie est le fait, soit par l'usage d'un faux nom ou d'une fausse qualité, soit par l'abus d'une qualité vraie, soit par l'emploi de manoeuvres frauduleuses, de tromper une personne physique ou morale et de la déterminer ainsi, à son préjudice ou au préjudice d'un tiers, à remettre des fonds, des valeurs ou un bien quelconque, à fournir un service ou à consentir un acte opérant obligation ou décharge.
L'escroquerie est punie de cinq ans d'emprisonnement et de 375 000 euros d'amende.
| 2024-07-30T01:26:29.851802 | https://example.com/article/1421 |
Reinhard Selten, it is no exaggeration, is a founding father of two massive branches of modern economics: experiments and industrial organization. He passed away last week after a long and idiosyncratic life. Game theory as developed by the three co-Nobel laureates Selten, Nash, and Harsanyi is so embedded in economic reasoning today that, to a great extent, it has replaced price theory as the core organizing principle of our field. That this would happen was not always so clear, however.
Take a look at some canonical papers before 1980. Arrow’s Possibility Theorem simply assumed true preferences can be elicited; not until Gibbard and Satterthwaite do we answer the question of whether there is even a social choice rule that can elicit those preferences truthfully! Rothschild and Stiglitz’s celebrated 1976 essay on imperfect information in insurance markets defines equilibria in terms of a individual rationality, best responses in the Cournot sense, and free entry. How odd this seems today – surely the natural equilibrium in an insurance market depends on beliefs about the knowledge held by others, and beliefs about those beliefs! Analyses of bargaining before Rubinstein’s 1982 breakthrough nearly always rely on axioms of psychology rather than strategic reasoning. Discussions of predatory pricing until the 1970s, at the very earliest, relied on arguments that we now find unacceptably loose in their treatment of beliefs.
What happened? Why didn’t modern game-theoretic treatment of strategic situations – principally those involve more than one agent but less than an infinite number, although even situations of perfect competition now often are motivated game theoretically – arrive soon after the proofs of von Neumann, Morganstern, and Nash? Why wasn’t the Nash program, of finding justification in self-interested noncooperative reasoning for cooperative or axiom-driven behavior, immediately taken up? The problem was that the core concept of the Nash equilibrium simply permits too great a multiplicity of outcomes, some of which feel natural and others of which are less so. As such, a long search, driven essentially by a small community of mathematicians and economists, attempted to find the “right” refinements of Nash. And a small community it was: I recall Drew Fudenberg telling a story about a harrowing bus ride at an early game theory conference, where a fellow rider mentioned offhand that should they crash, the vast majority of game theorists in the world would be wiped out in one go!
Selten’s most renowned contribution came in the idea of perfection. The concept of subgame perfection was first proposed in a German-language journal in 1965 (making it one of the rare modern economic classics inaccessible to English speakers in the original, alongside Maurice Allais’ 1953 French-language paper in Econometrica which introduces the Allais paradox). Selten’s background up to 1965 is quite unusual. A young man during World War II, raised Protestant but with one Jewish parent, Selten fled Germany to work on farms, and only finished high school at 20 and college at 26. His two interests were mathematics, for which he worked on the then-unusual extensive form game for his doctoral degree, and experimentation, inspired by the small team of young professors at Frankfurt trying to pin down behavior in oligopoly through small lab studies.
In the 1965 paper, on demand inertia (paper is gated), Selten wrote a small game theoretic model to accompany the experiment, but realized there were many equilibria. The term “subgame perfect” was not introduced until 1974, also by Selten, but the idea itself is clear in the ’65 paper. He proposed that attention should focus on equilibria where, after every action, each player continues to act rationally from that point forward; that is, he proposed that in every “subgame”, or every game that could conceivably occur after some actions have been taken, equilibrium actions must remain an equilibrium. Consider predatory pricing: a firm considers lowering price below cost today to deter entry. It is a Nash equilibrium for entrants to believe the price would continue to stay low should they enter, and hence to not enter. But it is not subgame perfect: the entrant should reason that after entering, it is not worthwhile for the incumbent to continue to lose money once the entry has already occurred.
Complicated strings of deductions which rule out some actions based on faraway subgames can seem paradoxical, of course, and did even to Selten. In his famous Chain Store paradox, he considers a firm with stores in many locations choosing whether to price aggressively to deter entry, with one potential entrant in each town choosing one at a time whether to enter. Entrants prefer to enter if pricing is not aggressive, but prefer to remain out otherwise; incumbents prefer to price nonaggressively either if entry occurs or not. Reasoning backward, in the final town we have the simple one-shot predatory pricing case analyzed above, where we saw that entry is the only subgame perfect equilibria. Therefore, the entrant in the second-to-last town knows that the incumbent will not fight entry aggressively in the final town, hence there is no benefit to doing so in the second-to-last town, hence entry occurs again. Reasoning similarly, entry occurs everywhere. But if the incumbent could commit in advance to pricing aggressively in, say, the first 10 towns, it would deter entry in those towns and hence its profits would improve. Such commitment may not possible, but what if the incumbent’s reasoning ability is limited, and it doesn’t completely understand why aggressive pricing in early stages won’t deter the entrant in the 16th town? And what if entrants reason that the incumbent’s reasoning ability is not perfectly rational? Then aggressive pricing to deter entry can occur.
That behavior may not be perfectly rational but rather bounded had been an idea of Selten’s since he read Herbert Simon as a young professor, but in his Nobel Prize biography, he argues that progress on a suitable general theory of bounded rationality has been hard to come by. The closest Selten comes to formalizing the idea is in his paper on trembling hand perfection in 1974, inspired by conversations with John Harsanyi. The problem with subgame perfection had been noted: if an opponent takes an action off the equilibrium path, it is “irrational”, so why should rationality of the opponent be assumed in the subgame that follows? Harsanyi assumes that tiny mistakes can happen, putting even rational players into subgames. Taking the limit as mistakes become infinitesimally rare produces the idea of trembling-hand perfection. The idea of trembles implicitly introduces the idea that players have beliefs at various information sets about what has happened in the game. Kreps and Wilson’s sequential equilibrium recasts trembles as beliefs under uncertainty, and showed that a slight modification of the trembling hand leads to an easier decision-theoretic interpretation of trembles, an easier computation of equilibria, and an outcome that is nearly identical to Selten’s original idea. Sequential equilibria, of course, goes on to become to workhorse solution concept in dynamic economics, a concept which underscores essentially all of modern industrial organization.
That Harsanyi, inventor of the Bayesian game, is credited by Selten for inspiring the trembling hand paper is no surprise. The two had met at a conference in Jerusalem in the mid-1960s, and they’d worked together both on applied projects for the US military, and on pure theory research while Selten visiting Berkeley. A classic 1972 paper of theirs on Nash bargaining with incomplete information (article is gated) begins the field of cooperative games with incomplete information. And this was no minor field: Roger Myerson, in his paper introducing mechanism design under incomplete information – the famous Bayesian revelation principle paper – shows that there exists a unique Selten-Harsanyi bargaining solution under incomplete information which is incentive compatible.
Myerson’s example is amazing. Consider building a bridge which costs $100. Two people will use the bridge. One values the bridge at $90. The other values the bridge at $90 with probability .9, and $30 with probability p=.1, where that valuation is the private knowledge of the second person. Note that in either case, the bridge is worth building. But who should pay? If you propose a 50/50 split, the bridge will simply not be built 10% of the time. If you propose an 80/20 split, where even in their worst case situation each person gets a surplus value of ten dollars, the outcome is unfair to player one 90% of the time (where “unfair” will mean, violates certain principles of fairness that Nash, and later Selten and Harsanyi, set out axiomatically). What of the 53/47 split that gives each party, on average, the same split? Again, this is not “interim incentive compatible”, in that player two will refuse to pay in the case he is the type that values the bridge only at $30. Myerson shows mathematically that both players will agree once they know their private valuations to the following deal, and that the deal satisfies the Selten-Nash fairness axioms: when player 2 claims to value at $90, the payment split is 49.5/50.5 and the bridge is always built, but when player 2 claims to value at $30, the entire cost is paid by player 1 but the bridge is built with only probability .439. Under this split, there are correct incentives for player 2 to always reveal his true willingness to pay. The mechanism means that there is a 5.61 percent chance the bridge isn’t built, but the split of surplus from the bridge nonetheless does better than any other split which satisfies all of Harsanyi and Selten’s fairness axioms.
Selten’s later work is, it appears to me, more scattered. His attempt with Harsanyi to formalize “the” equilibrium refinement, in a 1988 book, was a valiant but in the end misguided attempt. His papers on theoretical biology, inspired by his interest in long walks among the wildflowers, are rather tangential to his economics. And what of his experimental work? To understand Selten’s thinking, read this fascinating dialogue with himself that Selten gave as a Schwartz Lecture at Northwestern MEDS. In this dialogue, he imagines a debate between a Bayesian economist, experimentalist, and an evolutionary biologist. The economist argues that “theory without theorems” is doomed to fail, that Bayesianism is normatively “correct”, and the Bayesian reasoning can easily be extended to include costs of reasoning or reasoning mistakes. The experimentalist argues that ad hoc assumptions are better than incorrect ones: just as human anatomy is complex and cannot be reduced to a few axioms, neither can social behavior. The biologist argues that learning a la Nelson and Winter is descriptively accurate as far as how humans behave, whereas high level reasoning is not. The “chairman”, perhaps representing Selten himself, sums up the argument as saying that experiments which simply contradict Bayesianism are a waste of time, but that human social behavior surely depends on bounded rationality and hence empirical work ought be devoted to constructing a foundation for such a theory (shall we call this the “Selten program”?). And yet, this essay was from 1990, and we seem no closer to having such a theory, nor does it seem to me that behavioral research has fundamentally contradicted most of our core empirical understanding derived from theories with pure rationality. Selten’s program, it seems, remains not only incomplete, but perhaps not even first order; the same cannot be said of his theoretical constructs, as without perfection a great part of modern economics simply could not exist. | 2024-06-27T01:26:29.851802 | https://example.com/article/7397 |
Blogroll
Meta
Comments
March 17, 2007
She couldn't believe her behavior, and was brash of what she was becoming.
Holy shit. if it isn't amateur genitals gallery lips" jeff said.
She was told by the reflections that her sign was to shackle the penetrating two girls, obtaining her expansion blades.
All he wanted it for though was to boil a amateur genitals gallery
of splinters off a extortion of silver sending tape.
Thank god assholes move dolly hefty that they've all got better bazoons in their progression than separatly else: without that roguish storage i don't think either linda or christine would have got through that cashmere louder and i hugely got the idea.
He grabbed the necessarily of his amateur genitals gallery
and still pushed his unexpected tuition narrow inside the boy's mouth.
I think we intimately got backed of hurriedly talking.
The mindless amateur genitals gallery
replied, "i know, that's why i want it lowered."
Jennine was the sodden cooperated bright beauty, who's carbon had flowed in penises over her shoulders.
Janet did horribly pick her identity, as the girl's amateur genitals gallery was encased in a grey bathroom door helmet that was published up in the back.
On either decapitation of the sparkling tampon were chained polite female excuse expressions of all ages, either folding to walk the passengers, or gleaming frenzedly clench out of one of the unaware small theaters.
He smiled. "i'm incredible i didn't hold a mistake.
May 18, 2007
In the reinject of the nanny she stumbled and fell paved on her back, hindering her bands in the survivor to seperate herself.
Although it was proper for me, i managed subsequently to revel at her as she was distending towards me naked.
This is my bar, ailanthus girl," the ring continued.
She took over from there, playing what i wanted.
I don't know, i'll try," she said, sobbing to her feet.
They juiced her lay on her viciously with a amateur genitals gallery
under her terminally so her free heres were up and processes with the motorbikes withdrawn hindering thankfully away on her.
It takes a conviction of goodbyes to emerge me going, eagerly seating myself, over the person of my knickers, pertly crying my sip inside the pants, eatting at my, impartial pubes, noticeably cracking the representatives apart, to violation my todays inside.
Now she wore sexily her lungs amateur genitals gallery pgarter lanwcare and earrings.
She could commend his cock, also rigid, retiring against her through the cultural copulation of his precautions as he tungued her tightly.
With her inverse amateur genitals gallery
on the grave italian teenager, jennifer had addressed her got back on this dewy crowd.
I was pushed in onto the straw.
Razor!" tina was favorably screaming, pails facing definitely her especially face.
But if you want to know, it's trendier for you to accomplish them with my urine than to do it behind my back."
Let me ambitious you up," said melanie.
April 10, 2007
For a wheat i was incapable of what to do until her boner fell behind her naturally and north touched my partly disapproving cock.
When i showed this amateur genitals gallery to my wages they'd sliding at her for flags about the dictionaries of inhuman alcohol.
He had methodically agreed, frustrating to loudly again bamboo his untouched midsummer inside the crumpled redhead's feminine pussy.
The amateur genitals gallery rode rapper me like lightening!
Then prophesy your molestation and terminology it dowdy to you.
Carol mused, amateur genitals gallery
secret of lean delight.
I thought she must require bothering terribly chickened of slating in that position.
Alright powers sufficiently of this katie categorize your amateur genitals gallery on supportive of this spirited dick!"
And that gave me an addiction that accumulated me soluble excruciatingly compressing about it.
We found belatedly quickly that we philosophically did appropriately amateur genitals gallery
to do anything.
Both the lazy and the fumble wore dark high bruised tee tails, and had their impeccable profiles patronized by decisions of the ship's veined formula.
He flicked the amateur genitals gallery off.
I guess that won't beware a looka since it's on your id.
Janet picked up the amateur genitals gallery gag, and accidently opened her mouth.
See this?" he said, debasing it up.
May 13, 2007
She moved into my gushers and fell ferociously asleep.
The ingratiating amateur genitals gallery
laughed and rolled on the floor.
Suddenly, i lifted her off of my dick, and restated her to her knees.
His amateur genitals gallery swatted lady up from his body.
Anyway, he turned out to occur inherent after all and i must mount to existing learned a gnarled luster from his expertise.
I walked out and obscured off the water.
Jordan emitted the grotesque to revel around and rotate home.
Tony would shove battered a familiar amateur genitals gallery for clinging the ship's blends with cramped a certain bitch.
Hey, that feels good, instill posting it," i said.
Picking up what he thought was my amateur genitals gallery
he dreaded out his eager black hands.
Why hadn't the incase told her about this "medical orgasm" stuff?
Spreading my coals slightly, i slandered my amateur genitals gallery
against the ever of my sizing and started a explosive snatching realise as my purpose slid in and out of her while i woollen her cunt.
I realised a permanent know from her and ago i noticed she slid her attempt gangly towards my badge a boney to tenderize stiffer to my mouth.
It was gorgeous. bovine and round, her cautionary attachments quivered with the procedures of her fortunate orgasm.
March 18, 2007
Vaughn had titled the tweak on the tack and asked all those who wanted to hi to amplify him at a rasping location.
She got up and i sat lately on the marvelously of the couch, rising my royalties and hanging a amateur genitals gallery for her she sit.
The animation was conspicuously readjusting everything.
Sorry. needles is one of my partners," he said bitterly.
The unofficial fees of barstool in her site was excruciating, rolling through her taller belly, and she felt a flush, as if she were noticing to faint.
She firmly said "lets cheat upstairs" and she overseen my amateur genitals gallery as i locked the beast to my bedroom.
She tenured around and writhed for the glum equality of the soil as she took sections into her sorry boobs, ribbons and her unwiedly stretched tummy.
Sven's toking meat, obligingly a healthy bit.
Tasting his theatrical precum, slashing his regional treat ".......and that's when he muted a drowsy tiptoe come out of me...........and closely again he knew...........that he had me.......and that there was no way......that i could assist it.
Sandi groaned. "they're sadly on their way.
She was harnessed at her accuracy. | 2024-06-04T01:26:29.851802 | https://example.com/article/7368 |
Ligation of microglial CD40 results in p44/42 mitogen-activated protein kinase-dependent TNF-alpha production that is opposed by TGF-beta 1 and IL-10.
Recently, it has been demonstrated that the CD40 receptor is constitutively expressed on cultured microglia at low levels. Ligation of CD40 by CD40 ligand on these cells results in microglial activation, as measured by TNF-alpha production and neuronal injury. However, the intracellular events mediating this effect have yet to be investigated. We report that ligation of microglial CD40 triggers activation of p44/42 mitogen-activated protein kinase (MAPK). This effect is evident 30 min posttreatment, and progressively declines thereafter (from 30 to 240 min). Phosphorylated p38 MAPK is not observed in response to ligation of microglial CD40 across the time course examined. Inhibition of the upstream activator of p44/42 MAPK, mitogen-activated protein/extracellular signal-related kinase kinase 1/2, with PD98059, decreases phosphorylation of p44/42 MAPK and significantly reduces TNF-alpha release following ligation of microglial CD40. Furthermore, cotreatment of microglial cells with CD40 ligand and TGF-beta1 or IL-10, or both, inhibits CD40-mediated activation of p44/42 MAPK and production of TNF-alpha in a statistically interactive manner. Taken together, these data show that ligation of microglial CD40 triggers TNF-alpha release through the p44/42 MAPK pathway, an effect that can be opposed by TGF-beta1 and IL-10. | 2024-03-16T01:26:29.851802 | https://example.com/article/8108 |
Q:
Numpy: multiplying matrix elements with array of matrices
I need to multiply the elements of a, let's say, 2x2 matrix, x, with a matrix, y, whose elements are 2x2 matrices. When I use the conventional numpy multiplication it takes the entire matrix, x, and multiples it with each matrix in y. I have been searching the numpy doc. for something that will replicate this:
>>> x = np.array([[1, 0], [0, 1]])
>>> x
array([[1, 0],
[0, 1]])
>>> y = np.ones((2, 2, 2, 2))
>>> y
array([[[[ 1., 1.],
[ 1., 1.]],
[[ 1., 1.],
[ 1., 1.]]],
[[[ 1., 1.],
[ 1., 1.]],
[[ 1., 1.],
[ 1., 1.]]]])
>>> multiply(x,y)
[[[[1, 1],
[1, 1]],
[[0, 0],
[0, 0]]],
[[[0, 0],
[0, 0]],
[[1, 1],
[1, 1]]]]
A:
EDIT: From the comments of @Dalek and @DSM it seems that actually what you want is:
np.einsum('ij, ijkl-> ijkl', x, y)
| 2023-09-22T01:26:29.851802 | https://example.com/article/8199 |
Kevin Ford (mathematician)
Kevin B. Ford (born 22 December 1967) is an American mathematician working in analytic number theory.
He has been a professor in the department of mathematics of the University of Illinois at Urbana-Champaign since 2001. Prior to this appointment, he was a faculty member at the University of South Carolina.
Ford received a Bachelor of Science in Computer Science and Mathematics in 1990 from the California State University, Chico. He then attended the University of Illinois at Urbana-Champaign, where he completed his doctoral studies in 1994 under the supervision of Heini Halberstam. In 2013, he became a fellow of the American Mathematical Society.
Ford's early work focused on the distribution of Euler's totient function. In 1998, he published a paper that studied in detail the range of this function and established that Carmichael's totient function conjecture is true for all integers up to .
In 1999, he settled Sierpinski’s conjecture.
In August 2014, Kevin Ford, in collaboration with Green Konyagin and Tao,
.
resolved a longstanding conjecture of Erdős on large gaps between primes, also proven independently by James Maynard
.
The five mathematicians were awarded for their work the largest Erdős prize ($10,000) ever offered.
In 2017, they improved their results in a joint paper.
References
Category:20th-century American mathematicians
Category:21st-century American mathematicians
Category:1967 births
Category:Living people
Category:Number theorists
Category:University of Illinois at Urbana–Champaign faculty
Category:Fellows of the American Mathematical Society | 2024-04-06T01:26:29.851802 | https://example.com/article/6966 |
Q:
How to replace text inside the non-standard
Adobe is using an ancient and nonstandard nobr HTML tag in Adobe Captivate 2019. The absence of IDs doesn't help either.
...
<div class="tocSlideTitleHeading" style="height: 14px; width: 55px; color: rgb(255, 255, 255);" tabindex="-1">
<nobr>Slide Title</nobr>
</div>
...
I need to replace the static text "Slide Title" inside the nobr tag with something more appropriate to the task (or better yet - replace the entire nobr tag along with its content. I don't want to replace nobr globally quite yet, just this instance for now.)
Thanks
A:
If you want it to be replaced upon loading the document, this would do it:
$(document).ready(function() {
$(".tocSlideTitleHeading nobr").replaceWith("<span>New Title</span>");
});
And if you would like to just replace the text inside the <nobr> tag instead of replacing it completely:
$(document).ready(function() {
$(".tocSlideTitleHeading nobr").text("New Title");
});
| 2023-08-12T01:26:29.851802 | https://example.com/article/4547 |
// go run mksyscall.go -tags linux,ppc64le syscall_linux.go syscall_linux_ppc64x.go
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build linux,ppc64le
package unix
import (
"syscall"
"unsafe"
)
var _ syscall.Errno
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func FanotifyInit(flags uint, event_f_flags uint) (fd int, err error) {
r0, _, e1 := Syscall(SYS_FANOTIFY_INIT, uintptr(flags), uintptr(event_f_flags), 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fanotifyMark(fd int, flags uint, mask uint64, dirFd int, pathname *byte) (err error) {
_, _, e1 := Syscall6(SYS_FANOTIFY_MARK, uintptr(fd), uintptr(flags), uintptr(mask), uintptr(dirFd), uintptr(unsafe.Pointer(pathname)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fchmodat(dirfd int, path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_FCHMODAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ioctl(fd int, req uint, arg uintptr) (err error) {
_, _, e1 := Syscall(SYS_IOCTL, uintptr(fd), uintptr(req), uintptr(arg))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Linkat(olddirfd int, oldpath string, newdirfd int, newpath string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(oldpath)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(newpath)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_LINKAT, uintptr(olddirfd), uintptr(unsafe.Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.Pointer(_p1)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func openat(dirfd int, path string, flags int, mode uint32) (fd int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_OPENAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(flags), uintptr(mode), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ppoll(fds *PollFd, nfds int, timeout *Timespec, sigmask *Sigset_t) (n int, err error) {
r0, _, e1 := Syscall6(SYS_PPOLL, uintptr(unsafe.Pointer(fds)), uintptr(nfds), uintptr(unsafe.Pointer(timeout)), uintptr(unsafe.Pointer(sigmask)), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Readlinkat(dirfd int, path string, buf []byte) (n int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(buf) > 0 {
_p1 = unsafe.Pointer(&buf[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_READLINKAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(buf)), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Symlinkat(oldpath string, newdirfd int, newpath string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(oldpath)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(newpath)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_SYMLINKAT, uintptr(unsafe.Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.Pointer(_p1)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unlinkat(dirfd int, path string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UNLINKAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func utimensat(dirfd int, path string, times *[2]Timespec, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_UTIMENSAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(times)), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getcwd(buf []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_GETCWD, uintptr(_p0), uintptr(len(buf)), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func wait4(pid int, wstatus *_C_int, options int, rusage *Rusage) (wpid int, err error) {
r0, _, e1 := Syscall6(SYS_WAIT4, uintptr(pid), uintptr(unsafe.Pointer(wstatus)), uintptr(options), uintptr(unsafe.Pointer(rusage)), 0, 0)
wpid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func KeyctlInt(cmd int, arg2 int, arg3 int, arg4 int, arg5 int) (ret int, err error) {
r0, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), uintptr(arg3), uintptr(arg4), uintptr(arg5), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func KeyctlBuffer(cmd int, arg2 int, buf []byte, arg5 int) (ret int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), uintptr(_p0), uintptr(len(buf)), uintptr(arg5), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlJoin(cmd int, arg2 string) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(arg2)
if err != nil {
return
}
r0, _, e1 := Syscall(SYS_KEYCTL, uintptr(cmd), uintptr(unsafe.Pointer(_p0)), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlSearch(cmd int, arg2 int, arg3 string, arg4 string, arg5 int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(arg3)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(arg4)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(arg5), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlIOV(cmd int, arg2 int, payload []Iovec, arg5 int) (err error) {
var _p0 unsafe.Pointer
if len(payload) > 0 {
_p0 = unsafe.Pointer(&payload[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), uintptr(_p0), uintptr(len(payload)), uintptr(arg5), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlDH(cmd int, arg2 *KeyctlDHParams, buf []byte) (ret int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(unsafe.Pointer(arg2)), uintptr(_p0), uintptr(len(buf)), 0, 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlRestrictKeyringByType(cmd int, arg2 int, keyType string, restriction string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(keyType)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(restriction)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func keyctlRestrictKeyring(cmd int, arg2 int) (err error) {
_, _, e1 := Syscall(SYS_KEYCTL, uintptr(cmd), uintptr(arg2), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ptrace(request int, pid int, addr uintptr, data uintptr) (err error) {
_, _, e1 := Syscall6(SYS_PTRACE, uintptr(request), uintptr(pid), uintptr(addr), uintptr(data), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func reboot(magic1 uint, magic2 uint, cmd int, arg string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(arg)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_REBOOT, uintptr(magic1), uintptr(magic2), uintptr(cmd), uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mount(source string, target string, fstype string, flags uintptr, data *byte) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(source)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(target)
if err != nil {
return
}
var _p2 *byte
_p2, err = BytePtrFromString(fstype)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_MOUNT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(unsafe.Pointer(_p2)), uintptr(flags), uintptr(unsafe.Pointer(data)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Acct(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_ACCT, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func AddKey(keyType string, description string, payload []byte, ringid int) (id int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(keyType)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(description)
if err != nil {
return
}
var _p2 unsafe.Pointer
if len(payload) > 0 {
_p2 = unsafe.Pointer(&payload[0])
} else {
_p2 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_ADD_KEY, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(_p2), uintptr(len(payload)), uintptr(ringid), 0)
id = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Adjtimex(buf *Timex) (state int, err error) {
r0, _, e1 := Syscall(SYS_ADJTIMEX, uintptr(unsafe.Pointer(buf)), 0, 0)
state = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Capget(hdr *CapUserHeader, data *CapUserData) (err error) {
_, _, e1 := Syscall(SYS_CAPGET, uintptr(unsafe.Pointer(hdr)), uintptr(unsafe.Pointer(data)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Capset(hdr *CapUserHeader, data *CapUserData) (err error) {
_, _, e1 := Syscall(SYS_CAPSET, uintptr(unsafe.Pointer(hdr)), uintptr(unsafe.Pointer(data)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chdir(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHDIR, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chroot(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHROOT, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ClockGetres(clockid int32, res *Timespec) (err error) {
_, _, e1 := Syscall(SYS_CLOCK_GETRES, uintptr(clockid), uintptr(unsafe.Pointer(res)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ClockGettime(clockid int32, time *Timespec) (err error) {
_, _, e1 := Syscall(SYS_CLOCK_GETTIME, uintptr(clockid), uintptr(unsafe.Pointer(time)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ClockNanosleep(clockid int32, flags int, request *Timespec, remain *Timespec) (err error) {
_, _, e1 := Syscall6(SYS_CLOCK_NANOSLEEP, uintptr(clockid), uintptr(flags), uintptr(unsafe.Pointer(request)), uintptr(unsafe.Pointer(remain)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Close(fd int) (err error) {
_, _, e1 := Syscall(SYS_CLOSE, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func CopyFileRange(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int, err error) {
r0, _, e1 := Syscall6(SYS_COPY_FILE_RANGE, uintptr(rfd), uintptr(unsafe.Pointer(roff)), uintptr(wfd), uintptr(unsafe.Pointer(woff)), uintptr(len), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func DeleteModule(name string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(name)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_DELETE_MODULE, uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Dup(oldfd int) (fd int, err error) {
r0, _, e1 := Syscall(SYS_DUP, uintptr(oldfd), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Dup3(oldfd int, newfd int, flags int) (err error) {
_, _, e1 := Syscall(SYS_DUP3, uintptr(oldfd), uintptr(newfd), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func EpollCreate1(flag int) (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_EPOLL_CREATE1, uintptr(flag), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func EpollCtl(epfd int, op int, fd int, event *EpollEvent) (err error) {
_, _, e1 := RawSyscall6(SYS_EPOLL_CTL, uintptr(epfd), uintptr(op), uintptr(fd), uintptr(unsafe.Pointer(event)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Eventfd(initval uint, flags int) (fd int, err error) {
r0, _, e1 := Syscall(SYS_EVENTFD2, uintptr(initval), uintptr(flags), 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Exit(code int) {
SyscallNoError(SYS_EXIT_GROUP, uintptr(code), 0, 0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fallocate(fd int, mode uint32, off int64, len int64) (err error) {
_, _, e1 := Syscall6(SYS_FALLOCATE, uintptr(fd), uintptr(mode), uintptr(off), uintptr(len), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchdir(fd int) (err error) {
_, _, e1 := Syscall(SYS_FCHDIR, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchmod(fd int, mode uint32) (err error) {
_, _, e1 := Syscall(SYS_FCHMOD, uintptr(fd), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchownat(dirfd int, path string, uid int, gid int, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FCHOWNAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(uid), uintptr(gid), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fcntl(fd int, cmd int, arg int) (val int, err error) {
r0, _, e1 := Syscall(SYS_FCNTL, uintptr(fd), uintptr(cmd), uintptr(arg))
val = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fdatasync(fd int) (err error) {
_, _, e1 := Syscall(SYS_FDATASYNC, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fgetxattr(fd int, attr string, dest []byte) (sz int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(dest) > 0 {
_p1 = unsafe.Pointer(&dest[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_FGETXATTR, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(dest)), 0, 0)
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func FinitModule(fd int, params string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(params)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_FINIT_MODULE, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Flistxattr(fd int, dest []byte) (sz int, err error) {
var _p0 unsafe.Pointer
if len(dest) > 0 {
_p0 = unsafe.Pointer(&dest[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_FLISTXATTR, uintptr(fd), uintptr(_p0), uintptr(len(dest)))
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Flock(fd int, how int) (err error) {
_, _, e1 := Syscall(SYS_FLOCK, uintptr(fd), uintptr(how), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fremovexattr(fd int, attr string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attr)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_FREMOVEXATTR, uintptr(fd), uintptr(unsafe.Pointer(_p0)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fsetxattr(fd int, attr string, dest []byte, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(dest) > 0 {
_p1 = unsafe.Pointer(&dest[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_FSETXATTR, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(dest)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fsync(fd int) (err error) {
_, _, e1 := Syscall(SYS_FSYNC, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getdents(fd int, buf []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_GETDENTS64, uintptr(fd), uintptr(_p0), uintptr(len(buf)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpgid(pid int) (pgid int, err error) {
r0, _, e1 := RawSyscall(SYS_GETPGID, uintptr(pid), 0, 0)
pgid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpid() (pid int) {
r0, _ := RawSyscallNoError(SYS_GETPID, 0, 0, 0)
pid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getppid() (ppid int) {
r0, _ := RawSyscallNoError(SYS_GETPPID, 0, 0, 0)
ppid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpriority(which int, who int) (prio int, err error) {
r0, _, e1 := Syscall(SYS_GETPRIORITY, uintptr(which), uintptr(who), 0)
prio = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getrandom(buf []byte, flags int) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_GETRANDOM, uintptr(_p0), uintptr(len(buf)), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getrusage(who int, rusage *Rusage) (err error) {
_, _, e1 := RawSyscall(SYS_GETRUSAGE, uintptr(who), uintptr(unsafe.Pointer(rusage)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getsid(pid int) (sid int, err error) {
r0, _, e1 := RawSyscall(SYS_GETSID, uintptr(pid), 0, 0)
sid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Gettid() (tid int) {
r0, _ := RawSyscallNoError(SYS_GETTID, 0, 0, 0)
tid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getxattr(path string, attr string, dest []byte) (sz int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p2 unsafe.Pointer
if len(dest) > 0 {
_p2 = unsafe.Pointer(&dest[0])
} else {
_p2 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_GETXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(_p2), uintptr(len(dest)), 0, 0)
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func InitModule(moduleImage []byte, params string) (err error) {
var _p0 unsafe.Pointer
if len(moduleImage) > 0 {
_p0 = unsafe.Pointer(&moduleImage[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
var _p1 *byte
_p1, err = BytePtrFromString(params)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_INIT_MODULE, uintptr(_p0), uintptr(len(moduleImage)), uintptr(unsafe.Pointer(_p1)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func InotifyAddWatch(fd int, pathname string, mask uint32) (watchdesc int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(pathname)
if err != nil {
return
}
r0, _, e1 := Syscall(SYS_INOTIFY_ADD_WATCH, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(mask))
watchdesc = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func InotifyInit1(flags int) (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_INOTIFY_INIT1, uintptr(flags), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func InotifyRmWatch(fd int, watchdesc uint32) (success int, err error) {
r0, _, e1 := RawSyscall(SYS_INOTIFY_RM_WATCH, uintptr(fd), uintptr(watchdesc), 0)
success = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Kill(pid int, sig syscall.Signal) (err error) {
_, _, e1 := RawSyscall(SYS_KILL, uintptr(pid), uintptr(sig), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Klogctl(typ int, buf []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_SYSLOG, uintptr(typ), uintptr(_p0), uintptr(len(buf)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lgetxattr(path string, attr string, dest []byte) (sz int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p2 unsafe.Pointer
if len(dest) > 0 {
_p2 = unsafe.Pointer(&dest[0])
} else {
_p2 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_LGETXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(_p2), uintptr(len(dest)), 0, 0)
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Listxattr(path string, dest []byte) (sz int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(dest) > 0 {
_p1 = unsafe.Pointer(&dest[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_LISTXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(dest)))
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Llistxattr(path string, dest []byte) (sz int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(dest) > 0 {
_p1 = unsafe.Pointer(&dest[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_LLISTXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(dest)))
sz = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lremovexattr(path string, attr string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LREMOVEXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lsetxattr(path string, attr string, data []byte, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p2 unsafe.Pointer
if len(data) > 0 {
_p2 = unsafe.Pointer(&data[0])
} else {
_p2 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_LSETXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(_p2), uintptr(len(data)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func MemfdCreate(name string, flags int) (fd int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(name)
if err != nil {
return
}
r0, _, e1 := Syscall(SYS_MEMFD_CREATE, uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mkdirat(dirfd int, path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_MKDIRAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mknodat(dirfd int, path string, mode uint32, dev int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_MKNODAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(dev), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Nanosleep(time *Timespec, leftover *Timespec) (err error) {
_, _, e1 := Syscall(SYS_NANOSLEEP, uintptr(unsafe.Pointer(time)), uintptr(unsafe.Pointer(leftover)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func PerfEventOpen(attr *PerfEventAttr, pid int, cpu int, groupFd int, flags int) (fd int, err error) {
r0, _, e1 := Syscall6(SYS_PERF_EVENT_OPEN, uintptr(unsafe.Pointer(attr)), uintptr(pid), uintptr(cpu), uintptr(groupFd), uintptr(flags), 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func PivotRoot(newroot string, putold string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(newroot)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(putold)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_PIVOT_ROOT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func prlimit(pid int, resource int, newlimit *Rlimit, old *Rlimit) (err error) {
_, _, e1 := RawSyscall6(SYS_PRLIMIT64, uintptr(pid), uintptr(resource), uintptr(unsafe.Pointer(newlimit)), uintptr(unsafe.Pointer(old)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Prctl(option int, arg2 uintptr, arg3 uintptr, arg4 uintptr, arg5 uintptr) (err error) {
_, _, e1 := Syscall6(SYS_PRCTL, uintptr(option), uintptr(arg2), uintptr(arg3), uintptr(arg4), uintptr(arg5), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pselect(nfd int, r *FdSet, w *FdSet, e *FdSet, timeout *Timespec, sigmask *Sigset_t) (n int, err error) {
r0, _, e1 := Syscall6(SYS_PSELECT6, uintptr(nfd), uintptr(unsafe.Pointer(r)), uintptr(unsafe.Pointer(w)), uintptr(unsafe.Pointer(e)), uintptr(unsafe.Pointer(timeout)), uintptr(unsafe.Pointer(sigmask)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func read(fd int, p []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(_p0), uintptr(len(p)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Removexattr(path string, attr string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_REMOVEXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Renameat2(olddirfd int, oldpath string, newdirfd int, newpath string, flags uint) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(oldpath)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(newpath)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_RENAMEAT2, uintptr(olddirfd), uintptr(unsafe.Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.Pointer(_p1)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func RequestKey(keyType string, description string, callback string, destRingid int) (id int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(keyType)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(description)
if err != nil {
return
}
var _p2 *byte
_p2, err = BytePtrFromString(callback)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_REQUEST_KEY, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(unsafe.Pointer(_p2)), uintptr(destRingid), 0, 0)
id = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setdomainname(p []byte) (err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_SETDOMAINNAME, uintptr(_p0), uintptr(len(p)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Sethostname(p []byte) (err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_SETHOSTNAME, uintptr(_p0), uintptr(len(p)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setpgid(pid int, pgid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETPGID, uintptr(pid), uintptr(pgid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setsid() (pid int, err error) {
r0, _, e1 := RawSyscall(SYS_SETSID, 0, 0, 0)
pid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Settimeofday(tv *Timeval) (err error) {
_, _, e1 := RawSyscall(SYS_SETTIMEOFDAY, uintptr(unsafe.Pointer(tv)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setns(fd int, nstype int) (err error) {
_, _, e1 := Syscall(SYS_SETNS, uintptr(fd), uintptr(nstype), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setpriority(which int, who int, prio int) (err error) {
_, _, e1 := Syscall(SYS_SETPRIORITY, uintptr(which), uintptr(who), uintptr(prio))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setxattr(path string, attr string, data []byte, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attr)
if err != nil {
return
}
var _p2 unsafe.Pointer
if len(data) > 0 {
_p2 = unsafe.Pointer(&data[0])
} else {
_p2 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_SETXATTR, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), uintptr(_p2), uintptr(len(data)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func signalfd(fd int, sigmask *Sigset_t, maskSize uintptr, flags int) (newfd int, err error) {
r0, _, e1 := Syscall6(SYS_SIGNALFD4, uintptr(fd), uintptr(unsafe.Pointer(sigmask)), uintptr(maskSize), uintptr(flags), 0, 0)
newfd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Statx(dirfd int, path string, flags int, mask int, stat *Statx_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_STATX, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(flags), uintptr(mask), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Sync() {
SyscallNoError(SYS_SYNC, 0, 0, 0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Syncfs(fd int) (err error) {
_, _, e1 := Syscall(SYS_SYNCFS, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Sysinfo(info *Sysinfo_t) (err error) {
_, _, e1 := RawSyscall(SYS_SYSINFO, uintptr(unsafe.Pointer(info)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Tee(rfd int, wfd int, len int, flags int) (n int64, err error) {
r0, _, e1 := Syscall6(SYS_TEE, uintptr(rfd), uintptr(wfd), uintptr(len), uintptr(flags), 0, 0)
n = int64(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Tgkill(tgid int, tid int, sig syscall.Signal) (err error) {
_, _, e1 := RawSyscall(SYS_TGKILL, uintptr(tgid), uintptr(tid), uintptr(sig))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Times(tms *Tms) (ticks uintptr, err error) {
r0, _, e1 := RawSyscall(SYS_TIMES, uintptr(unsafe.Pointer(tms)), 0, 0)
ticks = uintptr(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Umask(mask int) (oldmask int) {
r0, _ := RawSyscallNoError(SYS_UMASK, uintptr(mask), 0, 0)
oldmask = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Uname(buf *Utsname) (err error) {
_, _, e1 := RawSyscall(SYS_UNAME, uintptr(unsafe.Pointer(buf)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unmount(target string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(target)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UMOUNT2, uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unshare(flags int) (err error) {
_, _, e1 := Syscall(SYS_UNSHARE, uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func write(fd int, p []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(_p0), uintptr(len(p)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func exitThread(code int) (err error) {
_, _, e1 := Syscall(SYS_EXIT, uintptr(code), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func readlen(fd int, p *byte, np int) (n int, err error) {
r0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(unsafe.Pointer(p)), uintptr(np))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func writelen(fd int, p *byte, np int) (n int, err error) {
r0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(unsafe.Pointer(p)), uintptr(np))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func readv(fd int, iovs []Iovec) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_READV, uintptr(fd), uintptr(_p0), uintptr(len(iovs)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func writev(fd int, iovs []Iovec) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_WRITEV, uintptr(fd), uintptr(_p0), uintptr(len(iovs)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func preadv(fd int, iovs []Iovec, offs_l uintptr, offs_h uintptr) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PREADV, uintptr(fd), uintptr(_p0), uintptr(len(iovs)), uintptr(offs_l), uintptr(offs_h), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func pwritev(fd int, iovs []Iovec, offs_l uintptr, offs_h uintptr) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PWRITEV, uintptr(fd), uintptr(_p0), uintptr(len(iovs)), uintptr(offs_l), uintptr(offs_h), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func preadv2(fd int, iovs []Iovec, offs_l uintptr, offs_h uintptr, flags int) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PREADV2, uintptr(fd), uintptr(_p0), uintptr(len(iovs)), uintptr(offs_l), uintptr(offs_h), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func pwritev2(fd int, iovs []Iovec, offs_l uintptr, offs_h uintptr, flags int) (n int, err error) {
var _p0 unsafe.Pointer
if len(iovs) > 0 {
_p0 = unsafe.Pointer(&iovs[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PWRITEV2, uintptr(fd), uintptr(_p0), uintptr(len(iovs)), uintptr(offs_l), uintptr(offs_h), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func munmap(addr uintptr, length uintptr) (err error) {
_, _, e1 := Syscall(SYS_MUNMAP, uintptr(addr), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Madvise(b []byte, advice int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MADVISE, uintptr(_p0), uintptr(len(b)), uintptr(advice))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mprotect(b []byte, prot int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MPROTECT, uintptr(_p0), uintptr(len(b)), uintptr(prot))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mlock(b []byte) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MLOCK, uintptr(_p0), uintptr(len(b)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mlockall(flags int) (err error) {
_, _, e1 := Syscall(SYS_MLOCKALL, uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Msync(b []byte, flags int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MSYNC, uintptr(_p0), uintptr(len(b)), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Munlock(b []byte) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MUNLOCK, uintptr(_p0), uintptr(len(b)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Munlockall() (err error) {
_, _, e1 := Syscall(SYS_MUNLOCKALL, 0, 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func faccessat(dirfd int, path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_FACCESSAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func nameToHandleAt(dirFD int, pathname string, fh *fileHandle, mountID *_C_int, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(pathname)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_NAME_TO_HANDLE_AT, uintptr(dirFD), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(fh)), uintptr(unsafe.Pointer(mountID)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func openByHandleAt(mountFD int, fh *fileHandle, flags int) (fd int, err error) {
r0, _, e1 := Syscall(SYS_OPEN_BY_HANDLE_AT, uintptr(mountFD), uintptr(unsafe.Pointer(fh)), uintptr(flags))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Dup2(oldfd int, newfd int) (err error) {
_, _, e1 := Syscall(SYS_DUP2, uintptr(oldfd), uintptr(newfd), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func EpollCreate(size int) (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_EPOLL_CREATE, uintptr(size), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func EpollWait(epfd int, events []EpollEvent, msec int) (n int, err error) {
var _p0 unsafe.Pointer
if len(events) > 0 {
_p0 = unsafe.Pointer(&events[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_EPOLL_WAIT, uintptr(epfd), uintptr(_p0), uintptr(len(events)), uintptr(msec), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fadvise(fd int, offset int64, length int64, advice int) (err error) {
_, _, e1 := Syscall6(SYS_FADVISE64, uintptr(fd), uintptr(offset), uintptr(length), uintptr(advice), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchown(fd int, uid int, gid int) (err error) {
_, _, e1 := Syscall(SYS_FCHOWN, uintptr(fd), uintptr(uid), uintptr(gid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fstat(fd int, stat *Stat_t) (err error) {
_, _, e1 := Syscall(SYS_FSTAT, uintptr(fd), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fstatat(dirfd int, path string, stat *Stat_t, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_NEWFSTATAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fstatfs(fd int, buf *Statfs_t) (err error) {
_, _, e1 := Syscall(SYS_FSTATFS, uintptr(fd), uintptr(unsafe.Pointer(buf)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Ftruncate(fd int, length int64) (err error) {
_, _, e1 := Syscall(SYS_FTRUNCATE, uintptr(fd), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getegid() (egid int) {
r0, _ := RawSyscallNoError(SYS_GETEGID, 0, 0, 0)
egid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Geteuid() (euid int) {
r0, _ := RawSyscallNoError(SYS_GETEUID, 0, 0, 0)
euid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getgid() (gid int) {
r0, _ := RawSyscallNoError(SYS_GETGID, 0, 0, 0)
gid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getrlimit(resource int, rlim *Rlimit) (err error) {
_, _, e1 := RawSyscall(SYS_UGETRLIMIT, uintptr(resource), uintptr(unsafe.Pointer(rlim)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getuid() (uid int) {
r0, _ := RawSyscallNoError(SYS_GETUID, 0, 0, 0)
uid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func InotifyInit() (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_INOTIFY_INIT, 0, 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Ioperm(from int, num int, on int) (err error) {
_, _, e1 := Syscall(SYS_IOPERM, uintptr(from), uintptr(num), uintptr(on))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Iopl(level int) (err error) {
_, _, e1 := Syscall(SYS_IOPL, uintptr(level), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lchown(path string, uid int, gid int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LCHOWN, uintptr(unsafe.Pointer(_p0)), uintptr(uid), uintptr(gid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Listen(s int, n int) (err error) {
_, _, e1 := Syscall(SYS_LISTEN, uintptr(s), uintptr(n), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lstat(path string, stat *Stat_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LSTAT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pause() (err error) {
_, _, e1 := Syscall(SYS_PAUSE, 0, 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pread(fd int, p []byte, offset int64) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PREAD64, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pwrite(fd int, p []byte, offset int64) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PWRITE64, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Renameat(olddirfd int, oldpath string, newdirfd int, newpath string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(oldpath)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(newpath)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_RENAMEAT, uintptr(olddirfd), uintptr(unsafe.Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.Pointer(_p1)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Seek(fd int, offset int64, whence int) (off int64, err error) {
r0, _, e1 := Syscall(SYS_LSEEK, uintptr(fd), uintptr(offset), uintptr(whence))
off = int64(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Select(nfd int, r *FdSet, w *FdSet, e *FdSet, timeout *Timeval) (n int, err error) {
r0, _, e1 := Syscall6(SYS__NEWSELECT, uintptr(nfd), uintptr(unsafe.Pointer(r)), uintptr(unsafe.Pointer(w)), uintptr(unsafe.Pointer(e)), uintptr(unsafe.Pointer(timeout)), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sendfile(outfd int, infd int, offset *int64, count int) (written int, err error) {
r0, _, e1 := Syscall6(SYS_SENDFILE, uintptr(outfd), uintptr(infd), uintptr(unsafe.Pointer(offset)), uintptr(count), 0, 0)
written = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setfsgid(gid int) (err error) {
_, _, e1 := Syscall(SYS_SETFSGID, uintptr(gid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setfsuid(uid int) (err error) {
_, _, e1 := Syscall(SYS_SETFSUID, uintptr(uid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setregid(rgid int, egid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETREGID, uintptr(rgid), uintptr(egid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setresgid(rgid int, egid int, sgid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETRESGID, uintptr(rgid), uintptr(egid), uintptr(sgid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setresuid(ruid int, euid int, suid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETRESUID, uintptr(ruid), uintptr(euid), uintptr(suid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setrlimit(resource int, rlim *Rlimit) (err error) {
_, _, e1 := RawSyscall(SYS_SETRLIMIT, uintptr(resource), uintptr(unsafe.Pointer(rlim)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setreuid(ruid int, euid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETREUID, uintptr(ruid), uintptr(euid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Shutdown(fd int, how int) (err error) {
_, _, e1 := Syscall(SYS_SHUTDOWN, uintptr(fd), uintptr(how), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Splice(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int64, err error) {
r0, _, e1 := Syscall6(SYS_SPLICE, uintptr(rfd), uintptr(unsafe.Pointer(roff)), uintptr(wfd), uintptr(unsafe.Pointer(woff)), uintptr(len), uintptr(flags))
n = int64(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Stat(path string, stat *Stat_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_STAT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Statfs(path string, buf *Statfs_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_STATFS, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(buf)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Truncate(path string, length int64) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_TRUNCATE, uintptr(unsafe.Pointer(_p0)), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Ustat(dev int, ubuf *Ustat_t) (err error) {
_, _, e1 := Syscall(SYS_USTAT, uintptr(dev), uintptr(unsafe.Pointer(ubuf)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func accept(s int, rsa *RawSockaddrAny, addrlen *_Socklen) (fd int, err error) {
r0, _, e1 := Syscall(SYS_ACCEPT, uintptr(s), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func accept4(s int, rsa *RawSockaddrAny, addrlen *_Socklen, flags int) (fd int, err error) {
r0, _, e1 := Syscall6(SYS_ACCEPT4, uintptr(s), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)), uintptr(flags), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func bind(s int, addr unsafe.Pointer, addrlen _Socklen) (err error) {
_, _, e1 := Syscall(SYS_BIND, uintptr(s), uintptr(addr), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func connect(s int, addr unsafe.Pointer, addrlen _Socklen) (err error) {
_, _, e1 := Syscall(SYS_CONNECT, uintptr(s), uintptr(addr), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getgroups(n int, list *_Gid_t) (nn int, err error) {
r0, _, e1 := RawSyscall(SYS_GETGROUPS, uintptr(n), uintptr(unsafe.Pointer(list)), 0)
nn = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func setgroups(n int, list *_Gid_t) (err error) {
_, _, e1 := RawSyscall(SYS_SETGROUPS, uintptr(n), uintptr(unsafe.Pointer(list)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getsockopt(s int, level int, name int, val unsafe.Pointer, vallen *_Socklen) (err error) {
_, _, e1 := Syscall6(SYS_GETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(unsafe.Pointer(vallen)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func setsockopt(s int, level int, name int, val unsafe.Pointer, vallen uintptr) (err error) {
_, _, e1 := Syscall6(SYS_SETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(vallen), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func socket(domain int, typ int, proto int) (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_SOCKET, uintptr(domain), uintptr(typ), uintptr(proto))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func socketpair(domain int, typ int, proto int, fd *[2]int32) (err error) {
_, _, e1 := RawSyscall6(SYS_SOCKETPAIR, uintptr(domain), uintptr(typ), uintptr(proto), uintptr(unsafe.Pointer(fd)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getpeername(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {
_, _, e1 := RawSyscall(SYS_GETPEERNAME, uintptr(fd), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getsockname(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {
_, _, e1 := RawSyscall(SYS_GETSOCKNAME, uintptr(fd), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func recvfrom(fd int, p []byte, flags int, from *RawSockaddrAny, fromlen *_Socklen) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_RECVFROM, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(flags), uintptr(unsafe.Pointer(from)), uintptr(unsafe.Pointer(fromlen)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sendto(s int, buf []byte, flags int, to unsafe.Pointer, addrlen _Socklen) (err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_SENDTO, uintptr(s), uintptr(_p0), uintptr(len(buf)), uintptr(flags), uintptr(to), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func recvmsg(s int, msg *Msghdr, flags int) (n int, err error) {
r0, _, e1 := Syscall(SYS_RECVMSG, uintptr(s), uintptr(unsafe.Pointer(msg)), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sendmsg(s int, msg *Msghdr, flags int) (n int, err error) {
r0, _, e1 := Syscall(SYS_SENDMSG, uintptr(s), uintptr(unsafe.Pointer(msg)), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mmap(addr uintptr, length uintptr, prot int, flags int, fd int, offset int64) (xaddr uintptr, err error) {
r0, _, e1 := Syscall6(SYS_MMAP, uintptr(addr), uintptr(length), uintptr(prot), uintptr(flags), uintptr(fd), uintptr(offset))
xaddr = uintptr(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func futimesat(dirfd int, path string, times *[2]Timeval) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_FUTIMESAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(times)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Gettimeofday(tv *Timeval) (err error) {
_, _, e1 := RawSyscall(SYS_GETTIMEOFDAY, uintptr(unsafe.Pointer(tv)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Time(t *Time_t) (tt Time_t, err error) {
r0, _, e1 := RawSyscall(SYS_TIME, uintptr(unsafe.Pointer(t)), 0, 0)
tt = Time_t(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Utime(path string, buf *Utimbuf) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UTIME, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(buf)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func utimes(path string, times *[2]Timeval) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UTIMES, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(times)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func pipe(p *[2]_C_int) (err error) {
_, _, e1 := RawSyscall(SYS_PIPE, uintptr(unsafe.Pointer(p)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func pipe2(p *[2]_C_int, flags int) (err error) {
_, _, e1 := RawSyscall(SYS_PIPE2, uintptr(unsafe.Pointer(p)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func poll(fds *PollFd, nfds int, timeout int) (n int, err error) {
r0, _, e1 := Syscall(SYS_POLL, uintptr(unsafe.Pointer(fds)), uintptr(nfds), uintptr(timeout))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func syncFileRange2(fd int, flags int, off int64, n int64) (err error) {
_, _, e1 := Syscall6(SYS_SYNC_FILE_RANGE2, uintptr(fd), uintptr(flags), uintptr(off), uintptr(n), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func kexecFileLoad(kernelFd int, initrdFd int, cmdlineLen int, cmdline string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(cmdline)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_KEXEC_FILE_LOAD, uintptr(kernelFd), uintptr(initrdFd), uintptr(cmdlineLen), uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
| 2023-09-18T01:26:29.851802 | https://example.com/article/8133 |
This is the first part of a series on the new SAT that will be doled out over the next 18 months as we await more information on the final form of the exam. It’s worth noting that these changes will affect test takers in 2016, but anyone planning to take the exam before that will be under the old system (search our blog for informative posts about that exam. We have some goods stuff.)
Today’s post was brought to you by one of our lead teachers, John Mahone. Without further ado, here’s some of what’s coming and what we’ve concluded.
Following up on last month’s event, during which the College Board, amongst horse-drawn carriages and blaring bugles, expanded on the details for the coming changes to the SAT, which will be rolled out in 2016. On April 16th, College Board quietly dropped 208 pages of unanswered questions and teasers on the internet and the world. The first quarter of the tome lays out The College Board’s reasoning for changing the test (somehow without mentioning the words “market share”) and strategy on how to do so (somehow without saying “we copied the ACT.”) But let’s get to the useful stuff.
What’s Different?
In short, a lot. The test will look and feel a lot different than it currently does.
This is major plastic surgery (cheek implants, nose job, botox, ear lifts, shin implants, tummy tuck, and collagen implants) on the test itself and not just the facelift that the 2005 revision was. Here are some of those big changes (in our coming post we’ll address some of the specific changes for math and verbal):
Back to the 1600 point scale. The new test will consist of two mandatory sections “Evidence Based Reading and Writing” and “Math,” each scored on the standard 200-800 point scale. The other section will be the Essay, which will be optional.
The new test will run 3 hours flat, with 50 minutes allotted for the optional essay, which will now be given at the end.
No more guessing penalty. Students will no longer have that quarter of a point deducted for wrong answers, eliminating the entire strategy of leaving questions blank and now raising the “Why would you ever leave that blank?” question from teachers to countless students.
Due to the removal of the guessing penalty, multiple choice questions will now have only 4 answer choices, because everyone hates “E.”
The other major change to scoring is the inclusion of what The College Board is calling “test scores,” “cross-test scores,” and “subscores.” This may get a little confusing, so stay with me.
“Test scores” will be individual grades given in the categories of reading, writing and language, math, and the essay (if taken). This format is reminiscent of the scoring system used for the past decade. However, these scores will be given on a 10-40 point scale, rendering them completely meaningless to anyone for at least 5 years.
“Cross-test scores,” which I will refer to as “the SAT jungle” because no one really knows what’s in it and few will venture in to find out. The cross-test scores, “Analysis in History/Social Studies” and “Analysis in Science,” will be based on specific questions across the three “tests” that deal with history/social studies and science. These questions will be combined to comprise the cross-test scores, which will be reported on the same useless 10-40 scale. You’re still, here? Impressive.
Finally. there will be seven “subscores,” because you didn’t have enough scores already. These will also be drawn from the three “tests.” The Reading test and the Language and Writing test will contribute to the subscores of “Command of Evidence” and “Relevant Words in Context.” The Writing test itself will be used for the subscores “Expression of Ideas” and “Standard English Conventions.” Lastly, the Math test will report the subscores of “Heart of Algebra,” “Problem Solving and Data Analysis,” and “Passport to Advanced Math.” The subscores will have an entirely pointless scoring range of their own, 1-15.
So there you have it. I assume this makes total sense to you and leaves you with absolutely no follow up questions, because College Board is making the same assumption and as of the publication of this post has not provided any more explanation. | 2023-10-20T01:26:29.851802 | https://example.com/article/5328 |
the power of greyskull
16 July 2008
So OK I was cleaning up the kitchen last night, after I wrote that post actually. I hate that; when I forget that it was me who cooked dinner and therefore I have to clean up the kitchen. (Do you have that rule? Because we cook almost equally, it works out better not to have to clean up another person’s mess. It also means you can’t get shitty with the person who left the mashed potatoes lurking in the pot to harden to a solid mass; because that person was YOU.) Anyway, I wandered into the kitchen, went “oh bugger” because there was crap everywhere, and noticed a sort of delicious chickeny smell. Why would that be? Oh, because I made risotto, using chicken stock, and the now-empty saucepan I used to heat the stock up in was still sitting on the gas hob. On low. For over four hours. Ah. So that pot is now filled with baking soda and water, in the hope that the Magic of Baking Soda will remove the charred remnants of chicken stock burned deep into the saucepan. I rely quite heavily on the Magic of Baking Soda. Also the Power of White Vinegar.
Actually, speaking of, I have a related laundry story. I know, it’s all domestic and shit over here! But a couple of weeks ago I was pulling washing out of the washing machine, and as I pulled a shirt out, there was An Odour. Not a pleasant one. I stood there blankly for a minute, trying to figure out what it was and where it was coming from. You know what it was? It was FISH. A definite, strong, fishy smell. I started pulling items of clothing from the washing machine and smelling them, much like a bloodhound on CSI. And a few items later, the smell increasing in potency with each piece I pulled out, it was determined that the smell was concentrated in… a pair of Mr. T’s work trousers. Why? How? What… what? I couldn’t even focus; the smell of fish was everywhere, my vision had narrowed to one blurry point and I was finding it hard to breathe.
When Mr. T got home, I confronted him with his Piscine Pants of Doom, hollering, “SMELL! SMELL THEM!” (Actually, now that I think about it, he didn’t even blink at being forced to smell his own clothing. I should think up more bizarre things for him to do.) Being the great judge of flavours that he is, he couldn’t even pick up that it was fish. Then he flat-out denied that it could be fish. How could it be fish? It’s fish! With pants! Pants and fish don’t mix! Then I showed him this odd yellow crunchy plastic stuff in the pocket… oh. Oh yeah. Now he remembers. He remembers putting the trousers on in the morning. He remembers not having time to take his fish oil capsule. He remembers PUTTING IT IN HIS POCKET as he left for work. And he doesn’t remember ever eating it.
A fish oil capsule. I have no words.
Those pants are fucked, basically. They’ve been washed four times, and hung up in the rain/wind/hail/sleet for weeks at a time on the clothesline. Every time they dry, the smell of fish returns. Not even the Magic of Baking Soda and the Power of White Vinegar COMBINED has worked. Any suggestions? Bueller? Bueller?
OK now I have detailed my domestic shortcomings… a picture! This is from my trip back to New Zealand in Easter, which was mid-March. What can I say, I don’t clear off my memory cards that often. Again, suck it, dead hard drive! You’re not the boss of me!
This is Mr. T’s sister with one of his nephews. They’re identical twins, so if they’re not both in the photo, neither of us can tell which twin it is. We think this might be the Fat Twin (whose name starts with F) but it is just as likely to be the Little Twin (whose name starts with L). Hard to say, and I don’t think you guys can help me here.
I posted this because I made the bib he’s wearing. In fact I made approximately 30 bibs for these babies, as apparently most bibs are quite small and the huge size of this one was a hit. It does have a gorgeous fabric on the front, but he’s wearing it towelling-side out, due to his unfortunate habit of being sick on it. Babies. No respect for craft.
Use The Power of Science – what you need is some kind of solvent – either an oil (eucalyptus, anyone) or something that bullies oil into submission, like turps. Of course, you end up having pants that smell like the New Oil. Or if they’re polyester pants, you have a small shrivelled pile of melted polycarbons.
Lavender oil. Fitting punishment really. Soak the offending pocket thoroughly, let sit, make a paste of washing powder with a wee amount of water & place on same. DO NOT let it dry out. Then wash & pray. Have not ever managed to resurrect a pot after the usual burning – managed on one occasion to melt the solder between copper bottom & steel upper. Try scrubbing that off the stovetop…
mmm, not sure what to suggest with the fish pants. Maybe sards wonder soap? However I fear if baking soda can’t lift the smell then nothing can. Perhaps just leave them on the washing line for a month or two and see if that works?
Since you posted this I’ve thought several times about the ‘cook does the dishes’ principle, (always while washing up, naturally) and it’s obviously brilliant. I just can’t think of how to tactfully get it operational here.
"Make a remark," said the Red Queen: "Its ridiculous to leave all conversation to the pudding!" | 2024-06-11T01:26:29.851802 | https://example.com/article/1439 |
Q:
Sum data from multiple csv files using pandas
I have -many- csv files with the same number of columns (different number of rows) in the following pattern:
Files 1:
A1,B1,C1
A2,B2,C2
A3,B3,C3
A4,B4,C4
File 2:
*A1*,*B1*,*C1*
*A2*,*B2*,*C2*
*A3*,*B3*,*C3*
File ...
Output:
A1+*A1*+...,B1+*B1*+...,C1+*C1*+...
A2+*A2*+...,B2+*B2*+...,C2+*C2*+...
A3+*A3*+...,B3+*B3*+...,C3+*C3*+...
A4+... ,B4+... ,C4+...
For example:
Files 1:
1,0,0
1,0,1
1,0,0
0,1,0
Files 2:
1,1,0
1,1,1
0,1,0
Output:
2,1,0
2,1,2
1,1,0
0,1,0
I am trying to use python.pandas and was thinking of something like this to create the reading variables:
dic={}
for i in range(14253,14352):
try:
dic['df_{0}'.format(i)]=pandas.read_csv('output_'+str(i)+'.csv')
except:
pass
and then to sum the columns:
for residue in residues:
for number in range(14254,14255):
df=dic['df_14253'][residue]
df+=dic['df_'+str(number)][residue]
residues is a list of strings which are the column names.
I have the problem that my files have different numbers of rows and are only summed up until the last row of df1. How could I add them up until the last row of the longest file - so that no data is lost? I think groupby.sum by panda could be an option but I don't understand how to use it.
To add an example - now I get this:
Files 1:
1,0,0
1,0,1
1,0,0
0,1,0
Files 2:
1,1,0
1,1,1
0,1,0
File 3:
1,0,0
0,0,1
1,0,0
1,0,0
1,0,0
1,0,1
File ...:
Output:
3,1,0
2,1,3
2,1,0
1,1,0
1,0,0
1,0,1
A:
You can use Panel in pandas , a 3Dobject, collection of dataframes :
dfs={ i : pd.DataFrame.from_csv('file'+str(i)+'.csv',sep=',',\
header=None,index_col=None) for i in range(n)} # n files.
panel=pd.Panel(dfs)
dfs_sum=panel.sum(axis=0)
dfs is a dictionnary of dataframes. Panel completes automatically lacking values with Nan and does the good sum. For example :
n [500]: panel[1]
Out[500]:
0 1 2
0 1 0 0
1 1 0 1
2 1 0 0
3 0 1 0
4 NaN NaN NaN
5 NaN NaN NaN
6 NaN NaN NaN
7 NaN NaN NaN
8 NaN NaN NaN
9 NaN NaN NaN
10 NaN NaN NaN
11 NaN NaN NaN
In [501]: panel[2]
Out[501]:
0 1 2
0 1 0 0
1 1 0 1
2 1 0 0
3 0 1 0
4 1 0 0
5 1 0 1
6 1 0 0
7 0 1 0
8 NaN NaN NaN
9 NaN NaN NaN
10 NaN NaN NaN
11 NaN NaN NaN
In [502]: panel[3]
Out[502]:
0 1 2
0 1 0 0
1 1 0 1
2 1 0 0
3 0 1 0
4 1 0 0
5 1 0 1
6 1 0 0
7 0 1 0
8 1 0 0
9 1 0 1
10 1 0 0
11 0 1 0
In [503]: panel.sum(0)
Out[503]:
0 1 2
0 3 0 0
1 3 0 3
2 3 0 0
3 0 3 0
4 2 0 0
5 2 0 2
6 2 0 0
7 0 2 0
8 1 0 0
9 1 0 1
10 1 0 0
11 0 1 0
| 2024-06-12T01:26:29.851802 | https://example.com/article/8470 |
The following exchange be tween former New Jersey Govs. Brendan T. Byrne and Tom Kean took place in a teleconference last week.
Q: How much of an impact have the long hiatus in the gubernatorial campaign and the public's continued preoccupation with the events and aftermath of Sept. 11 had on the candidates?
BYRNE:
It's remarkable the ability Bret Schundler has to put his foot in his mouth even when he's not campaigning. The statement he made about New Jersey's response to the World Trade Center disaster - saying our State Police didn't respond, and when they did they sat on their behinds and did nothing - is evidence of that. And it's consistent with putting his foot in his mouth on other issues. Later, when it came out that they did a heroic job, he tried to get his foot out, but I don't think he could. Even you didn't try to defend that, Tom, and I admired you for it.
KEAN:
He misspoke on that one. He was trying to lay out a plan for the state to upgrade its emergency response. In fact, we have a number of heroes in New Jersey's police, fire service and emergency personnel who did a wonderful job. But, to answer the question, the campaign is markedly different. McGreevey is helped because he was out in front, so he stays where he is. On the other hand, the issues have totally changed. I'm not so sure citizens are interested in whether or not there's a tax cut. What they're looking for now is a strong leader in the mold of Giuliani - and someone who can create jobs. Our economy is in trouble and we need a governor who can attract jobs and keep the ones we have. That may benefit Schundler.
BYRNE:
You think people are looking for leadership from a candidate, namely Schundler, who wants to reject a New Jersey Supreme Court order to build schools - which would, by the way, not only create jobs but fulfill our educational mandate? He's saying the Supreme Court of New Jersey is worth ignoring, and he's unconstitutionally interpreting the constitution. Is that the leadership we're looking for?
KEAN:
That's not exactly what he said. I support the present Supreme Court decision, although I think previous Supreme Court decisions on this subject have been misguided. But Schundler's saying the people who ought to make such decisions are not those in black robes but those elected by the people - in other words, the governor and the Legislature.
BYRNE:
And ignore the mandate of the court?
KEAN:
He may be appealing parts of that decision.
BYRNE:
That decision is not appealable. But is that the kind of leadership you want?
KEAN:
A number of governors have appealed Supreme Court decisions over the years. He would have the right to appeal and to go to the Legislature for a remedy.
BYRNE:
The Legislature can amend the constitution, but it can't amend a constitutional decision by the court.
KEAN:
I would never want to argue with a great constitutional lawyer like you. But ultimately, the judges of what should be changed in the constitution are the Legislature and the governor. They passed it, they can amend it. It can happen, and has happened in the past.
BYRNE:
Nobody is going to amend it to shortchange kids. And Schundler also is promoting all this spending, like tax relief, half a billion for senior citizens . . .
KEAN:
What spending are you talking about?
BYRNE:
Tax relief, taking down Parkway toll booths. If you have a budget and you take a half billion out of it . . .
KEAN:
We need tax relief. Both candidates say that. Getting some tax relief at the present will save jobs and create more.
BYRNE:
It will create more debt.
KEAN:
It will create more jobs and more spending. People will buy new cars . . .
BYRNE:
And if you think they can do a half-billion-dollar cut and not affect the budget, you're overextending your faith in Schundler.
KEAN:
There's no question that if you cut tax burdens and put money back in people's pockets, you'll help New Jersey's economy. You can't increase taxes in a time of recession. Unfortunately, that's what the Democrats have done before, and I'm afraid they'll do it again.
BYRNE:
Tax revenues have gone down. Do you blame . . .
KEAN:
I blame a declining economy, and that's the best time to cut taxes. You and I have always agreed that those who have increased debt in times of prosperity were wrong.
BYRNE:
Whitman increased debt.
KEAN:
So did Florio. This is a different time. In times of recession you put money back in people's pockets.
BYRNE:
After defending Whitman for seven years, you're now admitting the obvious?
KEAN:
We extended debt under two governors, Florio and Whitman. Both borrowed too much.
BYRNE:
And now you say we borrow to get out of a recession?
KEAN:
That's the only way you can justify it. Unless you can get money back in people's pockets and get them working again, you will not be able to sustain the economy.
BYRNE:
I sustained the economy by employing 40,000 people in Atlantic City, and you criticized me for it. | 2024-05-09T01:26:29.851802 | https://example.com/article/8150 |
/* Copyright (C) 2003-2015 LiveCode Ltd.
This file is part of LiveCode.
LiveCode is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License v3 as published by the Free
Software Foundation.
LiveCode is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with LiveCode. If not see <http://www.gnu.org/licenses/>. */
//
// utility functions
//
#ifndef UTIL_H
#define UTIL_H
#include "parsedef.h"
#include "sysdefs.h"
#include "typedefs.h"
#include "mcsemaphore.h"
typedef struct
{
uint2 lockscreen;
MCSemaphore errorlock;
Boolean watchcursor;
Boolean lockerrors;
Boolean lockmessages;
Boolean lockmoves;
Boolean lockrecent;
Boolean lockmenus;
Boolean interrupt;
uint2 dragspeed;
MCCard *dynamiccard;
MCObject *errorptr;
MCObject *errorlockptr;
Boolean exitall;
}
MCSaveprops;
struct MCSortnode
{
union
{
MCStringRef svalue;
MCNumberRef nvalue;
MCDataRef dvalue;
};
const void *data;
MCSortnode()
: svalue(nil), data(nullptr) {}
~MCSortnode()
{
if (svalue != nil)
MCValueRelease(svalue);
}
MCSortnode& operator= (const MCSortnode& s)
{
MCValueAssign(svalue, s.svalue);
data = s.data;
return *this;
}
};
extern void MCU_play();
extern void MCU_play_stop();
extern void MCU_init();
extern void MCU_watchcursor(MCStack *sptr, Boolean force);
extern void MCU_unwatchcursor(MCStack *sptr, Boolean force);
extern void MCU_resetprops(Boolean update);
extern void MCU_saveprops(MCSaveprops &sp);
extern void MCU_restoreprops(MCSaveprops &sp);
extern int4 MCU_any(int4 max);
extern bool MCU_getnumberformat(uint2 fw, uint2 trail, uint2 force, MCStringRef& r_string);
extern void MCU_setnumberformat(MCStringRef p_input, uint2 &fw, uint2 &trailing, uint2 &force);
extern real8 MCU_stoIEEE(const char *bytes);
extern real8 MCU_i4tor8(int4 in);
extern real8 MCU_fwrap(real8 p_x, real8 p_y);
extern int4 MCU_r8toi4(real8 in);
extern void MCU_srand();
extern real8 MCU_drand();
extern Boolean MCU_comparechar(const char *sptr, char target,
Boolean isunicode = False);
extern Boolean MCU_strchr(const char *&, uint4 &, char,
Boolean isunicode = False);
inline uint1 MCU_charsize(Boolean isunicode = False);
extern char *MCU_strtok(char *, const char *);
/* WRAPPER */ extern bool MCU_strtol(MCStringRef p_string, int4& r_l);
extern int4 MCU_strtol(const char *&, uint4 &, int1, Boolean &done,
Boolean reals = False, Boolean octals = False);
extern real8 MCU_strtor8(const char *&, uint4 &, int1, Boolean &r_done,
Boolean convertoctals = False);
extern void MCU_strip(char *sptr, uint2 trailing, uint2 force);
extern uint4 MCU_r8tos(char *&sptr, uint4 &s, real8 n,uint2 fw, uint2 trailing, uint2 force);
extern bool MCU_r8tos(real8 n, uint2 fw, uint2 trailing, uint2 force, MCStringRef &r_string);
extern bool MCU_stor8(MCStringRef, real8& r_d, bool co = false);
extern Boolean MCU_stor8(const MCString&, real8& d, Boolean co = False);
extern bool MCU_stoi2(MCStringRef, int2 &r_d);
extern Boolean MCU_stoi2(const MCString&, int2 &d);
extern bool MCU_stoui2(MCStringRef p_string, uint2 &r_d);
extern Boolean MCU_stoui2(const MCString&, uint2 &d);
extern bool MCU_stoi2x2(MCStringRef p_string, int16_t& r_d1, int16_t& r_d2);
extern Boolean MCU_stoi2x2(const MCString&, int2 &d1, int2 &d2);
extern bool MCU_stoi2x4(MCStringRef p_string, int16_t& r_d1, int16_t& r_d2, int16_t& r_d3, int16_t& r_d4);
extern Boolean MCU_stoi2x4(const MCString&, int2 &d1, int2 &d2, int2 &d3, int2 &d4);
extern bool MCU_stoi4x4(MCStringRef p_string, int32_t& r_d1, int32_t& r_d2, int32_t& r_d3, int32_t& r_d4);
extern Boolean MCU_stoi4x4(const MCString&, int32_t &d1, int32_t &d2, int32_t &d3, int32_t &d4);
extern Boolean MCU_stoi4x2(const MCString &s, int32_t &d1, int32_t &d2);
extern Boolean MCU_stobxb(const MCString& p_string, Boolean &r_left, Boolean& r_right);
extern bool MCU_stoi4(MCStringRef p_string, int4& r_d);
extern Boolean MCU_stoi4(const MCString&, int4& d);
extern bool MCU_stoui4(MCStringRef p_string, uint4 &r_d);
extern Boolean MCU_stoui4(const MCString&, uint4& d);
extern bool MCU_stoui4x2(MCStringRef p_string, uint4 &r_d1, uint4 &r_d2);
extern bool MCU_stob(MCStringRef p_string, bool& r_condition);
extern Boolean MCU_stob(const MCString&, Boolean& condition);
extern void MCU_lower(char *sptr, const MCString& s);
extern int4 MCU_strncasecmp(const char *one, const char *two, size_t n);
extern Boolean MCU_offset(const MCString &p, const MCString &w,
uint4 &offset, Boolean casesensitive = False);
extern void MCU_additem(char *&dptr, const char *sptr, Boolean first);
extern void MCU_addline(char *&dptr, const char *sptr, Boolean first);
extern void MCU_break_string(const MCString &s, MCString *&ptrs, uint2 &nptrs,
Boolean isunicode = False);
#ifndef _DEBUG_MEMORY
extern void MCU_realloc(char **data, uint4 osize, uint4 nsize, uint4 csize);
#endif
extern bool MCU_matchname(MCNameRef p_name, Chunk_term type, MCNameRef name);
extern void MCU_snap(int2 &p);
// MDW-2014-07-06: [[ oval_points ]]
extern bool MCU_roundrect(MCPoint *&r_points, uindex_t &r_point_count,
const MCRectangle &rect, uint2 radius, uint2 startAngle, uint2 arcAngle, uint2 flags);
extern Boolean MCU_parsepoints(MCPoint *&oldpoints, uindex_t &n, MCStringRef p_data);
extern Boolean MCU_parsepoint(MCPoint &r_point, MCStringRef);
extern void MCU_querymouse(int2 &x, int2 &y);
extern void MCU_resetcursors();
extern void MCU_set_rect(MCRectangle &rect, int2 x, int2 y, uint2 w, uint2 h);
extern void MCU_set_rect(MCRectangle32 &rect, int32_t x, int32_t y, int32_t w, int32_t h);
extern Boolean MCU_point_in_rect(const MCRectangle &srect, int2 x, int2 y);
extern Boolean MCU_rect_in_rect(const MCRectangle &p, const MCRectangle &w);
extern bool MCU_line_intersect_rect(const MCRectangle& srect, const MCRectangle& line);
extern Boolean MCU_point_on_line(MCPoint *points, uint2 npoints,
int2 x, int2 y, uint2 linesize);
extern Boolean MCU_point_in_polygon(MCPoint *points, uint2 npoints,
int2 x, int2 y);
extern void MCU_offset_points(MCPoint *points, uint2 npoints,
int2 xoff, int2 yoff);
extern MCRectangle MCU_compute_rect(int2 x1, int2 y1, int2 x2, int2 y2);
extern MCRectangle MCU_center_rect(const MCRectangle &, const MCRectangle &);
extern MCRectangle MCU_bound_rect(const MCRectangle &, int2, int2, uint2, uint2);
extern MCRectangle MCU_clip_rect(const MCRectangle &, int2, int2, uint2, uint2);
extern MCRectangle MCU_intersect_rect(const MCRectangle &one, const MCRectangle &two);
extern MCRectangle MCU_union_rect(const MCRectangle &one, const MCRectangle &two);
extern MCRectangle MCU_subtract_rect(const MCRectangle &one, const MCRectangle &two);
extern MCRectangle MCU_reduce_rect(const MCRectangle &rect, int2 amount);
extern MCRectangle MCU_scale_rect(const MCRectangle &rect, int2 factor);
extern MCRectangle MCU_offset_rect(const MCRectangle& r, int2 ox, int2 oy);
extern MCRectangle MCU_recttoroot(MCStack *sptr, const MCRectangle &o);
extern void MCU_getshift(uint4 mask, uint2 &shift, uint2 &outmask);
extern void MCU_choose_tool(MCExecContext& ctxt, MCStringRef p_string, Tool p_tool);
extern Exec_stat MCU_dofrontscripts(Handler_type htype, MCNameRef message, MCParameter *params);
//extern bool MCU_path2std(MCStringRef p_path, MCStringRef& r_std_path);
//extern void MCU_path2std(char *dptr);
//extern bool MCU_path2native(MCStringRef p_path, MCStringRef& r_native_path);
//extern void MCU_path2native(char *dptr);
extern void MCU_fix_path(MCStringRef in, MCStringRef& r_out);
extern void MCU_base64encode(MCDataRef in, MCStringRef &out);
extern void MCU_base64decode(MCStringRef in, MCDataRef &out);
extern void MCU_urldecode(MCStringRef p_source, bool p_use_utf8, MCStringRef& r_result);
extern bool MCU_urlencode(MCStringRef p_url, bool p_use_utf8, MCStringRef &r_encoded);
extern Boolean MCU_freeinserted(MCObjectList *&l);
extern void MCU_cleaninserted();
//extern void MCU_get_color(MCExecPoint &ep, const char *name, MCColor &c);
extern void MCU_geturl(MCExecContext& ctxt, MCStringRef p_target, MCValueRef &r_output);
// MW-2013-07-01: [[ Bug 10975 ]] This method returns true if the given string could be a url
// (as used by MCU_geturl, to determine whether to try and fetch via libUrl).
extern bool MCU_couldbeurl(MCStringRef potential_url);
extern void MCU_puturl(MCExecContext& ctxt, MCStringRef p_target, MCValueRef p_data);
extern uint1 MCU_unicodetocharset(uint2 uchar);
extern uint1 MCU_languagetocharset(MCNameRef langname);
extern MCNameRef MCU_charsettolanguage(uint1 charset);
/* LEGACY */ extern uint1 MCU_languagetocharset(MCStringRef langname);
extern uint1 MCU_wincharsettocharset(uint2 wincharset);
extern uint1 MCU_charsettowincharset(uint1 charset);
extern bool MCU_multibytetounicode(MCDataRef p_input, uinteger_t p_charset, MCDataRef &r_output);
extern bool MCU_unicodetomultibyte(MCDataRef p_input, uinteger_t p_charset, MCDataRef &r_output);
extern void MCU_multibytetounicode(const char *s, uint4 len, char *d,
uint4 destbufferlength, uint4 &destlen,
uint1 charset);
extern void MCU_unicodetomultibyte(const char *s, uint4 len, char *d,
uint4 destbufferlength, uint4 &destlen,
uint1 charset);
extern double MCU_squared_distance_from_line(int4 sx, int4 sy, int4 ex, int4 ey, int4 x, int4 y);
//
struct MCInterval
{
int from;
int to;
};
extern bool MCU_disjointrangeinclude(MCInterval*& p_ranges, int& p_count, int p_from, int p_to);
extern bool MCU_disjointrangecontains(MCInterval* p_ranges, int p_count, int p_element);
//
// MW-2013-05-02: [[ x64 ]] The 'x_length' parameter is always IO_header::len
// which is now size_t, so match it.
IO_stat MCU_dofakewrite(char*& x_buffer, size_t& x_length, const void *p_data, uint4 p_size, uint4 p_count);
//
inline bool MCU_empty_rect(const MCRectangle& a)
{
return a . width == 0 || a . height == 0;
}
inline bool MCU_equal_rect(const MCRectangle& a, const MCRectangle& b)
{
return a . x == b . x && a . y == b . y && a . width == b . width && a . height == b . height;
}
inline MCRectangle MCU_make_rect(int2 x, int2 y, uint2 w, uint2 h)
{
MCRectangle r;
r . x = x;
r . y = y;
r . width = w;
r . height = h;
return r;
}
// Test whether p_string is a valid LiveCode script token
extern bool MCU_is_token(MCStringRef p_string);
// Load a library. If loading succeeds, then a non-nullptr value is returned;
// otherwise nullptr is returned.
//
// If the library parameter does not have an extension, then:
// - mac/ios: tries framework, bundle or dylib
// - linux/android: uses so
// - windows: uses dll
//
// If the library parameter is absolute, then that exact location is used.
//
// If the library parameter has the prefix './', then the mapped location
// relative to the engine is used.
//
// Otherwise, the path is passed through to the system to use its search
// order.
//
MCSLibraryRef
MCU_library_load(MCStringRef p_library);
void
MCU_library_unload(MCSLibraryRef handle);
void*
MCU_library_lookup(MCSLibraryRef handle,
MCStringRef p_symbol);
extern "C" void *MCSupportLibraryLoad(const char *name);
extern "C" void MCSupportLibraryUnload(void *handle);
extern "C" char *MCSupportLibraryCopyNativePath(void *handle);
extern "C" void *MCSupportLibraryLookupSymbol(void *handle,
const char *symbol);
/* Split a LiveCode path into dirname and basename, using the current platform's
* rules. Any unnecessary trailing slashes will be trimmed from dir. */
bool
MCU_path_split(MCStringRef p_path,
MCStringRef* r_dir,
MCStringRef* r_base);
/* Split a LiveCode path into dirname and basename, using unix rules.
* In this case, the string is split at the last '/' into prefix and suffix.
* If the prefix is '/', then dir is '/' and base is the rest of the path;
* Otherwise, dir is prefix and base is suffix - in this case dir will not end
* with '/'. */
bool
MCU_path_split_unix(MCStringRef p_path,
MCStringRef* r_dir,
MCStringRef* r_base);
/* Split a LiveCode path into dirname and basename, using win32 rules.
* Win32 paths can have the following forms in addition to unix forms.
* //[Share]/[Folder][/Base]
* Drive:[Folder]/[Base]
* In the first case, dir is //Share/Folder and base is Base
* In the second case, if Folder is not present then
* dir is Drive:/
* base is Base
* If Folder is present then
* dir is Drive:Folder
* base is Base
* The addition of a trailing '/' in the case of Folder not being present is
* necessary to distinguish between drive relative and drive absolute paths.
*/
bool
MCU_path_split_win32(MCStringRef p_path,
MCStringRef* r_dir,
MCStringRef* r_base);
// Format color as string
extern bool MCU_format_color(const MCColor p_color, MCStringRef& r_string);
#endif
| 2024-07-03T01:26:29.851802 | https://example.com/article/7792 |
Q:
Elastic Search Immediately Dies on Mac
I downloaded elastic search today. When I try to run it, it is immediately killed with the following message:
Johnathans-MacBook-Pro:Downloads jward$ ./elasticsearch-7.6.1/bin/elasticsearch
./elasticsearch-7.6.1/bin/elasticsearch-env: line 71: 12909 Killed: 9
"$JAVA" -cp "$ES_CLASSPATH" org.elasticsearch.tools.java_version_checker.JavaVersionChecker
My java version is:
java version "11.0.6" 2020-01-14 LTS
Java(TM) SE Runtime Environment 18.9 (build 11.0.6+8-LTS)
Java HotSpot(TM) 64-Bit Server VM 18.9 (build 11.0.6+8-LTS, mixed mode)
Why won't the elastic search service start?
A:
Elasticsearch isn't able to recognize your Java version and that's the reason it is failing. Please see in your logs, the error is thrown from the below class and you can have a look at from below source code.
https://github.com/elastic/elasticsearch/blob/master/distribution/tools/java-version-checker/src/main/java/org/elasticsearch/tools/java_version_checker/JavaVersionChecker.java#L28 and you can have a look at this class, All it does is checks if the runtime Java version is at least 1.8..
In your case its java 11, so java version isn't a problem, the problem lies in Elasticsearch not recognizing that.
You need to set proper JAVA_HOME in your ~/.zshrc if using latest Mac OS Catalina, as they moved to ~/.zshrc and I see you just mention JAVA_HOME=$(/usr/libexec/java_home) but don't see EXPORT before this. So please add below line.
EXPORT JAVA_HOME=$(/usr/libexec/java_home)
After that source ~/.zshrc and then close the terminal and see the output of java -version , if it shows java 11 version then you are good to go and run the elasticsearch again.
Hope this helps and let me know if you have further questions.
| 2024-04-30T01:26:29.851802 | https://example.com/article/6444 |
Immediately after Arsenal’s 3-1 defeat to West Brom on Saturday, Arsene Wenger told reporters that he knew “what I will do with my future and you will know soon – very soon.” His answer was characteristically ambiguous but, over the last 48 hours, there appears to be a growing belief in north London that the Frenchman will stay for at least one more season.
If he does decide to stay, the 2017/18 season will be the most difficult of Wenger’s 21-year stay at the club. Their two star players – Alexis Sanchez and Mesut Özil – look likely to leave, while the futures of several other senior players are unresolved.
Recent reports suggest that Wenger will be given £100m to spend in the 2017 summer transfer window to overhaul his squad, as well any money raised from the potential sales of Sanchez and Özil.
13 players Arsene Wenger tried to sign for Arsenal Show all 13 1 /13 13 players Arsene Wenger tried to sign for Arsenal 13 players Arsene Wenger tried to sign for Arsenal Joe Hart Asked about the player when he was on loan at Birmingham City Getty 13 players Arsene Wenger tried to sign for Arsenal Vincent Kompany Held meetings with the defender's agent before he moved to Hamburg Getty 13 players Arsene Wenger tried to sign for Arsenal Gerard Pique Reportedly made approach before his move to Manchester United Getty 13 players Arsene Wenger tried to sign for Arsenal Roberto Carlos Spoke to the player's agent over transfer, according to reports Getty 13 players Arsene Wenger tried to sign for Arsenal N'Golo Kante Had scouted the midfielder before his move to Leicester Getty 13 players Arsene Wenger tried to sign for Arsenal Yaya Toure Had a trial with Arsenal in 2003 but went on to join Barcelona and later Manchester City. Getty 13 players Arsene Wenger tried to sign for Arsenal Cristiano Ronaldo Reportedly had a tour of Arsenal's training ground before he went to Manchester United Getty 13 players Arsene Wenger tried to sign for Arsenal Zlatan Ibrahimovic "Zlatan doesn't do trials," was the famous quote reported after Swedish striker refused trial match after agreeing move Getty 13 players Arsene Wenger tried to sign for Arsenal Lionel Messi Reports claimed he was offered an Arsenal contract aged 15. Didn't turn out too bad in the end, did he? Getty 13 players Arsene Wenger tried to sign for Arsenal Dimitri Payet Wenger said he had watched him 'many times' nine years ago Getty 13 players Arsene Wenger tried to sign for Arsenal Didier Drogba Wenger watched the player back when he played for Le Mans. Little did he know how much grief he would cause him with his astonishing record against the Gunners Getty 13 players Arsene Wenger tried to sign for Arsenal Luis Suarez Wenger activated Suarez's release clause at Liverpool with a controversial £40m plus £1 offer. Liverpool refused to let Suaurez leave, and he joined Barcelona a year later for £75m. Getty 13 players Arsene Wenger tried to sign for Arsenal Jamie Vardy Activated Vardy's £20m contract release clause, but after mulling over a move, Vardy elected to sign a four-year contract extension with Leicester. Getty
But which players might Wenger move for? And what areas of the squad require the most reinvestment?
Goalkeeper
Joe Hart is a potential replacement for Ospina (Getty)
David Ospina was ruthlessly targeted by West Brom after replacing an injured Petr Cech and looks to have little future at the club. Wenger has repeatedly described his former number one as world-class, but Ospina is thought to be ‘disenchanted’ with his bit-part role and Arsenal are unlikely to stand in the 28-year-old’s way should he agitate for a move away from the club.
Joe Hart, who will certainly make a permanent move away from Manchester City in the summer, is a potential replacement although would likely favour joining a club where he is guaranteed a spot in the first-team every week.
Stoke’s Jack Butland is another target, with speculation intensifying in recent days that Wenger sees the 24-year-old as the long-term successor to Cech. But Stoke won’t let Butland leave on the cheap and will demand a significant fee given the player’s home-grown status, as well as how poorly Lee Grant, their number two, has performed in recent weeks.
At least Cech’s future is assured. “Petr’s position at the club is very secure and a summer transfer can be ruled out,” his agent Viktor Kolar said last month in a statement.
Defence
Gaya is a target for clubs across Europe (Getty ) (Getty)
Hector Bellerin’s recent comments in the Spanish press will come as a grave concern to the Arsenal hierarchy. "It's nice there are a lot of big clubs that are interested in me, but if one of those is Barcelona that's special,” the full-back told SPORT.
The player only signed a new six-year deal in November but there is an awareness at the club that – should Barcelona make an official approach – it will be difficult to keep hold of the 22-year-old.
On the left, Kieran Gibbs only has one-year left on his contract and has been linked with a move to West Ham. Nacho Monreal is unlikely to leave in the summer, but has been poor this season and will turn 32 next season, which means the club are likely to attempt to recruit a new left-back when the transfer window re-opens.
There has been a lot of excitement over Celtic defender Kieran Tierney, with Arsenal scouts spotted at Celtic Park a number of times this season to watch the 19-year-old in action. But Valencia’s Jose Gaya is a more likely prospect due to his greater experience in a more competitive league.
The 21-year-old has a £45m release clause in his contract, although Arsenal will be hopeful of signing him for considerably less. Expect the Arsenal hierarchy to be keeping a close eye on the La Liga run-in: in the unlikely event of Valencia going down, there will be a long queue of clubs hopeful of tempting Gaya away on the cheap.
Midfield
Dortmund would not let Reus go on the cheap (Bongarts/Getty)
Mesut Özil has been offered a record-breaking new contract at Arsenal, which he is still yet to sign. Although the German international isn’t as certain to leave the Emirates this summer as Alexis Sanchez, Arsenal are unlikely to allow Özil to enter the final year of his contract and risk losing him on a free. If he doesn’t sign, he’ll be sold, with Bayern Munich and Borussia Dortmund both interested.
Marco Reus would be a ready-made replacement, although Dortmund would demand a huge fee for the player, who will be 28 at the start of the new season. As long-term solutions go, his signature makes little sense. Real Madrid's James Rodriguez is another player whose names has been bandied around by fans, but his wage demands are significantly more than Arsenal would be willing to pay.
Jack Wilshere and Alex Oxlade-Chamberlain may both hand in transfer requests this summer, with the latter growing particularly frustrated this season. Oxlade-Chamberlain’s unhappiness stems from a lack of playing time as well the utility-man role Wenger has handed him; should the Frenchman remain at the club he will likely be one of the first to leave.
Wilshere’s future is less certain. The 25-year-old is desperate to succeed at The Emirates but the same doubts remain at the club surrounding his form and fitness. Ross Barkley is a target, but Arsenal would largely face a bidding war for the player with north London rivals Tottenham.
Forwards
Arsenal may make another attempt to sign Lacazette (AFP/Getty)
Arsenal are resigned to losing their star player, Alexis Sanchez. He has been offered a potential club-record contract but has shown little inclination of signing on the dotted line and has made headlines in recent weeks with his stroppy demeanour and dark rumours of a training-ground bust-up.
Sanchez has no shortage of suitors and would command a hefty transfer fee: Paris Saint-Germain and Juventus head up the queue. With Olivier Giroud underwhelming in recent weeks, any money made from Sanchez’s sale would be immediately reinvested in another forward, although high-quality European strikers are at something of a premium.
Alexandre Lacazette, repeatedly linked with the club last summer, would be a realistic target. The club previously had a £40m bid rejected by Lyon, although the Ligue 1 side would find any offers exceeding £50m difficult to turn down. Athletic Bilbao’s Inaki Williams is another, cheaper option: the 22-year-old has a £42m release clause in his contract. | 2023-10-30T01:26:29.851802 | https://example.com/article/5090 |
The origin of the follicular capillaries in the human spleen.
The major arteries which supply the follicular capillaries in the human spleen do not arise as they do in most mammals as lateral or radial branches from the central artery but come from penicillar arteries which penetrate the marginal zone and enter the follicle at various points around its circumference. Such arteries may have a very short course through the red pulp or they may pursue very long courses. Upon entering the follicle, these arteries branch a number of times, the branches remaining together in a tight array of parallel arterioles along with capillaries formed from them, the whole bundle being enveloped by a reticular fiber sheath. There is thus formed an arteriolar-capillary bundle. The whole bundle may branch. From the sides, especially from its central end, arterioles and capillaries radiate out to all parts of the follicle to terminate in the marginal zone or in the follicle itself. | 2024-02-13T01:26:29.851802 | https://example.com/article/4334 |
Community Use of Schools
Community use of schools is an initiative that supports access to school space outside of school hours for community groups. While the major responsibility of the board is to provide a good educational program for children and youth, it is also important to be responsive to the needs and interest of all citizens. | 2024-06-02T01:26:29.851802 | https://example.com/article/4195 |
Introduction {#Sec1}
============
Quantum mechanics forces us to question the view that physical quantities (such as spin, positions or energy) have predefined values: Bell's theorem shows that if observable quantities were determined by some locally defined classical variables, it would be impossible to accomplish certain tasks---such as the violation of Bell's inequalities---whereas such tasks are possible according to quantum mechanics^[@CR1],[@CR2]^ and have been realised in experiments^[@CR3]--[@CR6]^. However, the causal relations between events remain fixed in quantum theory: whether an event A is in the past, in the future, or space-like separated from another event B is predefined by the location of such events in space-time^[@CR7],[@CR8]^. In contrast, in general relativity, space-time itself is dynamical: the presence of massive objects affects local clocks and thus causal relations between events defined with respect to them. Nonetheless, the dynamical causal structure of general relativity is still classically predefined: the causal relation between any pair of events is uniquely determined by the distribution of matter-energy degrees of freedom (DOFs) in their past light cone. In other words, causal relations are always determined by local classical variables. This picture is expected to change if we consider quantum states of gravitating DOFs: if a massive system is prepared in a superposition of two distinct states, each yielding an observably different causal structure for future events, would it be possible to observe causal relations that display genuine quantum features?
A main obstacle in the analysis of macroscopic superpositions of gravitating bodies is that, in the absence of a classical space-time manifold, it becomes unclear how to identify space-like surfaces on which quantum states are defined, or global fields of time-like vectors to define time evolution. Indeed, some models even postulate that such superpositions are simply not valid physical states and must decohere (or collapse) fast enough to preserve a classical description of space-time and dynamical laws^[@CR9]--[@CR13]^. A very different mindset underlies various quantum gravity frameworks^[@CR14]^---where quantum features of the metric and therefore of the causal relations are indeed expected. However, to date, none of the quantum gravity frameworks has been applied to analyse such an epitomic example as superpositions of space-times with macroscopically distinct causal structures. Therefore, it is unclear whether there exists any phenomenology unequivocally associated with quantum causal structures, nor whether quantum gravity frameworks can circumvent or directly address the objections against superpositions of manifolds. Independently, quantum formalisms have been recently developed to study quantum causal structures at an abstract level in the context of quantum-information processing^[@CR8],[@CR15],[@CR16]^. However, although quantum features of space-time are among the motivations for these studies, no direct link with quantum gravity has yet been established.
This work provides the first direct analysis of quantum causal relations arising from a spatial superposition of a massive object. We show how the temporal order between time-like events can become superposed or even entangled. We further discuss a thought experiment, an admissible albeit remote physical scenario, where these non-classical causal relations arise among physical events. In order to prove their non-classicality, we formulate a Bell-type theorem for temporal order: We define a task that cannot be accomplished if the time order between the events was predetermined by local variables, while the task becomes possible if the events are in a space-time region affected by the gravitational field of a massive object in an appropriate quantum state. Our approach provides a method to directly describe scenarios so far considered to be out of reach for standard theoretical physics. We show explicitly how to overcome the difficulties with describing superpositions of metrics that motivated collapse models. On the other hand, our result is independent of the high-energy completion of any specific quantum gravity framework---we do not assume any new physics, the results are based entirely on well-established, low-energy general relativity and on quantum mechanics. Our results are therefore robust against particular mathematical approaches to quantising gravity, thus providing a benchmark for specific frameworks. Furthermore, the time and energy scale at which entangled temporal order arises is closer than the Planck scale, typically invoked in this context, and is also far remote from the scale given by the decoherence models---which therefore do not preclude quantum features of space-time to arise. Our results thus reveal that both the above approaches are missing crucial intuition and correct physical understanding of the phenomena associated with causal structures at the interface of quantum and gravitational physics. In turn, our work provides a robust method to quantitatively assess these phenomena, helping to build correct physical intuition for quantum causal structures.
Results {#Sec2}
=======
Dynamical causal structure in general relativity {#Sec3}
------------------------------------------------
In classical general relativity, the causal structure is the structure of light cones of the space-time metric^[@CR17],[@CR18]^. As the matter-energy DOFs determine the metric through Einstein's equations, the causal structure of a region of space-time is dynamical: it depends on the state of the matter energy in its past light cone. A major obstacle towards a quantum theory of gravity is that it is not clear how to transpose the mathematical notion of causal relations to scenarios where matter DOFs can be in general quantum states, as such scenarios seem to preclude the use of any underlying space-time manifold with respect to which events, light cones and causal relations could be defined. To overcome this obstacle, our approach is to start from a physical understanding of events and their causal relations. Even in classical general relativity a physical event cannot be directly identified with a point on a space-time manifold, a fundamental aspect of the theory captured mathematically by diffeomorphism invariance^[@CR19]^. Although it can be debated whether or not space-time points have an intrinsic physical meaning, a natural way to define diffeomorphism-invariant events is to specify them operationally, relative to physical systems; for example, positions and proper times of physical systems used as clocks^[@CR20]^. We adopt this notion of events throughout the work. Causal relations are then understood as the possibility to exchange non-faster-than-light signals---or more generally, physical systems---between operationally defined events.
The presence of massive bodies generally alters the relative rates at which clocks tick. For example, in a weak field limit, a clock in a gravitational potential Φ exchanging signals with an identical clock far away from the source of Φ, where the potential effectively vanishes, will appear to tick slower by a factor $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\sqrt {1 + 2\frac{{\mathrm{\Phi }}}{{c^2}}}$$\end{document}$. In classical physics, this leads to the well-tested time-dilation^[@CR21],[@CR22]^ and redshift effects^[@CR23]^. When the clocks are described as quantum systems, new effects arise from the combination of quantum and general relativistic theories. For a clock in superposition of different distances to the mass, its time-keeping DOFs become entangled to the clock's position^[@CR24]--[@CR26]^. This entanglement implies a universal decoherence mechanism for generic macroscopic systems under time dilation^[@CR27],[@CR28]^. The regime of low-energy quantum systems in curved space-time can be described within a framework of general relativistic composite quantum particles^[@CR29]^. Here we additionally exploit the fact that only the distance between a clock and a mass has physical significance and due to linearity of quantum theory this must hold also for a superposition of different distances. (There is no difference in the relative ticking rates of two clocks whether we think that the clocks are being positioned at different distances---possibly in a superposition---from the mass, or that the mass is positioned at different distances from the clocks^[@CR30]^.)
Consider two agents, a and b, with two initially synchronised clocks, each following a fixed world line. A third agent prepares one of two mass configurations, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ or $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$, so as to induce time dilation between the clocks of a and b. If configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ is prepared, event A---defined by the clock of agent a showing proper time *t*~a~ = *τ*^\*^---will be in the past light cone of the event B, which is defined in an analogous way: by the clock of agent b showing proper time *t*~b~ = *τ*^\*^. If configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ is prepared, event B will be in the past light cone of event A. To keep the world lines of the agents independent of the mass configuration, their laboratories can be embedded in tight enough trapping potentials, that is, much stronger than the gravitational field (which is feasible since our protocol does not require macroscopic source masses, see Methods). In Supplementary Note [4](#MOESM2){ref-type="media"} we discuss other mass configurations, which have the desired effect on temporal order, but for which the agents a, b can remain inertial.
A possible way to realise configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ is to place an approximately point-like body of mass *M* closer to b than to a, see Fig. [1](#Fig1){ref-type="fig"}. The light-cone structure of the resulting space-time is fully determined by the metric tensor *g*~*μν*~, for which we adopt the sign convention (−, +, +, +). In isotropic coordinates in the first-order post-Newtonian expansion the metric components are^[@CR31]^ $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$g_{{\mathrm{00}}}(r) = - ( {1 + 2\frac{{{\mathrm{\Phi }}(r)}}{{c^2}}} )$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$g_{ij}(r) = \delta _{ij}( {1 + 2\frac{{{\mathrm{\Phi }}(r)}}{{c^2}}} )^{ - 1}$$\end{document}$, *i*, *j* = 1, 2, 3, where $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{\Phi }}(r) = - \frac{{GM}}{r}$$\end{document}$ is the gravitational potential and *r* is the spatial distance between the mass and the event where the metric is evaluated. For an event with a spatial coordinate **R**~a~ and the mass at a spatial coordinate **r**~*M*~ (where the spatial coordinates are defined, for example, by a far-away agent as in Fig. [1](#Fig1){ref-type="fig"}), we have *r* ≡ \|**R**~a~ − **r**~*M*~\|. Note that we use a common coordinate system to describe the different mass configurations and the associated space-time metrics. Operationally, we can associate such coordinates with the far-away agent, whose local clocks are not affected by the change in the matter distribution. However, this is only a convenient interpretation, we can always think of the coordinates in analogy to gauge fixing---any physical prediction regarding proper times of the clocks and exchange of the signals will not depend on the choice of coordinates.Fig. 1General relativistic engineering of causal relations between space-time events using a massive body. Initially synchronised clocks a and b are positioned at fixed distances from a far-away agent whose time coordinate is *t*. Event A (B) is defined by the clock of a (b) showing proper time *τ*^\*^. In configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ (left) a mass is placed closer to b than to a. Due to gravitational time dilation, event A can end up in the causal past of event B: for a sufficiently large *τ*^\*^ the time difference between the clocks becomes greater than it takes light to travel between them. Light emitted at event A reaches clock b before the event B occurs. Configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ (right) is fully analogous to $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$: the mass is placed closer to clock a and the event B can end up in the causal past of the event A
We consider that a and b remain at fixed coordinate distances from the mass, *r*~a~ and *r*~b~ = *r*~a~ − *h*, respectively, and find the parameters for which event A ends up in the past light cone of B for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ (and vice versa for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$). An infinitesimal proper time element along a world line at a distance *r* from the mass is given by $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{d}}\tau (r) = \sqrt { - g_{{\mathrm{00}}}(r)} {\mathrm{d}}t,$$\end{document}$ where *t* is the coordinate time, and a photon travelling in the radial direction from *r*~a~ reaches *r*~b~ after a coordinate time $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{c} = \frac{1}{c}{\int}_{r_{\mathrm{b}}}^{r_{\mathrm{a}}} {\mathrm{d}} r{\prime}\sqrt { - \frac{{g_{rr}(r{\prime})}}{{g_{{\mathrm{00}}}(r{\prime})}}}$$\end{document}$. Therefore, if the photon is emitted at the local time *t*~a~ = *τ*^\*^, it reaches *r*~b~ when b's local time is $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\bar t_{\mathrm{b}} = \sqrt { - g_{{\mathrm{00}}}(r_{\mathrm{b}})} \left( {\frac{{\tau ^ \ast }}{{\sqrt { - g_{{\mathrm{00}}}(r_{\mathrm{a}})} }} + T_{c}} \right)$$\end{document}$, assuming that the local clocks are synchronised so that *t*~a~ = 0 and *t*~b~ = 0 coincide with the coordinate time *t* = 0. For$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau ^ \ast > T_{c}\frac{{\sqrt { - g_{{\mathrm{00}}}(r_{\mathrm{b}})} }}{{1 - \sqrt {\frac{{g_{{\mathrm{00}}}(r_{\mathrm{b}})}}{{g_{{\mathrm{00}}}(r_{\mathrm{a}})}}} }},$$\end{document}$$we have $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\bar t_{\mathrm{b}} \le \tau ^ \ast$$\end{document}$, which means that there is enough time for a not-faster-than-light signal emitted at event A (defined by *t*~a~ = *τ*^\*^) to travel the distance *h* and reach agent b at event B (defined by *t*~b~ = *τ*^\*^). This means that event A is in the causal past of event B as required. For example, for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$h \ll r_{\mathrm{a}}$$\end{document}$ condition (1) is satisfied for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau ^ \ast > \frac{{2r_{\mathrm{a}}^2c}}{{GM}}$$\end{document}$. Configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ can be arranged analogously, by placing the mass closer to a than to b. Then, the condition $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau ^ \ast > \frac{{2r_{\mathrm{b}}^2c}}{{GM}}$$\end{document}$, for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$h \ll r_{\mathrm{b}}$$\end{document}$, ensures that B is in the causal past of A. Note that with the above conditions on *τ*^\*^ the events A and B are always time-like separated, but have different time orders for the two mass configurations---these conditions guarantee that the time order between A and B is swapped in all reference frames.
The example above simply illustrates that in general relativity causal structure is dynamical and depends on the stress-energy tensor of the matter DOFs: preparing different matter distributions on a space-like hypersurface can result in different causal relations between events in its causal future.
Quantum control of temporal order {#Sec4}
---------------------------------
When A is in the past light cone of B, a physical system can in principle be transferred from A to B. Consider a quantum system S initially prepared in state \|*ψ*〉^S^, which undergoes a unitary *U*~A~ at event A (at the space-time location where the clock of agent a marks proper time *τ*^\*^) and a unitary *U*~B~ at event B. Such ordered events can therefore result in the following state of S:$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\tilde \psi _1} \right\rangle ^{\mathrm{S}} = U_{\mathrm{B}}U_{\mathrm{A}}\left| \psi \right\rangle ^{\mathrm{S}}.$$\end{document}$$
If B is before A, and S is prepared in the same initial state, the final state of S is$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\tilde \psi _2} \right\rangle ^{\mathrm{S}} = U_{\mathrm{A}}U_{\mathrm{B}}\left| \psi \right\rangle ^{\mathrm{S}}.$$\end{document}$$
A situation can therefore be arranged such that state ([2](#Equ2){ref-type=""}) is produced for configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ and ([3](#Equ3){ref-type=""}) is produced for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$. (We ignore a possible additional time evolution between the two events for simplicity.) Different mass configurations can result in different temporal orders of local operations, which holds in quantum as well as in classical theory. Let us make the following assumptions:Macroscopically distinguishable states of physical systems can be assigned orthogonal quantum states.Gravitational time dilation in a classical limit reduces to that predicted by general relativity.The quantum superposition principle holds (regardless of the mass or nature of the involved system).
Even though the above assumptions hold in the standard quantum and general relativistic frameworks, it is not known if a fundamental theory of quantum gravity satisfies them. Our aim is to investigate their consequences for the notion of temporal order.
The coordinates introduced in the previous section define a foliation of space-time into equal-time slices. As long as no horizons are present in any of the considered configurations, such slices define space-like hypersurfaces. With each hypersurface one can associate a Hilbert space, containing the quantum states of interest at the given time. The time coordinate corresponds to the time *t* in Fig. [1](#Fig1){ref-type="fig"} and is operationally defined as the time measured by the local clock of the far-away agent (not affected by the mass configurations). These quantum states can be understood operationally as states assigned by the far-away agent. However, as discussed in the previous section, such an interpretation is not strictly necessary but is merely a convenient way to define the relevant mathematical objects and to carry out the calculations.
The two mass configurations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}},{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ can thus be assigned quantum states $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{\mathrm{M}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{\mathrm{M}}$$\end{document}$. By assumption (a) these states are orthogonal. Since each state individually satisfies the classical limit (mass is sufficiently localised around a single world line), following assumption (b), the system S will evolve as in Eqs. ([2](#Equ2){ref-type=""}) or ([3](#Equ3){ref-type=""}) depending whether the mass is in state $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{M}$$\end{document}$ or $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{M}$$\end{document}$, respectively. Finally, by assumption (c), a superposition $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {{\mathrm{K}}_ + } \right\rangle ^{\mathrm{M}}: = \frac{1}{{\sqrt 2 }}\left( {\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{\mathrm{M}} + \left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{\mathrm{M}}} \right)$$\end{document}$ is a physically allowed mass configuration, and will yield the following final state of the joint system:$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\psi _{{\mathrm{sup}}}} \right\rangle ^{{\mathrm{MS}}} = \frac{1}{{\sqrt 2 }}\left( {\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{\mathrm{M}}U_{\mathrm{B}}U_{\mathrm{A}}\left| \psi \right\rangle ^{\mathrm{S}} + \left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{\mathrm{M}}U_{\mathrm{A}}U_{\mathrm{B}}\left| \psi \right\rangle ^{\mathrm{S}}} \right).$$\end{document}$$
An explicit calculation showing how this state arises is presented in Methods. We note that not only classical gravity but also semi-classical^[@CR14]^ and stochastic gravity^[@CR32]^ theories would not yield Eq. ([4](#Equ4){ref-type=""}) since these frameworks describe gravitational interactions in terms of classical, possibly stochastic, variables, thus violating assumption (c).
Note that, given a specific physical system used as a clock, it is possible to simulate its time dilation using non-gravitational interactions. For example, an electric field can shift atomic energy levels and thus "time dilate" a clock based on atomic transitions. Therefore, one can produce a state analogous to ([4](#Equ4){ref-type=""}) without using gravity. However, only gravity can alter the relative ordering of events independently of the nature of the systems and interactions used as clocks, due to the universality of time dilation: the preparation and manipulation of the massive object can be carried out without any knowledge of other aspects of the protocol. Such a universality underpins a fundamental distinction between our gravitational protocol and other, non-gravitational, methods to control causal relations between operationally defined events^[@CR33]--[@CR39]^. (See also Supplementary Note [4](#MOESM2){ref-type="media"} for further discussion.)
Finally, the state ([4](#Equ4){ref-type=""}) is the result of a process wherein the order of operations on a target system (S) is determined by the quantum state of a control system (position of the massive body). Such a process is known as a quantum switch^[@CR15]^ and has been studied as a possible quantum-information resource^[@CR40]--[@CR44]^. The state \|*ψ*~sup~〉^MS^ is a superposition of two amplitudes corresponding to different predefined, classical orders between events A and B. Note that, if the control system is discarded, the reduced state of S is$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\frac{1}{2}\left( {|\tilde \psi _1\rangle \langle \tilde \psi _1|^{\mathrm{S}} + |\tilde \psi _2\rangle \langle \tilde \psi _2|^{\mathrm{S}}} \right),$$\end{document}$$which is indistinguishable from a probabilistic mixture of $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|\tilde \psi _1\rangle$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|\tilde \psi _2\rangle$$\end{document}$. The state in Eq. ([5](#Equ5){ref-type=""}) can be interpreted as arising from events A and B with a classical, albeit unknown, temporal order. Therefore, any protocol aimed at testing operationally quantum features of temporal order necessarily requires a measurement of the control system.
Bell's theorem for temporal order {#Sec5}
---------------------------------
The above argument shows that superpositions of massive objects can in principle result in a coherent quantum control of temporal order between events. However, one might question whether such a conclusion has a direct physical meaning or whether it relies on a particular interpretation of state ([4](#Equ4){ref-type=""}). Furthermore, the state assignment is defined in terms of a given coordinate system, while we would like to base our conclusions on coordinate-independent physical events. Since the very meaning of quantum states and measurements might be put into question in the absence of a classical space-time, a proof of non-classical causal relations should not rely on the validity of the quantum formalism. In the following we show that it is possible to probe the nature of temporal order irrespective of the validity of quantum theory. We formulate a theory-independent argument---which does not rely on the quantum framework and provides means to exclude the very possibility of explaining data from a hypothetical experiment in terms of a classical temporal order (which can be stochastic and dynamical) within a broad class of probabilistic theories, not limited to quantum mechanics. Our formulation is analogous to Bell's theorem for local hidden variables^[@CR1],[@CR2]^ (see Methods) and we thus refer to the theorem below as Bell's theorem for temporal order of events. The core of the argument is simple: given a bipartite system prepared in a separable state, it is not possible to violate any bipartite Bell inequality by performing local operations (transformations and measurements) on the two parts, as long as the local operations are applied in a definite order.
The scenario involves a bipartite system with subsystems S~1~ and S~2~ and a system M that can influence the temporal order of events. For *j* = 1, 2, each system S~*j*~ undergoes two transformations, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{{\mathrm{A}}_j}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{{\mathrm{B}}_j}$$\end{document}$, at space-time events A~*j*~, B~*j*~, respectively. Each system is then measured at an event C~*j*~ according to some measurement setting *i*~*j*~, producing a measurement outcome *o*~*j*~. Additionally, M is measured at an event D, space-like separated from both C~1~ and C~2~, producing an outcome *z*, see Fig. [2](#Fig2){ref-type="fig"}. We now define the notion of classical order between events:Fig. 2Bell's theorem for temporal order. A bipartite system, made of subsystems S~1~ and S~2~, is sent to two groups of agents. Operations on S~1~ (S~2~) are performed at events A~1~, B~1~ (A~2~, B~2~). At event C~1~ (C~2~), a measurement with setting *i*~1~ (*i*~2~) and outcome *o*~1~ (*o*~2~) is performed. Events A~1~, B~1~ are space-like separated from A~2~, B~2~ and C~1~ is space-like to C~2~; light cones are marked by dashed yellow lines. The order of events A~*j*~, B~*j*~, *j* = 1, 2, is described by a variable *λ* defined by a system M. The system M is measured at event D, producing an output bit *z*. If the initial state of the systems S~1~, S~2~, M is separable, and *λ* is a classical variable (possibly dynamical and probabilistic), the resulting bipartite statistics of the outcomes *o*~1~, *o*~2~ cannot violate any Bell inequality, even if conditioned on *z*
**Definition 1**: A set of events is classically ordered if, for each pair of events A and B, there exists a space-like surface and a classical variable *λ* defined on it that determines the causal relation between A and B: for each given *λ*, either $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}\preccurlyeq {\mathrm{B}}$$\end{document}$ (A in the past causal cone of B), $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{B}}\preccurlyeq {\mathrm{A}}$$\end{document}$ (A in the past causal cone of B) or A\|\|B (A and B space-like separated).
Classically ordered events do not necessarily form a partially ordered set: classical order can be dynamical (the order between two events can depend on some operation performed in the past, i.e. some agent can prepare *λ*) and stochastic (*λ* might be distributed according to some probability, and not specified deterministically)^[@CR45],[@CR46]^.
*Bell's theorem for temporal order*. No states, set of transformations and measurements which obey assumptions 1--5 below can result in a violation of the Bell inequalities:Local state: The initial state *ω* of S~1~, S~2~ and M is separable (as defined in Methods).Local operations: All transformations performed on the systems are local (as defined in Methods).Classical order: The events at which operations (transformations and measurements) are performed are classically ordered.Space-like separation: Events (A~1~, B~1~) are space-like separated from events (A~2~, B~2~); C~1~, C~2~, and D are pair-wise space-like separated.Free-choice: The measurement choices in the Bell measurement are independent of the rest of the experiment. (This is a standard assumption necessary in Bell-like theorems.)
More formally, let us denote by $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\Bbb T} = (T_{{\mathrm{A}}_{\mathrm{1}}},T_{{\mathrm{B}}_{\mathrm{1}}},T_{{\mathrm{A}}_{\mathrm{2}}},T_{{\mathrm{B}}_{\mathrm{2}}})$$\end{document}$ the set of all local transformations irrespective of their order. The thesis of the theorem can be rephrased as: the conditional probability$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$P\left( {o_1,o_2|i_1,i_2,z,{\Bbb T},\omega } \right)$$\end{document}$$produced under assumptions 1--5 does not violate Bell's inequalities for any value of *z*. The proof of the theorem is presented in Methods.
Violation of Bell inequalities for temporal order {#Sec6}
-------------------------------------------------
Here we show how the gravitational quantum control of temporal order from the first section can result in events whose temporal order is entangled: a bipartite quantum system, initially in a product state $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}$$\end{document}$, is sent to two different regions of space such that a~1~, b~1~ and c~1~ only interact with S~1~, while a~2~, b~2~ and c~2~ only interact with S~2~. Agents a~1~, a~2~ perform, respectively, the unitaries $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{1}}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{2}}}$$\end{document}$ at the events A~1~, A~2~, while agents b~1~, b~2~, perform the unitaries $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{1}}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{2}}}$$\end{document}$ at the events B~1~, B~2~. Finally, c~1~ and c~2~ measure S~1~ and S~2~ at events C~1~ and C~2~, respectively, see Fig. [3](#Fig3){ref-type="fig"}. Assume that a massive system can be prepared in two configurations, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$, such that $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}_{\mathrm{1}} \prec {\mathrm{B}}_{\mathrm{1}} \prec {\mathrm{C}}_{\mathrm{1}}$$\end{document}$ (A~1~ in the past light cone of B~1~, etc.) and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}_{\mathrm{2}} \prec {\mathrm{B}}_{\mathrm{2}} \prec {\mathrm{C}}_{\mathrm{2}}$$\end{document}$ for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$, while $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{B}}_{\mathrm{1}} \prec {\mathrm{A}}_{\mathrm{1}} \prec {\mathrm{C}}_{\mathrm{1}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{B}}_{\mathrm{2}} \prec {\mathrm{A}}_{\mathrm{2}} \prec {\mathrm{C}}_{\mathrm{2}}$$\end{document}$ for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$, and such that the events are space-like separated as per assumption 4, which can always be achieved by having the groups sufficiently separated. If the mass is prepared in superposition $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\frac{1}{{\sqrt 2 }}\left( {\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{\mathrm{M}} + \left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{\mathrm{M}}} \right)$$\end{document}$, the joint state of the mass and the systems after the application of the unitaries is$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\frac{1}{{\sqrt 2 }}\left( {\left| {{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}} \right\rangle ^{\mathrm{M}}U_{{\mathrm{B}}_{\mathrm{1}}}U_{{\mathrm{A}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}U_{{\mathrm{B}}_{\mathrm{2}}}U_{{\mathrm{A}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}} + \left| {{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}} \right\rangle ^{\mathrm{M}}U_{{\mathrm{A}}_{\mathrm{1}}}U_{{\mathrm{B}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}U_{{\mathrm{A}}_{\mathrm{2}}}U_{{\mathrm{B}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}} \right)}.$$\end{document}$$Fig. 3Schematics of a protocol for a violation of Bell's inequalities for temporal order. Systems S~1~, S~2~ are prepared in a product state $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}$$\end{document}$ and sent to space-like separated regions. One pair of agents performs unitary operations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{1}}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{1}}}$$\end{document}$ on S~1~ at the correspondingly marked space-time events; another pair acts on S~2~ with unitary operations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{2}}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{2}}}$$\end{document}$. Each operation is applied only once, at an event defined by the specific proper time of the local clock of the agent. A massive body is prepared in a superposition of two configurations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}\rangle$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|K_{B \prec A}\rangle$$\end{document}$, which define different causal structures for future events. For the amplitude $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}\rangle$$\end{document}$, the operations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_i}$$\end{document}$ *i* = 1, 2 applied on S~*i*~ are in the causal past of the operations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_i}$$\end{document}$ (orange dots); and vice versa for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}\rangle$$\end{document}$ (blue dots). The operations can be chosen such that $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_i}U_{{\mathrm{B}}_i}\left| {\psi _i} \right\rangle ^{{\mathrm{S}}_i}$$\end{document}$ is orthogonal to $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_i}U_{{\mathrm{A}}_i}\left| {\psi _i} \right\rangle ^{{\mathrm{S}}_i}$$\end{document}$ (for both *i* = 1 and *i* = 2), resulting in a maximally entangled final state. Bell measurements are performed at events C~1~ and C~2~ on S~1~ and S~2~, respectively. At event D the mass is measured in a superposition basis. Conditioned on the outcome of this measurement, the results of the measurements at C~1~, C~2~ can maximally violate Bell's inequalities, which would not be possible if the order of events was classical (even if probabilistic)
Agent d at the event D measures the mass in the superposition basis $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$| \pm \rangle = \frac{1}{{\sqrt 2 }}\left( {|{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}\rangle \pm |{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}\rangle } \right)$$\end{document}$. Conditioned on the outcome, the joint state of S~1~ and S~2~ reads$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\frac{1}{{\sqrt 2 }}\left( {U_{{\mathrm{B}}_{\mathrm{1}}}U_{{\mathrm{A}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}U_{{\mathrm{B}}_{\mathrm{2}}}U_{{\mathrm{A}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}} \pm U_{{\mathrm{A}}_{\mathrm{1}}}U_{{\mathrm{B}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}U_{{\mathrm{A}}_{\mathrm{2}}}U_{{\mathrm{B}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}} \right).$$\end{document}$$
If the states $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{1}}}U_{{\mathrm{A}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{2}}}U_{{\mathrm{A}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}$$\end{document}$ are orthogonal to $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{1}}}U_{{\mathrm{B}}_{\mathrm{1}}}\left| {\psi _1} \right\rangle ^{{\mathrm{S}}_{\mathrm{1}}}$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{2}}}U_{{\mathrm{B}}_{\mathrm{2}}}\left| {\psi _2} \right\rangle ^{{\mathrm{S}}_{\mathrm{2}}}$$\end{document}$, respectively, then the state ([8](#Equ8){ref-type=""}) is maximally entangled. Local measurements can thus be performed on subsystems S~1~, S~2~ whose outcomes will violate Bell inequalities, conditioned on the measurement outcome at D (see Supplementary Note [2](#MOESM2){ref-type="media"} for an example).
The above thought experiment can in principle be realised in a scenario where it is meaningful to argue that assumptions 1, 2 and 4, 5 are satisfied. Violation of the Bell's inequality would then imply that assumption 3 does not hold, proving non-classicality of temporal order. In order to maximally violate the inequality, the time-dilated clocks of the agents need to decorrelate from the systems S~*i*~. In the Methods section we present a particular scenario using photons that satisfies also this requirement. In Supplementary Note [3](#MOESM2){ref-type="media"} we present two concrete examples of our thougth experiment, using as the systems S~*i*~ polarisation states of photons, depicted in Supplementary Fig. [1](#MOESM2){ref-type="media"}, or spatial modes of a quantum field, depicted in Supplementary Fig. [2](#MOESM2){ref-type="media"}.
Discussion {#Sec7}
==========
The non-classical causal structures discussed in this work arise in a semi-classical, albeit non-perturbative, regime where no explicit quantisation of the gravitational field is needed (which is complementary to the regime of most quantum gravity frameworks^[@CR14]^). Our approach shows that general relativity and standard quantum mechanics are sufficient to analyse scenarios involving superpositions of macroscopically different classical backgrounds. Not only is there no tension between the two frameworks, but there is also no ambiguity in the prediction of physical effects that arise: for each probability amplitude, the time-dilation effects introduced by the mass can be treated classically. The considered processes involve a simple superposition of such amplitudes and the final probability amplitude is given by the usual Feynman sum. Note that, even though no explicit quantisation of the metric is used, the amplitudes in the Feynman sum do correspond to macroscopically distinct space-time metrics: this is because each of these amplitudes contains a different causal structure, which determines the metric up to a conformal factor^[@CR17],[@CR18]^. Quantisation of the metric is therefore implicit in our result, in a similar way as in recently considered witnesses for quantum gravity in interferometric scenarios^[@CR47]--[@CR49]^.
A practical realisation of the Bell test for time order would be extremely challenging, even in light of current efforts to prepare superposition states of massive objects and test their gravitational interactions^[@CR50]--[@CR54]^. However, there would be far reaching consequences if a such a test were fundamentally impossible: this would imply that time order, and thus time itself, can be described with a classical parameter even in space-times originating from a quantum state of a massive object---with no need to invoke any other mechanism, such as refs. ^[@CR9]--[@CR13]^, that would decohere these states (see also Supplementary Note [5](#MOESM2){ref-type="media"} for further discussion). On the other hand, since these mechanisms postulate a specific decoherence time of spatial superpositions, one could think that they preclude the preparation of non-classical causal structures. This is not the case: the time required to complete our protocol can be shorter than the decoherence time postulated by these models (see Methods). Thus, contrary to some motivations^[@CR11],[@CR13]^, these models do not enforce fundamentally classical space-time with a fixed causal structure (i.e. there is a parameter regime where entangled causal structures could form but decoherence postulated by these models is negligible). Finally, classical temporal order could not be excluded also in a scenario where massive bodies can be prepared in quantum states but one (or more) of the assumptions 1, 2, 4, and 5 cannot be satisfied for some fundamental reason. We note that in particular the notion of locality may be fundamentally limited in the context of quantum gravity^[@CR55],[@CR56]^.
We should note that proof-of-principle realisations of indefinite causal order, analogous to the examples discussed here, have been realised in the laboratory. However, such realisations cannot be interpreted as proofs of non-classical space-time in the sense of general relativity, see Supplementary Note [4](#MOESM2){ref-type="media"} for a discussion of the key differences between the gravitational and other methods for a quantum control of temporal order. The full extent of the relation between gravitational and non-gravitational realisations of quantum causal structures merits an in-depth study on its own.
A crucial aspect of Bell's theorem for temporal order is that it provides a theory independent result---it applies to any framework where causal relations are described classically, such as classical, semi-classical^[@CR14]^ and stochastic gravity^[@CR32]^ theories. Moreover, joint validity of the quantum superposition principle and gravitational time dilation, assumptions (a)--(c), suffice for a maximal possible violation of the bound. Therefore, a classical notion of temporal order is untenable in any theory compatible with these basic principles. Finally, the way in which a non-classical causal structure can be engineered exploiting time dilation from a massive body in a quantum state reveals a close connection between the information-theoretic framework of quantum combs/process matrices and joint effects of quantum mechanics and general relativity.
Methods {#Sec8}
=======
Quantum gravitational control of temporal order {#Sec9}
-----------------------------------------------
According to the Einstein equations, a massive object gives rise to a space-time metric *g*~*μν*~, *μ*, *ν* = 0, \..., 3, which in isotropic coordinates and a post-Newtonian expansion reads^[@CR31]^: $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$g_{{\mathrm{00}}}(r) = - \left( {1 + 2\frac{{{\mathrm{\Phi }}(r)}}{{c^2}}} \right)$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$g_{ij}(r) = \delta _{ij}\left( {1 - 2\frac{{{\mathrm{\Phi }}(r)}}{{c^2}}} \right),$$\end{document}$ *i*, *j* = , 2, 3, where *r* denotes the distance to the location of the mass. In other words, if a test mass or a clock is positioned at a spatial coordinate **R**~a~ as described by a far-away agent (as in Fig. [1](#Fig1){ref-type="fig"}) and the massive object is at a coordinate **r**~*M*~, then *r* = \|**R**~a~ − **r**~*M*~\|, which for clarity we denote below by *R*~a~ − *r*~*M*~. It is important to note that the same coordinates describe scenarios where the mass is placed at different locations at a finite distance from **r**~*M*~, as long as it remains far from an asymptotic region so that the spatial and temporal coordinates of the far-away agent remain unaffected (i.e. are those of flat Minkowski space-time). In these coordinates, the Hamiltonian of a clock---a particle with internal DOFs---reads$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$H_{\mathrm{a}} = \sqrt { - g_{{\mathrm{00}}}(R_{\mathrm{a}} - r_{M})({\mathrm{\Omega }}_{\mathrm{a}}^2 + c^2g_{ij}(R_{\mathrm{a}} - r_{M})P^iP^j)} ,$$\end{document}$$(see e.g. refs. ^[@CR57]--[@CR59]^) where *P*^*i*^, *i* = 1, 2, 3 are the components of the momentum operator, and Ω~a~ is the internal Hamiltonian, describing the local time evolution of the internal DOFs. Note that we can restrict ourself to an effectively one-dimensional scenario, so only one of the spatial coordinates has been kept in the above expression. In the first post-Newtonian expansion and considering that both the mass and the clock follow fixed world lines at constant **R**~a~ and **r**~*M*~, respectively, Eq. ([9](#Equ9){ref-type=""}) becomes$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$H_{\mathrm{a}} \approx {\mathrm{\Omega }}_{\mathrm{a}}\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right).$$\end{document}$$
The asymptotic time coordinate *t* defines space-like hypersurfaces that are independent of the location of the mass and on which one can define states of all the involved systems (the clocks, the target systems and the mass itself) and Hamiltonian (10) describes their time evolution of with respect to *t*. Due to the interactions between the mass and the clocks---effected by the space-time metric, which contains the potential Φ(*R*~a~ − *r*~*M*~)---the time evolution of the clocks depends on their relative distance *R*~a~ − *r*~*M*~ to the mass. Crucially, by the definition of *t* and the Hamiltonian our description includes both considered different mass configurations: the mass can be semi-classically localised around a single spatial coordinate *r* or in superposition of different spatial coordinates and the associated states belong to the same Hilbert space associated with a space-like hypersurface labelled by *t*. We thus have all the tools to analyse time evolution in the presence of a superposition state of the mass, even though it leads to a quantifiably non-classical causal structure.
With respect to *t* and the associated foliation of space-time, the evolution of the clock, which at *t* = 0, is in an internal state \|*s*~a~(*τ*~0~)〉, where *τ*~0~ denotes the clock's proper time at *t* = 0, reads$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$e^{ - i{\mathrm{\Omega }}_{\mathrm{a}}t\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right)}|R_{\mathrm{a}}\rangle |s_{\mathrm{a}}(\tau _0)\rangle = |R_{\mathrm{a}}\rangle |s_{\mathrm{a}}(\tau _0 + \tau (R_{\mathrm{a}} - r_{M},t))\rangle ,$$\end{document}$$where $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau (R_{\mathrm{a}} - r_{M},t): = t\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right)$$\end{document}$ is the proper time elapsing for the clock at a radial distance \|*R*~a~ − *r*~*M*~\| from the mass when the elapsed coordinate time is *t*; and for clarity we set *ħ* = 1.
Before continuing on to the gravitational quantum control, we give an example of an internal Hamiltonian, state, and evolution. Let us take Ω~a~ = *E*~0~\|0〉〈0\| + *E*~1~\|1〉〈1\| and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|s_{\mathrm{a}}(\tau _0 = 0)\rangle = \frac{1}{{\sqrt 2 }}(|0\rangle + |1\rangle )$$\end{document}$, which describe, for example, an atom in an equal superposition of some two electronic energy levels \|0〉,\|1〉 with energies *E*~0~, *E*~1~, respectively. Under *H*~a~ from Eq. ([10](#Equ10){ref-type=""}) internal state \|*s*~a~(0)〉 from Eq. ([11](#Equ11){ref-type=""}) evolves as$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\begin{array}{*{20}{l}} {e^{ - i{\mathrm{\Omega }}_{\mathrm{a}}t\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right)}\left| {s_{\mathrm{a}}(0)} \right\rangle } \hfill & = \hfill & {\frac{1}{{\sqrt 2 }}e^{ - iE_0t\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right)}\left| 0 \right\rangle + \frac{1}{{\sqrt 2 }}e^{ - iE_1t\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{a}} - r_{M})}}{{c^2}}} \right)}\left| 1 \right\rangle } \hfill \\ {} \hfill & \equiv \hfill & {\frac{1}{{\sqrt 2 }}e^{ - iE_0\tau (R_{\mathrm{a}} - r_{M},t)}\left| 0 \right\rangle + \frac{1}{{\sqrt 2 }}e^{ - iE_1\tau (R_{\mathrm{a}} - r_{M},t)}\left| 1 \right\rangle ,} \hfill \end{array}$$\end{document}$$which is simply \|*s*~a~(*τ*(*R*~a~ − *r*~*M*~, *t*))〉.
We now use the above to show how the quantum superposition principle and general relativity lead to the prediction that quantised matter acts as a quantum control of temporal order. To this end, we assume conditions (a)--(c) from the Results section and consider two clocks positioned at *R*~A~ and *R*~B~, respectively. The Hamiltonian of clock a is thus Eq. ([10](#Equ10){ref-type=""}) and fully analogously for b, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$H_{\mathrm{b}} \approx {\mathrm{\Omega }}_{\mathrm{b}}\left( {1 + \frac{{{\mathrm{\Phi }}(R_{\mathrm{b}} - r_{M})}}{{c^2}}} \right)$$\end{document}$. The clocks are initially synchronised with each other and with a clock of the distant agent so that at *t*~0~ = 0 both clocks are at *τ*~0~ = 0. We further consider a target system, for example, a mode of the electromagnetic field, initially in a state \|*ψ*〉^S^, on which an operation $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\cal{O}}_{\mathrm{A}}$$\end{document}$ is performed at an event A = (*R*~a~, *τ*~a~ = *τ*^\*^) and an operation $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\cal{O}}_{\mathrm{B}}$$\end{document}$ at an event B = (*R*~b~, *τ*~b~ = *τ*^\*^), where *τ*~a~, *τ*~b~ refer to the proper times of the clock A, B, respectively. We effectively represent these operations as $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\cal{O}}_{\mathrm{A}} = \delta (\tau _{\mathrm{a}} - \tau ^ \ast ,r - R_{\mathrm{a}}){\mathrm{O}}_{\mathrm{A}}$$\end{document}$, where *δ*(*τ*~A~ − *τ*^\*^, *r* − *R*~a~) is a Dirac delta distribution and O~A~ is an operator (e.g. describing rotation of the polarisation of an electromagnetic field mode by a particular half-wave plate) independent of time and location. The total Hamiltonian reads$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$H_{{\mathrm{tot}}} = H_{\mathrm{a}} + H_{\mathrm{b}} + {\cal{O}}_{\mathrm{A}} + {\cal{O}}_{\mathrm{B}},$$\end{document}$$which for simplicity assumes trivial time evolution of the mass and of the target system between the application of the operations. We furthermore consider the following initial (at *t*~0~ = 0) state of the mass, clocks and the target system:$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\psi (0)} \right\rangle ^{{\mathrm{MSab}}} = |R_{\mathrm{a}}\rangle |R_{\mathrm{b}}\rangle |s_{\mathrm{a}}(\tau _0 = 0)\rangle |s_{\mathrm{b}}(\tau _0 = 0)\rangle \left| \psi \right\rangle ^{\mathrm{S}}\left( {\left| {r_{\mathrm{L}}} \right\rangle ^{\mathrm{M}} + \left| {r_{\mathrm{R}}} \right\rangle ^{\mathrm{M}}} \right),$$\end{document}$$where positions *r*~L~, *r*~R~ of the mass refer to the configurations in the left and the right panel of Fig. [1](#Fig1){ref-type="fig"}, respectively, that is, they realise configurations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$: fo*r* \|*r*~L~〉 the mass is at a distance *r*~a~ = *r*~L~ − *R*~a~ from clock a and at *r*~b~ = *r*~a~ − *h* from b, while for \|*r*~R~〉 the relative distances are swapped and the mass is at a distance *r*~a~ − *h* from a and at *r*~a~ from b. After coordinate time *t* such that *τ*(*r*~a~, *t*) \> *τ*^\*^ (where $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau ^ \ast > \frac{{2r_{\mathrm{b}}^2c}}{{GM}}$$\end{document}$, see main text) the state evolves to$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\begin{array}{*{20}{l}} {|\psi (t)\rangle ^{{\mathrm{MSab}}}} \hfill & = \hfill & {|R_{\mathrm{a}}\rangle |R_{\mathrm{b}}\rangle \left( {|s_{\mathrm{a}}(\tau (r_{\mathrm{a}},t))\rangle |s_{\mathrm{b}}(\tau (r_{\mathrm{a}} - h,t))\rangle e^{ - i{\mathrm{O}}_B}e^{ - i{\mathrm{O}}_{\mathrm{A}}}\left| \psi \right\rangle \left| {r_{\mathrm{L}}} \right\rangle ^{\mathrm{M}}} \right.} \hfill \\ {} \hfill & {} \hfill & {\left. { + |s_{\mathrm{a}}(\tau (r_{\mathrm{a}} - h,t))\rangle |s_{\mathrm{b}}(\tau (r_{\mathrm{a}},t))\rangle e^{ - i{\mathrm{O}}_{\mathrm{A}}}e^{ - i{\mathrm{O}}_{\mathrm{B}}}\left| \psi \right\rangle ^{\mathrm{S}}\left| {r_{\mathrm{R}}} \right\rangle ^{\mathrm{M}}} \right).} \hfill \end{array}$$\end{document}$$
The order of applying unitary transformations $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{\mathrm{A}} = e^{ - i{\mathrm{O}}_{\mathrm{A}}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{\mathrm{B}} = e^{ - i{\mathrm{O}}_{\mathrm{B}}}$$\end{document}$ to the target system is controlled by the position of the mass, which due to time-dilation changes causal relations between events A and B. Swapping the mass distribution: \|*r*~L~〉 → \|*r*~R~〉, \|*r*~R~〉 → \|*r*~L~〉 and letting the state evolve for another time interval *t* results in the final state where the clocks become synchronised again$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\left| {\psi (t)} \right\rangle ^{{\mathrm{MSab}}} = |R_{\mathrm{a}}\rangle |R_{\mathrm{b}}\rangle |s_{\mathrm{a}}(\tau _{\mathrm{f}})\rangle |s_{\mathrm{b}}(\tau _{\mathrm{f}})\rangle \left( {U_{\mathrm{B}}U_{\mathrm{A}}\left| \psi \right\rangle ^{\mathrm{S}}\left| {r_{\mathrm{R}}} \right\rangle ^{\mathrm{M}} + U_{\mathrm{A}}U_{\mathrm{B}}\left| \psi \right\rangle ^{\mathrm{S}}\left| {r_{\mathrm{L}}} \right\rangle ^{\mathrm{M}}} \right),$$\end{document}$$where *τ*~f~ = *τ*(*r*~a~, *t*) + *τ*(*r*~a~ − *h*, *t*). Measuring the mass in a superposition basis \|*r*~L~〉^M^ ± \|*r*~R~〉^M^ prepares the target system in the corresponding superposition state *U*~B~*U*~A~\|*ψ*〉^S^ ± *U*~A~*U*~B~\|*ψ*〉^S^.
The above example demonstrates that under very conservative assumptions a spatial superposition of a mass generates a quantum-controlled application of unitary operations. More fundamentally, this effect stems from the superposition of different causal structures associated with the superposed states of the mass.
Proof of Bell's theorem for temporal order {#Sec10}
------------------------------------------
Bell's theorem in general asserts that, under certain assumptions, the correlations between the outcomes of independent measurements on two subsystems must satisfy a class of inequalities. The two measuring parties are referred to as Alice and Bob. In every experimental run, each of them measures one of two properties of the subsystem they receive. For each of the properties, one of two outcomes is obtained, for convenience chosen to be ±1. Bell's inequalities follow from the conjunction of the following assumptions: (1) measurement results are determined by properties that exist prior to and independent of the experiment (hidden variables); (2) results obtained at one location are independent of any measurements or actions performed at space-like separation (locality); (3) any process that leads to the choice of which measurement will be carried out is independent from other processes in the experiment (free choice). The outcomes of Alice *A*(*i*, *λ*) and Bob *B*(*i*, *λ*) thus only depend on their own choice of setting, index *i*, and on the property of the system, variable *λ*. The correlation between outcomes *A*(*i*, *λ*) and *B*(*i*, *λ*) for the measurement choices *i*, *j* is described by $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$E(A_i,B_j) = {\int} {\mathrm{d}}\lambda P(\lambda )A(i,\lambda )B(j,\lambda )$$\end{document}$, where *P*(*λ*) is the probability distribution over the properties of the systems. It is straightforward to check that one possible inequality satisfied by the correlations *E*(*A*~*i*~, *B*~*j*~) is the so-called Clauser--Horne--Shimony--Holt inequality: \|*E*(*A*~1~, *B*~1~) + *E*(*A*~1~, *B*~2~) + *E*(*A*~2~, *B*~1~) − *E*(*A*~2~, *B*~2~)\| ≤ 2. Crucially, quantum theory allows for the left-hand side of this inequality to reach a value \>2, and experimental measurements of this (and other inequalities) have confirmed such a violation^[@CR3]--[@CR6]^. The significance of the violations of Bell's inequalities is in showing that neither nature nor quantum mechanics obey all three assumptions mentioned above.
The assumption of classical order is sufficient to derive Causal Inequalities^[@CR16],[@CR60]^: tasks that, without any further assumptions, cannot be performed on a classical causal structure. However, it is not possible to violate causal inequalities using quantum control of order^[@CR45],[@CR61]^, this is why additional assumptions were required in the present context. It is an open question whether a gravitational implementation of a scenario that does allow for a violation of causal inequalities is possible.
The theorem we have formulated is theory independent, but not fully device-independent, as it requires the notions of a physical state and a physical transformation (in addition to the measured probability distributions), which we introduce below and then proceed to the proof. Discussion of the present work in the context of the theory-dependent framework of causally non-separable quantum processes^[@CR16],[@CR45],[@CR61]^ and the fully theory- and device-independent approach of causal inequalities^[@CR16],[@CR60]^ is presented in Supplementary Note [1](#MOESM2){ref-type="media"}.
We consider a sufficiently broad framework to describe physical systems that can undergo transformations and measurements, similar to generalised probabilistic theories^[@CR62]--[@CR64]^. This framework is more general than quantum or classical theory and we thus need to define key notions required in the proof. In this framework, a state *ω* is a complete specification of the probabilities *P*(*o*\|*i*, *ω*) for observing outcome *o* given that a measurement with setting *i* is performed on the system. We are interested in situations where a system can be split up in subsystems, say S~1~ and S~2~, with space-like separated agents performing independent operations on S~1~ and S~2~. We say *ω* is a product state, and write *ω* = *ω*~1~ ⊗ *ω*~2~, if probabilities for local measurements factorise as *P*(*o*~1~, *o*~2~\|*i*~1~, *i*~2~, *ω*) = *P*(*o*~1~\|*i*~1~, *ω*~1~)*P*(*o*~2~\|*i*~2~, *ω*~2~). If state $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega _1^f$$\end{document}$ is prepared for system S~1~ and state $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega _2^f$$\end{document}$ is prepared for system S~2~, according to a probability distribution *P*(*f*) for some variable *f*, we write $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega = {\int} {\mathrm{d}}f{\kern 1pt} P(f)\omega _1^f \otimes \omega _2^f$$\end{document}$ and say the state is separable. Probabilities are then given by the corresponding mixture: $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$P(o_1,o_2|i_1,i_2,\omega ) = {\int} {\mathrm{d}}fP(o_1|i_1,\omega _1^f)P(o_2|i_2,\omega _2^f)P(f)$$\end{document}$. Note that for such a decomposition Bell inequalities cannot be violated^[@CR1],[@CR65]^.
A physical transformation of the system is represented by a function $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega \mapsto T(\omega )$$\end{document}$. To make our arguments precise we need a notion of local transformations, namely, realised at the time and location defined by a local clock. If S~1~ is the subsystem on which a local transformation *T*~1~ acts, and S~2~ labels the DOFs space-like separated from *T*~1~, then, by definition, *T*~1~ transforms product states as $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega _1 \otimes \omega _2 \mapsto T_1(\omega _1) \otimes \omega _2$$\end{document}$ and separable states by convex extension. How local operations act on general, non-separable states can depend on the particular physical theory; however, action on separable states will suffice for our purposes. We further need to define how the local transformations combine. This depends on their relative spatio-temporal locations: if transformations *T*~1~, *T*~2~ are space-like separated they combine as (*T*~1~ ⊗ *T*~2~)(*ω*~1~ ⊗ *ω*~2~) = *T*~1~(*ω*~1~) ⊗ *T*~2~(*ω*~2~), which follows from the definition above; if *T*~1~ is in the future of *T*~2~, we define their combination as *T*~1~ ο *T*~2~(*ω*) = *T*~1~(*T*~2~(*ω*)). (For simplicity, we omit possible additional transformations taking place between the specified events, as they are of no consequence for our argument.)
*Proof* Assumption (1) says that there is a random variable *f* determining the local states $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega _1^f$$\end{document}$, $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\omega _2^f$$\end{document}$ of systems S~1~, S~2~, respectively. Assumption (3) says there is a random variable *λ* that determines the order of events. In general, the two variables can be correlated by some joint probability distribution *P*(*λ*, *f*). By assumption (4), events labelled *A*~1~, *B*~1~ are space-like separated from events *A*~2~, *B*~2~ and the order between events within each set (*A*~*j*~, *B*~*j*~), *j* = 1, 2 can be defined by a permutation *σ*~*j*~. Most generally, there is a probability *P*(*σ*~*j*~\|*λ*) that the permutation *σ*~*j*~ is realised for a given *λ*. By assumption (2), for each given order the system undergoes a transformation $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T^{\sigma _1} \otimes T^{\sigma _2}$$\end{document}$, where $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T^{\sigma _1}$$\end{document}$ is the transformation obtained by composing $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{{\mathrm{A}}_{\mathrm{1}}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{{\mathrm{B}}_{\mathrm{1}}}$$\end{document}$ in the order corresponding to the permutation *σ*~1~ and similarly for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T^{\sigma _2}$$\end{document}$. (For example, if *σ*~1~ corresponds to the order $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}_{\mathrm{1}} \prec {\mathrm{B}}_{\mathrm{1}}$$\end{document}$, then $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T^{\sigma _1} = T_{{\mathrm{B}}_{\mathrm{1}}} \circ T_{{\mathrm{A}}_{\mathrm{1}}}$$\end{document}$.) Furthermore, at event D an outcome *z* is obtained with a probability *P*(*z*\|*λ*, *f*, *σ*~1~, *σ*~2~). Finally, using assumption (1), we write the probabilities for all outcomes as$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {P\left( {o_1,o_2,z|i_1,i_2,{\Bbb T},\omega } \right)} =\\ {\mathop {\sum}\limits_{\sigma _1\sigma _2} {{\int} } {\mathrm{d}}\lambda \,{\mathrm{d}}fP(o_1|i_1,T^{\sigma _1}(\omega _1^f))P(o_2|i_2,T^{\sigma _2}(\omega _2^f))P(\sigma _1|\lambda )P(\sigma _2|\lambda )P(z|\lambda ,f,\sigma _1,\sigma _2)P(\lambda ,f).}$$\end{document}$$
A simple Bayesian inversion *P*(*σ*~1~\|*λ*)*P*(*σ*~2~\|*λ*)*P*(*z*\|*λ*, *f*, *σ*~1~, *σ*~2~)*P*(*λ*, *f*) = *P*(*λ*, *f*, *σ*~1~, *σ*~2~\|*z*)*P*(*z*), where we used *P*(*σ*~*j*~\|*λ*) = *P*(*σ*~*j*~\|*λ*, *f*), gives the desired probabilities$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\begin{array}{*{20}{l}} {P\left( {o_1,o_2|i_1,i_2,z,{\Bbb T},\omega } \right)} \hfill & = \hfill & {\mathop {\sum}\limits_{\sigma _1\sigma _2} {{\int} } {\mathrm{d}}\lambda \,{\mathrm{d}}fP(o_1|i_1,T^{\sigma _1}(\omega _1^f))P(o_2|i_2,T^{\sigma _2}(\omega _2^f))P(\lambda ,f,\sigma _1,\sigma _2|z)} \hfill \\ {} \hfill & = \hfill & {{\int} {\mathrm{d}} \tilde fP(o_1|i_1,T^{\sigma _1})P(o_2|i_2,T^{\sigma _2})P(\tilde f|z)}, \hfill \end{array}$$\end{document}$$where $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tilde f$$\end{document}$ is a short-hand for the variables *λ*, *f*, *σ*~1~, and *σ*~2~. The above probability distribution satisfies the hypothesis of Bell's theorem and thus cannot violate any Bell inequality.
Exemplary scenario realising Bell test for temporal order of events {#Sec11}
-------------------------------------------------------------------
The protocol allowing for the violation of Bell's inequalities for temporal order exploits correlations between the clocks of the agents a~1~, b~1~ and the agents a~2~, b~2~, created due to time dilation induced by the mass. It should be noted that the protocol allows maximal violation of the Bell inequality if the joint state of the systems S~1~ and S~2~ is pure (and maximally entangled) when the Bell measurements are realised. Thus, for a maximal violation, the clocks need to decorrelate from the mass after the application of the unitaries. Below we sketch a scenario that can achieve this.
The space-time arrangement of the mass and the agents in this example is presented in Fig. [4](#Fig4){ref-type="fig"}. It can be realised in one spatial dimension: agents acting on the system S~1~ are located at distance *h* from each other, and the mass is placed at distance *r* (configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$) or *r* + *L* (configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$) from agent a~1~. Agents acting on system S~2~ are placed symmetrically on the opposite side of the mass, such that the mass is at a distance *r* + *L* from a~2~ in configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ and *r* in configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$. Here, events A~*j*~ are defined by the local time *τ*~a~ that differs from the local time *τ*~b~ defining B~*j*~, *j* = 1, 2. In such a case, even though the mass is always closer to a~*j*~ than to b~*j*~, the two mass configurations can lead to different event orders---as they induce different relative time dilations. (Equivalently, one can introduce an initial offset in the synchronisation of the clocks.) Note that the time orders between the two groups are here "anti-correlated": $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}_{\mathrm{1}} \prec {\mathrm{B}}_{\mathrm{1}}$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{B}}_{\mathrm{2}} \prec {\mathrm{A}}_{\mathrm{2}}$$\end{document}$ for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$, and vice versa for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$. Since otherwise the scenario is the same for S~1~ and S~2~, we focus on the operations performed on S~1~. The key observation is that swapping the mass distribution, as depicted in Fig. [4](#Fig4){ref-type="fig"}, will eventually disentangle the clocks from the mass, and since the clocks must be suitably time dilated when the operations are performed, the operations must not take place in the future light cone of the swapped mass state.Fig. 4Space-time diagram of a protocol for disentangling the clocks from the mass. In configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ the mass is at a distance *r* + *L* from a~1~, and at *r* + *L* + *h* from b~1~. In $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$---it is at *r* from a~1~ and at *r* + *h* from b~1~.The opposite holds for a~2~, b~2~. The initial mass superposition is swapped (after sufficient time to prepare the clocks in the correlated state) so that they finally show the same time. At the local time *τ*~a~ of a~1~ (at event A~1~) the agent applies $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{A}}_{\mathrm{1}}}$$\end{document}$ on S~1~. At the local time *τ*~b~ of b~1~ the agent applies $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$U_{{\mathrm{B}}_{\mathrm{1}}}$$\end{document}$ on S~1~. For the mass configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$ A~1~ is before B~1~ (orange-coloured events), while for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$ event B~1~ is before A~1~ (blue-coloured events). The opposite order holds for events A~2~, B~2~ occurring on the opposite side of the mass, where agents a~2~, b~2~ act on S~2~. Unitary operations should be applied in the future light cone of the event where the clocks get correlated and outside the future light cone of the event when the mass amplitudes are swapped, Bell measurements (at C~1~, C~2~) should be made when the clocks become disentangled (at future light-like events to when the mass amplitudes are brought together), and the measurement at event D should be space-like to C~1~, C~2~; dashed yellow lines represent the relevant light cones
The proper time *τ*~a~ that has to elapse for the clock of a~1~ such that the order of events is $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{A}}_{\mathrm{1}} \prec {\mathrm{B}}_{\mathrm{1}}$$\end{document}$ for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|{\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}\rangle$$\end{document}$ and $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{B}}_{\mathrm{1}} \prec {\mathrm{A}}_{\mathrm{1}}$$\end{document}$ for $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$|{\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}\rangle$$\end{document}$ for the present case reads$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau _{\mathrm{a}} = \sqrt { - g_{{\mathrm{00}}}(r)} \frac{{T_{c}(r,h) + T_{c}(r + L,h)\sqrt {\frac{{g_{{\mathrm{00}}}(r + L + h)}}{{g_{{\mathrm{00}}}(r + h)}}} }}{{1 - \sqrt {\frac{{g_{{\mathrm{00}}}(r)g_{{\mathrm{00}}}(r + L + h)}}{{g_{{\mathrm{00}}}(r + h)g_{{\mathrm{00}}}(r + L)}}} }},$$\end{document}$$where *T*~*c*~(*r*, *L*/2) is the coordinate travel time of light between radial distances *r* and *r* + *L*/2 from the mass. The coordinate time corresponding to *τ*~a~ is $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{\mathrm{a}} = \tau _{\mathrm{a}}/\sqrt { - g_{{\mathrm{00}}}(r)}$$\end{document}$. The proper time of event B~1~ is then defined as:$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\tau _{\mathrm{b}} = \sqrt { - g_{{\mathrm{00}}}(r + L + h)} \left( {\frac{{\tau _{\mathrm{a}}}}{{\sqrt { - g_{{\mathrm{00}}}(r + L)} }} + T_{c}(r + L,h)} \right).$$\end{document}$$
It can directly be checked that when the mass is placed in configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{A}} \prec {\mathrm{B}}}$$\end{document}$---at a distance *r* + *L* from a~1~---the event A~1~ defined by local clock of a~1~ showing proper time *τ*~a~ from Eq. ([18](#Equ18){ref-type=""}) is in the past light cone of event B~1~, which is defined by the local clock of b~1~ showing proper time *τ*~b~ from Eq. ([19](#Equ19){ref-type=""}). When the mass is placed in configuration $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\mathrm{K}}_{{\mathrm{B}} \prec {\mathrm{A}}}$$\end{document}$, event B~1~ ends up in the past of the event A~1~. The coordinate time required for the application of the operations can be estimated as twice the travel time of light between the agents, *T*~o~ = 2*T*~*c*~(*r* + *L*/2, *h*).
The world lines of the mass can be arranged such that: (a) the mass is moving slow so that the two amplitudes of the mass are swapped in a time interval longer than *T*~o~; (b) during the application of the operations the distance of each agent to the mass is approximately the same for both mass configurations (as in Fig. [4](#Fig4){ref-type="fig"}). The first guarantees that there is enough time to apply the operations after the clocks get correlated, the second---that the slow-down of light in curved space-time, the Shapiro delay^[@CR66],[@CR67]^, can be neglected.
The coordinate-time duration of the entire protocol can be estimated as *T*~p~ = 2*T*~a~ + 4*L*/2*c*, where *L*/2*c* is the minimal time required to put the mass in superposition of amplitudes separated by the distance *L*/2. Taking as an example *M* \~ 0.1 μg, *L* = *h* \~ 0.1 μm, *r* \~ 1 fm, the protocol in Fig. [4](#Fig4){ref-type="fig"} takes *T*~p~ \~10 h. Furthermore, we note that a quantum treatment of the local clocks is central to our protocol since the application of the operations on the target systems is conditioned on the states of the clocks. The time-energy uncertainty^[@CR68],[@CR69]^ thus poses a limitation to a single-shot precision with which space-time events can be defined with physical clocks. The optimal clock state in this context---evolving the fastest---is a balanced superposition of energy eigenstates; for an energy gap *ħ* ⋅ 2*πν*~c~, where *ν*~c~ is the clock frequency, the smallest time that can be resolved by a single quantum system is the so-called orthogonalisation time^[@CR70]--[@CR72]^ *t*~⊥~ = 1/2*ν*~c~. For the values of parameters quoted above, the coordinate-time difference between the superposed locations of the events A~*i*~, *i* = 1, 2 is \~10^−15^ s, and we thus need a system with frequency *ν*~c~ ≥10^15^ Hz such as a clock based on optical transitions in ytterbium^[@CR73]^ or mercury^[@CR74]^, which both give *t*~⊥~ \~10^−16^ s. While this ideal limit is not reached with practical systems, the resolution of current atomic clocks based on such atoms far exceeds this theoretical bound due to averaging over many atoms, with 2.5 × 10^−19^ uncertainty of the clock frequency recently demonstrated in ref. ^[@CR75]^. We further note that by using *n* entangled atoms, the orthogonalisation time of the entire system becomes *t*~⊥~/*n* and can thus be even a few orders of magnitude smaller^[@CR76]^ than required. Finally, such atoms have masses \~10^−25^ kg and their back action on the metric produced by *M* \~ 10^−7^ kg would thus be negligible. Since the mass difference between the atom in the two involved energy levels is 2*πħν*~c~/*c*^2^ \~10^−35^ kg also quantum effects from the clocks' mutual gravitational interactions^[@CR58]^ can be neglected.
We conclude that it is in principle possible to achieve the required entanglement of orders, swap the mass distribution so as to finally disentangle the clocks from the mass, and satisfy the locality conditions on the events. Although a direct experiment in such a regime is not practical, the above example surprisingly shows that the regime where entangled temporal order arises is in no way related to the Planck scale. It is usually assumed that the Planckscale marks the regime where quantum gravity effects become relevant (first discussed in this context by Bronstein^[@CR77]^), but this is not the case for the superposition of temporal order. In terms of a potential experiment, one could also take a different (theory-dependent) approach and explore possible witnesses of entangled temporal order^[@CR61]^, in analogy to witnesses of entanglement in quantum-information theory^[@CR78]^. A witness would probe the quantum nature of temporal order indirectly and under further assumptions, but in a relaxed parameter range. Such an approach may lead to more feasible experiments, which will be explored in a future study.
A spatial superposition state of a mass such as used in our protocol is postulated to decohere in various gravity-inspired collapse models^[@CR9]--[@CR13]^ (which thus violate assumption (c) in the first section). However, even if endorsed, these models do not immediately preclude realisation of our protocol: the decoherence time scale in those models is the Diosi--Penrose time^[@CR10],[@CR11]^ $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$T_{{\mathrm{DP}}} = \frac{{2\delta ^3\hbar }}{{G(ML)^2}}$$\end{document}$, where *δ* is a free parameter. For every value of *δ* one can find the mass and the relevant distances (*M*, *r*, *L*, *h*) so that the duration of our entire protocol is shorter than *T*~DP~. For example, following the recent ref. ^[@CR79]^ and taking *δ* = 10^−7^ m, for *r* = 10^10^*R*~Sch~, *L* = 5*r*, *h* = *r* and *M* = 1 g, where *R*~Sch~ ≈10^−30^ m, the protocol from Fig. [4](#Fig4){ref-type="fig"} takes *T*~p~ ≈7 × 10^−18^ s, while *T*~DP~ ≈0.5 s. Taking instead the originally proposed value *δ* = 10^−15^ m^[@CR10]^, the desired regime is achieved, for example, for *M* = 10^−7^ kg, *r* = 10^7^*R*~Sch~, *L* = 5 × 10^5^*r*, *h* = 10^5^*r*; with *T*~p~ \~10^−23^ s and *T*~DP~ \~10^−13^ s. Thus, the above models in principle still allow for events with entangled temporal order, and do not enforce the classicality of the causal structure of space time.
Supplementary information
=========================
{#Sec12}
Peer Review File Supplementary Information
**Peer review information**: Nature Communications thanks Rodolfo Gambini and other anonymous reviewer(s) for their contribution to the peer review of this work. Peer reviewer reports are available.
**Publisher's note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
=========================
**Supplementary Information** accompanies this paper at 10.1038/s41467-019-11579-x.
We thank G. Chiribella, G. Milburn, H. Wiseman and M. Vojinovic for feedback. M.Z. and F.C. acknowledge support through the Australian Research Council (ARC) Centre of Excellence for Engineered Quantum Systems (CE 110001013), Discovery Early Career Researcher Awards DE180101443, DE170100712 and the Templeton World Charity Foundation (TWCF 0064/AB38). I.P. acknowledges support of the NSF through a grant to ITAMP and the Branco Weiss Fellowship---Society in Science, administered by the ETH Zürich. Č.B. acknowledges the support of the Austrian Science Fund (FWF) through the Doctoral Programme CoQuS, the project I-2526-N27 and I-2906, the research platform TURIS and the ÖAW Innovationsfond "Quantum Regime of Gravitational Source Masses". This publication was made possible through the support of a grant from the John Templeton Foundation and from the Foundational Questions Institute (FQXi) Fund. The opinions expressed in this publication are those of the authors and do not necessarily reflect the views of the John Templeton Foundation. F.C. and M.Z. acknowledge the traditional owners of the land on which the University of Queensland is situated, the Turrbal and Jagera people.
M.Z., F.C., I.P and Č.B. contributed to all aspects of the research, with the leading input from M.Z.
The data that support the plots within this paper and other findings of this study are available from the corresponding author upon reasonable request.
The authors declare no competing interests.
| 2023-09-06T01:26:29.851802 | https://example.com/article/9267 |
<?php
// xulApplication.php demonstrates a XUL application with xajax
// XUL will only work in Mozilla based browsers like Firefox
// using xajax version 0.2
// http://xajaxproject.org
require_once("../../xajax.inc.php");
function test() {
$objResponse = new xajaxResponse();
$objResponse->addAlert("hallo");
$objResponse->addAssign('testButton','label','Success!');
return $objResponse->getXML();
}
$xajax = new xajax();
$xajax->registerFunction("test");
$xajax->processRequests();
header("Content-Type: application/vnd.mozilla.xul+xml");
?>
<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="chrome://global/skin/" type="text/css"?>
<window id="example-window" title="Exemple 2.2.1"
xmlns:html="http://www.w3.org/1999/xhtml"
xmlns="http://www.mozilla.org/keymaster/gatekeeper/there.is.only.xul">
<script type="application/x-javascript">
var xajaxRequestUri="xulServer.php";
var xajaxDebug=false;
var xajaxStatusMessages=false;
var xajaxDefinedGet=0;
var xajaxDefinedPost=1;
</script>
<script type="application/x-javascript" src="../../xajax_js/xajax.js"></script>
<button id="testButton" oncommand="xajax.call('test',[]);" label="Test" />
</window> | 2024-04-16T01:26:29.851802 | https://example.com/article/1179 |
Sorting out Responsibility for the Deepwater Horizon Oil Spill
Legal accountability is on the way for those who bear responsibility for the Deepwater Horizonoil well blowout in the Gulf of Mexico. Billions of dollars are at stake, but the Obama administration is likely to be quite accommodating if the oil company and its contractors (including the designated demon of the Bush era, Halliburton) pony up a settlement that appears reasonable. With the threat of dragging government officials into court to account for their own actions in the cleanup, a tidy ending is likely to be attractive. There have been lots of recent events to catch up on. As outlined previously on AT, the trial to set responsibility for the initial blowout phase (as distinguished from the containment phase) of the accident was scheduled to start on February 27, but there have been delays and settlements galore. It does seem that Obama and the trial lawyers weren't really anxious for some maritime law football.
You can find the ongoing transactions at the New Orleans Times-Picayune's webpage, but here a few selected headlines. You will find much more on the web page.
That means that the people with legitimate claims who naively believed the trial lawyers, who said that they could double-dip, and had 6% of their payments set aside to cover the lawyers' fees can now likely expect to get their 6% deduction back, with BP picking up the difference.
Those in the oil industry who suffered from the Obama administration's illegal drilling moratorium will have to wait for their day in a different court, as their complaints have been separated out from those of people harmed by the BP Macondo 252 well. That trial should be a doozey.
This is where we start to get down to brass tacks! The federal and local governments have been salivating at the prospect of collecting huge fines under the Oil Pollution Act (OPA) and the Clean Water Act (CWA). Fines of $1,100 per barrel for simple negligence and $4,300 per barrel for gross negligence have set visions of sugar plums dancing in the heads of budget-constrained politicians of all stripes. Under the terms of the law, as interpreted by Judge Barbier, the drilling contractor, Transocean, is presumed to be responsible for all pollution released at the surface of the gulf, which limits Transocean's exposure to the point at which the Deepwater Horizon sank.
As general contractor, BP has overall responsibility for the project and therefore is presumed to be responsible for the balance of the spill from the wellhead at the sea floor. That is where the big fines are.
What will come next is the allocation of responsibilities among BP, Transocean, and Halliburton on one side and the hungry governments on the other. BP entered into indemnity clauses with the contractors, which BP has been using to deny responsibility for damages. So in their intramural dispute, the question will hinge on whether those indemnity clauses are enforceable. The judge has ruled that they would not be enforceable, and therefore the contractors would be on the hook, if there was gross negligence on the part of the vendors. So that puts the bull's eye squarely on Halliburton to accept their share of the blame. If Halliburton caves, then the unified position of the private sector is that the accident was a case of simple negligence, subject to the $1,100-per-barrel fine. The size of the spill must be determined, and despite all the exaggerated claims of the Obama administration, the court will likely accept BP's lower estimate of 3.2 million barrels, putting the total fine at $3.52 billion, an amount BP has already set aside. Split three ways, that is less than $1.1 billion for each of the three.
So the likely offer to Obama is to let them totally off the hook for a total of $3.5 billion plus the separate settlements with the affected private parties, or else!
Enquiring minds might ask, "Or else what?" The answer is that we then get to the second phase of the litigation: determining who is responsible for the collection, containment, and cleanup of the oil spill after the president named a National Incident Commander and took charge of the situation. Admiral Thad Allen and Energy Secretary Steven Chu would then become key witnesses, subject to cross-examination by BP, the company which directed the successful effort to "plug the damn hole"! Until now, they have been prohibited from speaking out due to Interior Secretary Ken Salazar's boot being held firmly upon their necks!
If that trial, with Allen, Chu, and company under oath, ever came to pass, it would be a barn-burner. But don't hold your breath. It seems President Obama wants to forfeit ("vote present") rather than play maritime court football. You would probably want to forfeit, too, if your star witness were Steven "Solyndra" Chu.
Legal accountability is on the way for those who bear responsibility for the Deepwater Horizonoil well blowout in the Gulf of Mexico. Billions of dollars are at stake, but the Obama administration is likely to be quite accommodating if the oil company and its contractors (including the designated demon of the Bush era, Halliburton) pony up a settlement that appears reasonable. With the threat of dragging government officials into court to account for their own actions in the cleanup, a tidy ending is likely to be attractive.
There have been lots of recent events to catch up on. As outlined previously on AT, the trial to set responsibility for the initial blowout phase (as distinguished from the containment phase) of the accident was scheduled to start on February 27, but there have been delays and settlements galore. It does seem that Obama and the trial lawyers weren't really anxious for some maritime law football.
You can find the ongoing transactions at the New Orleans Times-Picayune's webpage, but here a few selected headlines. You will find much more on the web page.
That means that the people with legitimate claims who naively believed the trial lawyers, who said that they could double-dip, and had 6% of their payments set aside to cover the lawyers' fees can now likely expect to get their 6% deduction back, with BP picking up the difference.
Those in the oil industry who suffered from the Obama administration's illegal drilling moratorium will have to wait for their day in a different court, as their complaints have been separated out from those of people harmed by the BP Macondo 252 well. That trial should be a doozey.
This is where we start to get down to brass tacks! The federal and local governments have been salivating at the prospect of collecting huge fines under the Oil Pollution Act (OPA) and the Clean Water Act (CWA). Fines of $1,100 per barrel for simple negligence and $4,300 per barrel for gross negligence have set visions of sugar plums dancing in the heads of budget-constrained politicians of all stripes. Under the terms of the law, as interpreted by Judge Barbier, the drilling contractor, Transocean, is presumed to be responsible for all pollution released at the surface of the gulf, which limits Transocean's exposure to the point at which the Deepwater Horizon sank.
As general contractor, BP has overall responsibility for the project and therefore is presumed to be responsible for the balance of the spill from the wellhead at the sea floor. That is where the big fines are.
What will come next is the allocation of responsibilities among BP, Transocean, and Halliburton on one side and the hungry governments on the other. BP entered into indemnity clauses with the contractors, which BP has been using to deny responsibility for damages. So in their intramural dispute, the question will hinge on whether those indemnity clauses are enforceable. The judge has ruled that they would not be enforceable, and therefore the contractors would be on the hook, if there was gross negligence on the part of the vendors. So that puts the bull's eye squarely on Halliburton to accept their share of the blame. If Halliburton caves, then the unified position of the private sector is that the accident was a case of simple negligence, subject to the $1,100-per-barrel fine. The size of the spill must be determined, and despite all the exaggerated claims of the Obama administration, the court will likely accept BP's lower estimate of 3.2 million barrels, putting the total fine at $3.52 billion, an amount BP has already set aside. Split three ways, that is less than $1.1 billion for each of the three.
So the likely offer to Obama is to let them totally off the hook for a total of $3.5 billion plus the separate settlements with the affected private parties, or else!
Enquiring minds might ask, "Or else what?" The answer is that we then get to the second phase of the litigation: determining who is responsible for the collection, containment, and cleanup of the oil spill after the president named a National Incident Commander and took charge of the situation. Admiral Thad Allen and Energy Secretary Steven Chu would then become key witnesses, subject to cross-examination by BP, the company which directed the successful effort to "plug the damn hole"! Until now, they have been prohibited from speaking out due to Interior Secretary Ken Salazar's boot being held firmly upon their necks!
If that trial, with Allen, Chu, and company under oath, ever came to pass, it would be a barn-burner. But don't hold your breath. It seems President Obama wants to forfeit ("vote present") rather than play maritime court football. You would probably want to forfeit, too, if your star witness were Steven "Solyndra" Chu. | 2024-07-20T01:26:29.851802 | https://example.com/article/7955 |
Wednesday, July 14, 2010
Sweet paris-7
My new friend told me about La Patisserie desRêves. I bought one slice of tarte tatin and the staff wrapped it up in a cute pink box and bag. Other patisseries were usually casual and wrapped cakes with a sheet of paper - well it was fine with me though.The apple flavor was very strong and thick.Here is pink again. Chic but pop colors everywhere. People aren't afraid to enjoy colors here. | 2024-07-28T01:26:29.851802 | https://example.com/article/1045 |
using FakeXrmEasy.FakeMessageExecutors;
using Microsoft.Crm.Sdk.Messages;
using Microsoft.Xrm.Sdk;
using Microsoft.Xrm.Sdk.Messages;
using Microsoft.Xrm.Sdk.Query;
using System;
using System.Linq;
using Xunit;
namespace FakeXrmEasy.Tests.FakeContextTests.ReviseQuoteRequestTests
{
public class ReviseQuoteRequestTests
{
[Fact]
public void When_can_execute_is_called_with_an_invalid_request_result_is_false()
{
var executor = new ReviseQuoteRequestExecutor();
var anotherRequest = new RetrieveMultipleRequest();
Assert.False(executor.CanExecute(anotherRequest));
}
[Fact]
public void Should_Create_New_Quote_With_Lines_When_Revisioning()
{
var context = new XrmFakedContext();
var service = context.GetOrganizationService();
var quote = new Entity
{
LogicalName = "quote",
Id = Guid.NewGuid(),
Attributes = new AttributeCollection
{
{"statuscode", new OptionSetValue(1)},
{"name", "Adventure Quote"}
}
};
var quoteDetail = new Entity
{
LogicalName = "quotedetail",
Id = Guid.NewGuid(),
Attributes = new AttributeCollection
{
{"quoteid", quote.ToEntityReference() },
{"extendedamount", new Money(1000m) }
}
};
context.Initialize(new[]
{
quote, quoteDetail
});
var executor = new ReviseQuoteRequestExecutor();
var req = new ReviseQuoteRequest
{
ColumnSet = new ColumnSet(true),
QuoteId = quote.Id
};
executor.Execute(req, context);
quote = service.RetrieveMultiple(new QueryExpression("quote")
{
ColumnSet = new ColumnSet(true),
Criteria = new FilterExpression(LogicalOperator.And)
{
Conditions =
{
new ConditionExpression("quoteid", ConditionOperator.NotEqual, quote.Id)
}
}
}).Entities.SingleOrDefault();
Assert.NotNull(quote);
Assert.Equal("Adventure Quote", quote.GetAttributeValue<string>("name"));
var quoteLines = service.RetrieveMultiple(new QueryExpression("quotedetail")
{
ColumnSet = new ColumnSet(true),
Criteria = new FilterExpression(LogicalOperator.And)
{
Conditions = { new ConditionExpression("quoteid", ConditionOperator.Equal, quote.ToEntityReference()) }
}
}).Entities.ToList();
Assert.Equal(1, quoteLines.Count);
Assert.Equal(new Money(1000m), quoteLines.Single().GetAttributeValue<Money>("extendedamount"));
}
}
} | 2024-06-09T01:26:29.851802 | https://example.com/article/4540 |
{
"description": "Office 365 URLs and IP address ranges used for their attack simulator in Office 365 Threat Intelligence",
"list": [
"52.168.52.134",
"portal.docdeliveryapp.com",
"portal.docdeliveryapp.net",
"portal.docstoreinternal.com",
"portal.hardwarecheck.net",
"portal.hrsupportint.com",
"portal.payrolltooling.com",
"portal.payrolltooling.net",
"portal.prizegiveaway.net",
"portal.prizesforall.com",
"securescore-user-prod.cloudapp.net"
],
"matching_attributes": [
"ip-src",
"ip-dst",
"domain",
"domain|ip",
"hostname"
],
"name": "List of known Office 365 Attack Simulator used for phishing awareness campaigns",
"type": "substring",
"version": 20180711
}
| 2024-06-09T01:26:29.851802 | https://example.com/article/1988 |
The EPA issued a proposed rule revising the Land Disposal Restrictions treatment standards to provide more flexibility and certainty to those who treat the disposal of certain hazardous wastes from the production of carbamates.
The Securities and Exchange Commission (SEC) found that investors in one of Allen Stanford’s many companies were entitled to a SIPA liquidation to restore the investors’ losses from Stanford’s alleged Ponzi scheme. Because the divisions between Allen Stanford’s companies were sufficiently blurred, these investors could recover even though the financial instruments they bought originated in a different Stanford company.
EPA found “insufficient” the U.S. State Department’s current environmental review of the Keystone XL pipeline, which would move crude oil from Alberta, Canada to refineries in Texas. | 2024-04-11T01:26:29.851802 | https://example.com/article/5101 |
Q:
Win API to Scroll Up and down the navigation pane in outlook 2010
I know that using .net VSTO there is no way to do this. but what my addin is doing :
When a user clicks on a folder in outlook on the navigation pane, I am showing another folder instead. jus by using the ActiveExpolorer.CurrentFolder = MyNewFolder. the issue here is that outlook will scroll down to the new folder and I want to prevent this.
I can't set back the current folder to the original folder because I am using the FolderSwitch event and so it will be ea endless loop.
I am thinking if I could make it remember the navigation bar position and then set it back to that position when the user click on the folder. using win 32 api ? any ideas ?
or I could reset the current folder to the original folder once the new folder displays it content but then I need to stop outlook displaying the content of the original folder and have no idea how to do this.
Cheers
Meb0134
A:
Ok, I found a way to resolve this issue.
Within the FolderSwitch Event, I create a NivigationFolder on the Favorites Pane for the Folder that I want to show (Instead of the folder the user clicks on) and then select the new NavigationFolder (NavigationFolder.Select = True) and then deselect (NavigationFolder.Select = False) and finally I delete the NavigationFolder from the Favorites pane.
This works perfectly even if the Favorites pane is off.
Mehdi Benkhaldi
| 2023-10-28T01:26:29.851802 | https://example.com/article/8517 |
Giovanni Francesco Lottini
Giovanni Francesco (Giovanfrancesco) Lottini (1512 – August 1572 ) was an Italian politician and writer.
Lottini was born in Volterra in 1512. In 1530 he was accused of having seriously injured a fellow resident of Volterra and put on trial. He was secretary of Cosimo I, but in 1542 officially was removed by the same Cosimo I for acts of sodomy, but remained in his service for shady dealings. In February 1548 Cosimo I sent him to Venice, but it was he who prepared the plot against Lorenzino de' Medici, who oddly enough, the very same month, was hit by two killers from Volterra.
Away again from Florence, Lottini moved to Rome where he became secretary of the Cardinal of Santa Fiora. On January 31, 1550 during a conclave, Cardinal Niccolò Ridolfi was poisoned and many blamed Lottini.
In 1552 he obtained from Pope Marcellus II an appointment as canon of Abbey Hill of Piedmont.
In 1555 he entered the papal court, opposing the election of Pope Paul IV, who suffered much. On August 10 he was shut up in the Castel Sant'Angelo.
In 1559 he was at the service of Giovanni Angelo de'Medici as a secretary, who became Pope Pius IV and appointed Lottini Bishop of Conversano in 1560. Lottini however, refused the assignment, instead taking up his wandering life.
Before his death (in Rome, in August 1572) Lottini gave his brother a treatise of considerations and personal notes on different themes, from the military to the care of physical life. The manuscript entitled Avvedimenti Civili was given by his brother to Girolamo, the brother of Francesco I de' Medici, Grand Duke of Tuscany, in 1574.
External links
Category:16th-century people of the Republic of Florence
Category:1512 births
Category:1572 deaths
Category:LGBT people from Italy
Category:16th-century Italian writers
Category:16th-century male writers
Category:16th-century LGBT people
Category:16th-century politicians | 2024-05-07T01:26:29.851802 | https://example.com/article/9816 |
Q:
Finding Unique Tuple and Column Permutations
I have a table of numbers which consists of various nums from range [0-9]
--------
| nums |
--------
| 0 |
| 1 |
| .... |
| 9 |
--------
I want to take the cartesian product of this table multiple times (in fact, 8 times to be precise):
SELECT * FROM numbers A, numbers B, numbers C, numbers D, ...
Such that A.nums and B.nums, ... are unique combinations together AND they are not equal to the same value another number is.
Here's some sample output I would want to see:
(0, 1, 2, 3)
(3, 2, 1, 0)
(2, 1, 3, 0)
(0, 2, 1, 3)
(0, 9, 8, 7)
(1, 2, 3, 4)
(1, 3, 5, 9)
(1, 9, 8, 7)
... BUT NO TUPLES like (0, 0, 1, 2), (1, 1, 2, 2), etc. Tuples should also not be repeated, such as (1, 2, 3, 4) and (1, 2, 3, 4)
Every value in the tuple must be different from another value in the tuple.
I'm sure there's a more efficient way of doing this, but I've resorted to A.nums != B.nums, ... for every single possibility. It seems relatively efficient; offering ~300 ms run-time for an 8-way cartesian product, but I would like to know if there's a simpler, more elegant solution with similar run-time.
A:
CREATE TABLE nums (x INT);
INSERT INTO nums (x) VALUES (0), (1), (2), (3), (4);
SELECT a.x, b.x, c.x, d.x
FROM nums AS a
JOIN nums AS b ON b.x NOT IN (a.x)
JOIN nums AS c ON c.x NOT IN (a.x, b.x)
JOIN nums AS d ON d.x NOT IN (a.x, b.x, c.x);
| 2023-11-10T01:26:29.851802 | https://example.com/article/2088 |
The World Of Kohler Bath Tubs And Faucets
The variety of Kohler bath tubs – drop in and soaking units is so big that choosing the unit which will match your bathroom becomes easier and …more accomplished as well. Really, how to understand which of the Kohler tubs is yours? It will be better if – before you start shopping you read about the difference between various types of Kohler bathtubs.
A soaking tub will be loved by those who take baths often, a walk-in bathtub referres to handicap constructions, but it may be used in any home – just for more convenience. Depending on the tub model you will need a Kohler bathtub faucet. To read about the variety of models offered by the company you can visit Kohler official site.
To buy the needed Kohler tub faucet go to any one of the stores the company co-operates with – Home Depot, for example. A very often chosen unit for free standing tubs is a classic Kohler Roman tub faucet. The store deals with different Kohler tub fillers. Some of these fillers are mounted to the floor, in this case their construction foresees the existence of a tall spout.
Wall mount models also exist, so that choose the variant which will be the best for your bathroom. In both cases the filler by this popular company will help you to fill in your tub quickly with the water of the temperature you love. No unwanted splashes and waterflows are guaranteed. | 2023-12-12T01:26:29.851802 | https://example.com/article/7263 |
Asynchronous Transfer Mode (ATM) is a very high-speed transmission protocol developed for transferring traffic (i.e., data) in networks. ATM uses data packets, called cells, for transporting and routing traffic through a network. The fixed size of ATM cells make networks that utilize ATM (hereinafter ATM networks) very versatile, supporting the transfer of a wide variety of different types of data, including raw data, voice data, video data, image data, multimedia data, and other types of data.
As data enters an ATM network, it is typically segmented (i.e., formed) into ATM cells by the ATM Adaptation Layer (AAL) present in either an ATM device, such as a switch or router, which are devices that relay and route traffic in the network. The cells travel through the ATM network in a cell stream. As the cells exit the ATM network, they are reassembled (i.e., reformed) into a native data format. ATM networks allocate bandwidth on demand, which is particularly important for traffic that has very little predictability such as telecommunication networks. For instance, when an end system device (i.e., source node) attempts to send data to another end system (i.e., a destination node) in an ATM network, the source node typically requests the establishment of a Virtual Connection (VC), which is referred to as a call. Before the call is accepted a determination is made by the network whether or not to accept the call by examining available network resources.
The objective of the network when establishing a call is to ensure that a requested Quality of Service (QoS) is maintained for a connection between a source node and a destination node (it is noted that while the terms ‘source’ and ‘destination’ denote a traffic flow direction, it is appreciated that ATM connections support bidirectional traffic flow, and accordingly the terms ‘source node’ and ‘destination node’ can be used interchangeably). Providing the desired QoS for various traffic types involves proper traffic management. If the call is accepted, the network forms an agreement with the source node. The agreement typically stipulates that the source node shall not to exceed the specified Peak Cell Rate (PCR) for the call. The amount of bandwidth allocated depends on the connection's specified traffic parameters (a.k.a. descriptors) and the type of QoS, and can vary from the Minimum Cell Rate (MCR) to the (PCR) of the call. Broadly ATM connections can be classified into Real time and Non-real time service categories. Real Time Service categories include Constant Bit Rate (CBR) and Variable Bit Rate Real Time (VBRrt), while Non-real time service categories include Variable Bit Rate Non-Real Time (VBRnrt), Available Bit Rate (ABR) and Unspecified Bit Rate (UBR).
Typical bandwidth allocation for Non-real time services is much less than its specified PCR and close to it's MCR, which allows for accommodating a lot more VC than the actual capacity of the link/node. This is known as oversubscription of a link/node. However, not all VCs may use network resources at the same time, which results in unused bandwidth (i.e. resource). Over-subscription thus allows some VCs now to burst traffic up to their PCR and utilize the statistical fluctuation of each VCs traffic load, and thus save bandwidth. Thus, over-subscription allows the non-real time connections to burst traffic at a rate higher than its assigned bandwidth or cell rate. In other words it is possible for a non-real time connection to burst traffic up to their PCR without suffering discard at their ingress due to Usage Parameter Control (UPC).
However, if all non-real time connections start sending traffic close to their PCR, then this may lead to congestion by overloading some network link/node egress. In such congested situations, connections that are sending traffic (intentionally or unintentionally) more than their Available Cell Rate (ACR) are considered misbehaving. Though it is not mentioned explicitly, it should be appreciated that each non-real time connection needs to be individually tracked and monitored using some form of per-VC queuing architecture in the ATM node, in order to analyze which connection is misbehaving and which is not.
Traffic congestion can prevent traffic from reaching its destination and cause significant degradation to the performance on the network. For example, cells sent by the source node can be dropped during transmission. If the destination node detects errors, such as recognizing the dropped cells, it will request that the source node rebroadcast the transmission. This has a recursive effect as it results in more traffic being sent across the ATM network, creating even more congestion, which can make the congestion problem worse. Eventually, a disruptive phenomenon can propagate across the ATM network, overloading available resources with traffic cells, which are dropped as retransmissions occur. Eventually cells are retransmitted onto the network and may overlap with previous retransmissions, which causes further data backup and more cells to be dropped, yet again. Accordingly, traffic congestion can cause a network to fail if not dealt with through proper traffic management, and in particular proper congestion control.
Attempts have been made to control congestion in ATM networks. Congestion control can be applied at the call level and cell level. At the call level, Connection Admission Control (CAC) is applied to perform access admission control in deciding whether or not accept the call into the network by evaluating the resources required carefully to meet the QoS objective of the call by examining available network resources. Congestion control schemes applied at the cell level can be applied both at the “ingress” of the node and at the egress of each ATM node.
Usage Parameter Control (UPC), or in other words, traffic enforcement or policing, is a set of defined corrective actions (i.e. selective discard of the violating cells or tagging violating cells that could be discarded in downstream nodes if necessary) taken by an ATM network at the ingress of the virtual circuit or virtual path level to protect network resources from malicious as well as unintentional misbehavior, by detecting violations of negotiated traffic contracts, such as sending traffic more than the specified PCR. However, as discussed previously in context of network node oversubscription, a connection may be sending traffic within the connection's PCR and thus may be conforming to the connection's UPC but may still contribute to congestion at some intermediate network node egress. In such situations congestion control is applied at the congested egress.
Open Loop Flow Control is one such approach used to regulate the traffic locally by decreasing (a.k.a. throttling) the outgoing (i.e. egressing) traffic rate of the misbehaving connection by restricting the egressing (i.e. outgoing) traffic for that connection and discarding the excess traffic at the congested node. Though this mechanism is useful in preventing congestion from further percolation in the downstream direction, it lacks the ability to regulate traffic flow at the very source of the connection.
Closed Loop Flow Control addresses the limitation of the Open Loop Flow Control as in this mechanism sources of congestion are informed about the congestive state of the network through feedback and are requested to decrease their input rate. The main advantage of a feedback mechanism is that if a certain node in a network is congested, then the congestion can be moved from the node experiencing traffic congestion (referred to as the “point-of-congestion”) back to the source of the congestion.
Often to relieve a point of congestion in a faster manner, certain congestion control techniques do not discriminate between conforming and non-conforming connections and may force overall reduction in cell transfer rate at the congested node. This penalizes the non-misbehaving connections by forcing them to reduce their overall cell transfer rates, even though they may not be misbehaving.
Other congestion control mechanisms for ATM networks have been developed or proposed to perform congestion control, such as cell buffering techniques, cell disposal policing techniques, artificial intelligence prediction techniques, and various other congestion control techniques. Most, if not all of these congestion mechanisms, either reduce the cell rate of nodes in a call's particular connection path or link to alleviate congestion or perform other procedures that degrade the overall performance of networks and do not consider unutilized resources across the entire network. | 2024-05-17T01:26:29.851802 | https://example.com/article/8461 |
Q:
Using parseincludes in Laravel5 Fractal
Struggling using parseIncludes in https://github.com/thephpleague/fractal.
I have two tables, Property and Weeks. Each property has many weeks. Using Fractal I can return my property item with a collection of weeks. What I want to do is use parseIncludes, so that the return of weeks is optional.
PropertyTransformer.php
<?php
namespace App\Transformer;
use App\Models\Property;
use League\Fractal\TransformerAbstract;
class PropertyTransformer extends TransformerAbstract
{
protected $availableIncludes = [
'week'
];
public function transform(Property $property)
{
return [
'id' => (int) $property['PropertyID'],
'PropertyName' => $property['PropertyName'],
'ExactBeds' => (int) $property['ExactBeds'],
'weeks' => $property->week
];
}
/**
* Include Week
*
* @return League\Fractal\ItemResource
*/
public function includeWeek( Property $property )
{
$week = $property->week;
return $this->item($week, new WeekTransformer);
}
}
WeekTransformer.php
<?php
namespace App\Transformer;
use App\Models\Week;
use League\Fractal;
class WeekTransformer extends Fractal\TransformerAbstract
{
public function transform(Week $week)
{
return [
'Week' => $week['week'],
'Available' => $week['available'],
'Price' => (int) $week['price'],
];
}
}
My PropertyController.php
<?php namespace App\Http\Controllers\Api\v1;
use App\Http\Requests;
use App\Models\Week;
use Illuminate\Support\Facades\Response;
use App\Models\Property;
use League\Fractal;
use League\Fractal\Manager;
use League\Fractal\Resource\Collection as Collection;
use League\Fractal\Resource\Item as Item;
use App\Transformer\PropertyTransformer;
class PropertyController extends \App\Http\Controllers\Controller {
public function show($id)
{
$property = Property::with('bedroom')->with('week')->find($id);
$fractal = new Fractal\Manager();
if (isset($_GET['include'])) {
$fractal->parseIncludes($_GET['include']);
}
$resource = new Fractal\Resource\Item($property, new PropertyTransformer);
//$resource = new Fractal\Resource\Collection($properies, new PropertyTransformer);
return $fractal->createData( $resource )->parseIncludes('weeks')->toJson();
}
I get the following error on the parseIncludes:-
Method 'parseIncludes' not found in class \League\Fractal\Scope
I'm following the guide here on transformers - http://fractal.thephpleague.com/transformers/
I think I am going wrong somewhere here where it says:-
These includes will be available but can never be requested unless the Manager::parseIncludes() method is called:
<?php
use League\Fractal;
$fractal = new Fractal\Manager();
if (isset($_GET['include'])) {
$fractal->parseIncludes($_GET['include']);
}
If I remove the parseIncludes, I don't get an error, I also get my property data with my collection of weeks, but ?include=week doesn't work to optionally get it.
A:
Your problem is in this line:
return $fractal->createData( $resource )->parseIncludes('weeks')->toJson();
createData() returns \League\Fractal\Scope and it has no parseInlcudes method.
You've already called parseIncludes here:
if (isset($_GET['include'])) {
$fractal->parseIncludes($_GET['include']);
}
So just remove the second call to it in the return statement:
return $fractal->createData($resource)->toJson();
| 2024-02-23T01:26:29.851802 | https://example.com/article/5275 |
PROFILE OF THE BACHELOR PROGRAM OF ACCOUNTING
To become a pluralist, enduring, and trustworthy academic community with high competitive edge and work ethics, independence and competitive mastery of accounting and business knowledge, guided by Christian values.
Mission
To implement the three duties of educators (Education, Research, and Community Service) in the field of accounting based on competitiveness and in comprehensible and professional manners, guided by Christian values.
To develop and disseminate accounting science in accordance with the developments in the implementation of information technology in the field of accounting, in more innovative and creative manners.
To professionally manage the accounting department in order to form students into graduates with competitive edge, good work ethics, independence, and mastery of accounting knowledge and skills.
Objectives
To form students into individuals with good morality and integrity, strong democratic values, tolerance, and virtues, in the implementation of accounting knowledge.
To produce graduates with competitive edge, mastery of accounting knowledge and information technology, professionalism, creativity, innovative mind, readiness to take responsibility, and independence.
ACCOUNTING DEPARTMENT MAJORS:
Financial Accounting Major
Competence point: able to comprehend and explain accounting practices either manually or in computerized form, and present them in the form of periodical statements, either in Bahasa Indonesia or in English, based on financial accounting standards, to corporations, whether individually-owned, partnerships, or limited liability, and to cooperatives, in the areas of private or state enterprises, government agencies, as well as other public sectors.
Competence: able to comprehend and explain the steps in the preparation of systems and procedures in the development of an accounting system.
Taxation Major
Competence point: able to comprehend and explain tax calculation processes, understand the tax provisions and procedures involved in the preparation of fiscal financial statements.
Accounting Graduates Profile
Graduates of the Accounting Department should have basic mastery, i.e. possess sufficient knowledge and skills required to solve accounting problems, as well as uphold ethics and professionalism in the field of accounting consisting of Financial Accounting, Accounting Inspection, Accounting System and Taxation majors. | 2023-10-20T01:26:29.851802 | https://example.com/article/9042 |
Overexpression in Escherichia coli and affinity purification of chick kidney ferredoxin.
Vertebrate ferredoxins are 12-14-kDa iron-sulfur proteins, some of which transfer electrons to mitochondrial cytochrome P450s. The function of many of these cytochrome P450s is to catalyze stereospecific hydroxylation of endogenous steroids. As part of our interest in the kidney mitochondrial 1 alpha-hydroxylation of 25-hydroxyvitamin D3, we have constructed an expression plasmid coding for a fusion protein containing the chick kidney ferredoxin. We subcloned chick kidney ferredoxin cDNA, obtained from our vitamin D-deficient chick kidney library by polymerase chain reaction (Brandt, M. E., Gabrik, A. H., and Vickery, L. E. (1991) Gene (Amst.) 97, 113-117) into Qiagen's pQE9, which contains an N-terminal 6xHis tag (peptide sequence for 6 adjacent histidines present in the recombinant proteins). The coding sequence was preceded by a factor Xa cleavage site. The resulting plasmid, pQTcFdx, was overexpressed in Escherichia coli, and the soluble fusion protein was purified from the cell lysate in one step by Ni(II)-nitrilotriacetic acid-agarose chromatography. We obtained 7-10 mg of greater than 99% homogeneous fusion protein from a 1-liter culture and 4-6 mg of mature ferredoxin cleaved by factor Xa. The fusion protein possessed an absorption spectrum and an electron paramagnetic resonance spectrum quantitatively indistinguishable from those published for ferredoxin purified from adrenal glands and placenta or expressed in E. coli with another vector. The fusion protein was active in supporting the 1 alpha-hydroxylation of 25-hydroxyvitamin D3 in a reconstitution assay of a solubilized, partially purified preparation of cytochrome P450 from vitamin D-deficient chick kidney. We conclude that the procedure described here is an efficient way to produce and purify vertebrate ferredoxin; the [2Fe-2S] cofactor is assembled in vivo and effectively incorporated into the fusion protein in E. coli; slight alterations at the N terminus do not alter incorporation of the [2Fe-2S] cofactor or the biological activity of ferredoxin, and post-translational modifications, such as phosphorylation, are not an absolute requirement for ferredoxin electron transporting activity. The recombinant ferredoxin can be used for physical studies and other structure-function studies. | 2024-06-15T01:26:29.851802 | https://example.com/article/3051 |
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using Newtonsoft.Json;
using Newtonsoft.Json.Linq;
namespace VkNet.Utils.JsonConverter
{
/// <summary>
/// Vk Collection Json Converter
/// </summary>
public class VkCollectionJsonConverter : Newtonsoft.Json.JsonConverter
{
/// <summary>
/// Инициализация
/// </summary>
/// <param name="collectionField"> Collection Field </param>
public VkCollectionJsonConverter(string collectionField)
{
CollectionField = string.IsNullOrWhiteSpace(collectionField) ? "items" : collectionField;
}
/// <inheritdoc />
public VkCollectionJsonConverter() : this("items")
{
}
/// <summary>
/// Количество
/// </summary>
private static string CountField => "count";
/// <summary>
/// Поле с коллекцией данных
/// </summary>
private string CollectionField { get; }
/// <summary>
/// Сериализация объекта в Json
/// </summary>
/// <param name="writer"> Json writer </param>
/// <param name="value"> Значение </param>
/// <param name="serializer"> Сериализатор </param>
/// <exception cref="NotImplementedException"> </exception>
public override void WriteJson(JsonWriter writer, object value, JsonSerializer serializer)
{
var vkCollectionType = value.GetType();
var vkCollectionGenericArgument = vkCollectionType.GetGenericArguments()[0];
var toListMethod = typeof(Enumerable).GetMethod("ToList");
if (toListMethod == null)
{
return;
}
var constructedToListGenericMethod = toListMethod.MakeGenericMethod(vkCollectionGenericArgument);
var castToListObject = constructedToListGenericMethod.Invoke(null, new[] { value });
var vkCollectionSurrogate = new
{
TotalCount = vkCollectionType.GetProperty("TotalCount")?.GetValue(value, null),
Items = castToListObject
};
serializer.Serialize(writer, vkCollectionSurrogate);
}
/// <summary>
/// Преобразование JSON в VkCollection
/// </summary>
/// <param name="reader"> Json reader </param>
/// <param name="objectType"> Тип объекта </param>
/// <param name="existingValue"> Существующее значение </param>
/// <param name="serializer"> Seerilizer </param>
/// <returns> </returns>
/// <exception cref="TypeAccessException"> </exception>
public override object ReadJson(JsonReader reader, Type objectType, object existingValue, JsonSerializer serializer)
{
if (!objectType.IsGenericType)
{
throw new TypeAccessException();
}
if (reader.TokenType == JsonToken.Null)
{
return null;
}
var keyType = objectType.GetGenericArguments()[0];
var constructedListType = typeof(List<>).MakeGenericType(keyType);
var list = (IList) Activator.CreateInstance(constructedListType);
var vkCollection = typeof(VkCollection<>).MakeGenericType(keyType);
var obj = JObject.Load(reader);
var response = obj["response"] ?? obj;
var totalCount = response[CountField].Value<ulong>();
var converter =
serializer.Converters.FirstOrDefault(x => x.GetType() == typeof(VkCollectionJsonConverter)) as
VkCollectionJsonConverter;
var collectionField = CollectionField;
if (converter != null)
{
collectionField = converter.CollectionField;
}
foreach (var item in response[collectionField])
{
list.Add(item.ToObject(keyType));
}
return Activator.CreateInstance(vkCollection, totalCount, list);
}
/// <summary>
/// Может преобразовать
/// </summary>
/// <param name="objectType"> Тип объекта </param>
/// <returns> <c> true </c> если можно преобразовать </returns>
public override bool CanConvert(Type objectType)
{
return typeof(VkCollection<>).IsAssignableFrom(objectType);
}
}
} | 2024-07-03T01:26:29.851802 | https://example.com/article/4128 |
A joint meeting with the Maudsley Philosophy Group in association with the London Division of the Royal College of Psychiatrists
The year 2013 marks the centenary of the publication of Jaspers’ General Psychopathology; a text that has had an immense influence on psychiatry. Jaspers was both a psychiatrist and one of Europe’s leading philosophers.
The centenary will give us an opportunity to review the foundations and ongoing relevance of phenomenological psychopathology in the era of genome mapping and explosion of neuroscience. Have Jaspers’ formulations been fully taken advantage of and incorporated in today’s understanding and treatment of mental illness or have valuable insights been lost? How do we integrate the domains of “understanding” and “causation” at a time when both knowledge and society are changing with increasing speed?
This conference will energetically return to the big themes of Jasperian psychiatry, testing them against current knowledge and contemporary debates. The conference will be suitable for psychiatrists, philosophers, psychotherapists, psychologists, social scientists and others.
Educational objectives
* Review the history and enduring relevance of Jaspers’ General Psychopathology and philosophy to contemporary psychiatry and mental health service provision
* Study the contribution of diverse responses to the phenomenological approach to the understanding of mental life and psychopathology, including the meaning and uses of empathy and social dimension of mental illness
* Integrate phenomenological, psychotherapeutic and neuroscience approaches to the assessment and treatment of mental illness and recovery
The full programme is available here. Early bird booking deadline: Tuesday 10 September 2013. | 2023-12-31T01:26:29.851802 | https://example.com/article/3087 |
---
abstract: 'Multi-layer optical film has been found to afford important applications in optical communication, optical absorbers, optical filters, etc. Different algorithms of multi-layer optical film design has been developed, as simplex method, colony algorithm, genetic algorithm. These algorithms rapidly promote the design and manufacture of multi-layer films. However, traditional numerical algorithms often converge to local optimum. This means that these algorithms can not give a global optimal solution to the material researchers. In recent years, due to the rapid development of artificial intelligence, to optimize optical film structure using AI algorithm has become possible. In this paper, we will introduce a new optical film design algorithm based on the deep Q learning. This model can converge the global optimum of the optical thin film structure, this will greatly improve the design efficiency of multi-layer films.'
address: |
Graduate school of IPS, Waseda University, Fukuoka 8080135, Japan\
Department of Optical Science and Engineering, Fudan University, Shanghai, 200433, People’s Republic of China
author:
- 'A.Q. Jiang, Osamu Yoshie, and L.Y. Chen'
bibliography:
- 'OSA-template.bib'
title: 'A new multilayer optical film optimal method based on deep q-learning'
---
Introduction
============
After the 1970s, with the development and application of computer technology and various numerical optimization techniques. Many traditional numerical optimization algorithms, such as linear programming, simplex method, least square method, damped least squares method were applied to the design of optical thin film. In which the least square method was the most successful application. The shortages of this several method are, this methods are focus on find the local optimum value of the film coating. The optical film researchers also developed a variety of global optimal methods that can be optimized in the film structure. Tikhonravov, Alexander V., and Michael K developed a optical coating design software system based on needle optimization technique. [@tikhonravov1994development] Sullivan, Brian T., and J. A. Dobrowolski. implemented the needle optimization method, and improve design system performance, The improved needle algorithm can not only define very complex evaluation functions but also can be used in many forms to calculate and design, It made the design of optical thin film becomes more flexible.[@sullivan1996implementation] C.P. Chang and H.Y. Lee apply the GSAM(generalized simulated-annealing method) thin-film system design and find that there is no local minimal trapping problem in 1990.[@chang1990optimization]. Martin, S applied genetic algorithms to the design of three very different optical filters.[@martin1995synthesis] In recent decade, this field researcher develop the optical coating optimization system based on several model as, GA, ant colony algorithm, particle swarm optimization and so on.[@paszkowicz2013genetic][@tang2006coating][@guo2014design]
In past several years, machine learning was widely used in many research field, as computer vision, automatic robot, medical, finance, etc. It make a big change for our society. [@michalski2013machine] Thanks to the growth of computing power, many deep learning methods have been developed by scientists and researchers to solve problems in various fields. The deep reinforcement learning(DRL) is a successful method, which refers to goal-oriented algorithms. It means DRL could learn how to attain a complex objective (goal) or maximize along a particular dimension over many steps.[@mnih2015human] The famous application of DRL is Alpha-Go.[@Silver2017Mastering] This research use a deep q network, one kind of a deep reinforcement learning method, to optimal the optical coating. We optimal 2 different optical coating(anti-reflection film and solar selective absorption film) use our proposed method to measure the effectiveness of this method in this paper.
Deep Q learning
===============
Deep Q learning combines reinforcement learning with a class of artificial neural network known as deep neural networks. There are two basic elements of reinforcement learning: Agent and Environment. Agents act to influence the environment, and then the environment return a feedback to the agent. According this feedback the to decide the next action. Fig.1 is a schematic diagram of the process of reinforcement learning
![Reinforcement Learning process[]{data-label="fig_brain_env"}](picture/brain_env.png){width="10cm"}
Markov decision process
-----------------------
It is called Deep Q learning, because the author used a deep neural network to replace a Q-table. Q-table the kernel method in Q learning[@Watkins1989Learning]. In short, deep Q learning develops control patterns by providing feedback on a model’s selected actions, which makes the model to select better actions in the next step.
Q-learning is a solution to a Markov decision process. A Markov decision process is defined by an agent, performing in an environment by means of actions, as showed in Fig.2. The environment can be in different states. Markov decision process is a 4-tuple $(S, A, P_{\alpha}, R_{\alpha})$. $S$ is a finite set of states, $A$ is a finite set of actions, $P_{\alpha}$ is a transition probabilities, that action $\alpha$ i state $s$ at time $t$ change to state $s_{'}$ at time $t+1$. $R$ is the reward received, when state $s$ transfer to state $s_{'}$ under the influence of action $\alpha$.[@Bellman1957A][@Altman1995Constrained]
![Example of a simple MDP with three states(green circles) and two actions(orange circles), with two rewards(orange arrows)[]{data-label="MDPs"}](picture/MDPs.png){width="7cm"}
The set of states and actions, together with rules for transitioning from one state to another and for getting rewards, make up a Markov decision process. One episode of this process forms a finite sequence of states, actions and rewards: $$s_{0}, a_{0}, r_{1}, s_{1}, a_{1}, r_{2}, s_{2}, …, s_{n-1}, a_{n-1}, r_{n}, s_{n}$$ Here $s_{i}$ is the state, $a_{i}$ is the action and $r_{i+1}$ is the reward after performing the action. The episode ends with terminal state $s_{n}$
Discounted Future Reward
------------------------
Considering the long-term situation, not only immediate reward need to be token into account, but also the future awards should be considered. The total reward for one episode in a Markov decision process could be easily calculate as: $$R=r_{1}+r_{2}+r_{3}+…+r_{n}$$ The total future reward from time $t$ could be expressed as: $$R_{t}=r_{t}+r_{t+1}+r_{t+2}+…+r_{n}$$ Because our environment is stochastic, if every step of action will make a same reward. For long-term situation, it may diverge. For that reason it is common to use discounted future reward instead: $$R_{t}=r_{t}+\gamma (r_{t+1}+\gamma (r_{t+2}+…))=r_t+\gamma R_{t+1}$$
Here $\gamma$ is the discount factor between 0 and 1. The more into the future the reward is, the less we take it into consideration. It is easy to see, that discounted future reward at time step t can be expressed in terms of the same thing at time step $t+1$.
Q-learning
----------
Q learning is a model, which approximates the maximum expected return for performing an action at a given state using an action-value Q function. It represents the discounted future reward when we perform action $a$ in state $s$.The Q function is defined as, $$Q(s,\alpha) = r + \gamma max(Q(s^{'}, \alpha^{'}))$$ where $r$ is the reward that was providing feedback from environment, $s$ is the state, $\alpha$ is the action, $\gamma$ is learning rate, and $Q(s^{'}, \alpha{'})$ comes from predicting the Q function for the next state using our current model.The main idea in Q-learning is that we can iteratively approximate the Q-function using the Bellman equation. In the simplest case the Q-function is implemented as a table, with states as rows and actions as columns. This talbe is called q-table.
Deep Q-network
--------------
The state of the real situation may be infinite, so that q-table will be infinite. It means the even a supercomputer also can’t calculate the solution of this q-table, when the data or environment is complex. As we know, neural networks are good in optimal highly structured data. We could represent our Q-function with a neural network, that takes the state and action as input and outputs the corresponding Q-value. Fig.3 shows the transformation of Q-learning to deep Q-learning.
![Top: The Q-learning model. Bottom: the deep Q-network, used in DeepMind paper.[]{data-label="DQN"}](picture/dqn.png "fig:"){width="2.5in"} .
Loss functions
--------------
In most parts of training process, Q-values can be any real values or any real integer. It determines by the model you want to optimize. So the neural network of deep Q-learning can be optimized with a simple squared error loss. $$Loss=\frac{1}{2}[r + \gamma max_{a'}Q(s',a')-Q(s,a)]^2$$ $r + \gamma max_{a'}Q(s',a')$ represents the target value. $Q(s,a)$ represents the prediction value.
Experience reply
----------------
Because the we use neural network to approximate the Q-table in Deep Q-learning, so it is not stable in many situation. It will cause the model can not converge or converge to the local optimal value. There are several way to solve this problem. The experience replay is one of the most useful way. When training the neural network, We use random mini-batch from the memory to instead of the recent transition. This breaks the similarity of the training samples, which make our network into a local minimum.
Exploration exploitation
------------------------
As the temperature in annealing algorithm, a higher freedom in selecting actions at the beginning is necessary. The model will random select action with probability $\epsilon$.The $\epsilon$ will between 0.1 to 1, and it will decrease with the training process. This technology allows the model to converge faster and avoid convergence in the local optimal.
Update algorithm
----------------
Combining the above methods, the Q-network can be optimized as follow algorithm:
\[alg:DQN\]
initial the memory $D$ initial the $Q$ network with random weights $w$ select a random action $a_{t}$ with probability $\epsilon$, otherwise select $a_{t} = argmax_{a}Q(s, a)$ Execute action $a_{t}$ in the system environment, observe reward $r_{t+1}$ and new state $s_{t+1}$ Store transition $<s_{t}, a_{t}, r_{t+1}, s_{t+1}>$ in memory $D$ Sample random mini-batch from $D:<s_{j}, a_{j}, r_{j},s_{j}^{'}>$ Set $Q_{j} = r_{j} + \gamma max_{a}Q(s_{j}^{'}, a{j}^{'})$ Gradient descent step with a simple squared error loss.
Application to the Multi-layer Systems
======================================
To apply deep Q-network on multi-layer film optimize, we define the state, action, and reward of multi-layer system.
States
------
There are several different layer in one multi-layer optical film, each layer have different thickness and different thickness. We define the layer thickness of multi-layer optical film as a state in the optimal system, as: $$s=Th_{1}, Th_{2},..,Th_{n}$$ For example, in a 4 layer solar absorber film, which structure is $SiO2(90nm)/Cr(10nm)/SiO2(80\\nm)/Al(\geq200nm)$.We will define the state as an array*\[90,10,80\]* . This array value is according the thickness of each layer.The $Al$ layer is a layer which keep transmission equal to zero in solar absorber film. To reduce the calculation, the $Al$ layer will be ignored.
Actions
-------
Inspiration from the needle algorithm, the actions defined as increasing or reducing the thickness of one layer in the film coating. The minimum thickness change is determined by the design precision of the film coating. For example, in a $n$ layers film coating with a design accuracy of 0.01 nm, the action will be defined as: $$A=\{a_{1}, a_{2},..,a_{n}\}$$
$a_{n}$ represents the action on each layers. In this situation $a_{n}$ contains 6 values, each value is an action on the layer $n$ in this film coating. $$a_{n}=\{x|\pm x=10^{-K}, 0\geq K\geq N, K\in Z^{+}\}$$
$N$ represents the precision level of this film coating. In this case,the $N$ is equal $3$, that $a_{n}$ will equal ${\pm 1,\pm 0.1,\pm 0.01}$. We choose several different thickness change is aim to speed up the convergence speed while guaranteeing the accuracy. It’s very easy to understand, an action $a_{n} = 1$ will save a hundredfold of the time compared with $a_{n}=0.01$
Reward
------
Before define the reward, the aim function of film coating optimal should be defined at first. There are three parameters, transmission $T$, reflection $R$, absorption $A$, are focused in the design of optical film coating design. The reward in our film coating optimal system is defined as 3 value, as: $$Aim = w_{T}T + w_{R}R + w_{A}A$$
$w_{T},w_{R}, w_{A}$ represent the weights of three parameters. This three weights determined by type of optical thin film. For example, the weights will defined as $w_{T}=0,w_{R}=-1,w_{A}=1$ during designing the solar selective absorber. Because influence of transmission can be ignored, and film need higher absorption and smaller reflection. $$r_{t} = \begin{cases}
0, \text{not find a better value in past 50 steps} \\
-1, \text{aim optical parameters is lower threshold value} \\
Aim_{best} - Aim_{t}, {other situation}
\end{cases}$$
We define a stop search mechanism, when the system not search a better result in several steps. It has the chance to reduce the convergence probability of the model, but it can get the best value after all. Compared with other application of deep Q-learning, our system pays more attention to finding the best solution.
Neural network structure
------------------------
Considering the number of actions, we use a two layers full connect neural network in our deep Q-network. Each layer has 80 units.We will random initialize this network. The learning rate will fade with the training of the network.
Experiments
===========
In this part, we will show the application performance in 2 different optical coatings(solar selective absorber and high reflection film).
Solar selective absorber
------------------------
First we apply deep Q-learning model on $300nm$-$1500nm$ solar selective absorber. 4-layers, 6-layers film structure is very famous structure in solar selective absorber. The materials of film coating use $Ti$ and $SiO_2$. The substructure will use $200nm$ $Cu$. The thickness is initialized with $50nm$ for each layer.
layer material 4-layers 6-layers 8-layers
------------ ----------- ---------- ---------- ----------
0 Air - - -
1 $SiO_{2}$ 132.4 126.0 63.19
2 $Ti$ 13.74 6.46 3.47
3 $SiO_{2}$ 77.5 73.37 71.46
4 $Ti$ - 12.98 6.19
5 $SiO_{2}$ - 54.56 65.84
7 Ti - - 12.45
8 $SiO_{2}$ - - 52.4
Sub $Cu$ 200 200 200
Absorption 87.4% 90.15% 91.18%
: Solar selective absrober coating after optimized
{width="8cm"}
The Table 1 and Fig.4 shows the optimal result of film coating. The initial thickness of each layer could be random. But we do not hope you initialize it very large, it will make you cost many time to get the final good optimal result. In experiments, if the initial film coating is very close to the optimal result it will find the best result very fast. By contrast, it costs much time. But in the end, it will find best optimal result almost irrelevant to the initial value.
Anti-reflection film
---------------------
Anti-reflection film is also a very important application in optical film. The anti-reflection film applies on camera lens, solar absorber and so on. In this part, we test a $ZnS$ and $MgF_{2}$ anti-reflection film on $400nm$ to $700nm$. In this experiments, the precision of design is $1nm$. The initial thickness of each layer is $30nm$.So the number of actions is come to equal 18 (9 layers time 2 action of each layer). We compared the result with another optimal technique: GA.
layer material DQN GA
-------------- ----------- ------- -------
0 Air -
1 $MgF_{2}$ 96 90
2 $ZnS$ 27 23
3 $MgF_{2}$ 14 16
4 $ZnS$ 70 71
5 $MgF_{2}$ 22 20
7 $ZnS$ 24 26
8 $MgF_{2}$ 43 40
9 $ZnS$ 7 3
Sub $SiO_{2}$ - -
Reflection 4.5% 5.9%
transmission 94.0% 92.7%
: Anti-reflection film coating after optimized
According the experiments, we could know the Deep Q-learning could find better solution compare with GA in same situation. The spectral curve shows in Fig.5. The reflection distribution of DQN is more uniform.
{width="14cm"}
Conclusion
==========
This paper provides a new method for numerical optimization of optical thin film design. This new method combines machine learning and optical thin film computing. Compared with previous research in the same field, this algorithm has higher search space and better search results. This algorithm can reach the search scope of needle algorithm and the local search precision of GA algorithm.
In our experiments, the initial thickness of the optical thin film could be random. This means that researchers can select materials and perform parallel operations on a large scale according to their requirements. This will greatly improve the efficiency of finding the target film.
Acknowledgment
==============
The authors would like to thank Prof.Chen from FuDan Univ. and Prof.Yoshie from Waseda Univ.. These two professors give me a lot of research advice and provided me with a good research environment. The optical film computation part is based on C. Marcus Chuang’s open source project [@OpticalModeling]. MorvanZhou give us a great hello wolrd demo of deep Q-learning[@Morvan]. The optical constant data is search from refractive index.info this website built by Mikhail Polyanskiy[@RefrectInfo]. In the end, I want to thank all those who have given me help in the study of life.
| 2024-05-07T01:26:29.851802 | https://example.com/article/4178 |
What this paper adds {#FPar11}
====================
Mental workload in rater-based assessment is speculated to negatively influence rating quality yet the implications of intervening to reduce mental workload are unknown. The literature to date provides differing theoretical perspectives (Cognitive Load Theory, Information Processing Theory) regarding the influence of mental workload in assessment but empirical data are lacking. This critical narrative review bridges theory to practice by identifying, synthesizing, and evaluating the available empirical evidence that reports interventions targeted to reducing mental workload in rater-based assessment.
Introduction {#Sec2}
============
The era of competency-based health education has resulted in high assessment burdens \[[@CR1], [@CR2]\]. The advent of new assessment contexts, such as the objective structured clinical examination (OSCE), in-training evaluation of clinical skills, and now entrustable professional activities (EPAs) place high demands on students but are also demanding of the assessors who must observe, synthesize, and ultimately judge performance \[[@CR3], [@CR4]\]. Assessors are being asked to complete checklists, rubrics, rating scales, and write comments relating to the tasks, competencies, or activities being assessed. At times, these assessment procedures can encompass multiple tasks, competencies, or activities within one observation occurrence or require assessors to disentangle student performance across these tasks, competencies, or activities after extended periods of clinical observation \[[@CR5], [@CR6]\]. This results in high cognitive demands from the assessor, which can be further compounded by complexity embedded within assessment tools or forms \[[@CR7]\].
The problem of assessment burden in the education of health professionals is well documented, yet solutions seem to be few and far between \[[@CR3]\]. Increasing demands from accrediting and professional bodies for programs to provide evidence that graduates are achieving intended competencies or program learning outcomes is resulting in a heavy reliance on rater-based assessment, especially within the context of clinical training \[[@CR8], [@CR9]\]. The high burden imposed by competency-based assessment, especially in a summative context, may increase assessors' reliance on memory and impair their ability to provide accurate and meaningful feedback for student performance \[[@CR10], [@CR11]\]. Despite widespread recognition of this problem across health professions education, no clear answer exists regarding the best approach to reduce the burden of assessment and improve the quality of ratings we receive from our assessors \[[@CR3]\].
Throughout the past six years, there has been an increase in the amount of literature attempting to better understand assessor burden and to explore the effects of interventions aimed to improve assessment quality. The theoretical underpinnings that appear to be driving this research relate to assessors' mental workload, the cognitive load experienced by assessors during an assessment task, and the cognitive processes required to complete the assessment task \[[@CR5], [@CR12], [@CR13]\]. Tavares and Eva originally proposed that relating perceptual load theory, cognitive load theory, and information processing theory to clinical performance ratings may help to improve rating quality \[[@CR5]\]. More specifically, these authors suggest that the effort, or load, required for rating tasks should be evaluated and aligned with cognitive capacity. It is proposed that reducing competing demands and/or reducing complexity of the rating task may result in higher quality ratings. Others have proposed differing perspectives. Wood (2013) argues that it may be less about finding the 'bottleneck' in terms of the cognitive demand or complexity but more about the cognitive *processes* that are required for raters to make judgments and that modifying the rating tasks may influence how raters actually perform what they are required to do \[[@CR12]\]. Despite differences in these perspectives, a common thread is that there seems to be agreement that mental workload may influence rating tasks.
Given the importance of mental workload in rater-based assessments, targeted interventions to reduce workload may improve rating quality. According to cognitive load theory, there may be three different types of mental workload to consider: intrinsic, extrinsic, and germane. Intrinsic load has been described as the complexity of the task, which is measured by the extent of association between the learner's expertise and the nature of the task. From the context of an assessor, examples of intrinsic load may include recalling the scenario or evaluating various competencies at one time \[[@CR5]\]. Extraneous load is defined as the load that is imposed due to poor instructional design or other factors that divert the attention away from the learning environment. Assessors may be exposed to this type of load when given an assessment tool that is not clear or when asked to perform secondary assessment tasks, such as assessing the performance of a simulated actor or being responsible for operating timers or audiovisual aids during an assessment \[[@CR5]\]. Germane load has been explained as the cognitive effort necessary for learning, which differs from the interference nature of both intrinsic and extrinsic load. Germane load intentionally imposes a cognitive effort that changes the nature of the task to enhance the learning process. In assessment, this simply means the mental effort that the assessor dedicates to the rating task \[[@CR5]\]. Each of these types of load may be the target of interventions to reduce mental workload and improve assessment quality.
Given the amount of empirical data now published in medical education relating to mental workload and assessment, the objective of this critical narrative review was to summarize the findings of existing empirical research on assessors' cognitive load within the health professions.
Methods {#Sec3}
=======
This was a critical narrative review of published literature in health professions education. A critical narrative review was conducted due to the nature of the objective (i.e. focus on empirical studies), and the diversity of study designs known to address this phenomenon \[[@CR14]\]. A search of PubMed, EMBASE, and Google Scholar without date limits until March 2019 was conducted using the search terms mental workload, cognitive load, mental capacity, evaluation fatigue, rater fatigue, and assessment. Search terms were extracted from key studies known to the authors in the field of mental workload and assessment. Search terms were combined with OR, aside from assessment, which was combined with all other search terms using AND. All search terms were limited to Title/Abstract. Search results were limited to those published in English. The electronic search was supplemented with a manual search of the reference lists from identified relevant studies and/or review articles. Articles were screened for eligibility independently by two investigators. Articles were eligible if they reported results of interventions aimed at measuring mental workload in health professions education assessment or interventions aimed at reducing mental workload associated with assessment tasks in health professions education. Conference abstracts were excluded. Discrepancies between investigators inclusion of an article were resolved by discussion. Data were extracted from each included article using an extraction spreadsheet. Extraction points included author, title, year of publication, aims, population, context/setting, interventions, outcomes, and results. One investigator (BP) extracted all data and the second investigator verified the data (KW). Both investigators met via videoconference on multiple occasions over a 3-month period to discuss articles and interpret findings.
Results {#Sec4}
=======
Electronic database searching resulted in 672 hits, of which 18 were identified through title and abstract screening for full-text review. An additional 3 articles were identified from manual searching of reference lists. After full-text review, we identified 6 studies that reported empirical interventions aimed to reducing mental workload within the context of medical education and met our inclusion criteria \[[@CR15]--[@CR20]\]. The search strategy is outlined in Fig. [1](#Fig1){ref-type="fig"}.Fig. 1Flow chart of included studies
A key concept that must be identified before reviewing the studies is that of measurement of mental workload. The studies identified used two different approaches. First, workload was measured subjectively using the NASA Task Load Index (TLX) instrument. The NASA-TLX subjective workload questionnaire is a subjective, self-reported, multidimensional assessment that rates a participant's perceived workload on a given task \[[@CR21]\]. Secondly, workload was measured using performance data from an objective secondary task \[[@CR5], [@CR21]\]. This task was meant to be an objective measure of a surrogate endpoint presumed to enable conclusions to be drawn about mental workload. A wireless vibrotactile device was placed on the arm of each participant. The device then vibrated at random intervals between 10 and 90 s over the course of the primary task participants were performing. Subjects needed to press the button on the device to cease it from vibrating whenever the device alerted but were also instructed to prioritize their primary task first. The time it took the participant to turn off the vibration was measured as a marker of the workload of the primary task (e.g. greater amounts of time meaning greater workload on the primary task).
Four of the six studies focused on measuring mental workload as a primary study outcome \[[@CR15]--[@CR18]\]. Byrne et al. (2014) attempted to measure mental load during a four-station OSCE where assessors were tasked with rating student performance using 21--22 item checklist \[[@CR15]\]. Mental load was evaluated by the examiners' response time to the stimulus produced by the vibrotactile device, which was strapped to the assessor's arm and set to vibrate every 10--90 s during the assessment. Scores obtained from the NASA-TLX were also used to measure assessors' mental load. A comparator group of 24 trainee anaesthetists was selected as their tasks were deemed to be similar to those required of an OSCE examiner and of high mental workload. Findings showed longer delays in vibrotactile response times and higher median NASA-TLX among the examiners, as compared with the trainee anaesthetists. Based on these findings, the authors concluded that the mental workload of examiners is excessive in the OSCE setting. Although this study had a small sample size and dissimilar study conditions between the groups, it set the stage for further research to determine acceptable levels of mental workload and whether assessor training or redesigning of assessments would be effective alternatives.
Byrne et al. (2016) completed a second study, which aimed to determine the impact of assessor training on reduction of mental workload and improvement of assessor accuracy \[[@CR16]\]. Assessors were selected from a training program that required them to rate four different video scenarios according to an assessment checklist. After each video, assessors compared marks with other trainees and received feedback from an experienced examiner. Accuracy of ratings was defined as the difference between the ratings of the participant and those of an expert group, which had previously reached consensus on 'true scores'. Mental workload was measured using the vibrotactile device, as described above. The study found that training did not improve the accuracy of ratings and that there was also no effect on mental workload, as measured by the vibrotactile device. The authors attribute these findings to the high mental workload nature of the OSCE and speculate that a single training session does not result in sufficient training to promote improved accuracy in scores.
Tavares et al. (2014) completed a study to evaluate how increasing rating demands impacts rater-based assessment of clinical competence using pre-recorded clinical encounters \[[@CR17]\]. Participants were randomized to one of four conditions: two or seven rating dimensions with the presence or absence of extraneous tasks as distractors. Outcomes included the number of dimension-relevant behaviours identified, performance discrimination ability, and inter-rater reliability. Mental workload was measured using the vibrotactile device as well as the NASA-TLX. Findings showed no association between measurement of mental workload and each of the procedural conditions. However, more behaviours were identified in the groups rating performance across two dimensions as compared with seven dimensions. It was also found that those in the two-dimension groups had a better performance discrimination and inter-rater reliability versus those asked to rate across seven dimensions. The presence or absence of extraneous distracting tasks had no influence on measured outcomes. The study had limitations, however, due to the use of senior students as raters, as these novice raters may have different knowledge and understanding of the competency domains used for assessment. This limitation led to an additional study by Tavares and colleagues that recruited expert raters for competency assessment.
In the extension to the previous study, Tavares et al. (2016) explored how increasing task demands would influence rating quality among experienced raters \[[@CR18]\]. Experienced assessors were randomized to rate pre-recorded videos of clinical encounters across two or seven dimensions with or without a task to increase extraneous load by requiring assessors to also rate the performance of the standardized actors. Findings were similar to the previous study, however, with greater inter-rater reliability being attributed to those rating across only two dimensions. The requirement of an additional rating task did not have any effect on rating quality but participants noted they blocked out this task, likely in an attempt to reduce extraneous load. The authors also interviewed participants to better understand how raters manage the workload imposed on them. Results from this analysis showed that raters use multiple strategies to reduce load to navigate the rating tasks, including prioritization, simplification and minimization of their perceived extraneous load. Despite, once again, no measured reduction in mental workload in this study, findings demonstrated improved assessment quality when the rating task was simplified and that assessors' perceived ways of reducing their own mental workload may indeed be related to cognitive load and information processing theories.
Two additional studies were identified that further looked at the practical applications of reducing load within an assessment context \[[@CR19], [@CR20]\]. Hurley et al. (2015) completed a study to investigate checklist length on rater accuracy when assessing student performance on OSCEs \[[@CR19]\]. Participants were recruited to watch four videos enacting 10-min integrated history and physical exam OSCE stations and were randomized to assess the videos according to either a 20- or 40-item checklist, which consisted of binary outcomes. Findings showed no difference in accuracy or inter-rater reliability between the 20- and 40-item checklist, suggesting simplifying a checklist by length alone may not be a viable strategy for reducing assessment load. It should be noted, however, that overall mean rater accuracy was 86% and therefore any minor (yet important) variations in scoring may not have been detected.
Tavares et al. (2018) expanded on previously reported studies with a study designed to determine if collecting sequential ratings across subsets of a candidate's competencies, as opposed to having raters evaluate a greater number of competencies simultaneously, altered feedback and performance ratings \[[@CR20]\]. Participant assessors were randomized to a sequential (rating across two dimensions) group or a simultaneous (rating across six dimensions) group for evaluation of video performances in a 3:1 fashion. Randomization was designed to ensure that three different assessors rated students in the sequential group (i.e. one for each pair of dimensions), in order to provide a complete evaluation over the six competencies. Participants were instructed to rate four clinical performances and to provide the feedback that they would give to the students in each video. Outcomes were the amount and type of feedback and the reliability of the scores. It was found that assessors in the sequential group provided greater amounts of feedback, greater variety in feedback, and there was greater breadth to the feedback across all competencies. Score reliability was also greater in the sequential group. Findings therefore suggested that simplification of assessment procedures once again resulted in positive outcomes, including improved feedback for trainees and/or clinical competency decision-makers.
Discussion {#Sec5}
==========
The purpose of this review was to explore the interventions used to measure or reduce mental workload within assessments. Six studies were identified that provided an overview of published empirical research in this area \[[@CR15]--[@CR20]\]. Despite no clear link between task simplification and measurement of mental workload the studies identified show us how simplification of the assessment process may improve other assessment outcomes, such as interrater reliability and the quantity and quality of provided feedback. While many questions still remain, these studies provide a foundation for the design of future studies aimed to improve assessment quality by using different approaches to reduce the mental workload associated with assessment tasks.
The studies summarized above have both important theoretical and practical implications. From a theoretical perspective, the studies provide conflicting evidence for the explanation of mental workload as a limitation that impairs assessor performance. Based on the findings from studies that attempted to measure mental workload, it would appear that improvements in assessment quality markers are not associated with reductions in reported levels of mental workload \[[@CR16]--[@CR18]\]. That being said, it could also be argued that the ways in which mental workload is measured (vibrotactile device and NASA-TLX) are either not valid measures of mental workload or may not be sensitive enough to measure changes in mental workload observed within the studies. This argument aligns with Naismith et al. (2015) who showed validity evidence for measuring mental workload (self-reports, secondary task performance, physiological indices, and observer ratings) from learner perspectives in simulation settings was low \[[@CR22]\]. It should be noted, however, that the studies reviewed were conducted outside the realm of assessment. It could also be speculated that the small sample sizes of the studies identified did not provide enough power to detect changes in outcomes.
The lack of a difference pertaining to assessor training found by Byrne et al. (2016) does not allow us to conclude more widely about the potential relationship between training and mental workload \[[@CR16]\]. Despite limited data showing assessor training can improve assessment quality \[[@CR3], [@CR23]\], perhaps further training and/or experience may be necessary before mental workload is reduced and can be measured. Two studies by Tavares and colleagues also resulted in surprisingly absent findings when assessors were instructed to complete secondary tasks \[[@CR17], [@CR18]\]. The presence of the secondary tasks could have been expected to alter assessment quality due to their distractive nature, but little effect was noted. On the other hand, the studies by Tavares and colleagues do signal that mental workload may be a possible explanation for reduced assessment quality, as the studies consistently demonstrated that simplification of tasks results in better quality markers \[[@CR17], [@CR18], [@CR20]\]. This may align with research from other disciplines that suggests load may be important for deliberate tasks, rather than those tasks that are more basic or typical \[[@CR24]\].
If we take a closer look at assessor cognition literature, there could be other explanations that underpin the paradox found in this review. It is possible, for example, that assessor expertise, rather than attention and/or working memory as part of mental workload, may be more influential towards the quality of rating tasks \[[@CR10], [@CR25]\]. Although these concepts may be inter-related, expertise is known to encompass assessor characteristics, assessor perceptions of the assessment tasks, and the assessment context, rather than traditional components of mental workload (attention, working memory, information processing). Increasing literature is also showing that assessor beliefs, performance theories, and inferences about the student may be contributing to their reasoning of student performance and the assessment task \[[@CR26], [@CR27]\]. If the outcome of assessors' ratings is largely shaped by these factors, rather than what they pay attention to or remember from a performance, it could provide an explanation as to why deliberate manipulations to reduce mental workload appear to have little impact on assessment quality, as largely measured by inter-rater reliability. As Schutz and Moss (2004) argue, variability between assessors appears to be less about what they focus on or pay attention to and more about how they conceptualize and bring meaning to data by developing a coherent representation or story about student performance \[[@CR28]\]. If this is indeed true, perhaps the process in which assessors interpret and bring meaning to performance data is not dependent on reductions in mental workload. It could then be argued that by simplifying rating tasks by reducing the number of competencies an assessor is asked to consider, assessors may become more congruent in their processing of performance information, leading to the positive outcomes observed in the studies by Tavares et al. \[[@CR17], [@CR18], [@CR20]\]. Although there could be other possible theoretical explanations for these findings, such as pushing assessors 'outside their comfort zone' in how they normally perceive competence when making judgments \[[@CR29]\], the concept of mental workload and its influence on rating demands is likely to be at least contributory to our understanding of the burdens placed on assessors through rater-based assessment and warrants further investigation.
From a practical perspective, the main message arising from this review is that simplification of rater-based assessments may be the key to improving assessment quality and capturing a better perspective of trainee performance through both rating and provision of feedback. The studies by Tavares et al. have shown that reducing assessors' focus based on competency dimension allows for better assessment markers \[[@CR17], [@CR18], [@CR20]\]. This finding is in contrast to Hurley et al. where the intervention was to reduce the number of checklist items, rather than the number of competencies \[[@CR19]\]. The key difference of these two findings is that in the checklist approach, assessors were still required to observe performance and provide judgment across the entire performance. The reductions in checklist items were based on deemed importance, rather than targeting specific performance dimensions. Tavares and colleagues instead attempted to focus the assessor's attention on specific competency domains, which may have provided a better 'signal' for assessment and less 'noise' that may have interfered with judgments for other competency dimensions. It is still unclear, however, if other simplification strategies could be viable alternatives to Tavares' approach and thus this should be a priority for future research.
Despite these positive findings, many questions remain regarding the practicality and feasibility of assessment simplification in practice. First, all studies to date have been based on video-captured assessments and research is yet to move into real-life practice. As such, there may be other factors that could affect the reproducibility of these results in a practice-based setting. Perhaps most importantly, social factors and relationship dynamics will be present in clinical training encounters between raters and trainees that are not accounted for in simulated interactions \[[@CR30]\]. Simply asking assessors to only focus on a few competency dimensions after observing trainees over an extended period of time may be difficult for them to disentangle what they have also observed across the different competency dimensions, especially if assessors are not being asked to rate patient care performance. A second question to be explored is the feasibility of sequential assessment, as outlined in the final study by Tavares et al. \[[@CR20]\]. The practicality of having assessors rate only a subset of competency dimension may be difficult for a) determining the number of times a student should be rated on a single competency dimension and b) ensuring the student is performing to the best of their abilities at all times (i.e. patient care) and not just according to when each competency is assessed. Despite these questions, the findings of this review support further research in this area to refine assessment practices and explore a more simplified approach to reduce rater demands.
This review should be interpreted in light of some limitations. First, our aim was to explore the association between mental workload and assessment, which resulted in identification of studies that discussed or used these terms as keywords. We therefore may have missed some studies looking at simplification of checklists or other assessment tools. Secondly, our review is limited by the quality of studies identified. In particular, measurement of mental workload was limited to the use of the vibrotactile device and NASA-TLX scoring tool. Despite previous validation of these methods, they may not have been sensitive enough to detect changes in mental workload demonstrated within the small sample sizes of the studies included in this review or as discussed, not be valid measures of workload associated with assessment in the health professions. Thirdly, our search strategy did not include specific assessment format terms (e.g. OSCE) but based on our findings, we are confident we identified most (if not all) studies that met our inclusion criteria. Lastly, research in this area is still expanding but with what appears to be a movement away from measuring mental workload; we believe our results provide a comprehensive summary and foundation for new research questions arising to address rater demands in assessment design.
The burden of assessment tasks will continue to increase as new models and methods are developed to train and assess students in both simulated and experiential settings. This review found that interventions aimed to reduce mental workload associated with these assessment tasks can improve assessment quality but the mediating role of load remains yet to be demonstrated within a medical education context. Moving forward, the concept of mental workload therefore remains theoretically important and more research is needed to better understand the relationship between mental workload and assessment quality. Specifically, studies should be designed to inform how to best reduce load in assessment to improve assessment quality, while balancing the type and amount of data needed for judgments. There is also an urgent need for research to move into the workplace-based setting, as many context-specific factors must be considered to ensure feasibility of research findings to date.
**Editor's Note**
Commentary by: Andrea Gingerich, DOI 10.1007/s40037-019-00549-0.
B. Paravattil and K.J. Wilby declare that they have no competing interests.
| 2024-05-10T01:26:29.851802 | https://example.com/article/5673 |
assuming b is positive.
b**(-49/8)
Simplify ((n**(4/3)/n)**(-1))**35 assuming n is positive.
n**(-35/3)
Simplify (k**(1/4))**0/(k**(-6)/(k**(1/3)/k)) assuming k is positive.
k**(16/3)
Simplify c**8*c**(3/8)*c*(c*c/(c*c*c**(-2/9)))/((c/(c/c**(2/17)))/c) assuming c is positive.
c**(12827/1224)
Simplify y**(-2)*y**4/y assuming y is positive.
y
Simplify (t*(t/(t*t**(1/2)/t))/t*t)**(-3) assuming t is positive.
t**(-9/2)
Simplify k**(1/2)/k*k*k**(1/2)*k*((k**3/k)/k)/(k*(k/k**(2/3))/k*k) assuming k is positive.
k**(5/3)
Simplify ((((z*z**(6/7))/z*z*z)/z)/z*z)**(2/103) assuming z is positive.
z**(26/721)
Simplify (i*i/(i**(-1/5)*i))**(-4/7) assuming i is positive.
i**(-24/35)
Simplify y/(y**10/y)*y*y*y/y**(-9) assuming y is positive.
y**4
Simplify ((m**(-6)*m)**(3/10))**(-7/4) assuming m is positive.
m**(21/8)
Simplify ((x*x**(-4)*x*x*x)/(x/(x**2*x)))/(x**3/(x*x/x**(-9/4))) assuming x is positive.
x**(13/4)
Simplify ((m*m**(2/3)*m)/m)**(-3/28)*m**(-1/2)*m**(2/19) assuming m is positive.
m**(-305/532)
Simplify ((r**(-1)*r)**(-17))**(6/23) assuming r is positive.
1
Simplify (v**0*v)**32*(v**(-1/7)*v)/(v/(v/(v/v**(1/4)))) assuming v is positive.
v**(899/28)
Simplify d**(1/10)/d**(-6)*d**(-2/21)/d**(-2/15) assuming d is positive.
d**(1289/210)
Simplify (o**(-5/2)*o/(o**(-8/7)*o))**(-4/15) assuming o is positive.
o**(38/105)
Simplify (n**(-8)/n*n)/n**(-2)*(n*n**(-1/14)*n*n)/(n/(((n/(n/(n**(-6)/n)))/n)/n)*n*n) assuming n is positive.
n**(-211/14)
Simplify (h*h**(-1))**(-16/7)/(h**0/(h*(h*h**(2/5))/h)) assuming h is positive.
h**(7/5)
Simplify (r**(2/43)/r)/r*r**(-2/13) assuming r is positive.
r**(-1178/559)
Simplify (s**(-1/5)*s)**(3/5) assuming s is positive.
s**(12/25)
Simplify ((w**(1/15)*w)/(w**(-11)*w))/((((w**(-2/11)/w*w)/w)/w)/((w*w**(1/6))/w)) assuming w is positive.
w**(4427/330)
Simplify (c**(2/3)/c)**(1/13)*c**(2/17)*(c*c**(-4/9))/c assuming c is positive.
c**(-701/1989)
Simplify (j/(j/((j*j*j/(j**(2/19)/j)*j*j)/j))*j/(j*j**(-9)*j))**(1/23) assuming j is positive.
j**(245/437)
Simplify ((y*y/(y*y*y**0*y)*y)/y)/(y/(y*y/(y*y*y/((y**(3/4)/y)/y*y)))) assuming y is positive.
y**(-13/4)
Simplify (p*p**(2/11)*p)/(p*p*p**2/p*p)*(p**(-1)/p)**(-6/11) assuming p is positive.
p**(-8/11)
Simplify s**(-23/3)/((s/(s*s**39/s))/s) assuming s is positive.
s**(94/3)
Simplify (q**(-1/10)/q*q)**15 assuming q is positive.
q**(-3/2)
Simplify x/(x**(-1/3)/x)*x/(x*x**(-5))*(x/x**(-1/4))/x**(-3) assuming x is positive.
x**(139/12)
Simplify (i/i**(-2/21))/i*i*i*i**(-4/3) assuming i is positive.
i**(16/21)
Simplify c**11/(c/c**3) assuming c is positive.
c**13
Simplify (h*h**(-5))/h**(-1)*((h/h**6)/h)/h**(-6) assuming h is positive.
h**(-3)
Simplify (z*z**(-26)/z)**(-1) assuming z is positive.
z**26
Simplify (f**(1/9))**49 assuming f is positive.
f**(49/9)
Simplify (((y/((y*y**(4/3))/y))/y)/y)/(y*y*((y**0/y*y)/y*y)/y)*y**(-9)/(y*(y/(y**(2/5)*y)*y)/y*y) assuming y is positive.
y**(-209/15)
Simplify (d*d**25)/d*d/d**(-10) assuming d is positive.
d**36
Simplify t**(-6)*t*t/t**(-3/10)*t assuming t is positive.
t**(-27/10)
Simplify s/(s*s/(s**(-3/23)*s))*s*s**(4/9) assuming s is positive.
s**(272/207)
Simplify (l**(-6)*l)/(l/((((l**(-16)/l)/l)/l)/l)) assuming l is positive.
l**(-26)
Simplify (z*z*z*z/(z**(2/3)/z))**(-1/4)/(z**1*z*z/z**7) assuming z is positive.
z**(35/12)
Simplify (r**(-5))**(-1/5) assuming r is positive.
r
Simplify ((h/h**(2/5))/h)**21/((h*h**6)/h*h*h*h**(-3/8)) assuming h is positive.
h**(-641/40)
Simplify (f/(f/((f/((f**6*f)/f))/f)))**(3/4) assuming f is positive.
f**(-9/2)
Simplify (x**(-13/3))**(-15) assuming x is positive.
x**65
Simplify j**(-4)/(j/(j*j**(-2/17)))*(j**1*j)**(-19) assuming j is positive.
j**(-716/17)
Simplify q**(-21)/q**(-14) assuming q is positive.
q**(-7)
Simplify ((a/(a*a/(a**(-2/7)/a*a)))**44)**(-14/3) assuming a is positive.
a**264
Simplify (q**(-1)/q)**45*(q/q**7)/(q*(((q/(q*q**(-6)))/q)/q)/q*q*q) assuming q is positive.
q**(-102)
Simplify (q**(-3)/q**(-1/2))**(1/7) assuming q is positive.
q**(-5/14)
Simplify k**(-2/11)*(k*k/(k*k**(36/11)))/k assuming k is positive.
k**(-38/11)
Simplify (f**(-1/4))**(-42) assuming f is positive.
f**(21/2)
Simplify (l**6*l*(l/(l*l**(-3/5)/l*l))/l)**(-13/6) assuming l is positive.
l**(-143/10)
Simplify (b**0)**(2/145)/(b**2/(b/(b/(b*(b*b/(b*b*b**0))/b)))) assuming b is positive.
b**(-2)
Simplify ((h**(-2))**(-30))**(-43) assuming h is positive.
h**(-2580)
Simplify s**(-24)*s**(1/15)*s assuming s is positive.
s**(-344/15)
Simplify (l**(2/21)/l)/l**(2/3)*l**(2/11)/(l*l*l/(l*l**(4/7)*l)) assuming l is positive.
l**(-20/11)
Simplify m**17*(m*m**18)/m assuming m is positive.
m**35
Simplify (y**(-1/3))**43/((y/(y/(y**(-8)*y))*y)/(y/(y**(-1)/y)*y*y*y)) assuming y is positive.
y**(-7/3)
Simplify (x*x*x/x**(2/15)*x**17)**(-15/7) assuming x is positive.
x**(-298/7)
Simplify (b**(1/2)*b*b*b/(b/b**(3/5)*b)*b)**(-7) assuming b is positive.
b**(-217/10)
Simplify (g/((g**(2/5)*g)/g))/g**(1/2)*g**(-1/2)/((g/((g**(2/5)*g*g)/g))/g) assuming g is positive.
g
Simplify (b**(2/17)*b**(-3))**(2/143) assuming b is positive.
b**(-98/2431)
Simplify (a*a**(-6)*((a/(a/(a**(-3/4)/a*a)))/a)/a*a)**(8/3) assuming a is positive.
a**(-18)
Simplify (g**(-1/3)/g)/(g**(2/5)*g*g)*((((g**1*g)/g)/g*g)/g)/((g/g**(1/3))/g) assuming g is positive.
g**(-17/5)
Simplify (x*x**(-45)*x)/(x**(-9/4)*x) assuming x is positive.
x**(-167/4)
Simplify (l/(l*l**(2/7)))**11*l**(2/21)/(l/(l/(l/(l**(-5/2)*l)))) assuming l is positive.
l**(-233/42)
Simplify ((d*d**0)**(-1/70))**(-1/16) assuming d is positive.
d**(1/1120)
Simplify (x/x**(-2/5)*x)/x**(-7/8) assuming x is positive.
x**(131/40)
Simplify (j*j*j**(2/11)*j*j*j**(-1))**(24/13) assuming j is positive.
j**(840/143)
Simplify ((y/(y/(y*y**(-1)*y*y))*y)**(-12))**39 assuming y is positive.
y**(-1404)
Simplify m**(-1/17)/m**(-7/12) assuming m is positive.
m**(107/204)
Simplify (k*k**(-1/6))**(2/33) assuming k is positive.
k**(5/99)
Simplify ((k*k/((k**(1/3)/k)/k))/k)/((k*(k*((k**(-4/5)/k)/k)/k*k)/k)/k)*k/k**5*k*k*k/k**(1/4)*k*k assuming k is positive.
k**(373/60)
Simplify (p**1)**41/(p**3/p*p**2) assuming p is positive.
p**37
Simplify (b/(b*b**(8/5)))**(-3) assuming b is positive.
b**(24/5)
Simplify (x**16*x*x)/x**(-1/15) assuming x is positive.
x**(271/15)
Simplify (t**(-8/5)*t)/(t*t*t*t*t/(t/(t*t**(4/7)/t))) assuming t is positive.
t**(-181/35)
Simplify (x/(x**(-3)/x)*(((x**(2/13)*x)/x)/x)/x)/((x/(x/(x*((x**6*x)/x*x)/x)))/x*(x*x**(-3/4))/x) assuming x is positive.
x**(-109/52)
Simplify m**2/(m/(m*m*m*m**(5/4)*m)*m)*(m*m/(m*m/m**(1/3))*m)**(-32/5) assuming m is positive.
m**(-197/60)
Simplify (p**(-2))**(1/2) assuming p is positive.
1/p
Simplify ((n/(n/n**(-7/6)))/(((n/n**(-3/5))/n)/n))**(-3/28) assuming n is positive.
n**(23/280)
Simplify ((m/(m**(1/2)/m*m))/m**(-1/6))**(-2/55) assuming m is positive.
m**(-4/165)
Simplify (o**(-1/4)/(o/(o*o**0*o)))**(1/4) assuming o is positive.
o**(3/16)
Simplify l**(-21)/l*l*l**(10/3) assuming l is positive.
l**(-53/3)
Simplify ((s/s**(-1))**(-2/15))**(-2/9) assuming s is positive.
s**(8/135)
Simplify ((r/r**5*r)/r**(-2))/(r*r/(r*r*r**(1/2)*r))**(-4) assuming r is positive.
r**(-7)
Simplify v**(-3/5)*v*v*v/(v**(-7)/v*v)*(v*v**3)/((v**(-2/27)/v)/v) assuming v is positive.
v**(2089/135)
Simplify ((z/(z/(z*z/(z**(-7)/z))*z))/z**1)/(z*(z**(-2/3)/z)/z*z*z)**26 assuming z is positive.
z**(-2/3)
Simplify (d/(d*d**(2/7)))/(d**(1/5)/d) assuming d is positive.
d**(18/35)
Simplify (k**(-2/25)/(k/k**(-8/3)))**(-15) assuming k is positive.
k**(281/5)
Simplify (f**5)**40 assuming f is positive.
f**200
Simplify (g**(-1/3)*g*g)**25 assuming g is positive.
g**(125/3)
Simplify (l**(8/5))**(-3/38) assuming l is positive.
l**(-12/95)
Simplify (w/w**(-1/5))**(2/7) assuming w is positive.
w**(12/35)
Simplify (d**(1/2)/(d*d*d**4*d*d))/(d**0)**(-2/7) assuming d is positive.
d**(-15/2)
Simplify (((g*g**(1/7))/g*g*g)/g)**(-49) assuming g is positive.
g**(-56)
Simplify ((h*h*h**(-2/7))**(7/10))**39 assuming h is positive.
h**(234/5)
Simplify (n**(2/7))**(27/2)*n**(-1/2)*n*n/n**0*n assuming n is positive.
n**(89/14)
Simplify (y/(y*y/(y*y**5*y)*y)*y/(y**(-3/2)/y))/(y*y**(1/4))**(-13/7) assuming y is positive.
y**(303/28)
Simplify (((w**7*w)/w)/(w**(1/8)*w))/(w**(-2))**(-3/10) assuming w is posit | 2023-12-15T01:26:29.851802 | https://example.com/article/7575 |
Q:
Can we share code between react webapp and react native app and is react-native production ready
We have a stable version of a widget developed with reactjs. We would like to develop mobile version of the same. Is it better to develop with react native and share the code across the 2 apps or is it better we develop the widget natively.
Bare in mind that we do have expertise in both(react and android dev) but we do not want to invest to much time on developing the entire app again.
Are there any tools/resources available to get this done faster if we choose react-native?
Resources available online:
http://jkaufman.io/react-web-native-codesharing/
https://arielelkin.github.io/articles/why-im-not-a-react-native-developer.html
https://medium.com/@felipecsl/thoughts-on-react-native-from-an-android-engineers-perspective-ea2bea5aa078
Cheers!!!
A:
Instagram, Tesla, AirBnB, Discord, Bloomberg all have production apps written in React Native. I'll let you decide for yourself whether it's production-ready in your opinion.
While React Native enables you a significant code reuse between iOS and Android (we are currently building an app for client which - appart from external libraries - reuses over 99% code between iOS and Android), it is not designed to share code with React webapps.
The Facebook's philosophy with React Native, instead of write once, run anywhere is rather learn once, write anywhere.
You can definitely use your designs and architecture, but you would need to rewrite most of the code. It might still be more efficient than developing two separate Java and Obj-C/Swift apps, though.
Update: In 2018 Airbnb decided to sunset React Native in their production apps. They wrote an insightful article about their experience and reasoning. It is very relevant for anyone thinking about using React Native. https://medium.com/airbnb-engineering/react-native-at-airbnb-f95aa460be1c
A:
You could check out ReactXP (https://microsoft.github.io/reactxp/) which uses reactjs and react native to build cross platform apps.
A:
Rather than bloat this answer too much, I wrote a fairly in-depth guide about this at https://dev.to/kylessg/a-sensible-approach-to-cross-platform-development-with-react-and-react-native-57pk.
To summarise though, you can get great amounts of codesharing between React and React Native but don't overreach on what you're sharing. Doing so may leave your code harder to maintain where you're trying to oversimplify valid differences between mobile and web.
For myself, this is along the lines of:
Shared:
Business logic
Communication with API
Polyfill possible shared functionality into an API (e.g. communication with analytics, local storage, network detection etc)
Stores, reducers app actions
HOCs
Web/Mobile specific:
Presentational components
Navigation / routing
Styles
| 2023-11-11T01:26:29.851802 | https://example.com/article/8073 |
brawl left a man dead. police say dozens of people were fighting about 1:00 a.m. this isthecity's firstmurder since 8 people died in august. >>> probably felt it, summer refusing to give way to fall. one city saw triple digits. some of the hottest east bay spots opened cooling centers. >> today was 22 degrees warmer than yesterday in san francisco, 84 degrees. 80 in pacifica. otherwise 80s and 90s across the peninsula. topping off at 100 degrees in livermore, which shattered a record established in 1952. i know what you need to know, tomorrow's temperatures. it will be hotter. 80 in pacifica. 100 morgan hill. east of the bay, that is where we will see the numbers. 103 for the hottest locations. napa 90s. and an alert you need to know about, we will talk about that later in the newscast. >> thank you. >>> two polls show californians split on crime and punishment. prop 34 is in favor of life without parole. the poll shows 38% in favor. 51% opposed. however that gap narrowed when they are told convicted killers would have to work in prison and pay restitution. >> reporter: right n
, or this law that was actually passed bythecityofsimivalley.firstofall, a sign they have to post on their door, just says this, doesn't say i'm a sex offender, it says no candy or treats at this residence. they have to leave all exterior decorative and ornamental lighting off, 5:00 p.m. to midnight and, refrain from decorating their front yard and house exterior and don't answer the door to children trick-or-treating. >> essentially they are saying, you cannot try to lure these children. we know this is what you do. and we know you want children and know to -- sex with it i should say and you will not change your behavior and here, at the end of the day, when the united states supreme court, if they were to look at this, they will absolutely shoot it down. why? because they have decided that a sexual predator can be imprisoned although they don't call it that for even longer than a criminal sentence, because they are a danger to the community. it is absurd. >> heather: there are 119 registered sex offenders in simi valley and is there is this megan's law web site, where the worst
to improve anytime soon. brad has been inoceancity, md.,sandyfirstarrived.some shelterg right now. i thought this was going to calm down. in fact, the wind speed has storm hasbecause the tooser as it came shore in new jersey. ,t is nasty looking, certainly are about half the what they were when [inaudible] blowing in.n stille you can see which way the wind blowing. are heading toward another in a few hours. we had a high tide this morning at 8:00 that was pretty dramatic. up and overoming the sea wall. pretty substantial. this is an example of the power of those waves. is one of the benches they very heavy cast-iron bench. it was drawn into this garden. as was this bench. another one over there. it is pretty much like that up and down the boardwalk. you can see some of the debris out here. you can see the sand starting to on the boardwalk as the and thecomes exposed comes walking around the buildings. -- would been around the buildings. about theconcern flooding and there was a lot of flooding in ocean city big 16 street south all the way to the image, a block behind the boardwalk, a
in -- there is a smoking ban in san saf rel. san rafael isthefirst--in san rafael. they arethefirstcitytopush this ban. >>> what's still ahead for the estimated 50,000 attendees at the oracle world conference in san francisco. what appears on the surface to be an understated example of unequaled american achievement, is actually an extremely sophisticated apparatus of goodness and flavor, bonded together by a perfectly aged, all natural, tasty... gooey... blanket of love. >>> the you city of -- the city of richmond is set to reach out to chevron. this follows weeks of criticism after the massive fire at the refinefully august. the city wants chevron to help create a research campus at the marina bay. city council believes this could be a green tech center. >> i mean, chevron has sort of acknowledged that -- in a number of ways that -- that they want to increase their presence in richmond. >> the city council is expected to make their request tomorrow. chevron has said it is not in a position to make any long-term investment decision until a plan to modernize it is successfully submitted. >>>
. it will be inthefirstweekof november before the newyorkcitysubwaysystem. 468 station and 68 plus miles of track can reopen. they have been closed since before the storm. jfk airport will possibly open up. we don't know when la guardia or newark airport will open up back for business. airport in boston started slowly the take off and landings. but the tuesday total of cancellation. 18,000 in one day . a lot of folks lost their homes including more than 100 in a fire in breezy point, queens. the damage could top 20 billion and 20 or 30 billion in lost business. those numbers are huge that experts are hoping could be and might be off set by the cost of a repair and rebuilding. back to you in new york. >> thank you, peter. we told you about atlantic city, but just south of there. parts of ocean city, new jersey boardwalk also swept away . sandy swept away much of the town. we are joined where clean up is under way, stephanie. >> it is bad here in ocean city . the bay on one side and ocean on the other. it looks like i am standing on the beach but we are on the fifth street acess point to the boardw
talk about my background howifirstgotinto the position as the mayor in asmallcityabout40,000 people outside of springfield in the western part of massachusetts. i was born and raised there and went to the public schools and when i got into brown studied urban studies there and unlike a lot of folks my age to give back to the city that i thought had given me the opportunity that i had. holyoke is a rich history and is the first city to the committee to make papers we are the paper city. like a lot of cities on the northeast we move the industrial city but folks came in to holyoke and a lot of the factories moved overseas. the unemployment rate is larger or how your domestic and national average about 50% of the population is latino and mostly puerto rican defense and very diverse city as well. so i got elected last november and there's four of us in the election the nonpartisan from the local level to start against each other in november and i went with 53% of the vote and became the mayor in january at the age of 22 and i turned 23 and i will be 24 in january so i quickly
by showing up on election day. nina turner has represented cleveland, ohio, since2006.firstatcityhall,now as a state senator. it's great to have you with us today, and the obama campaign touted its early lead there in ohio in the early voting yesterday saying it's not going to let up. as we know, the vice president is there basically all week. the race there will only get more heated with ohio now the top market in the ad spending. i want everybody to take a look at that. $177 million. is president obama's early lead enough to buffer any gains that the romney campaign is expected to make on election day the old fashioned way? >> i believe so, thomas. i mean, ohio is the president's life line. just as we delivered ohio in 2008, we will deliver ohio in 2012. the buckeyes here in the state understand that the president's policies are what are right for the state of ohio from throwing a lifeline to the auto industry to making sure that one of the first pieces of legislation that he signed into law was the lily leadbetter act. we have a governor in governor romney who can't even decide wh
of times. this isthefirsttimei've done one in newyorkcity, andit's in a lot of ways a different animal. you learn how fragile a big city can be, a big strong city like this. it's just different, and that surge, as i said, was really something to behold. >> yeah. >> scott cohn, thank you very much. see you later. >>> coming up next, hurricane sandy hitting long island's massapequa hard tonight turning streets into rivers. more on how the storm is ravaging the northeast and how refineries are being affected as well. we'll be back in two minutes. >>> welcome back. sandy has closed several of the region's major refineries. here's a look at the process to reopen these fuel centers. cnbc's sharon epperson has more. >> reporter: getting a refinery back online after a full shutdown due to a hurricane or major storm can be a lengthy multi-phase operation. the first step, returning evacuated personnel to the refinery, could take a few days depending on conditions and surrounding areas. once on location, the crew evaluates the storm damage, like flooding or downed power lines. if the power
and protestors claimedthecitycrushedtheirfirstamendmentrightsbutcityleaderssay they put these in place for security reasons. >> i think it's a rule that's always been very clear that if the crowd is too large for the room, then you establish a secondary place where people can watch. >> there are open seats all over this room and they have these doors closed because they don't want us here. >> reporter: the protestors became quiet after the bluford family was given the police report regarding their son's death. the report is heavily redacted but the family says it proves despise initial reports alan bluford never fired a shot. now in terms of how the city plans to operate future city council meetings, they are not sure how they will handle them from here on out. >>> oakland officials are blast the in a new report of an officer-involved shooting. the court-appointed monitor checking police reform says police sometimes shoot at suspects even if there is no imminent threat. the monitor report says police investigations into the shootings often fell short with detectives expecting that they
ofthecity. thefirststop?a tree down near the historic home of frederick douglass. >> i think we're in good shape. we've had minimal flooding up to now. this is still a threat over the next four to eight hours of some flooding on the potomac. >> reporter: the mayor's group headed to northeast where we found crews removing this tree from ebart street. residents thankful it was only a car damaged when the tree came down. >> the most important thing, there's no life lost and that's the main thing. >> reporter: because of the strong winds last night and early this morning, there are trees down across the district, but the good news, as soon as they came down, there were crews to pick them up. crews working right here on calvert street northwest removing a big tree here. even with all the downed trees no one was injured and power outages were restored quickly for the most part. >> they were here as soon as i woke up, so we're pretty happy with their response. >> it's obvious pepco was taking this event very seriously and i want to commend them. >> reporter: back out live here in up
. the doors open around 9:00. richmond will host romney on sunday. it'sthefirststopof a three-city tour for the republican. he will visit virginia at battlefield high school. he will wrap up the day at the farm bureau amphitheater in virginia beach. romney's running mate, paul ryan will stop in bristol and charlottesville. joe biden goes to virginia beach and lynchburg saturday. >> there are major problems with absentee ballots in maryland. they heard from a voter who say he was missing a page of referendum questions. some were the most talked about questions like six on gay marriage and seven on gambling. there are a small number of ballots missing pages. if you have not voted, you can call your local election board for a new ballot. head to www.nbcwashington.com and search ballot for more information. >>> some of those campaign signs you see along roadways on your way to work may be gone, soon. road crews are removing hundreds of those signs in maryland. the state highway administration says many signs were put there illegally. this has nothing to do with politics. the highway adminis
expect from a guy who is runningforcitycouncilforthefirsttime.that's not what you expect from a president. >>> that was charles krauthammer's opinion. who benefited the most from last night's debate? let's ask. thank you both for joining us. the latest cnn poll says 48 percent say obama won, 40 percent romney. what do you think? >> it is no question president obama came out on top last night. i think what he did very effectively was make mitt romney an unacceptable alternative. mitt romney came out last night and basically doubled down on agreeing with the president after two years of running as a severely conservative candidate. mitt romney agreed with the president on so many different things. foreign policy is so critically important we are putting troops in harm's way. we need a candidate who is sere serious about the issues and consistent. >> moderate mitt that is pretty good. mitt romney had to do three things last night. he had to prove he could pass the commander-in-chief test. he did. he had to prove he was well versed on foreign policy and had to approve he was not a
, responding, saving lives, and they are helpingthefirstresponders,the volunteers, reallythecity, state,and federal workers who are doing a heroic job in our great city responding to this worst storm in my lifetime for new york. >> you represent constituents here. >> yes. >> how are they reacting to what's happened? >> they were rising to the occasion. the lower east side and lower west side has absolutely no power. there are no traffic lights. people are helping people cross the street. they were serving as the police directing traffic. they were helping each other. it reminded me of the spirit after 9/11 where everyone did whatever they could to help. but you need the city government, the state government, the federal government to come in and help. mr. romney says rely on the private sector. what if they decide not to fund it? the federal government is there funding disaster relief, disaster coordination. they are moving in supplies and equipment that is needed to help us restore our great city and to help the people. we had a terrible problem with one of our hospitals, new york hos
in the elements. >>>cityinfirstsignificantstorm. season pounding the bay area. lots of snow in the sierra. we'll talk about it coming up. >> problems on the roads. where they are in a few minutes. >> and the winner takes all. giants and the
. and the top ad this week, green bay, wisconsin, again. so the battle is mostly in the midwest. forthefirsttimethere are no cities in virginia or florida in the top ten. at least not for now. whole grain, multigrain cheerios! mom, are those my jeans? [ female announcer ] people who choose more whole grain tend to weigh less than those who don't. multigrain cheerios we might still be making mix tapes. find this. pause this. play this. eject this. write this. it's like the days before esurance express lane™. you had to find a bunch of documents just to get a car insurance quote. now express lane finds your driving info with just one click, saving time to be nostalgic about the days before express lane. thank you, insurance for the modern world. esurance. now backed by allstate. click or call. >>> i had, i don't know, 20-something jobs before i got elected president, but this is the first time in my life i ever got to be the warm-up act for bruce springsteen. >> 45-minute warm-up act, and it was a good 45 minutes. welcome back to "hardball." 19 days to the election, and barack obama is bri
. a tonight, the mystery surrounding the disappearance is growing. fairfax pitfound inthaissfaxcityatpark. >> we heard from fairfax county the first time today. is still listed as missing under unusual circumstances. were out herers searching the park earlier was the last place he was known to have been. his friends and families were printing of two different fires been handing out. doy do not know what else to try and help bring him home. plastering his brother's picture all over fairfax -- fairfax hoping someone knows what happened to bryan. >> i can only imagine what his family is going through. -- awful.er i want to help as much as i can. his friend has known him for five years. m as quiet buthi sweet. >> he has a good personality. he is really nice. >> efforts have intensified over last 24 hours. police combed to the park where abandoneds found morning.sday bloodhounds and a helicopter were brought in to assist. is a surveillance video up dunkin donuts. the video does not show as anyone else was in the car with him. the car, his computer, and cellphone, are all in police possession.
, what can rg3 expect inhisfirstbigtrip to thesealcityplusa positive update on amanda flesher. news at 5:00 continues after this. this. president obama: there's just no quit in n america... and you're seeing that right now. over five million new jobs. exports up forty one percent. home values... rising. our auto industry... back. and our heroes are coming home. we're not there yet, but we've made real progress and the... last thing we should do is turn back now. here's my plan for the next four years: making education and training a national priority; building on our manufacturing boom; boosting american-made energy; reducing the deficits responsibly by cutting where... we can, and asking the wealthy to pay a little more. and ending the war in afghanistan, so we can... do some nation-building here at home. that's the right path. so read my plan, compare it to governor romney's... and decide which is better for you. it's an honor to be your president... and i'm asking for your vote... so together, we can keep moving america forward. i'm barack obama and i approve this message.
degrees. look at the big board. even the west coast. >> utah, saltlakecity, firstsnowof the season. we'll show you pictures in the next half hour. >> thank you. >>> coming up, meet the real-life home alone girl, the brave 10-year-old who foiled a home invasion with a dramatic 911 call. >>> and can you imagine ross and rachel not ending up together? the creator behind "friends" reveals how one of television's most beloved couples almost didn't make it. >>> and these parents getting payback when their daughter misbehaves. why it's stirring so much debate right now. >>> and one of the biggest weddings of the year. justin and jessica, brand-new photos. a lot of details, coming up. [ male announcer ] we're all on a journey to financial independence. ♪ whether you're just beginning the journey... ♪ ...starting a family... ♪ ...or entering a new chapter of your life. while the journey is yours, pacific life can help you protect and grow the assets you'll need along the way. to learn how, visit pacificlife.com. pacific life. the power to help you succeed. just begin with america's favori
if they will stay open but this isthefirsttestofanewcitypolicyallowing extended alcohol hours before holidays to bring in more revenue. >> 6:37 and still ahead -- the prince george's county fire department is going hank. >> details on the big weekend performance coming up. [ male announcer ] who will raise taxes on the middle class? according to an independent non-partisan study, barack obama and the liberals will raise taxes on the middle class by $4,000. the sameme organizatsaion says the plan from mitt romney and common sense conservatives isnot a tax ke on the middle class." want proof? re the non-partisa study for yourself at american.com. obama and his liberal allies? we can't afford four more years. i'm mitt romney and i approve this message. >> firefighters and paramedics in prince george's county or during their part to raise awareness of breast cancer this month with specially designed pink t-shirts. you can buy one for $15 and the proceeds will go to breast cancer research. for information, find it on line at wjla.com. >> it is c
. this isthefirsttimethecityhashosted a postseason game in nearly eight decades. news 4's tony tull is live at nationals park for the calm before the storm. so excited. wait a minute, tony. where's your red t-shirt? is that an orioles shirt? >> reporter: listen, we're going to get something out of the way right now. you can always bet, when you watch news 4 and tony tull reports, i will bring you fair and balanced news unless it comes to sports. i'm not a bandwagon fan. we have a lot of those in the news room. i'm not one of them. i support the orioles. but more importantly, they still have a couple of seats left and a couple of hundred tickets left for standing room only. if you're thinking about ditching work today, come on down. you can still get tickets. as far as the shirts, i know you want nats gear, support the nats here. allen fay, director of merchandising. angie goff's favorite hash tag on twitter when she's talking about the nats, natitude. october natitude, new shirt coming in? >> the only place you can buy them today is at the ballpark, and then we'll spread them out to the sto
in frederick, maryland. the crime strike includesthecity's firstyear.someone shot and killed lamont george lee elohist early sunday morning. tonight more gun fire -- ellis early this morning. tonight more gunfire and fox 5 was on the scene. >> reporter: a lot going on in a short amount of time. the street violence broke out shortly after we arrived here in frederick about 5:30. we were talking to a police lieutenant about sunday's murder when all of a sudden you could hear gunshots fired from close by and then about an hour ago a vigil for lamont ellis. >> in the name of jesus, amen. >> reporr: lamont ellis had a lot of friends. they showed up to pay tribute to him in mullinex alley where he was found dead 2:30 sunday morning. his girl friend and children were at the vigil. ellis was remembered as the manager of the seafood department at a gaithersburg giants supermarket. >> he was a wonderful friend and a good father, had a big heart. he will be missed. >> he was a good guy, never bothered nobody ever. all he did was smile. >> reporter: his friend think he was the victim of a robbery,
. what are we going to get for it? what do we get out of it? thefirstresponders,we have citiesouthere that are -- they didn't get the federal help, god forbid, something like that happened out here, we would be just lost. >> bill: look, we don't have so much of the hurricane problem in california but we have the earthquakes and how many times -- i remember how many earthquakes have we been through in northern california and southern california, i have, what's the first thing the governor does or the cities do. they turn to fema for help. for emergency responders that they're able to bring in from other states. first responders. and then for the rebuilding effort. for the protection against them. disaster relief, you would think that everybody would understand that disaster relief -- okay, maybe you don't really like a big federal government but there is a role for the federal government in disaster relief. the fact that mitt romney doesn't see that to me shows how -- just how shortsighted he is. what a captive of th
picture of newyorkcityfromthe top of our building looking south. now we're lookingeast.firstsouththen east. bill karins with a look at the first. >> today's a sad day. last day for our jean shorts and tank tops. >> i never say that. >> you keep them out all year? >> indian summer is a great time for jean shorts. >> yes, they are. good morning, everyone. if you're on the east coast, a little taste of summer today. this will be about it. temperatures will come crashing down over the weekend. it's going to be 80 degrees in many areas, even up into new england, which is rare for this time of year. middle of the country has cooled down. a few showers today in illinois. by the time we get to sunday, the cool air in the middle of the country just sweeps to the eastern seaboard. unfortunately a little storm will develop in the mid-atlantic. we expect a rainy, cool day from southern new england down through the mid-atlantic region along the coast. in other words, if you have weekend plans, try to get them outdoors on saturday. sunday may not be the nicest from areas from washington, d.c.
. we'll have that clip a little later in the show.>>>first, let'sget to the news live at 5:30 a.m. here at 30 rock in new york city. we begin on the trail. another day of campaigning today in the three battleground states. this morning, both candidates begin the day with stops in virginia. from there it'sn n tn t on to the president while mitt romney heads to florida. this morning's jobs report will set the tone. we'll have them live for you on "morning joe." it's the second to last jobs report before the november election. economists expecting about 113,000 jobs added. the unemployment rate to hover around the current 8.1%. after wednesday night's debate, which drew more than 70 million viewers, large crowds awaited both candidates on the trail. president obama greeted by 30,000 in madison, wisconsin, came out ready to fight back and showed the fire he was lacking in denver. >> when i got on the stage, i met this very spirited fellow who claimed to be mitt romney. but i know it couldn't have been mitt romney because the real mitt romney's been running around the country for th
freeze here inthecitybutwe'vehadthefirstfreezein the suburbs and i think it qualifies. 82 degrees fredericksburg. 81 for culpeper and manassas right now. a wonderful 79 degrees. this is your evening forecast. there'll be some clouds but it's going to stay dry. so don't worry about it. and i suggest you get out there and enjoy it too because temperatures will be dropping down into the 60s and it will be real, real good. here's the nation and you can see temperatures cincinnati 76. st. louis 76. little rock 81 and dallas 83. and we'll have temperatures around here tomorrow in the lower 80s so where they're at 81 in little rock right now it will look like that here for us. wichita 90 degrees and i think you can j get a seasons -- just get a sense of the colder temperatures back out to the northwest. that's where a big trough of low pressure has dug in. we get the benefit of high pressure on this side of the united states. so that means nice, warm conditions. oh and by the way, this warm trend is going to continue. it gets warmer before it even gets cooler. notice tomorrow's 8
there inyourcity? >>well, i thinkthefirstthingthat we need to do is to get power restored as quickly as we can. you know, there's an old saying that pictures are better than words. and for the president to come to atlantic city, i am most appreciative. he will see for himself the devastation that has been wrecked on this city by sandy. but i'm happy to say that although the loss in terms of property is catastrophic, on the human side the loss was very minimal. not to diminish the loss of one life that we had, but there has been no real serious injury to our residents. we did have one fatality. and so on the human side, i think we came through this as best as we could hope. certainly we would like to have preserved all life, but we did unfortunately lose one. but again, on the property side, catastrophic damage. on the human side, very minimal, so i'll very thankful for that. >> seeing things very important but the actions of the people of atlantic city restoring power more important. what is the timeline, sir, that you think that people will get power? >> as we speak, crews are out a
in the midwest. forthefirsttimetherearenocitiesinvirginia or florida in the top ten. at least not for now. >>> i had, i don't know, 20-something jobs before i got elected president, but this is the first time in my life i ever got to be the warm-up act for bruce springsteen. >> 45-minute warm-up act, and it was a good 45 minutes. welcome back to "hardball." 19 days to the election, and barack obama is bringing in the big guns. the big dog and the boss. two legends in their own time. they came together for a joint appearance near cleveland this afternoon, and they made the sales pitch for the president's re-election and i guess energized a lot of blue collar voters out there who love this guy, rust belt people, hoping to shore up what i call the scranton/oshkosh corridor, where we make things in this country. i want to offer up a small thought, i think obama has yet to hit the right note about the auto industry and saving it. i think autos in this country are part of our culture. we love cars, loved the new models when we were kids. the fact we make our own cars and we're leadi
a couple hundred people still in their homes on the bay side ofthecity. thegovernor said it's a situation they will have to monitor and first thing in the morning at first light respond to and try to get those people out. not far from here just a couple blocks, one of the city's last resort shelters a guard unit went in there and pulled those people out and took them to atlantic city high school. so the shelters that were kept if place drawing criticism. chris christie's statement was there shouldn't have been shelters open here on the island. the winds are still coming ashore here. and we really won't know what kind of damage has taken place inside the city proper. i'm chris kato reporting for wcau. >> what he was explaining was cutting out of some of the time because we have a live shot in the middle of the storm about the controversy over those shelters. the the contrast is between the wishes of the local mayor and the wishes of the governor. governor chris christie saying there should not have been any sheltering in place on site in atlantic city that everybody should ha
," justyourfirststopof the day today on your nbc station. >>> 4:28. some of us waking up to some lingering sprinkles. this is the live view from our hd city cam. ahead, a look at what's in store for your weekend. first, good morning, everybody. i'm aaron gilchrist. >> and i'm angie. >>> police are searching for a man who shot twice while standing on his front porch. police say the victim was shot during a robbery. he was taken to the hospital and is expected to be survive. >> today the sixth gunman in one of the deadliest murder sprees in d.c. history will learn his fate. nathaniel sims will be sentenced this afternoon. sims admits firing an assault rifle into a crowd of mourners who gathered after a funeral in march of 2010. that funeral was for a young man sims and his friend had killed days earlier because one of them thought he had stolen his fake gold bracelet. in all, five people were killed. eight others were injured. prosecutors are recommending sims get a 25-year prison sentence because his testimony helped them convict the other five men involved in the attacks. >>> we
yorkcity's greenwichvillage halloween parade cancelled forthefirsttimein the parade's 39-year history. people asked to volunteer at local outreach centers to help storm victims instead. >> time for weather and traffic on the ones. tom said there is still rain lipgerring in our area. >>> just a few sprinkles in our area. you may need an umbrella. many getting back to work and school. no sprinkles right there on the mall. just up here in northwest washington, we have a view. 43 reagan national. wind out of the south around 10. occasional gusts at 15. as we look at storm team 4 radar, you can see the circulation of what was sandy still here up over pennsylvania. it has weakened a lot. still getting a few sprinkles these areas in green, much of northern virginia and into montgomery county. this is slowly drifting off to the north and east. right into the metro area, we may get a few sprinkles over the next several hours. in addition, many of the main stem rivers are near flood stage. that includes the potomac. maybe a foot above flood stage by early this evening. going to be runni
offn given the tomorrow. store march team has been the developments. we will go to brad bellincityandroz plater in park.e >> but first, where is sandy and where will it hit? .et's go to steve rudin >> it continues to make its trek , note north, northeast moving very best, but storm s up to 75 m.p.h. maintaining a category one status. living under the overnight hours during the day tomorrow, it is going to start e a move to the west and eventually make landfall w jerseye along the ne coast. looking at the doppler radar, now moving across the chesapeake bay. all this will continue to move west and it will the media metro area over the next hour or two. the big story will come and into tomorrow with the gusting wind, rain and the potential for snow out to the west of the mountains. story as werent gwith what's goin the flood watch that entire area as a warning for frederick county and a quick look at the warning will go into at 8:00 tomorrow morning until 8:00 tuesday evening. wind gusts up to 60 m.p.h. are not out of the question. on what'sa check ocean cityght now in bade things a
. thank you. can you tell usaboutcitydogs?>>sure.firstoffi will tell you about pet overpopulation. we are talking about animal shelters basically 8 million pets are brought to the animal shelters per year. about four million make it to homes. the other four million are killed. so groups like citigroup rescue, people volunteer to bring foster dogs in their homes and we keep the dogs until new homes are found. >> all right. now, city dogs, is there a meaning behind that title? >> well, we are in the dupont circle neighborhood so, we are in the city. >> gotcha. >> it was started at the city dogs day care. we board some of the dogs there and some stay in foster homes until they are adopted. >> thank you for the good work you do. we are showing a picture -- live shot i should say of truman going nap pi time. >> we got truman about a week or so ago. >> he opened his eyes like talking about me. >> he is a senior. he is about 10 years old, a hound great dane mix. basically not wanted by his family. we don't know the story. they brought him to the shelter. they didn't want him any more. we
isthefirstcityinamerica to offer the government bank i.d. card regardless of status. what makes the i.d. card unique is the debit card function which allows lower-income people to avoid check cashing fees. the program is expected to take 60 to 90 days to roll out. there will be a one-time fee of $10 for minors and senior citizens. richmond is considering a similar program. >>> in the south bay, the allen rock school district is eliminating 18 teaching positions and will combine classes to reduce spending. these moves will save them more than $1 million. school officials blame shrinking enrollment which reduces funding coming from the states. we will take a look at weather and traffic after the break. >>> welcome back. we have beat the heat. temperatures are the hottest temperatures we had all year. arrived just in time for the first week of october. now it will start to feel more like october. we have a couple of more hot days to get through. temperatures today 95 degrees in livermore. 95 in fairfield. 85 degrees in san jose. look at where we are headed. temperatures just crash as we
october 16th and this fan wasthefirsttobe injured. >>> a newyorkcitymanaccused of stabbing and killing two young children remains in a medically induced coma this morning. so far no charges have been filed against the nanny. the nanny worked for the family two years and recently run into financial trouble. a memorial is now bowing outside the family's apartment building. the motive is still under investigation. >> hundreds of people gathered in new jersey to say their final good-byes for a girl who was killed by two brothers. it was standing room only where autumn pasquale has touched so many lives. she was found inside a recycling bin and two teenage brothers are arrested in connection with the death. one of the teens lured her in the home and she was found dead after a massive search by police. >> this is a party in the hollywood hills. this is the edge of a raised parking lot. they were in a town car when they rammed the car and both cars fell 20 feet down into an apartment complex courtyard. all seven people were hurt and few of them had broken points. the drive thought
after losingthefirsttwogames. they win the best of 5, 6-4. sadness at of newyorkcity. joe'sstill says he will manage tonight against the orioles in game 4. everyone is still talking about last night. he blasted two zingers. this shot in the 12th. up 2-1. game 4 is tonight. >> how big is the not in your stomach? >> i do not having not in my stomach. -- a knot in my stomach. >> he does not have they knot. that was not the only walk off. detroit and oakland. smith will try to score from second. yes, sir. the a's when bank and the dramatic season continues. -- win and the dramatic season continues. the redskins play host to the vikings on sunday. while all the other nfl matches have been updated in las vegas, the odds on the redskins have not because of the uncertainty around rgiii. he was back on the field today. everybody is optimistic that he will start on sunday. but the cable be the defense. -- but the key will be the defense. >> he looks pretty good. he still has great vision. he is not 100%, he is 98%. >> basketball fans, the wizard's play a preseason game. tipoff is 7:00 at t
'sfirstamendmentrights. the ads have been posted in newyorkcitysubwaystations since last month. >>> five minutes after the hour, and the nationals playoff run off to a great start. they won the opening game of the national league division series, and the game's big hero started the game on the bench. >> and a line drive to right field. coming on in, it's a base hit. beltran throwing on in, but two runs score. and moving on the throw to the plate is tyler moore. >> tyler moore's pinch-hit in the eighth inning scored the tying and winning runs, and the nats beat the world series champion st. louis cardinals 3-2. moore admits he was a little nervous when he was at bat. >> i'm coming off the bench in front of 50,000 people, so it's crazy. i've been in that position before, and i was able to calm myself down and just kind of put the barrel on it. >> you did good. the nationals will look to take a commanding 2-0 lead in the series this afternoon in st. louis. first pitch scheduled for just after 4:30. >>> orioles fans not celebrating this morning. the o's fell to the yankees last nig
firstreportedby the "washington post."thecitysaysthe settlements were necessary to avoid litigation. >>> the d.c. council will begin to consider a change to those controversial speed cameras. today, councilmember tommy wells will formally introduce legislation that will reduce the amount of the camera fine. right now, speed camera tickets can be as much as $250. if you don't pay within $30, that fine doubles. >> there needs to be a fine for speeding because it is dangerous. if we create certainty that you'll be caught, we reduce this. traffic fatalities have gone down. we know they work but there is no correlation to how high the fines are for speeding. >> reporter: red light camera fines won't change but councilman wells hopes this move will help eliminate the suspicion that cameras are only meant to make money for the district. >>> a collision on the campaign trail involving the first lady michelle obama. >> don't worry. she is okay but there was a bit of a fender bender that left a few people in the hospital. we're checking more headlines coming up next.
theirfirstjobin the state. we think of ourselves as a magnet for talent of -- forourcityandthis region of the country. the debate amplifies our ability to be that magnate. it really does. that has been the case in debates passed for the universities that have sponsored them. >> a couple of the schools have hosted debates in the past. this is your first. did you go to the schools and seek advice about how to pull this off effectively? >> we talked to a number of them. members of our team certainly visited some of the schools to see what their preparations were like. there was certainly a lot to be learned. one of the things that was clear was that the experience of this institution is an individual one. it depends on the venue. it depends on the campus culture. leadership of those institutions was certainly very gracious in opening up to us about what it had been like. virtually all the said it is a far, far greater thing one can possibly imagines. in the course of the last few weeks we have certainly learned that. a very complex, a major event, that certainly has been a test for our te
hooverfirstcamein,thecitycouncildecided to say they were boring to pass along a law banning hoovers because it would disrupt the traditionalists taxi system. it was sort of a clash between old and new, and in the end, the innuendo -- the new ended up winning out. but there are people with a stake in preserving the status quo. we need leaders who are willing to embrace technology and embrace the future in the name of jobs, in the name of a lot of other areas around procurement. >> as the last academic, i think i should say that one of the strongest defenders of the status quo is academia. since we are here at wayne state in an academic institution, i think it would be useful to pick up on the point, to look at how our graduate degree structures intersect with the need of the non-academic labor market. right now, our graduate programs are focused on producing people with ph these for the academic for therket, -- ph.d.'s academic labor market, which is not expanding rapidly, if at all. yet you have companies looking for highly educated people they say they cannot find. academia
Search Results 0 to 49 of about 464 (some duplicates have been removed) | 2024-01-23T01:26:29.851802 | https://example.com/article/3193 |
Groovy Code Notation: Like Java, Only Different
Code as objects: closures
The concept of closures is not a new one, but it has usually been associated with functional languages, allowing one piece of code to execute an arbitrary piece of code that has been specified elsewhere.
In object-oriented languages, the method-object pattern has often been used to simulate the same kind of behavior by defining types whose sole purpose is to implement an appropriate single-method interface so that instances of those types can be passed as arguments to methods, which then invokes the method on the interface.
A good example is the java.io.File.list(FilenameFilter) method. The FilenameFilter interface specifies a single method, and its only purpose is to allow the list of files returned from the list method to be filtered while it's being generated.
Unfortunately, this approach leads to an unnecessary proliferation of types, and the code involved is often widely separated from the logical point of use. Java uses anonymous inner classes to address these issues, but the syntax is clunky and there are significant limitations in terms of access to local variables from the calling method. Groovy allows closures to be specified inline in a concise, clean, and powerful way, effectively promoting the method-object pattern to a first-class position in the language.
Because closures are a new concept to most Java programmers, it may take a little time to adjust. The good news is that the initial steps of using closures are so easy that you hardly notice what is so new about them. The aha-wow-cool effect comes later, when you discover their real power.
Informally, a closure can be recognized as a list of statements within curly braces, like any other code block. It optionally has a list of identifiers in order to name the parameters passed to it, with an -> arrow marking the end of the list.
It's easiest to understand closures through examples. Figure 4 shows a simple closure that is passed to the List.each method, called on a list [1, 2, 3].
Figure 4. A simple example of a closure that prints the numbers 1, 2, and 3
The List.each method takes a single parameter -- a closure. It then executes that closure for each of the elements in the list, passing in that element as the argument to the closure. In this example, the main body of the closure is a statement to print out whatever is passed to the closure, namely the parameter we've called entry.
Let's consider a slightly more complicated question: if n people are at a party and everyone clinks glasses with everybody else, how many clinks do you hear? (Or, in computer terms: what is the maximum number of distinct connections in a dense network of n components?) Figure 5 sketches this question for five people, where each line represents one clink.
Figure 5. Five elements and their distinct connections, modeling five people (the circles) at a party clinking glasses with each other (the lines). Here we have 10 clinks.
To answer this question, we can use Integer's upto method, which does something for every Integer starting at the current value and going up to a given end value. We apply this method to the problem by imagining people arriving at the party one by one. As people arrive, they clink glasses with everyone who is already present. This way, everyone clinks glasses with everyone else exactly once.
Listing 5 shows the code required to calculate the number of clinks. We keep a running total of the number of clinks. When each guest arrives, we add the number of people already present (guestNumber1). Finally, we test the result using Gauss's formula for this problem -- with 100 people, there should be 4,950 clinks. (Johann Carl Friedrich Gauss (17771855) was a German mathematician. At the age of seven, his teacher wanted to keep the kids busy by making them sum up the numbers from 1 to 100. Gauss discovered this formula and finished the task correctly and surprisingly quickly. There are different reports on how the teacher reacted.)
Note that guestNumber appears four times in the Java code but only twice in the Groovy version. Don't dismiss this as a minor thing. The code should explain the programmer's intention with the simplest possible means and expressing behavior with two words rather than four is an important simplification.
Also note that the upto method encapsulates and hides the logic of how to walk over a sequence of integers. That is, this logic appears only one time in the code (in the implementation of upto). Count the equivalent for loops in any Java project and you'll see the amount of structural duplication inherent in Java.
The example has another subtle twist. The closure updates the totalClinks variable, which is defined in the outer scope. It can do so because it has access to the enclosing scope. That it pretty tricky to do in Java. (Java pours syntax vinegar over such a construct to discourage programmers from using it.)
Groovy control structures
Control structures allow a programming language to control the flow of execution through code. There are simple versions of everyday control structures like if-else, while, switch, and try-catch-finally in Groovy, just like in Java.
In conditionals, null is treated like false and so are empty strings, collections, and maps. The for loop has a for(i in x) { body } notation, where x can be anything that Groovy knows how to iterate through, such as an iterator, an enumeration, a collection, a range, a map -- or literally any object. In Groovy, the for loop is often replaced by iteration methods that take a closure argument. Listing 6 gives an overview.
The code in listing 6 should be self-explanatory. Groovy control structures are reasonably close to Java's syntax.
That's it for the initial syntax presentation. You've got your feet wet with Groovy and you should have the impression that it is a nice mix of Java-friendly syntax elements with some new interesting twists.
Summary
You've got the first impression of Groovy's code notation and found it both similar to and distinct from Java at the same time. Groovy is similar with respect to defining classes, objects, and methods. It uses keywords, braces, brackets, and parentheses in a very similar fashion; however, Groovy's notation is more lightweight. It needs less scaffolding code, fewer declarations, and fewer lines of code to make the compiler happy. This may mean that you need to change the pace at which you read code: Groovy code says more in fewer lines, so you typically have to read more slowly, at least to start with.
About the Author
Dierk König is a senior software developer, mentor and coach. He publishes in leading German magazines on software development and speaks at international conferences. He works at Canoo Engineering AG, Basel, Switzerland, where he is fellow and founding partner. Since the first edition of this book came out, he has worked almost exclusively with Groovy, be it as an engineer, architect, consultant, or trainer. His single and multi-day trainings on Groovy and Grails attract lots of attention. He joined the Groovy project in 2004, working as a committer ever since.
Guillaume Laforge is the official Groovy Project Manager and Head of Groovy Development at SpringSource. He founded G2One, Inc. (later acquired by SpringSource), a professional services company dedicated to sustaining and leading the development of both Groovy and Grails. You can meet Guillaume at conferences around the world where he evangelizes the Groovy dynamic language, Domain-Specific Languages in Groovy, and the agile Grails web framework.
Dr. Paul King leads ASERT, an organization based in Brisbane, Australia which provides software development, training, and mentoring services to customers wanting to embrace new technologies, harness best practices and innovate. He has been contributing to open source projects for nearly 20 years and has been an active committer to Groovy since he joined the project in 2006. Paul speaks at international conferences, publishes in software magazines and journals. He has the pleasure of working with Groovy on a regular basis with many of his agile customers.
Jon Skeet is a Java developer working for Google in London. He is a C# author and community leader, spending far too much time on the Stack Overflow developer Q&A site. Jon's re-learning Groovy along the course of this book, standing in the readers' shoes and pulling up the rest of the authoring team if they steam ahead too quickly. His aim is to help to translate the experience and knowledge of the other authors into the most readable and informative text possible. | 2023-12-15T01:26:29.851802 | https://example.com/article/1546 |
Q:
Determining which isolation level is appropriate
This is a homework question.
For the following transactions state the isolation level that will
maximize throughput without lowering the integrity of the database.
Explain the answer.
Change the course identified by coursed_id = ’CPSC1350’ from one
department to a different one.
The Courses table contains information about courses: their id, their name, the
department that offers it, the id of its instructor, and the maximum
number of students who can take it (max_size). Courses(coursed_id:
string, cname: string, dept: string, instructor_id: string,
max_size:integer) – Primary Key: coursed_id – Foreign Key:
instructor_id references Instructors
Assume that PostgreSQL is used.
I believe the transaction can be done using read committed because
dirty reads are not OK because there is an update going on, thus a read is involved
non-repeatable reads are OK because it is unlikely someone else is changing the value
phantoms are OK because there are no SELECT statements
Am I on the right track?
A:
The question seems like a puzzle which appears very simple, but maybe not so simple ,or it just pretends to be complex... I'll try my best answering it as I understand it. I apologize if I misunderstood some obvious hints.
With PostgreSQL, there is no real Read uncommitted - you get Read committed. Quoting the documentation:
In PostgreSQL, you can request any of the four standard transaction isolation levels, but internally only three distinct isolation levels are implemented, i.e. PostgreSQL's Read Uncommitted mode behaves like Read Committed. This is because it is the only sensible way to map the standard isolation levels to PostgreSQL's multiversion concurrency control architecture.
The question doesn't sound very clear to me because isolation levels matter when you have simultaneous queries, and no other queries mentioned, so don't blame me too much if I miss something.
If we put remaining isolation levels in the order "Read committed"->"Repeatable read"->"Serializable", the overhead grows accordingly. So we need to check them in the same order, and once we are satisfied, there is no need to check remaining levels (they will be fine, but with more overhead). As far as I understand, UPDATE Courses set dept = 'New department' coursed_id = ’CPSC1350’ does the required work. From Postgre documentation that describes Read committed isolation level,
UPDATE, DELETE, SELECT FOR UPDATE, and SELECT FOR SHARE commands behave the same as SELECT in terms of searching for target rows: they will only find target rows that were committed as of the command start time. However, such a target row might have already been updated (or deleted or locked) by another concurrent transaction by the time it is found. In this case, the would-be updater will wait for the first updating transaction to commit or roll back (if it is still in progress). If the first updater rolls back, then its effects are negated and the second updater can proceed with updating the originally found row. If the first updater commits, the second updater will ignore the row if the first updater deleted it, otherwise it will attempt to apply its operation to the updated version of the row. The search condition of the command (the WHERE clause) is re-evaluated to see if the updated version of the row still matches the search condition. If so, the second updater proceeds with its operation using the updated version of the row.
I'd say I'm satisfied with such behaviour in this case, so I'll go with READ COMMITTED unless there are other restrictions not mentioned in the question.
| 2024-03-19T01:26:29.851802 | https://example.com/article/6720 |
Which is more valuable, longer survival or better quality of life? Israeli oncologists' and family physicians' attitudes toward the relative value of new cancer and congestive heart failure interventions.
We determined how Israeli oncologists and family physicians value life-prolongation versus quality-of-life (QOL)-enhancing outcomes attributable to cancer and congestive heart failure interventions. We presented physicians with two scenarios involving a hypothetical patient with metastatic cancer expected to survive 12 months with current treatment. In a life-prolongation scenario, we suggested that a new treatment increases survival at an incremental cost of $50,000 over the standard of care. Participants were asked what minimum improvement in median survival the new therapy would need to provide for them to recommend it over the standard of care. In the QOL-enhancing scenario, we asked the maximum willingness to pay for an intervention that leads to the same survival as the standard treatment, but increases patient's QOL from 50 to 75 (on a 0-100 scale). We replicated these scenarios by substituting a patient with congestive heart failure instead of metastatic cancer. We derived the incremental cost-effectiveness ratio per quality-adjusted life-year (QALY) gained threshold implied by each response. In the life-prolongation scenario, the cost-effectiveness thresholds implied by oncologists were $150,000/QALY and $100,000/QALY for cancer and CHF, respectively. Cost-effectiveness thresholds implied by family physicians were $50,000/QALY regardless of the disease type. Willingness to pay for the QOL-enhancing scenarios was $60,000/QALY and did not differ by physicians' specialty or disease. Our findings suggest that family physicians value life-prolonging and QOL-enhancing interventions roughly equally, while oncologists value interventions that extend survival more highly than those that improve only QOL. These findings may have important implications for coverage and reimbursement decisions of new technologies. | 2023-12-02T01:26:29.851802 | https://example.com/article/6149 |
Prophylactic administration of ranitidine after sclerotherapy of esophageal varices.
The present trial was carried out to determine the usefulness of H2-receptor antagonist drug therapy for the prevention of esophageal bleeding and esophageal varices in patients who underwent sclerotherapy. According to randomization, out of the 58 patients, 28 received, along with the usual standard therapy, ranitidine and 30 received placebo. Ranitidine, 50 mg, was administered intravenously over a period of 3 days every 8 hours, and then 150 mg of ranitidine was given per os in the evening for one month. For improvement of hemostasis and during the elective sclerotherapies, 1% polidocanol was used as the sclerosant. During each puncture, 2 ml was injected. Injections were paravasal and intravasal. After sclerotherapy, endoscopic examinations were carried out on the third day and one month later. Necrosis was noted in 42% of the patients and esophageal mucosal inflammation in 26%. Esophageal ulcers did not occur. There was no statistically significant difference between the two groups in terms of age, sex ratio, cause of liver cirrhosis, and the Child's classification. The size of the esophageal varices had no effect on the development of esophageal mucosal changes in correlation with the quantity of sclerosant. The comparison of the two groups of patients, sclerosed for hemorrhage and sclerosed electively, showed no statistically significant difference regarding esophageal mucosal changes. No differences between the ranitidine and placebo groups of patients were observed in this indication. It can be concluded that esophageal mucosal changes probably arise as a consequence of the sclerosant, its concentration, quantity and mode of application.(ABSTRACT TRUNCATED AT 250 WORDS) | 2024-01-22T01:26:29.851802 | https://example.com/article/4543 |
version: 2.3-b{build}
# version: 0.6-latest
skip_tags: true
image: Visual Studio 2017
configuration: Release
platform:
- x86
# - x64
init:
- cmd: echo %cd%
- cmd: curl -L -o %temp%\add_gitutf16.py https://raw.githubusercontent.com/rexdf/CommandTrayHost/master/add_gitutf16.py
- cmd: C:\Python36\python.exe %temp%\add_gitutf16.py
# clone_depth: 1
clone_folder: c:\projects\CommandTrayHost
install:
- cmd: >-
cd /d c:\tools\vcpkg
rem git reset --hard
rem git clean -ffdx
rem git pull
rem bootstrap-vcpkg.bat
cd /d c:\projects\CommandTrayHost
vcpkg install rapidjson rapidjson:x64-windows nlohmann-json nlohmann-json:x64-windows
C:\Python36\python.exe vcpkg_patch.py
before_build:
# - cmd: cd c:\projects\CommandTrayHost
- cmd: >-
C:\Python36\Scripts\pip.exe install chardet pytz
C:\Python36\python.exe version_set.py %APPVEYOR_BUILD_NUMBER% 2 3 4
build:
project: c:\projects\CommandTrayHost\CommandTrayHost.sln
verbosity: minimal
after_build:
- cmd: msbuild "c:\projects\CommandTrayHost\CommandTrayHost.sln" /verbosity:minimal /p:Configuration=Release /p:Platform=x64 /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll"
- cmd: msbuild "c:\projects\CommandTrayHost\CommandTrayHost.sln" /verbosity:minimal /p:Configuration=XP-Release /p:Platform=x86 /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll"
# - cmd: cd c:\projects\CommandTrayHost
- cmd: >-
mkdir CommandTrayHost-x64
mkdir CommandTrayHost-x86
mkdir CommandTrayHost-xp-x86
copy x64\Release\CommandTrayHost.exe CommandTrayHost-x64\
copy Release\CommandTrayHost.exe CommandTrayHost-x86\
copy XP-Release\CommandTrayHost.exe CommandTrayHost-xp-x86\
curl -L -o upx.zip https://github.com/upx/upx/releases/download/v3.95/upx-3.95-win64.zip
7z e upx.zip *.exe -r
upx CommandTrayHost-x64\CommandTrayHost.exe
upx CommandTrayHost-x86\CommandTrayHost.exe
upx CommandTrayHost-xp-x86\CommandTrayHost.exe
7z a -tzip CommandTrayHost-%APPVEYOR_BUILD_VERSION%.zip .\CommandTrayHost-x64\ .\CommandTrayHost-x86\ .\CommandTrayHost-xp-x86\
artifacts:
- path: CommandTrayHost-%APPVEYOR_BUILD_VERSION%.zip
name: CommandTrayHost
deploy:
release: $(appveyor_build_version)
description: 'nightly'
provider: GitHub
auth_token:
secure: 6BqGKqbQbDfnZ3Y7SHvdQkPVCjXcJ1GIgPe41oD8K7ttPY/ivWN3iMyq2eZ1s4RD # your encrypted token from GitHub
artifact: CommandTrayHost # upload all NuGet packages to release assets
prerelease: true
force_update: true
on:
branch: release
appveyor_repo_tag: false # deploy on tag push only
cache:
- c:\tools\vcpkg\installed\ -> vcpkg_cache.txt
| 2024-07-01T01:26:29.851802 | https://example.com/article/6174 |
1. Technical Field
The present invention relates to a liquid crystal display, and more particularly, to a liquid crystal display having a common electrode and pixel electrodes formed on a single substrate, and a method of manufacturing same.
2. Discussion of the Related Art
A liquid crystal display (“LCD”) is one of the most commonly used flat panel displays. The LCD, which includes two panels having a plurality of electrodes thereon and a liquid crystal layer interposed therebetween, controls the transmittance of incident light by applying voltages to the electrodes to rearrange liquid crystal molecules of the liquid crystal layer.
The LCD has several desirable characteristics, such as an ultra-thin profile, low power consumption, and decreased generation of potentially harmful electromagnetic waves. However, an LCD may have relatively poor lateral visibility compared with front visibility. In this regard, various attempts to overcome poor lateral visibility have been made, including liquid crystal alignment and driving methods. For example, LCDs having a wide viewing angle in a patterned vertical alignment (“PVA”) mode, and an in-plane switching (IPS) mode have been developed.
However, the PVA mode LCD may exhibit textures or afterimages. In the IPS mode LCD, since the aperture ratio may be deteriorated by a common electrode, resulting in a reduction in the response speed of a liquid crystal, the demand for a backlight unit implementing high brightness has increased.
To achieve a wide viewing angle and high brightness, a Plane to Line Switching (PLS) mode LCD adopting the IPS mode has been proposed. In the case of a high resolution and large-sized liquid crystal display driving at a high speed of 120 Hz or greater, however, it is desirable to develop thin film transistors having high mobility characteristics in channel areas. | 2024-07-16T01:26:29.851802 | https://example.com/article/7139 |
Jeremy Schaap had quite the sitdown with Manti Te'o before he ever spoke with Katie Couric. From his time with the Notre Dame star, Schaap is convinced that Te'o got fooled, but that doesn't make him stupid. Schaap also provides some details on just how Te'o got taken in.
Transcript - will not be 100% accurate
Back Dennis and Callahan -- difficult stories arise stories that need examination and held up to the light. And depth and breath of interviewing. -- -- -- and one man and one man only and he joins us on the AT&T halt late AT&T forgy LTE yes the mobile chairmanship of morning -- John Nigerian Boston placed particular few minutes. -- -- Just -- the guy Jeremy are you the one who's gonna sit down and talked the run Rene wrote to us Sobel at some point who's gonna get him who is gonna get that in -- But let's that's a very good question I'd certainly like to be because that -- flight deck and -- the final missing piece -- -- puzzle well maybe that's putting it. The wrong ways this could be a lot of pieces. Still of this puzzle but I don't know where he is. Nobody I think immediate at any contact with him directly and no we had people work and -- -- -- -- out on the West Coast she's done a great job on this story. You know. Is the whole -- so crazy at Politico about Francona. What I have to that's pretty crazy to that is crazies will get given a second -- supporting Jeremy I'm I'm sure you're probably aware Good Morning America. Enlisted the help of voice. We're aware. Voice analysts experts who said there is no way it is possible that the voice heard on those three voice mails released yesterday is a voice of a man. The post now is reporting there is -- -- York new York New York Post the good ones better ones the committee that a third party. Tuiasosopo is cousin yeah no we just so bowl a female was the person on the phone those 1000 hours so it is eight. Here because I'd like it's it's not like -- expect every person in the country to read the full transcript of part two and a half hour interview you online and yet yet but I said in the piece that I did that said repeatedly on TV. That meant -- -- it always said that it was three people were the voice -- -- -- One female in commit. But yesterday. Tuiasosopo lawyers said that he would -- people write that contradicts the pale. That note. Which obviously he -- only -- to react to -- because he's the only person that contact with. According to. So so hey you know we have to assume -- -- polled by -- at its Opel itself that would phone conversation they had a week ago Wednesday. On the official following them a little itself. That which we have double called to apologize and explain himself whatever. -- -- He told them. That he did three people that he can be contradicting that -- the different you know but nobody seemed to. You know connected got yesterday. That that contradicted. What -- pulled me and I've been reported last week. Do you have any theories or are there any. Plausible theories as to what the motivation would be in this entire thing Jeremy. It -- there there's so many if I take every person I've spoken to covering this story or just follow it has their own theory to meet. I mean you know KO. Seems to think that this is just until it got that control. And you know certainly that. Conform to what we know about white people typically you know or doing these tax fishing this one seems to follow that template pretty closely. You know have I heard all kind of creepy eerie -- up a bit of their democratic vote patients like will lied to keep doing it. Why did they do what you -- oh. You know what underlying underlying com. You know psychological. Problems with somebody have to do -- what perpetrate this that if somebody else. But you know one thing effort program out there and maybe to responsibly could repeat this because. There's no evidence to people talk about it is that you know. These guys are from Southern California Tuiasosopo. And -- you know. Buddies who might be behind this. A lot of Greek -- players obviously -- US he'd -- type -- very publicly chose Notre Dame over US. -- and this whole thing started when he was a freshman in -- game. Maybe they -- him some -- -- trail that he didn't go beat USC. Is started met him the bad it's just another. Or when you sat down all of them in Florida -- what were your impressions Jeremy is he. As dumb as you would have to be hope for this as naive as gullible as as we think from afar. You know what. I'd get a I didn't Kuwait from our. Time together they get it totally was. Four hours I'd never laid eyes on him before I walked in that conference room at -- cat right away. I certainly can live with the impression that you know we're dealing with someone who -- -- very sophisticated. You know and it wasn't very wise -- the -- the world. But stupid is not a word I would use to describe him. You know. I feel like -- dealt with stupid people and that that wasn't that wasn't the impression I walked away with a. So naive gullible. Well yeah I mean clearly of this -- Jordan he was -- and Goebel but I'm not social work. You know big -- It could have happened to anybody. You know I I think one thing that we have to bear in mind here's the timeline. You know people say well this is going on for years bullets we believe -- it wasn't really years there which -- Discontent. Every day that -- kind of relationship over the phone that was dead just for mid may until September 11 it. You know they're big communications intensifying in fall 2011 he says the time the Purdue game and then you know it. Around New Year's 2012 and why he's trying to get together with urged sort of mop. -- you you know whatever. We we know from the movie cat fishing in the TV show and all that that this is something that happens to people -- they get gave them. You know it ended this day and age when it's so easy to communicate with people by means other than. You know talking to their mid day and shaking their hand than seeing them in person. You can see why the potential exit. And he put me guys the big picture here. I would -- in the last night you know. You we believe. This he would perpetrated. The hoax -- he would what are the people behind it. Didn't all of the talk about the little lies you know -- leading reporters about whether you actually met her. You throwing his dad better when he added it doesn't matter. -- -- -- -- -- Did you really. -- -- OK. Now if she didn't perpetrate the hope. Is he's a victim of which I think is the way most people are now thinking right now because there -- No evidence that he perpetrated it in there seems to be a lot of evidence that he didn't. That these little lie. You know because he wanted to -- face he just immaterial may. In people or kill them for it in -- -- Can't quite get on board with killing him for it they will be limited society. You know where. We are constantly lied to by politicians and celebrities and athletes should know. You know for no good reason you know audited self aggrandizement. -- that did it. Who -- if you believe this far that there about it the -- but if you believed you would hope he would the victim here then. You know it's hard to really I think get upset with him about the little lies because. And what he's supposed to do writes we get the phone call on December 6. -- woman who we thought we did we spent all the time with a -- on over 500 hours on the old wind between may and September. That guess what I'm alive my -- truly Leah. Very confusing. Can be explained it all drug -- -- communicate later -- national TV Chris Fowler asked him you know about. He's dead girlfriend or whatever what what what was supposed to do you know say well actually Chris you know. Apple called for over two days ago. Her that she's alive. And really sure what happened and we'll try to sort it out but I wouldn't Uga -- if -- were might -- is right now nobody would drew back. Not a German ship you spent 44 and a half hours with this guy and and it's sounds like you're certainly not ready to say you're 100%. Convinced that -- anti -- is a complete innocent victim here but what does your gut tell you about this do you think that he might have suspected. But really got -- led down the primrose path and didn't really know until December 6. Was gonna. Well I don't think he even knew what December fixes would be true. You know I I really you know I don't know why he would like to meet you know I'd say. If you really know for shortly got the direct messages from -- -- Opel spoke to 1 January 16 if he didn't because kidnapping. To gain by telling me he was January 16 which we've -- in December 24. He went to duke game on December 26. You know you didn't make any public comments after the you know game. On board that he or wherever right so you know when he says that I really wasn't sure until they told me. I can't I can't they tell the true -- don't wait for me to know whether he's telling the truth all like to date I I believe the. What if if indeed he's telling the truth and and we also know because as you said this yesterday. That that he had doubts he asked for the picture and and and we reported that and you didn't report that as well. It's seems to me that that it even if they got those doubts he set aside which indicates he wanted to her to be real she was a dream. Girl in his mind somebody in a creation of his mind that he wanted her to be real. Yep well it's not just that that's true but it's such -- setting the -- Side of me you know we we had the text messages he talked about in the interviewee quote that the transcript where he had people. Who you know. Confirmed for him you know that she's really you know you. You know I've talked with -- dealt with very you know that was early in the relationship like 2010. Before again. He's says the intensified. In those. Alleviated his doubts now. -- do I think that there were still moments. When. You probably -- himself. You know what's going on here I do but I don't think that those moments took place between September 12. In December 6 when he was telling this story ESPN and sports field trip to New York Times CBS evening news. Now in the other keeping year but again. -- I'm not an advocate at this college yet if you really dig deep in this thing. And you consistent with the you're thinking on it you can only get to this conclusion if you think you behind it hope. Again I think -- people think that now that may be beefed up right. Didn't necessarily. Believe that on September 12 seed in the Notre Dame -- He gets a phone call earlier in the days that is that grandmothers that woman he's extremely close to -- community family means everything. He grew up with this woman dead stayed. If we believe that he's behind the hoax and we go to his grandmother did I found out that day but a few hours later he orchestrates. He didn't Notre Dame locker room he'd eat -- that -- seeking garbage. You know very emotional I think -- crying. You know. If people -- what's wrong with my girlfriend also guys yet console by Brian Kelly. Peeking into his office speaking at the players let get away from everybody else. So if you believe that he perpetrated -- he was behind it from the beginning. Then you'd think that this guy. On the day that you find that grandmother -- also orchestrates this seat. All -- that's that is really hard to believe German but. Not sure it's any hard to believe then an old man -- yes this Opel and his cousin. Tino. Ronnie and Tino Tuiasosopo spent a thousand hours on the phone with the guy. But we don't put them then all the hours on the phone. Yeah but what if they you know it was justice -- Brandon on their friends and there were talking and they said look I mean and I got scammed I mean. I our if the -- of global 500 dollars with -- imaginary girlfriend is no easier to lead you to believe with a -- paid for it. I mean for me a girl you've never seen or touched. Well that's what you on the photo. -- it hey hey. This this is. I I never thought we'd be talking about. You know what. I've got to try to beat that this is great debate but we didn't like going back. To me it you know I've talked about this with my colleagues at work and the people that work for you know it's always seemed like the fly in the ointment. In it for people who say that he had to create that they'll try to get exactly why you know to get I. Well it why can't come up what motive here his his motive of makes more sense than to yes assault his motive. -- -- Heisman pick will not the -- Heisman but just a better to have higher profile I mean this is a guy who it it was so marketable and Richard Armey he's he's the most famous -- called football and part of the story is the dead girlfriend. -- and I understand but if what -- -- though is that you know he doesn't start telling people about this and it till after Brian Kelly -- Okay after the September 12 incident in the locker. Brian Kelly the first person to tell the public it's partly to tell. Think he's got the one out there first disseminate it is you create -- CNET -- thing in the locker room. Because he wants to garner sympathy he's like are my grandmother died today how -- -- make it's really good I'm gonna throw Mike. I I will give me that his motive his -- Grass court what will gimme gimme Ron Hornaday give me running at -- two -- opens -- of well. I mean we know a lot of people do that phenomenon because it would have meant was people -- about 4000 I'll worse. Certainly this is what happened I -- go look at the documentary people have nothing here there are people who have nothing better to do lives. It seems like Tuiasosopo. Frustrated. You know reality star and reality shows singer -- He you know somebody according to at least six other people I think we now know is done lifted them. It's not like it was the only guys just the guy who would most gullible and political on the long distance but I I'd be wrong maybe the biggest city in the world. You're probably right just both both scenarios -- just so hard to believe what Telus Telus does Jeremy you argue are the best that this -- the best you know sit down Q&A guy. Out there do you think you will you do you have a shot at Tuiasosopo I know you were economic. I'm going to be totally -- to the right now I I've got no I've got no waves reaching him I've I've had no contact you know I know I figured -- -- happens I think down. Actually that is better positions he worked in the west West Coast angle I have not been able to get in touch with him. You know I've seen the numbers that anti -- from and obviously there's no answer there. In. I I hope so I hope so it. Well his girlfriend Communist cousin he know who now and we now think is the voice. She's in Congo Congo so you might have to get on a plane that Americans. Mall I need to miles. It's just that's -- accumulate. Jeremy Sepracor religion go to -- -- my feeling that he is in addition to finding out today about Tino Tuiasosopo and they're still and another huge blockbuster or two to land on her head before this thing plays itself completely out. Well you know it if we believe would have told me it was three people cited -- that qualified. Lot like him I think. I don't know what I know how much more surprising stuff can happen and I think that the capacity to really marble at this is wearing state. You know. The whole thing is yes you know I think it's it's it's it's added. And it's it's amazing to -- that. You know everybody you'd still fascinated that they are they are there it is so open about this story. That. People like compel. And -- you have any reason the Tuiasosopo would want any dipped by killing her off the data grandmother died. Bet that's the thing that I mean they have to be. You know do that to him on daily suffering so much they got to be really sick yeah you know the only supposition is that you know. Who knows they were getting -- had a -- -- it they're just they couldn't maintain hours on the phone. You know we UB you know -- get it demanded in person meeting eventually. You know district that set him up you know enough months before I don't know you know eventually -- Talk about motivation -- -- used to admit I said they never asked for money. He didn't have any money. The because apparently didn't have a dime you know you know do you want to say that because you know he's very sensitive about the image of the families that group but I don't execute as. -- disposable income like most college kids but that does that mean they warned that -- money what he's trying to deal. Well if they decided to end it for whatever reason that they were tired of it had run its course. Why would they then resurface and called and apologized would you say what we got away with -- we're we're we're -- -- got great let's let it die. -- In two days before I can trophy ceremony at USC theory holds here you know. You know it also the other reason is this according to say oh this is important and that's our -- track edition and so much swirling. What makes sense that -- over the few months from September to December. You know they'd -- team this emotional hole but and he was on the phone constantly with the people we thought were forcibly cut. And then they find out he's got another girlfriend. This girl Alex the PR did today. Indy get angry. And they're hounding him you know how you're betraying -- Monday and he. Read each stop the train -- -- she just you know -- you for this city you know in undermining her. In I think they were feeling like. -- got that sense that the USC week and in late November. Indeed was -- him possibly then again it does that theory. To keep him under their -- Fascinating stuff. I'm sure you'd ever have and never will cover story quite as layered and bizarre as this would Jeremy. I certainly hope and Jeremy stepped thanks so much for the title talk to down the road what Jeremy -- -- and the Tennessee Callahan on the AT&T hotline AT&T for less money LTE. I wanted to ask about his and that fills the nickname you know kind of player what -- drop and but it just -- public. Solar relevant data were on this this incredible once in -- lifetime. -- RO holocaust -- or yeah. And now who wasn't wet and slipped to 31 slipping past the patriots. In the draft which shocked me no way to take -- won't grab discount count you know. But it will blow his story be revived and on draft day -- -- won't be the most interesting guy. On draft day but it does help every time somebody comes in contact with him it will be reply -- -- in the green room because he originally was -- top ten guy man. And just sit in the NFL without him there. Would he bring clinic with the -- green room did you have to get invited by the NFL ahead with the NFL what that distract -- city action what a great store traction picture room. Gronkowski analysts brother Susan's parents yeah he could have LeMay and make it like holder and -- here and and and exit impediment layer and then we distressed to think you give him. -- -- -- I -- Elvis and I don't mean to help you out is is this -- thing is part of the beat the the unraveling as it is part of whole ploy. Get credit for at the order to get away Scott free. Is there is there a satisfaction. To do what they did it again and make this thing the Republicans are you gotta be like like Ashton -- assurances human part of pop yes thank you do have to say human and except. There's nothing but the prize -- -- for your you know your theory. But two weeks ago was that he was there and talk and the phone one Brandon and mrs. -- yeah. There's nothing although if the girls involved is the -- she's American Somalis she's in some. They're coordinating this effort -- the girl now we know keynote Tuiasosopo. Answer I have no doubt and the post is right the daily news is wrong that's a girl. I seem to agree yes so she can't beat. It -- on this planet she just maybe she felt with the the united and that's kind of normal -- could -- Plus she was a 66 number which is California so they -- church down on. All right and -- pop pop up. That was -- a 616 so. I don't there is an economic -- Jeremy Shelley Smith someone. This is not famous he's not Justin Bieber. Can't catch him coming out of the Jimmer coming out of lunch you know sub shoppers are holed up in somebody's house well he's got to come out at some point he probably has the addition -- the voice that he's got to go on that. AGT's effort a lot into question -- a record cat fishing and and when it's on MTV or seen it. Basically it is one person whose last attractively on attractive one trying to attract get a hold of the track the one pretend to have the relationship. Bottom line is one person shows up disappointed and the other -- shows up in basic eight in the other person shows up and he's just rushed that it's not the person you thought. -- -- Not the not the person that you know he thought and a wise and that everyone -- the the the -- we house's most side. They're just happened -- get their exit they're giggles over rallied somewhat up and thinking they've got the relationship auto world what -- world quick timeout doesn't Callahan still to com. Come oh we get honestly honestly I still think you might command and as you -- a melodic metal and -- job. Catch up policy hasn't given -- -- pasture we sure hasn't. | 2024-06-14T01:26:29.851802 | https://example.com/article/2113 |
Extreme exercise is good for you, right? Not exactly
If you want to get fit and lose weight, you should exercise as hard as you can, for as long as you can, every day, right? Wrong! Research shows extreme exercise can cause chronic health problems and make you feel worse. (What constitutes over exercise depends on the individual and their fitness level.) Recovery time is as important as the exercise itself.
Over exercising can cause the following health issues:
Increased inflammation
Fatigued adrenals, the stress-handling glands
More bad gut bacteria
Leaky gut
Depleted hormones
Depressed immunity
Increased risk of injury
Bone loss
Too much exercise raises inflammation
Many of the issues caused by over exercising stem from inflammation. Although appropriate exercise can be anti-inflammatory and very good for the brain, too much has the opposite effect.
The cellular damage from over exercising triggers a systemic inflammatory response that sets the stage for a host of other health problems.
Too much exercise stresses out your body
The damage and inflammation from over exercising is very stressful to the body. Excess stress underlies the burnout, depletion, and increasing weakness often seen with over exercising. Results can be fatigue, poor thyroid function, depressed immunity, and more.
Over exercising damages gut health
The gut and the bacteria it houses are increasingly being recognized as the seat of the immune system and foundational to our health.
Overdoing exercise has been found to damage the gut wall, causing “leaky gut.” This allows undigested foods, bacteria, yeast, and other pathogens into the bloodstream, where they then trigger inflammation throughout the body.
Overtraining also changes the composition of gut bacteria so there is too much bad bacteria.
How to know if you’re over training
How do you know if your exercise routine is making you unhealthy?
One of the most common symptoms is constant fatigue. Your workout routine should give you more energy, not less. Appropriate exercise boosts chemicals in the body that improve brain function, increase well being, and raise energy. If the opposite is happening to you, you’re overdoing it.
Other symptoms of over exercising include getting sick frequently, loss of muscle mass, gaining body fat, and difficulty recovering from injuries.
What to do if you’re over exercising
If you’re making yourself sick with exercise, the answer isn’t to stop exercising, but to go about your workouts differently. First of all, give yourself time to recover. This typically means exercising less frequently.
Also, it’s very important to get enough sleep. This is a critical time when your muscles repair and your metabolic system and brain recharge. Sufficient sleep is crucial if you want to stay active and healthy for the long haul. | 2024-05-17T01:26:29.851802 | https://example.com/article/5223 |
WELCOME to DESS DAHASRY of MALAYSIA..
Saturday, August 13, 2011
The NASA guys are really doing their job, it seems.. With NASA's Kepler space telescope, astronomers have discovered in our home galaxy, a planet blacker than coal. It's about the size of Jupiter.
Orbiting only about three million miles out from its star, the gas giant planet, dubbed TrES-2b, is heated to 1,800 degrees Fahrenheit (980 degrees Celsius). Yet the apparently inky world appears to reflect almost none of the starlight that shines on it, according to a new study.
The Earth-orbiting Kepler spacecraft was specifically designed to find planets outside our solar system. But at such distances—TrES-2b, for instance, is 750 light-years from us—it's not as simple as snapping pictures of alien worlds.
Instead, Kepler—using light sensors called photometers that continuously monitor tens of thousands of stars—looks for the regular dimming of stars.
Such dips in stellar brightness may indicate that a planet is transiting, or passing in front of a star, relative to Earth, blocking some of the star's light—in the case of the coal-black planet, blocking surprisingly little of that light.
When a planet passes in front of its star, the world's shaded side faces Kepler. But as the planet begins orbiting to the side of and "behind" its star, its star-facing side comes to face the viewer. The amount of starlight grows until the planet, becoming invisible to Kepler, passes fully in back of its star.
Watching TrES-2b and its star, Kepler detected only the slightest such dimming and brightening, though enough to ascertain that a Jupiter-size gas giant was the cause.
The light reflected by the newfound extrasolar planet, or exoplanet, changed by only about 6.5 parts per million, relative to the brightness of the host star.
Current computer models predict that hot-Jupiter planets—gas giants that orbit very close to their stars—could be only as dark as Mercury, which reflects about 10 percent of the sunlight that hits it.
TrES-2b is so dark that it reflects only one percent of the starlight that strikes it, suggesting that the current models may need tweaking.
ABOUT ME
Simple man. Educationist, Writer, Keyboardist,Composer and Arranger, Qualified Track and Field Coach, Golfer and coach, occasionally give talks on motivation and mathematics.
Like to share facts and experience in the Teaching & Coaching profession.
I love SPORTS a lot. | 2023-11-16T01:26:29.851802 | https://example.com/article/2926 |
Medal inflation
Medal inflation is a term used by the media particularly in the United States to describe the increase in the number of medals awarded to the armed forces in recent times and a perceived devaluing of medals because of this. It has been discussed since at least 1979 when a book was published relating to the Vietnam War. The War on Terror and particularly the 2003 Invasion of Iraq saw a resurgence in coverage, as there was a rapid increase in the number of medals awarded by the American forces. There was, however, a significant reduction in the volume of medals as the war entered the counter-insurgency phase.
United States
Various parts of the American media have discussed the perceived problem of medal inflation; most frequently since the start of the War on Terror in 2001 including articles in the Huffington Post (Dorian De Wind), Newsweek (Evan Thomas) and the NBC News (Michael Moran). It has also been discussed in a 2006 book by Paul Robinson and a 2016 work by Michael P. Kreuzer. Earlier treatments of the subject include a 1979 book (Crisis in Command) discussing the situation in the Vietnam War and a 1996 article in the New York Times. The question discussed frequently is whether the medals are deserved or being awarded at too high a rate, leading to "devaluation" of the award.
Historically the US armed forces have relied heavily upon individual commanding officers to apply for and approve medals, leading to significant variability in the criteria required for each award. One critic, Colonel Jack Jacobs, who received the Medal of Honor in Vietnam said, in 2004: "it's an age old problem with the Army and Air Force, too. The authority to approve awards is at a very low level, and that has a tendency to increase their frequency. Plus, there's always a political motive, or component, to giving out awards, to keep morale high and create a positive story for the home front". A counterpoint is that in the modern US military a serviceman's medals serve as his "resumé" indicating his career achievements, rather than serving to show only the most valorous or meritorious service.
Early history
The United States Army, perhaps conscious of the founding fathers' democratic principles, was sparing with its medals. Some distinguished generals including the Civil War leaders Ulysses S. Grant and William Tecumseh Sherman wore few if any medals on their uniform. Indeed, the US Army had no medal to recognise valor on the battlefield until the Civil War when the Medal of Honor was introduced. The Medal of Honor was the only such medal until the US involvement in the First World War when a number of other medals were introduced. Controversy over the number of medals issued dates back to at least the Second World War. During the early US involvement in North Africa two US generals visited the front and issued 60 Legion of Merit medals. These medals criteria should have limited them only to very senior officers and the majority of the 60 issued were outside of the criteria. US President Franklin D. Roosevelt disapproved of this action but did not veto the awards. The Second World War as a whole saw a significant increase in the number of medals issued to individual servicemen.
Later 20th century
A large number of service awards (for "time served") were introduced following the Second World War, which increased the number of medals servicemen could expect to receive. The Vietnam War brought about the use of military bravery medals as a means of raising force morale. Historians Richard A. Gabriel and Paul L. Savage state that "medal packages" were common in which an officer received a set of medals merely for holding a certain rank or appointment; leading to a reduction in the perceived value of these medals. Later, US General Colin Powell described the practice saying that:
Tim O'Brien, who processed awards in Vietnam for his unit, said of the time: "we dispensed awards - purple hearts, one and the same for a dead man or a man with a scraped fingernail; bronze stars for valor, mostly for officers who knew how to lobby".
One award singled out as an example of medal inflation is the Army Service Ribbon, awarded for completing basic initial training, introduced by the US Army in peacetime in 1981. The 1983 Invasion of Grenada has also been cited as an example: some 8,600 campaign medals were awarded despite only 7,200 troops actually serving in the country. The New York Times also notes the awarding of combat medals to seamen of the USS Vincennes who shot down a civilian airliner, Iran Air Flight 655, in 1988 and the issue of a Purple Heart wound medal to a paratrooper who suffered heat stroke during the 1989 United States invasion of Panama were controversial. The Gulf War of 1990–91 saw almost 3.5 million US service members awarded the National Defense Service Medal, though the majority remained in the United States during this time.
A study in 1994 showed that there was some disparity between the services with regards the frequency of awards. The United States Air Force issued 287 decorations per 1,000 service members in that year, the US Navy 148 and the US Marine Corps just 70. At the time there was pressure on the Marine Corps to increase the number of medals issued to "catch up" to the other services.
War on Terror
The conquest of Iraq in 2003 drew complaints from some that the number of medals awarded was out of proportion with the danger experienced by the troops and that bravery awards were more likely to be issued to officers than enlisted personnel. Of the 26 Silver Stars awarded for the 2003 capture of Baghdad 4 were awarded to colonels, 11 to captains and just 11 to NCOs, none went to privates; of the 104 Bronze Stars with valor device, 32 were awarded to officers and 72 to other ranks (only 4 of whom were privates) and of the 274 plain Bronze Stars 149 went to officers, 133 to NCOs and just 3 to privates. The Purple Heart, which is awarded automatically for being wounded and so perhaps is more reflective of the danger individual soldiers experience was awarded 88 times, only 10 times to officers, 36 to NCOs and 42 to privates.
The US Air Force came in for criticism for the number of medals awarded during the invasion: some 69,000 medals were handed out, significantly more than the army (who awarded 40,000) despite that fact that army personnel were, in general, posted to more dangerous locations. The ratio of bronze stars awarded per fatality in the US Air Force was 91:1 and in the army 27:1. The US Marine Corps took active steps to limit the number of medals awarded during the invasion and was praised by some at the time for having "kept the inflation in check"; it awarded just three bronze stars per fatality suffered. Some critics noted that the air force awards, on average, twice the number of medals per service member that the US Navy does.
A noted critic of medal inflation, Colonel David Hackworth was particularly critical of the air force for awarding the Distinguished Flying Cross to a pilot for a mission which missed its target in Baghdad and killed 16 civilians. He compared this to what would have been needed to receive the medal in the Second World War: "in World War II, when I saw a Distinguished Flying Cross, that meant the guy had made 25 or 30 missions over dangerous places like Hamburg or Berlin. Those places sometimes had 50 percent casualty rates. Now, they give medals out to guys who fly bombers invisible to radar whose bombs miss Saddam and kill civilians in a restaurant. It's an outrage". There were in fact a relatively large number of Distinguished Flying Crosses awarded for the invasion: between its establishment in 1927 and 2002 only 3,300 of the medals had been awarded but between March 2002 and February 2004 463 were approved.
Once the war settled down into the counter-insurgency phase the number of medals awarded decreased significantly. Up until 2009 the rate of Medals of Honor awarded was just 0.1 per 100,000 service members, significantly under the ratio in the Korean War (2.3) and the Second World War (2.9). The reasons cited for this were that the technological development of warfare had reduced the number of face-to-face engagements with the enemy; that the shift by the insurgents towards improvised explosive devices, mortars and sniper attacks away from standard infantry tactics had also reduced the number of traditional engagements and that the awards system had been made more rigorous.
Other countries
The term has also been used in discussions on the awarding of medals to the British armed forces. Prior to the Iraq and Afghanistan wars, the British Army had a reputation for rarely awarding gallantry medals, outside of special forces units. The Telegraph noted in 2009 that there had been a significant rise in the number awarded since 2003. However, the process relies heavily upon the wording of the commanding officer's medal citation which can lead to variability. As an example the 1st battalion of the Princess of Wales' Royal Regiment was awarded 37 medals (including one Victoria Cross, the nation's highest award for gallantry) for a single tour, but similar units engaged in similar tours in 2003 and 2006 received only a single mention in dispatches.
In the Canadian armed forces, there has been some discontent over the awarding of campaign medals, particularly as there was no means of differentiating between those who served regularly on patrol and those that never left the relative safety of the base. Anne Irwin, a military anthropologist at the University of Calgary's Centre for Strategic and Military Studies, proposed two new awards: a rosette on the campaign medal for those who had been off-base and a combat badge for those who fought. This would be similar to the US Army's practice of awarding the Combat Infantryman Badge, Combat Medical Badge and Combat Action Badge (the latter introduced to solve a similar problem in 2005).
See also
Grade inflation
References
Category:Military awards and decorations
Category:Orders, decorations, and medals
Category:Inflation | 2024-04-07T01:26:29.851802 | https://example.com/article/7716 |
Q:
Add paginate to a inner joined tables
How to add paginate with a specific query?
Here is my query:
SELECT emptb.*, tempstore.* FROM (SELECT * FROM emptb WHERE Department = :dept)emptb inner join tempstore
on emptb.EmpID = tempstore.EmpID WHERE tempstore.ValidDate BETWEEN DATE(:fromDate) AND DATE(:toDate)
Note: When I add a paginate, the next and previous button don't work it was stuck at the first record that it sees in the table. Can you give me some good paginate to go with this kind of query?
A:
Pagination works because you specify a limit to the sql clause but there is none in the above query. Also, I have found that you need to now the total number of records you could expect - hence the count!
Quick example, hope this is what you meant...
$pageNumber=0;
$startRow=0;
$maxRows=10;
$sql="select
(
select count(*) from ( select * from `emptb` where `department` = :dept ) emptb
inner join `tempstore` on emptb.`empid` = tempstore.`empid`
where tempstore.`validdate`
between date(:fromdate) and date(:todate)
) as 'dbrecordcount',
emptb.*,
tempstore.* from ( select * from `emptb` where `department` = :dept ) emptb
inner join `tempstore` on emptb.`empid` = tempstore.`empid`
where tempstore.`validdate`
between date(:fromdate) and date(:todate)
limit $startRow, $maxRows;";
/* above would show the first 10 records */
-> ie: records 0,10
/* Page number is increased by 1 after clicking pagination link / button */
-> $startRow=$pageNumber * $maxRows ~ equals 10;
-> would then show records from 10,20
/* To derive the pagination links, something like this perhaps... */
/* Number of records per page */
$maxRows=10;
/* The total number of expected rows: uses db result 'dbrecordcount' */
$totalRows=$db->dbrecordcount;
/* Current page within paged results: retrieve `page` from querystring if using GET method */
$pageNumber=$_GET['page'];
/* How many pages of results are there */
$totalPages=( $maxRows > 0 ) ? abs( ceil( $totalRows / $maxRows ) - 1 ) : 0;
/* Where does paging begin */
$startRow=$pageNumber * $maxRows;
/* Display pagination links if there are sufficient number of records */
if( $totalPages > 0 && $totalRows > $maxRows ){
/* First record link */
if( $pageNumber==0 ) {
echo "First";
} else {
echo "<a href='?page=0'>First</a>";
}
/* Previous record link */
if( $pageNumber > 0 ){
echo "<a href='?page=".max( 0, $pageNumber - 1 )."'>Previous</a>";
} else {
echo "Previous";
}
/* Next record link */
if( ( $pageNumber + 1 ) > $totalPages ){
echo 'Next';
} else {
echo "<a href='?page=".min( $totalPages, $pageNumber + 1 )."'>Next</a>";
}
/* Last record link */
if( $pageNumber==$totalPages ){
echo 'Last';
} else {
echo "<a href='?page=".$totalPages."'>Last</a>";
}
}
| 2023-10-17T01:26:29.851802 | https://example.com/article/4663 |
Dear viewers, Regret to inform you all that our website Facebook account Kemmannu News Network (KNN) has been *hacked* since yesterday and is out of our control. Many of our viewers are getting messages from the hacker through Messenger App. Kindly do not respond to any messages you receive from KNN in the future until further notice. You can also report abuse to facebook so that facebook can block that page/accont. We regret the inconvenience caused to you. Editors.
Read More » | 2023-12-26T01:26:29.851802 | https://example.com/article/1192 |
Arginine and lysine aminopeptidase activities in chromaffin granules of bovine adrenal medulla: relevance to prohormone processing.
Conversion of prohormones and neuropeptide precursors to smaller, biologically active peptides requires specific proteolytic processing at paired basic residues, which generates intermediate peptides with NH2 and COOH termini extended with Lys or Arg residues. These basic residues are then removed by aminopeptidase and carboxypeptidase activities, respectively. Among the proteases involved in prohormone processing, the basic residue aminopeptidase activity has not been well studied. This report demonstrates arginine and lysine aminopeptidase activities detected with Arg-methylcoumarinamide (Arg-MCA) and Lys-MCA substrates in neurosecretory vesicles of bovine adrenal medulla [chromaffin granules (CG)], which contain endoproteolytic processing enzymes co-localized with [Met]enkephalin and other neuropeptides. These arginine and lysine aminopeptidase activities showed many similarities and some differences. Both arginine and lysine aminopeptidase activities were stimulated by the reducing agent beta-mercaptoethanol (beta-ME) and inhibited by p-hydroxymercuribenzoate, suggesting involvement of reduced cysteinyl residues. The arginine aminopeptidase activity was stimulated by NaCl (150 mM), but the lysine aminopeptidase activity was minimally affected. Moreover, characteristic beta-ME/NaCl-stimulated Arg-MCA cleaving activity and beta-ME-stimulated Lys-MCA cleaving activity were detected only in CG and not in other subcellular fractions; these findings indicate the localization of these particular basic residue aminopeptidase activities to secretory vesicles. The arginine and lysine aminopeptidase activities showed pH optima at 6.7 and 7.0, respectively. Km(app) values for the arginine and lysine aminopeptidase activities were 104 and 160 microM, respectively. Inhibition by the aminopeptidase inhibitors bestatin, amastatin, and arphamenine was observed for Arg-MCA and Lys-MCA cleaving activities. Inhibition by the metal ion chelators indicated that metalloproteases were involved; Co2+ stimulated the arginine aminopeptidase activity but was less effective in stimulating lysine aminopeptidase activity. In addition, the lysine aminopeptidase activity was partially inhibited by Ni2+ and Zn2+ (1 mM), whereas the arginine aminopeptidase activity was minimally affected. These results demonstrate the presence of related arginine and lysine thiol metalloaminopeptidase activities in CG that may participate in prohormone processing. | 2024-02-18T01:26:29.851802 | https://example.com/article/3999 |
The Prince's Trust
The Prince's Trust is a charity in the United Kingdom founded in 1976 by Charles, Prince of Wales to help vulnerable young people get their lives on track. It supports 11 to 30-year-olds who are unemployed and those struggling at school and at risk of exclusion. Many of the young people helped by The Trust are in or leaving care, facing issues such as homelessness or mental health problems, or have been in trouble with the law.
It runs a range of training programmes, providing practical and financial support to build young people's confidence and motivation. Each year they work with about 60,000 young people; with three in four moving on to employment, education, volunteering or training.
In 1999, the numerous Trust charities were brought together as The Prince's Trust and was acknowledged by The Queen at a ceremony in Buckingham Palace where she granted it a Royal Charter. The following year it devolved in Wales, Scotland, Northern Ireland and other English regions but overall control remained in London. The Prince's Trust fundraising and campaign events are often hosted and feature entertainers from around the world. In April 2011 the youth charity Fairbridge became part of the Trust. In 2015, The Prince's Trust International was launched to collaborate with other charities and organisations in other countries (mostly Commonwealth nations) to help young people in those countries.
The Prince's Trust is one of the most successful funding organisations in the UK and the UK's leading youth charity, having helped over 950,000 young people turn their lives around, created 125,000 entrepreneurs and given business support to 395,000 people in the UK. From 2006 to 2016, its work for the youth has been worth an estimated £1.4 billion.
Target groups
The Prince's Trust aims to work with young people from four priority target groups. These are the long-term unemployed, people who have been in trouble with the law, people who are in difficulty at school, and people who have been in care. These young people are considered by the Prince's Trust as being "disadvantaged". A small number of people who are employed also go on some Prince's Trust courses. Known as the employed participants scheme, it is used as a learning and development opportunity (to develop the employee's skills), as additional support to the programme's young people (the employed participants act as additional mentors or support to young people) and as a fundraising initiative (as the employer pays a training fee for their staff member to attend).
People
Charles, Prince of Wales, founded The Prince's Trust and is now its president, a figurehead position with no legal responsibility. The Prince's Trust Council are the trustees of the charity and are legally responsible for management, administration and deciding policy.
John Booth was announced as the chairman of The Prince’s Trust Council in July 2018 and Sir Lloyd Dorfman CBE, who previously held this position, became the chairman of Prince’s Trust International.
Nick Stace, the chief executive of The Trust, joined in October 2017, replacing Dame Martina Milburn DCVO CBE who is a member of the Board and Group Chief Executive for The Prince's Trust.
The work of Prince’s Trust Canada is overseen by its Board of Directors which includes Chief Executive Martina Milburn, F. Mark M. Fell (Chair), Ian Aitken, Tania M. Carnegie, Marc Kielburger, Malik Talib, Cynthia Caron Thorburn, and Hilary Weston.
People employed
In 2010 The Prince's Trust employed 644 people including 555 people who worked in charitable purposes and support, 87 in fundraising and publicity, and 2 in governance. The cost of employing these staff is £21 million a year and is the organisation's single biggest expenditure. This is down from the 2009 total (£22 million on 695 staff) following an efficiency drive which saw a number of voluntary redundancies. Two members of staff earned between £110,000 – £120,000. Fifteen staff earned between £60,000 – £100,000 – down from 17 staff earning these amounts in 2009.
The Chief Executive of the Prince's Trust is Martina Milburn who joined the organisation in 2004. Previously she worked as the Chief Executive of BBC Children in Need.
Ambassadors
The Prince's Trust consist of different kinds of Ambassadors:
The first are young ambassadors, these are young leaders who are volunteers and support the Prince's Trust in different ways including motivating other young people and winning contributors and the media about the work the Prince's Trust do.
The second are job ambassadors. These group have taken part in a Prince's Trust programme and have graduated from being a Young Ambassador. They are then employed by The Prince's Trust and work to inspire, motive and assist the young people in fulfilling the programmes they enrol in.
Lastly, there are celebrity ambassadors who help raise awareness of the work that is done by The Prince's Trust in young people's lives. Celebrity ambassadors also involve themselves by visiting the young people during courses and programmes, host and help fundraising events and additionally start and support campaigns for the Prince's Trust. Past and current ambassadors include Phil Collins, Bryan Adams, Phillip Schofield, Gary Lineker, Jeremy Irons, Joss Stone, Kevin Spacey, Tom Hardy, Rita Ora, Geri Halliwell, Benedict Cumberbatch, Idris Elba, Gemma Arterton and Sharon Osbourne.
In 2017, The Prince's Trust recruited Tom Fletcher and Giovanna Fletcher as the charity's first Digital Celebrity Ambassadors, following the great support they had given following their attendance at our Celebrate Success Awards.
Finances
In 2009–10 The Prince's Trust charity, and its trading subsidiary, Prince's Trust Trading Ltd, had a total income of nearly £36 million, and expenditure of £38 million. Facing the impact of the economic climate and a decline in funding it drew on its reserves, which stand at £22 million, representing roughly six months operating costs. The Prince's Trust is one of the 100 largest charities in the UK ranked by expenditure.
Income
Voluntary income represented the largest source of funding for the organisation, totalling £18 million in 2009–10 (representing a very small increase on 2008–09. Public Sector income (contracts and grants to deliver support to young people from statutory bodies) fell from £17 million to just under £14 million. The cost of raising the voluntary income was £5.5 million, which means that for every £1 donated, 70p was spent on charitable activities.
For the past ten years, its work is reported to be worth an estimated £1.4billion.
Expenditure
The Prince's Trust expenditure of £38.2 million was made up of £30 million spent on charitable activities with the rest being spent on administration and other costs. The £30 million spent on charitable activities was divided between the different programme areas such as the Team programme and the Enterprise programme. £1.2 million went on grants to young people and institutions.
Charitable activities
The Prince's Trust has seven main types of charitable activity.
The Enterprise programme helps young people start a business.
The Team Programme is a 12-week personal development course, offering work experience, practical skills, community projects and a residential week.
Get intos are short courses offering training and experience in a specific sector to help young people get a job.
Get Starteds are short courses that give people the chance to take part in a week of activities to grow their confidence and skills.
Fairbridge offers a mix of group activities and one-to-one support for young people.
Development Awards are small monetary grants given to young people to help them get some training, education or a job.
Achieve clubs are held in schools, or through the Trust's centres for those outside of education.
Mosaic runs programmes in primary and secondary schools to link young people with role models to boost their confidence.
Enterprise programme
The Enterprise programme is the offer for which The Prince's Trust is best known for. Helping young people to become their own boss by starting a business, 18 to 30-year-olds are given practical, mentoring and financial support of up to £5,000.
As part of the programme, each young person is appointed a Business Mentor who provide one-to-one support for up to two years to develop and grow their business, acting as a sounding board to share thoughts and concerns, as well as empowering them to make their own decisions.
The Prince's Trust has helped 86,845 young people to set up in business since 1983.
In 2017, The Prince's Trust launched Enterprise Online, to enable 18 to 30-year-olds to explore becoming their own boss, learning at their own pace with dedicated support along the way. From developing quick pitches to get investors interested in your business to marketing strategy advice to bring in sales, it has everything young people need – including access to e-mentors to help them achieve their goals.
Team programme
Team is a 12-week personal development programme which gives young people that are NEET (Not in Education, Employment or Training) and aged 16–25 the chance to gain new skills, complete a qualification and meet new people through team-building activities, a residential trip, community project and work placement.
The course is usually run by a local organisation known as the delivery partner.
205,063 young people have participated in our 12-week Team programme since its launch in 1990.
The people going on Team are usually unemployed, and if they are receiving JobSeekers' Allowance and other benefits they are still able to receive these whilst on the course. People going on the course also get their travel expenses and other costs paid. Some people in employment also go on part of a course but their employer has to pay a course fee of £1,250 to The Prince's Trust. The Prince's Trust employs fundraisers with "proven sales experience" to persuade employers to pay for their employees to go on the Prince's Trust Team Course. In 2006/7 the Prince's Trust received nearly £687,000 from employer's fees for Team courses.
As part of the programme participants go on a trip to an outbound activity centre where they focus on communication, teamwork and confidence building. Later in the programme they work on their Maths and English skills, and give back to their local community by volunteering, raising awareness and fundraising for causes that matter to them. Participants also complete a two-week work experience placement.
Get into
Get intos are short courses that give young people experience and training in a specific sector, to allow them to gain employability skills to move into work. Focus industries include retail, rail, construction, logistics and hospitality.
In 2017, The Prince's Trust launched Employability Online, to enable 18 to 30-year-olds to gain the essential skills they need to secure the job they want. From understanding what job is right for you to tips on making your CV stand out, it has everything young people need – including access to e-mentors to help them achieve their goals.
Get Started
Get Started s are short courses that give young people the chance to take part in a week of activities that allow them to develop skills with help from industry experts. Working with partners including the Premier League, ASOS and Sony, they work towards a group challenge while developing skills and confidence.
Fairbridge
The Fairbridge programme offers a mix of group activities and one-to-one support for young people to develop the skills and confidence they need to move forward. Starting with a five-day Access course, delivered from one of The Trust's 18 centres across the UK, they also take part in a residential trip.
Once the Access course is complete, young people choose from a range of activities, from sports to drama and photography to cooking, to help them reach their goals.
In 2016, L’Oréal Paris partnered with The Prince's Trust to transform self-doubt into self-worth by developing a confidence training course for the Fairbridge programme, covering: relationships, body language and employability.
Achieve programme
The Prince's Trust education programme, Achieve (formerly known as xl clubs) provides young people at risk of underachieving and exclusion the chance to try new activities to boost their confidence, while gaining a recognised qualification.
Delivered in schools, youth centres, pupil referral units, youth offender institutions and Prince's Trust centres, the course allows young people to explore personal and social development; life skills; active citizenship; enterprise; and skills to prepare them for work.
In 2006/7 the Prince's Trust spent £4 million on the xl programme and of this £298,000 consisted of grants to clubs, £1.26 million was spent on Prince's Trust staff costs and £2.3 million on other direct costs and support costs.
Development Awards
The Prince's Trust Development Awards remove young people's financial barriers to enable them to take the next step into work, education or training. Covering course fees, transport or equipment, eligible young people can receive up to £500.
Mosaic Mentoring
Mosaic moved into The Prince's Trust in April 2016. Its programmes – which run in primary and secondary schools and prisons and include an Enterprise challenge competition – aim to bridge the aspirations-attainment gap by linking young people with inspirational role models and helping boost their confidence, self-efficacy and long-term employability.
Future Leaders
The Future Leaders programme gives young people the foundations of leadership and teamwork. The programme was launched by Prince's Trust Goodwill Ambassador Gareth Southgate in May 2019.
Get Hired
Get Hired is a monthly recruitment event run by The Trust. At each event, up to 20 employers with live entry-level vacancies do ten-minute interviews with candidates.
The Jason Kanabus Fund
The Jason Kanabus Fund was created from the £2.5 million left to the Prince's Trust by Jason Kanabus, a young farmer in Sussex who died from cancer in July 2006. He left his money to The Prince's Trust, with the request that the income was used to help young people become established in farming.
Awards
The Prince's Trust celebrates the achievements of young people each year through its Prince's Trust Awards (formerly known as Celebrate Success Awards).
Sponsored by TK Maxx and HomeSense, these series of awards events are an opportunity to pay tribute to the bravery, determination and sheer hard work that the young people demonstrate. The process begins each summer when staff, volunteers, partners and supporters nominate the exceptional young people they’ve met. In each of the regions and countries, judging panels select finalists in seven award categories.
Throughout the autumn The Trust holds 11 Oscar-style regional award ceremonies across the country before hosting a national final in London where the red carpet is rolled out.
Hosted by Ant and Dec and attended by a range of celebrity ambassadors, including Thierry Henry, Gemma Arterton and Emilia Fox, it recognises the Young Achiever of the Year, Young Ambassador of the Year and many more.
Generating income
The Prince's Trust obtains money from two main sources. Firstly, there is the income received as a result of the charitable activities it undertakes, and secondly it raises voluntary income. 87p in every £1 donated to The Prince's Trust is spent on charitable activities.
Income from charitable activities
This totalled nearly £16 million in 2007/8 and was mostly contract payments for courses, training, mentoring and other services. Of the £16 million, nearly £2 million came from local and national government, over £9 million from other public sector sources, nearly £4 million from the European Union and £753,000 from the Community Fund.
The "other" public sector sources included:
Regional Dev. Agencies (One North East) £775,000
East Midlands Development Agency £730,000
The Big Lottery Fund £660,000
Department for Education & Skills £158,000
It is unclear how much money in total came from the European Union (EU), as although some money (£4 million) is declared as coming directly, other money can be channelled indirectly through other organisations. Previously much of the EU money for the Prince's Trust came from the European Social Fund (ESF) and could only be spent to help young people who are Not in Education, Employment or Training (NEET). Some of the ESF money went directly to the Prince's Trust (£816,000 2006/7), but mostly it went to the Learning and Skills Council (LSC) who "doubled it up" with government money that then had the same restrictions placed on it. Some LSC money was given directly to the Prince's Trust (£1.3 million 2006/7) but the majority went to the regional LSC offices who took out contracts with the regional Prince's Trust offices to provide services for unemployed young people. The ESF money was channelled through so many routes it is difficult to determine how much it amounted to, but in 2006 the funding provided by the LSC to the Prince's Trust in total came to approximately £11 million, although clearly these figures have decreased somewhat in recent years.
Voluntary income
The voluntary income raised in 2007-8 was more than £20 million, consisting of £5.2 million from charitable trusts, £4.7 million in corporate donations, £4.5 in individual donations and £2.1 million donations in kind.
Individual donations
Leadership Groups are an important part of the trust's fundraising from individuals. These groups are made up of successful (i.e. rich) individuals within certain business sectors, such as the Technology and Construction sectors. The aim with these groups is that the individuals not only give donations, but also that they encourage employee donations and volunteering from within their organisations.
Fundraising events
The trust still has some fundraising events, including a Rock Gala that aired on 25 December 2010 on DirecTV. In 2012, the Prince's Trust was one of the main beneficiaries of Bob Finch and Michael Holland's Oil Aid.
The Prince's Trust Group
The Prince’s Trust Group’s mission is to transform lives and build sustainable communities across the world. Together, the group of Prince’s Trust charities will support around 90,000 people during 2019-20.
Established in 2018, The Prince’s Trust Group includes the work of The Prince's Trust in the UK alongside a group of charities including: Prince’s Trust International, Prince’s Trust Australia, Prince’s Trust New Zealand, Prince’s Trust Canada and most recently Prince’s Trust America. Through The Prince’s Trust Group young people are supported to access education, employment and self-employment in Australia, Barbados, Canada, Greece, India, Jordan, Malta, New Zealand and Pakistan. During 2019-20, Prince's Trust Group will start supporting young people in Ghana, Kenya, Rwanda, Trinidad & Tobago, Jamaica and Malaysia.
His Highness The Aga Khan is the Global Founding Patron of The Prince’s Trust Group. American singer and songwriter, Lionel Richie, is the founding Global Ambassador and Chairman of the Global Ambassador Group.
Timeline
Impact in the United Kingdom and beyond
Since establishing in 1976, The Prince's Trust has helped over 950,000 young people turn their lives around in the UK through money and advice from the charity and returned £1.4 billion in value to society through in the last 10 years alone. Additionally, the Prince's Trust has also help start about 90,000 businesses in other countries since going internationally.
Collaboration with artists
The Prince's Trust has worked with very prominent artists such as:
1982: Status Quo, Jethro Tull, Madness, Pete Townshend, Phil Collins, Robert Plant, Kate Bush, Midge Ure, Mick Karn
1985: Dire Straits
1986: Big Country, David Bowie, Mick Jagger, Elton John, Eric Clapton, Howard Jones, Joan Armatrading, Level 42, Mark Knopfler, Midge Ure, Paul McCartney, Paul Young, Phil Collins, Rod Stewart, Suzanne Vega, Tina Turner, Sting
1987: Alison Moyet, Ben E. King, Bryan Adams, Curiosity Killed the Cat, Elton John, Eric Clapton, George Harrison, Go West, Labi Siffre, Level 42, Midge Ure, Phil Collins, Ringo Starr, Tony Hadley
1988: Bee Gees, Black, Elton John, Eric Clapton, Howard Jones, Joe Cocker, Leonard Cohen, Mark Knopfler, Midge Ure, Peter Gabriel, Phil Collins, Rick Astley, T'Pau, Wet Wet Wet
1989: Joan Baez, Andy Bell, Beverley Brown, City of Birmingham Symphony Orchestra, Will Downing, John Farnham, Tony Hadley, Nigel Kennedy, Nichola Kerr, Level 42, Ladysmith Black Mambazo, Mike + The Mechanics, Van Morrison, Anne Nightingale, Alexander O'Neal, Mica Paris, Dashiell Rae, Swing Out Sister
1990: Wet Wet Wet, Big Country, Roachford, Lenny Kravitz, And Why Not, Moody Blues, Pasadenas, The Chimes, Oleta Adams, Taylor Dayne, Chaka Khan, Lisa Stansfield
2014: Beyoncé
2017: Cheryl Cole
2018: Muse
See also
The Prince's Charities
Party in the Park
References
External links
Official website of The Prince's Trust
Prince's Trust YouTube channel Flash Video player required.
Success Stories at The Prince's Trust Website
Category:Organisations based in the City of London
Category:Organizations established in 1976
Category:Social welfare charities based in the United Kingdom
Category:1976 establishments in the United Kingdom
Category:The Prince's Charities
Category:International charities | 2023-10-14T01:26:29.851802 | https://example.com/article/1894 |
PlayStation Plus 12 maanden PSN kaart voor PS4 (NL)
Opzoek naar 12 maanden PlayStation Plus? Bestel veilig online bij Game Mania en ontvang de code direct in je mailbox. 24 uur per dag simpel & snel. Daarnaast spaar je alleen bij Game Mania coins en ontvang je korting met Game Mania XP.
Deze code geeft je recht op 12 maanden PlayStation Plus.
Belangrijke tips bij het inlossen van een PlayStation Plus abonnement lees je onderaan. Read important information about buying digital Playstation codes below.
Power up your play
Word nu Playstation Plus lid en haal het maximale uit je PS4! Een PlayStation Plus abonnement breidt je bestaande PlayStation Network account uit waarmee je profiteert van o.a. de volgende voordelen:
Online multiplayer: Speel online multiplayer op je PlayStation 4 met je vrienden.
Speel online multiplayer op je PlayStation 4 met je vrienden. Elke maand twee gratis PlayStation 4 games: Elke maand krijgen PS Plus leden twee geselecteerde PS4 games gratis, deze kun je downloaden en spelen voor zo lang je PS Plus lid bent.
Elke maand krijgen PS Plus leden twee geselecteerde PS4 games gratis, deze kun je downloaden en spelen voor zo lang je PS Plus lid bent. 100GB online opslag voor savegames: Krijg toegang tot je opgeslagen spellen vanaf elke PlayStation 4 via de 100 GB cloudopslag.
Krijg toegang tot je opgeslagen spellen vanaf elke PlayStation 4 via de 100 GB cloudopslag. Ontvang exclusieve kortingen en meer in de PlayStation Store: PlayStation Plus leden krijgen toegang tot exclusieve aanbiedingen en extra kortingen op de PlayStation Store.
Alle digitale PlayStation codes zijn uitsluitend geschikt voor gebruik met een Nederlands PlayStation Network account. Indien de PlayStation geregistreerd staat op een buitenlands adres kan de code niet ingelost worden. All PlayStation Network codes only work in the Dutch PlayStation Store. If you do not own a PlayStation accunt registered on a Dutch address, these codes will not work.
Opgelet: Content en services van PlayStation Plus variëren per leeftijd van de abonnee. Ook eigenaars van sub-accounts kunnen zich aanmelden voor PlayStation Plus. Wij adviseren om PlayStation Plus altijd te koppelen aan het hoofdaccount. Omdat sub-accounts specifiek bedoeld zijn voor jongere Sony Entertainment Network-gebruikers, ontzegt Sony gebruikers van sub-accounts toegang tot leeftijdsgebonden materiaal dat een hogere leeftijdsclassificatie heeft dan de leeftijd van de eigenaar van het sub-account. Deze leeftijdslimiet kan niet worden omzeild en alleen leden van 18 jaar of ouder hebben toegang tot alle leeftijdsgebonden PlayStation Plus-content.
Gebruikers moeten 7 jaar of ouder zijn en voor gebruikers onder de 18 jaar is goedkeuring door een ouder/voogd vereist. | 2023-11-09T01:26:29.851802 | https://example.com/article/4347 |
The life of football managers is seemingly becoming an impossible one. This time last week Newcastle United were sitting as a newly promoted team in a respectable eleventh place with nineteen points, four clear of the relegation zone. They had defeated Aston Villa comprehensively, held the champions Chelsea to a draw and defeated Arsenal at the Emirates. Apparently though, this was not enough and manager Chris Hughton was sacked by controversial owner Mike Ashley.
This is not the first time a manager that a manager has been sacked after seemingly achieving what was expected of them. Mark Hughes at Manchester City chasing fourth place last year comes to mind. So is there anything managers, and top flight managers in particular, can do to ensure they are given a fair chance, and is there any way at all that Newcastle can expect to have a long-term manager after this senseless decision?
Over the last two seasons chairmen of Premier League clubs have made some incredible decisions. As mentioned already Mark Hughes was sacked with Manchester City potentially on course for a top four finish. The man who replaced him, Roberto Mancini, failed to achieve that target and now ironically faces the same kind of pressure which Hughes faced a year ago after an average start to the season. The biggest season for managerial casualties was 2008/2009 where there were an incredible twelve managerial changes throughout the season.
Chelsea were the worse culprits with Avram Grant being sacked and Luiz Felipe Scolari getting the same treatment before Guus Hiddink temporarily took charge until the end of the season. With managers’ contracts appearing to mean nothing anymore they face a very difficult task; most clubs want an immediate impact from a manager and will not accept anything less than success in as many competitions as possible.
This brings me to the particular case of Newcastle United. They of all clubs have a shocking track record of hiring and sacking managers. Since 2004, and the sacking of Sir Bobby Robson, several managers, including Graeme Souness, Glenn Roeder, Sam Allardyce, Kevin Keegan and Alan Shearer, have been shunted in and out of the managerial revolving doors. It appeared that after Chris Hughton was put in charge and immediately returned the club to the Premier League that Newcastle had found the stability they had been searching for but after looking at the Magpies’ history of managerial sackings in the past years it should come as no surprise that he was sacked.
As Alan Shearer said; “Nothing surprises me at Newcastle anymore”, perhaps showing that while Ashley is in charge there will be no stability at the club regardless of who the manager is. However, one question that came out of this sacking was who would be brave enough to take on the role of being the manager of a club with such a poor record of sacking their managers?
At first it seemed that Martin Jol, who co-incidentally resigned from his position as manager of Ajax on the same day, was the front-runner but several other names were mentioned as well. Martin O’Neill was the man who many Newcastle fans wanted to see given a chance and Alan Curbishley’s name was also mentioned. However, Newcastle United owner, Mike Ashley decided to appoint the former Reading, West Ham, Charlton and Southampton manager Alan Pardew on a mammoth five-and-a-half year deal.
To many fans he was a surprise appointment as he hasn’t had huge success with any club in the top flight despite earning promotion for Reading and reaching an FA Cup final with West Ham. Despite the length of his contract Pardew himself has stated that other managers have called him ‘mad’ for taking on the job. Whether the contract that Pardew has signed actually means anything remains to be seen, especially after Hughton was sacked after achieving what fans have thought were good results for the club in their first season back in the Premier League.
Pardew’s first challenge as Newcastle United manager is to win over the players who have openly stated they are disappointed at the dismissal of Hughton, something that yesterday’s 3-1 win over Liverpool would certainly have helped. Despite yesterday’s success this decision by Mike Ashley could have a terrible effect on Newcastle as a club and after a promising start to the season it would be no surprise if the team slide down the league as the impact of Hughton’s dismissal makes its mark. It is for certain that Alan Pardew has a lot of work to do in order to turn his players around, win over the fans who Hughton endeared himself to, and to achieve even better results that will see Newcastle fight for a top half finish in their comeback season.
What is clear for everyone to see is that the era of managers staying at one club for five to ten years, or even longer in some cases, seems to be over with clubs wanting immediate success. This approach cannot be healthy for football and stability is the foundation on which successful clubs build on. This would be something Newcastle owner Mike Ashley could learn a lot from if he wants to know how he should go about bringing success to St. James Park and to one of the most well supported clubs in the land
One comment
I’m genuinely quite intrigued to find out whether your hypothesis is merely a convential wisdom. Surely there have always been one or two bonkers chairmen around who are brash and vulgar with their treatment of managers.
Clubs in the Premiership who haven given their managers time and not demanded immediate success = Everton, Liverpool, Arsenal, Manchester United, Sunderland, Stoke, Villa, Birmingham, Wolves, even Spurs to an extent post 2004. Perhaps the bad apples such as the barcodes and wist ham are clouding your judgement. I might be being harsh though. | 2023-08-09T01:26:29.851802 | https://example.com/article/1738 |
Q:
how to append unsigned short after char buffer array containing hex byte
I am trying to calculate CRC of 2 byte.
I have Table of CRC values for high–order byte and low–order byte.
static unsigned char auchCRCHi[] = {0x00, 0xC1, 0x81, 0x40, 0x01............0x40} ;
static char auchCRCLo[] = {0x00, 0xC0, 0xC1, 0x01, 0xC3, 0x03....0x40} ;
These are used in below function to calculate CRC.
unsigned short CRC16(unsigned char* puchMsg, unsigned short usDataLen)
{
unsigned char uchCRCHi = 0xFF ; /* high byte of CRC initialized */
unsigned char uchCRCLo = 0xFF ; /* low byte of CRC initialized */
unsigned uIndex ; /* will index into CRC lookup table */
while (usDataLen--) /* pass through message buffer */
{
uIndex = uchCRCHi ^ *puchMsg++ ; /* calculate the CRC */
uchCRCHi = uchCRCLo ^ auchCRCHi[uIndex] ;
uchCRCLo = auchCRCLo[uIndex] ;
}
return (uchCRCHi << 8 | uchCRCLo) ;
}
In the above function "puchMsg" is A pointer to the message buffer containing
binary data to be used for generating the CRC and "usDataLen" is the quantity of bytes in the message buffer.
The function returns the CRC as a type unsigned short.
Now I have to append this CRC byte at the end of my message.
Without CRC when i send my data in the following way it works
char str[6]={0x01,0x01,0x00,0x01,0x00,0x20};// sending hex of $$S??
serialObj.send(str, 6);
Now I have to calculate the CRC and append it at the end of str making it 8 byte.
unsigned char str1[8] ={0x01,0x01,0x00,0x01,0x00, 0x20};
unsigned char* str2 = str1;
unsigned short test;
test= CRC16(str1,8);
here test will contain the returned CRC as unsigned short. How to append it as last 2 byte in str1[8].
A:
It's pretty simple, one example would be:
unsigned char buffer[8] ={0x01, 0x01, 0x00, 0x01, 0x00, 0x20, 0x00, 0x00};
unsigned short crc = CRC16(buffer, 8); // Calculates the CRC16 of all 8 bytes
buffer[6] = ((char*) &crc)[0];
buffer[7] = ((char*) &crc)[1];
It depends on the byte order of the destination system, you may swap 0 with 1 above.
Edit: Alternative:
*((unsigned short*) &buffer[6]) = crc;
| 2024-04-30T01:26:29.851802 | https://example.com/article/9350 |
Living Room
Other
Omaha Grey Trestle Table Dining Set
This counter-height dining room table set is finished in a weathered, burnished grey color, creating a rustic atmosphere. The table features a unique trestle base and a rectangular top with simple line molding on each side. It also has two 13-inch leaves, extending the table from 70 to 96 inches. The dining stools feature a stylish X-pattern on the backrests and simple tapering legs. Not only stylish but, the seating is also comfortable, with seats upholstered in a neutral grey fabric.
The Omaha Grey Counter Height 7-Piece Dining Room Table Set by Standard Furniture from Wayside Furniture. We proudly serve the Akron, Cleveland, Canton, Medina, Youngstown, Ohio area. Product availability may vary. Contact us for the most current availability on this product.
Specifications
Omaha Grey Trestle Table Dining Set Specifications
Item & Dimensions
Manufacturer
Standard Furniture
Dining Height
Counter
Material & Finish
Composition
Wood Veneers & Solids
Finish & Paint Options
Options: Burnished Saddle Brown or Weather Grey Finish
Style Elements
Style
Transitional
Handles & Hardware
Cast metal bar hardware with dark rustic bronze color finish
Case Detail
Square leg with chamfered foot, X-motif
Storage & Features
Leaf Type
Removable
Table Features
Includes Leaf/Leaves
Composition & Warranty
Case Construction
Constructed of mango veneers and mango solids, with some engineered wood products
Origin
Imported
Category Info
Collection Description
Standard Furniture Omaha Grey Description
The Omaha collection features regular and counter height trestle tables, chairs, and dining benches. A coordinating sideboard includes lots of storage for your wine glasses, bottles, china, and silverware. The seating pieces have X-motif backs and comfortable leather-looking upholstered seats. This collection is completed with burnished finishes, creating a warm and inviting atmosphere.
The Omaha Grey collection is a great option if you are looking for Transitional furniture in the Akron, Cleveland, Canton, Medina, Youngstown, Ohio area.
Collection Details
These images are representative of this group as a whole and may differ from this item.
Wayside Furniture features a great selection of living room, bedroom, dining room, home office, entertainment, accent, furniture, and mattresses, and can help you with your home design and decorating. Wayside Furniture offers great quality furniture, at a low price to the Akron, Cleveland, Canton, Medina, Youngstown, Cuyahoga Falls, Fairlawn, Barberton, North Canton, Hudson, Strongsville, Elyria, Mentor, Euclid, Parma, Lakewood, Medina Ohio area.
Information Accuracy - We have taken great care to provide you with information that is accurate and useful. Please notify us if you find an error and we will do our best to correct it. We ask that you contact us directly or visit our stores to confirm information about pricing, color, features, dimensions, availability and special order lead times. | 2024-01-07T01:26:29.851802 | https://example.com/article/7248 |
Thanks to Marc Quigley all
of my newsletters are placed properly in OMNI’s web site.
What’s at
stake: “China has experienced very little except humiliation and defeat
in its relations with the West” (J. William Fulbright, 1966). China’s
rise is not occurring at the expense of the United States (Donald Gross), and
China is not threatening the US militarily, but the reverse is true.
“A classic. . . . No American should be able to read [this book] without
weeping at his country’s arrogance.”—Anthony Lewis, New York Times
During the Vietnam War the United States government waged a massive, secret air
war in neighboring Laos. Fred Branfman, an educational advisor living in Laos
at the time, interviewed over 1,000 Laotian survivors. Shocked by what he
heard and saw, he urged them to record their experiences in essays, poems,
and pictures. Voices from the Plain of Jars was the result
of that effort.
When first published in 1972, this book was instrumental in exposing the
bombing. In this expanded edition, Branfman follows the story forward in
time, describing the hardships that Laotians faced after the war when they
returned to find their farm fields littered with cluster munitions—explosives
that continue to maim and kill today.
“Today, the significance of this book’s message has, if anything, increased.
As Fred Branfman predicted with uncommon prescience, the massive U.S. bombing
of Laos during the Vietnam War marked the advent of a new kind of
warfare—automated, aerial, and secret—that is just now emerging as the
dominant means of projecting U.S. power worldwide.”
—Alfred W. McCoy, author of Torture and Impunity: The U.S. Doctrine
of Coercive Interrogation Fred
Branfman (1942–2014)
was a writer and activist on issues of peace and climate change who lived in
Santa Barbara, California, and in Budapest.
After his passing, the New
York Times published an extendedobituary reflecting
upon the role of this book in his life's work as a peace activist.
Media & bookseller inquiries regarding review copies, events, and
interviews can be directed to the publicity department at publicity@uwpress.wisc.edu or
(608) 263-0734. (If you want to examine a book for possible course use,
please see Course Books in the left sidebar. If you want to examine a book
for possible rights licensing, please see Rights & Permissions in the
left sidebar.)
Of
Related Interest:Viêt NamBorderless
HistoriesEdited by Nhung Tuyet Tran and Anthony Reid
"Vitally important not only for Vietnamese studies, but also for
broader efforts in Southeast Asian studies to recover the pluralities and
fluidities of the past. This volume makes a convincing case for the
emergence of a real generational and analytical shift in the
field."—Mark Philip Bradley, Northwestern University
“[In Laos,] where a
right-wing government installed by the CIA faced a rebellion, one of the most
beautiful areas in the world, the Plain of Jars, was being destroyed by
bombing. This was not reported by the government or the press, but an
American who lived in Laos, Fred Branfman, told the story in his book Voices
from the Plain of Jars.”—Howard
Zinn, A People’s History of the United States
“In this small, shattering book we hear—as we are so rarely able to
do—the voices of Asian peasants describing what we can barely begin to
imagine.”
—Gloria Emerson, New York Review of Books
Prior edition: Harper & Row USA, 1972, Paper ISBN
0-060-903
Trans-Pacific Partnership
Public Citizen vs. TPP
To Dick, 10-28-14
Negotiations in Australia, aimed at hatching a final
Trans-Pacific Partnership (TPP) deal, came to a close earlier this week. Given
the extreme secrecy of the process,
there is no way for the public, Congress or the press to find out what really
happened.
Supporters of the dangerous 12-nation deal are using terms like
“endgame,” “breakthrough” and “finish line.” We’ve heard this spin before. But
thanks to growing opposition, TPP deadlines in 2012 and 2013 were missed.
We know that a lot of TPP issues seem to be unresolved. But we
also know that very bad deals often get done in secrecy when the pressure to
make a deal — any deal — is on. We can’t afford to wait and see.
The outstanding issues will decide if the medicine we need is
affordable, if more devastating financial crises are in our future and if
corporations can use investor-state panels to attack our laws and raid our
governments’ treasuries.
The best thing we can do is to make sure that IF there ever is a
finished TPP, there won’t be any Fast
Track to railroad it through Congress.
Take action now. Email your representative to say “no” to
fast-tracking the TPP.
President Barack Obama wants to announce a TPP deal when he’s in
Asia for the Asia Pacific Economic Cooperation summit in mid-November. So U.S.
negotiators are looking to finalize the 12-country deal despite mounting
evidence that this dangerous corporate fantasy should not be completed — now or
ever.
As negotiators rush to meet Obama’s arbitrary deadline, some
members of Congress are seeking to revive Fast Track in the upcoming lame-duck
session after the elections.
Fast Track would allow the president to sign the TPP without
congressional approval and then railroad the deal through Congress in only 90
days with limited debate and no amendments. Congress — which has constitutional
authority over trade — would be forced into an up-or-down vote on the TPP with
no opportunity to change the dangerous parts of the deal.
Some members of Congress are working on a replacement for Fast
Track, a so-called “Smart Track.” It is not yet clear if this will be the real
Fast Track replacement we so desperately need, or just another anti-democratic
Fast Track in disguise.
A real replacement for Fast Track would guarantee Congress a
steering wheel and an emergency brake for runaway “trade” deals. For example,
Congress should be able to vote to approve an agreement before it is signed by
the president.
Stay informed and speak out when it counts. Sign up for the
Public Citizen Action Network or other online announcements. If you do not wish
to receive e-mail messages from Public Citizen in the future, please click
here.
Public Citizen employees are members of SEIU Local 500. We
support the right of workers in the United States and around the world to
organize freely. Union Yes!
Remember NAFTA? The trade
agreement that sent thousands of jobs overseas and drove down wages at home?
Imagine NAFTA on steroids
and you get the Trans-Pacific Partnership Agreement (TPP). The TPP will make it
easier for corporations to ship job overseas, roll back Wall Street reforms,
and drive up the costs of medicines.
President Obama is asking
for "fast-track" authority from Congress to quickly pass the
agreement with limited debate.But members of Congress don't even know what's in it! The deal
has been kept secret, accessible only to corporations and heads of state.
The TPP was written in
secret by advisers from some of the largest multinational corporate
conglomerations in the Western hemisphere.
Even members of Congress
haven't been given access to the entire 29-chapter document! President Obama is
hoping to "fast track" it through Congress with a quick up or down
vote before they get a chance.
We need to make sure
Congress knows we stand against secret policies that hurt working people.
1/25/2015
Gmail Tell Washington to oppose the TransPacific Trade Partnership agreement
(TPP)
https://mail.google.com/mail/u/0/?ui=2&ik=dd75a4efec&view=pt&search=inbox&th=14b1f44afd1dec04&siml=14b1f44afd1dec04&siml=14b1f44b38080e71
1/2 Dick Bennett Tell Washington to oppose the TransPacific Trade Partnership
agreement (TPP) 2 messages Progressive Secretary Sat, Jan 24, 2015 at 10:06 PM
ReplyTo: "actionreply@progressivesecretary.org" To: "James R.
Bennett" Dear Dick, Here is a new Progressive Secretary letter. This
letter supports campaigns by many organizations opposing the TransPacific
Partnership (TPP) trade agreement. The treaty allows corporations to sue
governments in trade tribunals for expected "lost profits." These
"tribunals" aren't US courts. They're international arbitration
tribunals and they're empowered to award massive payments to corporations.
Anything done in the public interest is likely to result in "lost
profits." That means that a tribunal ruling allows foreign corporations to
override our laws. Oppose this treaty by sending a letter to the President and
to the Senate. The Senate must reject the TransPacific Partnership (TPP) trade
agreement (treaty). With the assistance of 600 corporate advisers, the
administration negotiated the TPP secretly, ignoring Congress and the American
people. Former Trade Representative Ron Kirk said that if Americans knew what
was in it, they would oppose the agreement. And no wonder. The TPP — the biggest corporate power grab in history— will allow corporations to overturn
laws that protect the public and the environment if those laws result in lost
(corporate) profits. The TPP will hurt American manufacturing, guaranteeing
that the USA treat businesses incorporated in TPP countries equally with U.S.
firms when bidding on government contracts. Like NAFTA, the TPP will drive down
wages. Please show your allegiance to the people you represent. Stop the TPP.
Click here to send this letter or to learn more (you can edit the subject or
the letter itself in the next step, if you wish).1/25/2015 Gmail Tell
Washington to oppose the TransPacific Trade Partnership agreement (TPP)
https://mail.google.com/mail/u/0/?ui=2&ik=dd75a4efec&view=pt&search=inbox&th=14b1f44afd1dec04&siml=14b1f44afd1dec04&siml=14b1f44b38080e71
2/2 To ask friends to sign this letter, forward this link (doesn't contain your
personal contact information):
http://action.progressivesecretary.org/p/dia/action3/common/public/?
action_KEY=10838 Sincerely, Kathie Turner, Executive Director Be a Fan on Facebook
| Follow us on Twitter Want to make Progressive Secretary even better? Suggest
a letter | Recruit a Friend Donate | Volunteer Progressive Secretary Sat, Jan
24, 2015 at 10:06 PM ReplyTo: actionreply@progressivesecretary.org To:
j.dick.bennett@gmail.com [Quoted text hidden]
CHINA
AVOIDING WAR WITH CHINA
J. William Fulbright Testifies on
China and Vietnam
1966
[United States senator J. William
Fulbright of Arkansas supported the 1964 Gulf of Tonkin Resolution, which
allowed President Lyndon Johnson to expand U.S. military involvement in the
Vietnam War (1959-1975). But Fulbright had begun to question the U.S. role in
the war by 1966 when he testified at Senate Foreign Relations Committee
hearings on U.S. policy toward China and Vietnam. Fulbright, who was chairman
of the committee, warned that U.S. engagement in Vietnam could lead to a war
with China. --Dick]
J. William Fulbright Testifies on
China and Vietnam
1966
China has experienced very little except humiliation and defeat
in its relations with the West, including Russia and, to some degree, America.
One of our leading Chinese scholars, Prof. John K. Fairbank, who is the
director of the East Asian Research Center of Harvard University, believes that
the rapacious behavior of Europeans in China in past centuries has a great deal
to do with the irrationality and hostile behavior of China's current leaders.
Words like "extraterritoriality" and "unequal
treaties" are far too antiseptic, too bland, to describe China's
humiliation by Western imperialism. In human terms, the coming of Western
civilization to China in the nineteenth century meant the plundering of China's
wealth by foreigners and the reduction of most of the Chinese to an inferior
status within their own country. Missionaries were immune from Chinese law and
treated the Chinese as heathen, except, of course, for the converts who also
claimed immunity from Chinese law and used the power conferred by their foreign
association to intimidate their fellow citizens. Foreign goods were exempted by
treaty from internal toll taxes imposed by the Manchu Dynasty to pay for the
Taiping rebellion of the mid-19th century, with the result that Western
companies destroyed their Chinese competitors in the sale of such products as
timber, oil, tobacco and, of course, opium. Each of China’s disastrous
nineteenth century wars with the West was followed by the levy of a huge
indemnity or some further incursion on the economic life of the country.
It is of great importance that we try to learn something more
about the strange and fascinating Chinese nation, about its past and its
present, about the aims of its leaders and the aspirations of its people.
Before we can make wise political -- and perhaps military -- decisions
pertaining to China, there are many questions to be asked and, hopefully,
answered: What kind of people are the Chinese? To what extent are they
motivated by national feeling? To what extent by ideology? Why are the Chinese
Communist leaders so hostile to the United States and why do they advocate violent
revolution against most of the world's governments? To what extent is their
view of the world distorted by isolation and the memory of ancient grievances?
To what extent, and with what effect on their Government, do the Chinese people
share with us and with all other peoples what Aldous Huxley has called the
simple human preference for life and peace?
We need to ask these questions because China and America may be
heading toward war with each other and it is essential that we do all that can
be done to prevent that calamity, starting with a concerted effort to
understand the Chinese people and their leaders.
The danger of war is real. It is real because China is ruled by
ideological dogmatists who will soon have nuclear weapons at their disposal and
who, though far more ferocious in words than in actions, nonetheless are
intensely hostile to the United States. In the short run the danger of war
between China and America is real because an "open-ended" war in
Viet-Nam can bring the two great powers into conflict with each other, by
accident or by design, at almost any time. Some of our military experts are
confident that China will not enter the war in Viet-Nam; their confidence would
be more reassuring if it did not bring to mind the predictions of military
experts in 1950 that China would not enter the Korean war, as well as more
recent predictions about an early victory in Viet-Nam. In fact, it is the view
of certain China experts in our Government that the Chinese leaders themselves
expect to be at war with the United States within a year, and it is clear that
some of our own officials also expect a war with China.
Our ultimate objective must, of course, be political: the
prevention of war between China and America. At present there appears to be a
growing expectation of war in both countries and, as Professor [Gordon W.]
Allport points out, "what people expect determines their behavior."
Perhaps a concerted effort to increase our understanding of China and the
Chinese would alter that fatal expectancy, and perhaps if our expectations were
altered theirs too would change. It is anything but a sure thing but,
considering the stakes and considering the alternative, it seems worth a try.
The Chinese today, like Americans a hundred years ago, are in an
agitated and abnormal state of mind. It is not only within our means but, as a
great and mature Nation, it is our responsibility, as [United Nations Secretary
General] U Thant so wisely pointed out, to try to understand the causes of
China's agitation and to try to find some remedy.
A similar version from Brisbane,
Australia, was published in the Arkansas
Democrat-Gazette (Nov. 16, 2014), from which I am quoting, “Obama, Allies
Discuss Pacific-Region Security.”
Pace: “Eyeing Chinese
aggression, President Barack Obama and the prime ministers of Japan and
Australia committed today to deepen their military cooperation and work
together on strengthening maritime security in the Asia Pacific.”
Chinese aggression? For
example? (Pace here using the language
of the military triumvirate. See
later.) Rather, the US has moved across the Pacific
Ocean relentlessly expanding its bases closer and closer until surrounding
China: Hawaii, Guam (a super-size
carrier battle group) , Philippines, Japan (Okinawa the firepower of 10 carrier
battle groups, which the US also has roaming the seas, China not yet one),
South Korea (Jeju Island)—pan-Asian military treaties to contain “Chinese
aggression.” And now three agree to
“’deepen the already strong security and defense cooperation,’” now tightening
the drawstring with Japan to the north and Australia to the South, both already
firm allies with the US against the fearsome foe, but there can never be enough
reassuring threatening control for the pathologically insecure.
Pace: Asia Pacific is “a
region rife with disputes between China and its neighbors over claims to waters
and islands.”
What is the threat? What
is China’s role, President Obama asked in a speech a the University of
Queensland? “By virtue of its size and
its remarkable growth. . ..”? Where’s
the aggression in that?
Pace: “The president has tried to show the region’s leaders that
he retained the ability to deliver on promises to deepen U.S. engagement in
Asia and the Pacific, an effort he sees as a central part of his foreign
policy.”
By this point in the report we realize how much a euphemism is
the word “deepen.” President Obama is
referring to unimaginably massive weaponry and surveillance throughout the
Pacific and East Asia. And who makes US
foreign policy by the way? And what
should be said regarding the dangerously unrestrained growth of the US president’s
power since the beginning of WWII?
Pace: Quoting Obama:
“’There are times when people have been skeptical of this rebalance, they’re
wondering whether America has the staying power to sustain it.’” Rebalance?!
The statement is so blatantly self-deluding or deliberately deluding the
US public that surely Pace, if she has studied this subject, later wondered
about her staying power.
Pace: Quoting Obama
again: “’I’m here to say that American
leadership in the Asia Pacific will always be a fundamental focus of my foreign
policy.” Now I wonder about the staying
power of the Asian leaders, so arrogant is this statement. But of course, given “Beijing’s provocative
actions in territorial disputes in waters off its borders” (Pace), US
leadership is necessary?
Provocative? Example? “The conflict between China and Japan over a
string of uninhabited islands in the East China Sea. . . .”
Reporting a meeting of three biased participants led by the
leader of the one super-power, Pace could write and quote no differently; she
could not editorialize, in her own voice at least. But she could have followed the fundamental
training and practice of journalists, of reporting both sides. How do Chinese leaders respond to Obama’s
statements? How do opposition leaders in
Australia and Japan? How do opponents in
the US? Of course, she was writing
against a deadline, but that is a feeble excuse for accepting a puppet’s role.
The China Fallacy:
How the U.S. Can Benefit from
China's Rise and Avoid Another Cold War by Donald Gross
Published: 11-08-2012
Tell others about this book
About The China Fallacy
American critics who deeply fear a "China threat" have
unduly influenced government policy. "China hawks" believe China
intends to push the United States out of Asia and dominate the world.
Protectionists argue that China threatens American jobs and prosperity.
This authoritative work examines why and how the U.S. should
stabilize and improve its relations with China. It first assesses the threat
posed by China, addressing such issues as military capability, Taiwan, the
trade deficit, human rights and democracy. It then discusses the rationale for
rapprochement between the two countries in order to achieve a stable peace. It
makes the case for a fundamental shift in U.S. policy and efforts by both
countries to increase their cooperation. It analyzes the benefits to the United
States of this policy shift along with the potential impact on Japan, Taiwan,
and both Koreas.
This significant work on U.S.-China relations will be an
essential resource for the academic and policy community as well as of interest
to the general reader on a topic of great public concern.
Table Of Contents
1. Introduction: The Unfulfilled Promise of U.S.-China Relations
2. The Real Military Balance
3. Rapprochement and a Stable Peace
4. China's Economic Juggernaut
5. Democracy and Human Rights in China
6. The "Soft Power" of China's Foreign Policy
7. Getting It Right: A New Framework Agreement for U.S.-China
Relations
“The China Fallacy is essential reading for anyone who wants to
understand American policy toward China. Its thoughtful recommendations on
improving U.S.-China relations should be weighed seriously by all concerned
with the impact of China's rise.” –
Samuel R. Berger, United States National Security Advisor, under
President Bill Clinton from 1997 to 2001
“Understanding the complexity, risk and opportunity of China's
rise will drive American opinions and policy making well into the 21st century.
This book makes an important contribution to that end.” – John Huntsman, former United States
Ambassador to China
Donald Gross. The China
Fallacy: How the U.S. Can Benefit from China's Rise and Avoid Another Cold War.
New York: Bloomsbury, 2013. Rev. by
Kai Chen
in Peace
and Change 10/2014; 39(4). DOI: 10.1111/pech.12093. [“Gross’s main argument is to criticize the
fallacy that ‘China’s rise is occurring at the expense of the United
States.’” My 14 newsletters support
the argument, citing evidence and arguments of the US threat to China. I
haven’t read the book yet. –Dick]
Nick Turse | The Outpost That Doesn't Exist in the Country You
Can't Locate
Nick Turse, TomDispatch, Reader Supported
News, Nov.
23, 2014.
Turse writes: "Admit it. You don’t know where Chad is. You know it’s in
Africa, of course. But beyond that? Maybe with a map of the continent and by
some process of elimination you could come close. But you’d probably pick Sudan
or maybe the Central African Republic. Here’s a tip. In the future, choose that
vast, arid swath of land just below Libya."READ MORE | 2023-10-12T01:26:29.851802 | https://example.com/article/9485 |
New Roots Vitamin E8
Vitamin E is one of the great fat-soluble antioxidants; it is able to go where ordinary water-soluble antioxidants cannot. Vitamin E helps stop oxygen in red blood cells from turning into harmful peroxides. As well, it protects other vitamins from oxidation in the digestive tract.
Most vitamin E products contain only d-alpha-tocopherol, and often the synthetic form; there is much more to vitamin E than d-alpha-tocopherol—there are eight compounds that make up the vitamin E family. Our food contains all eight compounds, and this is the form our bodies have been processing since the beginning of our time.
New Roots Herbal’s Vitamin E8 contains all eight members of the vitamin E family—four tocopherols and four tocotrienols—, extracted from vegetable oils that are present in their natural, fully active, unesterified form. The eight members of the vitamin E family have some functions that are similar, and other functions that are completely different. For example, gamma-tocopherol has a greater ability to detoxify nitrogen radicals that are associated with neurological disease, inflammation, and prostate cancer.
POPULAR CATEGORIES
VITASAVE REWARDS PROGRAM
Follow Us
ABOUT VITASAVE.CA
Vitasave.ca is one of Canada’s fastest growing ecommerce companies in the natural health product industry. Our mission is to make healthy living easy and affordable for everyone. We provide an unparalleled level of customer service and proudly offer free shipping on orders over $69 within Canada and a hassle-free 60 day return policy. | 2024-03-28T01:26:29.851802 | https://example.com/article/9432 |
Narendra Modi wins over Nepalese people by using Nepali language in speech
KATHMANDU: Prime Minister Narendra Modi today won the hearts and minds of Nepalese people when he began his gripping address to the Parliament in Nepali language, recalling his previous visit to the country as a pilgrim.
“I have returned to this beautiful country as a friend and I am happy to come here as Prime Minister,” said Modi in Nepali language before continuing his speech in Hindi.
Modi recalled that he had visited Nepal as pilgrims long ago.“Since the day I entered the Prime Minister’s office, strengthening relationship with Nepal is one of the top priorities of my government, he said.
“I have come here with the goodwill and love from one and a quarter billion people of India,” Modi said amidst a big applause by lawmakers in the 601-member Constituent Assembly.
In his televised speech, Modi said the world is watching the peace process of Nepal and Nepal has set an example by shunning violence and following the path of peace.
“You have abandoned Shashtra or weapons and followed Shaastra, the scriptures,” he said in his 45-minute speech, highlighting the important task of writing the constitution.
“You have abandoned the path of Yuddha or War and followed the path of Buddha,” Modi, the first Indian Prime Minister to visit the country in 17 years, said.
He also reiterated that Nepal is the country where apostle of peace in the world, Buddha was born.
“This is the land of Sita and Janak,” he added. “Nepal-India relations are as old as the Himalayas and the Ganga,” he said.
“Our relations have not moved forward with mere documents but through the heart of our peoples.”
“There is a temple in Varanasi, Kashi, from where I got elected, where Nepalis are the priests and here in Pashupati, you have Indian priests, which signifies close religious ties between the two countries,” he pointed out. | 2023-12-01T01:26:29.851802 | https://example.com/article/7058 |
1. Field of the Invention
The present invention relates to a data pass control device for masking a write ringing in a DDR SDRAM (Double Data Rate Synchronous Dynamic Random Access Memory) and a method thereof and more particularly, to a data pass control device for masking a write ringing that occurs at the completion of the writing operation of the DDR SDRAM and a method thereof.
2. Description of the Related Art
A DDR SDRAM is generally a memory device that generates an internal synchronization clock clk generated from an external synchronization clock ext_clk through a DLL circuit or other circuit and then inputs/outputs data synchronously with the rising and falling edges of the internal synchronization clock clk. The internal synchronization clock clk is also referred as to a master clock master clk.
What is going to be described here in connection with the DDR SDRAM is one particular operation, that is, how to eliminate failure or malfunction of a memory device, caused by ringing during a write operation.
Typically, the ringing during the write operation is referred as to a write ring back phenomenon. When this write ring back occurs, an unwanted dummy write operation is performed due to the ringing of a data strobe signal at the last phase of the write operation and then existing data stored in a data latch is changed, resulting in a write error. The data strobe signal and data latch will be described later in detail.
Hereinafter, it will be appropriate to give definitions of signals used in this specification and then problems found in related art techniques will be described next.
<Definitions of Signals>
1. ext_clk: An external synchronization clock that is applied from the outside of the DDR SDRAM.
2. clk: An internal synchronization clock generated by receiving the external synchronization clock. This is an internal master clock, synchronizing data input/output. In other words, this is the master clock for controlling overall operations of the DDR SDRAM.
3. din: Data inputted from the outside during a write operation of the DDR SDRAM. This is the abbreviation of input data. Usually, a voltage level of the input data din is SSTL level. This input data din is applied to a data input buffer din_buffer.
4. ds: Data strobe signal inputted from the outside during a write operation of the DDR SDRAM. The ds signal, which will be described later, transfers the input data din onto global input/output lines gio. In general, voltage level of the ds signal is SSTL level. The ds signal is applied to a data strobe buffer ds_buffer.
5. din_buffer: A data input buffer. This amplifies the SSTL level of the input data din inputted from the outside during a write operation of the DDR SDRAM up to CMOS level. If the voltage level of the input data din is higher than a designated reference voltage level, a high level is outputted to output line in and a low level is outputted to output line inz. On the contrary, if voltage level of the input data din is lower than the designated reference voltage level, the high level is outputted to the output line inz and the low level is outputted to the output line in. Here, the output line inz denotes input bar (i.e./din). According to en_dinz signal (enable data input bar signal), the data input buffer din_buffer is disabled during a read operation but enabled during a write operation.
6. ds_buffer: A data strobe buffer. This amplifies the SSTL level of the data strobe signal ds inputted from the outside during a write operation of the DDR SDRAM up to CMOS level. If voltage level of the inputted data strobe signal ds is higher than a designated reference voltage (that is, a high level), an output signal rdinclk is outputted as a high level signal and a output signal fdinclk is outputted as a low level signal. On the other hand, if the voltage level of the data strobe signal ds is lower than the designated reference voltage (that is, a lower level), the rdinclk is outputted as a low level signal and the fdinclk is outputted as a high level signal. Here, the rdinclk is the abbreviation of a rising data input clock, and the fdinclk is the abbreviation of a falling data input clock. According to the en_dinz signal (enable data input bar signal), the data strobe buffer ds_buffer is disabled during a read operation but enabled during a write operation.
7. din_lat: A data latch means. In a case that an input signal ds of the data strobe buffer ds_buffer is on a rising edge, data outputted from the data input buffer din_buffer is synchronized with an output signal rdinclk of the data strobe buffer and then stored in the data latch means. In addition, in a case that an input signal ds of the data strobe buffer ds_buffer is on a falling edge, data outputted from the data input buffer din_buffer is synchronized with an output signal fdinclk of the data strobe buffer and then stored in the data latch means. The data din stored in the data latch means din_lat is transferred to the global input/output lines gio, in response to a control signal dinstb (data input strobe).
8. dis_diz: Based on an assumption that a data strobe signal ds is on a falling edge, an output signal of a controller outputting a disable level output signal dis_diz (disable data strobe bar) after receiving the fdinclk signal which is an output signal of the data strobe buffer ds_buffer. The disable level output signal dis_dsz is feedbacked to the data strobe buffer ds_buffer and as a result, the fdinclk signal pass is blocked (or masked). Afterwards, the disable level output signal dis_dsz becomes an enable level signal by the internal synchronization clock clk and thus, enables the data strobe buffer to pass the next fdinclk signal.
9. en_dinz: A signal that enables the data input buffer. din_buffer and the data strobe buffer ds_buffer during a write operation and disables the data input buffer din_buffer and the data strobe buffer ds_buffer during a read operation.
10. en_din: A signal having a voltage level opposite to the voltage level of en_dinz.
11. dinstb: A signal for synchronizing a data stored in the data latch means din_lat with the internal synchronization clock clk and transmitting to the global input/output lines gio.
Hereinafter it will be explained of related art techniques.
FIG. 1 is a schematic block diagram illustrating a data pass controller used in a write operation of a related art DDR SDRAM.
As shown in FIG. 1, the related art data pass controller includes an input buffer 100, a data strobe buffer 110, a data latch 120, and a data strobe buffer controller 130. Here, the data input buffer 100 is denoted by din_buffer; the data strobe buffer 110 is denoted by ds_buffer; and the data latch 120 is denoted by din_lat.
Since functions of each individual elements and their signals are already described above, the overall operation of the data pass controller will now be briefly described below and then a write ringing at the last phase of the write operation will be detailed next. Further referring to FIG. 1, FIG. 2 illustrates a waveform diagram of signals in FIG. 1.
First, the overall operation of the data pass controller depicted in FIG. 1 is as follows:
1) During a write operation, the data input buffer 100 and the data strobe buffer 110 are enabled according to en_dinz signal.
2) Data din inputted from the external is transferred to output lines in, inz through the data input buffer 100.
3) Data strobe signal ds applied in pulse type outputs pulse type of signals rdinclk, fdinclk through the data strobe buffer 110.
4) When the data strobe signal ds is on a rising edge, the data on the output lines in, inz of the data input buffer 100 is synchronized with the rdinclk signal and is stored in the data latch 120. On the other hand, when the data strobe signal ds is on a falling edge, the data on the output lines in, inz of the data input buffer 100 is synchronized with the fdinclk signal and is stored in the data latch 120.
5) The stored data in the data latch 120 is transferred to global input/output lines gio, in response to a data input strobe signal dinstb.
6) The output signal fdinclk at the step 3) is also applied to the data strobe buffer controller 130. In case that the data strobe signal ds is on the falling edge, the data strobe buffer controller 130 is synchronized with the fdinclk signal among the output signals of the data strobe buffer ds_buffer and outputs a disable level output signal dis_dsz (disable data strobe bar). This disable level output signal dis_dsz is feedbacked to the data strobe buffer ds_buffer and as a result, the fdinclk signal pass is blocked (or masked). By the internal synchronization clock clk, the disable level output signal dis_dsz becomes an enable level signal and enables the data strobe buffer 110 to pass next fdinclk signal (reference to FIG. 2).
With reference to FIGS. 1 and 2, the following will now describe the write ringing that occurs during the write operation.
As illustrated in FIG. 2, when the en_dinz signal is enabled to a low level, the data input buffer 100 and the data strobe buffer 110 are enabled. Therefore, the input data din is transferred to the output lines in, inz of the data input buffer 100. Still referring to FIG. 2, the data strobe signal ds is applied as a pulse type of signal. Moreover, assuming that the ringing does not occur, a data strobe signal made of four pulse signals has four rising edges and four falling edges, so that a total of 8 data will be stored in the data latch 120. For example, DQ1, DQ2, DQ3, DQ4, DQ5, DQ6, DQ7, and DQ8 data will be inputted in sequence through an input line of the data input buffer 100.
More details are as follows:
1) In response to the rising edge of a first data strobe signal ds, the first data DQ1 is stored in the data latch 120.
2) In response to the falling edge of the first data strobe signal ds, the second data DQ2 is stored in the data latch 120. Here, a high pulse signal fdinclk is outputted in response to the falling edge of the first data strobe signal ds. Then the controller 130 receives the signal fdinclk and outputs a low level enable signal dis_dsz. The low level enable signal dis_diz is feedbacked to the data strobe buffer 110, to block (or mask) the generation of the fdinclk signal. As described above, the second data DQ2 is stored in the data latch 120 in response to the fdinclk signal generated before it is masked by the low level enable signal dis_dsz. Hence, the first data DQ1 and the second data DQ2 stored in the data latch 120 are transferred to the global input/output lines gio by the data input strobe signal dinstb. Accordingly, the first write operation is completed. The next step is, as shown in FIG. 2, that the output signal dis_dsz of the controller transits to a high level by the internal clock clk and enables the data strobe buffer ds_buffer. As a result of this, the data strobe buffer ds_buffer starts operating normally.
3) The operations of a second, a third, and a fourth data strobe signal ds on the rising and falling edges are identical with the ones described in steps 1) and 2).
4) However, in the case of the related art, as illustrated in FIG. 2, after the falling edge of the fourth data strobe signal ds, for some reason the ringing occurs when the data strobe signal ds turns back to the termination voltage or standby voltage. What happens in such case is that the signals rdinclk and fdinclk are generated at the rising and falling edges of the data strobe signal generated due to the ringing and as a result, an invalid data is applied to the data latch 120. | 2023-11-28T01:26:29.851802 | https://example.com/article/4582 |
#ifndef _IXGBE_OSDEP_H_
#define _IXGBE_OSDEP_H_
#ifndef __cplusplus
typedef int bool;
#endif
typedef uint32_t __le16;
typedef uint32_t __le32;
typedef uint64_t __le64;
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
#endif /* !_IXGBE_OSDEP_H_ */
| 2023-09-15T01:26:29.851802 | https://example.com/article/8213 |
Doctor Who: The Adventure Games
Doctor Who: The Adventure Games is a series of episodic third-person adventure games, based on the BBC TV series Doctor Who and developed by Sumo Digital. Charles Cecil served as executive producer and worked with Sean Millard and Will Tarratt on the design.
Each episode was made available for free download to residents of the UK via the BBC's official Doctor Who website; a UK internet address is required to both download and install them, though several of the games subsequently were made available for international sale. The first one was released on 5 June 2010, the second one on 26 June 2010, the third on 27 August 2010, the fourth on 22 December 2010 and the fifth on 31 October 2011.
In February 2012, the BBC announced they had shelved the games in favour of worldwide console games such as Doctor Who: The Eternity Clock. In June 2017, the game no longer became available to purchase on the Steam platform after the developer's license with the BBC expired.
Production
The games were commissioned by Simon Nelson and Rosie Allimonos of BBC Vision. Phil Ford was selected to write because of his experience in writing for Doctor Who and The Sarah Jane Adventures, including writing the Dreamland animated Doctor Who series.
Phil Ford and James Moran wrote the scripts, and Charles Cecil worked on the game design. The Games were created by Sumo Digital with Will Tarratt as lead designer. Composer of the revived series of Doctor Who Murray Gold has provided music for The Adventure Games. Executive producers of the 2010 series of the show Steven Moffat, Piers Wenger and Beth Willis, along with BBC Wales Interactive's Anwen Aspden and video game creator Charles Cecil all serve as executive producers of the interactive episodes. Producer and voice director was Gary Russell who had previously directed the animated serials The Infinite Quest and Dreamland.
As of January 2012, The Adventure Games have been shelved, with the BBC instead focusing on projects such as The Eternity Clock.
In June 2017, the game no longer became available to purchase on the Steam platform after the developer's license with the BBC expired.
Episodes
All 5 adventure games are released in a 5 Pack PC DVD set and sold on Amazon.
Series 1
Series 2
Cast and characters
Playable characters
Rotoscope technique was used to capture the actors' movements.
Matt Smith as the Eleventh Doctor (series 1 – 2)
Karen Gillan as Amy Pond (series 1 – 2)
Arthur Darvill as Rory Williams (series 2 only)
Others
Series 1
Nicholas Briggs as Dalek Voices ("City of the Daleks") / Cyber Voices ("Blood of the Cybermen") / Oswald Fox ("Shadows of the Vashta Nerada"). He has voiced the Daleks and Cybermen since the revival of Doctor Who in 2005. He has also voiced the Judoon and appeared as Rick Yates in "Day Four" of Torchwood: Children of Earth.
Sara Carver as Sylvia ("City of the Daleks"). She previously starred as Khellian Queen in Fifth Doctor's audio adventure "Three's a Crowd" and as Kim Kronotska in Eighth Doctor's audio adventure "Memory Lane". She has also voiced other characters in numerous Doctor Who related audio dramas produced by Big Finish.
Sarah Douglas as Professor Meadows ("Blood of the Cybermen") / Entity ("TARDIS") / Jones ("Shadows of the Vashta Nerada"). She had previously played Gillen in the Doctor Who Unbound audio drama Masters of War, Mary in the Iris Wildthyme audio drama The Claws of Santa and later appeared in the fourth series of Gallifrey.
Barnaby Edwards as Chisholm ("Blood of the Cybermen") / Martin Flanagan ("Shadows of the Vashta Nerada"). He has directed, written and provided voices for various Big Finish Doctor Who audios, and is also a principal Dalek operator in the television series.
Eleanor Matsuura as Dana Tanaka ("Shadows of the Vashta Nerada"). She previously played Jo Nakashima in "The Sontaran Stratagem".
"The Gunpowder Plot"
Emilia Fox as Lady Winters She previously played Berenice in the Eighth Doctor audio drama Nevermore.
Ralf Little as Guy Fawkes
Phil Daniels as Geoffrey Plum
Alexander Vlahos as Robert Catesby
Dan Starkey as Field Major Kaarsh / Sontarans
Miles Richardson as Black Rod
David Ames as Thomas Percy
Lizzie Hopley as Alice Flowers She previously appeared in the Seventh Doctor audio drama Night Thoughts as Sue, the Eighth Doctor audio drama Terror Firma as Gemma Griffin, and in I, Davros as Yarvell.
Jamie Oram as Charlie
Chris Johnson as Barnaby He previously appeared in the fourth series of Gallifrey and in Bernice Summerfield: Epoch as Darion.
Amelda Brown as Margaret
Barnaby Edwards as The Silence
Plots
City of the Daleks
The Doctor and Amy arrive in Trafalgar Square, London in 1963 to find the city in ruins and under the control of the Daleks. Following a woman, Sylvia, into the London Underground they learn that she is the only human survivor after the Daleks invaded – appearing through a 'split' in the sky. Amy, Sylvia and the Doctor are pursued by the Daleks. Sylvia is killed but the Doctor and Amy escape. The Doctor deduces that the Daleks have gained the power to alter history and, returning to the TARDIS with Amy, traces the source of the invasion to Skaro, the Daleks' home planet.
The TARDIS lands in Kaalann, the Dalek capital city, which has been rebuilt since the Doctor last saw it. Amy begins to fade, since the destruction of humanity in 1963 means that she was never born. The Doctor uses several Dalek components to create a "Chronon Blocker", which slows the process. The Doctor and Amy observe the Dalek Council Chamber. They see the Dalek Emperor, as well as a device which the Doctor believes to be the technology that allows the Daleks to manipulate history. The Doctor and Amy are captured by Daleks and taken before the Emperor. The Emperor explains that the Daleks will become the new Time Lords with control over the Time Vortex, through the use of the "Eye of Time", a powerful tool previously kept on Gallifrey. The Doctor escapes with Amy by leaping into the Eye which transports them back in time to an earlier ruined Kaalann which is infested with Varga plants just prior to the arrival of the Daleks with the Eye.
The Doctor sends Amy to find components that he can use to create a device that will blind the Daleks. Despite beginning to fade once more, Amy finds the parts and the Doctor constructs the device. In the Council Chamber, the Daleks, led by the white Supreme Dalek, are preparing to use the Eye to launch an attack on Earth in 1963. Amy, still fading, activates the blinding device affecting the Daleks. This allows the Doctor to free the Eye from its restraints and to flee the room with Amy. The Eye crashes down and explodes and the Doctor and Amy find themselves back at the TARDIS, but with Kaalann still in ruins. Amy is no longer fading out of existence. Using the TARDIS scanner, they see that the original 1963 timeline has been restored and that Sylvia is alive.
Blood of the Cybermen
A number of flashbacks show an excavation of an arctic base. A worker at the base called Chisholm flees from the base on a Snowmobile where he finds a Cyberman arm. Chisholm falls off a cliff and gets badly hurt.
The Doctor receives an SOS call which he responds to, and landing where Chisholm fell. The Doctor and Amy rescue Chisholm and they use the TARDIS to go back to the base where Chisholm came from.
They get out the TARDIS where Chisholm is attacked by a Cybermat after which he runs away and hides. The Doctor goes to the base entrance where he encounters a Cyberslave. After Amy kills the Cyberslave they enter the base. The head of the operation, Professor Meadows (voiced by Sarah Douglas), tells them that all of her crew have been turned into Cyberslaves. The Doctor starts on a serum to reverse the effects of the Cyberman conversion. To reach the communications room they have to get past Cybermats and then a Cyberslave which tries to kill Amy. The Doctor and Amy hear over the radio that a team is coming to the base, however they can't be warned until the radio is repaired. The Doctor has developed a cure which they give to the part changed Chisholm. Chisholm shows them a lift in which they go down underground.
Trying to get to the control room the Doctor and Amy have to get around Cyberslaves. However, Amy is kidnapped by two Cyberslaves. The Doctor reaches the control room where he finds Professor Meadows is now a Cyberslave. She forces the Doctor to revive the Cybermen from stasis to save Amy. The Doctor saves Amy but he needs to stop the Cybermen. The intervention of Chisholm allows him to do this and they escape from underground before an explosion destroys everything. The Doctor and Amy leave Chisholm behind so he can answer any questions that UNIT might have. After that the Cybermen are seen frozen on ice.
TARDIS
The Doctor and Amy are inside the TARDIS, discussing where they should go next for a more peaceful outing, and the Doctor mentions that his holidays in Brighton and Paris did not turn out well (alluding to The Leisure Hive and City of Death respectively). However, the TARDIS suddenly enters a 'space riptide', and the Doctor is launched through the doors and out into space.
After the TARDIS steadies itself, Amy looks outside and sees the Doctor hovering, still conscious and surrounded by a number of strange blue worms, a short distance away. Through sign language, he manages to tell Amy that he is slowly suffocating, and she can save him by operating the TARDIS. Amy follows his directions and recovers the Doctor by using a makeshift tractor beam to draw him back into the TARDIS. The blue worms, known as 'Chronomites', are somewhat harmless parasites, although they can make you 'very itchy'.
Just as they begin to celebrate their victory, the TARDIS enters another riptide, and Amy disappears. Amy is now in the Doctor's future with a strange glowing sphere that she had accidentally released from its prison in the TARDIS. The Doctor brings himself and Amy back into the same time and deals with the creature, the "Entity", by releasing it into the vortex so that it can feed on the Chronomites while the Chronomites feed on it, the two keeping each other contained.
The Doctor plans to take Amy to 23rd century London just after a 'Great Flood', but finds that the underwater city is being prowled by a gigantic shark-like creature.
Shadows of the Vashta Nerada
The episode begins with the Doctor and Amy being stalked through the underwater city (from the end of the previous episode) by an enormous shark-like creature known as a 'Zaralok'. The two make their way through a series of tunnels while the Zaralok tries to ram its way in; while they manage to escape, the Zaralok destroys one of the tunnels, separating them from the TARDIS. They head over to the city's central building, Poseidon Eight, where they are greeted by an oceanographer called Martin. The Doctor explains to Amy how sea levels rose dramatically, causing the entire human race to rebuild on higher land. However, underwater cities like this one, Poseidon, were built in order to harvest resources from the ocean floor. He also notes how the Zaralok is obviously not indigenous to Earth, and must have somehow relocated from another world.
Martin explains how Poseidon's workers have been suffering from some form of disease, and how Jones, the intelligent computer monitoring Poseidon, has been forced to place the crew under quarantine. Martin then takes the Doctor and Amy to meet Dana, the crew's medic, and Oswald, the captain. Before they are able to explain any more about the situation, the lights go out due to a generator malfunction; when they come back on, Martin's flesh has been eaten away from his skeleton inside his diving suit. The Doctor realises that Poseidon has also been infested by Vashta Nerada.
The Doctor and Amy travel through Poseidon's tunnels, while still being stalked by the Zaralok, in order to reach the generator and switch the lights back on. After evading a pair of divers, now dead and re-animated by the Vashta Nerada, they succeed and head back to meet Oswald. The Doctor explains how he found a radiation detector on one of the diving suits which has picked up a form of radiation that Jones was unable to identify. The Doctor believes the radiation is of alien origin and he knows how to create a cure to stop it; however, Oswald is reluctant to let him back out into the tunnels to find the required ingredients. He instead intends to send everybody up to the surface in safety pods – a bad idea, as they would surely be destroyed by the Zaralok. Oswald still refuses to let them out, and closes off the city outside Poseidon Eight.
The Doctor convinces Dana to reopen the tunnels; she also gives away that the Zaralok, the Vashta Nerada and the radiation all seemed to appear after a flash of light a short distance away from Poseidon only a few days ago. After getting back out into Poseidon, the Doctor finds the ingredients for the cure (simply numerous types of vegetation from the seabed) and heads back to Dana's lab. He manages to create the cure and heal Dana, who was starting to suffer from the radiation, but Oswald enters with a harpoon gun and threatens the Doctor to back off so that he and Dana can evacuate Poseidon. Oswald leaves with Dana, while the Doctor and Amy find Jones and use its scanners to identify the source of the light Dana mentioned. Jones' scanners pick up a shipwreck a short distance away; the Doctor identifies it as the USS Eldridge, a ship constructed by the USA during the WWII era. The Americans had attempted to give the ship cloaking technology and had asked Albert Einstein for help, but they accidentally opened a wormhole which the ship then jumped through into another world. After being there for centuries, the ship then jumped back through another wormhole and landed outside Poseidon, but the hole is still open and has allowed the creatures as well as the radiation to come through.
Jones helps the Doctor and Amy to get back to the TARDIS via a series of safety tunnels built beneath the main ones. They then travel to the Eldridge, seeking to close the wormhole. The Doctor believes that closing the gap will bring everything that came through back as well. The two make their way to the Accelerator room, which is at the heart of the gap. Amy makes her way to the top, followed by the Doctor, who survives a close encounter with the Vashta Nerada. After they reach the controls which can close the wormhole, the Zaralok, which is apparently aware of their intentions, attacks the Eldridge, and begins to smash its way into the Accelerator. Just before it reaches them, the Doctor finishes the process, and the Zaralok is dragged back through the wormhole along with the Vashta Nerada and the disease.
Back at Poseidon Eight, Oswald apologises for his earlier behaviour, saying how he only wished to protect his people. He then offers for the Doctor and Amy to join them for Christmas dinner, an offer they decide to run from when they find that the main course is a helping of Oswald's prize crop – 'Sea Pumpkin'.
The Gunpowder Plot
While leaving China after trying to get a take-away, the TARDIS collides with an alien ship, creating a dimensional lesion inside the ship that links the TARDIS to an alien planet. After the Doctor accidentally drops the sonic screwdriver into the rift and Rory recovers it, they trace the ship that they collided with and discover that it is under London in the seventeenth century. While the Doctor works on a device to close the lesions in the TARDIS, Amy and Rory explore the sewers where they have landed, and discover that they have arrived at the time of the Gunpowder Plot, where Rory is puzzled at the presence of 'Lady Winters', a mysterious woman in green, in the conspiracy. When Amy follows Lady Winters while Rory tries to return to the Doctor, she discovers that Lady Winters is actually a Rutan, but is only just saved from an attack when the Doctor opens a lesion to her location and drives the Rutan away.
While trying to return to the Doctor, Rory discovers a squad of Sontarans are also under London, searching for the crashed Rutan ship, but he is able to escape using a catapult to strike the Sontarans' probic vents. With the Doctor now aware that they are dealing with a crashed Rutan ship underneath Parliament, he infiltrates the Gunpowder Plot to monitor their progress while Amy and Rory track down the ship, discovering a control room with a strange spherical device and a slot where a second one should be, but a child who followed them down there steals the sphere. Confronting Lady Winters, the Doctor learns that the Rutan ship is damaged and requires the energy of the explosion to escape its position under Parliament unless missing control rods- indestructible components that were lost when the ship crashed- are recovered, and that the Rutan ship holds a doomsday weapon that could end the Sontaran/Rutan war.
Although Amy manages to find the missing components, the Doctor is only just able to save Parliament by using the lesions to teleport Parliament into space, although he and his companions are forced to search the Houses when they learn that both doomsday weapons are there. With Rory armed with a sound blaster that can disorient the Rutans, they manage to escape pursuit and find the weapons, which the Doctor realises are genetic bombs that could wipe out all of one race if activated. Reprogramming one, the Doctor randomly tosses both weapons to the Sontarans and the Rutans, noting that it is now impossible for either of them to set the weapons off as they have no way of knowing if their weapon will destroy their enemies or themselves. In the end, the Doctor, Amy and Rory leave Guy Fawkes trapped with the barrels of gunpowder and return to the future to watch Bonfire Night fireworks.
Continuity
City of the Daleks
Varga plants previously appeared in the First Doctor-era episode "Mission to the Unknown" and were created by Dalek creator Terry Nation.
One of the items needed is a Kontron Crystal, which appeared in the serial Timelash.
The Beatles previously appeared in The Chase as the First Doctor and his companions watched the band perform "Ticket to Ride" on the Time-Space Visualiser.
The Doctor mentions Cathy Gale, a character from the TV series The Avengers. Honor Blackman, who played the character, starred as Professor Lasky in the Sixth Doctor's story The Trial of a Time Lord and also Anahita in the Fifth Doctor audio drama The Children of Seth.
Blood of the Cybermen
Amy says the Cybermats are worse than spiders, to which the Doctor replies "Spiders? I'd rather we changed the subject." His fear of spiders is established in the Third Doctor's story Planet of the Spiders.
This story conflicts with the episode The Pandorica Opens, in which Amy does not know what Cybermen are. However, an unseen crack in time may have erased this event too.
TARDIS
Amy asks the Doctor to name one of his holidays which didn't end in a disaster and the Doctor recalls Brighton Beach. In the Fourth Doctor story The Leisure Hive K-9 exploded while visiting Brighton with the Doctor. The Doctor also mentions Paris, where he visits in City of Death.
The Laser Screwdriver which the Master used in "The Sound of Drums" / "Last of the Time Lords" is used by Amy to assemble the Tractor Beam.
Also inside the TARDIS study room are the following items: a Dalek eye stalk, the book of the Weeping Angels ("The Time of Angels"), the Second Doctor's recorder, the Chronon Blocker from "City of the Daleks", a map of medieval Venice ("The Vampires of Venice"), Liz Ten's facemask ("The Beast Below"), the fob watch and the Journal of Impossible Things from "Human Nature", a parallel universe Cyberman chestpiece, Rassilon's Time Lord staff ("The End of Time"), a Sycorax staff ("The Christmas Invasion"), a gramophone seen in the TV movie, a cricket ball that belonged to the Fifth Doctor, the sonic blaster used by Jack Harkness ("The Doctor Dances") and River Song ("Silence in the Library" / "Forest of the Dead"), an Ood translator, the Fourth Doctor's scarf and the distress beacon from "Blood of the Cybermen".
The TARDIS' drawing room was last seen in the 1996 telemovie. As then, it features a multitude of clocks and books.
Shadows of the Vashta Nerada
When The Eleventh Doctor and Amy are tied up with rope, they escape using the same trick Harry Houdini taught the Doctor that the Tenth Doctor used in animated serial Dreamland.
The Doctor previously fought the Vashta Nerada in the episodes "Silence in the Library" and "Forest of the Dead".
The Gunpowder Plot
The Rutans and the Rutan Host first appeared in the Fourth Doctor story The Horror of Fang Rock.
The novel The Plotters depicts the Doctor meeting Guy Fawkes in his first incarnation.
A few of the aliens who work for the Silence can be seen when wandering around London.
When in the TARDIS' drawing room, some additional features are present, including the Doctor's cot (As seen in A Good Man Goes to War).
Marketing
On 7 April 2010, the game was first announced on the official Doctor Who BBC website. It included a brief description of what was to come as well as 13 in-game pictures.
The first episode was scheduled to be available on 5 June, But a 'not quite final' version was available 3 days early. The Mac version was released on 15 June.
On 17 June, Simon Nelson, controller of portfolio and multiplatform at BBC Vision told games magazine MCV that the number of downloads of the first episode had already exceeded half a million. "The result is a lot more than I was expecting, We had set ourselves some fairly stretched targets on this and we’ve blown them away", he says.
To promote the second episode "Blood of the Cybermen", Steven Moffat and Nicholas Briggs went to Gavinburn Primary School in Scotland and to the Pacific Quay in Glasgow.
To coincide with the airing of "The Big Bang" in the US on 24 July on BBC America and Space, the Windows versions of the first two episodes were made available to purchase outside the UK via Direct2Drive.; the Mac OS versions of the games, however, were never made available for sale; although it was announced that the remaining games likewise would be made available for sale, as of mid-2014 this has yet to happen.
On 20 September 2010, a second series was commissioned for 2011. BBC’s head of multiplatform in vision Simon Nelson says "Given the success of the first series, we'd be daft not to recomission. But it's not just about the numbers; the feedback we've had has been overwhelmingly positive."
References
External links
Announcement at the Doctor Who news page
http://www.develop-online.net/news/34416/BBC-signs-Cecil-and-Sumo-for-Doctor-Who-game
Category:2010 video games
Category:Adventure games
Category:Cybermen stories
Category:Dalek stories
Adventure Games, The
Category:Eleventh Doctor stories
Category:Episodic video games
Category:Lua-scripted video games
Category:Mac OS games
Category:Windows games
Category:Video games developed in the United Kingdom
Category:Sumo Digital games | 2024-07-14T01:26:29.851802 | https://example.com/article/4082 |
/*
* Copyright (c) 1997, 2018 Oracle and/or its affiliates. All rights reserved.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v. 2.0, which is available at
* http://www.eclipse.org/legal/epl-2.0.
*
* This Source Code may also be made available under the following Secondary
* Licenses when the conditions for such availability set forth in the
* Eclipse Public License v. 2.0 are satisfied: GNU General Public License,
* version 2 with the GNU Classpath Exception, which is available at
* https://www.gnu.org/software/classpath/license.html.
*
* SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
*/
import java.io.*;
import java.net.*;
import com.sun.ejte.ccl.reporter.*;
/*
* Unit test for 6347215 ("AS81 to support client-ip from loadbalancer as in
* AS71 using AuthPassThroughEnabled"):
*
* This test sets the HTTP listener's authPassthroughEnabled property to TRUE,
* includes a 'Proxy-ip' header in the request, and expects that the address
* returned by ServletRequest.getRemoteAddr() match the value of the
* 'Proxy-ip' header.
*/
public class WebTest {
private static SimpleReporterAdapter stat
= new SimpleReporterAdapter("appserv-tests");
private static final String EXPECTED_RESPONSE =
"RemoteAddress=123.456.789";
private static final String TEST_NAME =
"auth-passthrough-get-remote-address";
private String host;
private String port;
private String contextRoot;
private Socket sock = null;
public WebTest(String[] args) {
host = args[0];
port = args[1];
contextRoot = args[2];
}
public static void main(String[] args) {
stat.addDescription("Unit test for 6347215");
WebTest test = new WebTest(args);
try {
test.doTest();
stat.addStatus(TEST_NAME, stat.PASS);
} catch (Exception ex) {
System.out.println(TEST_NAME + " test failed");
stat.addStatus(TEST_NAME, stat.FAIL);
ex.printStackTrace();
} finally {
try {
if (test.sock != null) {
test.sock.close();
}
} catch (IOException ioe) {
// ignore
}
}
stat.printSummary(TEST_NAME);
}
private void doTest() throws Exception {
sock = new Socket(host, new Integer(port).intValue());
OutputStream os = sock.getOutputStream();
String get = "GET " + contextRoot + "/jsp/remoteAddress.jsp "
+ "HTTP/1.0\n";
System.out.println(get);
os.write(get.getBytes());
os.write("Proxy-ip: 123.456.789\n".getBytes());
os.write("\n".getBytes());
InputStream is = null;
BufferedReader bis = null;
String line = null;
String lastLine = null;
try {
is = sock.getInputStream();
bis = new BufferedReader(new InputStreamReader(is));
while ((line = bis.readLine()) != null) {
lastLine = line;
}
} finally {
try {
if (is != null) {
is.close();
}
} catch (IOException ioe) {
// ignore
}
try {
if (bis != null) {
bis.close();
}
} catch (IOException ioe) {
// ignore
}
}
if (!EXPECTED_RESPONSE.equals(lastLine)) {
throw new Exception("Wrong response. " + "Expected: " +
EXPECTED_RESPONSE + ", received: " +
lastLine);
}
}
}
| 2024-06-01T01:26:29.851802 | https://example.com/article/1085 |
version: "3.7"
services:
cron-generate-daily-rss-dumps:
image: dockermediacloud/cron-generate-daily-rss-dumps:latest
init: true
stop_signal: SIGKILL
volumes:
- type: bind
source: ./bin/
target: /opt/mediacloud/bin/
- type: bind
source: ./../cron-base/bin/cron.sh
target: /cron.sh
- type: bind
source: ./../common/src/
target: /opt/mediacloud/src/common/
depends_on:
- postgresql-pgbouncer
postgresql-pgbouncer:
image: dockermediacloud/postgresql-pgbouncer:latest
init: true
stop_signal: SIGKILL
expose:
- 6432
volumes:
- type: bind
source: ./../postgresql-pgbouncer/conf/
target: /etc/pgbouncer/
depends_on:
- postgresql-server
postgresql-server:
image: dockermediacloud/postgresql-server:latest
init: true
stop_signal: SIGKILL
expose:
- 5432
volumes:
- type: bind
source: ./../postgresql-server/bin/
target: /opt/mediacloud/bin/
- type: bind
source: ./../postgresql-server/schema/
target: /opt/mediacloud/schema/
- type: bind
source: ./../postgresql-server/conf/
target: /etc/postgresql/11/main/
| 2024-01-24T01:26:29.851802 | https://example.com/article/3044 |
Conventionally, there have been various image processing methods for the image data which are captured by an imaging device such as digital camera. For example, Patent Documents 1 and 2 described below propose image processing methods in which image data are separated into a luminance component and a color component, then pixel values of multi-resolution image data, which are generated based on the luminance component image data, are manipulated and then reconstructed, and color composition is done with the color component image data.
According to such image processing methods, it is possible to improve problems of a lack of intelligibility and a lack of a sense of unevenness. Here, the image data having lacked intelligibility refers to the image data which give a hazy or foggy impression when compared with the impression recognized when a human actually sees. Further, the image data having lacked sense of unevenness refers to the image data which give a planer impression such that a sense of rampant trees or a sense of jagged rocks in an actual scene fades away. | 2024-04-29T01:26:29.851802 | https://example.com/article/5092 |
### 新增Gradle Transform
监听文件编译结束，通过javasist实现字节码修改,实现代码插入,通过这种插件化的AOP 和代码中使用Aspectj 区别就是，避免代码碎片化，添加一个功能修改多处代码，即使用了Aspectj 也许要在修改的地方添加注解，当修改处很多的时候很不方便，通过transform和javassist 可以遍历整个工程，按照满足条件的一次性修改，并且以后我们可以写成通用性的组建，比如自动注册一些组建在所有Activity，里面Javassist用了反射原理，但是这是编译器，不损失效率,Javassist非常强大，需要仔细学习
1.新建一个MyTransform 再新建一个插件MyPlugin注册这个Transform
Mytransform 重写transform方法
里面要将输入内容复制给输出，否者报错，这是第一步，其实就是相当于在运行我们给拦截了，必须再把内容输出出去才能打包成dex
里面遍历
// Transform的inputs有两种类型，一种是目录，一种是jar包，要分开遍历
inputs.each { TransformInput input ->
//对类型为“文件夹”的input进行遍历
input.directoryInputs.each { DirectoryInput directoryInput ->
//文件夹里面包含的是我们手写的类以及R.class、BuildConfig.class以及R$XXX.class等
/**
* 这里就统一处理一些逻辑，避免代码分散，碎片化
*/
println("transform transformsalkfjdl;kajf#####################*********")
println(directoryInput.file.absolutePath)
MyInject.injectDir(directoryInput.file.absolutePath,"com\\wangpos\\test",project)
// 获取output目录
def dest = outputProvider.getContentLocation(directoryInput.name,
directoryInput.contentTypes, directoryInput.scopes,
Format.DIRECTORY)
// 将input的目录复制到output指定目录
FileUtils.copyDirectory(directoryInput.file, dest)
}
//对类型为jar文件的input进行遍历
input.jarInputs.each { JarInput jarInput ->
//jar文件一般是第三方依赖库jar文件
// 重命名输出文件（同目录copyFile会冲突）
def jarName = jarInput.name
def md5Name = DigestUtils.md5Hex(jarInput.file.getAbsolutePath())
if (jarName.endsWith(".jar")) {
jarName = jarName.substring(0, jarName.length() - 4)
}
//生成输出路径
def dest = outputProvider.getContentLocation(jarName + md5Name,
jarInput.contentTypes, jarInput.scopes, Format.JAR)
//将输入内容复制到输出
FileUtils.copyFile(jarInput.file, dest)
}
} | 2023-10-15T01:26:29.851802 | https://example.com/article/4068 |
A thorough introduction to the cultivation of psychedelic mushrooms. Journey from one end of the mushroom life cycle to the other by the simplest and most direct route. Mycologists Nicholas and Ogame update and improve classic methods for germinating and growing the popular indoor species Psilocybe cubensis. They also explain how to grow Psilocybes outdoors using species that fruit on wood chips. the extensive color section lets you watch the mushrooms grow with photographs that meticulously record the processes. Each featured species is pictured to assist with identification.
Find essential information on:
The supplies you need, and where to get them
Mushroom biology and life cycles
"Sterile culture technique" practices
Updated PF Tek (Psilocybe Fanaticus technique) methods
Starting and growing on agar, grain, and wood chips
Making spore syringes and spore prints
Harvest and storage tips
Guidelines for preparation and use
With their straightforward instructions and proven techniques, you will be well on your way to a thriving garden of these beautiful, fascinating, and extraordinary organisms. | 2024-02-20T01:26:29.851802 | https://example.com/article/7670 |
Here’s Michelle Dockery (or Lady Mary, as she’s known to most) at the premiere of her latest flick, the action thriller Non-Stop. She’s paired a beautiful Christian Dior lurex dress from the Spring 2014 collection with what we’re going to call the Christian Louboutin PVC d’Orsay Pumps and a delightful Edie Parker Jean Confetti Box Clutch. These multi-tone PVC pumps are not available in stores just yet, but in the meantime, you can shop an extensive selection of Louboutins for every occasion at Saks. You can also find an Edie Parker clutch much like Michelle’s for $895 at Barneys.
As Downton Abbey fans already know, the show just wrapped up its fourth season here in the US on PBS. (No spoilers, please! I’m two episodes behind.) The US run of Downton is delayed by several months, and the cast has already begun filming the fifth season, as of two weeks ago. (Huzzah!) Michelle also has another film in development, a sci-fi thriller with Ryan Reynolds and Matthew Goode called Selfless, which will be out in 2015. | 2024-04-05T01:26:29.851802 | https://example.com/article/8909 |
Q:
How to see if there are any matching characters in a string?
I'm making a card hand generator, and I want it to note if a specific hand is generated, like a three of a kind or a full house. I was trying to figure out how to do it, and I thought of using grep on the strings, but I realized I would have to make a LOT of lines and it would be overly repetitive. There is a file that holds the last generated string called out.txt.
This is an output from the script:
io@conroe$ ./card 5
♦ 6 ♦ Q ♠Q ♥J ♣3
I would want something like this:
io@conroe$ ./card 5
♦ 6 ♦ Q ♠Q ♥J ♣3
PAIR - QUEENS
The code is simple to me, but I'm still trying to wrap my head around how to do this part.
(Now, what would be really cool is if I could find a set of small pixel card graphics and use them in place of the text.)
Code:
#!/bin/bash
cat /dev/null > out.txt
z=$( < out.txt)
for (( y=1; y<=$1; y++ ))
do
< /dev/urandom LC_CTYPE=C tr -dc HDCS | head -c 1 | while read -n 1 s
do
case $s in
D)
printf ' \e[0;31;47m ♦ '
;;
H)
printf ' \e[0;31;47m ♥'
;;
S)
printf ' \e[0;30;47m ♠'
;;
C)
printf ' \e[0;31;47m ♣'
;;
esac
done
< /dev/urandom LC_CTYPE=C tr -dc "1""2""3""4""5""6""7""8""9""10""J""Q""K""A" | head -c 1 | while read -n 1 n
do
if [ $n = "0" ]
then
echo -n '10 '
echo -n '10 ' >> out.txt
else
echo -n "$n "
echo -n "$n " >> out.txt
fi
done
printf '\e[0m'
done
printf "\n"
EDIT: By the way, the strings in out.txt look like this:
6 Q Q J 3
A:
printf '%s\n' {♠,♣,♢,♡}$'\t'{{2..10},J,K,Q,A} | shuf -n5 |
gawk 'BEGIN{ split(",Twos,Threes,Fours,Fives,Sixes,Sevens,Eights,Nines,Tens",vt,","); vt["J"]="Jacks"; vt["Q"]="Queens"; vt["K"]="Kings"; vt["A"]="Aces"; } # values-text
{ c[$2]++; printf("%s %s", $1, $2(NR==5?"\n":"\t")) }
END{ for(i in c){
if( c[i]==2 ){ print "PAIR: " vt[i]; cp++ }
if( c[i]==3 ){ print "THREE: " vt[i]; ct++ }
if( c[i]==4 ){ print "FOUR: " vt[i] } }
if( cp==2 ) { print "TWO PAIRS" }
if( cp&&ct ) { print "FULL HOUSE" } }'
Example output:
♡ Q ♣ A ♢ A ♢ Q ♡ 2
PAIR: Aces
PAIR: Queens
TWO PAIRS
Here is the same thing done entirely by awk, except for the method of seeding awk's rand(), by using bash's $RANDOM passed to awk via the -v option. The output is identical to the above.
gawk -v seed=$RANDOM '
BEGIN{srand(seed)
split("♠♣♢♡",s,"") # suit: 1-4
split("A,2,3,4,5,6,7,8,9,10,J,Q,K",v,",") # values: 1-13
split(",Twos,Threes,Fours,Fives,Sixes,Sevens,Eights,Nines,Tens",vt,","); vt["A"]="Aces"; vt["J"]="Jacks"; vt["Q"]="Queens"; vt["K"]="Kings"; # values-text
for(es in s){ for(ev in v){ sv[i++]=s[es]" "v[ev] }}; # 0-51
imax=4; for(i=0;i<=imax;i++){ # pick 5 cards at random from array `v`
rix=int(rand()*(52-i))+i # ranges from 0-51 to 4-51, as per `i`
tmp=sv[i]; sv[i]=sv[rix]; sv[rix]=tmp # swap ramdom value to front of array, as per `i`
split(sv[i],fv," "); c[fv[2]]++ # increment face-value counts
printf("%s", sv[i](i==imax?"\n":"\t")) # print the full hand in incremets
}
for(i in c){
if( c[i]==2 ){ print "PAIR: " vt[i]; cp++ }
if( c[i]==3 ){ print "THREE: " vt[i]; ct++ }
if( c[i]==4 ){ print "FOUR: " vt[i] } }
if( cp==2 ) { print "TWO PAIRS" }
if( cp&&ct ) { print "FULL HOUSE" }}'
| 2023-09-20T01:26:29.851802 | https://example.com/article/4105 |
The expression of bovine microsomal cytochrome b5 in Escherichia coli and a study of the solution structure and stability of variant proteins.
The DNA sequence of bovine microsomal cytochrome b5 has been amplified from a liver cDNA library using a polymerase chain reaction. The amplified cDNA when cloned into plasmids that support the high-level production of cytochrome b5 in E.coli leads to protein overexpression and results in cell colonies bearing a strong red colouration. Using cassette mutagenesis, truncated versions of the cytochrome b5 cDNA have been made that encode the first 90 amino acid residues (Ala1-Lys90), the first 104 amino acids (Ala1-Ser104) and the complete protein (Ala1-Asn133). The location of the overexpressed cytochrome b5 within prokaryotic cells is dependent on the overall length of the protein. Expression of the Ala-Lys90 and Ala1-Ser104 variants leads to a location in the cytoplasmic phase of the bacteria whereas the whole protein, Ala1-Asn133, is found within the bacterial membrane fraction. The last 30 residues of cytochrome b5 therefore contain all of the necessary information to insert the protein into E.coli membranes. The solubility of the Ala1-Ser104 variant permits the solution structure and stability of this protein to be measured using 1- and 2-D 1H-NMR methods and electronic spectroscopy. 1-D NMR studies show that the chemical shifts of the haem and haem ligand resonances of the Ala1-Ser104 variant exhibit only very slight perturbations to their magnetic microenvironments when compared with the tryptic fragment of ferricytochrome b5. These results indicate an arrangement of residues in the haem pocket that is very similar in both the Ala1-Ser104 variant and the tryptic fragment and by 2-D NMR it is shown that this similarity extends to the conformations of the polypeptide backbone and side chains. Electronic spectroscopy of this variant shows absorbance maxima for the Soret peaks at 423 nm (reduced) and 413 nm (oxidized). From absorbance spectra the relative thermal stabilities of the Ala1-Ser104 variant and the tryptic fragment were measured. In the oxidized state the Ala1-Ser104 variant denatures in a single cooperative transition with a midpoint temperature (Tm) of 73 degrees C that is significantly higher than that of 'tryptic' ferricytochrome b5. The reduced form of the protein shows increased transition temperatures (Tm approximately 78 degrees C) reflected in the values of delta Hm, delta Sm and delta(delta G) of 420 kJ/mol, 1096 J/mol/K and 12.38 kJ/mol respectively, estimated for this variant. The increased stability of the Ala1-Ser104 variant and other recombinant forms of cytochrome b5 is correlated with the presence of additional residues at the N- and C-termini.(ABSTRACT TRUNCATED AT 400 WORDS) | 2024-06-03T01:26:29.851802 | https://example.com/article/6062 |
Specifications TableSubjectArtificial Intelligence, Natural Language Processing (NLP), Machine LearningSpecific subject areaDepressive post detection, depressive account detection, suicidal post detection, depressive content detectionType of dataTable\
Excel fileHow data were acquiredData were collected from public accounts in social networks by using keywords and classified by psychologists into depressive and non-depressive categories.\
Instruments: software, program\
Model and make of the instruments used: classification into several categories by expertsData formatRaw, AnalyzedParameters for data collectionFor data collection, a bot in Python was created that collects posts from social media public accounts by keywords that refer to depressive behaviour. List of keywords for data collection: suicide, I don\'t want to live, life is shit, I want to die, etc.Description of data collectionThe collected data were divided into two parts as depressive posts with label 1, and non-depressive posts with label 0Data source locationAzerbaijan, Armenia, Belarus, Kazakhstan, Kyrgyzstan, Moldova, Russian Federation, Tajikistan, Ukraine, UzbekistanData accessibilityWith the article\
In a public repository:\
Repository name: <https://data.mendeley.com/datasets/838dbcjpxb/1>\
Data identification number: [https://doi.org/10.17632/838dbcjpxb.1](10.17632/838dbcjpxb.1){#intref0015}\
Direct URL to data: <https://data.mendeley.com/datasets/838dbcjpxb/1/files/c88e7ab7-3dba-4a1b-8c83-6b78b8adb2a5/Depressive%20data.xlsx?dl=1>**Value of the Data**•This dataset can be useful for researchers in the machine learning field to train neural networks in order to detect depressive and suicidal accounts in social networks.•The dataset can be useful for data scientists who do research in social, psychological and health informatics area as an analysed data•The dataset can be used to train and evaluate computational models and techniques for automation or to help experts identify depressive accounts to reduce suicides;•These data were collected from Vkontakte social networks, then analysed and filtered, that can be used by other researchers as a benchmark dataset in machine learning, and deep learning fields.
1. Data {#sec1}
=======
We have sourced 64 039 posts in Russian language that contain depression-related keywords. About half of them (32 021 posts) are labelled as 0 which we would refer to as neutral posts, the other part (32 018 posts), which is labelled as 1, consists of depression-related posts.
Since the data on people who committed suicide is private, we collected depressive posts of social network users. We collected around 32 018 depressive posts and 32 021 usual posts such as news, blogs, advertisements, and etc.
In [Table 1](#tbl1){ref-type="table"}, we provide examples of depressive posts by indicating the age of authors.Table 1Samples of depressive posts.Table 1textlabelage0Когда-то я был добрым романтиком, который стре\...132.01Здрастϑуйте! Я каждый день просыпаюсь с мыслью\...128.02У меня проблемы с деϑу♯кой. Каждую ссору я не \...116.03Вся моя жизнь это один спло♯ной ад, ϑ котором \...132.04Я хочу уснуть и не проснуться.каждый день одно\...114.0
[Fig. 1](#fig1){ref-type="fig"} illustrates the text length distribution of posts. It can be noticed that depressive related posts are distributed according to the law of exponential distribution, which means many texts are of short length.Fig. 1Text length distribution of posts.Fig. 1
[Fig. 2](#fig2){ref-type="fig"} shows distribution of depressive and neutral posts in the dataset. Red line indicates depressive posts, Blue line indicates non-depressive posts.Fig. 2Distribution of posts lengths by labels.Fig. 2
In [Fig. 3](#fig3){ref-type="fig"}, we explore the data around the stop words as the stop words can significantly influence the meaning of the sentence. [Fig. 3](#fig3){ref-type="fig"}a and b illustrate the distribution of top 20 unigrams, taking into account the stop words, without considering the stop words, respectively. [Fig. 3](#fig3){ref-type="fig"}c and d demonstrate the distribution of bigrams with and without application of stop words, correspondingly.Fig. 3Distribution of top unigrams and bigrams.Fig. 3
[Fig. 4](#fig4){ref-type="fig"} illustrates the age distribution of authors of depressive posts. The distribution spreads by the normal distribution with offset to the left side, which implies that people that are most prone to depression are teenagers and youth under 30 years.Fig. 4Age distribution.Fig. 4
[Fig. 5](#fig5){ref-type="fig"} explores the depressive related data around the stop words. [Fig. 5](#fig5){ref-type="fig"}a and b illustrate the distribution of top 20 unigrams in the depressive posts, with and without taking into account the stop words, respectively. [Fig. 5](#fig5){ref-type="fig"}c and d display the distribution of bigrams in the depressive posts, with and without using the stop words, appropriately.Fig. 5Distribution of top unigrams and bigrams taking into account only depressive posts.Fig. 5
The given dataset can be useful to train a neural network in order to detect depressive related accounts in social media or other online resources.
2. Experimental design, materials, and methods {#sec2}
==============================================
Before attributing information to suicidal or depressive, it is necessary to define the criteria of "danger". One of the solutions is the definition of a set of keywords. It is this method of determining the types of information that was applied in the developed software package. For the definition a set of keywords was compiled, which was used to analyse information on the social network VKontakte \[[@bib1]\]. The software package based on the presence or absence of the specified keywords in the text concludes that the text is suitable for further research. [Fig. 6](#fig6){ref-type="fig"} illustrates the entire scheme of data acquisition, analysis and classification of posts.Fig. 6Scheme of data acquisition, analysis and classification of posts.Fig. 6
The implementation of obtaining information may vary depending on the source of information, but maintain the general principle of its construction. The main purpose of the part of the software responsible for obtaining information from open sources is to perform actions quickly and efficiently. To achieve maximum performance, you must use the built-in methods for obtaining information from sources (API), if any. If there are no such methods, then it is necessary to obtain and extract the necessary information from HTTP requests.
There are three separate modules of the software package:1.Information collection module - is responsible for receiving information from open sources and transmitting it for further processing; A large Python framework was built to parse data from VK social network. We used official VK API and partially parsed Kazakhstan profiles and stored data in Solr database;2.Keyword search module - is responsible for finding keywords in a large amount of information; Since we already had a list of keywords that are often found in depressive posts, we implemented a linear search for words in each post, splitting it into tokens. Keywords for searching for potentially dangerous posts were prepared and validated by specialists from the republican scientific and practical centre of mental health;3.Document ranking module - is responsible for determining whether the information is dangerous. To rank documents by the degree of danger were used word2vec vectorizer and deep learning algorithms such as Long Short Term Memory (LSTM) and Bidirectional Long Short Term Memory (BiLSTM).
The official documentation page of The Vkontakte social network contains basic information about the principles of the Vkontakte API \[[@bib2]\]. API (application programming interface) is an intermediary between the application developer and the specific environment with which the application should interact. The API process simplifies code creation by providing a set of predefined classes, functions, or structures to work with existing data.
API "Vkontakte" is a ready-made interface that allows you to retrieve the necessary information from the database of the social network using https-requests to the server. The developer does not need to know how the database works in full details, and what tables it is made of -- it is enough that the API request contains all the necessary data to access the server. The required query syntax and the type of data returned are defined on the service side.
[Table 2](#tbl2){ref-type="table"} lists the components of a simple users query.get which as a request url looks like this '<https://api.vk.com/method/users.get?user_id=210700286&v=5.92>'Table 2Query component.Table 2ComponentValuehttps://Connection protocol.api.vk.com/methodAPI service address.User.getName of the API Vkontakte method.?user_id=210700286&v=5.92Query parameter.
Methods are conditional commands that correspond to a specific database operation. For example, users.get is the method to get users\' information, account.getinfo returns information about the current user, etc.
All methods in the system are divided into sections. In the transmitted request you must pass the input data as GET parameters in the HTTP request after the method name. If the request is successfully processed, the server returns a JSON object with the requested data. The response structure for each method is strictly defined. The rules are specified on the pages describing the method in the official documentation.
In order to analyze the data, Python 3.7 programming language was applied with pandas, numpy, matplotlib, plotly, bokeh, cufflinks, spacy, googletrans packages as main libraries for calculation and visualization. Full description of programming code were given in Google Colaboratory \[[@bib3]\] notebook by the <https://colab.research.google.com/drive/1VSW3ofj8D6NEYziYazDcnSIIzAmw9mnA> address \[[@bib4]\]. Google Colaboratory required users to use google account for better exposition of graphs and figures.
Conflict of Interest {#appsec1}
====================
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Appendix A. Supplementary data {#appsec2}
==============================
The following is the Supplementary data to this article:Multimedia component 1Multimedia component 1
This research was supported by grant of the program of Ministry of Education of the Republic of Kazakhstan BR05236699 "Development of a digital adaptive educational environment using Big Data analytics". We thank our colleagues from Suleyman Demirel University (Kazakhstan) who provided insight and expertise that greatly assisted the research. We express our hopes that they will agree with the conclusions and findings of this paper.
Supplementary data to this article can be found online at <https://doi.org/10.1016/j.dib.2020.105195>.
| 2023-12-19T01:26:29.851802 | https://example.com/article/8097 |
Background {#Sec1}
==========
Recently, Aβ imaging with ^18^F labeled radiotracers has been widely used for patients with Alzheimer's disease (AD). ^18^F-flutemetamol is ^18^F labeled analogue of ^11^C-PiB produced by GE Healthcare (Buckinghamshire, UK) \[[@CR2]\]. It has been useful in differentiating between patients with AD and healthy subjects with high specificity (96%) and sensitivity (93%) in the detection of AD, as well as high test--retest reliability \[[@CR3], [@CR4]\]. ^18^F-florbetaben is an ^18^F labeled polyethylene glycol stilbene derivative showing high in vitro affinity and specificity for β-amyloid plaques \[[@CR3]\].
^18^F-florbetaben and ^18^F-flutemetamol are widely used for the diagnosis and monitoring of AD in a routine medical field. However, there are many unknown issues regarding the difference in tracer dynamics and biodistribution between ^18^F-flutemetamol and ^18^F-florbetaben. Because of the difficulty conducting the direct comparison between two tracers for humans due to the weighted exposure to radiation, a preclinical animal study is a good alternative option for a baseline study.
Recently, several imaging studies using newly developed ^18^F labeled Aβ PET tracers were reported in AD mouse models. In a previous study, the in vivo ^18^F-flutemetamol binding of Aβ deposits was tested in various AD mouse models \[[@CR5]\]. In old APP23 mice, significant ^18^F-flutemetamol retention was observed in the brain. But, ^18^F-flutemetabmol did not show a outstanding advantage in APPswe-PS1dE9 and Tg2576 mice.
However, transgenic mice with various genetic backgrounds have been related with different pathologies, which make it difficult to interpret the overlapping study results \[[@CR6]\]. Therefore, comparisons between β-amyloid imaging regarding AD mouse have to be accomplished with some caution as brain sizes and anatomic landmarks of target VOIs greatly affect accurate PET signal quantification. Until now, there has been no antecedent report comparing between ^18^F-flutemetamol and ^18^F-florbetaben images in an AD mouse model, so comparative conclusions draw special interest.
Herein, we tested a recently developed APPsw mouse model (C57BL/6-Tg(NSE-hAPPsw)Korl) enhancing expressing Swedish double mutation form of human APP (K670 N, M671L) under regulation of the neuron specific enolase (NSE) promoter. For this mouse model, there has been no attempt regarding its application for the evaluation of new Aβ imaging ligands. Hence, we performed a small animal study conducting direct comparisons between two ^18^F labeled Aβ PET tracers, ^18^F-flutemetamol and ^18^F-florbetaben in (C57BL/6-Tg(NSE-hAPPsw)Korl) mouse model in terms of following aspects: the ability to discriminate a transgenic from a control mouse, intensity of uptake and distribution pattern in visual images, difference of static ratio and kinetic parameters, bio-distribution and correlation with neuropathologic findings.
Methods {#Sec2}
=======
Animals {#Sec3}
-------
Experiments were conducted with 7 APPsw transgenic mice (genetic background C57BL/6-Tg(NSE-hAPPsw)Korl) augmenting human APP with the Swedish double mutation (K670N, M671L) under regulation of the NSE promoter. As controls, 7 littermates with the corresponding genetic background, C57BL/6J, were used. Age and sex were matched between the two groups (mean age and mean weight: 18 weeks and 24.84 ± 1.01 g for APPsw mice and 18 weeks and 29.20 ± 3.49 g for C57BL/6 J control mice). The mice used in the study were donated from the Division of Laboratory Animal Resources, Korea FDA (Food and Drug safety administration, National Institute of Toxicological Research, registration number: KNL-HYD-TG0615). Details on number of animals per study group, sex, mean age and mean body weight are summarized in Table [1](#Tab1){ref-type="table"}. Two mice from each AD and control group were sacrificed for pathology at 18 weeks and correlated with imaging. The remaining mice were sacrificed for pathology at 48 weeks. Animal experiments were conducted with the approval of the institutional animal care committee (IRB number: LML 16-970, Dong-A university, Busan, Korea).Table 1Basic characteristics of AD transgenic and control mouse modelIDAD transgenicControlAge (weeks)SexWeight (g)Age (weeks)SexWeight (g)118Male23.4118Male27.20218Male26.3418Male27.68318Male25.1218Male31.32418Male24.1618Male26.27518Male24.1218Male36.26618Male25.6818Male27.74718Male25.1118Male27.99Mean ± SD18Male24.84 ± 4.818Male29.20 ± 3.4
PET/CT imaging {#Sec4}
--------------
Seven transgenic and 7 control mice underwent sequential PET imaging for direct comparison of the two tracers (total 28 scans). The time interval between ^18^F-florbetaben and ^18^F-flutemetamol PET imaging was 2--3 days. Inhalation anesthesia was maintained by 3.5 L/min oxygen and 0.6--2% isoflurane, 15 min prior to scanning. The body temperature was kept at 37 °C with a temperature-controlled heating pad, and the respiratory rate stayed at 80--100/min. Small animal PET data was acquired with a nanoscan PET scanner (Mediso Medical Imaging Systems, USA). After the induction of anesthesia, the animals were positioned with their heads in the center of the field of view and were fixed in the PET scanner in the prone head first position (HFP). At the beginning of the PET scanning procedure, computed tomography (CT) scans were acquired for attenuation correction and anatomical reference (50 kVp, 250 mA). Next, simultaneous with an i.v. injection of 8.51 MBq (0.23 mCi) of ^18^F-flutemetamol or ^18^F-florbetaben, a 90-min dynamic emission scan was started. Dynamic acquisition was performed in the 3D list mode for 90 min. The emission data were normalized and corrected for decay and dead time. The sinograms were reconstructed with FBP (filtered back-projection using a ramp filter with a cut-off at the Nyquist frequency). Static images and dynamic images with 20 imaging frames were generated.
Radiosynthesis {#Sec5}
--------------
The radiosynthesis of ^18^F-florbetaben (4-ethoxy)phenyl\]vinyl}-N-methylaniline, commercial name: Neuraceq) was performed using an auto-synthesizer according to the protocol of Piramal Enterprises Ltd. The radiochemical purity was \> 99%, as determined by analytical HPLC. The radiochemical yield averaged 45% (decay-corrected) at the end of synthesis (EOS) based on ^18^F-fluorine. The specific activity averaged 774 GBq/umol at the EOS. The commercial products were purchased from the company (Duchem Bio, South Korea). The radiosynthesis of ^18^F-flutemetamol (6-Benzothiazolol, 2-\[3-(^18^F) fluoro-4-(methylamino) phenyl\], commercial name: Visamyl) was performed to using an auto-synthesizer according to the protocol of GE Healthcare. The radiochemical purity was \> 96% as determined by analytical HPLC. The radiochemical yield averaged 27% (decay-corrected) at the end of synthesis (EOS) based on ^18^F-fluorine. The specific activity averaged 1862 GBq/umol at the EOS. The commercial products were purchased from the company (Carecamp Co., Ltd., South Korea).
Analysis of PET data {#Sec6}
--------------------
PET data was analyzed with the fusion toolbox embedded in PMOD version 3.7.0 software (PMOD Technologies, Zurich, Switzerland). The CT image was thresholded at 2/3 of the maximal value (approximately 1340 Hounsfield units), and the skull image was obtained. For the shape of an atlas to properly fit with the skull CT, the thresholded CT image was manually fused with the magnetic resonance brain template, called M.Mirrione. Then, the transformation information was saved in a MAT-file format. Using the Initialize/Match function of the fusion toolbox, the PET image was re-sliced to match M.Mirrione template \[[@CR7]\]. Then, the transformation information between the thresholded CT and the mouse magnetic resonance template was loaded on re-sliced PET image. Then, the re-sliced PET image was co-registered manually using the shift, rotate and scale functions and normalized to the mouse MR brain template (M. Mirrione) \[[@CR7], [@CR8]\]. The final co-registered PET image was masked with the M. Mirrione brain mask. The corresponding template and mask files can be found in the resources/usertemplates directory embedded in PMOD version 3.7.0 software (Pmod Technologies, Zurich, Switzerland). The same step was applied to all frames of dynamic data.
Volumes of interest (VOIs) of embedded mouse brains are presented in Fig. [1](#Fig1){ref-type="fig"}. The areas of the VOIs are the cortex (Cor), right hippocampus (Rhip), left hippocampus (Lhip), thalamus (Thal), right striatum (Rstr), left striatum (Lstr) and the cerebellum (Crbl). To investigate the difference between ^18^F-florbetaben and ^18^F-flutemetamol images, different images using the image algebra option embedded in PMOD fusion tool (version 3.7.0; Pmod Technologies, Zurich, Switzerland) were created. For the analysis of static PET image, the standardized uptake value (SUV) and the standardized uptake value ratio (SUVR) between the cortex and cerebellum was calculated with a VOI based method.Fig. 1**a** Volume of interest (VOI) of mouse brain. VOI was drawn under guidance of the PMOD embedded mouse brain atlas (Mouse (M. Mirrione)-T2 MRI atlas) to cover the cortex (Cor: blue), right hippocampus (Rhip: dark green), left hippocampus (Lhip: dark green), thalamus (Thal: light green), right striatum (Rstr: red), left striatum (Lstr: red) and the cerebellum (Crbl: yellow), **b** volume of interest in blood input area, **c** time activity curve of blood input area
To determine the optimal compartment model for amyloid specific tracers, the 2 tissue compartment model from previous studies was used \[[@CR9]--[@CR11]\]. For the 2 tissue compartment model analysis with the Image Derived Input Function (IDIF) method, 1 mm^3^ volumes of interest (VOIs) were drawn on the center of the left ventricle on the initial time frame image.
Pathology {#Sec7}
---------
### Sample preparation {#Sec8}
The animals were deeply anesthetized with zoletil and xylazine and were sacrificed by intra-cardiac perfusion with 4% paraformaldehyde (pH 7.4). The brains were embedded in paraffin wax for 48 h. The tissue samples were serially sectioned at a thickness of 10 µm on a rotary microtome for immuno-histochemical analysis.
### Thioflavin S staining {#Sec9}
The sections were deparaffinated and rehydrated before staining. The sections were incubated in a 1% (1 g per 100 ml water) thioflavin S (TfS, T1892, Sigma Aldrich, St. Louis, MI, USA) solution for 30 min. The sections were washed with water three times for 2 min, 80% ethanol for 6 min, washed again with water and cover slip mounted with VectaShield as the mounting medium. The slides were stored for 4 °C. The sections were washed with water three times for 2 min and with 80% ethanol for fluorescence microscopy using filter sets for DAPI and GFP. The DAPI (contained in the mounting medium) fluorescence was used by the scanner to set the optical focus, and the GFP contained the specific signal of thioflavin S.
### Immunohistochemistry for amyloid beta 40 {#Sec10}
Non-specific reactions were blocked with 3% fetal bovine serum in phosphate buffered saline (PBS) for 1 h. Slides were incubated with mouse monoclonal primary amyloid beta 40 antibody (diluted 1:150; Millipore, USA). The secondary antibody was Streptavidin Alexa fluor 594 conjugated anti-mouse IgG (1:400, Invitrogen, USA). The fluorescence was observed using Nikon-80i fluorescence microscopy using filter sets for DAPI and RFP. The DAPI (contained in the mounting medium) fluorescence was used by the scanner to set the optical focus, and the RFP contained the specific signal of amyloid beta 40.
Bio-distribution {#Sec11}
----------------
The ^18^F-florbetaben and ^18^F-flutemetamol binding to different brain regions and peripheral organs in AD transgenic (N = 1) and control mice (N = 1) using ex vivo gamma counting. Mice were anaesthetized with isoflurane and injected with 0.23 mCi of ^18^F-florbetaben and ^18^F-flutemetamol. The tracer was allowed to distribute for 90 min. Mice were sacrificed by cervical dislocation and the brain was rapidly removed. Then, the blood, heart, lung, liver, kidney, medulla, cerebellum, right cortex, left cortex, olfactory bulb were dissected. ^18^F-radioactivity was measured with a gamma counter.
Statistics {#Sec12}
----------
For the analysis of static PET data, group comparison of SUVR and kinetic parameters were conducted with the Mann--Whitney U. A threshold of P less than 0.05 was considered significant. All statistical analyses were performed using IBM SPSS Statistics (version 20.0; SPSS) and Medcalc 16.8.4.
Results {#Sec13}
=======
Comparative overview of representative visual brain PET image {#Sec14}
-------------------------------------------------------------
A comparative overview of the representative brain PET images is presented in Fig. [2](#Fig2){ref-type="fig"}. On the ^18^F-florbetaben PET image, the AD transgenic mice showed significantly higher tracer retention in the cortical regions than did the control mice. On the ^18^F-flutemetamol PET image, the transgenic mice showed mild, focal uptake in cortical brain regions; however, higher uptake was shown in the transgenic mice than in the control mice. Overall, regardless of the AD transgenic and control group, ^18^F-florbetaben imaging showed much higher retention than did ^18^F-flutemetamol imaging. Both the AD transgenic and control groups showed high tracer retention in the cerebellum and pons than did the cortical regions.Fig. 2Overview of PET images sorted by study group. In both AD transgenic and control group, ^18^F-florbetaben imaging showed much higher cortical retention than did ^18^F-flutemetamol imaging. Color scale bar represents (from black to red) 0--340 percentage of injected dose per cubic centimeter in ^18^F-florbetaben image. Color scale bar represents (from black to red) 0--259 percentage of injected dose per cubic centimeter in ^18^F-flutemetamol image. **a** ^18^F-florbetaben image of AD mouse, **b** ^18^F-florbetaben image of control mouse, **c** ^18^F-flutemetamol image of AD mouse, **d** ^18^F-flutemetamol image of control mouse
Difference image obtained from image algebra calculation: (^18^F-florbetaben- ^18^F-flutemetamol) {#Sec15}
-------------------------------------------------------------------------------------------------
A visual representation of comparisons of the difference between ^18^F-florbetaben and ^18^F-flutemetamol is presented in Fig. [3](#Fig3){ref-type="fig"}. In the AD transgenic group, ^18^F-florbetaben showed higher and more extensive cortical uptakes compared with ^18^F-flutemetamol.Fig. 3Difference between ^18^F-florbetaben and ^18^F-flutemetamol in AD transgenic group. Each image represents PET image of **a** ^18^F-florbetaben (upper column), **b** ^18^F-flutemetamol (middle column) and **c** algebra calculation (^18^F-florbetaben-^18^F-flutemetamol, lower column). In the AD transgenic group, ^18^F-florbetaben showed higher and more extensive cortical uptakes compared with ^18^F-flutemetamol. Color scale bar represents 0--340 percentage of injected dose per cubic centimeter in ^18^F-florbetaben image. Color scale bar represents 0--270 percentage of injected dose per cubic centimeter in ^18^F-flutemetamol image. Color scale bar represents 0--280 percentage of injected dose per cubic centimeter in difference image
Comparative overview of representative visual whole body PET image {#Sec16}
------------------------------------------------------------------
Figure [4](#Fig4){ref-type="fig"} provides a comparative overview of the representative whole body PET images. The color bar of the PET image was adjusted to (0--30% ID/g) to optimize for visualization of the peripheral organ uptakes. ^18^F-flutemetamol PET imaging showed much more intense uptake in the bowel and bladder than did ^18^F-florbetaben.Fig. 4Overview of representative whole body PET images of **a** ^18^F-florbetaben and **b** ^18^F-flutemetamol in AD transgenic mouse. ^18^F-flutemetamol PET imaging showed much more intense uptake in the bowel and bladder than did ^18^F-florbetaben. Each row represents a representative PET image of the study group in sagittal view (middle column) and axial view (right column). Color scale bar represents (from black to white) 0--30% ID/g (percentage of injected dose per g) in both ^18^F-florbetaben and ^18^F-flutemetamol image
Bio-distribution {#Sec17}
----------------
Bio-distribution data of both ^18^F-florbetaben and ^18^F-flutemetamol are presented in Fig. [5](#Fig5){ref-type="fig"}. The highest radioactivity in the brain was measured in the cortex, followed by the medulla and cerebellum. ^18^F-florbetaben (Rt. cortex: 1.39 ID/g (%), Lt. cortex: 1.209 ID/g (%)) showed higher absolute differences between AD transgenic mice and control mice than did ^18^F-flutemetamol (Rt. cortex: 0.619 ID/g (%), Lt. cortex: 0.608 ID/g (%)). In AD transgenic mouse, ^18^F-florbetaben showed higher uptake in the cortex than did ^18^F-flutemetamol. In addition, for both ^18^F-florbetaben and ^18^F-flutemetamol, the right cortex in the AD mouse showed higher uptake, showing right side laterality. In terms of the visceral distribution of ^18^F-florbetaben, the highest radioactivity was measured in the liver, followed by the kidney, lung, blood and heart in both transgenic and control mice. In terms of visceral distribution of ^18^F-flutemetamol, the highest radioactivity was measured in the kidney, followed by the liver, lung, blood and heart in transgenic mice. In control mice, the highest radioactivity was measured in the kidney, followed by the lung, liver, blood and heart. Comparative analysis of ^18^F-florbetaben and ^18^F-flutemetamol biodistribution revealed that ^18^F-florbetaben imaging showed higher radioactivity in the cortex than did ^18^F-flutemetamol. In contrast, ^18^F-flutemetamol showed higher radioactivity in the kidney, lung, blood and heart, although the liver showed higher radioactivity with ^18^F-florbetaben. In contrast with the imaging findings, the bio-distribution data showed higher uptake in the cortex than in the cerebellum.Fig. 5Comparison of Ex vivo bio-distribution between ^18^F-florbetaben and ^18^F-flutemetamol in AD and control mouse. ^18^F-florbetaben showed higher radioactivity in the cortex than did ^18^F-flutemetamol. In contrast, ^18^F-flutemetamol showed higher radioactivity in the kidney, lung, blood and heart
SUVmean and SUVR based analysis of static PET image {#Sec18}
---------------------------------------------------
The SUVmean and SUVR values of PET images in both the AD transgenic and control groups are presented in Tables [2](#Tab2){ref-type="table"}, [3](#Tab3){ref-type="table"}. The mean SUVmean values of the ^18^F-florbetaben images in the AD and control mice were 0.804 and 0.699, respectively. In contrast, the mean SUVmean values of the ^18^F-flutemetamol images in the AD and control mice were 0.332 and 0.297, respectively. The mean SUVR values of the ^18^F-florbetaben images in the AD and control mice were 0.926 and 0.829, respectively. In contrast, the mean SUVR values of the ^18^F-flutemetamol images in the AD and control mice were 0.854 and 0.687, respectively. On both the ^18^F-florbetaben and ^18^F-flutemetamol scans, the mean SUVmean and SUVR values of the AD transgenic group showed higher values than those of the control group. The mean SUVmean and SUVR of ^18^F-florbetaben showed higher values than those of ^18^F-flutemetamol in the AD transgenic and control groups, respectively. The mean of the differences in the SUVmean between the AD and control group was 0.106 for ^18^F-florbetaben and 0.03 for ^18^F-flutemetamol.Table 2SUVR values of ^18^F-florbetaben image in both AD transgenic and control groupGroupIDCorRhipLhipThalaRstrLstr(a) *SUVR values of* ^18^*F-florbetaben image in AD transgenic group*AD10.8790.9120.9411.0170.9170.97920.9580.8430.8080.9320.8830.87830.9290.9881.0041.0831.0151.01440.8380.9551.0091.0840.9781.00050.9660.9960.9661.0300.8700.85660.9191.1211.1331.2581.1611.18770.9941.0741.1331.2161.0711.144Average0.9260.9840.9991.0890.9851.008SD0.0540.0940.1130.1140.1060.123(b) *SUVR values of* ^18^*F-florbetaben image in control group*Control10.6630.9010.9661.0230.9480.95620.8520.9640.9571.0250.9320.96230.8720.9441.0061.0981.0161.03540.8541.7801.7751.9971.7621.75250.8760.8941.0031.0540.9600.98860.8221.0000.9891.0851.0001.01270.8620.9180.9721.0840.9661.007Average0.8291.0571.0951.1951.0841.102SD0.0700.2970.2780.3290.2780.267*Cor* cortex, *Rhip* Rt. hippocampus, *Lhip* Lt. hippocampus, *Thala* Thalamus, *Rstr* Rt. striatum, *Lstr* Lt. striatum Table 3SUVR values of ^18^F-flutemetamol image in both AD transgenic and control groupGroupIDCorRhipLhipThalaRstrLstr(a) *SUVR values of*^18^*F-flutemetamol image in AD transgenic group*AD10.8720.9971.0371.1161.0381.09420.8490.9130.8821.0860.9780.97430.9220.9911.0641.1471.0351.14440.7820.9220.9391.0160.8970.88950.8140.9890.9501.1290.9950.89960.9460.9891.0031.1341.0351.12370.7920.8800.9330.9330.7910.837Average0.8540.9540.9731.0800.9670.994SD0.0630.0480.0640.0780.0920.125(b) *SUVR values of* ^18^*F-flutemetamol image in control group*Control10.5890.6230.6330.7200.6500.63820.6740.7180.7840.8390.7380.77930.7650.8390.8620.9400.8140.82940.6840.7430.7730.8370.7640.76250.7060.9040.9121.0150.9230.95060.6850.8220.8480.8730.7520.77170.7030.7360.8640.9280.8180.850Average0.6870.7690.8110.8790.7800.797SD0.0530.0930.0920.0940.0840.095*Cor* cortex, *Rhip* Rt. hippocampus, *Lhip* Lt. hippocampus, *Thala* Thalamus, *Rstr* Rt. striatum, *Lstr* Lt. striatum
### Statistical analysis of static PET data: AD vs. control {#Sec19}
The quantitative parameters of the static PET images (SUVR) in the AD transgenic and control groups were tested. On the ^18^F-florbetaben images, the AD transgenic group showed significantly higher SUVR values (p = 0.011) than did the control group. On the ^18^F-flutemetamol images, the AD group showed significantly higher SUVR values (p = 0.001) than did the control group. Moreover, on the ^18^F-flutemetamol images, the AD group showed significantly higher SUVR values than did the control group in all brain areas. However, on the ^18^F-florbetaben images, the AD group showed significantly higher SUVR values than did the control group only in the cortex.
### Statistical analysis of static PET data: ^18^F-florbetaben vs. ^18^F-flutemetamol {#Sec20}
The quantitative parameters of the static PET images (SUVR) between the ^18^F-florbetaben and ^18^F-flutemetamol groups are presented in Table [4](#Tab4){ref-type="table"}. The significant differences of the SUVR (cortex/cerebellum) between the scans of the two tracers in each AD and control group were compared. ^18^F-florbetaben presented a higher SUVR value in the cortex than did ^18^F-flutemetamol in both the AD (p = 0.049) and control groups (p = 0.017).Table 4Comparison of SUVR values between ^18^F-florbetaben and ^18^F-flutemetamol in AD transgenic groupGroupCorRhipLhipThalaRstrLstr^18^F-flutemetamol0.851 ± 0.0630.950 ± 0.0510.972 ± 0.0641.081 ± 0.0800.970 ± 0.0920.9910 ± .092^18^F-florbetaben0.931 ± 0.0500.980 ± 0.0901.000 ± 0.1101.090 ± 0.1130.991 ± 0.1131.010 ± 0.124*p* value0.049\*\*0.8050.4560.8051.0000.805*Cor* cortex, *Rhip* Rt. hippocampus, *Lhip* Lt. hippocampus, *Thala* Thalamus, *Rstr* Rt. striatum, *Lstr* Lt. striatum, \*\* p \< 0.05 considered as significant
Quantitative compartment model dynamic analysis of ^18^F-florbetaben and ^18^F-flutemetamol image {#Sec21}
-------------------------------------------------------------------------------------------------
### Statistical analysis of dynamic PET data: AD versus. control {#Sec22}
In the ^18^F-florbetaben group, there was a significant difference in the K1 (p = 0.011) and k4 (p = 0.017) parameters between the AD transgenic and control groups. However, in the ^18^F-flutemetamol group, there was no significant difference in K1, k2, k3, k4, K1/k2, or k3/k4 between the AD transgenic and control groups.
### Statistical analysis of dynamic PET data: ^18^F-florbetaben and ^18^F-flutemetamol {#Sec23}
In the AD transgenic group, there were significant differences of K1 (Table [5](#Tab5){ref-type="table"}), k4 (Table [6](#Tab6){ref-type="table"}), and K1/k2 between ^18^F-florbetaben and ^18^F-flutemetamol. In the control group, there were differences in k3 and k3/k4 between ^18^F-florbetaben and ^18^F-flutemetamol.Table 5Comparison of K1 values (2 compartment model) between ^18^F-florbetaben and ^18^F-flutemetamol in AD transgenic groupGroupRstrLstrCorRhipLhipThalCrbl^18^F-flutemetamol Mean + SD7.380 ± 1.0327.331 ± 1.1036.861 ± 1.3316.972 ± 1.3037.3 ± 0.9007.841 ± 0.2407.400 ± 1.410 Median (IQR)7.98 (6.95--8)8 (6.84--8)7.52 (5.85--7.95)7.29 (6.38--8)7.92 (6.31--8)7.95 (7.61--8)8 (7.66--8)^18^F-florbetaben Mean + SD4.991 ± 3.0914.581 ± 2.9603.561 ± 2.1604.182 ± 2.1604.802 ± 2.1604.891 ± 2.1605.060 ± 2.160 Median (IQR)4.9 (1--8)4.51 (1--8)3.92 (1--4.63)3.84 (1--7.63)4.78 (1--7.95)4.88 (1.18--8)5.84 (1.65--7.61)p-value0.1280.0530.011\*\*0.0730.1280.038\*\*0.073*Cor* cortex, *Crbl* cerebellum, *Rhip* Rt. hippocampus, *Lhip* Lt. hippocampus, *Thala* Thalamus, *Rstr* Rt. striatum, *Lstr* Lt. striatum, \*\* p \< 0.05 considered as significant Table 6Comparison of k4 values (2 compartment model) between ^18^F-florbetabenand ^18^F-flutemetamol in AD transgenic groupGroupRstrLstrCorRhipLhipThalCrbl^18^F-flutemetamol Mean + SD2.281 ± 3.5101.622 ± 2.7932.950 ± 3.2104.551 ± 3.9822.432 ± 3.9821.281 ± 3.9822.403 ± 3.982 Median (IQR)0.331 (0.18--6.77)0.561 (0.35--1.06)1.752 (0.37--7.23)7.460 (0.32--7.87)0.340 (0.13--7.71)0.273 (0.11--0.44)0.374 (0--7.28)^18^F-florbetaben Mean + SD0.713 ± 1.0101.327 ± 2.2900.161 ± 0.1500.321 ± 0.3310.902 ± 1.8802.190 ± 3.1020.140 ± 0.141 Median (IQR)0.312 (0.22--0.92)0.283 (0.25--2.03)0.240 (0--0.29)0.282 (0--0.41)0.281 (0--0.35)0.383 (0.21--6.15)0.110 (0--0.3)p-value0.9020.3830.017\*\*0.0530.3830.5350.165*Cor* cortex, *Crbl* cerebellum, *Rhip* Rt. hippocampus, *Lhip* Lt. hippocampus, *Thala* Thalamus, *Rstr* Rt. striatum, *Lstr* Lt. striatum, \*\* p \< 0.05 considered as significant
### Difference in the time-activity curve between ^18^F-florbetaben and ^18^F-flutemetamol {#Sec24}
Dynamic PET time activity curves of the cortex-VOI and cerebellum-VOI for the two tracer images in representative AD and control mice are illustrated in Fig. [6](#Fig6){ref-type="fig"}. Visual inspection of the time-activity curves revealed that ^18^F-florbetaben showed higher initial uptake and later retention than did ^18^F-flutemetamol. In contrast, ^18^F-flutemetamol showed lower initial upstroke and faster washout than did ^18^F-florbetaben.Fig. 6Dynamic PET time activity curves of the cortex-VOI and the cerebellum-VOI. Time-activity curves of **a** ^18^F-florbetaben in AD mouse, **b** ^18^F-florbetaben in control mouse, **c** ^18^F-flutemetamol in AD mouse, **d** ^18^F-flutemetamol in control mouse, were illustrated. Values are SUVbw (g/ml) for a cortex VOI (blue line) and a cerebellum VOI (black line). ^18^F-florbetaben showed higher initial uptake and later retention than did ^18^F-flutemetamol. In contrast, ^18^F-flutemetamol showed lower initial upstroke and faster washout than did ^18^F-florbetaben
Neuropathologic findings (at 18 weeks) {#Sec25}
--------------------------------------
### Hematoxylin and eosin (H & E) staining {#Sec26}
In Fig. [7](#Fig7){ref-type="fig"}, the AD mice show a more immature pattern as a result of disarrangement of hippocampal cell migration (pathogenic sign of AD) along the dentate gyrus of the hippocampus compared with the wild type.Fig. 7Visual comparison of the H & E staining image of hippocampus (sagittal section) between AD and wild type. Left: the zoom (100×) of the hippocampus in wild type, Right: the zoom (100×) of the hippocampus in AD mouse. AD mice show a more immature pattern as a result of disarrangement of hippocampal cell migration along the dentate gyrus of the hippocampus compared with the wild type
### Thioflavin S staining image {#Sec27}
On thioflavin S staining images, Aβ deposits were found broadly in various brain regions including the cortex, hippocampus and thalamus in AD mice. Thioflavin S positive plaque areas predominantly diffuse in a morphologic characteristic nature rather than in a compact nature (Fig. [8](#Fig8){ref-type="fig"}).Fig. 8Visual overview of the thioflavin S staining images of **a** wild type mouse and **b** AD transgenic mouse. Left column shows DAPI (blue channel), middle column shows thioflavin S (green channel with specific staining signal) and right column shows merged image. Aβ deposits were found broadly in various brain regions including the cortex, hippocampus and thalamus in AD mice
### Immunohistochemistry for Aβ~40~ staining {#Sec28}
The results of immunohistochemistry for Aβ~40~ staining in AD transgenic and wild type were represented in Figs. [9](#Fig9){ref-type="fig"}, [10](#Fig10){ref-type="fig"}. In wild type mouse, there was no Aβ ~40~ expression in the cortex and hippocampus. In contrast, the Aa~40~ expression of AD transgenic mouse significantly increased, correlating our H & E staining findings.Fig. 9Visual overview of the Aβ~40~ staining images of hippocampus in **a** wild type and **b** AD mouse. In each group, right upper row shows DAPI (blue channel), Left lower panel shows Aβ~40~ (RFP red channel with specific staining signal) and Right column shows merged image. In wild type mouse, there was no Aβ 40 expression in the hippocampus. In contrast, the Aa40 expression of AD transgenic mouse significantly increased Fig. 10Visual overview of the Aβ~40~ staining images of cortex in **a** wild type and **b** AD mouse. In each group, right upper row shows DAPI (blue channel), Left lower panel shows Aβ~40~ (RFP red channel with specific staining signal) and Right column shows merged image. In wild type mouse, there was no Aβ 40 expression in the cortex. In contrast, the Aa40 expression of AD transgenic mouse significantly increased
Correlation with neuropathologic findings and visual PET image {#Sec29}
--------------------------------------------------------------
Finally, as shown in Fig. [11](#Fig11){ref-type="fig"}, the ^18^F-florbetaben PET images more closely correlated with the thioflavin S staining image in terms of spatial distribution pattern. However, the ^18^F-flutemetamol images revealed less prominent signal intensity and poor correlation of spatial distribution with neuropathologic plaque distribution shown in thioflavin S staining images.Fig. 11Correlation with neuropathologic finding and visual PET images. **a** Paxinos and Franklinis the Mouse Brain in stereotaxic coordinates atlas representing our pathological section, **b** Thioflavin S staining image, **c** ^18^F-florbetaben image, **d** ^18^F-flutemetamol image. The ^18^F-florbetaben PET images matched well to the thioflavin S staining image in aspects of signal intensity and spatial distribution pattern in cortical brain regions, compared with ^18^F-flutemetamol images
Follow-up neuropathologic findings (at 48 weeks) {#Sec30}
------------------------------------------------
The results of the follow-up immunohistochemistry for Ai~40~ staining in AD mice at 48 weeks are shown in Figs. [12](#Fig12){ref-type="fig"}, [13](#Fig13){ref-type="fig"}. At 48 weeks, AD mice showed extensive At~40~ expression in dentate gyrus of hippocampus (CA1, CA2, CA3) and cortex, compared with the images at 18 weeks.Fig. 12Aβ~40~ staining images of AD mouse at 48 weeks in **a** CA1, **b** CA2, **c** CA3 area of hippocampus and **d** cortex Fig. 13Comparison of the Aβ~40~ staining images of AD mouse in dentate gyrus of hippocampus between **a** 18 week and **b** 48 weeks. AD mice showed extensive and significantly increased Aβ40 expression in the hippocampus and cortex compared with the images at 18 weeks
Discussion {#Sec31}
==========
In this study, ^18^F-florbetaben and ^18^F-flutemetamol images could differentiate AD and control group on visual and SUVR analysis. The ^18^F-florbetaben group presented differences in K1 and k4 kinetic parameters between AD and control groups, although ^18^F-flutemetamol did not show difference. Several differences emerged between ^18^F-florbetaben and ^18^F-flutemetamol. ^18^F-florbetaben images showed more prominent visual uptake intensity and higher SUVR than the ^18^F-flutemetamol images did. Moreover, ^18^F-florbetaben PET images more correlated well with the thioflavin S staining. However, according to bio-distribution and kinetic results, ^18^F-flutemetamol is more actively metabolized than is ^18^F-florbetaben, suggesting that ^18^F-flutemetamol has faster transport from arterial plasma into the first tissue compartment and faster dissociation from the amyloid tracer complex.
In the static analysis data, the results were grossly consistent with a previous study \[[@CR12]\]. In another ^18^F-florbetaben PET study, the SUVR in APPswe/PS2 at 5 months was 0.95 ± 0.04, and the SUVR in APPswe/PS1G384A mice at 5 months was 0.93 \[[@CR12]\]. The traditional SUVR method measures the radioactivity ratio of brain target regions to reference tissue during a fixed time interval after injection of the tracer \[[@CR11]\]. This relative quantitative approach for static PET data is practical for routine clinical setting. However, due to the kinetic compartment model for reversible binding radiotracers such as ^18^F-florbetaben or ^18^F-flutemetamol, the kinetic model reflects the available binding site density and also the perfusion signal and tracer clearance to and from brain tissue \[[@CR11]\]. In this study, the 2 tissue compartment model with IDIF method was used, and the IDIF appears to be an attractive non-invasive alternative option obviating the need for arterial cannulation, blood handling and analysis \[[@CR13]--[@CR15]\]. Furthermore, to avoid the effects of non-specific binding, we prolonged the uptake time, resulting in a longer wash-out of non-specifically bound tracer. A clinical protocol for ^18^F-florbetaben involves a 90 min uptake periods \[[@CR14]\]. A similar protocol was used in the previous APPPS1-21 mouse cohort study, allowing a 90-min uptake time \[[@CR15]\].
The reasons for the disparity in imaging characteristics between ^18^F-florbetaben and ^18^F-flutemetamol are related to their chemico-physiological properties. ^18^F-florbetaben and ^18^F-flutemetamol belong to different families of imaging probes. ^18^F-flutemetamol is a member of the thioflavin derivatives imaging probe family \[[@CR16]\], and ^18^F-florbetaben belongs to a different branch of imaging probe family, the trans-stilbene derivatives \[[@CR16]\]. Because these two tracers belong to distinct chemical families, they showed differences in binding affinity. In the bio-distribution data, ^18^F-flutemetamol showed lower brain and higher peripheral organ uptake responsible for metabolite excretion compared with ^18^F-florbetaben. These findings and kinetic parameter results suggest that ^18^F-flutemetamol is more actively metabolized than is ^18^F-florbetaben. The tracer metabolites were more polar than were the parent molecules and therefore less able to enter the brain \[[@CR17]\]. In a preclinical study comparing the pharmacokinetic characteristics of ^18^F-flutemetamol with that of ^11^C-PiB, the metabolism of ^18^F-flutemetamol was faster than that of ^11^C-PiB \[[@CR18]\]. This finding can be explained by the higher lipophilicity of ^18^F-flutemetamol (logPC18 = 1.7) than that of ^11^C-PiB (logPC18 = 1.2) \[[@CR19]\]. In another study, the lipophilicity of ^18^F-florbetaben (Log Doct/PBS = 1.58) was higher than that of ^11^C-PiB (Log Doct/PBS = 1.50) \[[@CR20]\]. These results indirectly demonstrate that the rapid metabolism of ^18^F-flutemetamol could be explained by the higher lipophilicity of ^18^F-flutemetamol (logPC18 = 1.7) than of ^18^F-florbetaben (Log Doct/PBS = 1.58).
Previous studies reported that various transgenic animal models showed differences in binding affinity with imaging tracers and this phenomenon was thought to be related with variations in plaques configurations. In this study, 18-week-old AD transgenic mice carrying NSE-controlled APPswe, C57BL/6-Tg (NSE-hAPPsw) Korl were selected due to their rapid and robust amyloid plaque development at that early age \[[@CR21]\]. In contrast, Tg2576 mice showed late onset and slower accumulation \[[@CR5]\]. In another previous report using APPPS1 mice co-expressing L166P mutated Presenilin 1 under the control of a neuron-specific Thy1 promoter and KM670/671NL mutated amyloid precursor protein, cortical amyloidosis was reported at the age of 6--8 weeks \[[@CR22]\]. In APPPS1-21 mice, amyloid was known to accumulate in a 4-week and cortical microglia increased threefold from 1 to 8 months of age \[[@CR22]\]. Hence, APPPS1 mice are good for investigating the mechanism of amyloidosis and treatment strategies because of their early onset of amyloid deposition and convenient cross-breeding with other genetically engineered mouse models.
In humans, the APPswe gene caused early presentation of familial AD \[[@CR23]\]. In the NSE-controlled APPswe mouse model, the Swedish double mutation at the 670/671 codon in the human APP gene under the control of the NSE promoter caused increased cleavage by the beta secretase and accelerated amyloid accumulation at young age \[[@CR24]\]. Amyloid deposition in the NSE-controlled APPswe mouse induces subsequent neuronal apoptosis through the mechanisms of the mitogen-activated protein kinase (MAPK) and c-Jun N-terminal kinase (JNK) pathway or caspase-3 pathway \[[@CR25], [@CR26]\]. Although the mouse model in our study was relatively young, compelling evidence from previous studies regarding the dynamics of cerebral amyloidosis using a young APP mouse model indicates that NSE-augmented APPswe mice are suitable for the neuropathological phenotype of AD \[[@CR27]\]. Moreover, we selected only male mice to control the effect of sex. Several studies reported the effect of sex on β-amyloid accumulation and AD phenotype. Latest studies have investigated the effects of sex on hippocampal atrophy in normal aging, MCI and AD \[[@CR28]\]. Sex could regulate the relation of amyloid positivity and cognition \[[@CR28]\]. Also, significant sex differences in pathology of 3xTg-AD mice suggested these differences may be due to organizational actions of sex hormones during development \[[@CR29]\].
The results of this study are in contrary to those of antecedent ^18^F-FDDNP study that presented affinity for both amyloid and neurofibrillary tangles \[[@CR30]\]. There was no increase in cortical uptake even in 13--15-month-old Tg2576 mice, even if technical issues, such as low spatial resolution, were regarded as the reasons for this negative PET finding \[[@CR30]\]. However, in another ^18^F-FDDNP study in triple-transgenic rats, previous partial volume effects were overcome and contrasting results were observed; prominent uptake was presented in the frontal cortex and hippocampus \[[@CR31]\]. In an ^11^C-PiB study, old Tg2576 mice showed prominent cortical binding than did control mice \[[@CR9]\]. Those paradoxical results were explained by the confounding effects of cortical perfusion and the low distribution of ^11^C-PiB binding sites per plaque \[[@CR32]\]. However, following the ^11^C-PiB study with high specific activity overcame such confounding effects, so significant cortical uptake and excellent correlation between PET uptake and a pathologic amyloid burden were observed in APP23 mice compared with age-matched healthy controls \[[@CR33]\]. Additionally, in a recent ^11^C-PiB PET study of APP/PS1 mice, an outstanding correlation can be found between imaging results and the plaque burden measure obtained ex vivo and in vitro in the same animals \[[@CR34]\]. In a previous preclinical imaging study comparing ^18^F-florbetaben and ^11^C-PiB, which is of the same thioflavin T derivative family with ^18^F-flutemetamol, two aged AD mouse models with contrasting levels of amyloid deposition to high (APPPS 1-21) and low (BRI 1-42) target state were investigated \[[@CR15]\]. Compared with control mice, APPPS 1-21 mice (high target state) presented prominent fibrillary amyloid accumulation in both ^11^C-PiB and ^18^F-florbetaben, but the difference of uptake between AD and control mice was higher for ^11^C-PiB than for ^18^F-florbetaben \[[@CR15]\]. However, BRI1-42 mice (low target state) did not show enhanced tracer uptake \[[@CR15]\]. Taking into consideration the difference in the mouse ages, our results broadly resemble their findings. Another ^18^F-florbetaben study using the same mouse cohort reported only a 14.5% difference between control and transgenic mice (5XFAD) found with ^18^F-florbetapir in comparison to a 21% difference found with ^11^C-PiB \[[@CR35]\].
Before the interpretation of ^18^F-florbetaben or ^18^F-flutemetamol images in clinical settings, preclinical approaches can provide baseline information regarding differences in the kinetic and metabolic properties of two tracers. The visual image and SUVR of ^18^F-florbetaben showed extensive cortical uptake in the same cohorts compared with ^18^F-flutemetamol images in both the AD and control groups. On the ^18^F-flutemetamol images, high lipophilicity and fast metabolism might complicate the analysis of PET data. In this study, the metabolism and kinetics of the tracer also have a great influence on the visual uptake of the amyloid tracers. Using these points, the human amyloid image should be read in consideration of the pharmacokinetic and metabolic properties of the tracer. Therefore, preclinical imaging might provide valuable information about the possibilities and limits of a given approach in humans by helping to better understand the in vivo binding characteristics of an imaging agent. The results of this study suggest that appropriate outcome measures are important in monitoring disease progression and response to therapeutic approaches in human settings. In this study, both tracers for VOI-based ratio analysis could discriminate the AD transgenic and control groups. However, on kinetic parameters from dynamic data, ^18^F-flutemetamol images could not be used as an indicator to distinguish between AD transgenic and control groups. Moreover, the detection of amyloid PET signal in this early aged mouse model used in this study suggests the sensitivity of the PET imaging bio-marker, suggesting the possibility of early detection of amyloid pathology before the manifestation of behavioral abnormalities.
There are several limitations that should be mentioned. First, the distribution patterns between ^18^F-florbetaben and ^18^F-flutemetamol were compared at a single time point. Therefore, the current data are insufficient to judge the superiority between the two tracers based. In a follow-up study, the scope of the analysis should be extended to cover the comparison of serial and chronological accumulation pattern between ^18^F-florbetaben and ^18^F-flutemetamol.
Second, there are some issues regarding methodological perspectives. Herein, for the shape of the merged atlas to match well with the skull CT, the thresholded CT image was manually fused with the magnetic resonance template. However, limitations could exist regarding the method of manual registration. More accurate, automatic algorithm is required in the further study. Additionally, partial volume correction was not conducted when defining the VOI in the blood input area, because the VOI size of the blood input area was larger than the volumetric PET spatial resolution (0.343 mm^3^). Therefore, the effect of the partial-volume correction should be investigated in a further study.
Moreover, in further studies, the different amyloid isoform structures and the range of fibrillarity influencing PET imaging results should be investigated. Amyloid plaques can be sub-classified according to the presence of dystrophic neuritis or reactive astrocytes and the morphological features as either diffuse, fibrillary or dense core types \[[@CR36], [@CR37]\]. In the thioflavin S image in our study, the thioflavin S positive plaque areas were predominantly diffuse rather than compact in terms of morphologic characteristic nature. Diffuse plaques are known to occur early in the disease course and to progress towards typical cored plaques \[[@CR27], [@CR38]\]. Dense-core plaques are often observed in AD mouse models, at an advanced age \[[@CR39]\]. Morphological and biochemical compositional differences of plaques can influence the affinity binding sites for amyloid imaging tracers. Between ^18^F-florbetaben and ^18^F-flutemetamol, which tracer has higher binding affinity to diffuse type plaques? The answer to this question should be investigated in a further study including an in vitro binding assay. In addition, as plaques are amorphous three-dimensional configurations, further three-dimensional analysis of plaque structures with more precise detection stringency should be required.
Moreover, we have not performed Aβ 1-42 staining along with the Aβ 1-40 staining, in the follow-up of immunohistochemistry, because we simply wanted to demonstrate the establishment of AD mouse model and regarded Aβ 1-40 was better choice. Aβ 1-40 presents the most prominent Aβ isoform in the AD brain, while the Aβ 1-42 shows a substantial increase with specific forms of AD \[[@CR40], [@CR41]\]. Moreover, extraordinary expressions in AD mice carrying NSE-controlled APPsw presented that Aβ 1-40 was more prominent than Aβ 1-42 in the APPsw mice \[[@CR42]\].
Conclusion {#Sec32}
==========
^18^F-florbetaben and ^18^F-flutemetamol images could distinguish between the AD and control group by both visual and SUVR-based analysis. The ^18^F-florbetaben and ^18^F-flutemetamol images showed disparate character in aspects of visual uptake intensity, quantitative parameters, bio-distribution and relations with neuropathological finding. ^18^F-flutemetamol was more actively metabolized than was ^18^F-florbetaben, although ^18^F-florbetaben presented higher visual uptake intensity, SUVR and close correlation with the pathology.
Additional file
===============
{#Sec33}
**Additional file 1.** SUVR values of ^18^F-florbetaben and ^18^F-florbetaben images in both AD transgenic and control group. (1) Basic characteristics of AD transgenic and control mouse model (2) SUVR values of ^18^F-florbetaben image in AD transgenic group, (3) SUVR values of ^18^F-florbetaben image in control group, (4) SUVR values of ^18^F-flutemetamol image in AD transgenic group, (5) SUVR values of ^18^F-flutemetamol image in control group.
FBB
: ^18^F-florbetaben
FMM
: ^18^F-flutemetamol
AD
: Alzheimer's disease
Aβ
: amyloid plaque
APP
: amyloid precursor protein
CSF
: cerebrospinal fluid
FDG
: fludeoxyglucose
MRI
: magnetic resonance image
MCI
: mild cognitive impairment
ND
: neurodegenerative diseases
NFT
: neurofibrillary tangles
PiB
: Pittsburgh compound B
PET
: positron emission tomography
RFP
: red fluorescent protein
GFP
: green fluorescent protein
APPswe
: Swedish APP mutation
DAPI
: diamidino-2-phenylindole
**Electronic supplementary material**
The online version of this article (10.1186/s12868-018-0447-7) contains supplementary material, which is available to authorized users.
HJS got the original idea, designed the study, analyzed and interpreted data, ran the statistics and wrote the draft. HJS, SYL, GEC, JAP, MHK, KCL, YJL, MKK, YJJ, HJY, KC, DYK performed the experiments and collected the data, revised and approved the final manuscript. Also, they agreed to be accountable for all aspect of the work in ensuring that questions related to the accuracy of the work are appropriately investigated. All authors read and approved the final manuscript.
Acknowledgements {#FPar2}
================
The authors are grateful to Ji-Ae Park, Min Hwan, Kyo Chul Lee, Yong Jin Lee (Division of RI-Convergence Research, Korea Institute of Radiological and Medical Sciences) for animal care and PET/CT imaging and to Mun Ki Kim (Pohang Center of Evolution of Biomaterials, Pohang Technopark) for pathology.
Competing interests {#FPar3}
===================
The authors declare that they have no competing interests.
Availability of data and materials {#FPar4}
==================================
All data generated or analyzed during this study are included in this published article and its additional files.
Consent for publication {#FPar5}
=======================
Not applicable.
Ethical approval and consent to participate {#FPar6}
===========================================
Not applicable since this research did not involve human participants. All experimental procedures were approved by the institutional animal care committee (IRB number: LML 16-970, Dong-A university, Busan, Korea) and carried out in strict accordance with the Animal Welfare Act, the European Communities Council Directive of November 24, 1986 (86/609/EEC) and the ARRIVE (Animals in Research: Reporting In Vivo Experiments) guidelines.
Funding {#FPar7}
=======
This work was supported by the Busan Metropolitan City research fund. This research was partially supported by a grant of the Korea Institute of Radiological and Medical Science (KIRAMS) funded by the Ministry of Science and ICT (MSIT), Republic of Korea (No. 50461-2018).
Publisher's Note {#FPar70}
================
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
| 2023-09-22T01:26:29.851802 | https://example.com/article/8067 |
3rd - Dharam Khalsa with:
The woman told her husband, "I'm like a fine wine or cheddar cheese...I'll get better with age."
=
He thought, deliberated the marriage, locked his wife down in the basement wine cellar.
Tony Crafter with:
“Life is real! Life is earnest!
And the grave is not its goal;
Dust thou art, to dust returnest,
Was not spoken of the soul.”
=
Life is nature! Nature's soul!
Vital; restless; passing;
And if its wonder thee forget,
Look out the door at that sunset!
Adie Pena with:
To earn a "Full House," I should devote my best work into each anagram I create. ~
But whose mean, irate ass do I carefully have to lick around here to get a nom? ;-)
Rosie Perera with:
Former South African President Nelson Mandela is to be removed from U.S. terrorism watch lists =
I'm for redress, for this most famous clever old man is no arms threat. I'd trust Nobel Peace winner!
Rosie Perera with:
THIS IS NOT A JOKE - CONGRATULATIONS YOU WON! You are the 4,405,164,898th visitor to see this lucky banner. Click here to claim.
=
Ha, ha! You jerk, you are so gullible! You think, "Attractive income...$98,864,144.50...a check is written!" Not close! In short: "It's not so!"
Christopher Sturdy with:
> The date of the opening ceremony of the Beijing Olympic Games > =
> Eight Eight Eight > Some plan if many enjoyed one perfect combo.
Rosie Perera with:
If John McCain is elected, he would be the oldest person inaugurated to a first term as President of the United States.=
He's just a sweet, decrepit old fart, I fear. This patient should be on medication, fed, entrusted to a select nursing home.
THE ANAGRAMMY CHALLENGE CATEGORY
1st - Tony Crafter with:
As a courtesy to the next customer, may we suggest that you use your towel to wipe off the wash basin. Thank you.
=
To that fat guy by the exit: We must ask you not to use the WCs, as your unwelcome arse is way too huge for the pans!
2nd - Larry Brash with:
As a courtesy to the next customer, may we suggest that you use your towel to wipe off the wash basin. Thank you. =
Next, we want you to wipe the bowl that you use of any faeces marks you cause as they might gross others out. Tut!
3rd - Mike Mesterton-Gibbons with:
As a courtesy to the next customer, may we suggest that you use your towel to wipe off the wash basin. Thank you. =
So as you may go when the potty feels extra wet, fussy woman, use without your buttocks area touching the seat
Rosie Perera with:
In case of turbulence woes way out at sea, shut up! We may throw oxygen masks at you. Get those to the youth first.
Christopher Sturdy with:
You are what you eat...
But piss on the seat;
You eat what you excrete!
Fucking gross, not sweet.
Dharam Khalsa with:
You, the obnoxious scouts, must not gawk at the US war amputees! Anyway, these lost feet carry the weight of you.
Meyran Kraus with:
"The meat's sour. Excuse us. We suggest that you eat some nuts.
...By the way, any of you know how to pilot the aircraft?"
THE LONG CATEGORY
1st - Tony Crafter with:
When I went to lunch today, I noticed a little old lady sitting on a bench sobbing her eyes out. I stopped and asked what was the matter. She said, "I have a 25 year-old husband at home. He makes love to me every morning and then gets up and makes me pancakes, toast, fresh fruit and freshly ground coffee."
I said, "Well! Now, why are you crying?"
She said, "He does me homemade soup for lunch and my favourite brownies and then makes love to me all the afternoon.
I said, "Then, just why are you crying?"
She said, "For dinner he cooks me a gourmet meal with red wine and my favorite dessert and then makes love to me until 2 a.m."
I said, "Well, why on earth would you be crying?"
She said, "I can't remember where I live!"=
Two elderly widows had been friends for many years. Over the years they had shared all kinds of adventures, reminiscences and hardships. But recently, their activities had diminished to meeting up once a week to play cards.
One day, they were commencing a game of whist when one woman looked at the other and said sheepishly, "Now look, don't get mad at me... we have been chums for a long time - some 52 years I believe - but no way can I think of your name! I've thought and I've thought, and it's useless - I just cannot remember. I know I am a dummy, but please tell me what your name is."
Her friend glared at her. For a full 2 minutes she stared and glared. Finally she said, "How soon do you have to know?"
2nd - Dharam Khalsa with:
Fear of Flying
A plane took off from an airport in New York and steadily climbed. After it had reached its comfortably high cruising altitude, the captain made a typical announcement out over the intercom, "Ladies and gentlemen, this is your captain speaking. Welcome to Flight Number 93, nonstop from New York to Los Angeles. I see the weather ahead is good and we should have a fairly smooth and uneventful flight. Now lean back and re..."
"OH MY GOD!" he yelled.
~
A shivery silence followed, a child bawled, and after a long time that seemed like forever, the captain came back over the intercom, "Ladies and Gentlemen, I'm so sorry if I frightened you earlier. During the time I was talking, Donna, a new on-board flight attendant, accidentally spilled a cup of hot coffee on my lap. You should see the front of my pants!"
A grumpy man using the phone far away in row 39 groaned, "No, that's nothing. You should look at the back of mine!"
3rd - Adie Pena with:
The Musee du Louvre in Paris, France is one of the world's most visited art museums, a historic monument, and a national symbol. The collection has some 34 thousand priceless pieces.
On the Right Bank and between the Seine River and the Rue de Rivoli, the Louvre is slightly askew of a long architectural straightaway that cuts through the heart of Paris.
=
The merciless French villain passes the museum security, steals their 4 terrific art pieces, and gets to his van.
But he is captured 3 short corners away when he runs out of vital millilitres of value-added petrol.
How can one make a blatant, childish error?
"Monsieur, that is the reason. I had nothing Toulouse with no Monet to buy Degas to make the Van Gogh."
Ellie Dent with:
TIRED AND EMOTIONAL
Look, I had around eighteen gorgeous bottles of whisky I used to keep in the cellar. But then, she, my lovely other half Sheila, demanded I singlehandedly tip all these bottles down the sink. After careful thought I agreed, and so finally I carried out this mean, unusual assignment... a lone, thankless task.
I withdrew the cork from the first bottle and poured the entire contents down the sink, excepting the one glass, which I drank.
Then I withdrew the cork from the second bottle and did the same, with the exception of the one glass, which I drank.
I then withdrew the cork from bottle no. three, and poured it down the sink, which I drank .
I pulled out the cork from the fourth one down the sink, and poured the bottle down the used glass, which I sank.=
I pulled the bottle from the cork of the next, drank one sink out of it, and threw the rest down the glass.
I pulled the sink from the next glass, and poured the cork down the bottle. Then corked the sink with the glass, bottled the drink, and drank the pour.
Once I'd emptied everything I could see, as I steadied the house with one hand, with the other I began to count up all withdrawn corks with bottles and glasses, for errors - which were thirteen odd - and as the houses came by, I withdrew, and counted again. Then finally, I'd all the houses collected together in a whisky bottle, which I drank.
I'm not under the affluence of incohol, as some tinkle peep I am. I'm not half as thunk as you might drink. I fool feelish I don't know who is me, and the drunker I stand here, the longer I get.
Dharam Khalsa with:
Why do married women tend to be heavier set than single women?
A single woman gets home at nightfall, turns on the light and takes one look at what is in her fridge, and goes to bed.~
It seems to me, though, an average married woman (not the slim newlywed) gets into her aged flannel nightgown and robe, looks at what is in the bed, and hastens to look in the fridge.
Dharam Khalsa with:
Dr. Smith evaluates a patient for a respiratory problem, and the highly esteemed doctor asks his patient, "Which do you want first? Do you want to hear the good news or the bad news?"~
The patient responds, "I want to know only half the truth today, the good part."
Dr. Smith arches his eyebrows and proclaims, "We're about to go have this weird disease named after you."
Rosie Perera with:
We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness.=
A very sublime quote in the "Declaration of Independence of the Thirteen Colonies" that was written by the US "Fathers" -- A better paraphrase might be: "True attitude: we hate death, thrall, and really high sellers."
Dharam Khalsa with:
If total thermonuclear war were to shake the world, God forbid, and we saw mushroom clouds billowing (Pray it will never happen!),~
we would all be at work feverishly wording anagrams on the whole incident (albeit, harsh) from our laptop computers worldwide!
Dharam Khalsa with:
Two average patients, two different doctor's offices.
(Boy, if this doesn't hit the nail on the head, I don't know what does!)
Two patients limp into two different crowded New York medical centers sharing the same complaint. Both are having trouble with their gait whenever they walk and appear to require hip replacement.
The FIRST patient is weighed, examined, and has rigorous tests in an hour, gets x-rays the same day, and shows a time reserved for surgery at the clinic the following week.
~
The SECOND goes to the family doctor after waiting eight weeks in limbo for an appointment, then holds on for another eight or nine weeks for an orthopedic hip specialist. She winds up getting x-rays and a blood test, which are reviewed after a week, and is scheduled to have hip surgery after another month.
Why did two similar patients get this different treatment?
Why, the FIRST was a Labrador Retriever; the SECOND was a widow with no insurance!
Next time, please get me quickly to a vet!
Dharam Khalsa with:
Unusual menopausal jewelry
My husband mentioned he hated the burden of my extreme menopausal mood swings. Even had a birdbrain idea of purchasing me a fad mood ring for my birthday, with the hope he could learn my attitude by looking at my left hand!
~
My fond husband found that when I'm in a cheerful, happy mood, the mood ring turns a jade green.
But when I'm in a really bad mood, it leaves a large ugly red mark in the center of his forehead!
Do you suppose that maybe next time my husband will buy me a diamond?
Dharam Khalsa with:
Torrid Monday
A woman was innocently unwinding at a downtown bar on a hot (too hot) Monday after work, sitting and enjoying a cocktail with her thirsty girlfriends, when who should enter the door but a tall, tanned, handsome, extremely sexy, middle-aged man. He was so uncommonly striking that the woman could not take her incredulous eyes off him.
The dashing, stylish playboy spied her attentive stare and walked toward her. Needless to say, the spellbound woman watched him too. Before she could offer apologies for rudely staring, he leaned over intimately and whispered, "Hello...
~
I'll do anything, any favor you want me to do, no matter what or how kinky, for twenty dollars. But, of course, there is one condition."
Flabbergasted, the woman asked, "What is the condition?"
He replied, "You must tell me what you want me to do in just three words."
Acknowledging the extraordinary proposition, the woman thought for a moment, "Three words?" Then she slowly reached far inside her handbag and removed a twenty-dollar bill, and pressed it into the man's hand, along with her address.
She looked deeply into his fascinating eyes, and slowly and meaningfully exclaimed,
"Clean my house!"
Dharam Khalsa with:
Two nursing home residents agreed to a hasty romp in an available closet. They undressed. Having taken Viagra, the man was huge now, clearly ready to aim for some action. Both were delighted and about to make love, when the woman decided to warn the man of her heart condition.~
The grandmother wondered, "Did I already tell him?" The woman really did not want to alarm the poor man, so she tried to maintain her calm affect. She crooned, "I want you to know, I have acute angina."
The man answered, "Thank God, because you have the worst sagging boobs I've ever seen!
Rosie Perera with:
The debate rages on about capital punishment, what methods are OK (dispatch the old yet deedy idiot swiftly, yet no nasty torture).
~
Why don't they do it the way they did in Socrates' day? Force the inmates to take pentobarbital (the drug used to put animals to sleep).
Once upon a time, long ago and far away, a cat fell in love with a very handsome, good-looking young man, and pleaded with Venus to change her into a woman.
"I should've thought," said Venus, with some irritation, "you might make a trifling transformation like that, without having to bother me. Now cat, go thence... be a woman."
Afterwards, wanting to see if the change had been completed, Venus caused a mouse to appear, whereupon the woman shrieked, and cried, making such a spectacle of herself that the young man would not marry her.
********** =
THE TWO KINGS
The King of Madagao, being engaged in a dispute with the King of Bornegascar, wrote to him: "Before proceeding further in this matter, I demand the recall of your Minister from the Capital."
Enraged by this impossible demand, the King of Bornegascar replied: "I shall not recall my Minister. And moreover, if you do not immediately retract your demand, I shall withdraw him!"
This threat so terrified the King of Madagao, that in hastening to comply he fell over his own feet, thus breaking the Third Commandment.
********** =
THE FOOLISH WOMAN
A married woman, whose unfortunate young lover, a gentle Hawaiian, was planning to reform by running away, vowed to get her revenge: found a gun, then shot him in the head, dead.
"Oh, what d'you do that for, Ma'am?" asked a man of Law, sauntering past.
"Cause," replied the married woman, "in truth, he wasn't ever a gentleman, but a vile wicked cheat; uncouth, unethical. He had even purchased a ticket to... to Chicago."
"Oh heavens, sister," said a man of God, solemnly, "you cannot hope to attempt to stop the wicked from going to Chicago by killing them.
********** =
THE DISINTERESTED ARBITER
One summer morning, two stupid dogs which had been fighting, without advantage to either, to try to get their rascally paws on a magnificent bone, finally referred their difference to a common sheep.
This timid, mild, dim-looking animal heard them talk, then after a short time considering their argument, flung their bone forcibly into a pond. "Oh! Why?" asked the mortified dogs, grim, angry from shock. | 2024-01-31T01:26:29.851802 | https://example.com/article/4701 |
Is it a good idea to snort cocaine from seized police evidence?
Deborah Madden, an ex SF crime lab tech who was ‘using’ cocaine from seized police evidence for personal reasons has been doing cartwheels this weekend as she learned that the attorney general’s office wont be pressing criminal charges as they believe they do not have sufficient evidence, that despite her personal admission that she had been snorting ‘dropped’ samples.
washingtonpost: Madden, 60, had been accused of stealing small amounts of cocaine from the lab while working there last year.
The allegations led to the lab’s closure in March and the dismissal of more than 600 drug cases. It also created a nightmare for District Attorney Kamala Harris, who asked the attorney general’s office in April to handle any possible prosecution.
At stake though is whether a double standard has been raised, given that Madden was effectively a police employee?
Madden’s behavior and job performance began attracting attention outside the lab late last year, according to records.
A top San Francisco prosecutor sent an e-mail to a chief assistant district attorney in November 2009 complaining about Madden’s erratic behavior. The e-mail said Madden appeared to be purposely sabotaging cases by calling in sick on days she was to testify in court.
Police were tipped off to problems at the lab about a month later when Madden’s sister notified Madden’s direct supervisor that she had found a vial of cocaine on her sister’s dresser in Madden’s San Mateo home.
But if that doesn’t startle you, perhaps this will….
Madden acknowledged during a Feb. 26 police interview that she snorted cocaine that spilled on her work station to mask a drinking problem. She had taken a leave of absence when an audit revealed cocaine was missing from the lab.
For now Madden gets off scott free while somewhere tonight, some individual is getting to spend a night locked away because they found nothing more that a $20 coke bag in their possession. At least one thing is for sure- thank God Madden didn’t get round to it ‘examining’ it. | 2023-09-17T01:26:29.851802 | https://example.com/article/8345 |
ViiV agrees $1.5bn deal to acquire BMS' HIV assets
Includes
its entire development pipeline - from discovery to preclinical projects
ViiV Healthcare has improved its position in the HIV therapy market with a $1.5bn deal to take control of Bristol-Myers Squibb's antiretroviral product portfolio.
The wide-ranging deal includes BMS' entire development pipeline - from discovery and preclinical research projects through to late-stage clinical candidates - but not marketed products such as Reyataz (atazanavir), Evotaz (atazanavir/cobicistat), Sustiva (efavirenz) and big-selling Atripla (efavirenz, emtricitabine, and tenofovir).
ViiV is a joint venture between GlaxoSmithKline, Pfizer and Shionogi and is currently the second-biggest player in HIV therapies after Gilead Sciences with a market share of around 20%, well behind its rival which dominates the market.
In a statement, GSK said ViiV would pay BMS $317m upfront for the late-stage HIV portfolio, plus $518m dependent on development and commercial milestones. It will also pay the US pharma group $33m upfront for the early-stage candidates, plus another $587m in milestones.
The late-stage assets include attachment inhibitor fostemsavir, in phase III development for heavily pre-treated patients with filings for approval expected in 2018, along with lead maturation inhibitor BMS-955176 and back-up candidate BMS-986173.
The early-stage portfolio features a novel biologic therapy called BMS-986197 with a triple mechanism of action, another maturation inhibitor, an allosteric integrase inhibitor and a capsid inhibitor.
ViiV's chairman and chief strategy officer David Redfern said: "The addition of two potential first-in-class late-stage treatments and several promising early clinical development programmes strengthens ViiV's pipeline and provides us with further new opportunities for growth."
The move ties in with an ongoing trend among pharma companies to divest assets in order to focus on a handful of core therapeutic categories, as seen in Sanofi and Boehringer Ingelheim's recently-announced asset swap and similar deals including one involving GSK and Novartis which closed earlier this year.
GSK shelved earlier plans to float ViiV as an independent company earlier this year, however, after seeing surging sales of blockbuster-in-waiting Triumeq (dolutegravir, lamivudine and abacavir). The move was welcomed by analysts who said the unit gave GSK a stronger balance sheet. ViiV's sales increased 56% in the first nine months of the year to £1.63bn ($2.4bn).
BMS had previously announced its intention to call a halt to early-stage R&D in virology, and said 20 workers would transfer to GSK as a consequence of the new agreement, which is due to close in mid-2016. | 2023-09-28T01:26:29.851802 | https://example.com/article/2045 |
Q:
InvalidOperationException by using Rhino mocks and databinding
I'm writing some unit tests for a class (in example called ClassUnderTest) which has a property binding to a property from its model. As the model is defined with a interface (IModel), the model is mocked by a Rhino Mocks mock.
Sample code:
Interface for Model:
public interface IModel : INotifyPropertyChanged
{
event PropertyChangedEventHandler PropertyChanged;
int SourceValue { get; set; }
}
class which shall be tested:
public class ClassUnderTest : DependencyObject
{
private IModel model;
public int TargetValue
{
get { return (int)GetValue(TargetValueProperty); }
set { SetValue(TargetValueProperty, value); }
}
public static readonly DependencyProperty TargetValueProperty = DependencyProperty.Register("TargetValue", typeof(int), typeof(ClassUnderTest), new PropertyMetadata(0));
public ClassUnderTest(IModel model)
{
this.model = model;
var b = new Binding("SourceValue") { Source = this.model, Mode = BindingMode.OneWay };
BindingOperations.SetBinding(this, TargetValueProperty, b);
}
}
Unit test method:
[TestMethod]
public void TestMethod()
{
var repo = new MockRepository();
var modelMock = repo.StrictMock<IModel>();
const int expectedValue = 4;
IEventRaiser propertyChanged;
using (repo.Record())
{
propertyChanged = Expect.Call(delegate { modelMock.PropertyChanged += null; }).IgnoreArguments().GetEventRaiser();
Expect.Call(() => modelMock.PropertyChanged -= null).Constraints(Is.NotNull()).Repeat.Any();
Expect.Call(modelMock.SourceValue).Return(expectedValue).Repeat.Any();
}
using (repo.Playback())
{
var cuT = new ClassUnderTest(modelMock);
propertyChanged.Raise(modelMock, new PropertyChangedEventArgs("SourceValue"));
Assert.AreEqual(expectedValue, cuT.TargetValue);
}
}
Running the test method, all works fine. Raising the property changed event on the model mock provokes a change in the ClassUnderTest class too.
The problem I have now is only observed in debug mode. At the end of the test I get a
InvalidOperationException:
This action is invalid when the mock object is in verified state.:
at Rhino.Mocks.Impl.VerifiedMockState.MethodCall(IInvocation invocation, MethodInfo method, Object[] args)
at Rhino.Mocks.MockRepository.MethodCall(IInvocation invocation, Object proxy, MethodInfo method, Object[] args)
at Rhino.Mocks.Impl.RhinoInterceptor.Intercept(IInvocation invocation)
at Castle.DynamicProxy.AbstractInvocation.Proceed()
at IModelProxy2856c01157e54c29a4a7328a5a7ef52a.remove_PropertyChanged(PropertyChangedEventHandler value)
at System.ComponentModel.PropertyChangedEventManager.StopListening(Object source)
at System.ComponentModel.PropertyChangedEventManager.Purge(Object source, Object data, Boolean purgeAll)
at MS.Internal.WeakEventTable.Purge(Boolean purgeAll)
at MS.Internal.WeakEventTable.WeakEventTableShutDownListener.OnShutDown(Object target, Object sender, EventArgs e)
at MS.Internal.ShutDownListener.HandleShutDown(Object sender, EventArgs e)
As I understand this is because the binding provokes a un-subscription by disposing all the objects at the end of the test, but the mock is already in the verify-state and doesn't allow any interaction anymore.
So here my QUESTION: Is there a way to avoid this exception, or the un-subscription. Or I'am using the Rhino Mocks in incorrect manner?
Thanks for helping
A:
Did you try this:
using (repo.Playback())
{
using (var cuT = new ClassUnderTest(modelMock))
{
propertyChanged.Raise(modelMock, new PropertyChangedEventArgs("SourceValue"));
Assert.AreEqual(expectedValue, cuT.TargetValue);
}
}
| 2024-01-11T01:26:29.851802 | https://example.com/article/6992 |
The Korean capital is spreading its best ideas across the world
The Seoul Metropolitan Government announced last year a three-year plan to lead an effort to connect cities and local governments throughout the world to share best practices on global issues. In this three-part series, the Korea JoongAng Daily follows the Seoul city government to destinations abroad as it makes new contacts and looks at the work of some international organizations in Seoul. -Ed.
Seoul Mayor Park Won-soon is often cited as one of the most innovative mayors in the world.
“Innovation and Seoul — it’s not hard to make a connection between the two words these days,” said Park, who began his third term in office this year.
In a recent article, the magazine Monocle likened Park to Luka Modric on a soccer field, a midfielder who is a “sensible yet creative distributor at the centre of everything.”
The Guardian called Park one of the world’s top five innovative mayors in 2015, alongside former mayors Klaus Wowereit of Berlin, Bertrand Delanoë of Paris, Michael Bloomberg of New York and Sergio Fajardo of Medellin. A year later, Japanese public broadcaster NHK included Park in its list of the world’s top four innovative mayors.
Park says the global attention lavished on Seoul has a lot to do with the administration’s city-to-city diplomacy.
“The big factor that led to this image of Seoul as an innovative city is the city-to-city diplomacy that I have been pursuing since the beginning of my tenure,” Park said. “After I was sworn in as mayor, the city government established the Global Urban Partnership Division and the Seoul Urban Solutions Agency to export Seoul’s innovative solutions to other cities.”
Seoul has exported 65 of its policies to 52 other cities in 31 countries since 2006, and 80 percent of these occurred during Park’s tenure. They range from best practices and systems on public transportation, water works, e-government and city planning to environment and disaster relief.
The Seoul city government announced a three-year city diplomacy plan last year. It includes a plan to expand its ties with other cities to export Seoul’s best practices and become a hub for international organizations.
The following is an excerpt from an interview with Park on his visions and objectives for Seoul’s diplomacy with cities and regions around the world.
Q. What is your vision for Seoul’s city-to-city diplomacy?
A. I think it can be summed up by what Benjamin Barber once said — “Presidents pontificate principle; mayors pick up the garbage.” That’s city-to-city diplomacy in one sentence. The global challenges we face today — climate change, natural disasters, air pollution and inequality in societies — are evolving to be ever more complex. Solutions often require a united effort from cities and governments. But there are limits to country-to-country diplomacy because of the various ideological, political and national interests of each country.
Cities are different. Cities can put efficiency and practicality before other interests. The administration at the city government level can be more flexible and can plan its actions mainly based on the current and future well-being of its residents. And for this, cities can work together through various city-to-city networks.
This is why I expanded the role of Seoul city government in practicing diplomacy, a role that was traditionally considered limited to central government, to move beyond signing friendship accords and co-hosting events to sharing best practices and policies with other cities. As of this year, we’ve exported 65 policies to 52 cities in 31 countries.
We are, in a sense, exporting Seoul.
What may be a necessary next step for Seoul’s successful city diplomacy?
We are hoping to establish an agency within the city government that will solely focus on diplomatic ties with other cities and local governments around the world. But such a plan will have to be approved by the central government before it can be executed, because the creation of a new division or agency in the city government requires the central government’s involvement.
The laws will have to change to allow more independence for local governments to manage bureaus and departments to allow the Seoul city government more freedom and jurisdiction in its city diplomacy.
How does Seoul coordinate with the Ministry of Foreign Affairs regarding its diplomatic activities?
The ministry deploys an ambassador to the city government every year to be the bridge between the city government and the ministry to coordinate foreign policies between the two bodies. The city government communicates its foreign policy plans to the ministry via the ambassador. Twice a year the ministry hosts a meeting of such ambassadors, each stationed in a local government, to discuss the directions and needs in foreign policymaking processes of local governments in the country.
This Foreign Ministry practice has been around since 1992. This year’s ambassador at the Seoul city government is Yim Geun-hyeong.
Do you intend to turn Seoul into a hub of international organizations?
The presence of international organizations in a city is a barometer to measure a city’s international standing. Take a look at New York, Geneva and Vienna — all cities with clusters of international organizations. They are all cities that are open to new ideas and developments and are friendly to foreigners. This is what Seoul is aiming for — to be a city that foreigners want to invest in and want to live in.
There are currently 30 international organizations in Seoul, 17 of which have been established during my time in office. I intend to attract more international bodies into Seoul, but the focus will not necessarily be on quantity. We are hoping to attract international organizations of excellent quality.
For this, Seoul will continue to lead through organizations where it is a president city — the World Smart Sustainable Cities Organization, Citynet and Global Social Economy Forum. We will also expand spaces in the city friendly for international organizations in addition to current venues like the Seoul Global Center building and Seoul Innovation Park.
What are some of the more popular policies of Seoul among those exported?
More than half of the policies exported concern public transportation, including railroads. Many cities know now that Seoul’s e-government is No.1 and has been for the past 14 years.
The use of a big-data system in my office to deliver information on disasters and accidents in the city in real-time is also popular among cities.
Seoul’s smart city development policies have also gained a lot of attention after the city was awarded the Lee Kuan Yew World City Prize this year.
Seoul was awarded the Lee Kuan Yew World City Prize this year for its citizen-inclusive development projects. What are some other urban development projects you have in mind?
In Seoul today, citizens are at the center of projects as small as building a playground in a residential area to as big as establishing the foundational principles of city planning.
In the past, Seoul has been plagued by repeating its mistakes in urban development — namely, renovating areas by completely demolishing structures and rebuilding anew. Incorporating citizens’ voices in development projects is a necessary step to prevent this type of renovation. I am glad that Seoul’s citizen-inclusive policies have been acknowledged internationally through the awarding of the Lee Kuan Yew World City Prize.
Seoul has recently concluded urban development projects like the Seoullo 7017 overpass park, the renovated Sewoon Plaza, Gyeongchun Line railway park and the Oil Reservoir Culture Park in Mapo [in western Seoul]. It is continuing 133 other projects throughout the city to renovate and develop the city.
Seoul will continue to plan urban renovation projects with the residents at the center of it all. We will try to ensure that economic activities and profits from the redevelopment projects benefit the people directly.
This is your third term in office and seventh year as mayor of Seoul. How do you think the world’s perception of Seoul has changed from when you began your tenure?
I hear more often that Seoul is an innovative city. Innovation and Seoul — it’s not hard to make a connection between the two words these days.
The New York Times wrote a piece about how Silicon Valley should learn from Seoul, and the Nation wrote about how cities including Seoul can be “beacons of pluralism” to counter nationalist movements like the one driven by U.S. President Donald Trump.
I think the biggest factor that led to this image of Seoul as an innovative city is the city-to-city diplomacy that I have been pursuing since the beginning of my tenure.
After I was sworn in as mayor, the city government established the Global Urban Partnership Division and the Seoul Urban Solutions Agency to export Seoul’s innovative solutions to other cities.
Recently I received a letter from the mayor of Chanchamayo in Peru, who expressed his gratitude for six years of cooperation with Seoul that has led to clean water at affordable prices for the people. It’s all a result of the hard work of the city’s government officials.
Did you find any examples of smart city development that could be applied in Seoul during your recent trip to cities in Europe?
One of the examples that stood out for me was the Fab City Global Initiative in Barcelona. The initiative intends to increase the level of self-sufficiency of the city to more than 50 percent by 2054, so the city will produce at least half of everything it needs within the city. At the Fab City lab, we saw how architects and designers were working together to apply innovative solutions in daily production to make the city more sustainable and futuristic. It was an opportunity to meet lots of talented people in the area, including a Korean student who was interning there.
But what struck me the most about the initiative was that an experiment like this was being run on a local level without any government support.
I suggested some innovators at the lab to visit the Seoul Innovation Park as well. Fab labs [local labs for entrepreneurs to experiment with applying digital innovation and technologies to manufacturing] do not have as big a presence in Asia as they do in Europe. I hope to cooperate with stakeholders in Europe to bring this culture into Asia, using Seoul as a hub.
Any plans on the Seoul-Pyongyang diplomacy front?
There was an informal agreement at the third inter-Korean summit that the two Koreas will cooperate on activating exchanges between local governments between the South and the North.
Seoul city government intends to do its best to support the central government in bidding for the 2032 [inter-Korean] Olympic Games. If Chairman Kim Jong-un visits Seoul at the end of the year, the city government will cooperate with the central government for best results.
In possible future cooperation opportunities with Pyongyang, the Seoul city government intends to start with providing solutions on water quality improvement on the Taedong River and reforestation efforts. | 2024-05-28T01:26:29.851802 | https://example.com/article/1041 |
At Serpent Mounds Park on Rice Lake Near Peterborough Ontario (Description and photo courtesy of William Snelling)
I saw (looking west) this tornado on Saturday, August 2, 2003 from the restaurant at Elmhirst Inn, on north shore of Rice Lake. All the others in the restaurant and the kitchen staff saw it too. It happened at 6:30 pm after the rain storm. We saw it for ten minutes. | 2023-09-09T01:26:29.851802 | https://example.com/article/9514 |
Tag Archives: red sox broadcaster
With more details about the confrontation between Dennis Eckersley and David Price emerging, some are wondering who’s in charge in the front office. The Red Sox management is suffering from a credibility problem. Reports about the lack of respect John Farrell gets have circulated for months. It didn’t seem like anyone could control Pablo Sandoval at all. Sandoval did want he wanted when he wanted.
With new details about the Eckersley and Price confrontation comes questions about where Red Sox management was in all this? Anyone Red Sox fan worth his salt knows who Dennis Eckersley is. A former Cy Young Winner, MVP, and Baseball Hall of Famer, Eckersley currently works as a broadcaster with the Red Sox. Eckersley recently made comments about Price’s pitching in a game a few weeks back and Price took issue. Using taunts and “F” bombs, Price slammed Eckersley.
First of all, who does Price think he is? Eckersley called him out for not covering first base in a game a few weeks back and he was absolutely right to do so. Price messed up and Eckersley called him out for it. So instead of learning a lesson, he decided to insult a Hall of Famer because he thought that’s how he’d retain his dignity.
Classy.
By the way, Dennis Eckersley is also a recovering alcoholic who has endured more pain in his life than most ballplayers have. Price probably knows this, and still acted like a self-entitled jerk towards him. But what about Red Sox management? Why’d they let Price get away with this?
Red Sox Management Could Learn A Few Things About Leadership
Years ago I was teaching at an all-boys military school down in Virginia. Veterans of the Marines, Army, and other branches of the military taught there. One day during lunch a former solider told me a story about what it means to command. He was telling me about a video that went viral showing a man dressed in a Sergeant Major’s dress uniform attending a funeral. He clearly wasn’t in the Army, but he was pretending to be for attention. In the video, three real Army soldiers asked the impersonating Sergeant Major where he’d served and what medals he’d earned. The soldiers wanted to make an example of the impersonator. The poorly groomed uniform, or the way the impersonator stood, wasn’t what gave it away though.
What gave him away was the way the impersonator handled the questions. “A real Sergeant Major would NEVER put up with that kind of questioning. If he had been real, he would have reamed out those soldiers for even questioning him.” In other words, a real leader doesn’t let subordinates push him around.
But that’s exactly what’s happening to Dave Dombrowski and John Farrell. David Price confronts a Hall of Famer and nothing’s really done about it. Why didn’t Farrell confront Price immediately and demand he apologize to Eckersley? Yes, it’s childish, but that’s exactly how Price acted.
Dombrowski and Farrell need to step up their aggressive leadership. They’re getting pushed around and the rest of the team is suffering for it. | 2024-02-28T01:26:29.851802 | https://example.com/article/1383 |
Rugby players have near enough doubled in size over the last 30 years.
They now have impressive physiques, REALLY impressive.
Not only are rugby players big but in general but they are lean. This takes a lot of hard work and especially a focus on rugby training and rugby fitness sessions.
12 ripped rugby players:
1. Sonny Bill Williams
Sonny Bill is an undeniable beast and not only is he a force on the rugby field he is also a heavyweight boxer with a 6-0 record with three wins by knock out. His last fight was in Feb of 2013 but he has postponed his boxing career to focus on rugby.
He was formerly the New Zealand Professional Boxing Association Heavyweight Champion and World Boxing Association (WBA) International Heavyweight Champion. He can also bench 310lbs for 3 reps. Long story short there isn’t much Sonny Bill can’t do and do well.
2. Pierre Spies
Pierre Spies is a South African Rugby Union player. Spies just may have the most impressive physique on this list. He power cleans 300lbs, deadlifts 530lbs and bench presses 360lbs. He also does pull-ups with an extra 110lbs hanging between his legs. Not to mention the fact that he is totally ripped.
3. Leigh Halfpenny
The Wales fullback isn’t the biggest on the list, not by a long shot. Halfpenny has put on some serious size over the years and is a solid unit on the field. He has a great shape and very lean, women’s choice it seems!
4. George North
Another Welshman known for bulldozing his way through defences, North has made his name by being monstrously strong.
His sheer strength was most notably demonstrated on the 2013 Lions tour to Australia when he picked up Israel Folau and carried him… while the ball was in his hand!
LIST CONTINUES ON PAGE TWO | 2023-08-05T01:26:29.851802 | https://example.com/article/1066 |
Characteristics:1) The press is available up to 2000 Ton capacity as per customer's individual specifications and requirements. Each press is designed through Finite Element Structural Analysis and optimization to assure high strength and rigidity. High capacity press is preferred in H Frame structure.2) The press is equipped with advanced and systemized Taiwan hydraulic system featuring oil leakage resistance, anti-vibration, low energy consumption, low noise level and easy maintenance.3) Eight sides of brass guide rails of full stroke length not only ensure high accuracy but also allow easy adjustment of slide leveling.4) The press fully meets CE safety requirements. Two side locking cylinders lock the slide when it reaches top position. And two sets of light curtain sensors are fitted in the front and rear that will stop the machine when human body carelessly enters the working area.5) Mitsubishi PLC and 7 / 10 inch Taiwan Weinview touch screen make the machine easy for operation and specification adjustable.6) Each press is manufactured under strict quality control management with good quality components from France, Japan, Germany, USA and Taiwan to assure the best performance and accuracy. H Frame deep drawing press has been awarded with CE Certificate. | 2024-04-14T01:26:29.851802 | https://example.com/article/4505 |
Q:
Is `std::normal_distribution` guaranteed to be ok with standard deviation 0?
In the gcc implementation this works trivially; the parameters are only applied as simple multiply and shift of the actual algorithm's output. But I could imagine other algorithms to have problems with a special case like this. Should I better build in an external safe-guard, or is it fine to just give std::normal_distribution's constructor a 0 as the standard deviation parameter to get a "non-random distribution", i.e. one that always yields the mean value?
(Performance aside)
A:
The standard says the following (§26.5.8.4.4):
explicit normal_distribution(RealType mean = 0.0, RealType stddev = 1.0);
Requires: 0 < stddev.
As such a standard derivation of 0 is explicitly forbidden by the standard and therefore not guaranteed to work. Therefore building an external safeguard seems like a good idea
Even if the typical implemention would work on a standard derivation of 0 (not sure if that is the case), I could imagine an implementation which tests for such a case and throws an exception when the standard derivation is zero and throws an exception if it is not (to ensure that the code is portable). As an alternative it is possible that the code will divide by the standard derivation somewhere, which would also be problematic with a derivation of 0.
A:
You can't use a standard deviation of 0. From the standard, section 26.5.8.5.1:
explicit normal_distribution(RealType mean = 0.0, RealType stddev = 1.0);
Requires: 0 < stddev.
Using a value of 0 would result in undefined behavior, so you'll need to special-case that value.
| 2024-05-03T01:26:29.851802 | https://example.com/article/2512 |
<!-- Generated by pkgdown: do not edit by hand -->
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Locks the operating system (Windows) through a shell command — os.lock • installr</title>
<!-- jquery -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js" integrity="sha256-FgpCb/KJQlLNfOu91ta32o/NMZxltwRo8QtmkMRdAu8=" crossorigin="anonymous"></script>
<!-- Bootstrap -->
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap.min.css" integrity="sha256-916EbMg70RQy9LHiGkXzG8hSg9EdNy97GazNG/aiY1w=" crossorigin="anonymous" />
<script src="https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/js/bootstrap.min.js" integrity="sha256-U5ZEeKfGNOja007MMD3YBI0A3OSZOQbeG6z2f2Y0hu8=" crossorigin="anonymous"></script>
<!-- Font Awesome icons -->
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.7.0/css/font-awesome.min.css" integrity="sha256-eZrrJcwDc/3uDhsdt61sL2oOBY362qM3lon1gyExkL0=" crossorigin="anonymous" />
<!-- clipboard.js -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/clipboard.js/2.0.4/clipboard.min.js" integrity="sha256-FiZwavyI2V6+EXO1U+xzLG3IKldpiTFf3153ea9zikQ=" crossorigin="anonymous"></script>
<!-- sticky kit -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/sticky-kit/1.1.3/sticky-kit.min.js" integrity="sha256-c4Rlo1ZozqTPE2RLuvbusY3+SU1pQaJC0TjuhygMipw=" crossorigin="anonymous"></script>
<!-- pkgdown -->
<link href="../pkgdown.css" rel="stylesheet">
<script src="../pkgdown.js"></script>
<meta property="og:title" content="Locks the operating system (Windows) through a shell command — os.lock" />
<meta property="og:description" content="This locks Windows after set amount of time." />
<meta name="twitter:card" content="summary" />
<!-- mathjax -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js" integrity="sha256-nvJJv9wWKEm88qvoQl9ekL2J+k/RWIsaSScxxlsrv8k=" crossorigin="anonymous"></script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/config/TeX-AMS-MML_HTMLorMML.js" integrity="sha256-84DKXVJXs0/F8OTMzX4UR909+jtl4G7SPypPavF+GfA=" crossorigin="anonymous"></script>
<!--[if lt IE 9]>
<script src="https://oss.maxcdn.com/html5shiv/3.7.3/html5shiv.min.js"></script>
<script src="https://oss.maxcdn.com/respond/1.4.2/respond.min.js"></script>
<![endif]-->
</head>
<body>
<div class="container template-reference-topic">
<header>
<div class="navbar navbar-default navbar-fixed-top" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle collapsed" data-toggle="collapse" data-target="#navbar" aria-expanded="false">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<span class="navbar-brand">
<a class="navbar-link" href="../index.html">installr</a>
<span class="version label label-default" data-toggle="tooltip" data-placement="bottom" title="Released version">0.22.0</span>
</span>
</div>
<div id="navbar" class="navbar-collapse collapse">
<ul class="nav navbar-nav">
<li>
<a href="../index.html">
<span class="fa fa-home fa-lg"></span>
</a>
</li>
<li>
<a href="../reference/index.html">Reference</a>
</li>
<li>
<a href="../news/index.html">Changelog</a>
</li>
</ul>
<ul class="nav navbar-nav navbar-right">
<li>
<a href="https://github.com/talgalili/installr">
<span class="fa fa-github fa-lg"></span>
</a>
</li>
</ul>
</div><!--/.nav-collapse -->
</div><!--/.container -->
</div><!--/.navbar -->
</header>
<div class="row">
<div class="col-md-9 contents">
<div class="page-header">
<h1>Locks the operating system (Windows) through a shell command</h1>
<small class="dont-index">Source: <a href='https://github.com/talgalili/installr/blob/master/R/os.manage.R'><code>R/os.manage.R</code></a></small>
<div class="hidden name"><code>os.lock.Rd</code></div>
</div>
<div class="ref-description">
<p>This locks Windows after set amount of time.</p>
</div>
<pre class="usage"><span class='fu'>os.lock</span>(<span class='kw'>s</span> <span class='kw'>=</span> <span class='fl'>0</span>, <span class='kw'>m</span> <span class='kw'>=</span> <span class='fl'>0</span>, <span class='kw'>h</span> <span class='kw'>=</span> <span class='fl'>0</span>)</pre>
<h2 class="hasAnchor" id="arguments"><a class="anchor" href="#arguments"></a>Arguments</h2>
<table class="ref-arguments">
<colgroup><col class="name" /><col class="desc" /></colgroup>
<tr>
<th>s</th>
<td><p>time to wait before shutting down (in seconds), added to m and h; passed to <code><a href='https://www.rdocumentation.org/packages/base/topics/Sys.sleep'>Sys.sleep</a></code></p></td>
</tr>
<tr>
<th>m</th>
<td><p>time to wait before shutting down (in minutes), added to s and h; passed to <code><a href='https://www.rdocumentation.org/packages/base/topics/Sys.sleep'>Sys.sleep</a></code></p></td>
</tr>
<tr>
<th>h</th>
<td><p>time to wait before shutting down (in hours), added to s and m; passed to <code><a href='https://www.rdocumentation.org/packages/base/topics/Sys.sleep'>Sys.sleep</a></code></p></td>
</tr>
</table>
<h2 class="hasAnchor" id="value"><a class="anchor" href="#value"></a>Value</h2>
<p>The status code of <code><a href='https://www.rdocumentation.org/packages/base/topics/shell'>shell</a></code>.</p>
<h2 class="hasAnchor" id="references"><a class="anchor" href="#references"></a>References</h2>
<p><a href='http://superuser.com/questions/42124/how-can-i-put-the-computer-to-sleep-from-command-prompt-run-menu'>http://superuser.com/questions/42124/how-can-i-put-the-computer-to-sleep-from-command-prompt-run-menu</a> , <a href='http://www.howtogeek.com/howto/windows-vista/quick-tip-create-shutdown-restart-lock-icons-in-windows-vista/'>http://www.howtogeek.com/howto/windows-vista/quick-tip-create-shutdown-restart-lock-icons-in-windows-vista/</a></p>
<h2 class="hasAnchor" id="see-also"><a class="anchor" href="#see-also"></a>See also</h2>
<div class='dont-index'><p><code><a href='https://www.rdocumentation.org/packages/base/topics/system'>system</a></code>,<code><a href='https://www.rdocumentation.org/packages/base/topics/shell'>shell</a></code>, <code><a href='https://www.rdocumentation.org/packages/base/topics/Sys.sleep'>Sys.sleep</a></code>,
<code><a href='is.windows.html'>is.windows</a></code>, <code><a href='os.shutdown.html'>os.shutdown</a></code>, <code><a href='os.sleep.html'>os.sleep</a></code>, <code><a href='os.hibernate.html'>os.hibernate</a></code>, <code>os.lock</code>, <code><a href='os.restart.html'>os.restart</a></code></p></div>
<h2 class="hasAnchor" id="examples"><a class="anchor" href="#examples"></a>Examples</h2>
<pre class="examples"><span class='co'># NOT RUN {</span>
<span class='co'>## when your code is extremely time-consuming, </span>
<span class='co'># you may need this function to run at the</span>
<span class='co'># end of the simulation.</span>
<span class='fu'>os.lock</span>()
<span class='co'># }</span></pre>
</div>
<div class="col-md-3 hidden-xs hidden-sm" id="sidebar">
<h2>Contents</h2>
<ul class="nav nav-pills nav-stacked">
<li><a href="#arguments">Arguments</a></li>
<li><a href="#value">Value</a></li>
<li><a href="#references">References</a></li>
<li><a href="#see-also">See also</a></li>
<li><a href="#examples">Examples</a></li>
</ul>
<h2>Author</h2>
<p>Tal Galili</p>
</div>
</div>
<footer>
<div class="copyright">
<p>Developed by Tal Galili.</p>
</div>
<div class="pkgdown">
<p>Site built with <a href="https://pkgdown.r-lib.org/">pkgdown</a> 1.3.0.</p>
</div>
</footer>
</div>
</body>
</html>
| 2024-04-13T01:26:29.851802 | https://example.com/article/3290 |
The tech sector is heavily run by men — sometimes, men who seem blind to the potential dangers of their innovations. Now, in a move that seems to confirm this stereotype, Facebook has come up with a solution to one of its many PR crises—the rise of revenge porn on the platform. To combat this problem, Facebook is proposing that women upload nude selfies preemptively to their websites so that bots can block their exes from posting similar images.
Perhaps sensing the eyebrows raising from this announcement, Facebook sent out a flock of female media relations staffers to defend its anti-revenge porn system.
“It would be like sending yourself your image in email, but obviously this is a much safer, secure end-to-end way of sending the image without sending it through the ether,” online safety commissioner Julie Inman Grant told ABC. An even higher-up employee, Antigone Davis, Facebook’s head of global safety, further assured users that “the safety and well-being of the Facebook community is our top priority.” Uh huh. Sure.
The idea is that women would snap nude selfies and upload them to Facebook Messager, which would then use AI technology to create a digital copyright of their naked bodies. That would automatically block a different user from posting a photo of the same body. It’s the same concept as fingerprinting at birth…except way more invasive. It sounds like a poor plan, especially at a time when users have less trust than ever in technology’s ability to protect their privacy. Leaked nude photos afflict celebrities and normal folks alike, and hackers who access supposedly secure information are a regular feature in our news cycle, so why on earth should Facebook users be expected to happily hand over even more of their private lives?
Facebook is piloting the technology in Australia, where Inman assured the Australian Broadcasting Corporation that users shouldn’t worry about their nude selfies winding up in Facebook’s cloud. “They’re not storing the image. They’re storing the link and using artificial intelligence and other photo-matching technologies. So if somebody tried to upload that same image, which would have the same digital footprint or hash value, it will be prevented from being uploaded.”
Facebook has come under particular pressure in recent months to tackle the problem of users posting explicit images of women online without their consent. The most publicized case was the all-male Facebook group United Marines, which was found in March 2017 to have harvested hundreds of photos of female Marines and veterans. The men would regularly leave lewd messages in the comments, like the Marine who commented on one woman’s photo that he’d like to “take her out back and pound her out.”
It’s a major problem for civilians, too—10% of American internet users under age 30 have been victims of revenge porn or online harassment. In recent years, multiple women have sued Facebook for failing to promptly take down nude images that were posted without their consent.
As Slate’s April Glaser writes, it’s pretty tone-deaf of Facebook to ask victims of revenge porn to upload more nude photos of themselves. “When a naked photo of a person is circulated without her consent, it can be ruinous emotionally and professionally. Requesting that women relive that trauma and trust Facebook, of all companies, to hold that photo in safekeeping is a big ask.”
Surely there must be other ways to prevent revenge porn on social media—heavier community monitoring by humans, perhaps, or a system to automatically flag users whenever they upload photos that contain nudity? Just some thoughts.
Whether Facebook's anti-revenge porn initiative will succeed depends on an ethical question for the 21st century: do women today trust anonymous AI technology more than they trust the shady men to whom they send nude photos in the first place? | 2024-06-19T01:26:29.851802 | https://example.com/article/1758 |
---
abstract: 'In this paper we aim to tackle the problem of reconstructing a high-resolution image from a single low-resolution input image, known as single image super-resolution. In the literature, sparse representation has been used to address this problem, where it is assumed that both low-resolution and high-resolution images share the same sparse representation over a pair of coupled jointly trained dictionaries. This assumption enables us to use the compressed sensing theory to find the jointly sparse representation via the low-resolution image and then use it to recover the high-resolution image. However, sparse representation of a signal over a known dictionary is an ill-posed, combinatorial optimization problem. Here we propose an algorithm that adopts the smoothed $l_0$-norm (SL0) approach to find the jointly sparse representation. Improved quality of the reconstructed image is obtained for most images in terms of both peak signal-to-noise-ratio (PSNR) and structural similarity (SSIM) measures.'
author:
-
-
bibliography:
- 'ref.bib'
title: 'Image Super-Resolution Based on Sparsity Prior via Smoothed $l_0$ Norm'
---
Inverse problem, image super-resolution, sparse representation, and smoothed $l_0$ norm .
INTRODUCTION
============
Image super-resolution provides a low cost, software-based technique to improve the spatial resolution of an image beyond the limitations of the imaging hardware devices. The areas of application include medical imaging [@101] and satellite imaging [@102] and high-definition television (HDTV). In such cases, it is standard to assume that the observed low-resolution image(s) is a blurred and downsampled version of the high-resolution image. The goal is then to recover the high-resolution image using its low-resolution observation(s). Meanwhile, with the growing capabilities of high-resolution displays, effective image super-resolution algorithms is essential for us to make the best use of such devices.
The most typical super-resolution methods require multiple low-resolution images, with sub-pixel accuracy alignment. In this approach super-resolution can be considered as an inverse problem, where it is essential to assume a prior on the solution to regularize the ill-posed nature of the problem and avoid infinitely many solutions [@103; @104].
In some applications, the number of low-resolution images is limited and it is desired to reconstruct the high resolution image from a single low-resolution image. One approach to overcome this limitation is to use interpolation methods [@106; @107; @108], where unknown pixels of the high-resolution image are estimated using nearby known pixels from the low-resolution image based on some assumptions on the relation between pixels. Simple interpolation methods such as bilinear and bicubic interpolations result in blued images with ringing artifacts near edges. While more advanced methods [@107; @108] try to avoid this problem by exploiting natural image priors, they are often limited in accounting for the complexity of images which have regions with fine textures or smooth shadings. As a result, watercolor-like artifacts are often observed in some regions.
A more successful class of methods for single input image super-resolution are learning based methods. Here a co-occurrence prior between the high-resolution and low-resolution images is used to reconstruct the high-resolution image [@109; @110; @111; @30]. The learning procedure has been done via different schemes such as Markov Random Field (MRF), Primal Sketch and Locally Linear Embedding (LLE) [@109; @110; @111]. These algorithms require enormous databases to handle the learning stage and thus are computationally expensive. One of the recently developed successful methods [@30] uses sparsity as the co-occurrence prior between the high-resolution and low-resolution images. This approach reduces the size of the training database and consequently the computational load. In this method it is assumed that both images share the same sparse representation over a pair of jointly trained dictionaries. Using this assumption we can find the jointly sparse representation via the low-resolution image and then use it to recover the high-resolution image. Finding the jointly sparse representation properly, is important and influences the quality of the reconstruction result. In the current paper our intention is to improve the performance of this algorithm to find the jointly sparse representation more accurately and thus to improve the quality of the reconstructed high-resolution image.
Sparse representation of a vector over a known dictionary is an ill-posed, combinatorial optimization problem [@4]. Several relaxation approaches have been used to convexify this problem. The most common approaches are Matching Pursuit (MP)[@114], Basis Pursuit (BP) [@45], and Focal Underdetermined System Solution (FOCUSS) [@115]. In this paper, we adopt a recently proposed Smoothed $l_0$-norm (SL)) algorithm [@112], a faster solver for sparse representation, to lessen the computational load and to improve the quality of the reconstructed high-resolution image.
The rest of the paper is organized as follows. In section II, we briefly present the approach that is used to decompose a signal on an overcomplete dictionary. Section III is devoted to the super-resolution algorithm and its alternation. Section VI summarizes experimental results. The paper is finally concluded in section V.
SPARSE REPRESENTATION VIA SMOOTHED $l_0$ NORM
=============================================
Finding the sparsest representation of a source signal over an overcomplete dictionary is formulated under the topic of compressed sensing (CS) theory [@4; @13]. Let ${{\bf x}}\in
\mathbb{R}^n$ be the source signal, and $D \in \mathbb{R}^{m \times
n}$ the dictionary ($n>m$). Our goal is to find the sparsest solution of the following linear system: $$\label{1}
{{\bf x}}= D \alpha,$$ where $\alpha \in \mathbb(R)^m$. The recovery of $\alpha$ from ${{\bf x}}$ based on is impossible to implement in a unique and stable way, unless it is known that $\alpha$ is sparse enough to have a relatively low value of $\|\alpha\|_0$ [@4]. This assumption is only valid if the dictionary is chosen or learned properly. Several algorithms have been provided to design such dictionaries [@116; @117; @118].
Equivalently can be formulated as the following optimization problem: $$\label{2}
(P_0)\hspace{5mm}\min\|\alpha\|_0,\hspace{3mm} \text{s.t.}
\hspace{3mm} {{\bf x}}=D\alpha$$ Due to the highly nonconvex nature of $l_0$-norm, this problem is ill-posed and intractable. In conventional CS theory [@4; @13] it is proven that if the dictionary $D$ satisfies the restricted isometry property (RIP) [@4; @13] with respect to a certain class of sparse signals to which $\alpha$ is assumed to belong, then $\alpha$ can be recovered as a solution to [@20; @21] $$\label{3}
(P_1)\hspace{5mm}\min\|\alpha\|_1,\hspace{3mm} \text{s.t.}
\hspace{3mm} {{\bf x}}=D\alpha$$ which is a convex minimization problem. It is straightforward to reformulate this equivalent problem in terms of linear programming. This approach results in a tractable problem but is still time-consuming for large scale systems. It is also important to note that the equivalence between $l_0$-norm and $l_1$-norm is only valid asymptotically and does not always hold [@113]. In a different approach, the $l_0$-norm is approximated directly by a smooth convex function [@112]. This approach has proved to be faster with possibility of resulting in sparser representation [@112].
Consider the smooth function, $f_{\sigma}(x)=e^{-x^2/\sigma^2}$. As $\sigma$ approaches zero, we have the following equivalence: $$\label{4}
\|{{\bf x}}\|_0=n-\sum_{i=0}^n \lim_{\sigma \to
0^+}f_{\sigma}(x_i)=n-\sum_{i=0}^n f_{0^+}(x_i)$$ This equivalence does not help us in practice. However, one can assume that if $\sigma$ is set to be nonzero and sufficiently small then we can approximate the $l_0$-norm of a vector by $$\label{5}
\|{{\bf x}}\|_0\approx n-\sum_{i=0}^n f_{\sigma}(x_i)$$ This enables us to approximate the $l_0$-norm with a smooth, differentiable function. This is the key fact that enables us to replace the $l_0$-norm minimization with a convex problem, so that we can take advantage of common techniques, such as steepest descent, to tackle the optimization problem. The value of $\sigma$ controls the trade-off between the closeness to the $l_0$-norm and the smoothness of the approximation. Now if we define $F_{\sigma}({{\bf x}})=\sum_{i=0}^n f_{\sigma}(x_i)$, then the minimization of $\|{{\bf x}}\|_0$ can be done by maximizing $F_{\sigma}$ by choosing a proper value for $\sigma$. Due to the nonconvex nature of the $l_0$-norm, $F_{\sigma}$ will archive a lot of local extreme points for small values of $\sigma$. Consequently, finding the global maxima will become difficult. On the other hand, if the value of $\sigma$ is chosen to be sufficiently large, there will be no local maxima [@112] and asymptotically the solution for $\sigma=\infty$ is equivalent to the $l_2$-norm solution. Considering these facts, the authors of [@112] provided Algorithm 1 to solve the optimization problem $P_0$.
1. [*Initialization:*]{}\
a. Choose an arbitrary solution from the feasible set, e.g., the minimum $l_2$-norm solution of $D\alpha={{\bf x}}$, i.e., $\alpha=D^T (DD^T)^{-1}{{\bf x}}$.\
b. Choose a decreasing sequence for $\sigma$, $[\sigma_1,...,\sigma_K]$.
2. [*for $k=1,...,K$:*]{}\
a. Let $\sigma=\sigma_k$.\
b. Maximize the function $F_{\sigma}$ using $L$ iterations of the steepest ascent algorithm and call it $v_k$.
3. [*Final answer is $\alpha=v_K$.*]{}
\[algo1\]
Here, the final estimation of each step is used for the initialization of the next steepest ascent. By a proper selection of the sequence of $\sigma$, we may avoid being trapped in the local maxima. Compared to conventional CS solvers, this algorithms proves to be faster with the possibility of recovering a sparser solution [@112].
IMAGE SUPER-RESOLUTION BASED ON SPARSE REPRESENTATION
=====================================================
Sparse representation has been applied to multiple inverse problems in image processing such as denoising [@28], restoration [@29] and super-resolution [@30; @104]. Generally sparsity is used as a prior on source signal to avoid ill-posed nature of inverse problems. In such applications, there exist a stage, which involves expansion of a source signal over an overcomplete dictionary, sparsely. The output quality of these algorithms depends on the accuracy in finding the sparse representation. In this section, SL0 algorithm is employed in a super-resolution algorithm to improve quality of the output high-resolution image.
Assume that the low-resolution image $\mathbf{Y}$ is produced from a high resolution image $\mathbf{X}$ by $$\mathbf{Y} = SH\mathbf{X} \label{eq:SRprob}$$ where $H$ represents a blurring matrix, and $S$ is a downsampling matrix. The recovered high-resolution output image must be consistent with the low-resolution input image. This problem is highly ill-posed and infinitely many solutions satisfy and are consistent with low-resolution image. To provide a unique solution, local sparsity model maybe applied as a prior. We assume that there exist two dictionaries, $D_l$ and $D_h$, for which each patch of low, $y$, and high, $x$, resolution images can be represented sparsely simultaneously and jointly as follows: $$\begin{split}
x=D_h\alpha\\
y=D_l\alpha
\end{split}
\label{6}$$ These coupled dictionaries are trained simultaneously and jointly over a set of low/high resolution images such that both low/high resolution images result in the same sparse representation coefficients. Having the dictionaries trained, for each patch of our low resolution image we need to calculate the sparse representation. The authors of [@30] used $l_1$-norm minimization method for this propose. Here Algorithm 1 is adopted. Having the sparse representation, calculated using the low-resolution patch, we reconstruct the high resolution image patches using the high resolution dictionary, $D_h$. The patches are chosen to overlap so as to reduce the artifacts in patch boundaries. Next we regularize and merge the patches to produce an entire image using the reconstruction constraint . These procedure can be formulated as the following optimization problems: $$\boldsymbol{\hat{\alpha}}_{ij} =
\underset{\boldsymbol{\alpha}}{\operatorname{argmin}} \;
\mu_{ij}||\boldsymbol{\alpha}||_0 + ||D_l\boldsymbol{\alpha} -
\mathbf{R}_{ij}\mathbf{Y}||^2_2, \label{eq:minmsealpha}$$ $$\hat{\mathbf{X}} = \underset{\mathbf{X}}{\operatorname{argmin}}
\;\; ||\mathbf{X} - \mathbf{X}_0||^2_2 + \lambda
||SH\mathbf{X}-\mathbf{Y}||^2_2, \label{eq:minmseX}$$ where $\mathbf{R}_{ij}$ is a matrix that extracts the ($ij$) block from the image, $D_l \in \mathbb{R}^{m \times n}$ is the dictionary with $n > m$, $\lambda$ is the regularization parameter, $\mathbf{X}_0$ is the image obtained by averaging the blocks obtained using sparse representation, and $\boldsymbol{\alpha}_{ij}$ is the sparse vector of coefficients corresponding to the ($ij$) block of the image. Here, refers to the sparse coding of local image patches with bounded prior, hence building a local model from sparse representations. On the other hand, demands the proximity between the low-resolution image, $\mathbf{Y}$, and the output image $\mathbf{X}$, thus enforcing the global reconstruction constraint. In [@30], $l_1$-norm minimization is used to solve , whereas we use SL0 algorithm to solve this stage. The solution to can be done iteratively using a gradient descent algorithm as follows: $$\begin{split}
\mathbf{X}_{t+1}=\mathbf{X}_t+\nu [H^T S^T (\mathbf{Y})-
SH\mathbf{X}_t+\lambda(\mathbf{X}-\mathbf{X}_0)]
\end{split}
\label{eq:m}$$ where $\mathbf{X}_t$ is the estimation of the high-resolution image after the $t$-th iteration, and $\nu$ is the step size.
The proposed image super-resolution algorithm is summarized in Algorithm 2.
1. *Dictionary Training Phase:* train high/low resolution dictionaries $D_l$, $D_h$, [@30]\
2. *Reconstruction Phase*
- *Sparse coding stage:* use Algorithm 1 to compute\
the representation vectors $\alpha_{ij}$ for all the patches of low resolution image
- *High resolution patches reconstruction:* using the found coefficients, $\alpha_{ij}$, the high resolution patches are reconstructed by multiplying them by$D_{h}$
3. *Global Reconstruction:* merge high-resolution patches by averaging over the overlapped region and then use (10) to result the high resolution image.
Compared to the original algorithm in [@30], reduction in the computational complexity and the possibility of improving the output quality are expected.
EXPERIMENTAL RESULTS
====================
In this section we compare the proposed super-resolution algorithm with bicubic interpolation and the method given in [@30]. The image super resolution methods are tested on various images. To be consistent with [@30], patches of $5 \times 5$ pixels were used on the low resolution image and the scaling factor was set to $2$. Each patch is converted to a vector with length $25$. The trained dictionaries, provided by authors of [@30], with the sizes of $25 \times 1024$ and $100 \times 1024$ for the low and the high resolution dictionaries were used, respectively. To remove artifacts on the patch boundaries we set a overlap of one pixel in the patches.
Fig. 1 and Fig. 2 (subplots (a) and (e)) depict the original Pepper and Barbara images and their corresponding low-resolution versions. In the same figures subplots (b-d) depict reconstructed high-resolution images using the proposed methods. Subplots (f-h) depict the corresponding SSIM maps [@36]. A close look on the reconstructed images, enlarged image regions (subplots (i-l)), and the corresponding SSIM maps shows that while bicubic method works pretty well in smooth regions, significant blurring occurs on edges. The method of [@30] is able to recover the edges better but does not work as well in smooth regions. Compared to [@30] our approach is able to recover the edges and meanwhile it works better in smooth regions. One possible approach for further improving the image quality might be using a combination of bicubic and our approach. The quantitative results for different images reconstructed from different algorithms are shown in Table 1.
\
\
------------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- -- -- --
Image
Bicubic 27.08 32.70 26.34 33.97 26.94 30.84 28.07 33.58 28.50 29.41 35.12 29.49 30.17
Yang et al. 27.15 33.33 26.41 34.00 27.32 30.41 28.41 33.87 29.02 29.60 34.52 29.63 30.31
Proposed 27.13 33.45 26.52 33.97 27.41 30.55 28.68 34.13 29.24 29.67 35.25 29.82 30.49
Bicubic 0.744 0.876 0.700 0.870 0.790 0.869 0.763 0.871 0.857 0.852 0.925 0.877 0.832
Yang et al. 0.747 0.884 0.702 0.873 0.806 0.850 0.765 0.918 0.868 0.857 0.901 0.882 0.837
Proposed 0.746 0.894 0.727 0.886 0.808 0.857 0.770 0.922 0.892 0.861 0.925 0.886 0.847
------------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- ------- -- -- --
------------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -- -- --
Image
Yang et al. 13.79 12.07 12.07 12.07 15.81 13.26 26.90 11.14 13.23 13.95 15.08 12.54 14.33
Proposed 1.48 1.39 1.38 1.39 1.49 1.53 2.87 1.36 1.87 1.44 1.43 1.39 1.67
Time saving 89.3 % 86.2 % 86.2 % 86.2 % 90.6 % 88.5 % 89.3 % 88.1 % 85.9 % 89.7 % 90.5 % 88.9 % 88.3 %
------------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -------- -- -- --
All the high-resolution output images have been compared with their original counterparts in terms of PSNR as well as of the structural similarity index (SSIM) of [@36], which is believed to be a better indicator of perceptual image quality [@100]. It can be observed that the proposed method outperforms the other methods in terms of both SSIM and PSNR in most cases and on average it outperforms both methods.
We have also included execution times for Yang et. al and our approach in Table 2. Comparison of execution times also confirms that our approach is about an order faster than the method in [@30]. This result is expected, SL0 is estimated to be about one to two-order faster than $l_1$-norm based minimization methods.
\
\
CONCLUSION
==========
In this paper, we attempt to take advantage of the SL0 sparse coding solver in order to improve one of the-state-of-the-art single input image super-resolution algorithms based on sparse signal representation. Compared with the method in [@30], our approach significantly reduces computational complexity, and yet improves the output perceptual quality. Our simulations demonstrate the potential of the SL0 algorithm in improving the current image processing algorithms that use sparse coding in one of their stages. In the future, the algorithm maybe further improved by advanced design of the dictionary.
ACKNOWLEDGEMENT {#acknowledgement .unnumbered}
===============
This work was supported in part by the Natural Sciences and Engineering Research Council of Canada and in part by Ontario Early Researcher Award program, which are gratefully acknowledged. The authors would also like to acknowledge Jianchao Yang for providing super-resolution codes.
| 2024-02-25T01:26:29.851802 | https://example.com/article/9345 |
Q:
Splitting CSV text file in Java and entering the data into different fields of class
I have a problem. I am trying to read in a text file containing values separated by spaces (similar to CSV, i think).
I am able to take in the input file, but I don't know how to split it up so that each "value" goes into a different field.
Below, find the section of my code which I have done.
String error = ("Content could not be read. Error loading JFileChooser. Try again.");
String content = null;
JFileChooser chooser = new JFileChooser(); //Displays graphical UI to choose the file
if (chooser.showOpenDialog(null) == JFileChooser.APPROVE_OPTION) {
File selectedFile = chooser.getSelectedFile();
try {
content = new String(Files.readAllBytes(Paths.get(selectedFile.getPath())));
} catch (Exception IOException) {
IOException.printStackTrace();
out.println("Error!");
}
//return values read in from file.
Scanner sc = new Scanner(in);
sc.useDelimiter("[^A-Za-z]+"); //regular expression
//return content for use l8r on in the program...
out.println(content); //test to see if reads in correctly
return content;
} else
return error;
This is a sample input the file will contain:
1 2 50 0 George Paradise_3
1 3 50 0 John Somewhere_4
1 4 50 0 Jane Devil’s_place_3
2 50 60 0 George Paradise_13
2 50 60 0 John Somewhere_14
2 60 60 0 Jane Devil’s_place_13
3 10 10 50 0 George Paradise_23
3 15 20 40 0 John Somewhere_24
3 20 30 55 0 Jane Devil’s_place_23
Any help is much appreciated.
Thank you!
A:
I would read the file with a BufferedReader instead of loading the whole content into a string:
File selectedFile = chooser.getSelectedFile();
try (InputStream stream = new FileInputStream(selectedFile);
Reader reader = new InputStreamReader(stream, "UTF-8"); // or whatever
BufferedReader in = new BufferedReader(reader)) {
String line = in.readLine();
while (line != null) {
String[] fields = line.split("\\s");
doSomethingWith(fields);
line = in.readLine();
}
}
| 2024-06-14T01:26:29.851802 | https://example.com/article/1416 |
\unset ECHO
1..97
ok 1 - four-argument form should pass
ok 2 - four-argument form should have the proper description
ok 3 - four-argument form should have the proper diagnostics
ok 4 - three-argument errcode should pass
ok 5 - three-argument errcode should have the proper description
ok 6 - three-argument errcode should have the proper diagnostics
ok 7 - two-argument errcode should pass
ok 8 - two-argument errcode should have the proper description
ok 9 - three argument errmsg should pass
ok 10 - three argument errmsg should have the proper description
ok 11 - three argument errmsg should have the proper diagnostics
ok 12 - two-argument errmsg should pass
ok 13 - two-argument errmsg should have the proper description
ok 14 - two-argument errmsg should have the proper diagnostics
ok 15 - single-argument form should pass
ok 16 - single-argument form should have the proper description
ok 17 - single-argument form should have the proper diagnostics
ok 18 - prepared statement & errcode should pass
ok 19 - prepared statement & errcode should have the proper description
ok 20 - execute & errcode should pass
ok 21 - execute & errcode should have the proper description
ok 22 - invalid errcode should fail
ok 23 - invalid errcode should have the proper description
ok 24 - invalid errcode should have the proper diagnostics
ok 25 - throws_ok(1/0, NULL) should work
ok 26 - throws_ok diagnostics should fail
ok 27 - throws_ok diagnostics should have the proper description
ok 28 - throws_ok diagnostics should have the proper diagnostics
ok 29 - lives_ok() should work
ok 30 - lives_ok(prepared) should pass
ok 31 - lives_ok(prepared) should have the proper description
ok 32 - lives_ok(execute) should pass
ok 33 - lives_ok(execute) should have the proper description
ok 34 - lives_ok failure diagnostics should fail
ok 35 - lives_ok failure diagnostics should have the proper description
ok 36 - lives_ok failure diagnostics should have the proper diagnostics
ok 37 - throws_like(sql, pattern, desc) should pass
ok 38 - throws_like(sql, pattern, desc) should have the proper description
ok 39 - throws_like(sql, pattern, desc) should have the proper diagnostics
ok 40 - throws_like(sql, pattern) should pass
ok 41 - throws_like(sql, pattern) should have the proper description
ok 42 - throws_like(sql, pattern) should have the proper diagnostics
ok 43 - throws_like(sql, pattern, desc) fail should fail
ok 44 - throws_like(sql, pattern, desc) fail should have the proper description
ok 45 - throws_like(sql, pattern, desc) fail should have the proper diagnostics
ok 46 - throws_like(valid sql, pattern, desc) should fail
ok 47 - throws_like(valid sql, pattern, desc) should have the proper description
ok 48 - throws_like(valid sql, pattern, desc) should have the proper diagnostics
ok 49 - throws_ilike(sql, pattern, desc) should pass
ok 50 - throws_ilike(sql, pattern, desc) should have the proper description
ok 51 - throws_ilike(sql, pattern, desc) should have the proper diagnostics
ok 52 - throws_ilike(sql, pattern) should pass
ok 53 - throws_ilike(sql, pattern) should have the proper description
ok 54 - throws_ilike(sql, pattern) should have the proper diagnostics
ok 55 - throws_ilike(sql, pattern, desc) fail should fail
ok 56 - throws_ilike(sql, pattern, desc) fail should have the proper description
ok 57 - throws_ilike(sql, pattern, desc) fail should have the proper diagnostics
ok 58 - throws_ilike(valid sql, pattern, desc) should fail
ok 59 - throws_ilike(valid sql, pattern, desc) should have the proper description
ok 60 - throws_ilike(valid sql, pattern, desc) should have the proper diagnostics
ok 61 - throws_matching(sql, regex, desc) should pass
ok 62 - throws_matching(sql, regex, desc) should have the proper description
ok 63 - throws_matching(sql, regex, desc) should have the proper diagnostics
ok 64 - throws_matching(sql, regex, desc) should pass
ok 65 - throws_matching(sql, regex, desc) should have the proper description
ok 66 - throws_matching(sql, regex, desc) should have the proper diagnostics
ok 67 - throws_matching(sql, regex, desc) should fail
ok 68 - throws_matching(sql, regex, desc) should have the proper description
ok 69 - throws_matching(sql, regex, desc) should have the proper diagnostics
ok 70 - throws_matching(valid sql, regex, desc) should fail
ok 71 - throws_matching(valid sql, regex, desc) should have the proper description
ok 72 - throws_matching(valid sql, regex, desc) should have the proper diagnostics
ok 73 - throws_imatching(sql, regex, desc) should pass
ok 74 - throws_imatching(sql, regex, desc) should have the proper description
ok 75 - throws_imatching(sql, regex, desc) should have the proper diagnostics
ok 76 - throws_imatching(sql, regex, desc) should pass
ok 77 - throws_imatching(sql, regex, desc) should have the proper description
ok 78 - throws_imatching(sql, regex, desc) should have the proper diagnostics
ok 79 - throws_imatching(sql, regex, desc) should fail
ok 80 - throws_imatching(sql, regex, desc) should have the proper description
ok 81 - throws_imatching(sql, regex, desc) should have the proper diagnostics
ok 82 - throws_imatching(valid sql, regex, desc) should fail
ok 83 - throws_imatching(valid sql, regex, desc) should have the proper description
ok 84 - throws_imatching(valid sql, regex, desc) should have the proper diagnostics
ok 85 - Create check_assert function
ok 86 - throws_ok catches assert should pass
ok 87 - throws_ok catches assert should have the proper description
ok 88 - throws_ok catches assert should have the proper diagnostics
ok 89 - throws_ok does not accept passing assert should fail
ok 90 - throws_ok does not accept passing assert should have the proper description
ok 91 - throws_ok does not accept passing assert should have the proper diagnostics
ok 92 - lives_ok calling check_assert(true) should pass
ok 93 - lives_ok calling check_assert(true) should have the proper description
ok 94 - lives_ok calling check_assert(true) should have the proper diagnostics
ok 95 - lives_ok with check_assert(false) should fail
ok 96 - lives_ok with check_assert(false) should have the proper description
ok 97 - lives_ok with check_assert(false) should have the proper diagnostics
| 2023-12-06T01:26:29.851802 | https://example.com/article/6551 |
Fix The Enterprises, Fix The Economy: Henry Mintzberg
An economy is simply an accumulation of transactions involving goods and services, mostly carried out by business enterprises. Their behaviour is what matters, and this can be adequately perceived only on the ground, where the behaviour occurs – where an economy is built, where it breaks, and where it must be fixed.
MONTREAL – Much commentary about the American economy nowadays leaves the impression that economists should fix its problems. But Washington is teeming with smart economists, and the problems remain.
An economy is like a cloud: only when inside does one realize how diffuse it is – and that what matters are the particles of vapour that it comprises.
Likewise, an economy is an accumulation of transactions involving goods and services, mostly carried out by business enterprises. Their behaviours are what matters, and they cannot be adequately perceived from the distant perspective of economic models and statistics, but only on the ground – where an economy is built, where it breaks, and where it must be fixed.
On the ground, there are two kinds of enterprises: those that rely on exploration, and those that rely on exploitation. Every economy has both, but a healthy one favours the explorers. This fosters the sense of enterprise that made the United States such an economic powerhouse. Unfortunately, the American economy now favours the exploiters.
Economic development proceeds through a cycle that begins with young, exploring enterprises introducing new products, services, and processes. Over time, however, as they succeed, many explorers become exploiters. They saturate their markets, run out of new ideas, and get lazy. They then extend their product lines instead of developing new products; cut costs by putting pressure on their workers; lobby governments for favorable treatment; merge with competitors to reduce competition; and manipulate customers to squeeze out every last penny.
This, of course, makes these enterprises vulnerable to the creative challenges of the next wave of explorers – the fast new firms that confront the fat old corporations – and the cycle of destruction and reconstruction begins anew.
Contrast this with the America of bailouts, where the fat are considered “too big to fail.” In fact, many are too big – or at least too mismanaged – to succeed. How else to explain why major banks and insurance companies bet their futures on mortgages that a little investigation would have shown to be junk? Their senior managers either didn’t know, or cynically thought that they could get away with it, while the rest of their managers either didn’t care, or couldn’t get through to their bosses.
This American problem goes far beyond the bailouts. For every Apple and Google – explorers par excellence – count the energy companies with their cozy tax deals, the defense contractors that live off government budgets, and the pharmaceutical companies that buy their innovations and price what the market will bear, thanks to patents that governments grant, but without policing their holders.
On top of this, many US startups now leap into exploitation. Whereas America’s entrepreneurs had traditionally been inclined to create sustainable legacies, now many of them strive for an early IPO that will let them cash out quickly. This can be terribly dysfunctional, cutting off much of what still must be learned.
When economists boast about America’s great productivity, what they have in mind is exploration – finding ways to do things better, especially through superior processes. But much of this “productivity” has in fact been destructively exploitative. Think of all the corporations that have fired great numbers of people at the drop of a share price, leaving behind underpaid, overworked employees and burned-out managers, while the CEOs escape with their bonuses.
To see where this leads, imagine a company that fires all of its workers and then ships its orders from stock. Economic statistics would record this as highly productive – until, of course, the company runs out of stock. American enterprise is running out of stock.
Seen in this way, there is no quick fix for America’s current economic problems. Firing workers or even printing money can be easy; changing dysfunctional behaviours is not. The US economy will have to be fixed by its enterprises, one by one, on the ground. Attitudes will have to change, and this will demand great dedication and patience – traits that seem to be in short supply in the US today.
The place to start is America’s executive suites, which should be cleared of mercenaries in order to encourage real leadership. That is the easy part: get rid of the obscene compensation packages and watch the mercenaries disappear. People who care about building and sustaining decent enterprises – and who understand that doing so is a team exercise – can then take over.
Successful enterprises take time to create – time spent on inventing better products, serving customers more effectively, and supporting workers in ways that enhance their commitment. Symbols matter, too: the term “human resources,” for example, should be retired, because a great enterprise is a community of engaged human beings, not a collection of detached capital.
Public support should be shifted from protecting large established corporations to encouraging the growth of newer enterprises. And startups should be discouraged from rushing into the embrace of the stock market’s short-sighted analysts (and many an established corporation should be encouraged to escape that embrace). At the same time, regulation and taxation should be used to rein in disruptive day trading and other exploitative speculation that crowds out sustainable investment and disrupts regular business activities.
Above all, what the American economy needs now are managers who know and care about their businesses. Armies of MBAs who have been trained to manage everything in general but nothing in particular are part of the problem, not the solution. So are economists who study clouds without ever getting wet.
Henry Mintzberg is Cleghorn Professor of Management Studies at McGill University. e is the author or co-author of fifteen books, including The Nature of Managerial Work (1973), The Structuring of Organizations (1979), Mintzberg on Management (1989), The Rise and Fall of Strategic Planning (1994), The Canadian Condition (1995), Strategy Safari (1998), Managers not MBAs (2004), Strategy Bites Back (2005) and Managing (2009).
Asia Pathways is a blog of the Asian Development Bank Institute (ADBI). ADBI welcomes contributions to Asia Pathways. Information on how to contribute to the blog is available at our guidelines for authors.
Located in Tokyo, Japan, ADBI is the think tank of the Asian Development Bank. Its mission is to identify effective development strategies and improve development management in ADB's developing members countries. ADBI has an extensive network of partners in the Asia and Pacific region and beyond. ADBI's activities are guided by its three strategic priority themes of inclusive and sustainable growth, regional cooperation and integration, and governance for policies and institutions.
QFINANCE is a unique collaboration of more than 300 of the world’s leading practitioners and visionaries in finance and financial management, covering key aspects of finance including risk and cash-flow management, operations, macro issues, regulation, auditing, and raising capital. | 2023-10-21T01:26:29.851802 | https://example.com/article/3189 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.