text stringlengths 8 5.77M |
|---|
Q:
Execute a code only for the first time logged in PHP
I am coding a user registration and login system with PHP. Actually, I could make them work already.
The thing is that I want the user to fill a form but only the first time the user has logged in the page (this is because the results from the form will determine some preferences in the system and I want the user to take the test only once)
Could you guys help me with the logic please?
A:
You can add a new field in the database, form_submitted and give it false when a new users registers. Turn it to true after he submits the form. If the value is true, dont show him the form.
|
The number of United States-born children who were given birthright citizenship despite at least one of their parents being an illegal alien living in the country now outnumbers one year of all American births.
A new Congressional Budget Office (CBO) report reveals the booming number of U.S.-born children to illegal aliens who are given automatic citizenship, forever anchoring their families in the U.S.
These children are commonly known as “anchor babies,” as they are able to eventually bring an unlimited number of foreign relatives to the U.S. through the process known as “chain migration.” Every two new immigrants to the U.S. brings an estimated seven foreign relatives with them.
In 1993, Harry Reid famously said on the Senate floor that "no sane country" would grand birthright citizenship to anchor babies. https://t.co/jndjVd6QNn — John Binder 👽 (@JxhnBinder) December 27, 2017
There are at least 4.5 million anchor babies in the U.S. under the age of 18-years-old, according to the CBO. This estimate does not include the potentially millions of anchor babies who are older than 18-years-old, nor does it include the anchor babies who are living overseas with their deported foreign parents.
The 4.5 million anchor babies estimate exceeds the four million American children born every year. In the next decade, the CBO estimates that there will be at least another 600,000 anchor babies born in the U.S., which would put the anchor baby population on track to exceed annual American births — should the U.S. birth rate not increase — by more than one million anchor babies.
Already, the anchor baby population exceeds the entire population of Los Angeles, California and is roughly half of the population of New York City.
As Breitbart News reported, a decade of chain migration, allowing newly naturalized immigrants to bring an unlimited number of foreign relatives with them, has exceeded two years of all American births. Altogether, chain migration since 2005 has imported roughly 9.3 million foreign nationals to the U.S.
Even after discounting normal immigration, the number of chain migration arrivals at the nation’s airports during 5 years exceeds the number of babies born during each year. https://t.co/gjW6j4tX9p — John Binder 👽 (@JxhnBinder) December 19, 2017
Every year, the U.S. admits more than 1.5 foreign nationals, with the vast majority deriving from family-based chain migration. In 2016, the legal and illegal immigrant population reached a record high of 44 million. By 2023, the Center for Immigration Studies estimates that the legal and illegal immigrant population of the U.S. will make up nearly 15 percent of the entire U.S. population. |
531 So.2d 203 (1988)
Harvey Lewis PATTEN, Appellant,
v.
STATE of Florida, Appellee.
No. 86-2928.
District Court of Appeal of Florida, Second District.
September 7, 1988.
*204 James Marion Moorman, Public Defender, and A. Anne Owens, Asst. Public Defender, Bartow, for appellant.
Robert A. Butterworth, Atty. Gen., Tallahassee, and Davis G. Anderson, Jr., Asst. Atty. Gen., Tampa, for appellee.
PARKER, Judge.
This is Patten's second appeal of his sentence for grand theft. He again attacks the trial judge's departure upward from the recommended guidelines sentence. We reverse.
In reversing, we are fully cognizant of the frustrations which the trial court faced when it sought to resolve the anomalous situation presented by this case. However, we believe the scope of the case law interpreting the sentencing guidelines prohibits the instant departure. Although the sentence imposed in this case seems logical, the application of the sentencing guidelines to particular circumstances continues to defy logic.
Patten committed the primary offense of grand theft in Polk County on January 13, 1985. He was convicted of that offense on July 25, 1985 and, on appeal, this court affirmed his conviction but reversed the *205 departure sentence of community control.[1]Patten v. State, 492 So.2d 748 (Fla. 2d DCA 1986). By mandate issued on August 19, 1986, this court directed the trial court on remand to sentence Patten "in accordance with the suggested guidelines" which initially called for a first cell sentence of any nonstate prison sanction. On resentencing, which occurred on October 16, 1986, the trial court imposed a three-year term of imprisonment yielding a third cell treatment under the guidelines. Between the date of his original Polk County offense and the date of the resentencing on that offense, Patten committed another grand theft in Hillsborough County for which he was convicted and placed on probation on May 23, 1986. Because Patten used the alias of Eddie Smith in Hillsborough County, his Polk County offenses were not discovered and therefore were not factored into the Hillsborough County sentence. Since, upon resentencing for the Polk County crime, the trial judge could not consider Patten's subsequently committed Hillsborough County offense as prior record, he used it as a ground for departure. The trial judge below, in his order of departure, said:
[T]he defendant absconded from his community control program which was not superseded on appeal. In addition, the defendant was convicted of grand theft on May 23, 1986, in Hillsborough County and sentenced to probation. The defendant was arrested and convicted in Hillsborough County under the fictitious name of Eddie Smith.
Initially, it is important to note that Patten's sentence on remand, which once more represented a departure from the recommended range, violated the express mandate of this court. Absent permission to do so, a trial court is without authority to alter or evade a district court of appeal's mandate but, rather, must give precise effect to that dictate. Stuart v. Hertz Corp., 381 So.2d 1161 (Fla. 4th DCA 1980).
Setting aside the trial court's lack of observance of this court's dictate, this appeal turns upon the appropriate interpretation of Shull v. Dugger, 515 So.2d 748 (Fla. 1987), as it applies to the present circumstances. The dissent interprets Shull in such a manner as to allow a post-sentencing conviction to be used as a new basis for exceeding the presumptive range upon remand, following the reversal of a departure sentence in which all the reasons stated in the original departure order were found to be invalid. According to the dissenting opinion, since the grand theft conviction did not exist at the time of the original sentencing, it is not prohibited by Shull and Brumley v. State, 520 So.2d 275 (Fla. 1988), which follows the holding in Shull, as a ground for departure upon resentencing. Such a strained interpretation of Shull and its attendant implications compel us to disagree with the dissent.
The reasoning of the dissent is incompatible with the supreme court's expressed intent in its Shull decision that
We believe the better policy requires the trial court to articulate all of the reasons for departure in the original order. To hold otherwise may needlessly subject the defendant to unwarranted efforts to justify the original sentence and also might lead to absurd results. One can envision numerous resentencings as, one by one, reasons are rejected in multiple appeals. Thus, we hold that a trial court may not enunciate new reasons for a departure sentence after the reasons given for the original departure sentence have been reversed by an appellate court.
Shull, 515 So.2d at 750.
The dissent seizes upon the following quoted language from Brumley (citing Shull) that "a trial court must articulate all of the reasons for departure in the original order and cannot enunciate any new reasons for departure after reversal of the original sentence," to support its conclusion in this case. That language, however, *206 should be examined in the context in which it arose. By including this language in its Brumley opinion, the supreme court merely sought to prohibit an exception which had been drawn by the district courts to the general rule requiring resentencing within guidelines under circumstances similar to those present in this case. Shull, 515 So.2d at 749-50. The exception which was created involved those situations in which the sole departure reason was valid at the time of sentencing but subsequently became invalid by virtue of a supreme court decision, for example, habitual offender status. In those particular cases of which Brumley was one, the appellate courts had held that the trial court on remand could again depart if it could state valid reasons for departure which existed in the record at time of the original sentencing.
Although the supreme court in Brumley only directed its holding to the specific circumstances before it, which are different from those presented in this case departure reasons here occurred after original sentencing Brumley nonetheless signifies the supreme court's rejection of an exception being created to the general rule stated in Shull similar to that sought to be established by the dissent. Shull clearly enunciates that on remand after a reversal of a guidelines departure for failure to provide a valid reason for the departure, the trial court is prohibited from providing any new reasons to exceed the original recommended sentence. Brumley simply restates the holding of Shull. Both cases unequivocally prohibit new reasons for departure after reversal of the original sentence.
Under the dissent's interpretation of Shull, the departure grounds stated by the trial court on resentencing, if valid, would support affirming Patten's sentence since all these reasons occurred after the original sentencing. The first and third reasons, however, are invalid. The first reason contained in the resentencing order that "defendant absconded from his community control program" is not a valid ground to depart beyond the one cell bump permitted under the guidelines. See Fla.R. Crim.P. 3.701(d)(14); Myrick v. State, 497 So.2d 728 (Fla. 2d DCA 1986).
We perceive no inconsistency with our interpretation of Shull had the trial court on resentencing merely enhanced Patten's sentence one cell from the original recommended sentence of "any nonstate prison sanction" under the above rule for his violation of community control.[2]See Royal v. State, 508 So.2d 1313 (Fla. 2d DCA 1987); Lockett v. State, 516 So.2d 46 (Fla. 4th DCA 1987). Such a one cell enhancement does not produce a departure sentence with the accompanying requirement of reasons but, rather, is consistent with the imposition of the "appropriate guidelines sentence" required under Shull and falls within the "suggested sentencing guidelines" mandated by this court. See Patten, 492 So.2d at 748. Therefore, there is no reason why on further resentencing, the trial court may not be permitted to impose the enhanced sentence of community control or twelve to thirty months incarceration. See Fla.R.Crim.P. 3.701(d)(14). The third reason listed as a basis for departure, i.e., that Patten furnished a fictitious name when arrested on a subsequent grand theft charge in Hillsborough County, is also improper. See Fla.R.Crim.P. 3.701(d)(11); Denson v. State, 493 So.2d 60 (Fla. 2d DCA 1986).
The dissent, however, focuses on the second reason offered by the trial judge for departure *207 subsequent grand theft conviction as the basis for upholding Patten's sentence. In support of its position, the dissent relies upon a line of cases represented by Merriex v. State, 521 So.2d 249 (Fla. 1st DCA 1988); Pugh v. State, 499 So.2d 54 (Fla. 1st DCA 1986); Falzone v. State, 496 So.2d 894 (Fla. 2d DCA 1986); Prince v. State, 461 So.2d 1015 (Fla. 4th DCA 1984); Davis v. State, 455 So.2d 602 (Fla. 5th DCA 1984).[3] These cases all involve an interpretation of "prior record," defined under Florida Rule of Criminal Procedure 3.701(d)(5)(a), as those offenses which were committed before the primary offense at conviction and for which convictions were also obtained. Following from that definition, the courts in those cases held that such subsequent criminal conduct not factored as "prior record" could be used as a proper means to deviate from the recommended sentence.
By comparison in Smith v. State, 518 So.2d 1336 (Fla. 5th DCA 1987), which the dissent relies upon by analogy in support of its opinion, the court held that offenses committed before the primary offense but for which convictions were not obtained until after initial sentencing could be scored as "prior record" on resentencing. The result in Smith was an increased presumptive range while still yielding a sentence "within the presumptive guidelines range," (emphasis supplied) as directed by the district court in that case.
None of the above cases, however, implicate the previously explained principle established in Shull no new departure reasons permitted on resentencing if previous reasons found invalid and, as such, are inapposite to the case before us. First, all the cases but one, Merriex, were decided prior to Shull. As a result, these cases are not instructive in deciding this case since an application of the Shull holding would likely produce a different outcome.
With regard to Merriex, the defendant in that case was arrested and convicted of a subsequent offense after he entered into a plea agreement and was released on bond for the initial offense of sale of cocaine. At the sentencing on the sale offense, the trial court departed from the guidelines sentence giving as its reason the subsequent offense. The Merriex court simply held that the subsequent offense and conviction were valid grounds for departure. The situation addressed in Shull was never present in Merriex, however, since in the latter case there was no previous sentencing at which departure reasons were held to be invalid. While we accept the conclusion reached in the above line of cases that a subsequent conviction can be a proper basis to depart when it cannot be factored as "prior record," we reject the extension of that holding to a resentencing situation like that present in Shull.
Even if Shull may be avoided under the present circumstances as the dissent suggests, we find another line of cases, in which a departure sentence is imposed following a violation of probation for the reason that a subsequent conviction evidences a continuing or escalating pattern of criminal activity, more analogous to the instant situation than the cases represented by Merriex. See State v. Pentaude, 500 So.2d 526 (Fla. 1987). The rationale for permitting such a sentencing departure is that the underlying reasons for the probation violation, *208 or as in this case the violation of community control, are sufficiently egregious. Id.
Recently, our court, citing Pentaude, disapproved as a departure reason a defendant's commission of a subsequent trafficking offense within seventeen months of serving a sentence of probation imposed on his initial conviction for trafficking in cocaine. Medina v. State, 526 So.2d 216 (Fla. 2d DCA 1988). It appears inconsistent to hold that the trial court may depart from a first to third cell sentence in this case on the basis of a subsequent offense of grand theft which occurred within fifteen months of Patten's original sentence, if Medina disapproves a second cell departure predicated on a later trafficking offense committed seventeen months after the original sentence.
While we appreciate the trial court's dilemma, noting that even if Hillsborough County could convict Patten for perjury for lying to the court concerning his name and past criminal history, the permissible guidelines range would still limit the trial court in that county to a second cell guidelines sentence,[4] we are constrained to follow Shull, which we believe prohibits the result reached by the dissent.
Based upon the foregoing reasons, we reverse Patten's sentence and remand the case to the trial court for the imposition of the recommended guidelines sentence which may be enhanced to the next cell by virtue of Patten's violation of community control.
Reversed and remanded.
FRANK, J., concurs.
CAMPBELL, C.J., dissents with opinion.
CAMPBELL, Chief Judge, dissenting with opinion.
I respectfully dissent. This appeal is another in the myriad of appeals involving sentencing guidelines that are to the criminal justice system and the appellate courts of Florida what the infamous albatross was to Coleridge's Ancient Mariner. See Elkins v. State, 489 So.2d 1222 (Fla. 5th DCA 1986); Merriex v. State, 521 So.2d 249, 250 (Fla. 1st DCA 1988) (Zehmer, J., specially concurring). Perhaps it is the frustrations of the law, as it is sometimes interpreted and often applied, that leads us as jurists to the field of literature, not only in an attempt to more eloquently or fervently express our concern and respect for the law, but also to find some solution and solace in the writing of other authors who have considered those same or similar frustrations and vagaries in its application. Mr. Bumble in Dickens' Oliver Twist muttered his frustration that "[i]f the law supposes that, the law is a ass a idiot." One wonders today what Bumble's mutterings would have been had he encountered our sentencing guidelines whose ostensible purpose was to introduce logic and consistency into the sentencing process.
This is appellant's second appeal of his sentence for grand theft. He again attacks the trial judge's departure upward from the recommended guidelines sentence. I would affirm.
The circumstances appear to be unique. The dilemma confronting the trial judge and created by the peculiar facts of this case required a consideration of two equally established precedents that are, in this case, apparently opposed to each other. The first of those precedents is the rule stated in Shull v. Dugger, 515 So.2d 748, 750 (Fla. 1987), that a trial court may not enunciate new reasons for a departure sentence after the reasons given for the original departure have been reversed by an appellate court. Numerous decisions of the courts of this state have applied Shull. Most of them do not contain any detailed statement of the facts of the case. Each of them, however, in rather broad general *209 terms reaches the same general conclusion that after a departure sentence is reversed, the trial court, on remand, may not enunciate entirely new reasons for departure at resentencing, but must sentence the defendant within the presumptive guidelines range. See Brumley v. State, 520 So.2d 275 (Fla. 1988); Velazguez-Velazguez v. State, 523 So.2d 774 (Fla. 3d DCA 1988); Sarria v. State, 523 So.2d 727 (Fla. 3d DCA 1988); Dean v. State, 523 So.2d 165 (Fla. 1st DCA 1988); Harris v. State, 520 So.2d 688 (Fla. 3d DCA 1988); King v. State, 520 So.2d 310 (Fla. 2d DCA 1988); Matire v. State, 520 So.2d 292 (Fla. 4th DCA 1988).
The problem with that broad general statement of the Shull rule is that it does not contemplate the time sequences of events and circumstances of this case or those illustrated by Smith v. State, 518 So.2d 1336 (Fla. 5th DCA 1987) (Smith II). It seems to me that the more correct interpretation of Shull is that on remand, after a departure sentence is reversed, the trial judge may not again depart based on newly enunciated reasons that existed at the time of the original sentencing.
To take that principle one step further, I conclude that it is proper for a trial judge to depart again, on remand, if there are valid reasons for departure that have occurred because of the defendant's conduct in the interval between the original sentencing procedures and the resentencing on remand. Our supreme court seems to imply what I have concluded when it states in Brumley: "In Shull v. Dugger, 515 So.2d 748 (Fla. 1987), we held that a trial court must articulate all of the reasons for departure in the original order and cannot enunciate any new reasons for departure after reversal of the original sentence by an appellate court." 520 So.2d at 276.
Thus, it seems to me that in Brumley, when the court requires that all reasons for departure must be in the original order, it necessarily means those reasons which existed at the time of the original order. Interpreted in that manner, Shull would not prohibit utilizing those reasons for departure on resentencing that have occurred since the original order. Interpreted this way, Shull also does not violate the other precedent involved here and enunciated in the line of cases represented by Merriex; Pugh v. State, 499 So.2d 54 (Fla. 1st DCA 1986); Falzone v. State, 496 So.2d 894 (Fla. 2d DCA 1986); Prince v. State, 461 So.2d 1015 (Fla. 4th DCA 1984); Davis v. State, 455 So.2d 602 (Fla. 5th DCA 1984).
The principle stated in each of those cases is that while a new offense committed after the offense for which a defendant is being sentenced cannot be scored on the scoresheet as "prior record," it may be used as a grounds for departure if the defendant is convicted of the subsequent offense prior to his sentencing on the primary offense. Fla.R.Crim.P. 3.701(d)(5)(a). Prince, regardless of the disagreement by the majority, is, in my consideration, factually very close to the circumstances of this case.
The only real difference in Prince is that on Prince's first appeal, his conviction and sentence were reversed and the case was remanded for a new trial. After Prince's conviction on his retrial, the trial judge based his departure on offenses that Prince committed and was convicted of after his first reversal and before his new trial. That departure sentence was affirmed on Prince's second appeal.
In the case before us, appellant committed his primary offense of grand theft in Polk County on January 13, 1985. He was convicted on July 25, 1985 and, on appeal, this court affirmed his conviction but reversed his departure sentence and remanded for resentencing within the presumptive guideline range. Patten v. State, 492 So.2d 748 (Fla. 2d DCA 1986). Resentencing on remand took place on October 16, 1986. Between the date of his original Polk County offense of January 13, 1985, and the date of the resentencing, appellant committed another grand theft in Hillsborough County for which he was convicted and placed on probation on May 23, 1986. Because appellant used the alias of Eddie Smith in Hillsborough County, his Polk County offenses were not discovered or factored into the Hillsborough County sentence. *210 Since, on resentencing in this case in Polk County, the trial judge could not consider his subsequently committed Hillsborough County offense as prior record, he used it as a ground for departure. Falzone; Prince. The trial judge below, in his order of departure, said:
[T]he defendant absconded from his community control program which was not superseded [sic] on appeal. In addition, the defendant was convicted of grand theft on May 23, 1986 in Hillsborough County and sentenced to probation. The defendant was arrested and convicted in Hillsborough County under the ficticious name of Eddie Smith.
The reasoning of Judge Upchurch in the recent case of Smith II is extremely helpful for purposes of analogy with this case. In Smith II, the court approved on resentencing a new increased sentence that resulted from the use of a new scoresheet that scored as "prior offenses" offenses that had been committed prior to the commission of the primary offense, but for which convictions had not been obtained until after the original sentencing on the primary offense and before resentencing. Using that same reasoning and analogy, I would conclude that it was proper for the trial judge here to consider, for departure purposes, the additional offenses where both the commission and convictions for the subsequent offense took place after the commission of the primary offense but prior to resentencing after our previous remand.
A final observation is merited by the majority's concern with their view that the trial court failed to obey our mandate issued on Patten's first appeal. I am not so concerned with that issue because if the trial judge improperly violated our mandate, there is a remedy for that violation. See Modine Manufacturing Co. v. ABC Radiator, Inc., 367 So.2d 232 (Fla. 3d DCA 1979). Moreover, our mandate involved resentencing, a matter peculiarly and traditionally within the discretion of the trial court. As a matter of fact, our mandate directs the trial judge to conduct further sentencing proceedings "in accordance with the opinion of this Court and with the rules of procedure and laws of the State of Florida." (Emphasis supplied.) The majority even suggests that it would be permissible for the trial court to have imposed a one-cell enhancement on the suggested guideline sentence as a result of appellant's violation of his community control which also occurred subsequent to his previous sentence. While the majority can "perceive no inconsistency" with that position, my perception is not so clear.
In Smith II for instance, the fifth district considered a resentencing that resulted from Smith's first appeal wherein the court reversed a departure sentence and "remanded for resentencing within the presumptive guideline range." Smith v. State, 495 So.2d 876 (Fla. 5th DCA 1986) (Smith I). On remand, the trial court utilized a new scoresheet that included convictions factored into the scoresheet which were not previously available for consideration. The court in Smith II approved the utilization of that new scoresheet containing the convictions previously unavailable. It defies my sense of logic to permit utilization after mandate of a new scoresheet containing newly available offenses but to refuse to permit the trial court to utilize newly available reasons for the purpose of departure.
The courts of this state have consistently recognized that new matters may be considered on remand with prior permission of the appellate court. Rinker Materials Corp. v. Holloway Materials Corp., 175 So.2d 564 (Fla. 2d DCA 1965). Yet, it is beyond dispute that we do not render advisory opinions. State v. Vogel, 415 So.2d 821, 822 (Fla. 2d DCA 1982). I, like the trial judge, am not sure how this matter could have been more properly handled.
I would affirm.
NOTES
[1] The community control sentence was found to be illegal since it exceeded the guideline's recommended range and was not supported by valid written reasons for departure. See Hall v. State, 511 So.2d 1038, 1043 n. 12 (Fla. 1st DCA 1987) (citing Williams v. State, 500 So.2d 501 (Fla. 1986)).
[2] Although the community control sentence was later reversed by this court, Patten did not file a supersedeas bond in the trial court following his sentence and filing of the appeal in this court. A trial court retains jurisdiction to enforce the terms of an unsuperseded judgment so as to confer authority upon the trial court to consider an unstayed violation of probation. Bush v. State, 369 So.2d 674 (Fla. 3d DCA 1979). There is no reason why Patten's violation of community control, without a stay, should be treated differently. Further, the subsequent vacation of an illegal sentence does not affect a conviction for escape while the sentence is being served. Nichols v. State, 509 So.2d 1243 (Fla. 2d DCA 1987). By analogy, since Patten was placed on community control, under color of law, his absconding from that sentence even if illegal, when not stayed, should permit a sentence bump into the second cell.
[3] The dissent improperly finds Prince to be factually very close to the present case and further incorrectly states "that [Prince's] departure sentence was affirmed on Prince's second appeal from the departure sentence." While there were two appeals in Prince, there was but a single appeal from a departure sentence. In Prince's first appeal, his 1983 convictions and sentences, rendered before the effective date of the sentencing guidelines, were reversed and a new trial ordered. After a retrial, Prince elected to be sentenced under the then new sentencing guidelines. The trial court departed from the recommended range, listing as the reason two subsequent convictions occurring after the reversal but before retrial. The fourth district, relying on Davis, declared a sentencing departure was permitted because Prince demonstrated an escalating pattern of criminal activity. Although the departure sentence was affirmed, the cause was remanded for the trial court to comply with Florida Rule of Criminal Procedure 3.701(d)(11), requiring that departure reasons be set forth in a separate writing. Similarly, the defendant in Davis had been sentenced under the then new sentencing guidelines after he violated a previously imposed term of probation.
[4] By our calculation, based upon a primary offense of perjury, and a factoring of one prior second-degree felony, two prior third-degree felonies, two prior misdemeanors, plus legal constraint at the time of the primary offense, all occurring within six years, Patten's score would fall within the second cell for purposes of determining his recommended sentence under the guidelines.
|
After Thoughts
This Applies To Everyone Except White Males
The plan to repeal the Affordable Healthcare Act (ACA aka Obama Care) is well under way and it is not going to be good news for a lot of people. There are many provisions and exclusions that are being put into place that specifically target minorities and low income Americans. There is new talk on disqualifying many based on preexisting conditions, there is almost no one that will not be affected by these new changes. Soon there will be no healthcare for those that are financially able to afford it. |
Kidney transplant from a living monozygotic twin donor with no maintenance immunosuppression.
From a theoretical point of view, an alloimmune response can not take place, still some type of standard immunosuppression is used in about 60% of patients receiving kidney grafts from their monozygotic twins. We aimed at assessing clinical response in patients receiving renal grafts from a living monozygotic twin donor when no immunosuppressive therapy is used. This is a retrospective observational study of patients receiving kidney grafts from their monozygotic twins from 1969 to 2013. The following data were recorded: age, renal graft recipient's primary disease, renal function, renal survival and overall survival. Immunosuppressive therapy included a single intraoperative dose of methylprednisolone 500 mg and no maintenance immunosuppression. Five patients with kidney grafts from their monozygotic twins were dentified in our centre. Mean age at transplantation was 33 years (27-39). One-year overall survival and graft survival were 100%. Mean creatinine level was 0.96 ± 0.2 one year after transplantation, and 1.2 ± 0.37 mg/dl at most recent follow-up. Two patients died with a functional graft more than 15 years after kidney transplantation (causes were melanoma and cardiovascular event respectively). Follow-up was lost in a patient one year after transplantation. Two patients are alive with a functioning graft at 18 months and 42.5 years after transplantation respectively. Kidney transplantation from a living monozygotic twin is associated to outstanding clinical outcomes. Immunossuppresive therapy to suppress alloimmune response in probably unnecessary 11 zygosity has been confirmed. |
odoo.define('web.GraphModel', function (require) {
"use strict";
var core = require('web.core');
const { DEFAULT_INTERVAL, rank } = require('web.controlPanelViewParameters');
var _t = core._t;
/**
* The graph model is responsible for fetching and processing data from the
* server. It basically just do a(some) read_group(s) and format/normalize data.
*/
var AbstractModel = require('web.AbstractModel');
return AbstractModel.extend({
/**
* @override
* @param {Widget} parent
*/
init: function () {
this._super.apply(this, arguments);
this.chart = null;
},
//--------------------------------------------------------------------------
// Public
//--------------------------------------------------------------------------
/**
*
* We defend against outside modifications by extending the chart data. It
* may be overkill.
*
* @override
* @returns {Object}
*/
get: function () {
var self = this;
return _.extend({}, this.chart, {
comparisonFieldIndex: self._getComparisonFieldIndex(),
});
},
/**
* Initial loading.
*
* @todo All the work to fall back on the graph_groupbys keys in the context
* should be done by the graphView I think.
*
* @param {Object} params
* @param {boolean} params.compare
* @param {Object} params.context
* @param {Object} params.fields
* @param {string[]} params.comparisonTimeRange
* @param {string[]} params.domain
* @param {string[]} params.groupBys a list of valid field names
* @param {string[]} params.groupedBy a list of valid field names
* @param {boolean} params.stacked
* @param {string[]} params.timeRange
* @param {string} params.comparisonField
* @param {string} params.comparisonTimeRangeDescription
* @param {string} params.measure a valid field name
* @param {'pie'|'bar'|'line'} params.mode
* @param {string} params.modelName
* @param {string} params.timeRangeDescription
* @returns {Promise} The promise does not return a handle, we don't need
* to keep track of various entities.
*/
load: function (params) {
var groupBys = params.context.graph_groupbys || params.groupBys;
this.initialGroupBys = groupBys;
this.fields = params.fields;
this.modelName = params.modelName;
this.chart = {
comparisonField: params.comparisonField,
comparisonTimeRange: params.comparisonTimeRange,
comparisonTimeRangeDescription: params.comparisonTimeRangeDescription,
compare: params.compare,
context: params.context,
dataPoints: [],
domain: params.domain,
groupBy: params.groupedBy.length ? params.groupedBy : groupBys,
measure: params.context.graph_measure || params.measure,
mode: params.context.graph_mode || params.mode,
origins: [],
stacked: params.stacked,
timeRange: params.timeRange,
timeRangeDescription: params.timeRangeDescription,
};
this.chart.processedGroupBy = this._processGroupBy(this.chart.groupBy);
return this._loadGraph(this._getDomains());
},
/**
* Reload data. It is similar to the load function. Note that we ignore the
* handle parameter, we always expect our data to be in this.chart object.
*
* @todo This method takes 'groupBy' and load method takes 'groupedBy'. This
* is insane.
*
* @param {any} handle ignored!
* @param {Object} params
* @param {boolean} [params.stacked]
* @param {Object} [params.context]
* @param {string[]} [params.domain]
* @param {string[]} [params.groupBy]
* @param {string} [params.measure] a valid field name
* @param {string} [params.mode] one of 'bar', 'pie', 'line'
* @returns {Promise}
*/
reload: function (handle, params) {
if ('context' in params) {
this.chart.context = params.context;
this.chart.groupBy = params.context.graph_groupbys || this.chart.groupBy;
this.chart.measure = params.context.graph_measure || this.chart.measure;
this.chart.mode = params.context.graph_mode || this.chart.mode;
var timeRangeMenuData = params.context.timeRangeMenuData;
if (timeRangeMenuData) {
this.chart.comparisonField = timeRangeMenuData.comparisonField || undefined;
this.chart.comparisonTimeRange = timeRangeMenuData.comparisonTimeRange || [];
this.chart.compare = this.chart.comparisonTimeRange.length > 0;
this.chart.comparisonTimeRangeDescription = timeRangeMenuData.comparisonTimeRangeDescription;
this.chart.timeRange = timeRangeMenuData.timeRange || [];
this.chart.timeRangeDescription = timeRangeMenuData.timeRangeDescription;
} else {
this.chart.comparisonField = undefined;
this.chart.comparisonTimeRange = [];
this.chart.compare = false;
this.chart.comparisonTimeRangeDescription = undefined;
this.chart.timeRange = [];
this.chart.timeRangeDescription = undefined;
}
}
if ('domain' in params) {
this.chart.domain = params.domain;
}
if ('groupBy' in params) {
this.chart.groupBy = params.groupBy.length ? params.groupBy : this.initialGroupBys;
}
if ('measure' in params) {
this.chart.measure = params.measure;
}
this.chart.processedGroupBy = this._processGroupBy(this.chart.groupBy);
if ('mode' in params) {
this.chart.mode = params.mode;
return Promise.resolve();
}
if ('stacked' in params) {
this.chart.stacked = params.stacked;
return Promise.resolve();
}
return this._loadGraph(this._getDomains());
},
//--------------------------------------------------------------------------
// Private
//--------------------------------------------------------------------------
/**
* @private
* @returns {number}
*/
_getComparisonFieldIndex: function () {
var groupBys = this.chart.processedGroupBy.map(function (gb) {
return gb.split(":")[0];
});
return groupBys.indexOf(this.chart.comparisonField);
},
/**
* @private
* @returns {Array[]}
*/
_getDomains: function () {
var domains = [this.chart.domain.concat(this.chart.timeRange)];
this.chart.origins = [this.chart.timeRangeDescription || ""];
if (this.chart.compare) {
domains.push(this.chart.domain.concat(this.chart.comparisonTimeRange));
this.chart.origins.push(this.chart.comparisonTimeRangeDescription);
}
return domains;
},
/**
* Fetch and process graph data. It is basically a(some) read_group(s)
* with correct fields for each domain. We have to do some light processing
* to separate date groups in the field list, because they can be defined
* with an aggregation function, such as my_date:week.
*
* @private
* @param {Array[]} domains
* @returns {Promise}
*/
_loadGraph: function (domains) {
var self = this;
this.chart.dataPoints = [];
var groupBy = this.chart.processedGroupBy;
var fields = _.map(groupBy, function (groupBy) {
return groupBy.split(':')[0];
});
if (this.chart.measure !== '__count__') {
if (this.fields[this.chart.measure].type === 'many2one') {
fields = fields.concat(this.chart.measure + ":count_distinct");
}
else {
fields = fields.concat(this.chart.measure);
}
}
var context = _.extend({fill_temporal: true}, this.chart.context);
var defs = [];
domains.forEach(function (domain, originIndex) {
defs.push(self._rpc({
model: self.modelName,
method: 'read_group',
context: context,
domain: domain,
fields: fields,
groupBy: groupBy,
lazy: false,
}).then(self._processData.bind(self, originIndex)));
});
return Promise.all(defs);
},
/**
* Since read_group is insane and returns its result on different keys
* depending of some input, we have to normalize the result.
* Each group coming from the read_group produces a dataPoint
*
* @todo This is not good for race conditions. The processing should get
* the object this.chart in argument, or an array or something. We want to
* avoid writing on a this.chart object modified by a subsequent read_group
*
* @private
* @param {number} originIndex
* @param {any} rawData result from the read_group
*/
_processData: function (originIndex, rawData) {
var self = this;
var isCount = this.chart.measure === '__count__';
var labels;
function getLabels (dataPt) {
return self.chart.processedGroupBy.map(function (field) {
return self._sanitizeValue(dataPt[field], field.split(":")[0]);
});
}
rawData.forEach(function (dataPt){
labels = getLabels(dataPt);
var count = dataPt.__count || dataPt[self.chart.processedGroupBy[0]+'_count'] || 0;
var value = isCount ? count : dataPt[self.chart.measure];
if (value instanceof Array) {
// when a many2one field is used as a measure AND as a grouped
// field, bad things happen. The server will only return the
// grouped value and will not aggregate it. Since there is a
// name clash, we are then in the situation where this value is
// an array. Fortunately, if we group by a field, then we can
// say for certain that the group contains exactly one distinct
// value for that field.
value = 1;
}
self.chart.dataPoints.push({
resId: dataPt[self.chart.groupBy[0]] instanceof Array ? dataPt[self.chart.groupBy[0]][0] : -1,
count: count,
value: value,
labels: labels,
originIndex: originIndex,
});
});
},
/**
* Process the groupBy parameter in order to keep only the finer interval option for
* elements based on date/datetime field (e.g. 'date:year'). This means that
* 'week' is prefered to 'month'. The field stays at the place of its first occurence.
* For instance,
* ['foo', 'date:month', 'bar', 'date:week'] becomes ['foo', 'date:week', 'bar'].
*
* @private
* @param {string[]} groupBy
* @returns {string[]}
*/
_processGroupBy: function(groupBy) {
const groupBysMap = new Map();
for (const gb of groupBy) {
let [fieldName, interval] = gb.split(':');
const field = this.fields[fieldName];
if (['date', 'datetime'].includes(field.type)) {
interval = interval || DEFAULT_INTERVAL;
}
if (groupBysMap.has(fieldName)) {
const registeredInterval = groupBysMap.get(fieldName);
if (rank(registeredInterval) < rank(interval)) {
groupBysMap.set(fieldName, interval);
}
} else {
groupBysMap.set(fieldName, interval);
}
}
return [...groupBysMap].map(([fieldName, interval]) => {
if (interval) {
return `${fieldName}:${interval}`;
}
return fieldName;
});
},
/**
* Helper function (for _processData), turns various values in a usable
* string form, that we can display in the interface.
*
* @private
* @param {any} value value for the field fieldName received by the read_group rpc
* @param {string} fieldName
* @returns {string}
*/
_sanitizeValue: function (value, fieldName) {
if (value === false && this.fields[fieldName].type !== 'boolean') {
return _t("Undefined");
}
if (value instanceof Array) {
return value[1];
}
if (fieldName && (this.fields[fieldName].type === 'selection')) {
var selected = _.where(this.fields[fieldName].selection, {0: value})[0];
return selected ? selected[1] : value;
}
return value;
},
});
});
|
NJ Transit to replace ancient Raritan Bay bridge
PERTH AMBOY - NJ Transit plans to replace the old and frail drawbridge across the mouth of the Raritan River with a "lift" bridge, which would allow trains to travel as fast as 60 mph.
NJ Transit Executive Director Steve Santoro on Wednesday said the agency expects to issue a design contract in the spring, with construction aimed to begin in 2019.
Preliminary engineering is underway as is the process of securing federal environmental permits.
“It is a vital link both on the commuter side and beyond," Santoro said. "When you look at the big picture, I think that's why the federal government allowed this project to be funded."
MORE: NJ Transit to replace Raritan Bay drawbridge
Replacing the Raritan Bay drawbridge is a $446 million project, funded by superstorm Sandy relief aid from the federal government. Like the Hudson River tunnels and Portal Bridges, the Raritan River drawbridge is 108 years old and was walloped during Sandy. The bridge’s girders shifted about 18 inches during the 2012 storm, because of the storm surge and a large barge that slammed into it.
The bridge was closed for three weeks following the storm, suspending all North Jersey Coast Line service between Woodbridge and the 17 Shore stations south.
“If this bridge moved 24 inches during Sandy, it might have gone down, and we’d be standing here wondering how people would get to work,” Santoro said.
And just like the tunnels and Portal Bridges – which would be replaced as part of the $24 billion Gateway Program — the Raritan Bay drawbridge is a vital link to transit in New Jersey. Each day, the 330-foot bridge connects nearly 10,000 North Jersey Coast Line riders with the Northeast Corridor to New York.
MORE: Transportation under Trump
For commuters, it’s a way to get from Monmouth and Ocean counties to work in Newark or New York. For travelers, the Coast Line is the path to a summer getaway along the Jersey Shore without sitting in dreaded “Shore traffic.”
“This is the key to maximizing the number of riders,” Santoro said. “People use it to get to Asbury Park and Bay Head, to Point Pleasant – all the Shore areas. So it’s certainly a critical bridge for tourism which, in the summer, is really the economics of New Jersey."
The current bridge is a “swing bridge,” which pivots along the water to make room for boats traveling Raritan Bay. But NJ Transit’s preferred “lift bridge” design would raise the middle chunk of the bridge straight up.
The “lift” design comes with a quick turnaround from train-to-boat-to-train traffic, NJ Transit senior program manager R.J. Palladino said. While it has a maximum height of 110 feet, the bridge operator could also raise it to lower heights.
WHY: NJ Transit won't share details of Sandy report
And it creates a 300-foot-wide channel for boats, while the current swing bridge creates two channels just 25 feet wide.
“The lift bridge gives us some of the best features for reliability, resiliency and navigational improvements within the river,” Palladino said.
Most of the year, the Raritan River draw swings open about four or five times per day for boat traffic. During the summer, it opens about 14 times per day, Palladino said.
And if another Sandy comes through? NJ Transit can simply lift the bridge – and its vital mechanisms and controls – out of harm’s way.
“This is arguably more vulnerable to another storm” than the Gateway tunnels, Santoro said.
Mike Davis: 732-643-4223; mdavis@gannettnj.com |
# Lesson 5: Clean up your mess!
Innovate, experiment, but flush when your're done! Don't leave unused resources in your team's AWS accounts. The Lambdas and API Gateways will only cost you money while used, but the Kinesis streams and DynamoDB tables will charge part of their cost just for existing. Delete everything when you're done!
## Unregister Your Stream
Please use the `/unhook-stream` command in the `#serverless-workshop` slack channel to disconnect your stream from the core Retail Stream:
In Slack, using your Kinesis ARN:
```
/unhook-stream [stream kinesis ARN]
```
_*** IMPORTANT! ***_
BEFORE *DELETING* YOUR STREAM, WAIT FOR THE ANNOUNCEMENT FROM THE INSTRUCTOR THAT IT IS OK TO DELETE THE STREAMS.
If you do not, it is possible that backups can occur with the fan-out stream. We'll be taking action to avoid impacts but please...
Once you've been given the all-clear please delete your stream.
## Remove Your Services
#### OS X
```sh
cd <path-to-local-workshop-dir>/Lesson3_PublicEndpointToAccessView/winner-api
serverless remove -s $STAGE
cd <path-to-local-workshop-dir>/Lesson2_CreateViewWithEventConsumer/winner-view
serverless remove -s $STAGE
cd <path-to-local-workshop-dir>/Lesson1_HelloRetailStream/ingress-stream
serverless remove -s $STAGE
```
#### Windows
```bat
cd <path-to-local-workshop-dir>\Lesson3_PublicEndpointToAccessView\winner-api
serverless remove -s %STAGE%
cd <path-to-local-workshop-dir>\Lesson2_CreateViewWithEventConsumer\winner-view
serverless remove -s %STAGE%
cd <path-to-local-workshop-dir>\Lesson1_HelloRetailStream\ingress-stream
serverless remove -s %STAGE%
```
You should see a message from Serverless when each of your stacks is removed.
## remove Hello-Retail application from your Amazon account
Use the [Manage Login with Amazon](https://www.amazon.com/ap/adam) to remove the `HELLO-RETAIL-WEB-APP` application from your account.
## serverless reference
For more information on removing services see the Serverless.com documentation for [remove](https://serverless.com/framework/docs/providers/aws/cli-reference/remove/#aws---remove).
|
Effect of magnesium lithospermate B on the renal and urinary kallikrein activities in rats with adenine-induced renal failure.
A study was conducted to examine the effect of magnesium lithospermate B on both the urinary and renal total and active kallikrein and prokallikrein in rats with adenine-induced renal failure. In rats given magnesium lithospermate B at a dose of 10 mg/kg body weight/day for 12 days, significant increases of urinary total and active kallikrein were associated with significant increases of urine volume and urinary total and active kallikrein were associated with significant increases of urine volume and urinary creatinine excretion. The renal total and active kallikrein levels were also significantly elevated by the treatment with magnesium lithospermate B. On day 24, the urinary excretion of total and active kallikrein and prokallikrein was significantly increased. Concomitantly, a significant increase in renal kallikrein (total, active and pro-) was found in the rats given magnesium lithospermate B. A significant relationship existed between the urinary creatinine and active kallikrein excretion. These results suggest that magnesium lithospermate B may stimulate the synthesis of kallikrein and/or conversion to active kallikrein, thus improving renal function. |
Q:
Can not set an environmental variable by python in ubuntu
I am testing a simple python script to set an environmental variable by os module but it seems it doesn't work, what is wrong with my code or logic?
webcluster4u@ingestion-jenkins-vm:~$ python
Python 2.7.13 (default, Sep 26 2018, 18:42:22)
[GCC 6.3.0 20170516] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> import os
>>> os.environ['ENV']='ss'
>>> os.environ.get('ENV')
'ss'
>>> exit()
webcluster4u@ingestion-jenkins-vm:~$ echo $ENV
webcluster4u@ingestion-jenkins-vm:~$
A:
There's nothing wrong with your script.
This by design. Your python script runs in a child process which inherits the shell's environment, but does not affect it. Any changes you make to the environment will affect the script's process and it's children if any.
|
/*p200/201 GPIOAO_2 powr on :0, power_off :1*/
#define __SUSPEND_FIRMWARE__
#include <config.h>
#undef __SUSPEND_FIRMWARE__
#define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
#ifdef CONFIG_CEC_WAKEUP
#include <cec_tx_reg.h>
#endif
#include <gpio-gxbb.h>
extern int pwm_voltage_table[31][2];
#define P_PIN_MUX_REG3 (*((volatile unsigned *)(0xda834400 + (0x2f << 2))))
#define P_PIN_MUX_REG7 (*((volatile unsigned *)(0xda834400 + (0x33 << 2))))
#define P_PWM_MISC_REG_AB (*((volatile unsigned *)(0xc1100000 + (0x2156 << 2))))
#define P_PWM_PWM_B (*((volatile unsigned *)(0xc1100000 + (0x2155 << 2))))
#define P_PWM_MISC_REG_CD (*((volatile unsigned *)(0xc1100000 + (0x2196 << 2))))
#define P_PWM_PWM_D (*((volatile unsigned *)(0xc1100000 + (0x2195 << 2))))
#define P_EE_TIMER_E (*((volatile unsigned *)(0xc1100000 + (0x2662 << 2))))
enum pwm_id {
pwm_a = 0,
pwm_b,
pwm_c,
pwm_d,
pwm_e,
pwm_f,
};
void pwm_set_voltage(unsigned int id, unsigned int voltage)
{
int to;
uart_puts("set vddee to 0x");
uart_put_hex(voltage, 16);
uart_puts("mv\n");
for (to = 0; to < ARRAY_SIZE(pwm_voltage_table); to++) {
if (pwm_voltage_table[to][1] >= voltage) {
break;
}
}
if (to >= ARRAY_SIZE(pwm_voltage_table)) {
to = ARRAY_SIZE(pwm_voltage_table) - 1;
}
switch (id) {
case pwm_b:
P_PWM_PWM_B = pwm_voltage_table[to][0];
break;
case pwm_d:
P_PWM_PWM_D = pwm_voltage_table[to][0];
break;
default:
break;
}
_udelay(200);
}
static void power_off_3v3(void)
{
aml_update_bits(AO_GPIO_O_EN_N, 1<<2, 0);
aml_update_bits(AO_GPIO_O_EN_N, 1<<18, 1<<18);
}
static void power_on_3v3(void)
{
aml_update_bits(AO_GPIO_O_EN_N, 1<<2, 0);
aml_update_bits(AO_GPIO_O_EN_N, 1<<18, 0);
}
/*p200/201 GPIOAO_4 powr on :1, power_off :0*/
static void power_off_vcck(void)
{
aml_update_bits(AO_GPIO_O_EN_N, 1<<4, 0);
aml_update_bits(AO_GPIO_O_EN_N, 1<<20, 0);
}
static void power_on_vcck(void)
{
aml_update_bits(AO_GPIO_O_EN_N, 1<<4, 0);
aml_update_bits(AO_GPIO_O_EN_N, 1<<20, 1<<20);
}
static void power_off_at_clk81(void)
{
power_off_3v3();
power_off_vcck();
pwm_set_voltage(pwm_d, CONFIG_VDDEE_SLEEP_VOLTAGE); // reduce power
}
static void power_on_at_clk81(void)
{
pwm_set_voltage(pwm_d, CONFIG_VDDEE_INIT_VOLTAGE);
power_on_vcck();
power_on_3v3();
}
static void power_off_at_24M(unsigned int shutdown)
{
//LED gpioao_13
aml_update_bits(AO_GPIO_O_EN_N, 1<<29, 0);
}
static void power_on_at_24M(void)
{
aml_update_bits(AO_GPIO_O_EN_N, 1<<29, 1<<29);
}
static void power_off_at_32k(void)
{
}
static void power_on_at_32k(void)
{
}
void get_wakeup_source(void *response, unsigned int suspend_from)
{
struct wakeup_info *p = (struct wakeup_info *)response;
unsigned val;
struct wakeup_gpio_info *gpio;
unsigned i = 0;
p->status = RESPONSE_OK;
val = (POWER_KEY_WAKEUP_SRC | AUTO_WAKEUP_SRC | REMOTE_WAKEUP_SRC);
#ifdef CONFIG_CEC_WAKEUP
if (suspend_from != SYS_POWEROFF)
val |= CEC_WAKEUP_SRC;
#endif
p->sources = val;
/* Power Key: AO_GPIO[3]*/
gpio = &(p->gpio_info[i]);
gpio->wakeup_id = POWER_KEY_WAKEUP_SRC;
gpio->gpio_in_idx = GPIOAO_3;
gpio->gpio_in_ao = 1;
gpio->gpio_out_idx = -1;
gpio->gpio_out_ao = -1;
gpio->irq = IRQ_AO_GPIO0_NUM;
gpio->trig_type = GPIO_IRQ_FALLING_EDGE;
p->gpio_info_count = ++i;
}
void wakeup_timer_setup(void)
{
/* 1ms resolution*/
unsigned value;
value = readl(P_ISA_TIMER_MUX);
value |= ((0x3<<0) | (0x1<<12) | (0x1<<16));
writel(value, P_ISA_TIMER_MUX);
/*10ms generate an interrupt*/
writel(9, P_ISA_TIMERA);
}
void wakeup_timer_clear(void)
{
unsigned value;
value = readl(P_ISA_TIMER_MUX);
value &= ~((0x1<<12) | (0x1<<16));
writel(value, P_ISA_TIMER_MUX);
}
static unsigned int detect_key(unsigned int suspend_from)
{
int exit_reason = 0;
unsigned int time_out = readl(AO_DEBUG_REG2);
unsigned time_out_ms = time_out*100;
unsigned *irq = (unsigned *)SECURE_TASK_SHARE_IRQ;
/* unsigned *wakeup_en = (unsigned *)SECURE_TASK_RESPONSE_WAKEUP_EN; */
/* setup wakeup resources*/
/*auto suspend: timerA 10ms resolution*/
if (time_out_ms != 0)
wakeup_timer_setup();
init_remote();
#ifdef CONFIG_CEC_WAKEUP
if (hdmi_cec_func_config & 0x1) {
remote_cec_hw_reset();
cec_node_init();
}
#endif
/* *wakeup_en = 1;*/
do {
switch (*irq) {
#ifdef CONFIG_CEC_WAKEUP
case IRQ_AO_CEC_NUM:
if (suspend_from == SYS_POWEROFF)
break;
if (cec_msg.log_addr) {
if (hdmi_cec_func_config & 0x1) {
cec_handler();
if (cec_msg.cec_power == 0x1) {
/*cec power key*/
exit_reason = CEC_WAKEUP;
break;
}
}
} else if (hdmi_cec_func_config & 0x1)
cec_node_init();
break;
#endif
case IRQ_TIMERA_NUM:
if (time_out_ms != 0)
time_out_ms -= 10;
if (time_out_ms == 0) {
wakeup_timer_clear();
exit_reason = AUTO_WAKEUP;
}
break;
case IRQ_AO_IR_DEC_NUM:
if (remote_detect_key())
exit_reason = REMOTE_WAKEUP;
break;
case IRQ_AO_GPIO0_NUM:
if ((readl(AO_GPIO_I) & (1<<3)) == 0)
exit_reason = POWER_KEY_WAKEUP;
break;
default:
break;
}
*irq = 0xffffffff;
if (exit_reason)
break;
else
asm volatile("wfi");
} while (1);
wakeup_timer_clear();
return exit_reason;
}
static void pwr_op_init(struct pwr_op *pwr_op)
{
pwr_op->power_off_at_clk81 = power_off_at_clk81;
pwr_op->power_on_at_clk81 = power_on_at_clk81;
pwr_op->power_off_at_24M = power_off_at_24M;
pwr_op->power_on_at_24M = power_on_at_24M;
pwr_op->power_off_at_32k = power_off_at_32k;
pwr_op->power_on_at_32k = power_on_at_32k;
pwr_op->detect_key = detect_key;
pwr_op->get_wakeup_source = get_wakeup_source;
}
|
Q:
How to grab value from promise in Nodejs
Hi I am writing a nodejs code in Azure functions to capture the username saved in Azure key vault.
Here is the code I have written
module.exports = async function (context, req) {
var msRestAzure = require('ms-rest-azure');
var KeyVault = require('azure-keyvault');
function getKeyVaultCredentials() {
return msRestAzure.loginWithAppServiceMSI({
resource: 'https://vault.azure.net/'
});
}
function getKeyVaultSecret(credentials) {
let keyVaultClient = new KeyVault.KeyVaultClient(credentials);
return keyVaultClient.getSecret('https://myDNS.vault.azure.net/', 'username', '');
}
const username = getKeyVaultCredentials()
.then(getKeyVaultSecret)
.then(function (secret){
context.log(`Your secret value is: ${secret.value}.`);
return secret.value;})
.catch(function (err) {throw (err);});
context.log(username)
context.res = {
body: username
};
}
I want to capture the username but it is giving me output as
promise {pending}
How to wait for the function to end so that I can extract the username.
I am very new nodejs, please let me know what wrong I am doing and what should be the exact solution.
Thanks
A:
Actually you have already used then to get the secret value. The value will be returned if there is no issues with the dependencies and configurations.
getKeyVaultCredentials()
.then(getKeyVaultSecret)
.then(function (secret){
context.log(`Your secret value is: ${secret.value}.`);
return secret.value;})
.catch(function (err) {throw (err);});
But you will encounter some issues when using this sdk and here is the github issue for your reference.
It is recommended that you use the new Azure Key Vault SDK instead. It is more convenient to use. Here are the detailed steps to use MSI and Key vault in Azure function.
|
205 Cal.App.3d 1318 (1988)
253 Cal. Rptr. 156
G. SNYDER, Plaintiff and Appellant,
v.
BOY SCOUTS OF AMERICA, INC., Defendant and Respondent.
Docket No. C000903.
Court of Appeals of California, Third District.
November 17, 1988.
*1321 COUNSEL
Kenneth M. Foley for Plaintiff and Appellant.
Bailey & Brown and F. Eugene Bailey for Defendant and Respondent.
OPINION
SPARKS, J.
Plaintiff G. Snyder appeals from a judgment of dismissal entered after the trial court granted the motion for summary judgment of the defendant Boy Scouts of America, Inc. Plaintiff had sought recovery for personal injury suffered as the result of alleged sexual molestation by a former Boy Scout leader. Plaintiff did not file his action for several years after the molestations were alleged to have occurred and until more than one year after his 18th birthday. The court granted summary judgment on *1322 the ground that the action was barred by the applicable statute of limitations. Plaintiff contends that a variety of delayed discovery and tolling principles should be applied to his cause of action. We disagree and shall affirm the judgment.
FACTUAL AND PROCEDURAL BACKGROUND
Plaintiff was born on April 28, 1966. Sometime around 1977 he became a member of Boy Scout Troop 346, located in San Andreas. Dean Ray Von Aspern was assistant scout master and scout master of Troop 346 from 1977 until at least early 1980. According to plaintiff's allegations, Von Aspern took him into a back room during a scout meeting and told him he was going to instruct him in sex. Von Aspern then engaged in sexual conduct with plaintiff. Plaintiff realized this was not part of the Boy Scout instruction as the sex acts progressed and when he was told not to tell anyone else. Von Aspern engaged in sexual conduct with plaintiff repeatedly until he quit the Boy Scouts in early 1981. Plaintiff quit the Boy Scouts in order to avoid Von Aspern, and he refused to rejoin despite Von Aspern's urging.
Plaintiff filed this action on July 23, 1985, more than one year after he reached the age of 18 years. Plaintiff seeks recovery against the Boy Scouts on the grounds that Von Aspern was an agent of the Boy Scouts, and upon the ground that the Boy Scouts failed to take proper precautions to ensure that scouts would not be abused by persons like Von Aspern.
Plaintiff's action was filed beyond the one-year statute of limitations provided in Code of Civil Procedure section 340, subdivision (3). Plaintiff explained that he did not file suit earlier due to embarrassment, humiliation, and sorrow over what had occurred. Eventually plaintiff was charged with driving while under the influence of alcohol, and the attorney he contacted also happened to be representing other victims of Von Aspern. Plaintiff authorized the attorney to file suit on his behalf.
In opposition to the motion for summary judgment based upon the statute of limitations plaintiff submitted a declaration of Dr. Harvey Lerchin, a doctor certified by the American Board of Psychiatry and Neurology. Dr. Lerchin opined that plaintiff's failure to divulge the molestation sooner than he did was the product of embarrassment, humiliation and fear which are by-products of posttraumatic syndrome.
DISCUSSION
Code of Civil Procedure section 340, subdivision (3) provides a one-year statute of limitations for, among other things, "[a]n action for libel, slander, *1323 assault, battery, false imprisonment, seduction of a person below the age of legal consent, or for injury to or for the death of one caused by the wrongful act or neglect of another...." Pursuant to Code of Civil Procedure section 352, subdivision (a) if the plaintiff is under the age of majority when a cause of action accrues then the period of minority is not a part of the time limited for the commencement of the action. The age of majority is 18 years. (Civ. Code, § 25.) Accordingly, plaintiff had one year from his 18th birthday to file this tort action. He did not file this action until several months after his 19th birthday. On its face this action was not filed in a timely manner, a point plaintiff concedes. However, plaintiff advances several arguments in support of his claim that he should not be barred by the applicable statute of limitations. We shall consider these arguments in turn.
(1a) Plaintiff first asserts that defendant should be estopped to assert the statute of limitations due to Von Aspern's fraud. (2) The statute of limitations may not be used to perpetrate a fraud upon otherwise diligent suitors. Thus if the defendant, by his own wrongdoing, prevents the plaintiff from instituting a suit he may not take advantage of the statute of limitations. (Pashley v. Pacific Elec. Ry. Co. (1944) 25 Cal.2d 226, 231-232 [153 P.2d 325].) As plaintiff correctly notes, "[t]here can be no doubt that, in a proper case, where a party fraudulently conceals the existence of a cause of action against him, or fraudulently conceals material facts that induces a person not to prosecute a known cause of action, the statute of limitations is tolled and the fraudulent person is estopped from pleading the statute of limitations." (Bank of America v. Williams (1948) 89 Cal. App.2d 21, 25 [200 P.2d 151].) The statute will be tolled where the plaintiff establishes the substantive elements of fraud and an excuse for late discovery of the facts. The requisite showing is made when plaintiff establishes that he was not at fault for failing to discover the cause of action and had no actual or presumptive knowledge of the facts sufficient to put him on inquiry. (Community Cause v. Boatwright (1981) 124 Cal. App.3d 888, 900 [177 Cal. Rptr. 657].) Where fraud is established the statute is tolled only for so long as the plaintiff remains justifiably ignorant of the facts upon which the cause of action depends; discovery or inquiry notice of the facts terminates the tolling. (Regus v. Schartkoff (1957) 156 Cal. App.2d 382, 387 [319 P.2d 721].) (1b) Plaintiff's own declaration precludes tolling for fraud. Although Von Aspern initially misrepresented the nature of the acts, plaintiff realized they were wrongful and ultimately quit the Boy Scouts to avoid Von Aspern. Thus, by his own admission, plaintiff was well aware of the wrongful nature of Von Aspern's conduct long before he reached the age of majority. Whatever fraud there may have been while plaintiff was still in the Boy Scouts, it had long since dissipated. Consequently, the statute was not tolled by fraud.
*1324 (3) Plaintiff next claims estoppel by induced delay. A defendant may be estopped to assert the statute of limitations as a defense where he has improperly induced the plaintiff to delay filing a lawsuit. (See 3 Witkin, Cal. Procedure (3d ed. 1985) Actions, §§ 523-528, pp. 550-556.) Such inducements may include promises of performance of a contract, promises of settlement, or promises that by relying upon the defendant the plaintiff will suffer no harm. (Ibid.) Plaintiff asserts that Von Aspern told him not to tell anyone about the molestations. Assuming, without deciding, that such a request is the type of inducement which will toll the statute of limitations, it did not do so here. By plaintiff's own declaration any influence Von Aspern may have had over him terminated years before he filed this action.
(4) Plaintiff asserts that the principle of delayed discovery should preclude application of the statute of limitations. In some circumstances delayed discovery may operate to postpone the running of the period of limitations on the theory that it is inappropriate to bar a cause of action for wrongful conduct before a plaintiff could reasonably be expected to discover its existence. (Admiralty Fund v. Peerless Ins. Co. (1983) 143 Cal. App.3d 379, 387 [191 Cal. Rptr. 753].) This theory is most often applicable where there is no appreciable injury suffered contemporaneously with the wrong but such injury develops after the statute of limitations has run. (See Davies v. Krasna (1975) 14 Cal.3d 502, 513 [121 Cal. Rptr. 705, 535 P.2d 1161, 79 A.L.R.3d 807]; Priola v. Paulino (1977) 72 Cal. App.3d 380, 388-389 [140 Cal. Rptr. 186]; Allred v. Bekins Wide World Van Services (1975) 45 Cal. App.3d 984, 990-991 [120 Cal. Rptr. 312].) In such circumstances the cause of action does not accrue, nor the statute of limitations begin to run, until the plaintiff suffers some appreciable harm sufficient to entitle him to a legal remedy rather than a mere symbolic judgment. (Davies v. Krasna, supra.) Delayed discovery is not applicable here. In plaintiff's declaration he established that he suffered appreciable harm long before reaching the age of majority, and was aware of all of the facts constituting his cause of action. Accordingly the statute of limitations began to run when plaintiff reached his 18th birthday.
(5) Plaintiff's next contention suffers from the same defect. He claims disability by reason of the molestations to the extent that he suffered from a posttraumatic syndrome. Code of Civil Procedure section 352 sets forth the personal disabilities which toll the statute. Under this statute, if the person entitled to bring an action is "insane" at the time the cause of action accrued, "the time of such disability is not a part of time limited for the commencement of the action." (Code Civ. Proc., § 352, subd. (a).) But the alleged "posttraumatic syndrome" does not constitute insanity under the statute, and plaintiff makes no claim that it does. Instead, he relies upon the rule that "[d]espite the strong policy justifications for upholding statutes of *1325 limitations, courts have consistently refused to uphold such statutes strictly when a potential claimant has no opportunity to perform a condition precedent to asserting a right to recover. `[T]hose statutes should not be interpreted so as to bar a victim of wrongful conduct from asserting a cause of action before he could reasonably be expected to discover its existence." (Admiralty Fund v. Peerless Ins. Co., supra, 143 Cal. App.3d at p. 387; citations omitted.) But the record here establishes without contradiction that plaintiff discovered the existence of his cause of action long before he reached the age of majority. The rule has no application in this case of actual discovery.
(6) Plaintiff next contends that Code of Civil Procedure section 340.1, which became effective on January 1, 1987, should be held applicable to his action. Subdivision (a) of that section provides: "In any civil action for injury or illness based upon lewd or lascivious acts with a child under the age of 14 years, fornication, sodomy, oral copulation, or penetration of genital or anal openings of another with a foreign object, in which this conduct is alleged to have occurred between a household or family member and a child where the act upon which the action is based occurred before the plaintiff attained the age of 18 years, the time for commencement of the action shall be three years." Subdivision (c) of that section provides: "`Household or family member' as used in this section includes a parent, stepparent, former stepparent, sibling, stepsibling, any other person related by consanguinity or affinity within the second degree, or any other person who regularly resided in the household at the time of the act, or who six months prior to the act regularly resided in the household." Plaintiff concedes that Von Aspern does not come within this definition, but he urges that the section should apply to him as a scout leader and vicariously to the Boy Scouts. We cannot agree. In enacting a special statute of limitations for some sexual molestations the Legislature made a policy decision over the scope of the special statute. It deliberately chose to limit the scope of the statute to cases where the offending defendant was a "household or family member." The courts are not at liberty to rethink that policy decision or rewrite the statute to extend its application to persons excluded by the Legislature. Code of Civil Procedure section 340.1 by its own terms does not apply to plaintiff's cause of action.
(7) Plaintiff finally asserts that his action should be regarded as timely under Code of Civil Procedure section 340.3. That section provides: "Unless a longer period is prescribed for a specific action, in any action for damages against a defendant based upon such person's commission of a felony offense for which the defendant has been convicted, the time for commencement of the action shall be within one year after judgment is pronounced. If the sentence or judgment is stayed, the time for the *1326 commencement of the action shall be tolled until the stay is lifted. For purposes of this section, a judgment is not stayed if the judgment is appealed or the defendant is placed on probation." In support of this contention plaintiff has appended to his brief a certified copy of an abstract of judgment which shows that on June 20, 1985, in the Calaveras County Superior Court, Von Aspern was sentenced to state prison for various sexual offenses, including lewd and lascivious conduct with a child. Plaintiff asks that we take judicial notice of this judgment. However, even were we to do so and even were we to conclude that section 340.3 applies to a civil defendant alleged to be vicariously liable for the felon's conduct, it would not avail plaintiff. By its terms section 340.3 applies where the defendant is convicted of a felony arising out of the same conduct which is at issue in the civil suit. There is no suggestion that Von Aspern's convictions arose out of any conduct with plaintiff, and plaintiff's declaration rebuts any speculation that the convictions involved conduct with plaintiff. Plaintiff's cause of action is not governed by section 340.3 simply because the defendant was convicted of felonious conduct involving other victims.
(8) Summary judgment is a drastic remedy which may not be granted where there is a triable issue of material fact. (Code Civ. Proc., § 437c, subd. (c); Gigax v. Ralston Purina Co. (1982) 136 Cal. App.3d 591, 596 [186 Cal. Rptr. 395].) Nevertheless, when the uncontroverted facts show that the plaintiff cannot prevail on the issues framed by the pleadings then summary judgment should be granted. (Clarke v. Hoek (1985) 174 Cal. App.3d 208, 214 [219 Cal. Rptr. 845].) Plaintiff's commendably candid declaration establishes that long before his 18th birthday his cause of action had accrued and he was well aware of all of the facts which constituted his cause of action, including the wrongful nature of Von Aspern's conduct. No theory of fraud, estoppel, or delayed discovery applies to plaintiff's case. Nor do the provisions of Code of Civil Procedure, sections 340.1 or 340.3. Accordingly, summary judgment was properly granted.
The judgment is affirmed.
Evans, Acting P.J., and Marler, J., concurred.
Appellant's petition for review by the Supreme Court was denied February 1, 1989.
|
Updates whenever.
Menu
Ten Quick Q’s with Chet Everton Jr. #4
This is Ten Quick Q’s with Chet Everton Jr., where every week we ask everyone’s favourite slacker millionaire doofus a series of questions and see what his valuable insights are.
Q: You’re riding along in a friend’s car when he or she throws some trash out the window. How might you react?A: Throw them out the window.
Q: Do you stop to enjoy simple things in nature?A: I stared at a worm for 45 minutes today.
Q: Are you comfortable eating with chopsticks?A: They’re pointy sticks….you jab them into something and then put it in your mouth….duh.
Q: If you’re wrong, do you have a hard time apologizing?A: I am only wrong like 10% of the time and in those cases it’s due to common misconceptions so no apologies.
Q: Do you know what the golden spiral is?A: Yeah man it’s when my buddies are drunk and they pee everywhere LMAO.
Q: Have you made plans to survive a natural or man-made disaster where you live?A: Well my dad has the emergency money vault, and I’ve got a stick to fight off mobs or evil animals, but that’s it.
Q: As a general rule, do you think glasses make a person look smarter?A: Yeah before I put these glasses on I couldn’t do math or science and now I still can’t but people still come up to me and ask me math and science all the time.
Q: Is there something you do that you are one of the best in the world at?
A: Yes, being me. Awwwwwwwwwwwwwww. ??But actually, throwing action figures on the roof.
Q: Do you purchase and wear second hand/vintage clothes?A: Yeah, sometimes my butler Phillipe will buy me last season’s clothes and I wear them as a “poor people” costume LMAOoooo.
Q: Which Olympic Games do you most prefer to watch?A: I don’t, I boycotted them because they refused to make motorcycle soccer a real event. I had to rent out an arena and hold it myself. Absolutely unfair. |
J.B. Pritzker gave another $7 million to his own gubernatorial campaign Friday.
Which, doing the math, is roughly the equivalent of me spending $700 on a plumber.
Except it isn’t, my finances being a lot more close to the bone than his. I miss $700 more than he misses $7 million.
We both get value for our money. I get a new boiler pump. And Pritzker airs TV commercials like the one I saw Monday night, a poignant spot with melancholy piano music and J.B. talking about his mother, who died of alcoholism. A medley of emotion, trying to humanize the billionaire.
It works. He comes off as very lifelike.
Which is more than what could be done for Gov. Bruce Rauner, who couldn’t be rendered human if Leo Burnett and J. Walter Thompson rose up from the grave and gave him the head-to-toe buffing makeover that Dorothy Gale gets upon arrival at the Emerald City.
OPINION
No, the trouble is the whole notion of dueling tycoons.
The phone rang. It was Dan Biss, who is also running for governor but without benefit of an endless geyser of money fountaining over his head. We talked about nonpolitical things — who does that? — and laughed, for so long that I had to finally drop the hint: This is fun but I have work to do. What exactly is on your mind?
The race, of course.
“This has become a national referendum on whether you can run for office as a normal person at all,” he said. “In the era of Trump we have to decide if you can run for office if you’re not a billionaire. If you can’t run unless you are financing yourself, that is terrifying for democracy.”
“Terrifying for Democracy” could be the heading for our era in future public school textbooks. Assuming, of course, we have public schools. Or textbooks. Or a future.
I thought of quibbling at Biss, with his Harvard degree and MIT doctorate, casting himself as a regular joe. But I guess on the Pritzker scale he is.
We do seem to be at a watershed moment when it comes to our nation’s long slide back into the Gilded Age, when the rich crowned themselves in laurel branches and ate banquets on horseback while the poor sold matches in the street.
Here’s the part I don’t understand. You would think, being set for life, with enough to endow a dozen generations, the rich would care about the world they are leaving behind. Care about the Earth, about our social framework, which starts to hollow out if 99 percent are in squirming misery. The Republican policy now is a recipe for the 1 percent waking up one morning being tarred and feathered and loaded into a tumbril.
“You would think the super rich, who are obsessed with putting their names on stuff, would care about climate change,” Biss said. “The Koch brothers want to destroy the world so they have $90 billion next year instead of $70 billion.”
He quoted venture capitalist Nick Hanauer, who wrote in 2014: “If we don’t do something to fix the glaring inequities in this economy, the pitchforks are going to come for us. No society can sustain this kind of rising inequality.”
Pitchforks. I wouldn’t have believed it before. But we got Rauner. And we got Trump.
“Does it really have to be this way?” Biss asked. “Are we going to be told by Democrats that the only path forward is to pick our own billionaire?”
Isn’t it?
“I present the public a credible alternative,” he said. “Otherwise, we’ll have 17 billionaires having a meeting every four years to decide who will be governor.”
Someone — I’m not saying who, to throw certain readers off the trail — suggested that voters are backing the wealthy and applauding like seals as the rich tear down the social safety net because they are, for want of a better word, morons.
“I don’t agree that people are morons,” Biss said. “People are quick to gravitate to arguments. I think: ‘Oh my God, Donald Trump is president and he’s terrible. Bruce Rauner is the governor and he’s terrible. Maybe inexperienced billionaires aren’t the way to go.'”
Maybe not. |
10 Focusing Strategies for ADD Clients
It's so hard for ADD people to concentrate on tasks some times, because every time something is touched, they think of something else to do. So just trying to say out loud to yourself, "Focus, focus, focus"-easier said than done, but give it a try.
Having an organized environment for ADD people is certainly recommended in keeping control of their daily activities. It's a "Catch 22" for the classic symptoms of ADD: inattention, impulsivity, distractibility, overfocusing and hyperactivity, to name just a few. Everyone says "time management" but I like to call it "activities management." What we actually do is manage our "activities" within the "time" we have everyday. Makes sense?
So here are 10 simple focusing strategies for ADD clients:
A common characteristic of a person with ADD is that he/she likes new things to keep them interested, so it's difficult to stay on task for very long-sometimes it ranges for 15-60 minutes. A simple strategy of using a timer to start and stop can help insure completion of the project started.
Offering the client a reward for staying on task could be taking a short breaks and doing something else for 10-15 minutes. It's important that a reward is set up that the client wants and sometimes never finds the time to do.
Using your internal clock (like the feeling someone knows when something should take a certain amount of time to do), is not an effective way for an ADDer to keep track of time. Using a clock to do something within an allotted period of time that has an auditory sound from a timer or a cell phone, for instance, is a way for the mind to be interrupted, so the individual can stop, look at their calendar, and/or "to do" list to do something else. It's a challenge for an ADD individual to calculate how long something takes and/or will take their time to do. Planning is important to keep on task and learning not to "overschedule" one's day.
Approach a project by breaking it down into little pieces. So ask yourself, "How do you eat an elephant? Answer: "One bite at a time." If you can VISUALIZE this question and answer it each time when tackling a task and/or project, you will be able to manage your daily activities better so you can feel good at the end of each day.
To control your daily activities as well as managing your time, it's important to say "no." Reward yourself each time to saying "no" to everyone's request if it will keep you from doing what YOU need to get done. Always acknowledge that person who asked you by saying, "I appreciate your vote of confidence, but I just can't work it into my schedule at this time. Sorry."
Remind the client that complex organizing projects shouldn't be set up when he/she is not at their best. Setting up for "success" is the best. By working on a project that requires deep concentration, should be done during the time of day when the highest level of energy is felt.
Staying healthy is very important to the ADD individual. Exercising helps relieve the stress for both physical and mental issues that is caused by daily activities and interruptions. By exercising and good nutrition, frees up the mind to take a much needed rest I call a "brain break," so a person can "refocus, regroup and rejuvenate."
Sometimes letting calls go into voicemail will help insure concentration on the project at hand. By setting 2 times a day to return calls, will help put a "system" in place of creating a habit that can be a win-win situation for everyone.
Keeping a notepad on a night stand, in your pocket, purse, etc., is extremely useful when ideas pop into one's head. It clears the mental clutter out, so you can focus on the task at hand that needs to get done by a certain timeline.
Studies have been conducted that chewing gum can help one focus. Studies have been conducted that chewing gum can help one focus. Some people like to play with clear sparkly Silly Puddy in meetings tugging and pulling it in all directions to keep their hands busy because it helps people to focus. Besides, it really smells good--like bubble gum.
Helping clients understand their focus limitations and how to work within their abilities, will help prevent them from getting caught up in the cycle of "never finish anything" syndrome. "Making it fun until it's done" is my strategy in helping my ADD clients feel good about themselves by keeping them inspired that they can accomplish anything if they have the right tools and the right attitude.
"If you can't find it in 30 seconds, it's in the wrong place"
Evelyn Gray, Productivity Expert, Organizing Coach, Speaker, Trainer and Author, who specializes in working with professionals who have Attention Deficit Disorder (ADD/HD) and the chronically disorganized individuals. She obtained her Bachelor's Degree in Business Education from California State University, Los Angeles. Evelyn started organizing in her teens, where she always found tranquility in taking chaotic situations and breaking them down into "bite-size" pieces to make things easier and more pleasing to look at. |
The Storm Chasers tied a season high with six home runs, running their winning streak to seven. Jesus Flores recorded two home runs, four RBIs, four hits and three runs. Paulo Orlando was 4-for-4 with a two-run blast. Danny Valencia made his first rehab appearance, going 2-for-4 with a solo homer, a walk and two runs. Brett Eibner and Jimmy Paredes hit two-run homers, with Paredes recording four RBIs. John Lamb (5.2 IP, 5 H, 5 R, 3 ER, 3 BB, 4 SO) picked up the win.
Northwest Arkansas plated a pair in the eighth to win the second-half opener. A single by Micah Gibbs scored Angel Franco, tying the game at 2. Gibbs moved up twice on wild pitches, then scored on a single by Ethan Chapman. Lane Adams hit his third homer over the last two days, a solo shot in the third. Sam Selman (5.1 IP, 3 H, 2 ER, 1 BB, 4 SO) carried a shutout into the sixth.
A crowd of 6,385 at Wilmington's Frawley Stadium witnessed the annual battle of All-Stars from the California and Carolina circuits. Blue Rocks catcher Cam Gallagher was 1-for-2 with a single. Christian Binford struck out a pair while allowing a two-run homer in the fourth. Jonathan Dziedzic followed with a 1-2-3 fifth. Mark Peterson fanned two in a perfect ninth inning. The Blue Rocks return to action on Thursday at Myrtle Beach (Rangers).
Lexington Legends (29-41)
South Atlantic League South All-Stars 4, South Atlantic League North All-Stars 4
HR: None
The South Atlantic League All-Star Game at Hickory ended in a 4-4 tie after 10 innings. Lexington's Dominique Taylor earned MVP honors as he singled home two in the top of the 10th. Taylor was 2-for-3 for the South squad. Teammate Frank Schwindel was 0-for-2, reaching on a force out and stealing a base before scoring on Taylor's single. Lexington is at Delmarva (Orioles) on Thursday.
The Chukars dropped a pair of seven-inning games at Melaleuca Field. Brandon Thomasson recorded two hits and all three RBIs in Game 1. He was Kansas City's ninth-round pick in this year's Draft. Bryan Brickhouse tossed three innings in his first appearance as he returns from a right elbow injury. Brickhouse was KC's third-round pick in 2011. Luis Valenzuela was 2-for-4 with an RBI and a run in Game 2. |
INTRODUCTION
============
*Escherichia coli* is the most commonly used host strain for the expression of heterologous proteins and biocatalysts ([@b12], [@b18]). These recombinant proteins are usually synthesized intracellularly in either the cytoplasm or the periplasmic space ([@b2]), and overall productivity is a function of both cell density and specific yield. Proteins such as interferons, interleukin and growth hormones are some of the recombinant proteins successfully expressed in *E. coli* ([@b4]). However, *E. coli* has a number of limitations in its expression system, including inability to carry out post-translational changes, common in eukaryotic cells, lack of secretion system for efficient release of the recombinant protein into the culture medium ([@b1]). Protein expression in cytoplasm often leads to inadequate protein structure and agglutination in insoluble inclusion bodies ([@b16]).
With the advent of recombinant DNA technology, recombinant protein expression has become an important tool in the study of the structure, function and identification of new proteins, especially those with therapeutic functions, allowing for the manufacture of drugs capable of controlling particular diseases ([@b3], [@b14]).
Leishmaniases are illnesses caused by protozoa of the genus *Leishmania*, which, depending on the species, may produce cutaneous, mucocutaneous, diffuse or visceral manifestations ([@b13]). American visceral leishmaniasis or kala-azar is the most severe form of this disease. Untreated visceral leishmaniasis results in death within two years of initial infection ([@b5]). Despite significant advances in molecular biology and infection immunology, there are as yet no prophylactic drugs capable of preventing this disease, justifying the need to identify specific antigens, in order to develop vaccines and diagnostic kits against visceral leishmaniasis ([@b11]).
Thus, the objective of this study was to evaluate the influence of culture medium on the production of eIF antigen from *Leishmania chagasi* in recombinant *Escherichia coli* during batch fermentation using two different media (2xTY and TB).
MATERIAL AND METHODS
====================
Escherichia coli strain
-----------------------
The *Escherichia coli M15* strain with the eIF antigen used in this study was kindly donated by Dr. Mary Wilson (University of Iowa, U.S.A). The gene encoding the eIF antigen was expressed as a fusion protein containing histidine tag at the N-terminal end of the peptide using pQE-40 cloned in *E. coli M15* cells (Qiagen, U.S.A). The strain was maintained on Luria-Bertani (LB) medium in the presence of ampicillin and kanamycin, as described elsewhere ([@b16]).
Culture medium
--------------
Culture media were prepared with distilled water and sterilized at 120°C for 20 minutes, while antibiotics and IPTG solutions were sterilized by filtration through a 0.22 µm membrane in aseptic conditions. After sterilization, solutions were stored at -20°C. 2xTY medium (16 g/L tryptone, 10 g/L yeast extract, 5 g/L NaCl, pH 7.0) and Terrif broth (TB) complex cultivation medium (12 g/L tryptone, 24 g/L yeast extract, 0.004 mL/L glycerol, 12.54 g/L KH~2~PO~4~, l5 g/L K~2~HPO~4~, pH 7.0) were prepared according to Jordan et al. ([@b7]). For all experiments, media were used for batch cultivations in shake flasks supplemented with 0.1 g/L ampicillin (Invitrogen, Brazil) and 0.025 g/L kanamycin (Invitrogen, Brazil).
Inoculum preparation
--------------------
The stock of *E. coli* strain containing the eIF antigen was stored at -80°C in 50% glycerol. Two hundred microliters of stock was transferred to 50 mL of previously sterilized 2xTY and TB medium supplemented with 0.1 g/L ampicillin and 0.025 g/L kanamycin, using 250 mL Erlenmeyer flasks. Samples were kept in the shaker (37°C, 200 rpm) overnight. This suspension consisted of the initial inoculum batch cultivation carried out in a shaker flask.
Cultivation conditions
----------------------
The cultivation inoculum (10% v/v) was transferred to 250 mL Erlenmeyer flasks and kept under agitation at 200 rpm for 8 hours at 37° C. To understand the IPTG induction effect on growth and eIF antigen expression, cultures were induced by the addition of a final concentration of 1mM IPTG when optical density (OD~590nm~) reached 0.5 (early log phase) ([@b20]). Samples were taken hourly from the shaker in which cultivated cells were harvested by centrifugation (Eppendorf centrifuge 5415D) at 16,100 G for 30 min. The precipitate was used to determine dry weight at 80°C until constant weight was achieved. The supernatant was used to determine protein concentration by the Lowry method ([@b10]). All assays were performed in duplicate.
Recombinant protein purification
--------------------------------
The encoding nucleotide sequence of the protein of interest was inserted into the pQE-40 vector (Qiagen, U.S.A). The recombinant protein obtained is tagged to a histidine tail with high affinity for nickel ions. Therefore, batch mode purification by immobilized metal affinity chromatography (IMAC) used Nickel Sepharose 6 Fast Flow resin (Ge Helthcare, Brazil).
The purification process was as follows: 5 mL of the fermentation broth was centrifuged at 16,100 G for 30 minutes. The supernatant and cells were separated and stored at -20°C for further purification. For extracellular protein purification, samples were used directly, according to the following process. Intracellular proteins were first lysed with urea lysis buffer to release inclusion bodies (10 mM imidazole, 8 M urea, 50 mM NaH~2~PO~4~, 0.5 M NaCl, pH 8.0). During the lysis process, cells were put into an ice bath for 15 minutes, resuspended in lysis buffer and homogenized for 15--60 minutes. Cellular lysate was centrifuged at 16,100 G for 30 minutes at ambient temperature. The supernatant was used for purification processing. In this case, after washing, 1 mL of elution buffer (500 mM imidazole, 50 mM NaH~2~PO~4~ 0.5 M NaCl, pH 7.4) was added and homogenized for 5 minutes. The resin was settled by means of centrifugation at 16,100 G for 5 minutes. The supernatant was removed and the process repeated four times to achieve complete desorption. The eluted product was used for quantitative (Lowry method) and qualitative (electrophoresis) analysis of the recombinant protein.
Protein determination and electrophoresis
-----------------------------------------
Eluted fractions were collected and protein concentration was determined according to the Lowry method, using bovine serum albumin (BSA) as standard ([@b8]). Protein expression, assayed by electrophoresis in denaturing 15% polyacrylamide gel, was performed as described by Laemmli ([@b9]). A low molecular weight SDS calibration kit containing proteins (14.4 -- 97.0 kDa) was used to provide standard molecular weight markers. Proteins were visualized by silver staining ([@b17]).
RESULTS AND DISCUSSION
======================
Experiments were carried out using IPTG as inducer in order to observe the influence of medium composition on the expression of the *Leishmania chagasi* eIF antigen. [Figure 1](#fig1){ref-type="fig"} shows intracellular eIF protein, extracellular and total protein concentration (intra and extracellular) when 2xTY medium was used. It can be observed that eIF protein production was associated to growth behavior, with a maximum specific protein yield (Y~p/x~) of 0.37 g/g occurring after 6 h of cultivation. This corresponded to the maximum eIF protein fraction that cells could accumulate before initiating lysis. It was observed that the highest expression occurred after 6 hours of cultivation, with a protein content of 0.11 g/L, while maximum intracellular protein concentration was 0.37 g/L. In terms of location (intracellular or extracellular), it can be observed that cells retain most of their protein during the exponential growth phase. After this phase, a decrease in both intracellular and extracellular protein occurred. This may be due to cellular lysis resulting from protein saturation in the cell.
{#fig1}
[Figure 2](#fig2){ref-type="fig"} shows that maximum eIF concentration in TB medium was 0.35 g/L of total protein. The eIF protein expression demonstrated associated growth behavior, with maximum specific protein yield (Y~p/x~) of 0.095 g/g after 16 hours of cultivation. It can be observed that the highest intracellular expression occurred at 8 hours of cultivation. Additionally, cells retain most of their protein with an intracellular concentration of 0.15 g/L.
{#fig2}
The influence of specific growth rate on eIF antigen expression was investigated. [Figures 3](#fig3){ref-type="fig"} and [4](#fig4){ref-type="fig"} show the specific growth rate and protein concentration obtained during production of the eIF antigen in 2xTY and TB medium, respectively. It can be observed that eIF recombinant protein production is associated with reduction in specific growth rate of the culture during the post- induction period. The specific growth rate results in both media are quite similar to those obtained by Panda *et al*. ([@b15]). Addition of amino acids in the presence of high tryptone concentration, as occurred in 2xTY medium, may reduce product degradation by proteases induced during amino acid limitation. Likewise, addition of casamino acids or peptone may enhance recombinant protein stability or synthesis, resulting in high protein levels compared to TB medium rich in yeast extract, which supplies bacteria with nitrogen and organic and inorganic nutrients, favoring only cell growth ([@b6]).
{#fig3}
{#fig4}
[Figure 5A](#fig5){ref-type="fig"} shows the eIF antigen as a protein band during the second elution (line 4--8) with a molecular mass of approximately 62 kDa. In this case, extracellular protein concentration in 2xTY medium was 0.37 g/L. [Figure 5B](#fig5){ref-type="fig"} depicts the eIF antigen as a protein band with a molecular mass of approximately 72 kDa. In this case, extracellular protein concentration in TB medium was 0.15 g/L. The difference in molecular mass of the same protein in different cultivation media could be a result of different medium composition. The increase in eIF molecular weight in the TB medium may be due to the presence of amino acids in particular histidine ([@b19]). According to Kubar and Fragaki ([@b8]), the difference in molecular weight with different cultivation media is due to the association between the protein of interest and a number of components present in the medium. Moreover, it can be observed that fusion of the eIF protein to the histidine tail does not lead to post-translational processing by *E. coli* ([@b19]).
{#fig5}
In conclusion, it was found that eIF antigen production is associated to growth, with maximum expression 4 hours after culture induction in 2xTY medium. High protein accumulation was also observed during the exponential growth phase. Recombinant protein production in *E. coli* in 2xTY medium was considerably higher than in TB medium due to the addition of amino acids and high tryptone concentration. This may reduce product degradation by proteases induced during amino acid limitation.
NOMENCLATURE
============
--------- --------------------------------------
IPTG Isopropyl-β-D thiogalactopyranoside
kDa quilo daltons (1000 daltons)
X~max~ Maximum cell concentration (g.L^-1^)
µ~xmax~ Maximum specific growth rate (h^-1^)
Y~p/x~ Specific cell protein yield (g/g)
--------- --------------------------------------
The authors thank CNPq (*Conselho Nacional de Pesquisa e Desenvolvimento Tecnológico*) for the financial support and Dr. Mary Wilson (University of Lowa, U.S.A) for providing the microorganism strain.
|
A Take on Pup Identity
I want to take a moment to make clear my rationale for my position and feelings on pup identity. They’ve been brought to the fore a few times recently. They aren’t new, and those who have known me for awhile won’t be surprised. However, in the spirit of being transparent and avoiding misunderstanding, I’ll elaborate.
Even though it wasn’t all that long ago (almost 10 years), when I first ventured into pup play, having connected with and determined to explore my own inner pup, it was a different time and environment. That which we know today as the contemporary pup community was only just beginning to emerge. Outside of the San Francisco K-9 Unit, there weren’t any widely-established PAH clubs. The only Pup and Handler title was IPTC, and that wasn’t as widely known as it is today. There were lots of pups and handlers out there, but they weren’t nearly as well-connected as they are today. Pup play happened at events such as MAL or IML, but there were rarely any of the moshes we see today.
I’ve been fortunate to have come into it on the cusp of what we now know was considerable change and growth. I was even more fortunate that I was allowed to be part of it, in whatever small way.
But it was also a time when we, as pups, weren’t as widely understood within the broader leather/kink/fetish community. Those misconceptions have been there far longer than I’ve been involved, and there are people in this community who have been working hard to educate and overcome for more years than I’ve been out and about.
One of the biggest challenges I encountered from the beginning were erroneous preconceived notions about what makes a pup. I can’t put a number to how many dismissive comments I encountered or were told to me. People being told they weren’t pups because they were the wrong gender identification or sexual orientation, because they weren’t the right body type, because they were too old. Being told they weren’t pups because of whatever other reasons someone could come up with.
To all that, I have always had one answer. I spoke it before I ran for IPC’s International Puppy, I spoke it more widely during my title year, and I’ve repeated it ever since: being a pup comes from within. No one but the individual can know whether or not they are a pup. It is not for anyone else to decide.
Concurrent with that answer, and one of the things I tried to accomplish as a titleholder and since, is to encourage pups to embrace and be proud of their inner pups. It’s who we are, and we empower ourselves by being the pups we are.
Part of the pride is how we choose to express our inner pups. I’ve always made it a point to not trivialize how different pups express who and what they are – and to clarify when there’s misunderstanding on that point. How I express my inner pup is neither more nor less valid than how anyone else expresses theirs. We all have our preferences and those things we wear or do that connects more to what’s within.
But my underlying point has always been that our identity as pups comes from within – and no one can take that from us. It’s our self-identity, reinforced from within, that defines us as pups. That’s our common ground. The expression thereof is the individualization of that self-identity. And when we’re secure in that and comfortable in our own skin, we’re stronger as individuals and as a community.
I’m just one pup in a wider community of pups and handlers. However, my belief that who and what we are comes from within remains what it was when I first began. |
Partial-exchange blood transfusion: an effective method for preventing mortality in a child with propofol infusion syndrome.
Here we describe a case of propofol-related infusion syndrome (PRIS) in a child with malignant refractory status epilepticus treated with partial-exchange blood transfusion (PEBT), an innovative method of resuscitation that has the potential to reduce the mortality rate associated with this syndrome. Our patient is a 4-year-old boy with malignant status epilepticus associated with bacterial meningitis. Propofol was used because of persistent seizure activity refractory to adequate doses of phenytoin, phenobarbital, levetiracetam, and midazolam infusion at 0.7 mg/kg per hour. Propofol was escalated from 0.6 mg/kg per hour to an electroencephalogram-burst-suppressing dose of 15.6 mg/kg per hour. Signs of PRIS were noticed after 48 hours on propofol. The severe bradycardia responded only to infusions of calcium gluconate. PEBT corrected all the cardiac abnormalities and returned enough hemodynamic stability to permit continuous veno-venous hemodialysis for renal failure and removal of toxins. PEBT is a safe and innovative option for correcting the metabolic abnormalities that result in cardiac dysfunction, which is typically the most serious and usually terminal event in PRIS. When done with small aliquots, it avoids the severe hemodynamic instability that is usually a hindrance with hemodialysis, continuous veno-venous hemodialysis, and extracorporeal membrane oxygenation, which are other methods of supporting these children during the crisis that are mentioned in the literature. |
Q:
How can I tell if my hard drive(s) have Battery Backed Write Cache?
How can I tell if my hard drives have a battery backed write cache (BBWC)?
How can I tell if it is enabled and/or configured correctly?
I don't have physical access to my server. It's a GNU/Linux box.
I can provide supplemental incremental information/details as requested. My frame of reference is that of a DBA -- I have access and privileges, but (usually) only tread where I know am supposed to. :)
A:
I've never actually seen battery backed write cache in harddisks - only in RAID controllers. How to query the controller is rather specific to your hardware. It will almost certainly require root privileges on the box.
For example, using Dell PERC controllers, and having dell-omsa-repository installed, I can do:
# omreport storage battery
List of Batteries in the System
Controller SAS 6/iR Integrated (Slot Embedded)
No Batteries found
On another server:
# omreport storage battery
List of Batteries in the System
Controller PERC 4e/Di (Slot Embedded)
ID : 0
Status : Ok
Name : Battery 0
State : Ready
Recharge Count : 0
Max Recharge Count : 1100
Predicted Capacity Status : Not Applicable
Learn State : Not Applicable
Next Learn Time : Not Applicable
Maximum Learn Delay : Not Applicable
I haven't been able to find right now how to ask it what the current write cache setting is, but I think I've seen it in there before. However, if you're not using Dell RAID controllers, you will need different software.
|
Category: West Bay
COVENTRY, R.I. (WPRI) — State Sen. Nicholas Kettle allegedly sent nude photos of his girlfriend to a friend in exchange for similar photos of the friend’s wife, according to a court document obtained by Eyewitness News.
The state police affidavit, filed in Kent County District Court, lays out the case for a video voyeurism charge against Kettle. He was arrested on the charge on Friday after an investigation that involved the seizure of multiple cell phones, iPads and computers.
The case is separate from two extortion charges filed against Kettle. Those stem from a secret grand jury indictment that was unsealed Monday.
In the video voyeurism affidavit, State Police Detective Robert Hopkins says Kettle’s girlfriend at the time came into the State Police barracks with Kettle’s iPad, which he had left at her house. She said she found text messages on it between Kettle and a friend, in which Kettle shared nude photos of the girlfriend.
“He sent explicit pictures of now I believe his ex-girlfriend to another subject out of state without her knowledge,” Lt. Col. Joseph Philbin said.
The photos, according to the affidavit, all showed the girlfriend looking in the other direction. She said she had no idea the photos were taken.
According to the affidavit, Kettle sent the friend photos of his girlfriend while the friend sent nude photos of his wife. The two met in the Boy Scouts, according to Kettle’s girlfriend.
“Mr. Kettle stated that he needed to be ‘stealthy’ and was asking [the friend] for advice on how to take a video without [his girlfriend] knowing,” Detective Hopkins writes in the document. Hopkins also said the text messages with the nude photos had been deleted from Kettle’s iPhone, but had synced to other devices including his iPad via iCloud.
Police also executed a search warrant at Kettle’s friend’s house in New Hampshire, seizing his electronic devices.
Kettle was arraigned by a justice of the peace on one count of video voyeurism on Friday. An arraignment in Kent County District Court has not yet been scheduled.
Kettle’s attorney, Paul DiMaio, said he doesn’t believe the facts of the case amount to video voyeurism because the statute requires the photos be taken for “sexual gratification.”
In a separate case Monday, Kettle was indicted on two counts of extortion, accused of threatening and attempting to compel a Senate page to have sex with him. Both the Democratic and Republican leaders of the Senate have called for his resignation, and said they would support a vote to expel him from the Senate.
PAWTUCKET, R.I. (WPRI) — Marcus Crook says he was surprised when he was picked up by police at his job in Connecticut back in December, and sent to Rhode Island to face charges in an alleged check-cashing scheme from 2016.
The 30-year-old Pawtucket man was charged with three crimes, accused of cashing checks from the business account of attorney Robert McNelis at a local establishment, which lost more than $7,000 in the alleged scheme.
“He used me as a scapegoat,” Crook said in an interview with Eyewitness News on Thursday.
“Every check that was cashed, I was directed to do by Rob,” Crook said. “I had no reason to believe that anything I was doing was illegal.”
Crook, who said he knew McNelis because the lawyer had considered representing him in a civil case, told State Police that McNelis had directed him to cash the checks. Police said Wednesday: “The investigation corroborated certain key aspects of what Mr. Crook had told investigators.”
“I had text messages back and forth between Rob and I,” Crook said. “State Police aren’t going to go arrest him on 11 counts just on the word of me.”
State Police spokesperson Laura Meade Kirk declined to comment on those text messages on Thursday. But McNelis’ attorney–his twin brother Ryan McNelis–claims the texts are fabricated.
“A doctored, fabricated text record that Mr. Crook created by a cloned cell phone,” Ryan McNelis said in an interview on Wednesday.
Ryan McNelis said his brother maintains his innocence, and believes he will be exonerated as the case is adjudicated. He also contends that Crook stole his checkbook from Robert McNelis’ Johnston law office.
“He had access to the building and raided my brother’s office while my brother was away,” Ryan McNelis said.
“I didn’t steal them from his office,” Crook countered, claiming Robert McNelis handed him the checks. “I was actually sitting on his couch at his house.”
Crook says McNelis told him he needed the cash to pay back a woman from a case that was the subject of a disciplinary matter before the Supreme Court in 2016. According to the court order, McNelis had a non-lawyer assistant who had access to his financial accounts, and overcharged a client. McNelis paid the woman back $9,100, and was publicly censured by the court for his “recklessness.”
The court said he had ample time to learn from his errors after a previous public censureship in 2014.
McNelis was arrested at the Garrahy courthouse in Providence on Wednesday, and later arraigned and released on personal recognizance. His brother said he was heading on a belated honeymoon to Europe on Thursday.
Crook has a lengthy criminal record, and acknowledges he has broken the law on multiple occasions. He said McNelis paid him to cash the checks back in 2016, and he needed the money at the time.
“I’m responsible for what I do, and what I do wrong,” Crook said. “That’s all on me.” But he says he feels that the attorney exploited him in this case.
“A lawyer who’s supposed to have my best interest at heart,” Crook said. “Instead of having my best interest at heart, he used me as a scapegoat.”
BOSTON, Mass. (WPRI) — Occasionally choking back tears, a Warwick man who plotted to behead a conservative blogger renounced ISIS in a Boston courtroom Wednesday morning, vowing to become a productive member of society after he serves time for his role in the terrorist plot.
Nicholas Rovinski, 27, was sentenced to serve 15 years in prison for conspiring to support ISIS and conspiring to commit an act of terrorism. He will receive credit for time served behind bars since his arrest in June 2015.
Assistant U.S. Attorney Stephanie Siegmann acknowledged in court that Rovinski differed from other federal terror subjects in that he has publicly renounced ISIS and was willing to cooperate with federal investigators, including testifying for three days against his co-conspirator David Wright.
Siegmann said Rovinski never complained nor wavered in his decision to cooperate during long prep sessions for his testimony, even as threats were made to kill him and his family and to behead his cat.
Rovinski, Wright and Wright’s uncle Usaamah Rahim all plotted to behead conservative blogger Pamela Geller back in 2015, after ISIS (also known as ISIL or the Islamic State Group) issued a decree urging members to kill her over a cartoon contest of the Prophet Muhammad. The plot was never carried out.
“I’m striving to be a new man,” Rovinski said in court Wednesday. “I accept responsibility for my actions.” He said his crimes, for which he pleaded guilty in 2016, were full of “animus” and “evil.”
Rovinski also said he hopes to be a productive member of society upon his release, aiming to do charity work to help the poor and veterans. “He feels really badly about having signed on to an ideology that is inimical to the military forces that protect the country,” defense attorney William Fick said outside court.
While the plea agreement called for a possible sentence of 15-22 years, prosecutors and the defense team jointly recommended the lower-end 15 year sentence on Wednesday.
“There’s no doubt that the defendant…posed a grave threat to the United States in June 2015,” Siegmann said. She said his diagnosis of cerebral palsy is “not an excuse, but part of why he was so swayed” by Wright.
After his arrest, Rovinski wrote two letters in prison to Wright, continuing to express a desire to recruit people to ISIS. But prosecutors said he later denounced the ideology and has fully cooperated since.
In emotional letters to the court, Rovinski’s family members described him as someone who had trouble fitting in, in part because of his disability, and asserted he was “brainwashed” by Wright after Rovinski turned to Islam following some troubled teen years.
“They knew he was vulnerable and naive, and that he was a lost young man trying to fit in and find friends,” Rovinski’s mother Lori Rovinski wrote in a letter to the court, asking for leniency.
“If he hadn’t had the misfortune for encountering Mr. Wright online, this phase may have gone by unnoticed,” said Fick.
Still, Fick agreed the sentence as fair, while also calling it an “extremely, extremely severe punishment.”
Judge Bill Young recommended that Rovinski be placed at FCI Danbury in Connecticut, a low-security facility where he would participate in a skills program. He was also ordered to have no contact with Pamela Geller, and to be on supervised release for the rest of his life once he completes his sentence.
“These are most serious crimes,” Young said to Rovinski. “I’m glad you can acknowledge how fair the government has been.”
Marco Palombo, 53, was booked and briefly placed in a jail cell at the very department where he was once chief Thursday night. He was released on personal recognizance and is due in court on Dec. 12 to face charges of domestic disorderly conduct and domestic simple assault.
According to the 11-page arrest report obtained by Eyewitness News, police were called to Palombo’s home by a family member who reported he was “out of control,” before the call disconnected.
Officers who responded to Palombo’s home were told he had struck his wife. “I observed the skin on her right cheek and neck to be covered in red irritation consistent with being slapped,” Sgt. Ryan Shore wrote in the report.
Shore also said Palombo’s wife reported the alleged assault was part of a pattern of abuse.
“[She] went on to state that this isn’t the first time that physical abuse had occurred and she had also had to have surgery on her thumb due to a prior incident which went unreported to police,” the report said.
Palombo was informed at his home that he would be arrested, and was “extremely reluctant and irritated by the decision,” according to police, and asked to speak to someone with a higher rank.
Palombo was arraigned by a justice of the peace at the Cranston Police Department Thursday night and released on $1,000 personal recognizance.
The office of attorney Peter DiBiase confirmed he is representing Palombo in the criminal case, but declined to comment on the charges.
EAST GREENWICH, R.I. (WPRI) — The East Greenwich Town Council voted 3-2 to re-appoint Gayle Corrigan as town manager Monday night, after a previous meeting to do so was cancelled because the room where it was held was over capacity.
#BREAKING: Council votes 3-2 to appoint Gayle Corrigan as East Greenwich Town Manager again. @wpri12
Judge Susan McGuirl said the town council “misled” the taxpayers when it violated the state’s Open Meetings Act, failing to properly notify residents of meetings.
At last week’s meeting, held in response to the court order, townspeople showed up in droves to oppose Corrigan’s re-appointment. When the meeting was cancelled, they moved down the road to air their grievances.
“I understand that the residents are angry,” council president Suzanne Cienki told Eyewitness News on Monday. “They should be angry. And we’ve got to do a better job of communicating to the residents exactly what is going on. We have been horrible at that.”
Cienki said she still supports re-appointing Corrigan as town manager, in part because she trusts Corrigan’s ability to turn around the “fiscal mismanagement” of the town. She said Corrigan likely wouldn’t stay in the post for a long time, and Cienki still wants to post the job and conduct a full search for a permanent town manager.
Councilman Mark Schwager, the lone Democrat on the council, said the best course of action would be for Corrigan to step aside, in order to restore public trust in government.
“She has become a lightning rod for divisveness and disruption, and I don’t think she can be effective in this position,” Schwager said.
WARWICK, R.I. (WPRI) — A Warwick police officer and a second person were taken to the hospital Thursday following a hazardous materials incident at CCRI’s Knight campus.
The incident took place at about 12:30 p.m. in the area of the athletic fields, which is currently closed off. A hazmat team and other emergency responders remain on scene.
City officials said the officer went to check on a homeless person and began to feel faint after coming into contact with an unknown substance. The officer was treated with Narcan at the scene and taken to the hospital, along with a civilian worker. Both are expected to be OK, according to officials.
Four additional police officers were treated on scene.
The school sent out an alert to students and staff, assuring there’s no threat to the community and noting that the campus’s Commonwealth Avenue entrance is closed.
Commonwealth entrance at Warwick campus is closed because of hazmat incident in the woods. There is no danger to the community.
Cranston spokesman Mark Schieldrop confirmed to Eyewitness News that Deputy Chief Paul Valletta has been taken off administrative leave, more than a month after the city placed him on paid leave following his arrest.
Further information on why Valletta was allowed to return to work was not immediately available.
Valletta – who is also the head of the city’s firefighters’ union, IAFF Local 1363, and an influential State House lobbyist – was arrested last month on misdemeanor charges of simple assault and disorderly conduct following an incident at fire station 6 that was reportedly captured on audio recording. He was placed on leave two days after the incident.
According to a police affidavit, Valletta and Lt. Scott Bergantino got into an argument about overtime, and Bergantino made a disparaging remark about Valletta’s mother.
The affidavit states Bergantino told police, “Deputy Chief Valletta approached him and pushed him up against the chalkboard, punched him in the head two times, and then threw him over a recliner and onto the floor.”
Chip Muller, an attorney representing Bergantino, said his client suffered a concussion in the alleged assault.
Valletta pleaded not guilty to the charges late last month and told Eyewitness News outside court, “I’m looking forward to the truth coming out, then I’ll be back to work doing what I love doing.”
According to the online court schedule, Valletta is due for a pretrial conference on Thursday.
Francis Kinsey, 74, faced a judge Tuesday afternoon. The judge ordered him to undergo an evaluation to determine if he’s mentally competent to stand trial.
Coventry Police arrested Kinsey on Saturday after an employee at the Coventry Center Skilled Nursing and Rehabilitation home reported witnessing him sexually assaulting an 80-year-old woman.
Kinsey, who police said was a resident at the nursing home, was charged with first degree sexual assault.
Police said Kinsey has also been awaiting trial for a 2012 child molestation case out of Charlestown.
Amy Kempe, spokesperson for Attorney General Peter Kilmartin, said that case has been delayed while Kinsey has been in the nursing home with significant medical problems. He appeared in court Tuesday in a wheelchair and missing one of his legs.
“The safety of the patients and residents in our skilled nursing center is our number one priority,” said Jeanne Moore, a spokesperson for the Coventry Center. “When we receive a report like this from any source, be it patient, family or one of our employees, we investigate the allegation and report it to local law enforcement and the Department of Health as appropriate.”
Moore declined to comment on whether the center knew about Kinsey’s previous charges, or whether the center conducts any sort of background check before admitting patients.
Kathy Heren, the state’s long-term care ombudsman who advocates for the elderly, said she was notified about the alleged assault on Saturday. She called the case “very unusual,” and said the nursing home was not aware of the pending charges against Kinsey.
Heren said she often advises nursing homes on a case-by-case basis when a criminal offender is requesting to be admitted to the home. In most cases, she said, offenders live out their days in the homes without a problem.
A spokesperson for the Department of Health said there are no state regulations about admitting criminals or alleged criminals into nursing homes.
Carolyn Medeiros, the executive director of the Alliance for Safe Communities, said she wants nursing homes to be able to place surveillance cameras in the rooms of residents. She pushed for a 2013 bill that would have allowed the cameras, with permission from the resident’s family. It did not pass after groups like the ACLU testified against it, citing privacy concerns.
“The worst case scenario is an 80-year-old woman facing something like this,” Medeiros said in an interview with Eyewitness News. “It’s just unthinkable.”
She also suggested housing sexual offenders–out on bail or convicted–in separate housing from the rest of the elderly population.
“I don’t believe he should’ve been put in a facility with innocent, elderly people,” she said. “Would you want your grandmother….or your mother subjected to this?”
Heren said there currently isn’t anywhere else for alleged criminals or convicted felons to go for nursing home care, but said she would support a separate dedicated facility for certain offenders to live out their days. She said she often deals with ACI inmates being released into nursing home care.
Heren also said she opposed the surveillance cameras, also known as “granny cams.” She said it’s difficult to make sure that a resident’s roommate is not recorded on the camera if they have chosen to opt out of the surveillance program, and she said residents may not agree with the decisions their families make for them regarding the cameras.
CRANSTON, R.I. (WPRI) – It was mid-September when police put out a “Code Red” sex offender notification about a man living in a Cranston neighborhood who had been convicted of sexually assaulting two women. The 27-year-old is a “level 3” sex offender, which means he’s considered at high risk to reoffend.
That’s when the calls starting coming in to Cranston Police.
“The property directly abuts the preschool, so you can imagine the concern that’s there,” Colonel Michael Winquist said in an interview with Eyewitness News.
Neighbors questioned why the man had been allowed to register at that address when a school was so close by. A state law passed in 2015 should have stopped him from living within 1000 feet of a school.
“Obviously those laws are in effect to protect people in the neighborhood,” Winquist said. But his hands are tied, he explained, because of a legal battle over the law that has left it unenforceable for two years.
The class-action lawsuit was filed in federal court back in 2015 with the help of the ACLU, on behalf of seven level 3 sex offenders. The lead plaintiff, John Freitas, has since died. But the remaining six have continued fighting the 1000-foot law, and a federal judge has put a restraining order on the law while the legal challenge is ongoing.
“Right now there’s nothing to stop someone from living immediately next to a school,” Winquist said.
The lawsuit claims offenders’ rights are violated by the 1000-foot residency requirement, forcing them to move from their homes even if they lived there prior to incarceration. In many cases, according to the suit, offenders are staying with family and would become homeless if they had to move.
The definition of “school” is also undefined in the 2015 law, leaving individual cities and towns to determine when a sex offender is in violation. The suit says the word “could be interpreted to include an adult dance school, a yoga studio, or a school for the culinary arts, cosmetology, or martial arts.”
“Nothing happened, no child was harmed that precipitated this law,” said Megan Smith, an outreach worker at the House of Hope, a nonprofit that helps people dealing with homelessness and housing issues.
She and other advocates mobilized after the 2015 law was passed, identifying and contacting more than 30 level 3 sex offenders across the state who lived within 1000 feet of a school and could potentially be forced to move.
“Had the 1000-foot law been implemented, it would have put 64% of the city of Providence off limits,” Smith said.
She says as it is, few landlords are willing to rent to sex offenders, and public housing authorities won’t accept them as applicants. Assuming sex offenders can find a market-rate apartment willing to house them, Smith say many can’t find high enough paying jobs to afford the rent.
Because of this problem, dozens of sex offenders in Rhode Island are homeless. Col. Winquist estimated 45 are currently living in Harrington Hall in Cranston, one of the few shelters that accepts them. Police regularly stop by the shelter to do compliance checks, but police and advocates agree that sex offenders will have better success reintegrating into society if they have permanent housing.
“By having someone have a permanent residence, statistics show they’re less likely to offend,” Winquist said.
Potentially compounding the problem could be a new law passed during a special session last week, limiting the number of registered sex offenders in a homeless shelter to 10% of the total population.
“If it is signed by the governor…it would make 40-50 people immediately street homeless” in the state, Smith said.
Numerous organizations including House of Hope, the ACLU, Crossroads, Amos House and the Roger Williams University School of Law have asked the governor to veto the bill.
A spokesperson for Gov. Gina Raimondo did not return a phone call or email Thursday asking whether the governor would sign it into law.
Meanwhile, the legal challenge over the 1000-foot residency requirement remains ongoing. The federal lawsuit is still in the discovery phase.
The attorney general’s office says the restraining order against the 1000-foot rule actually allows level 3 sex offenders to live closer to schools than lower risk offenders; the law keeping level 2 sex offenders 300 feet back is still in effect.
In the meantime, police are conducting sex offender notifications and patrolling areas where level 3 sex offenders live. Sex offenders are still held to strict registry requirements, and have to pass frequent compliance checks.
WARWICK, R.I. (WPRI) — The city of Cranston’s deputy fire chief faced a judge Tuesday on criminal charges tied to an alleged fight with a lieutenant that was captured on audio recording.
Paul Valletta, who’s also the head of the city’s firefighters’ union, IAFF Local 1363, was arraigned Tuesday on misdemeanor charges of simple assault and disorderly conduct.
“I’m looking forward to the truth coming out, then I’ll be back to work doing what I love doing,” Valletta said after leaving court. He walked away without commenting further.
According to a police affidavit obtained by Eyewitness News, Lt. Scott Bergantino and Valletta got into an argument on Sept. 9 at fire station 6, where firefighters had gathered to participate in a “Fill the Boot” drive. According to the complaint, Bergantino and Valletta began to argue about overtime, and Bergantino made a disparaging remark about Valletta’s mother.
The affidavit says Bergantino told police, “Deputy Chief Valletta approached him and pushed him up against the chalkboard, punched him in the head two times, and then threw him over a recliner and onto the floor.”
According to court documents, Bergantino recorded audio of the altercation and turned it over to police. Multiple other firefighters also witnessed the altercation.
Both Valletta and Bergantino were placed on paid leave two days after the incident, according to Cranston Mayor Allan Fung’s spokesperson Mark Schieldrop. He said Mayor Fung was notified of the altercation one day after it happened, and initiated an internal investigation.
Chip Muller, an attorney representing Bergantino, said Tuesday that his client suffered a concussion in the alleged assault.
Muller said Bergantino was “concerned for his safety” when it comes to returning to work, in part because of a “rift” that has emerged at the fire department in light of the incident.
“We hope the prosecutors and the courts take the assault charge seriously,” Muller said. “It’s bad enough for a citizen to do that to another human being, but to have a superior do that to another person at work is just outrageous.”
Muller also said Bergantino plans to file a union grievance about the overtime issue.
The vice president of the firefighters’ union on Tuesday said Valletta is still the union’s president, but has recused himself from the grievance committee until the case is resolved.
Valletta entered a not guilty plea and is due back in court on October 26. |
Laboratory Title: Introduction to Loops and Subroutines in Assembly Language
Objectives:
1. To become familiar with conditional branch instructions
2. Understanding how to write loops
3. Understanding how to write subroutines
Results:
Able to create a program that gets the sum of the values in an array, as well as multiple arrays
Conclusions:
This week lab taught us how to write not only one loop but two loops in one single program. At first, it was difficult to execute subroutine instructions. But after going over notes and lectures, we understand how to use subroutines.
Team: May Saw EET
Name Program Signature
Observations/Measurements:
IV. 1.A. Copy and paste the source code.
IV. 1. B. Copy and paste the register window at the second iteration where the carry becomes set. Highlight the carry flag to show that it is set.
IV. 1. C Copy and paste the register window to show the final result. IV. 2.A. Copy and paste the source code.
IV. 2. B. Copy and paste the assembly, register, and memory after the first JSR instruction to verify that stack holds the return address.
IV. 2. C Copy and paste the memory window to show the values of Sum1 and Sum2.
Questions:
1. What does the CPU do (in terms of register contents and stack) when it executes a JSR instruction?
2. What does the CPU do (in terms of register values and stack) when it executes a RTS instruction? |
Alaska Cruise Ports – Highlights and My Favorite Excursions
Thousands flock to the icy waters of Alaska every year in order to tick off an important bucket list trip – an Alaska cruise. I was one of those thousands just a few weeks ago when I joined the Holland America Line ship the Westerdam on a remarkable sailing from Anchorage to Vancouver. While there were many highlights onboard the ship and en route to our destinations, ultimately the individual ports of call formed the base of my most important experiences. While similar, each stop has its own quirks and features that make it unique, so today I thought I’d share what I enjoyed doing the most and what I think are fun ways to explore these Alaska cruise ports.
Seward
Since reaching Alaska from the East Coast isn’t a short travel day, like most passengers we arrived into Anchorage the day before the start of the cruise to make sure we arrived on time. Instead of killing time in the city before taking the 2-hour transfer to our embarkation point in Seward, I instead booked a fun alternative through Holland America – a day on the water exploring Kenai Fjords National Park. Adjacent to the cruise port in Seward, it was the ideal way to experience even more of Alaska’s beauty before joining the cruise. Named for the fjords carved by glaciers moving down from the ice fields, Kenai is one of the most accessible and visited national parks in the state. It’s home to at least 38 glaciers and an abundance of wildlife, all of which is seen on the daylong boat cruise around the park. The tour was seamless leaving from Anchorage and then transferring directly to the boat in Seward. Once onboard, the commentary and guiding by the staff was excellent with every attempt made to provide the packed vessel with an experience no one will soon forget. We cruised past massive glaciers, lounging seals and even caught sight of breaching whales. It was a fun first introduction to the beauty of Alaska and the ideal way to spend the day before embarkation.
Haines & Skagway
While it’s more common for cruise ships in this part of the state to dock in Skagway, many – like the Westerdam – dock in nearby Haines, which does have a certain charm of its own. I chose though to spend the day in Skagway, famous for its heritage look and feel as well as a certain train. Skagway grew to prominence when gold was discovered in the nearby Klondike region of Canada and the town swelled in size and importance overnight. It was then when the White Pass and Yukon train route was built to carry prospective miners from the town into Canada to reach the goldfields. The train actually continued until 1982 and while today it’s been revived as a scenic train ride, the look and feel of the gold rush era is very much alive. Using heritage train cars, the route goes through rugged and incredibly beautiful terrain, taking visitors into the Alaskan bush that they’ve never otherwise be able to experience. Afterwards I spent the afternoon exploring Skagway before taking the ferry back to Haines. Although I didn’t have a lot of time to experience Haines, the day spent in Skagway was fun and certainly unique.
Juneau
The capital of Alaska, Juneau is definitely a quirky place. Thanks to nearby mountains and a glacier there’s no way to reach the city by land, only by air or sea and while it’s one of the nation’s smallest capitals in terms of population, it’s the largest in size. Wanting to take it a little easy, I booked a quick excursion out to see the famous Mendenhall glacier, followed by a trip on the Mount Roberts tramway. By that point on the cruise I had become used to seeing glaciers, a strange sight to become accustomed to really. But Mendenhall is just as incredible as the others I had seen and certainly one of the most accessible featuring a fantastic interpretative center and several easy hikes around the park. Returning to the heart of Juneau, I spent the afternoon wandering around, enjoying lunch, buying far too much fudge and eventually taking the tramway up to nearby Mount Roberts. Included in the excursion package, I’m glad I went up to the top for the incredible views, but the 30-minute wait to return to terra firma was an unexpected annoyance. If you take the tramway, try to time it so you’re not trapped on top with a few hundred other cruisers. Juneau though is an easy place to explore as well as enjoy, and the day spent there was a lot more interesting than I had imagined.
Ketchikan
My favorite stop on the cruise, I fell in love with Ketchikan almost immediately, although I can’t tell you why; at least, not exactly. When the logging industry left the area, the town made the decision to develop its tourism infrastructure, building a cruise port and renovating the downtown core. While there are far too many diamond stores near the cruise port, once you walk a block or so away you start to discover the real town and what makes it so special. I was excited to visit though thanks to a very special excursion I had booked and one I couldn’t wait to join – a floatplane ride out to Neets Bay to look for bears. Before leaving for Alaska, someone told me that no matter what, to make sure that I saw Alaska from the air at least once, and boy were they right. Jumping into a floatplane, I was excited not just to enjoy this typically Alaskan form of transportation, but to see the region around Ketchikan from the air. The goal was to fly out to Neets Bay to visit a salmon hatchery and hopefully see some bears in the wild. While we never saw bears, the time spent flying over Alaska was alone worth the entire trip. Soaring over snow-capped peaks, mountain lakes and the massive Tongass National Forest, it was a plane ride that I know I’ll never forget. There’s a lot to see and do in Alaska, just make sure you heed the same advice I did and hop in a plane or helicopter to experience the enormity of the state in the best possible way.
Vancouver
The cruise ended in Vancouver, where the cruise port is conveniently located in the heart of the city. As it had been many years since I last visited this colorful city, I planned on spending a couple of nights in Vancouver so I could explore and enjoy everything it has to offer. Knowing that cruise ship disembarkation always takes place early in the day, I booked an excursion on my own that made getting around that day easy and fun. Landsea Tours operate a number of experiences in and around Vancouver, and I joined their special Post-Cruise Vancouver Delights Tour that picked me up from the cruise ship terminal. From there the small-group tour spent the day exploring the best of Vancouver from Stanley Park and Granville Island, to a generous amount of time at the Capilano Suspension Bridge Park. Even better, the tour included drop-off at our hotel, meaning that the day was easy and convenient. It was the best way to disembark and experience the city, instead of schlepping to the hotel, dropping off bags and waiting until check-in time. The tour was also a fantastic reintroduction to Vancouver.
Any cruise will have a number of optional excursions, and that’s certainly the case on an Alaska cruise. In fact, I was a little overwhelmed by the amazing choices offered by Holland America in the Alaska cruise ports, knowing that none would be bad but that I simply didn’t have the time to do everything I wanted. Looking back at the trip now though, I think I chose a great selection of excursions, each one different from the others and providing a fantastic first experience in the 49th state.
Subscribe and get my free ebook!
Subscribe to the LandLopers newsletter and get a free copy of my new book, "My Favorite 50 Travel Photos."
By: Matt Long
Matt has a true passion for travel. As someone who has a bad case of the travel bug, Matt travels the world in order to share tips on where to go, what to see and how to experience the best the world has to offer.
Also follow Matt on Twitter, Facebook and Google Plus. |
Directions
Trivia
If you take the path left of the gallows and walk slowly you may catch a glimpse of a shadow man. As you step closer, it will hide behind a pillar and won't come back out till you leave.
One prisoner resembles Sabitsuki.
This area did not have music until Ver. 15.
Theories
This area may be how she feels about the hospital, this is furthered by the prisoner that resembles a darker version of Sabitsuki, she may feel as though she's a prisoner at the hospital she was at, also bringing the theory that she was under constant surveillance into consideration may possibly add on to that, also there is a guillotine in the area that leads to Hell, that may be a view on people on dying from the disease, or possible human euthanizing, and the Reapers next to the guillotine may represent the doctors that either performed the euthanizing or simply took away the dying subject. |
Condensation of Si-rich region inside soda-lime glass by parallel femtosecond laser irradiation.
Local melting and modulation of elemental distributions can be induced inside a glass by focusing femtosecond (fs) laser pulses at high repetition rate (>100 kHz). Using only a single beam of fs laser pulses, the shape of the molten region is ellipsoidal, so the induced elemental distributions are often circular and elongate in the laser propagation direction. In this study, we show that the elongation of the fs laser-induced elemental distributions inside a soda-lime glass could be suppressed by parallel fsing of 250 kHz and 1 kHz fs laser pulses. The thickness of a Si-rich region became about twice thinner than that of a single 250 kHz laser irradiation. Interestingly, the position of the Si-rich region depended on the relative positions between 1 kHz and 250 kHz photoexcited regions. The observation of glass melt during laser exposure showed that the vortex flow of glass melt occurred and it induced the formation of a Si-rich region. Based on the simulation of the transient temperature and viscosity distributions during laser exposure, we temporally interpreted the origin of the vortex flow of glass melt and the mechanism of the formation of the Si-rich region. |
Spotlight & Excerpt from Rough Rider by Victoria Vane
Two wary hearts …
Janice Combes has two loves, bucking bulls and Dirk Knowlton. But Dirk only has eyes for a dazzling rodeo queen. How can Janice ever compete while mired ankle-deep in manure? Exchanging playful banter with Dirk is all Janice can expect—until the stormy night he knocks on her door dripping wet and needing a place to crash.
Different Dreams…
Dirk Knowlton is living the cowboy dream. Life should be good—roping, branding, backing broncs, riding bulls, but there's a void he can't seem to fill. After getting hung up by a bull, he wonders if this is really the life he wants. Restless and rebellious, he bolts…but there’s a certain cowgirl he can’t forget.
When a battle-scarred Dirk returns to his Montana ranch he's determined to hang on at any cost. Janice has come back home to lick her own wounds. When old dreams turn to dust, can two wary hearts take another chance on love?
“A “red-hot cowboy tale...their sexual chemistry crackles. Well-paced, scorching scenes and witty banter move the story along while setting the stage for Wade’s war-hero brother to find his own true love in the next installment.” – Publishers Weekly
“SLOW HAND by Victoria Vane is delightful, funny, page turning steamy sexy… I'm beginning to think Victoria could write a phone book and make it sexy.” – Unwrapping Romance
He looked abashed. “We didn’t just have to leave the party, we got kicked out of the hotel too.”
“Evicted from your room?”
“Yup. And there aren’t any others available in all of Casper.”
“I know,” she said. “It’s why I’m camped out here.” She paused to digest what he’d left unsaid. “So you and Rachel?”
He shook his head with a scowl “We’re done now. Quits.”
“You’re kidding.”
“Nope. History. Case closed.”
“It’ll blow over.”
“Don’t think so. It was her idea to boot us. Said she didn’t give a shit if I had a room tonight or not. Then I couldn’t even try finding anything outside of town because my asshole brother took my keys so I wouldn’t drive. My next move was to pilfer a blanket and pillow and camp out under the stars in my truck bed, but then it started pouring on me.”
“So you came here. How’d you do that with no wheels?”
“Walked.”
“Three miles in the pouring rain? No wonder you look like something the cat dragged in.”
“Can I crash for a coupla hours? Maybe just camp out in the back seat of your dually? All I need is to get warm and dry again.”
Misreading her silence he mumbled a curse. “Sorry, Janice. It’s my damned head. I’m not thinkin’ right. It’s still throbbing like hell. Haven’t been myself all night. M’pologies for being such a dumb-ass and imposing on you—” He turned to the door.
“No! Wait. It’s not that.” She grabbed his sleeve. “I was just thinking of your injuries. You don’t need to make matters worse by sleeping all cramped up in the truck.” She gnawed her lower lip and then blurted. “Y-you wanna just stay here instead?”
“Here? That’s mighty generous but there isn’t a whole lot of room for both of us.” He glanced up at the gooseneck with a frown. “If you’ll just gimme a blanket, I’ll take the floor.”
“You don’t need to do that,” she said. “The bench here flips down over the table and converts into a single. It’s really narrow and not very comfortable, but still better than the truck. Warmer anyway. Besides you need to get dry.”
“You sure about this?” he asked.
“Yeah.” She smiled. “What are friends for? I’m sure I’ve got a shirt for you too.”
“Thanks, Red. That would be great.”
Red? The single syllable rippled warm and tingly, all the way to her toes. He followed up with a lopsided grin that stopped her in her tracks. She turned to the small cabinet that served a dual function as dresser and closet and shut her eyes on a sigh—but the same air stuck in her throat the minute she turned back around.
He’d shed the denim jacket. And the black tee. His bare torso with well-developed pecs and a mouthwatering six pack greeted her. He was drying his face with his discarded shirt. Janice tore her gaze away and cleared her throat. “Here.” She thrust an extra-large Dixie Chicks T-shirt into his hands, a souvenir from their Top of the World Tour. “I—I can get you a towel too.”
He eyed the shirt skeptically. “No thanks.”
“What? You don’t like female musicians?”
“Don’t like their politics. Natalie should just shut up and sing.”
“Ah.” She nodded slowly. The shirt was from the tour that caused the “incident.” A lot of her friends had since thrown out their Dixie Chicks CDs, but Janice still loved their music. “I Can Love You Better” was her favorite. The lyrics, she’s got you wrapped up in her satin and lace. Tied around her little finger…but I can love you better, perfectly summed up all the heartbreak and frustrations of unrequited love; all her secret feelings for Dirk. She only wished she could show him now that he was here. In the flesh. A big strong, blue-lipped and teeth-chattering fantasy come true.
Victoria Vane is a multiple award-winning romance novelist and history junkie whose collective works of fiction range from wildly comedic romps to emotionally compelling erotic romance. Victoria also writes historical fiction as Emery Lee and is the founder of Goodreads Romantic Historical Fiction Lovers and the Romantic Historical Lovers book review blog. |
NZC congratulates Auckland Aces
New Zealand Cricket has congratulated the Auckland Aces on qualifying for the main draw of the Champions League Twenty20 competition in South Africa.
The Aces won both their qualifying matches against Pakistan’s Sialkot Stallions and English side Hampshire and will now join nine other teams to vie for the top prize.
Having beaten Sialkot by six wickets early on Wednesday morning, they then ensured their progression with a comprehensive eight wicket win over Hampshire earlier today.
They now go into Group B where they will play four pool matches and be required to finish in the top two to progress to the semi-finals.
“Progressing past the qualifying stage is an excellent achievement,” said NZC Chief Executive, David White.
“It shows that the teams in the New Zealand HRV Cup competition have the quality to compete with sides from any league in the world and we’re looking forward to watching Auckland closely in the main event.”
The Aces will play the first of their pool matches against the Kolkata Knight Riders on October 16 at 4:30am NZ time. |
jLoader.Initialize( "login-join" );
jLoader.Login_join = function ( ) {
// Add form validation to the join form.
$("#join").validate();
}
|
Q:
Understanding typedefs for function pointers in C
I have always been a bit stumped when I read other peoples' code which had typedefs for pointers to functions with arguments. I recall that it took me a while to get around to such a definition while trying to understand a numerical algorithm written in C a while ago. So, could you share your tips and thoughts on how to write good typedefs for pointers to functions (Do's and Do not's), as to why are they useful and how to understand others' work? Thanks!
A:
Consider the signal() function from the C standard:
extern void (*signal(int, void(*)(int)))(int);
Perfectly obscurely obvious - it's a function that takes two arguments, an integer and a pointer to a function that takes an integer as an argument and returns nothing, and it (signal()) returns a pointer to a function that takes an integer as an argument and returns nothing.
If you write:
typedef void (*SignalHandler)(int signum);
then you can instead declare signal() as:
extern SignalHandler signal(int signum, SignalHandler handler);
This means the same thing, but is usually regarded as somewhat easier to read. It is clearer that the function takes an int and a SignalHandler and returns a SignalHandler.
It takes a bit of getting used to, though. The one thing you can't do, though is write a signal handler function using the SignalHandler typedef in the function definition.
I'm still of the old-school that prefers to invoke a function pointer as:
(*functionpointer)(arg1, arg2, ...);
Modern syntax uses just:
functionpointer(arg1, arg2, ...);
I can see why that works - I just prefer to know that I need to look for where the variable is initialized rather than for a function called functionpointer.
Sam commented:
I have seen this explanation before. And then, as is the case now, I think what I didn't get was the connection between the two statements:
extern void (*signal(int, void()(int)))(int); /*and*/
typedef void (*SignalHandler)(int signum);
extern SignalHandler signal(int signum, SignalHandler handler);
Or, what I want to ask is, what is the underlying concept that one can use to come up with the second version you have? What is the fundamental that connects "SignalHandler" and the first typedef? I think what needs to be explained here is what is typedef is actually doing here.
Let's try again. The first of these is lifted straight from the C standard - I retyped it, and checked that I had the parentheses right (not until I corrected it - it is a tough cookie to remember).
First of all, remember that typedef introduces an alias for a type. So, the alias is SignalHandler, and its type is:
a pointer to a function that takes an integer as an argument and returns nothing.
The 'returns nothing' part is spelled void; the argument that is an integer is (I trust) self-explanatory. The following notation is simply (or not) how C spells pointer to function taking arguments as specified and returning the given type:
type (*function)(argtypes);
After creating the signal handler type, I can use it to declare variables and so on. For example:
static void alarm_catcher(int signum)
{
fprintf(stderr, "%s() called (%d)\n", __func__, signum);
}
static void signal_catcher(int signum)
{
fprintf(stderr, "%s() called (%d) - exiting\n", __func__, signum);
exit(1);
}
static struct Handlers
{
int signum;
SignalHandler handler;
} handler[] =
{
{ SIGALRM, alarm_catcher },
{ SIGINT, signal_catcher },
{ SIGQUIT, signal_catcher },
};
int main(void)
{
size_t num_handlers = sizeof(handler) / sizeof(handler[0]);
size_t i;
for (i = 0; i < num_handlers; i++)
{
SignalHandler old_handler = signal(handler[i].signum, SIG_IGN);
if (old_handler != SIG_IGN)
old_handler = signal(handler[i].signum, handler[i].handler);
assert(old_handler == SIG_IGN);
}
...continue with ordinary processing...
return(EXIT_SUCCESS);
}
Please note How to avoid using printf() in a signal handler?
So, what have we done here - apart from omit 4 standard headers that would be needed to make the code compile cleanly?
The first two functions are functions that take a single integer and return nothing. One of them actually doesn't return at all thanks to the exit(1); but the other does return after printing a message. Be aware that the C standard does not permit you to do very much inside a signal handler; POSIX is a bit more generous in what is allowed, but officially does not sanction calling fprintf(). I also print out the signal number that was received. In the alarm_handler() function, the value will always be SIGALRM as that is the only signal that it is a handler for, but signal_handler() might get SIGINT or SIGQUIT as the signal number because the same function is used for both.
Then I create an array of structures, where each element identifies a signal number and the handler to be installed for that signal. I've chosen to worry about 3 signals; I'd often worry about SIGHUP, SIGPIPE and SIGTERM too and about whether they are defined (#ifdef conditional compilation), but that just complicates things. I'd also probably use POSIX sigaction() instead of signal(), but that is another issue; let's stick with what we started with.
The main() function iterates over the list of handlers to be installed. For each handler, it first calls signal() to find out whether the process is currently ignoring the signal, and while doing so, installs SIG_IGN as the handler, which ensures that the signal stays ignored. If the signal was not previously being ignored, it then calls signal() again, this time to install the preferred signal handler. (The other value is presumably SIG_DFL, the default signal handler for the signal.) Because the first call to 'signal()' set the handler to SIG_IGN and signal() returns the previous error handler, the value of old after the if statement must be SIG_IGN - hence the assertion. (Well, it could be SIG_ERR if something went dramatically wrong - but then I'd learn about that from the assert firing.)
The program then does its stuff and exits normally.
Note that the name of a function can be regarded as a pointer to a function of the appropriate type. When you do not apply the function-call parentheses - as in the initializers, for example - the function name becomes a function pointer. This is also why it is reasonable to invoke functions via the pointertofunction(arg1, arg2) notation; when you see alarm_handler(1), you can consider that alarm_handler is a pointer to the function and therefore alarm_handler(1) is an invocation of a function via a function pointer.
So, thus far, I've shown that a SignalHandler variable is relatively straight-forward to use, as long as you have some of the right type of value to assign to it - which is what the two signal handler functions provide.
Now we get back to the question - how do the two declarations for signal() relate to each other.
Let's review the second declaration:
extern SignalHandler signal(int signum, SignalHandler handler);
If we changed the function name and the type like this:
extern double function(int num1, double num2);
you would have no problem interpreting this as a function that takes an int and a double as arguments and returns a double value (would you? maybe you'd better not 'fess up if that is problematic - but maybe you should be cautious about asking questions as hard as this one if it is a problem).
Now, instead of being a double, the signal() function takes a SignalHandler as its second argument, and it returns one as its result.
The mechanics by which that can also be treated as:
extern void (*signal(int signum, void(*handler)(int signum)))(int signum);
are tricky to explain - so I'll probably screw it up. This time I've given the parameters names - though the names aren't critical.
In general, in C, the declaration mechanism is such that if you write:
type var;
then when you write var it represents a value of the given type. For example:
int i; // i is an int
int *ip; // *ip is an int, so ip is a pointer to an integer
int abs(int val); // abs(-1) is an int, so abs is a (pointer to a)
// function returning an int and taking an int argument
In the standard, typedef is treated as a storage class in the grammar, rather like static and extern are storage classes.
typedef void (*SignalHandler)(int signum);
means that when you see a variable of type SignalHandler (say alarm_handler) invoked as:
(*alarm_handler)(-1);
the result has type void - there is no result. And (*alarm_handler)(-1); is an invocation of alarm_handler() with argument -1.
So, if we declared:
extern SignalHandler alt_signal(void);
it means that:
(*alt_signal)();
represents a void value. And therefore:
extern void (*alt_signal(void))(int signum);
is equivalent. Now, signal() is more complex because it not only returns a SignalHandler, it also accepts both an int and a SignalHandler as arguments:
extern void (*signal(int signum, SignalHandler handler))(int signum);
extern void (*signal(int signum, void (*handler)(int signum)))(int signum);
If that still confuses you, I'm not sure how to help - it is still at some levels mysterious to me, but I've grown used to how it works and can therefore tell you that if you stick with it for another 25 years or so, it will become second nature to you (and maybe even a bit quicker if you are clever).
A:
A function pointer is like any other pointer, but it points to the address of a function instead of the address of data (on heap or stack). Like any pointer, it needs to be typed correctly. Functions are defined by their return value and the types of parameters they accept. So in order to fully describe a function, you must include its return value and the type of each parameter is accepts.
When you typedef such a definition, you give it a 'friendly name' which makes it easier to create and reference pointers using that definition.
So for example assume you have a function:
float doMultiplication (float num1, float num2 ) {
return num1 * num2; }
then the following typedef:
typedef float(*pt2Func)(float, float);
can be used to point to this doMulitplication function. It is simply defining a pointer to a function which returns a float and takes two parameters, each of type float. This definition has the friendly name pt2Func. Note that pt2Func can point to ANY function which returns a float and takes in 2 floats.
So you can create a pointer which points to the doMultiplication function as follows:
pt2Func *myFnPtr = &doMultiplication;
and you can invoke the function using this pointer as follows:
float result = (*myFnPtr)(2.0, 5.1);
This makes good reading: http://www.newty.de/fpt/index.html
A:
A very easy way to understand typedef of function pointer:
int add(int a, int b)
{
return (a+b);
}
typedef int (*add_integer)(int, int); //declaration of function pointer
int main()
{
add_integer addition = add; //typedef assigns a new variable i.e. "addition" to original function "add"
int c = addition(11, 11); //calling function via new variable
printf("%d",c);
return 0;
}
|
Factors influencing the reliability of oral contraceptives.
The reliability of oral contraceptives (OC) is high but several known factors can potentially induce failures. The dose of estrogen (EE) has been reduced through the years. Interaction with concomitant use of other medicine is wellknown and gastroenteritis can reduce the uptake of EE. To further characterize and quantify these factors we have performed this study. Among patients admitted for legal abortion we selected those who had taken OC (only combined preparations; gestagen-only preparations were excluded) according to the prescription but nevertheless became pregnant. Various parameters were noted. Among 8058 women 70 women were found. Twenty-nine used three-phased and 25 used low-dose OC while the rest used high-dose, two-phased or unknown OC (four, five and seven patients respectively). Five patients used other medicine concurrently (salbutamol, astemizol, mianserin, chlorcyclizin, paradryl, carbamazepin, lithium, chlorprotoxin and imipramin). Sixteen patients had symptoms of gastroenteritis at the time of conception. Forty-nine patients had failure without any known influencing factors. There was no significant difference between the various OC used by the patients compared to sales of them in Denmark. About two-thirds of the patients wanted to continue with OC as future prevention. Failure of OC is a rare event but can occur in case of concurrent gastroenteritis or use of other medicine but in many cases, however, no definite cause can be determined. The EE-content of the various OC was not found to have any influence. Although OC-failure had occurred two-thirds of the patients wanted to continue the use of OC. |
Come and visit ‘crisis-hit’ police in West Yorkshire, Home Secretary urged
The body representing rank and file police officers in West Yorkshire has written to Home Secretary Amber Rudd inviting her to visit the county.
Nick Smart, chairman of the West Yorkshire branch of the Police Federation, issued the invitation a month after challenging Amber Rudd to witness the ‘crisis conditions’ local officers are working in.
According to the Federation’s website, Mrs Rudd promised to visit West Yorkshire if re-elected in the General Election, when she spoke at its annual conference in May. During a question and answer session, Mr Smart said demand on officers “has exploded”.
He said: “We’ve got custody suites that look like an A&E ward because of mental health issues. We’ve got officers sent to hospital with people who are suicidal. It’s a crisis across the country, officers are going without meal breaks, working extended hours, that’s the reality. We do not have the money or the cops to do the job.
“There aren’t enough cops to deal with the demand, so I’m going to ask you, Home Secretary, are you going to invest in the police service?
“We’re robbing Peter to pay Paul – will you give us more money? Until you resolve that we are always going to be on the back foot.”
West Yorkshire Police has lost 18 per cent of its workforce since 2010, according to Her Majesty’s Inspectorate of Constabulary. |
C SoftwareDeveloper Role: C Software DeveloperLocation: Close to St Albans train stationType: PermanentSalary: £40K - £65K Are you an established C# .NET Developer, seeking ... tripled their revenues in a 6 year period, are now seeking a C SoftwareDeveloper to work from their larger, newly-refurbished state-of-the-art office located close to St Albans train ...££40,000
Established in 2004, our client has developed an enviable reputation for delivering high quality websites, Digital Marketing and Training. With over 400 clients ranging from start-ups to household names, they’ve become the market leader in their area and...JOBSWORTH:£26,531 P.A.?
... development knowledge would be useful. Any SIP/VOIP experience would be advantageous. Salary to c£35k plus benefits. To apply for this SoftwareDeveloper - Java / Android role ...£PACKAGE INCLUDES BENEFITS
-motivated and go-getter approach, who takes pride in their work and that of the team Passionate about technology, especially softwaredevelopment Collaborator/Team-player that has ...JOBSWORTH:£42,323 P.A.?
CV Errors Your Spell-Checker Won’t NoticeFew first impressions matter as much as when you put your CV or a cover letter in front of an employer, so making sure it’s error-free is essential to getting off on the right foot... 30 NOV
Tips For Negotiating A Salary IncreaseOur recent look at which jobs have seen the biggest salary increases over the past 10 years shows that over time there can be dramatic shifts in the value of certain skills. But ... 10 NOV |
Q:
genealogytree increase leveling or make content more readable
I am using genealogytree for a different purpose than genealogy because it produces good looking trees.
My problem is that when I have many nodes at the same level it becomes so small to read. I am trying to find a way to make my data look better. One way I thought of is to increase the level of some nodes but I did not figure out how to do it. I have also added an empty box (supposed to be a line) to try to fix it, but that did not work either.
My code:
\documentclass{article}
\usepackage{genealogytree}
\usepackage{tikz}
\usetikzlibrary{positioning}
\usepackage{pdflscape}
\begin{document}
\begin{landscape}
\begin{figure}[b]
\noindent\resizebox{\linewidth}{!}{
\begin{genealogypicture}[
processing=database,
database format=full,
info separators={\tcbline}{\tcbline}{}{},
category/.style={box={colback=red!20}}, % category
service/.style={box={colback=green!20}}, % a Service
realization/.style={box={colback=blue!20 }}, %Realization Technique
empty/.style={box={colback=white}}, %Realization Technique
edges={foreground={line width=1pt,black,->,},background={line width=2pt,white},}, %swing,
box={fit basedim=9pt,boxsep=2pt,segmentation style=solid,halign=center,valign=center,before upper=\parskip2pt,\gtrDBsex,{colback=gray!20}},%CATEGORY
% node={ turn=right},
after tree={
\node [draw,black,fill=red!20,text height=1em] (a) at (current bounding box.north east) {Category};
\node [draw,black,fill=green!20,left=2mm of a] (b) {Service};
\node [draw,black,fill=blue!20,left=2mm of b] (c) { Technique};
}
]
child{
g{name={\textbf{CERT \\ Services}}}
child{
g[category]{name={\textbf{React Services}}, comment= {This is performed in the software}}
child{
g[category]{name={\textbf{Linux Kernel Features}}, comment= {A feature in Linux kernel used to provide security}}
child {
g[service]{name={\textbf{Incident Analysis}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{Incident Response On-site}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{Incident Response Support}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{incident response coordination}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
}
child{
g[category]{name={\textbf{Vulnerability Handling}}, comment= {service explanation}}
child {
g[service]{name={\textbf{Vulnerability Analysis}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{Vulnerability Response}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{vulnerability Response Coordination}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
}
child{
g[category]{name={\textbf{Artifact Handling}}, comment= {Configuration automation}}
child {
g[service]{name={\textbf{Artifact Analysis}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{Artifact Response}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{Artifact Response Coordination}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
}
}
child{
g[category]{name={\textbf{Proactive Services}}, comment= {This is performed in the hardware}}
child {
g[empty]{name={\textbf{x}}}
child{
g[empty]{name={\textbf{x}}}
child {
g[empty]{name={\textbf{x}}}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
child {
g[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
c[realization]{name={\textbf{xxx}}, comment= {realization explanation}}
}
}
}
}
}
child{
g[category]{name={\textbf{Security Quality Management Services}}, comment= {This is performed in the hardware}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
c[service]{name={\textbf{xxx}}, comment= {service explanation}}
}
}
\end{genealogypicture}
}
\end{figure}
\end{landscape}
\end{document}
output:
What i am trying to achieve:
Any suggestions?
And are there better libraries to draw such tree/diagram?
EDIT: OP has a question regarding Forest solutions at coverting a genealogy tree to forrest.
A:
You can label parts of the diagram with "family" names via id, e.g.
child[id=VH]
and then use options for family to move the subtree, e.g.
options for family={VH}{tikz={xshift=-8cm,yshift=-12cm},edge/xshift=-8cm,edge/yshift=-12cm}
Usually this will involve you labelling all child statements with the same label. Below I move just one of your subtrees that I have labelled with VH. You can use the same idea to move other parts, just use new names for the id.
Note I have set name font to \bfseries to avoid writing \textbf many times. One can use other options to avoid much of the repetition of the coding in the diagram.
\documentclass{article}
\usepackage{genealogytree}
\usepackage{tikz}
\usetikzlibrary{positioning}
\usepackage{pdflscape}
\begin{document}
\begin{landscape}
\begin{figure}[b]
\noindent\resizebox{\linewidth}{!}{
\begin{genealogypicture}[
processing=database,
database format=full,
info separators={\tcbline}{\tcbline}{}{},
category/.style={box={colback=red!20},name font=\bfseries}, % category
service/.style={box={colback=green!20},name font=\bfseries}, % a Service
realization/.style={box={colback=blue!20},name font=\bfseries}, %Realization Technique
empty/.style={box={colback=white}}, %Realization Technique
edges={foreground={line width=1pt,black,->,},background={line width=2pt,white},}, %swing,
box={fit basedim=9pt,boxsep=2pt,segmentation style=solid,halign=center,valign=center,before upper=\parskip2pt,\gtrDBsex,{colback=gray!20}},%CATEGORY
% node={ turn=right},
after tree={
\node [draw,black,fill=red!20,text height=1em] (a) at (current bounding box.north east) {Category};
\node [draw,black,fill=green!20,left=2mm of a] (b) {Service};
\node [draw,black,fill=blue!20,left=2mm of b] (c) { Technique};
},
options for family={VH}{tikz={xshift=-8cm,yshift=-12cm},edge/xshift=-8cm,edge/yshift=-12cm}
]
child{
g{name={CERT \\ Services}}
child{
g[category]{name={React Services}, comment= {This is performed in the software}}
child{
g[category]{name={Linux Kernel Features}, comment= {A feature in Linux kernel used to provide security}}
child {
g[service]{name={Incident Analysis}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={Incident Response On-site}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={Incident Response Support}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={incident response coordination}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
}
child[id=VH]{
g[category]{name={Vulnerability Handling},
comment= {service explanation}}
child[id=VH] {
g[service]{name={Vulnerability Analysis}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child[id=VH] {
g[service]{name={Vulnerability Response}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child[id=VH] {
g[service]{name={vulnerability Response Coordination}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
}
child{
g[category]{name={Artifact Handling}, comment= {Configuration automation}}
child {
g[service]{name={Artifact Analysis}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={Artifact Response}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={Artifact Response Coordination}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
}
}
child{
g[category]{name={Proactive Services}, comment= {This is performed in the hardware}}
child {
g[empty]{name={x}}
child{
g[empty]{name={x}}
child {
g[empty]{name={x}}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
child {
g[service]{name={xxx}, comment= {service explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
c[realization]{name={xxx}, comment= {realization explanation}}
}
}
}
}
}
child{
g[category]{name={Security Quality Management Services}, comment= {This is performed in the hardware}}
c[service]{name={xxx}, comment= {service explanation}}
c[service]{name={xxx}, comment= {service explanation}}
c[service]{name={xxx}, comment= {service explanation}}
c[service]{name={xxx}, comment= {service explanation}}
c[service]{name={xxx}, comment= {service explanation}}
c[service]{name={xxx}, comment= {service explanation}}
}
}
\end{genealogypicture}
}
\end{figure}
\end{landscape}
\end{document}
|
Specific supports: prosthetic limbs.
We are often asked questions about specific supports and whether they are funded through the NDIS.
One specific support that we were asked about this week is prosthetic limbs, so we thought we’d outline some of the key information and share it with everyone.
What exactly is a prosthetic limb?
Prosthetic or artificial limbs are devices that aim to, in some capacity, replace the functions of a natural arm or leg which may have been lost due to an accident or illness or is absent at birth. For the people in this situation, a prosthetic limb can help improve their quality of life.
Are prosthetic limbs covered under the NDIS?
Prosthetic limbs are covered but as is the case with all supports, the NDIA must be satisfied that the funding for a prosthetic limb represents value for money and that the cost of the support is reasonable and necessary. Generally, funds for a prosthetic limb will be provided when:
The prosthetic is prescribed by health professionals who are designated and accredited by the artificial limb service in the state or territory where you reside
Your other medical needs like the residual limb shape, skin integrity and alignment-relevant conditions where one or more conditions exist at the same time
The prosthetic should also take into consideration your needs and requirements to make sure it’s as useful as possible. This means considering what you need the limb to do and whether the prosthetic provides a good match for those needs.
So what will the NDIS fund?
Under the NDIS, prosthetic limbs will generally be funded to the following level:
Entry level or standard grade prostheses for participants up to K2 classification (though K3 and K4 will be considered)
Repairs, maintenance, adjustments
Additional costs related to prosthetic limbs such as limb socks and sheaths
Upper limb myoelectric prosthesis in specific cases
Replacement limbs when needed (typically every 3 years for adults and as needed for children under 18 years)
In general, the NDIS won’t fund:
A spare prosthetic limb
Repairs needed due to use outside what was recommended
If you have more questions or would like help getting started on your NDIS journey or preparing for a NDIS Plan meeting, call us on 1300 05 78 78 to ask any questions or sign up to Leap in! plan management today. |
RECIFE, BRAZIL - JANUARY 27: Dr. Vanessa Van Der Linden, the neuro-pediatrician who first recognized the microcephaly crisis in Brazil, examines a 2-month-old baby with microcephaly on January 27, 2016 in Recife, Brazil. The baby's mother was diagnosed with having the Zika virus during her pregnancy. In the last four months, authorities have recorded close to 4,000 cases in Brazil in which the mosquito-borne Zika virus may have led to microcephaly in infants. The ailment results in an abnormally small head in newborns and is associated with various disorders including decreased brain development. According to the World Health Organization (WHO), the Zika virus outbreak is likely to spread throughout nearly all the Americas. At least twelve cases in the United States have now been confirmed by the CDC. (Photo by Mario Tama/Getty Images)
The GOP has evolved (ironically, a process they would deny) to be the proud political party of anti-intellectualism, harking back to the Dark Ages with a never-ending campaign against evolution, tired rants denying the reality of climate change, and a medieval understanding of human reproduction. But sadly this anti-science bent is not restricted to right wing ideologues, but instead has also infected the far left. While manifesting itself with symptoms in different areas of science, the underlying disease is the same on both extreme left and right: ignorance of the scientific method and the reliance on faith over fact.
In the case of liberals gone bad, vaccines offer the most prominent divergence from reality. The anti-vaccine movement gives us the clearest picture of how the far left and extreme right have become one stubborn bloc of boneheads impervious to the inconvenience of objective truth.
In a rather odd twist of fate, the anti-science rants from the right about climate change and the far left campaign against vaccines meet at a common point of ignorance about tropical disease. Consider two people circumnavigating the globe at the equator from the same starting point but moving in opposite directions; the two points furthest apart converge at the end where the journey began; so too here with anti-science zealotry on left and right: so far apart they merge together in a bond of extremism. Nowhere can this circle of delusion be seen better than with the emergence of the Zika virus, a mosquito-borne disease that can cause devastating brain damage in newborns.
Brazil has seen about 4,000 such cases of microcephaly since October as a consequence of the rapid spread of Zika. U.S. officials warn us that this "once obscure virus" is spreading rapidly across Latin America and the Caribbean. So much so that the Center for Disease Control has issued a travel warning, urging pregnant women to avoid more than a dozen countries in which Zika can now be found. If you think you are safe here in North America, reconsider: the World Health Organization concludes that the Zika virus will spread to the United States. In North America alone, about 200 million people live in areas conducive to the transmission of the virus.
Why Zika now? As with the emergence of West Nile in the United States, we are witnessing the inevitable march north of tropical diseases as a direct result of a warming planet. The number of diseases coming our way, or already here, is as frightening as it is real. That climate change would impact the transmission of infectious and tropical diseases has long been predicted from the very first reports of the Intergovernmental Panel on Climate Change (IPCC). Those predictions are now our new reality.
So the GOP denies the indisputable truth of global warming as Zika moves north; and the far left denies the extraordinary benefits of vaccines, which would obviously include a vaccination against Zika (research is being done). Tell the mother of a child who could be saved with a vaccine that we should not develop one because vaccinations are harmful. What we have here is the perfect convergence of ignorance mixed with political extremism, wrapped together in a bundle of delusional wishful thinking.
Enough Already
Climate change is real and caused by human activity; consequently tropical maladies are moving north. Vaccines, ever more important with advancing diseases, have proven beyond any and all doubt to be extraordinarily efficacious. Vaccines are the most important, effective, and safest medical advance in all of human history. Vaccinations have led to the eradication of smallpox and the near-eradication of polio. Anytime you might have even a twinge of a thought against vaccinations, think of the millions of people who suffered terrible disability and death prior to the development of vaccines for these horrible diseases. And the millions of people now free from those scourges because of vaccines.
And no, making a personal decision to eschew vaccines is not benign. If enough people do not get vaccinated, the entire community may suffer because "community immunity" becomes jeopardized. When a critical number of people in a population are immunized, even those unable to get vaccinated, like infants, the elderly, pregnant women, or immunocompromised patients, gain protection from the spread of contagious disease. In some cases, if immunization drops below a certain percentage of coverage even those vaccinated are offered less protection. In 2000 measles was nearly eradicated in the United States; with a drop in immunization due to unjustified concerns about vaccines, the United States is witnessing this year the largest measles outbreak since 1996.
The deep, terrible irony of the anti-vaccination movement is that the incredible success of vaccines has caused the uninformed to forget how important, successful and safe vaccination programs are; and how vital vaccines are to preventing horrible diseases from reemerging. And reemerge they do, as measles has. Measles is highly contagious and spreads rapidly among the non-vaccinated. There is no treatment for measles, only prevention. Ignorance, false claims to expertise and scientific illiteracy are threatening our children's health.
These preventable outbreaks should remind us that every year vaccines save 3 million lives among children younger than five years old every year by preventing diphtheria, tetanus, pertussis and measles; if adults are included, vaccines save up to 6 million lives annually. If you oppose vaccinations you are willfully condoning the death of an additional 3 million children every year. The Third Edition of the State of the World's Vaccines and Immunization reports that, "Between 2000 and 2007, the number of children dying from measles dropped by 74% worldwide, from an estimated 750,000 to an estimated 197,000 children. In addition, immunization prevents sickness as well as lifelong disability, including measles-related deafness, blindness, and mental disability."
The study also states that, "In 1988, polio was endemic in 125 countries and paralyzing an estimated 350,000 children every year (close to 1000 cases a day). By the end of 2007, polio had been eradicated in three of WHO's six regions - the Region of the Americas, the European Region, and the Western Pacific Region. Following implementation of the rubella elimination strategy in the Americas, the number of reported cases of rubella declined by 98% between 1998 and 2006. By 2000, 135 countries had eliminated neonatal tetanus and by 2004, annual deaths from neonatal tetanus had fallen to an estimated 128 000, down from 790,000 deaths in 1988."
If you oppose vaccinations, try to justify that position with the reality that in the absence of vaccinations polio would paralyze 10,000 children every year; German measles would cause birth defects and mental retardation in as many as 20,000 kids, and diphtheria would be a common cause of death in school children. Anytime you have an urge to oppose vaccination, think of your kid dying of diphtheria. If you oppose vaccinations, you willingly accept that 10,000 kids each year become paralyzed with no reason.
Fact vs. Fiction: How the Left Was Lost
Any Google search will show that the left has linked vaccines to autism. This bizarre claim comes from just one paper published in 1998 in the medical journal Lancet, subsequently withdrawn for suspicions of scientific fraud, and fully discredited by later study. Repeat after me: there is no evidence, none, zero, absolutely nothing, to link vaccinations with autism. It is a myth, a fallacy, factually incorrect. Yet tens of thousands of parents risk their children's health by withholding critical vaccinations. Many parents still to this day insist that vaccines cause autism, even in the complete absence of any evidence to support the claim with the withdrawal of the original paper. You might as well claim that vaccines cause baldness. I am bald, and I have had many vaccines, ergo...
No, no, I've got the perfect claim: vaccines are ineffective and dangerous but prevent global warming. In that we combine belief in something for which there is no evidence and disbelief in another other for which there is indisputable proof. Perfect.
Vaccines save lives, millions of lives, and prevent untold suffering and misery. Would anti-vacciners deny a pregnant woman a Zika vaccine? Vaccines are safe and effective, as proven by billions of doses given with no harm. The efficacy of vaccines is beyond dispute with the eradication of some of humankind's greatest scourges and the precipitous drop in diseases once common. Of course absolutely nothing is 100% safe and effective; sitting on your couch with a helmet does not guarantee an airplane tail won't fall through your roof and kill you. But the awesome, amazing benefits of vaccines vastly, incredibly, outrageously outweigh any potential risk.
Opposing vaccines is foolhardy, dangerous, irresponsible, and just plain ignorant. Much like right wing opposition to climate change. Right and let extremism converge.
Please, please, please stop this misguided and misinformed anti-vaccine campaign and the absurd denial of climate change. Just say Zika and West Nile if you get weak. If you want to oppose vaccines, go to an island, with plenty of high ground, with all others of your ilk and witness the devastation as preventable diseases ravage your population while waves erode your beaches with rising tides. But leave the rest of us rational people to the task of saving lives with the greatest medical advance ever seen in human history while we try to stop further warming of the planet. |
996 F.2d 305
U.S.v.Davis**
NO. 92-1967
United States Court of Appeals,Fifth Circuit.
June 22, 1993
1
Appeal From: N.D.Tex.
2
AFFIRMED.
**
Conference Calendar
|
module Workarea
module Metrics
module Scoring
extend ActiveSupport::Concern
included do
scope :since, ->(time) { where(:reporting_on.gte => time) }
end
class_methods do
def score(field)
scoped.sum { |i| i.score(field) }
end
end
def score(field)
if weeks_ago.zero?
send(field)
else
send(field) * (Workarea.config.score_decay / weeks_ago)
end
end
def weeks_ago
difference = Time.current.beginning_of_week - reporting_on.beginning_of_week
difference / 1.week
end
end
end
end
|
Cost of discarded medication in Indiana long-term care facilities.
The cost of discarded medication was studied in 17 Indiana intermediate-care and skilled-nursing facilities with varying bed capacities and drug-distribution systems. During visits to each facility, one or two pharmacists collected data on patients' drug regimens and the quantities of medication dispensed and discarded over periods of one to seven months. A total of $ 5,620 worth of medication ($ 4,472 excluding topical medications) was destroyed in the facilities during the study period. The projected annual cost of discarded medication was approximately $ 15,800 ($ 12,460 excluding topical medications). In the 13 facilities using some type of unit dose drug distribution system, the mean projected annual cost of discarded medication per patient ($ 4.07) was significantly less than for the four facilities using traditional drug-distribution systems ($ 23.54). There was an inverse relationship between bed capacity and mean projected annual cost of discarded medication per patient. The use of unit dose drug distribution systems in all long-term care facilities would be expected to result in substantial savings in the costs of discarded medications. |
U.S. Dispatches Warship to Challenge China’s Artificial Islands
The United States is belatedly trying to challenge Beijing’s “great wall of sand” in the South China Sea by sailing a warship near man-made islands that China is using to underpin its expansive territorial claims.
Designed to push back against China’s challenge to international order, the naval patrol risks a potential military confrontation in the short term. Yet it offers little prospect of dissuading Beijing from pursuing its far-reaching territorial ambitions in one of the world’s most important waterways.
After months of deliberations and private appeals from Asian allies, President Barack Obama’s administration ordered a guided missile destroyer, the USS Lassen, to sail within a 12-nautical-mile boundary of two artificial islands, the Subi and Mischief reefs in the Spratly Island chain, military officials said Monday. The naval patrol will likely be carried out in a matter of hours, officials said.
U.S. officials indicated more so-called “freedom of navigation” operations would be carried out in the future near man-made features constructed by Beijing in the South China Sea. Such missions usually include surveillance aircraft, the officials said.
“We will sail in international waters at a time of our choosing,” a U.S. military official told Foreign Policy, speaking on condition of anonymity.
The administration’s plan to conduct expanded naval patrols near the man-made islands was first reported by FP on Oct. 2.
U.S. officials say the operation is vital to defending an international rules-based order, which in recent years China has systematically flouted in the South China Sea. But former U.S. officials and analysts say the patrols alone will not convince China to halt its massive reclamation work or drop its assertive stance on territorial claims in the disputed waters.
Even so, the patrols aim to reassure allies in the region who are anxious to see Washington counter what they see as Beijing’s coercive tactics in the South China Sea.
A consensus had emerged among maritime allies in the Pacific and U.S. commanders that the patrols had to be carried out “because the Chinese have gone so far for so long, that there’s a real credibility problem we face,” said Michael Green, a former senior National Security Council official who is now at the Center for Strategic and International Studies.
Since 2014, China has spent billions of dollars to artificially expand seven reefs and atolls it claims in the South China Sea, making them big enough to dock ships and land military aircraft. U.S. officials also believe China could install radar and air-defense systems on the man-made features.
Although Washington and its allies view the trend with alarm, Chinese President Xi Jinping said during his U.S. visit last month that Beijing does not intend to “militarize” the South China Sea.
The USS Lassen will sail within 12 nautical miles of Subi and Mischief reefs to underscore that Washington does not view those waters as Chinese territory, as Beijing asserts.
But the expanded naval patrols could raise the danger of a potential collision or volatile incident between American and Chinese vessels or aircraft.
Over the last decade, U.S. and Chinese ships and planes have had several high-profile encounters, including the forced downing of a U.S. surveillance plane and Chinese efforts to ram a U.S. Navy ship. Most recently, after an American P-8 surveillance plane flew through international air space last May in the vicinity of one of Beijing’s artificial islands, Chinese officials repeatedly warned it to leave, calling the island and its airspace a “military alert zone.”
Days before Xi traveled to Washington last month, two Chinese fighter jets flew near a U.S. RC-135 reconnaissance plane east of the Shandong Peninsula in the Yellow Sea. And in a maneuver denounced by the Pentagon as reckless, a Chinese J-11 fighter jet passed within 20 feet of another American P-8 aircraft in August last year.
When U.S. naval officers first suggested conducting freedom of navigation operations at the disputed islands last month, Chinese Foreign Ministry officials shot back with vitriol, saying they were “seriously concerned.”
“China, like the U.S., champions navigation freedom in the South China Sea, but opposes any country’s attempt to challenge China’s territorial sovereignty and security under the pretext of safeguarding navigation freedom,” Foreign Ministry spokesman Hong Lei said then.
“China urges [the] relevant party to exercise caution in its words and deeds, respect China’s territorial sovereignty and security interests, and refrain from taking any provocative and risky action,” he said.
This month, despite Xi’s pledge not to militarize the region, another Chinese Foreign Ministry spokesman said Beijing has the right to build “military facilities,” allegedly for “defense purposes,” on the disputed islands.
Since the end of World War II, the U.S. Navy has defended the principle of freedom of navigation around the world, by challenging states — friends and foes alike — that try to fence off international waters. For the last three decades, those kinds of operations have been formally carried out under the Pentagon’s Freedom of Navigation program. But the missions are usually routine and discreet, in sharp contrast to the high-profile, and well-telegraphed, mission in the South China Sea.
In 2014, the U.S. Navy carried out such operations against 19 countries, including China. But the administration’s discussions on performing the patrols in the South China Sea have been the subject of media reports and speculation for weeks.
“This is perhaps the most publicly debated operation in the history [of the program],” said M. Taylor Fravel, an expert on Chinese maritime issues at the Massachusetts Institute of Technology.
The United States and its partners in Southeast Asia have voiced mounting alarm over China’s massive reclamation effort in the Spratly Islands, which the Pentagon says now covers more than 3,000 acres.
Under international law, countries can claim a territorial sea that extends 12 nautical miles from its own coastlines and genuine islands that it possesses; those territorial waters are off-limits to warships from other nations.
But submerged rocks and reefs, even if they belonged to China, would not qualify as islands under international maritime law. Subi and Mischief are actually “low-tide elevations,” or features that are normally underwater and only appear at low tide.
Complicating the issue is the disputed ownership of the features themselves. China claims almost the entirety of the South China Sea, including most of the rocks, reefs, and atolls inside it, while neighboring nations such as Vietnam and the Philippines have competing claims to many of the features.
What’s more, China has not formally declared a 12-mile territorial sea around its artificial islands. Chinese diplomats have often spoken of the South China Sea as belonging to Beijing and point to a so-called “nine-dashed line” map that encloses most of the sea, but they have never clearly spelled out just what it claims.
“China claims indisputable sovereignty throughout the entire dashed-line claims, which is akin to a territorial sea,” said James Kraska, a law professor at the U.S. Naval War College.
Any U.S. challenge, such as sailing close to the reef with a destroyer or flying near it with surveillance planes, would be carefully tailored to protest China’s implicit claim of territorial waters.
“The freedom of navigation operation would indicate simply that the United States does not recognize a territorial sea around a low-tide elevation,” said Fravel. But that would not mean that Washington is disputing Beijing’s claims to the rocks themselves, he noted.
“Any freedom of navigation operation the United States might conduct would not challenge China’s claims to the Spratly Islands,” he said.
At times, U.S. efforts to uphold the four-century tradition of freedom of the seas have led to ugly confrontations. In 1981, shortly after the Pentagon formalized its periodic challenges in the Freedom of Navigation program, the United States decided to push back against Libya’s claim to the entirety of the Gulf of Sidra by dispatching a pair of aircraft carriers. Libya’s angry response led to a dogfight in which two Libyan jets were shot down. Similarly, in 1988, U.S. efforts to ensure freedom of navigation inside the Black Sea, not far from the Crimean Peninsula, led to a showdown with the Soviet navy, which rammed a pair of U.S. vessels.
The big question now is just how China responds to Washington’s challenge.
Experts said it was likely that Chinese protests would be limited to diplomatic démarches, rather than trying to physically interfere with the U.S. mission — especially since the United States has repeatedly carried out freedom of navigation operations against Chinese claims without incident. But given the high stakes, boiling Chinese nationalism, and the very public debate, Beijing may take more provocative action short of military force.
“We might expect that China, if it knows about the operation, will indeed signal displeasure by intercepting the vessel or aircraft and attempting to compel a change in course,” Kraska said.
Both he and Fravel said that the United States should have carried out the challenge differently, in line with past practice that was designed to minimize tension and the risk of escalation. Kraska said that a better time to push back against Chinese claims would have been in late August, when China dispatched five naval vessels to the Bering Sea during Obama’s visit to Alaska.
Although China shows no sign of halting its dredging work or easing off its claims, it is not looking for an armed conflict with the United States, Green said.
“I do not think China would have any interest in a military confrontation. It would be disastrous for [it] at a time when [its] economy is in trouble,” Green said.
“They will continue doing what they were doing anyway and claim they now have to defend the islands or possibly do a similar operation somewhere to show they can do it to us,” he said.
Photo credit: John J. Mike/U.S. Navy via Getty Images |
Characteristic and susceptibility to enterocins of enterococci in pheasants possessing virulence factor genes.
With an increasing number of pheasants as gamebirds being reared each year, these species are becoming a more prominent part of the workload of many veterinary practices. Only limited information can be found concerning the microflora of common pheasants. A significant part of the obligate microflora consists of lactic acid bacteria, including enterococci. In this study, faeces were sampled from 60 pheasants aged 16-17 weeks. Enterococcal counts reached 5.48±1.9 (log10) CFU/g. Strains (17) were taxonomically classified to the genus Enterococcus using the Maldi-Tof identification system; they were allotted to the species E. hirae (58.8%), E. faecium (23.5%) and E. faecalis (17.7%) by highly probable species identification or by secure genus identification/probable species identication. Species allocation was also confirmed using conventional biochemical tests. Most strains formed β-hemolysis. Gelatinase active phenotype was found in three E. faecalis strains. Enterococci were β-glucuronidase negative, mostly trypsin negative with slight or moderate production of α-chymotrypsin. EH52b and EF42 strains possessed the highest potential for pathogenicity. Average value of lactic acid was 1.78±0.33 mmo/L. Most strains were tetracycline resistant (82.4%). Polyresistant E. faecalis strains with positive gelatinase phenotype and possessing virulence factor genes confirmed using PCR (gelE, efaAfs, ccf cob, cpd) were sensitive to enterocins (activity 1600-25,600 AU/mL). |
Entropy and kinetics of point defects in two-dimensional dipolar crystals.
We study in experiment and with computer simulation the free energy and the kinetics of vacancy and interstitial defects in two-dimensional dipolar crystals. The defects appear in different local topologies, which we characterize by their point group symmetry; Cn is the n-fold cyclic group and Dn is the dihedral group, including reflections. The frequency of different local topologies is not determined by their almost degenerate energies but is dominated by entropy for symmetric configurations. The kinetics of the defects is fully reproduced by a master equation in a multistate Markov model. In this model, the system is described by the state of the defect and the time evolution is given by transitions occurring with particular rates. These transition rate constants are extracted from experiments and simulations using an optimization procedure. The good agreement between experiment, simulation, and master equation thus provides evidence for the accuracy of the model. |
Extracts from the Heroic Era Antarctic expedition diaries exemplify the immediacy and continuity of such records, qualities that are not consistently present in the other forms of recording. The diaries emerge as the most truthful, dependable and encompassing record of the Heroic Era polar experience. |
Portable Rosé Taste Test
After enjoying the Notorious Pink Rosé, I’ve been on a mission to try more Rosés! As the weather warms up, Rosé becomes the perfect wine option and I thought it would be fun to try it in a different form. Along with warm weather comes picnics, outdoor concerts and other fun activities! Canned or boxed wines are a great option for these events, so today I am sharing a taste test of several Rosés in portable packages.
Here are the results!
Wine Cube Rosé
Packaging: 500 ml carton with a screw top that’s easy to open. The package says it’s three glasses, but I would say it’s more like 2 ;). The great thing about this box is that it’s resealable. I do worry about the durability if you packed it with other heavy stuff.
Price: $5.00
Taste: I found this one to have the least flavor. I could tell it was Rosé, but it just didn’t have much to it.
Overall score: 5/10, I wouldn’t say no if someone offered me a glass of this but it wouldn’t be my first choice to buy again.
Sofia Coppola Brut Rosé
Packaging: 187 ml pop top can with a straw. These cans are single servings, which makes them perfect. They also come with little bendy straws, so it’s like an adult juice box, so fun! :).
Price: $16.99 for a 4-pack
Taste: This one is crisp and dry with some bubbles, so it’s perfect for warm weather.
Overall Score: 8/10, I would definitely buy this one again for the taste and the fun straw!
House Wine Rosé
Packaging: This 500 ml can with a normal pop top doesn’t make it ideal for storing the rest for later. This is probably only a good option if you are going to share, or know you’ll drink it all yourself in one sitting. That’s actually not hard, since this wine is light, refreshing, and goes down easy! There’s also a bubbly version that I can’t wait to try!
Price: $4.99
Taste: Light and sweet with a subtle berry flavor.
Overall Score: 8/10, this one was my favorite for flavor. I gave it the same score as the Coppola because the packing isn’t as fun.
So there you have it, some good options for your next summer picnic. What’s your favorite portable wine? |
Q:
Remove and get text, from comma separated string if it has # as prefix in java?
I have a string in java as
Input
String str = "1,2,3,11,#5,#7,9";
Output Desired
String result = "1,2,3,11,9";
// And 5,7 with special character # in separate Array-list
//List<String> list = ["5","7"];
Note: This special character # is dynamic, it may or may not be present in string.
I know how to remove # using str.replaceAll("#", "");, but how to get 5 and 7 in a separate list.
A:
String str = "1,2,3,11,#5,#7,9";
List<String> parts = Arrays.asList(str.split(","));
List<Integer> normalNumbers = parts.stream().filter(i -> !i.startsWith("#")).map(Integer::parseInt).collect(
Collectors.toList());
List<Integer> specialNumbers = parts.stream().filter(i -> i.startsWith("#")).map(i -> Integer.valueOf(i.substring(1))).collect(Collectors.toList());
System.out.println(normalNumbers);
System.out.println(specialNumbers);
|
Annie Machon is a former MI5 agent, which for those who don’t know, can be likened to the FBI in the United States.
She originally turned whistleblower, along with her collegue David Shayler, when the two began to notice corruption was rampant in both the MI5 and MI6 (which can be likened to the CIA). As a result, they were attacked by both the media and the government.
In this particular video, the former intelligence officer makes a shocking claim that most people may have never heard in regards to the Princess Diana murder, that she believes she was killed because she had decided to become a proponent of Palestinian self determination.
As you can see, she insinuates that she was murdered for this reason. Does that mean the Mossad were responsible? Was it a joint operation between British intelligence and Israeli intelligence?
Please share this video for the sake of the kind hearted Princess Diana and the bravery of this whistleblower. In the age of information, it is only a matter of time before the truth comes out. How that happens, depends on people just like you sharing knowledge.
0025: The Mercedes crashes into the 13th pillar of the Alma tunnel, killing Mr Paul and Mr Al Fayed. Mr Rees-Jones and the princess are seriously injured. Photographer Romuald Rat arrives within seconds – he is the first on the scene.
0026: First call to the authorities. Emergency doctor Frédéric Mailliez is driving by when he sees the crashed Mercedes. He is the first doctor on the scene and calls for help.
0028 – 0030: First two police officers arrive. They have difficulty cordoning off the accident from gathering paparazzi.
0032: Fire engine and ambulance arrive. Eight paparazzi are arrested at the accident scene and taken in for questioning.
0125: After nearly an hour, Princess Diana’s ambulance leaves for hospital. She has already suffered a cardiac arrest.
0130: Mr Al Fayed is pronounced dead.
0155: Princess Diana’s ambulance stops for five minutes to inject adrenaline into her body.
0206: The ambulance arrives at Pitié-Salpétrière Hospital. Doctors note that she has torn her pulmonary vein, a rare condition that begs little chance of survival. She receives open heart massage for nearly two hours.
0400: Princess Diana is declared dead.
There are so many things wrong for me with this timeline. Why did it take so long for an ambulance to get there? What were they doing for a whole hour under that bridge? What really happened when they stopped for 5 minutes?
About The Author
My grandmother drilled this lesson into my head. She shared "If you hear a lie long enough you're more likely to believe it. You begin to believe that lie. That lie becomes your truth, even though it's actually a lie."
My dedication is to decode the lies in our society, expose them, be someone who gives you the deepest truth I can find, so that it can empower your life.
Also the founder of the popular health and environmental website at:
HealthyWildAndFree.com.
Connect With Our Health Content On Facebook, Youtube, Pinterest and Instagram. |
---
abstract: 'Time-based one-time password (TOTP) systems in use today require storing secrets on both the client and the server. As a result, an attack on the server can expose all second factors for all users in the system. We present T/Key, a time-based one-time password system that requires no secrets on the server. Our work modernizes the classic S/Key system and addresses the challenges in making such a system secure and practical. At the heart of our construction is a new lower bound analyzing the hardness of inverting hash chains composed of independent random functions, which formalizes the security of this widely used primitive. Additionally, we develop a near-optimal algorithm for quickly generating the required elements in a hash chain with little memory on the client. We report on our implementation of T/Key as an Android application. T/Key can be used as a replacement for current TOTP systems, and it remains secure in the event of a server-side compromise. The cost, as with S/Key, is that one-time passwords are longer than the standard six characters used in TOTP.'
author:
- Dmitry Kogan
- Nathan Manohar
- Dan Boneh
bibliography:
- 'chain.bib'
title: 'T/Key: Second-Factor Authentication From Secure Hash Chains'
---
Introduction
============
Offline 2nd Factor Authentication {#TFA}
=================================
We begin by briefly reviewing several approaches to one-time passwords that are most relevant to our scheme.
#### S/Key
The idea of a one-time password authentication scheme was first considered by Lamport [@lamport81]. Loosely speaking, in such a scheme, following an initial setup phase, authentication is performed by the client presenting the server with a password that is hard for an attacker to guess, even given all previous communication between the server and the client. In particular, no password is valid for more than one authentication. In his work, Lamport proposed a concrete instantiation of this idea using *hash chains*, and this idea has been subsequently developed and implemented under the name S/Key [@skey]. The setup phase of S/Key consists of the client choosing a secret passphrase[^1] $x$ and sending the computed value $y_0=h^{(k)}(x)$ (where $h$ is some cryptographic hash function, $k$ is some integer, and $h^{(k)}$ denotes $k$ successive iterations of $h$) to the server, which the server then stores. Subsequently, to authenticate for the $i$th time, the client must present the server with $y_i=h^{(k-i)}(x)$, which the server can verify by computing $h(y_i)$ and comparing it to the stored value $y_{i-1}$. If the authentication is successful, the server updates its stored value to $y_i$.
S/Key has a number of undesirable properties. First, one-time passwords remain valid for an indefinite period of time unless used, making them vulnerable to theft and abuse. This vulnerability is magnified if the counter value for each authentication attempt is communicated to the client by the server, as is the case in both the original S/Key [@skey] and in the newer OPIE [@opie] (presumably to allow for stateless clients). In this common setting, the scheme is vulnerable to a so-called “small $n$" attack [@mitchell96], where an attacker impersonating the server can cause the client to reveal a future one-time password. Second, the fact that S/Key utilizes the same hash function at every iteration in the chain makes it easier to break S/Key than to break a single hash function (see Theorem \[thm:hastad\]). This also implies that any modification to the scheme that requires using much longer hash chains (such as, for example, a naïve introduction of time-based passwords) could lead to insecurity.
#### HOTP
In an *HMAC-based one-time password scheme* (HOTP) [@hotp], a secret and a counter, both shared between the server and the client, are used in conjunction with a pseudorandom function (HMAC) to generate one-time passwords. The setup phase consists of the server and the client agreeing on a random shared secret $k$ and initializing a counter value $c$ to $0$. One-time passwords are then generated as $\texttt{HMAC}(k,c)$. The counter is incremented by the client every time a password is generated and by the server after every successful authentication.
The most significant advantage of this scheme is that the number of authentications is unbounded. Moreover, it allows using short one-time passwords without compromising security. However, HOTP still suffers from many of the weaknesses of S/Key, namely that unused passwords remain valid for an indefinite period of time. A bigger concern is that the secret key $k$ must be stored on the server, as discussed in the previous section.
#### TOTP
Time-based one-time password schemes (TOTP) [@totp] were introduced to limit the validity period of one-time passwords. In TOTP, the shared counter value used by HOTP is replaced by a timestamp-based counter. Specifically, the setup phase consists of the server and the client agreeing on the ‘initial time’ $t_0$ (usually the UNIX epoch) and a time slot size $I$ (usually 30 seconds), as well as on a secret key $k$. Subsequently, the client can authenticate by computing $\texttt{HMAC}(k,(t-t_0)/I)$, where $t$ is the time of authentication.
As with HOTP, the TOTP scheme is vulnerable to a server-side attack.
Our Construction {#sec:description}
================
T/Key combines the ideas used in S/Key and TOTP to achieve the best properties of both schemes: T/Key stores no secrets on the server and ensures that passwords are only valid for a short time interval. The scheme works as follows:
#### Public Parameters
The scheme’s parameters are the password length $n$ (in bits), a time slot size $I$ (in seconds), representing the amount of time each password is valid for, and the maximal supported authentication period $k$ (measured as the number of slots of size $I$). Furthermore, our scheme uses some public cryptographic hash function ${H:\{0,1\}^{m}\rightarrow
\{0,1\}^m}$ for an arbitrary $m\ge n + s + c$, where $s$ is the number of bits used for the salt and $c$ is the number of bits needed to represent the time. Typical values are given in Table \[table:params\].
[Parameter]{} [Value]{} [Description]{}
--------------- ---------------- ------------------------------
$n$ $130$ bits One-time password length
$s$ $80$ bits Salt length
$c$ $32$ bits Number of bits used for time
$m$ $256$ bits Hash function block size
$k$ $2\times 10^6$ Chain length
$I$ $30$ sec Time slot length
: Scheme public parameters and their typical values.[]{data-label="table:params"}
#### Setup
The client chooses and stores a uniformly random secret key $\mathit{sk} \in \{0,1\}^n$, as well as a random salt $\mathit{id}\in
\{0,1\}^s$, and notes the setup time $t_{\mathrm{init}}$ (measured in slots of length $I$). The public hash function $H$ together with the initialization time $t_{\mathrm{init}}$ induce the $k$ independent hash functions $h_1,\dotsc,h_k
:\{0,1\} ^n\rightarrow \{0,1\}^n$ as follows: for $1 \leq i \leq k$ define $$\begin{aligned}
{h_i(x) = H\big(\langle t_{\mathrm{init}} + k - i \rangle_c \ \big\| \
\mathit{id} \ \big\| \ x\big)\Big\vert_n} \,,\end{aligned}$$ where for a numerical value $t$, $\langle t\rangle_c$ denotes the $c$-bit binary representation of $t$, and for strings $x,y\in\{0,1\}^*$, we write $x\vert_n$ and $x\| y$ to denote the $n$-bit prefix of $x$ and the concatenation of $x$ and $y$, respectively. This simple method of obtaining independent hash functions from a single hash function over a larger domain is called *domain separation*, and it is often attributed to Leighton and Micali [@leightonmicali]. Note that since all inputs to the hash function are of equal size, this construction is not susceptible to length extension attacks, and therefore, there is no need to use HMAC.
The client then computes $$\begin{aligned}
p_{\mathrm{init}} = h_k(h_{k- 1}( \hdots (h_{1}(\mathit{sk})) \hdots))\end{aligned}$$ and sends it to the server together with $\mathit{id}$. The server stores $p_{\mathrm{init}}$ as $p_{\mathrm{prev}}$ as well as the time $t_{\mathrm{init}}$ as $t_{\mathrm{prev}}$ (we discuss time synchronization issues below).
#### Authentication
To authenticate at a later time $t \in
(t_{\mathrm{init}}, t_{\mathrm{max}}]$ (measured in units of length $I$ where $t_{\mathrm{max}} = t_{\mathrm{init}} + k$), the client and server proceed as follows: the client uses $\mathit{sk}$ and $t$ to generate the one-time password $$p_t = h_{t_{\mathrm{max}}-t}(h_{t_{\mathrm{max}}-t-1}(\hdots
(h_{1}(\mathit{sk}))\hdots)).$$ Alternatively, when $t=t_{\mathrm{max}}$, we use ${p_t= \mathit{sk}}$. To check a password $p$, the server uses the stored values, $t_{\mathrm{prev}}$ and $p_{\mathrm{prev}}$, and the current time-based counter value $t > t_{\mathrm{prev}}$. The server computes $$\begin{aligned}
p'_{\mathrm{prev}} =
h_{t_{\mathrm{max}}-t_{\mathrm{prev}}}(
h_{t_{\mathrm{max}}-t_{\mathrm{prev}}-1}(\dotsc
(h_{t_{\mathrm{max}} - t + 1}(p)) \hdots)).\end{aligned}$$ If $p'_{\mathrm{prev}} = p_{\mathrm{prev}}$, then authentication is successful, and the server updates $p_{\mathrm{prev}}$ to $p$ and $t_{\mathrm{prev}}$ to $t$. Otherwise, the server rejects the password.
#### Reinitialization
Just as in authentication, initialization requires communication only from the client device to the server, and the server does not need to send anything to the client. The only difference is that during initialization, the client needs to supply the server with the salt in addition to the initial password. The finite length of the hash chain requires periodic reinitialization, and the length of this period trades off with the time step length $I$ and the time it takes to perform the initialization (which is dominated by the full traversal of the hash chain by the client). For standard use cases, one can set $I=30$ seconds and $k=2\times 10^6$, which results in a hash chain valid for $2$ years and takes less than $15$ seconds to initialize on a modern phone.
Since key rotation is generally recommended for security purposes (NIST, for example, recommends “cryptoperiods” of 1-2 years for private authentication keys [@nistkeys]), we don’t view periodic reinitialization as a major limitation of our scheme. While reinitialization is obviously somewhat cumbersome, there are several properties of our scheme that mitigate the inconvenience. First, the fact that our setup is unidirectional makes it very similar to authentication from the user’s point of view. Second, from a security standpoint, the setup is not vulnerable to passive eavesdrop attacks, unlike TOTP schemes that rely on shared secrets.
A scenario where the hash chain expires before the user is able to reinitialize it with the server can be handled out-of-band in a manner similar to password recovery or loss of the second-factor. Alternatively, some implementations could choose to accept the head of the chain even after its validity period, which would incur a loss in security proportional to the time elapsed since expiration.
#### Clock Synchronization.
As with current TOTP schemes, authentication requires a synchronized clock between the server and the client. Time skew, or simply natural delay between the moment of password generation and the moment of verification, might result in authentication failure. To prevent this, the server may allow the provided password to be validated against several previous time steps (relative to the server’s clock), as was the case in the TOTP scheme. When this occurs, the previous authentication timestamp $t_{\mathrm{prev}}$ stored on the server should be updated to the timestamp which resulted in successful verification.
Figure \[scheme:overview\] illustrates the design of T/Key.
Security {#sec:security}
========
Although our scheme bears a resemblance to both S/Key and TOTP, it has several essential differences that eliminate security issues present in those schemes.
First and foremost, T/Key does not require the server to store any secrets, which mitigates the risk of an attack that compromises the server’s database, unlike TOTP, which requires the client’s secret key to be stored by the server.
Second, T/Key’s passwords are time limited, unlike those in S/Key, which makes phishing attacks more difficult because the attacker has a limited time window in which to use the stolen password. However, the fact that T/Key’s passwords are time limited makes it necessary for the hash chain used by T/Key to be significantly longer than those in S/Key, since its length must now be proportional to the total time of operation rather than to the supported number of authentications. This modification raises the issue of the dependence of security on the length of the hash chain. Hu, Jakobsson and Perrig [@HJP] discuss the susceptibility of iterating the same hash function to “birthday" attacks and H[å]{}stad and N[ä]{}slund [@hastad] show that if the *same* hash function $h$ is used in every step of the chain, then inverting the $k$-th iterate is actually $k$ times easier than inverting a single instance of the hash function. We reproduce their proof here for completeness and clarity.
We set $N=2^n$ and denote by $\mathcal{F}_N$ the uniform distribution over the set of all functions from $[N]$ to $[N]$. For a function ${h:[N]\rightarrow
[N]}$, we let $h^{(k)}$ denote $h$ composed with itself $k$ times. For functions $h_1,h_2,\dotsc,h_k$ and $1\le i \le j \le k$, we let $h_{[i,j]}$ denote the composition $h_j\circ h_{j-1}\circ \dotsb \circ h_i$. When writing $A^h$, we mean that algorithm $A$ is given oracle access to all $k$ functions $h_1,\dotsc,h_k$.
\[thm:hastad\] For every $N\in\mathbb N$, $k\leq \sqrt{N}$ and $2k\leq T \leq N/k$, there exists an algorithm $A$ that makes at most $T$ oracle queries to a random function $h:[N]\rightarrow[N]$ and $${\mathop{\bf Pr\/}}_{\substack{h\in\mathcal{F}_N \\ x\in[N]}}\left[h\left(A^h(h^{(k)}(x))\right)
= h^{(k)}(x) \right] = \Omega\left(\frac{Tk}N\right)\,.$$ Moreover, every algorithm that makes at most $T$ oracle queries succeeds with probability at most $O(Tk/n)$.
We prove the first part of the theorem (the existence of a “good” algorithm) and refer the reader to [@hastad] for the proof of the second part. Consider the following algorithm: On input $h^{(k)}(x) = y\in[N]$, the algorithm sets $x_0=y$ and then computes $x_j=h(x_{j-1})$ until either $x_j=y$, in which case it outputs $x_{j-1}$, or until $x_j=x_i$ for some $i<j$. In the latter case, it picks a new random $x_j$ from the set of all points it hasn’t seen before and continues. If the algorithm makes $T$ queries to $h$ without finding a preimage, it aborts.
To analyze the success probability of this algorithm, consider the first $(T-k)$ points $\{x_j\}_{j=1}^{T-k}$. If any of these points collides with any of the values along the hash chain $\{h^{(i)}(x)\}_{i=1}^k$, the algorithm will output a preimage of $y$ after at most $k$ additional queries. Therefore, the probability of failure is at most the probability of not colliding with the hash chain during the first $T-k$ queries. But as long as a collision does not happen, each query reply is independent of all previous replies and of the values $\{h^{(i)}(x)\}_{i=1}^k$. Each query therefore collides with the chain with probability at most $k/N$, and overall, the algorithm fails with probability at most $(1-k/N)^{T-k} \leq (1-k/N)^{T/2}
= 1-\Omega\left(Tk/N\right)$.
This loss of a multiplicative factor of $k$ in security is undesirable as it forces us to increase the security parameters for the hash function to resist long-running adversaries. A standard solution is to use a different hash function at every step in the chain. The question then is the following: if $H$ is the composition of $k$ [*random*]{} hash functions, namely $$H(x) {\mathrel{\mathop:}=}h_k(h_{k-1}(\cdots(h_2(h_1(x))) \cdots ))\,,$$ how difficult is it to invert $H$ given $H(x)$ for a random $x$ in the domain? To the best of our knowledge, this aspect of hash chain security has not been analyzed previously.
In Section \[sec:online\] we prove a time lower bound for inverting a hash chain composed of independent hash functions. We show that as opposed to the case in Theorem \[thm:hastad\], where the same function is used throughout the chain, resulting in a loss of security by a factor of $O(k)$, using independent hash function results in a loss of only a factor of $2$. Thus for most practical applications, a hash chain is as hard to invert as a single hash function. In Section \[sec:preprocessing\], we prove a time-space lower bound for inverters that can preprocess the hash function.
A lower bound for inverting hash chains {#sec:online}
---------------------------------------
\[thm:onlineinvert\] Let functions ${h_1,\dotsc,h_k \in [N]\rightarrow [N]}$ be chosen independently and uniformly at random. Let $A$ be an algorithm that gets oracle access to each of the functions $\{h_i\}_{i=1}^k$ and makes at most $T$ oracle queries overall. Then, $$\begin{aligned}
{\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \in \mathcal F_N\\ x_0 \in [N]}}
\left[h_k\left(A(h_{[1,k]}
(x_0))\right) = h_{[1,k]}(x_0)\right] \le \frac {2T+3}{N}.
\end{aligned}$$
Let $W=(w_0,w_1,\dotsc,w_k)$ be the sequence of values of the hash chain, i.e., $w_0=x_0$ and $w_i=h_i(w_{i-1})$ for $i\in[1,k]$. Let $A$ be an adversary that makes at most $T$ oracle queries. Denote by $q_j=(i_j,x_j,y_j)$ the $j$-th query made by $A$, where $i_j$ is the index of the oracle queried, $x_j$ is the input queried, and $y_j$ is the oracle’s response. We say that a query $q_j$ *collides* with $W$ if $y_j
= w_{i_j}$, namely the reply to the query is a point on the hash chain. At the cost of one additional query, we modify $A$ to query $h_k$ on its output before returning it. Thus, we can assume that if $A$ successfully find a preimage, at least one of its $T+1$ queries collides with $W$.
Let $R=\{(i,x,y) : h_i(x)=y\}$ be the set of all random oracle queries and their answers. Using the principle of deferred decision, we can construct the set $R$ incrementally as follows. Initially $R=\emptyset$; subsequently whenever $A$ makes an oracle query of the form $(i,x)$, if $x=w_{i-1}$, we respond with $y=w_i$ and add $(i, w_{i-1}, w_i)$ to $R$. Else if $(i,x,y)\in R$, we reply with $y$. Otherwise, we choose $y$ uniformly at random from $[N]$, add $(i,x,y)$ to $R$, and reply with $y$.
As mentioned above, to invert the hash chain, at least one query $q_j\in R$ must collide with $W$. It follows that $$\begin{aligned}
{\mathop{\bf Pr\/}}_{H, x_0}\left[A \text{ loses}\right] =
&{\mathop{\bf Pr\/}}_{H, x_0}\left[\bigwedge_{j=1}^{T+1} y_j\neq w_{i_j}\right] \\
= &\prod_{j=1}^{T+1}{\mathop{\bf Pr\/}}_{H, x_0}\left[y_j\neq w_{i_j} \middle |
\bigwedge_{\ell=1}^{j-1}y_\ell\neq w_{i_\ell}\right].
\end{aligned}$$
To bound each term inside the product, we use the basic fact that $$\begin{aligned}
{\mathop{\bf Pr\/}}(A|C) &= {\mathop{\bf Pr\/}}(A|B,C){\mathop{\bf Pr\/}}(B|C) + {\mathop{\bf Pr\/}}(A|\neg B,C){\mathop{\bf Pr\/}}(\neg B|C) \\
&\le {\mathop{\bf Pr\/}}(A|B,C) + {\mathop{\bf Pr\/}}(\neg B|C)
\end{aligned}$$ to obtain $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{H, x_0}\left[y_j = w_{i_j} \middle |
\bigwedge_{\ell=1}^{j-1}y_\ell\neq w_{i_\ell}\right] \\
& \le {\mathop{\bf Pr\/}}_{H, x_0}\left[y_j = w_{i_j} \middle | x_j\neq w_{i_j-1} \wedge
\bigwedge_{\ell=1}^{j-1}y_\ell\neq w_{i_\ell}\right] \\
&+ {\mathop{\bf Pr\/}}_{H, x_0}\left[x_j = w_{i_j-1} \middle |
\bigwedge_{\ell=1}^{j-1}y_\ell\neq w_{i_\ell}\right].
\end{aligned}$$ Notice that the first of the two events in the last sum can only occur if $x_j$ does not appear in $R$. Otherwise, $y_j\neq w_{i_j}$ due to the fact that none of the previous queries collided with $W$. Therefore, the reply $y_j$ is sampled uniformly at random, and this term is at most $\frac 1N$.
To bound the second term, note that each previous reply $y_\ell$, provided that it does not collide with $W$, rules out at most one possible value for $w_{i_j-1}$: either $x_\ell$ if $i_\ell = i_j$, or $y_\ell$ if $i_\ell =
i_j-1$. Therefore, $w_{i_j-1}$ is distributed uniformly over the remaining values, of which there are at most $N-(j-1)$. Specifically $w_{i_j-1}$ is equal to $x_j$, which is a function of all the previous replies $y_1,
\dotsc,y_{j-1}$, with probability at most $\frac 1{N-j+1}$.
Overall, $$\begin{aligned}
{\mathop{\bf Pr\/}}_{H, x_0}\left[A \text{ loses}\right] &\ge \prod_{j=1}^{T+1}
\left( 1- \frac 1N - \frac 1{N-j+1}\right) \\
&\ge \prod_{j=1}^{T+1}
\left( 1- \frac 2{N-j+1}\right). \\
\end{aligned}$$
We note that this is a telescopic product, which simplifies to $$\frac{(N-T-2)(N-T-1)}{N(N-1)} \geq \frac{N^2 - (2T + 3)N}{N^2}$$ and therefore,
$${\mathop{\bf Pr\/}}_{H, x_0}\left[A \text{ wins}\right] \leq \frac{2T+3}{N}.$$
Theorem \[thm:onlineinvert\] establishes the difficulty of finding a preimage of the last iterate of the hash chain. For T/Key, we also need to bound the success probability of attacks that “guess” a preimage of the entire chain.
\[cor:onlineall\] Let functions ${h_1,\dotsc,h_k \in [N]\rightarrow [N]}$ be chosen independently and uniformly at random. Let $A$ be an algorithm that gets oracle access to each of the functions $\{h_i\}_{i=1}^k$ and makes at most $T$ oracle queries overall. Then, $$\begin{aligned}
{\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \in \mathcal F_N\\ x_0 \in [N]}}
\left[h_{[1,k]}\left(A(h_{[1,k]}
(x_0))\right) = h_{[1,k]}(x_0)\right] \le \frac {2T+2k+1}{N}.
\end{aligned}$$
Let $A$ be an algorithm as in the statement of the corollary. We use it to construct an algorithm $A'$ that finds a preimage of the last iterate of the hash chain (as in the statement of Theorem \[thm:onlineinvert\]). On input $y$, algorithm $A'$ runs algorithm $A$ to get a point $z$ and then computes and outputs $z'=h_{[1,k-1]}(z)$. If $h_{[1,k]}(z)=h_{[1,k]}(x)$, then $h_k(z')=h_{[1,k]}(x)$. Moreover, algorithm $A'$ makes at most $T'=T+k-1$ queries to its oracles. Therefore by Theorem \[thm:onlineinvert\], its success probability is at most $(2T'+ 3)/N=(2T+2k+1)/N$.
#### Optimality.
One might ask whether the above lower bound is tight. Perhaps composing $k$ independent hash functions not only avoids some of the problems associated with using a hash chain derived by composing the same hash function, but actually results in a function that is $k$ times more difficult to invert than the basic hash function. Ideally, one might have hoped that the probability of inverting the hash chain in $T$ queries would be at most $O\left(\frac{T}{kN}\right)$.
However, this is not the case, because every iteration of the hash chain introduces additional collisions and shrinks the domain of the function at a rate of $1/k$, where $k=o(N)$ is the length of the chain (see Lemma \[lem:shrinkage\] for a proof sketch). An attacker can use these collisions to her advantage. Consider an attack that evaluates the chain on $T/k$ random points in its domain (at a total cost of $T$ hash computations). Lemma \[lem:preimages\] shows that a point in the image of the hash chain has $k$ preimages in expectation. Therefore, each of the $T/k$ randomly chosen points collides with the input under the chain with probability $k/N$, and so the overall success probability of the attack is roughly $T/N$.
Security of T/Key
-----------------
Our threat model assumes the adversary can repeatedly gain access to the server and obtain all information needed to verify the password. The adversary can also obtain multiple valid passwords at times of his choice. Finally, we allow the adversary to choose the time when he makes his impersonation attempt. To mitigate preprocessing attacks, we salt all our hash functions (in Section \[sec:preprocessing\], we discuss preprocessing attacks in more detail, including the extent to which salting helps prevent them).
#### Non-threats.
First, we assume that there is no malware on the phone or on the user’s laptop. Otherwise, the user’s session can be hijacked by the malware, and strong authentication is of little value. Second, because the channel between the laptop and the authentication server is protected by TLS, we assume there is no man-in-the-middle on this channel. Third, all TOTP schemes are susceptible to an [*online*]{} phishing attack where the attacker fools the user into revealing her short-lived one-time password to a phishing site, and the attacker then immediately authenticates as the user, within the allowable short window. This is a consequence of the requirement for [*one-way*]{} communication with the authentication token (the phone). Note however that the limited time window makes the exploitation of credentials time-sensitive, which makes the attack more complicated.
We begin by presenting a formal definition of security. Our definitions are based on standard definitions of identification protocols (see, for example, [@Shoup_1999]).
A one-time password protocol is a tuple $\mathcal I=(\texttt{pp},
\texttt{keygen}, P, V)$ where
- Public parameter generator $\texttt{pp}(1^\lambda, k) \rightarrow n$ is a polynomial time algorithm that takes as input the security parameter in unary along with the maximal supported authentication period $k$ and outputs the password length $n$.
- Key generator $\texttt{keygen}(n,k) \rightarrow
(\mathit{sk},\mathit{vst})$ is a probabilistic polynomial time algorithm that takes as input the parameters, $n$ and $k$, and outputs the prover’s secret key $\mathit{sk}$ and the initial verifier state $\mathit{vst} $.
- Prover $\texttt{P}\,(\mathit{sk},t)\rightarrow p_t$ is a polynomial time algorithm, which takes as input the prover’s secret key $\mathit{sk}$, and a time $t \in [1,k]$, and outputs a one-time password $p$.
- Verifier $\texttt{V}\,(\mathit{vst},p,t)\rightarrow
(\texttt{accept/reject},\mathit{vst}')$ is a polynomial time algorithm, which takes as input the previous state $\mathit{vst}$, a password $p$, and time $t\in [1,k]$ and outputs whether the password is accepted and the updated verifier state $\mathit{vst}'$.
For correctness, we require that when executed on monotonically increasing values of $t$ with the state $\mathit{vst}$ properly maintained as described above, the verifier $\texttt{V}\,(\mathit{vst},
\texttt{P}\,(\mathit{sk},t),t)$ always outputs $\texttt{accept}$.
We now proceed to define the security game, where we use the random oracle model [@randomoracle].
\[def:game\] Let $\mathcal I$ be a time-based one-time password protocol, and let $\mathcal O
$ be a random oracle. Given a challenger and an adversary $A$, the attack game runs as follows:
- *Public Parameter Generation* – The challenger generates\
$n
\leftarrow \texttt{pp}(1^\lambda,k)$.
- *Key Generation Phase* – The challenger generates\
${(vk,\mathit{sk}) \leftarrow
\texttt{keygen}^{\mathcal O}(n,k)}$, given access to the random oracle.
- *Query Phase* – The adversary runs the algorithm $A$, which is given the verifier’s initial state $\mathit{vst}$ as well as the ability to issue the following types of (possibly adaptive) queries:
- Password Queries: The adversary sends the challenger a time value $t$.\
The challenger generates the password $p\leftarrow
\texttt{P}\,^\mathcal{O}(t,\mathit{sk})$, feeds it to the verifier to obtain $(\texttt{accept}, \mathit{vst}')\leftarrow
\texttt{V}\,^{\mathcal O}(t,\mathit{vst},p)$, updates the stored verifier state to $\mathit{vst}'$, and sends $p$ to the adversary.
- Random Oracle Queries: The adversary sends the challenger a point $x$, and the challenger replies with $\mathcal O(x)$.
The above queries can be adaptive, and the only restriction is that the values of $t$ for the password queries must be monotonically increasing.
- *Impersonation attempt* – The adversary submits an identification attempt $(t_{\mathrm{attack}},p_{\mathrm{attack}})$, such that $t_{\mathrm{attack}}$ is greater than all previously queried password values.
We say that the adversary $A$ wins the game if $\,\texttt{V}^{\,\mathcal O}
(vst,p_{\mathrm{attack}},t_{\mathrm{attack}})$ outputs `accept`. We let $\textbf{Adv}_A(\lambda)$ denote the probability of the adversary winning the game with security parameter $\lambda$, where the probability is taken over the random oracle as well as the randomness in the key generation phase.
We are now ready to prove that T/Key is secure. Specifically, given an adversary that makes at most $T$ queries, we establish an upper bound on the advantage the adversary can have in breaking the scheme. We note that no such result was previously known for the original S/Key scheme, and the key ingredient in our proof is Theorem \[thm:onlineinvert\].
\[thm:security\] Consider the T/Key scheme with password length $n$ and maximum authentication period $k$. Let $A$ be an adversary attacking the scheme that makes at most $T$ random oracle queries. Then, $$\textbf{Adv}_A \le \frac {2T+2k+1}{2^n}.$$
First, recall that our scheme uses a hash function $H:\{0,1\}^m
\rightarrow \{0,1\}^m$ to get $k$ functions $h_1, \dots,h_k : \{0,1\}^n
\rightarrow \{0,1\}^n$, where ${h_i(x) = H(t_{\mathrm{init}} + k - i
\|\mathit{id} \| x)
\vert_n}$. In the random oracle model, we instantiate $H$ using the random oracle, and so the resulting $k$ functions, $h_1, \hdots, h_k$, are random and independent.
Without loss of generality, we assume that $t_{\mathrm{init}}=0$ and that the latest password requested by the adversary is the top of the chain $p_k$ (since the functions $h_1,\dotsc,h_k$ are independent, any random oracle or password queries corresponding to times earlier than the latest requested password do not help the adversary to invert the remaining segment of the chain).
By definition, the verifier accepts $(t_{\mathrm{attack}},p_{\mathrm{attack}})$ if and only if $h_{[k-t_{\mathrm{attack}}+1,k]}(p_{\mathrm{attack}}) =
h_{[1,k]}(\mathit{sk})$. Therefore, if the adversary wins the game, it must hold that at least one query $q_j\in R$ collides with $W$. The proof then follows from Corollary \[cor:onlineall\].
#### Concrete Security
With this result at hand, we compute the password length required to make T/Key secure. For moderate values of $k$ (say, negligible in $2^n$), to make our scheme as secure as a $\lambda$-bit random function, it is enough to set $n=\lambda+2$, since then, assuming $k<T$, $$\textbf{Adv}_A \le \frac{2T+2k+1}{2^n} \le \frac{4T}{2^{\lambda+2}} =
\frac T{2^\lambda}\,.$$ For standard 128-bit security, we require passwords of length 130 bits.
Checkpointing for Efficient Hash Chain Traversal
================================================
In our scheme, the client stores the secret $\mathit{sk}$, which is used as the head of the hash chain. In the password generation phase, as described in Section \[sec:description\], the client must compute the value of the node corresponding to the authentication time each time it wishes to authenticate. A naive implementation would simply traverse the hash chain from the head of the chain all the way to the appropriate node. Since T/Key uses long hash chains, this approach could lead to undesirable latency for password generation. To decrease the number of hashes necessary to generate passwords, the client can store several values (called “pebbles") corresponding to various points in the chain.
There exist multiple techniques for efficient hash chain traversal using dynamic helper pointers that achieve $O(\log n)$ computation cost per chain link with $O(\log n)$ cells of storage [@jakobsson; @cj]. However, there are two key differences between the goals of those schemes and our requirements.
1. These techniques all assume sequential evaluation of the hash chain, whereas in our scheme, authentication attempts are likely to result in an access-pattern containing arbitrary gaps.
2. Previous schemes aim to minimize the overall time needed to take a single step along the hash chain, which consists of two parts: the time needed to fetch the required value in the hash chain, and the time needed to reposition the checkpoints in preparation for fetching the future values. In our setting, however, it makes sense to minimize only the time needed to fetch the required hash value, potentially at the cost of increasing the time needed to reposition the checkpoints. This is reasonable since the gaps between a user’s authentication attempts provide ample time to reposition the checkpoints, and it is the time to generate a password that is actually noticeable to the user.
If the user’s login behavior is completely unpredictable, we can minimize the worst-case password generation time by placing the checkpoints at equal distances from one another. We call this the *naïve* checkpointing scheme. However, in many real-world scenarios, user logins follow some pattern that can be exploited to improve upon the naïve scheme.
To model a user’s login behavior, we consider a probability distribution that represents the probability that the user will next authenticate at time $t$ (measured in units of time slots) given that it last authenticated at time $0$. Additionally, we let each node in the hash chain be indexed by its distance from the tail of the chain and let $\ell$ be the index of the head of the chain (i.e., $\ell$ is the length of the remaining part of the hash chain). In this model, valid future login times are the integers $\{1, 2, \hdots, \ell\}$, and each node in the hash chain is indexed by the corresponding login time. By this, we mean that the valid password at time $t$ is the value at node $t$. This notation is illustrated in Fig. \[chainfig\].
The problem is then to determine where to place $q$ checkpoints, $0 \leq c_1
\leq c_2 \leq \hdots \leq c_q < \ell$, in order to minimize the expected computation cost of generating a password. We note that if the client authenticates at time $t$ and $c_i$ is the closest checkpoint to $t$ with $c_i
\geq t$, then the computational cost of generating the password is $c_i - t$. If no such checkpoint exists, then the cost is $\ell - t$. We do not take into account the number of additional hash computations required to reposition the checkpoints after generating a password.
In order to make the analysis simpler, we relax the model from a “discrete” notion of a hash chain to a “continuous” one. By this, we mean that we make the probability distribution modeling the client’s next login time continuous and allow the checkpoints to be stored at any real index in the continuous interval $(0,\ell]$. Additionally, we allow authentications to occur at any real time in $(0,\ell]$. Formally, let $p(t)$ be the probability density function (pdf) of this distribution with support over the positive reals and let $F(t) =
\int_0^{t} p(t) dt$ be its cumulative distribution function (cdf). We can then express the computational cost $C$ in terms of the checkpoints by the formula $$\begin{aligned}
C &= \int_0^{c_1} (c_1 - t) p(t)dt + \int_{c_1}^{c_2} (c_2 - t)p(t)dt +
\hdots + \int_{c_q}^\ell (\ell - t)p(t)dt \\
&= c_1 F(c_1) + c_2 (F(c_2) - F(c_1)) + \hdots + \ell(F(\ell) - F(c_q)) -
\int_0^\ell t p(t) dt. \\\end{aligned}$$ In order to determine the values of the $c_i$’s that minimize $C$, we take the partial derivatives $\frac{\partial C}{\partial c_i}$ for each variable and set them equal to $0$. This gives the following system of equations: $$\begin{aligned}
\label{eqn:full_first}
\frac{F(c_1)}{p(c_1)} &= c_2 - c_1 \\
\frac{F(c_2) - F(c_1)}{p(c_2)} &= c_3 - c_2 \\
\vdots \\
\label{eqn:full_last}
\frac{F(c_q) - F(c_{q-1})}{p(c_q)} &= \ell - c_q\,.\end{aligned}$$ Solving these equations yields the values of the $c_i$’s that minimize $C$, which we then round to the nearest integer, since checkpoints can only be placed at integer coordinates. We refer to this as the *expectation-optimal* solution.
Depending on the specific distribution, this system of equations may or may not be numerically solvable. If necessary, one can simplify the problem by replacing the set of dependent multivariate equations with a set of independent univariate equations. This is done using the following recursive approach. We first place a single checkpoint $c$ optimally in $[0,\ell]$, then place optimal checkpoints in the subintervals $[0,c]$ and $[c,\ell$\], and then place checkpoints in the next set of subintervals, etc. The problem then reduces to the problem of placing a single checkpoint in an interval $[a,b]$, and the optimal location $x$ can be determined by solving the equation $$\label{eqn:recursive}
\frac{F(x) - F(a)}{p(x)} = b - x\,.$$
In practice, mobile second-factor devices are often not the best environment for running numerical solvers. One solution would be to precompute the expectation-optimal checkpoint positions for some fixed length $\ell$ (e.g., the initial length of the chain) and distribution $F$ and then hardcode those values into the second-factor application. However, as time progresses, these precomputed positions will no longer be expectation-optimal for the the length of the *remaining* part of the hash chain. Moreover, one might want to adaptively reposition the checkpoints based on the past average time between logins of the user.
#### Repositioning the checkpoints
Each time a password is generated, we reposition the checkpoints by computing the optimal checkpoint positions for the length of the remaining chain. We then compute the hash values at these positions by traversing the hash chain from the nearest existing checkpoint. This is done in the background after presenting the user with the generated password.
User logins as a Poisson process
--------------------------------
One choice for modeling the distribution $F(t)$ between logins is the exponential distribution $$\begin{aligned}
p(t) = \lambda e^{-\lambda t} \quad \quad F(t)= 1- e^{-\lambda t}\,. \end{aligned}$$ The exponential distribution is a distribution of the time between events in a Poisson process, i.e. a process in which events occur continuously and independently at a constant average rate. Previous works state that this is a reasonable model for web login behavior [@Blocki2013; @Rasch]. In our setting, the value of the average time between logins could vary anywhere between hours and months depending on the specific application and whether a second factor is required on every login, once in a period, or once per device.
For the exponential distribution, Equation \[eqn:recursive\] gives: $$\frac{-e^{-\lambda x} + e^{-\lambda a}}{\lambda e^{-\lambda x}} = b -x\,.$$ Conveniently, this equation admits the analytic solution $$\label{eqn:analytic} x = -\frac{W(e^{\lambda(x-a)+1})}{\lambda} + b +
1/\lambda\,,$$ where $W(\cdot)$ is the Lambert-W function [@lambert]. The recursive solution in this case can then be easily implemented on the second-factor device.
Figure \[fig:checkpointcomparison\] compares the expected performance of the following checkpointing procedures: naïve, expectation-optimal (obtained by numerically solving Equations \[eqn:full\_first\]-\[eqn:full\_last\]) and recursive (obtained using Equation \[eqn:analytic\]). We also compare against the pebbling scheme of Coppersmith and Jakobsson [@cj], although as we’ve noted above, their scheme optimizes a different metric than ours, so it is no surprise that it does not perform as well as the recursive or expectation-optimal approaches in our setting.
![Performance of checkpointing schemes. Chain length is $1.05\times 10^6$ (one year when using $30$-second time slots). Login times are assumed to be a Poisson process with mean of $20160$ (one week when using $30$-second time slots). []{data-label="fig:checkpointcomparison"}](pebbling_graph){width="\columnwidth"}
#### Balancing worst and expected performance
One disadvantage of both the expectation-optimal and recursive checkpoints is that they perform poorly in the worst-case. Specifically, if a user does not log in for a long period of time, a subsequent login might result in an unacceptably high latency. A simple solution is to place several additional checkpoints in order to minimize the maximal distance between checkpoints, which bounds the worst case number of hash computations.
Figure \[fig:checkpoint\] illustrates the placement of checkpoints given by the different checkpointing schemes discussed in this section plotted along the probability density function of the exponential distribution.
![Illustration of different checkpointing schemes with logins modeled by the exponential distribution.[]{data-label="fig:checkpoint"}](checkpoints_pos.png){width="\columnwidth"}
Implementation {#sec:impl}
==============
We implemented our scheme by extending the Google Authenticator Android App and the Google Authenticator Linux Pluggable Authentication Module (PAM) [@googleauth].
#### Scheme Details and Parameters
We use passwords of length $130$ to obtain the level of security discussed in Section \[sec:security\]. As a concrete instantiation of a family of independent hash functions, for ${0\le i <
2^{32}}$, we take ${h_i:\{0,1\}^{130} \rightarrow
\{0,1\}^{130}}$ to be defined as $h_i(x)=\texttt{SHA-256}(\langle i
\rangle_{32}\|\mathit{id} \| x)\vert_{130}$, where $\langle i \rangle_{32}$ is the index of the function represented as a $32$-bit binary string, and $\mathit{id}$ is a randomly chosen $80$-bit salt. Our time-based counter uses time slots of length $30$ seconds with $0$ being the UNIX epoch. The length of the hash chain has to be chosen to balance the resulting maximal authentication period and the setup time (which is dominated by the time to serially evaluate the entire hash chain). We use $2^{21}$ as our default hash chain length, resulting in a maximum authentication period of approximately $2$ years and a setup time of less than $15$ seconds on a modern mobile phone (see Section \[sec:evaluation\] for more details).
Password Encoding
-----------------
Since the one-time passwords in our scheme are longer than those in the HMAC-based TOTP scheme (130 bits vs. 20 bits), we cannot encode the generated passwords as short numerical codes. Instead, we provide two encodings, which we believe are better suited for passwords of this length.
#### QR Codes
First, our Android app supports encoding the one-time password as a QR code. Among their many other applications, QR codes have been widely used for second factor authentication to transmit information from the authenticating device to the mobile device. For example, in Google Authenticator, a website presents the user with a QR code containing the shared secret for the TOTP scheme, which the user then scans with her mobile phone, thus providing the authenticator app with the secret. QR codes have also been used for transaction authentication as a communication channel from the insecure device to the secure one [@qrtan].
In our scheme, QR codes are used in the authentication process as a communication channel from the secure mobile device to the authenticating device. Such a use case was previously considered by [@SJSN] and was shown to be practical [@oneswipe]. Specifically, our app encodes the 130 bit password as a QR code of size $21\times 21$ modules, which is then displayed to the user. To log in on a different device, the user can then use that device’s camera to scan the QR code from the mobile phone’s screen. This method is best suited for use on laptops, tablets, and phones, where built-in cameras are ubiquitous, yet it can also be used on desktops with webcams. The QR code password encoding also provides a clear visualization of the relatively short length of our passwords compared to schemes using public key cryptography. For example, the standard ECDSA digital signature scheme [@ecdsa] with a comparable level of security would result in $512$-bit long one-time passwords, which would consequently require larger $33\times 33$ QR codes [@qrcodes] (a visual comparison appears in Figures \[fig:ourqr\] and \[fig:sigqr\]). More recent digital signature constructions [@bls; @bernstein2012high] could be used to obtain shorter signatures, yet at $384$ and $256$ bits, respectively, those are still considerably longer than the one-time passwords in our scheme.
\[fig:qr\]
#### Manual Entry
Since our usage of QR codes requires the sign-in device to have a camera, we present an alternative method that can be used for devices without cameras. In these instances, our Android app also encodes one-time passwords using a public word list. Using a word list of $2048$ short words (1 to 4 letters), as used in S/Key, results in 12-word passwords, and using a larger $4096$ word list (of words up to 6 letters long), results in 11-word passwords. Additionally, more specialized word lists such as those in [@wordlist] can be used if word lists that enable autofilling and error correction are desired. These would be particularly useful if the sign-in device was a mobile phone.
Alternatively, it would be possible to generate the one-time passwords as arbitrary strings that the user would then manually enter. Assuming every character in the strings has 6 bits of entropy (which is roughly the case for case-sensitive alphanumeric strings), the resulting one-time passwords would be strings composed of 22 characters. While typing these one-time passwords manually would be cumbersome, they are at least somewhat practical, as opposed to $512$ bit/$86$ character long digital signatures.
#### Hardware Authentication Devices
USB-based hardware authentication devices, such as Yubikey [@Yubikey] are often used instead of mobile phone apps for generating TOTP passwords. They offer two main advantages: (i) after the initial setup, the TOTP secret never has to leave the secure hardware, which makes it more secure against client-side malware, and (ii) such authentication devices are capable of emulating a keyboard and can “type” the generated one-time passwords into the relevant password field when the user presses a button on the device. However, hardware tokens do not protect the TOTP secret on the server. Additionally, the registration phase is still susceptible to malware since the TOTP secret needs to be loaded into the hardware token. The newer FIDO U2F protocol [@u2f] addresses these problems, yet it requires specialized support by the browser and two-way communication.
Hardware authentication devices and T/Key could therefore be well-suited for each other: the hardware device would generate the hash chain, store the secret, and provide the server with the initial password. When the user needs to authenticate, the hardware token would traverse the chain and generate the one-time password. T/Key would provide the security against server-side hacks, and the hardware token would provide the security against client-side hacks. Moreover, the ability of the hardware token to automatically “type” the password would address one of T/Key’s main disadvantages, namely that the passwords are too long for manual entry.
[@ l c S S\[table-text-alignment = center\] S\[table-text-alignment = center\] S\[table-text-alignment = center\]]{} & [Mean Time]{} & [Setup Time]{} & & [Verification Time]{}\
& [Between Logins]{} & [(seconds)]{} & & [(seconds)]{}\
(l)[4-5]{} &&& [average case]{} & [worst case]{} &\
1 year & [1 week]{} & 7.5 & 0.3& 0.6 & 0.4\
2 years & [2 weeks]{} & 14 & 0.5& 0.9 & 0.8\
4 years & [1 month]{} & 28 & 0.8 & 1.6 & 1.6\
Evaluation {#sec:evaluation}
==========
We evaluated the performance of our scheme to ensure the running times of its different stages are acceptable for a standard authentication scenario. The client Android app was tested on a Samsung Galaxy S7 phone (SM-G930F) with a 2.3 Ghz Quad-Core CPU and 4 GB of RAM. The server side Linux PAM module was tested on a 2.6 Ghz i7-6600 CPU with 4 GB RAM running Ubuntu 16.04.
Our evaluation uses 130-bit passwords and hash chains of length one, two, and four million, corresponding to one-year, two-year, and four-year authentication periods when a new password is generated every $30$ seconds. We evaluate the following times:
- Client setup time: the time it takes for the mobile phone to first generate the salt and the secret and then traverse the entire hash chain to compute the initial password and create the registration QR code.
- Client password generation time: the time to traverse the chain from the closest checkpoint. We present both the worst-case time, which corresponds to the maximal distance between two checkpoints, as well as the expected time, which we simulate with respect to several typical exponential distributions.
- Server verification time: the time to traverse the entire chain on the server. This captures the longest possible period between logins. In practice, this time will be much shorter if the user logs in regularly.
Results appear in Table \[table:results\]. In general, we view several seconds as being an acceptable time for the initial setup and a sub-second time as acceptable for both password generation and verification.
We attribute some of the differences between the hash chain traversal time on the server and the traversal time on the phone to the fact that the former was tested using native C code, whereas the latter was run using a Java App on the mobile phone.
Attacks with preprocessing {#sec:preprocessing}
==========================
One limitation of the previously discussed security model is that we do not allow the adversary’s algorithm to depend on the choice of the random function $h$. In practice, however, the function $h$ is *not* a random function, but rather some fixed publicly known function, such as SHA-256. This means that the adversary could perhaps query the function prior to receiving a challenge and store some information about it that could be leveraged later. In this section, we bound the probability of success of such an attack by $\left(
ST/N\right)^{2/3}$, where $N=2^n$ is the size of the hash function domain. To mitigate the risk of such attacks, we show that by salting all hash functions with a random salt of length $n$, we can bound the probability of success by $(T/N)^{2/3}$ (assuming $S\le N$).
More formally, an inverting attack with preprocessing proceeds as follows:
- First, a pair of algorithms $(A_0,A_1)$ are fixed.
- Second, the function $h$ is sampled from some distribution (e.g., the uniform distribution over all random functions over some set).
- Third, given oracle access to $h$ (which is now fixed), *preprocessing* algorithm $A_0$ creates an advice string $st_{h}$.
- Finally, the *online* algorithm $A_1$ is given the advice string $st_h$, oracle access to the same $h$, and its input $y=h(x)$.
The complexity of an attack in this model is usually measured by the maximal length in bits of the advice string $st_h$, which is referred to as the “space” of the attack and denoted by $S$, and the maximal number of oracle queries of the algorithm $A_1$, which is often referred to as the “time” of the attack and is denoted by $T$. Note that at least for lower bounds we: (i) allow the preprocessing algorithm an unlimited number of queries to its oracle and (ii) only measure the number of queries made by $A_1$, ignoring all other computation.
The power of preprocessing was first demonstrated in the seminal work of Hellman [@hellman1980cryptanalytic], who showed that with preprocessing, one-way permutations can be inverted much faster than by brute force. Specifically, Hellman showed that for every one-way permutation $f:[N]\rightarrow [N]$ and for every choice of parameters $S,T$ satisfying $T\cdot S \ge N$, there exists an attack with preprocessing which uses space $S$ and time $T$. Hellman also gave an argument for inverting a random function with time-space tradeoff $ T\cdot S^2 \ge N^2$. Subsequently, Fiat and Naor [@fiat1991rigorous] gave an algorithm that works for all functions. The inversion algorithm was further improved when Oechslin [@oechslin2003] introduced rainbow tables and demonstrated how they can be used to break Windows password hashes.
Yao [@yao90] investigated the limits of such attacks and proved that ${S\cdot T\ge \Omega(N)}$ is in fact necessary to invert a random function on every point in its image. Yao’s lower bound was further extended in [@gennarotrevisan; @wee2005; @de2010], which showed that attacks that invert a random function with probability $\epsilon$ must satisfy $ST\ge\Omega(\epsilon N)$. Recently, Dodis, Guo, and Katz [@DGK] extended these results by proving that the common defense of *salting* is effective in limiting the power of preprocessing in attacks against several common cryptographic primitives. Specifically, for one way functions, they show:
\[thm:dgk\] Let $h:[M]\times[N]\rightarrow [N]$ be a random function. Let $(A_0,A_1)$ be a pair of algorithms that get oracle access to $h$ such that $A_0$ outputs an advice string of length $S$ bits, $A_1$ makes at most $T$ oracle queries, and $${\mathop{\bf Pr\/}}_{h,\, m\in [M]\,,x \in [N]}
\left[h\left(m,A_1^h(A^h_0, m, h(m,x))\right) = h(m,x)\right] = \epsilon\,.$$ Then, $$T\left(1+\frac SM\right) \ge \tilde\Omega(\epsilon N)\,.$$
The above result can be interpreted as stating that by using a large enough salt space $M$ (e.g., taking $M=N$), one can effectively remove any advantage gained by having an advice string of length $S\le N$. Here, we study the potential of using salts to defeat attacks with preprocessing on hash chains.
Let $\mathcal{F}_{M,N}$ denote the uniform distribution over the set of all functions from $[M]\times[N]$ to $[M]\times[N]$ such that for all $f\in
\mathcal F_{M,N}$ and all $(s,x)\in [M]\times[N]$, $f(s,x)=(s,y)$.
\[THM:INVERTCHAIN\] Let functions ${h_1,\dotsc,h_k \in
\mathcal{F}_{M,N}}$ be chosen independently and uniformly at random, where ${k=o(\sqrt{N})}$. Let $(A_0,A_1)$ be a pair of algorithms that get oracle access to each of the functions $\{h_i\}_{i=1}^k$, such that $A_0$ outputs an advice string of length $S$ bits, $A_1$ makes at most $T$ oracle queries, and $$\hspace{-2em}
\label{eqn:inv_prob}
{\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \in \mathcal{F}_{M,N} \\ m\in[M]\,x \in [N]}}
\left[h_{[1,k]}\left(m,A^h(A^h_0,h_{[1,k]}(m,x))\right) =
h_{[1,k]}(m,x)\right] = \epsilon\,.$$ Then, $$T\left(1+\frac{S}{M}\right) \ge \tilde\Omega(\epsilon^{3/2}N).$$
We prove this theorem in Appendix \[appendix:chain\].
#### Optimality
We do not know whether the above loss in the dependence on $\epsilon$ is optimal. It would be interesting to try to prove a stronger version of the above bound by directly applying the techniques of [@gennarotrevisan]. Even in the setting of constant $\epsilon$, where one looks for the optimal dependence between $S,T$ and $N$, we do not know of an attack matching the above bound for arbitrary intermediate values of $T$ and $S$ (apart from the boundary scenarios $T=N$ or $S=\frac Nk$). Rainbow tables [@oechslin2003], which are the best generic attack to invert random functions, give $S\sqrt{2T}=N$. Since a hash chain is not a random function (it has many more collisions in expectation), the expected performance of rainbow tables in our case is far from obvious. For arbitrary (rather than random) functions, the best known attacks [@fiat1991rigorous] have higher complexity $TS^2=q N^3$, where $q$ is the collision probability of the function. Finding better attacks is an interesting open question.
Security of T/Key against preprocessing
---------------------------------------
Within the context of T/Key, Theorem \[THM:INVERTCHAIN\] leaves a couple of gaps from our goal to make the salted T/Key scheme as secure against attacks with preprocessing as it is secure against attacks without preprocessing. First it has suboptimal dependence on the success probability $\epsilon$. Note that if one only wants to rule out attacks that succeed with constant success probability (say $1/2$ or $0.01$), then this gap is immaterial in terms of its impact on the security parameters. Second, the theorem currently bounds the probability to invert the entire hash chain, whereas to use it in Attack Game \[def:game\], one needs to prove a stronger version in which the attacker can invert a chain suffix of his choice. We leave these two gaps as two open problems.
Related Work
============
For a discussion of the many weaknesses of static passwords, see [@herley2012research]. One-time passwords were introduced by Lamport [@lamport81] and later implemented as S/Key [@skey]. HOTP and TOTP were proposed in [@hotp] and [@totp], respectively. For a review and comparison of authentication schemes, see [@o2003comparing; @bonneau2012quest]. Leveraging trusted handheld devices to improve authentication security was discussed in [@Balfanz] and [@mannan2007using]. Two-factor authentication schemes were analyzed rigorously in [@SJSN], which proposes a suite of efficient protocols with various usability and security tradeoffs.
#### Online Two-Factor Authentication
A large body of work has been devoted to the online setting, where one allows bidirectional digital communication between the server and the second-factor device [@mannan2007using; @garriss2008trustworthy; @phoneauth; @u2f; @duoprompt]. In this setting, secrets on the server can usually be avoided by using public-key cryptography. We especially call the reader’s attention to the work of Shirvanian et al. [@SJSN], who study multiple QR-based protocols. In one of their schemes, called “LBD-QR-PIN,” the mobile device generates a key pair and sends the public key to the server. Subsequently, on each authentication attempt, the server generates a random 128-bit challenge, encrypts it using the client’s public key, and sends it to the authenticating device. The authenticating device encodes the challenge as a QR code, which the user then scans using his mobile device. The mobile device decrypts the challenge using its stored private key, computes a short 6 digit hash of the challenge, and presents it to the user. The user then enters this 6 digit code on the authenticating device, which sends it to the server for verification. A big advantage of this scheme lies in the fact that the messages that the client sends are very short and can therefore easily be entered manually by the user.
#### Hash Chains
For an overview of hash chains and their applications, see [@HJP; @cj; @jakobsson; @goyal]. In particular, Hu et al. [@HJP] provide two different constructions of one-way hash chains, the Sandwich-chain and the Comb Skipchain, which enable faster verification. They are less suited for our setting since skipping segments of the chain requires the prover to provide the verifier with additional values (which would result in longer passwords). Goyal [@goyal] proposes a reinitializable hash chain, a hash chain with the property that it can be securely reinitialized when the root is reached. Finally, [@cj; @jakobsson] discuss optimal time-memory tradeoffs for sequential hash chain traversal. On the theoretical side, statistical properties of the composition of random functions were studied as early as [@rubin1953] and gained prominence in the context of population dynamics in the work of Kingman [@kingman1982coalescent]. The size of the image of a set under the iterated application of a random function was studied by Flajolet and Odlyzko [@Flajolet1990] and later in the context of rainbow tables in [@oechslin2003; @Avoine]. The size of the image of a set under compositions of independent random functions was studied by Zubkov and Serov [@zubkov2015; @zubkov2017], who provide several useful tail bounds, some of which we use in Appendix \[appendix:composition\].
#### Attacks with preprocessing {#attacks-with-preprocessing}
Time-space tradeoffs, which we use as our model in Section \[sec:preprocessing\], were introduced by Hellman [@hellman1980cryptanalytic] and later rigorously studied by Fiat and Naor [@fiat1991rigorous]. The lower bound to invert a function in this model was shown by Yao [@yao90] and, subsequently, extended in [@gennarotrevisan; @wee2005; @de2010; @DGK]. The work of Gennaro and Trevisan [@gennarotrevisan] was particularly influential due to its introduction of the “compression paradigm” for proving these kinds of lower bounds. More attacks in this model were shown by Bernstein and Lange [@BL].
Conclusions
===========
We presented a new time-based offline one-time password scheme, T/Key, that has no server secrets. Prior work either was not time-based, as in S/Key, or required secrets to be stored on the server, as in TOTP. We implemented T/Key as a mobile app and showed it performs well, with sub-15 second setup time and sub-second password generation and verification. To speed up the password generation phase, we described a near-optimal algorithm for storing checkpoints on the client, while limiting the amount of required memory. We gave a formal security analysis of T/Key by proving a lower bound on the time needed to break the scheme, which shows it is as secure as the underlying hash function. We showed that by using independent hash functions, as opposed to iterating the same function, we obtain better hardness results and eliminate several security vulnerabilities present in S/Key. Finally, we studied the general question of hash chain security and proved a time-space lower bound on the amount of work needed to invert a hash chain in the random oracle model with preprocessing.
We thank David Mazières for very helpful discussions about this work. This work is supported by NSF, DARPA, a grant from ONR, and the Simons Foundation. Opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA.
Collisions in Random Functions {#appendix:composition}
==============================
We first need to investigate some statistical properties of compositions of random functions. Starting with the work of Kingman [@kingman1982coalescent], the distribution of the image size $\left|h_{[1,k]}([N])\right|$, and specifically its convergence rate to $1$ ([@donnelly1991weak; @dalal2002compositions]), was studied. In our setting, we are more interested in the properties of $h_{[1,k]}$ for moderate values of $k$, and specifically, we assume $k=o\left(\sqrt N \right)$.
\[lem:shrinkage\] Let $k,N\in \mathbb N$ such that $k=o\left(\sqrt{N}\right)$. Then, $${\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[|h_{[1,k]}([N])|\right] = O\left(\frac Nk\right).$$
A formal proof can be found in [@zubkov2015]. Here, we provide a brief sketch of the argument. Let $$\alpha_k={\mathop{\bf E\/}}_{h_1,\dots,h_k}\left[\left|h_{[1,k]}([N])\right|/N\right]\,.$$ Then, $$\alpha_{k+1}={\mathop{\bf E\/}}_{h_{k+1}}\left[|h_{k+1}([\alpha_kN])|/N\right]\,.$$ The last expression can be interpreted as a simple occupancy problem of independently throwing $\alpha_kN$ balls into $N$ bins and reduces to the probability that a bin is not empty: $$\alpha_{k+1} = 1-(1-1/N)^{\alpha_kN}\,.$$ For large $N$, we can make the approximation $(1 - 1/N)^N \approx 1/e$. Substituting this gives $$\alpha_{k+1} = 1 - e^{-\alpha_k}$$ and Taylor expanding the resulting expression gives the following approximation for the recursive relation: $$\alpha_{k+1}= 1 - (1-\alpha_k+\alpha_k^2/2 -
O(\alpha_k^3)) = \alpha_k-\alpha_k^2/2 + O(\alpha_k^3)\,.$$ Plugging-in the guess $\alpha_k= 2/k + O(1/k^3)$ into the right hand side gives $$\begin{aligned}
\alpha_{k+1} &= 2/k - 2/k^2 + O(1/k^3) = 2(k-1)/k^2 + O(1/k^3) \\
&= 2/(k+1) - 2/(k^2(k+1)) + O(1/k^3) = 2/(k+1) + O(1/k^3)
\end{aligned}$$ and therefore $$\alpha_k= 2/k + O(1/k^3)$$ satisfies the recursive relation.
We also need to estimate the probability that any two points in the domain collide under the hash function. We make use of the following lemma, due to [@zubkov2015], and give a short proof here for completeness.
Let $k,N\in \mathbb N$ such that $k=o\left(\sqrt{N}\right)$, and let $x,x',x''\in [N]$ such that $x\neq x' \neq x''$. Then, $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[ h_{[1,k]}(x) = h_{[1,k]}(x') \right] =
\frac kN - o\left(\tfrac 1N\right) \\
&{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[ h_{[1,k]}(x) = h_{[1,k]}(x') = h_{[1,k]}(x'')
\right] = \frac {k(3k-1 + o_{\scriptscriptstyle N}(1))}{2N^2} .
\end{aligned}$$
Observe that since $h_1,\dotsc,h_k$ are independent, the random variables $h_{[1,i+1]}(x)$ and $h_{[1,i+1]}(x')$ are independent when conditioned on $h_{[1,i]}(x) \neq h_{[1,i]}(x')$. Using this fact gives $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[h_{[1,k]}(x)\neq h_{[1,k]}(x')\right]\\
&=
\prod_{i=1}^k{\mathop{\bf Pr\/}}_{h_i}\left[h_{[1,i]}(x)\neq
h_{[1,i]}(x')\middle| h_{[1,i-1]}(x)\neq
h_{[1,i-1]}(x')\right] \\
&= \prod_{i=1}^k \left(1-\frac 1N\right) =
\left(1-\frac 1N\right)^k
\end{aligned}$$ and subsequently, $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[ h_{[1,k]}(x) = h_{[1,k]}(x') \right] =
1-\left(1-\frac 1N\right)^k\\ &=
1-\left(1-\frac kN + O\left(\frac {k^2}{N^2}\right)\right) =
\frac kN - o\left(\tfrac 1N\right).
\end{aligned}$$ To show the second statement of the lemma, we break down the probability of a 3-collision between $x,x',x''$ by iterating through the different levels in the hash chain where a collision between $x$ and $x'$ could occur. We have that $$\begin{aligned}
{2}
&\mathmakebox[0pt][l]{{\mathop{\bf Pr\/}}\left[ h_{[1,k]}(x) = h_{[1,k]}(x') = h_{[1,k]}
(x'')
\right]} \\
=\,&\mathmakebox[0pt][l]{{\mathop{\bf Pr\/}}\left[ h_{[1,k]}(x) = h_{[1,k]}(x'') \middle|
h_{[1,k]}(x)= h_{[1,k]}(x') \right] \cdot {\mathop{\bf Pr\/}}\left[
h_{[1,k]}(x)= h_{[1,k]}(x') \right]}
\\
= &\sum_{i=0}^{k-1}\bigg(&&{\mathop{\bf Pr\/}}\left[h_{[1,k]}(x) = h_{[1,k]}(x'') \middle|
\min\left\{i':h_{[1,i']}(x)= h_{[1,i']}(x')\right\}=i+1\right]
\\
&&& \cdot {\mathop{\bf Pr\/}}\left[\min\left\{i':h_{[1,i']}(x) =
h_{[1,i']}(x') \right\}=i+1 \right]\bigg) \\
= &\mathmakebox[0pt][l]{\sum_{i=0}^{k-1} \left(1- \left(1-\frac 2N
\right)^i
\cdot\left(1-\frac 1N\right)^{k-i}\right)\cdot\left(1-\frac 1N
\right)^i\cdot \frac 1N} \\
= &\mathmakebox[0pt][l]{\sum_{i=0}^{k-1} \left(1-\left(1-\frac{2i}{N} + o
\left(\frac 1N\right)\right)\cdot\left(1-\frac {k-i}N + o\left(\frac 1N
\right)
\right)\right)\cdot\left(1-\frac{i}{N} + o\left(\frac 1N\right)\right)
\cdot
\frac 1N} \\
= &\mathmakebox[0pt][l]{\sum_{i=0}^{k-1}
\left(\frac {i+k}{N^2} +o\left(\frac 1 {N^2}\right)\right)
= \frac{3k^2-k}{2N^2} + k\cdot o\left(\frac 1{N^2}
\right)}
\end{aligned}$$ as desired.
The next lemma estimates, for any $x \in [N]$, the expected number of preimages of the point $h_{[1,k]}(x)$ and its variance. We use $I_A$ to denote the indicator variable of probability event $A$.
\[lem:preimages\_ex\] Let $\left\{h_i\right\}_{i=1}^k\in \mathcal F_N$ be independent random functions, and let $L_j = \sum_{i=1}^N I_{h_{[1,k]}(i) = j}$ be a random variable of the number of different preimages under $h_{[1,k]}$ of $j\in[N]
$. For every $x\in[N]$, $$\begin{aligned}
&{\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}(x)}\right] = k + 1- o(1) \\
&{{\bf Var}}_{h_1,\dotsc, h_k}\left[L_{h_{[1,k]}(x)}\right] = \frac12(k+1)^2\,.
\end{aligned}$$
From the linearity of expectation and the previous lemma, we find that $$\begin{aligned}
{\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}(x)}\right]
&= {\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[
\sum_{x'=1}^N I_{h_{[1,k]}(x)=h_{[1,k]}(x')} \right] \\
&= \sum_{x'=1}^N
{\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[I_{h_{[1,k]}(x)=h_{[1,k]}(x')}\right] \\
&= \sum_{x'=1}^N{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[h_{[1,k]}(x)=h_{[1,k]}(x')\right]
\\
&= 1 + (N-1)\cdot\left(\frac kN - o(\tfrac 1N)\right) = k + 1 - o(1).
\end{aligned}$$ Additionally, $$\begin{aligned}
&{\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[L^2_{h_{[1,k]}(x)}\right] \\
&= {\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[
\sum_{x'=1}^N \sum_{x''=1}^N I_{h_{[1,k]}(x)=h_{[1,k]}(x')} \cdot
I_{h_{[1,k]}
(x)=h_{[1,k]}(x'')}\right] \\
&= {\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[ \sum_{x',x''=1}^N I_{h_{[1,k]}(x)=h_{[1,k]}
(x')=h_{[1,k]}(x'')} \right] \\
&= (N-1)(N-2) \cdot {\mathop{\bf E\/}}_{\substack{h_1,\dotsc,h_k\\ x,x',x''\text{
different}}}
\left[ I_{h_{[1,k]}(x)=h_{[1,k]}(x')=h_{[1,k]}(x'')}\right] \\
&\qquad+ 3(N-1) \cdot
{\mathop{\bf E\/}}_{\substack{h_1,\dotsc,h_k\\ x \neq x'}}\left[ I_{h_{[1,k]}(x)=h_{[1,k]}
(x')}
\right] + 1 \\
&=(N-1)(N-2)\cdot \left(\frac {k(3k-1 + o_{\scriptscriptstyle N}(1))}{2N^2}
\right) + 3(N-1)\cdot \left(\frac kN - o\left(\tfrac 1N\right) \right) + 1
\\
&= \tfrac 32 k^2 + \left(\tfrac 52 + o_{\scriptscriptstyle N}(1)\right)k +
1
\end{aligned}$$ and thus $$\begin{aligned}
{{\bf Var}}_{h_1,\dotsc, h_k}\left[L_{h_{[1,k]}(x)}\right] &= {\mathop{\bf E\/}}_{h_1,\dotsc,h_k}
\left[L^2_{h_{[1,k]}(x)}\right] - {\mathop{\bf E\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}
(x)}
\right]^2 \\
&= \tfrac 12 k^2 + \left(\tfrac 12 + o_{\scriptscriptstyle N}(1)
\right)k \le \tfrac 12 (k+1)^2.
\end{aligned}$$
\[lem:preimages\] Let $\left\{h_i\right\}_{i=1}^k\in \mathcal F_N$ be independent random functions, and let $L_j = \sum_{i=1}^N I_{h_{[1,k]}(i) = j}$ be a random variable of the number of different preimages under $h_{[1,k]}$ of $j\in[N]
$. For every $x\in[N]$, $${\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}(x)} \ge
\frac {2k}{\sqrt{\epsilon}} \right]
\le \frac \epsilon 2.$$
Applying Chebyshev’s inequality, we obtain $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}(x)} \ge
\frac {2k}{\sqrt{\epsilon}} \right] \\
&\le {\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}
\left[L_{h_{[1,k]}
(x)} \ge (k+1)+ \sqrt{\frac 2 \epsilon} \cdot \sqrt {\frac 12}(k+1)
\right]
\le
\frac
\epsilon 2 . \qedhere
\end{aligned}$$
Let $\left\{h_i\right\}_{i=1}^k\in \mathcal F_{M,N}$ be independent identically random functions, and let $L_j = \sum_{i=1}^N
I_{h_{[1,k]}(i) = j}$ be a random variable of the number of different preimages under $h_{[1,k]}$ of $j\in [M] \times[N]$. For every $(s,x)\in[M]\times[N]$, $${\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k}\left[L_{h_{[1,k]}(s,x)} \ge
\frac {2k}{\sqrt{\epsilon}} \right]
\le \frac \epsilon 2.$$
Fix $s\in [M]$, and define $h_{i,s}(x)$ to be the last $n$ bits of $h_i(s,x)$. Applying the previous lemma to $\{h_{i,s}\}_{i=1}^k$ yields the result.
Proof of Theorem \[THM:INVERTCHAIN\] {#appendix:chain}
====================================
Our proof reduces the problem of inverting a random function to the problem of inverting a random hash chain.
Let $\mathcal D$ be a distribution over functions from $\mathcal X$ to $\mathcal X$ such that for every $x\in \mathcal X$ $$\label{eqn:property}
{\mathop{\bf Pr\/}}_{h_1,\dotsc,h_k\in\mathcal D}\left[L_{h_{[1,k]}(x)} \ge
\frac {2k}{\sqrt{\epsilon}} \right]
\le \frac \epsilon 2.$$ Let $A$ be an oracle algorithm, which, given oracle access to $h_1,\dotsc,h_k\in \mathcal D$ and $S$ bits of advice, makes at most $T$ oracle queries to all of its oracles combined and successfully inverts with probability $\epsilon\in(0,1)$. For any choice of functions $\{h_i\}_{i=1}^k\in\mathcal D$, let $$G_{h_1,
\dots,h_k}=
\left\{\,x\in\mathcal X
: \left(A(h_{[1,k]}(x)) = x \right)\wedge
\left(L_{h_{[1,k]}(x)} \le \frac {2k}{\sqrt \epsilon}\right)
\,
\right\}$$ be the set of *good points*, where we say that a point is good if $A$ outputs $x$ when executed on $h_{[1,k]}(x)$, and the point does not have many collisions under $h_{[1,k]}$. Note that the first condition is stronger than the condition that $A$ merely inverts $h_{[1,k]}(x)$. Denote by $h_{[1,k]}(G_{h_1,\dots,h_k})$ the corresponding set of good images. Observe that the second condition above guarantees that each point in the image $h_{[1,k]}(G_{h_1, \dots,h_k})$ has at most $
\frac{2k}{\sqrt
\epsilon}$ preimages under $h_{[1,k]}$. Using this observation and a union bound, we conclude that
Plugging in the probabilities given by the theorem hypothesis and Equation \[eqn:property\], we obtain $$\begin{aligned}
{\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \\ x\in \mathcal X }} \left[x \in G_{h_1,
\dots,h_k}
\right]
&\ge \frac {\sqrt \epsilon}{2k} \cdot (\epsilon-\tfrac
\epsilon 2)
\ge \frac {\epsilon^{3/2}}{4k}.\end{aligned}$$
For any $i\in[k]$, let $G^i_{h_1,\dotsc,h_k}$ be the subset of points in $G_{h_1,\dotsc,h_k}$ on which $A$ queries its $i$-th oracle function at most $\frac{2T}{k}$ times. Note that for every input and every choice of hash functions, the total number of queries is at most $T$, and so for every input, $A$ queries at least $1/2$ of its oracle functions at most $\frac{2T}k$ times. Therefore $$\begin{aligned}
&{\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \\ x\in \mathcal X \\i\in[k] }} \left[x \in
G^i_{h_1,
\dots,h_k}
\right] \\
&={\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \\ x\in \mathcal X \\i\in[k] }}\left[x\in
G^i_{h_1,\dotsc,h_k}\middle| x \in G_{h_1,
\dotsc,h_k} \right] \cdot {\mathop{\bf Pr\/}}_{\substack{h_1,\dotsc,h_k \\ x\in \mathcal X
}}
\left[x \in G_{h_1,
\dots,h_k}
\right] \\ &\ge \frac {\epsilon^{3/2}}{8k}.\end{aligned}$$
Therefore, there exists some fixed index $i^*\in[1,k]$ and some fixed choice of all the other hash functions $h_1, \dotsc,h_{i^*-1},h_{i^*+1},\dotsc,h_k$ that achieves a probability of at least $\frac {\epsilon^{3/2}}{8k}$ over a random $h_{i^*}$ and a random ${x\in
G_{h_1,\dotsc,h_k}}$. For every function $h$, denote by $G^{i^*}_h$ the set $G^{i^*}_{h_1,\dotsc,h_k}$ with $h_{i^*}=h$ and the other functions fixed as above. We get $$\begin{aligned}
\label{eqn:T_on_G}
{\mathop{\bf Pr\/}}_{\substack{h \in \mathcal D\\ x \in\mathcal X}}
\left[x \in G_h^{i^*}
\right] \ge \frac {\epsilon^{3/2}}{8k}.\end{aligned}$$
The choice of $i^*$ as well as the explicit description of the functions $h_1, \dotsc,h_{i^*-1},h_{i^*+1},\dotsc,h_k$ can be hard-coded into the algorithm $A$ since Theorem \[thm:dgk\], and therefore also our reduction, can be arbitrarily non-uniform in the *input size*. Another way of thinking about this is that since our model charges the algorithm only for oracle queries, an algorithm in this model can deterministically determine the best $i^*$ and the remaining functions by simulating $A$’s behavior on all possible inputs (without making any oracle queries).
Consider the following algorithm $A'$ for inverting a random function $h\in \mathcal D$. Algorithm $A'$ gets the same $S$ bits of advice as $A$ and is given oracle access to $h$. On input $z\in\mathcal X$, $A'$ computes $y=h_{[i^*+1,k]}(z)$ and then simulates $A$ on $y$ as follows: $A'$ uses its own oracle to answer oracle queries to $h_{i^*}$ and uses the chosen functions $h_1, \dotsc,h_{i^*-1},h_{i^*+1},\dotsc,h_k$ to answer all other oracle queries. Furthermore, $A'$ bounds the number of queries to $h$ by $\frac {2T}k$. Thus, if during the simulation $A$ tries to make more than this number of queries to $h$, algorithm $A'$ aborts. Otherwise, $A'$ obtains $A(y)$ and then computes and outputs $h_{[1,i^*-1]}(A(y))$.
To analyze the success probability of $A'$, the key observation is that if $w\in h_{[1,i^*-1]}(G^{i^*}_h)$, then $A'$ inverts $h(w)$ successfully. To see this, note that if $w=h_{[1,i^*-1]}(x)$ for $x\in G_h^{i^*}$, then $A'$ simulates $A$ on $$y=h_{[i^*+1,k]}(h(w))=h_{[1,k]}(x) \in G_h^{i^*},$$ thus $A(y)=x$, and $A'(h(w)) = h_{[1,i^*-1]}(A(y)) =w $ as desired. Therefore $$\begin{aligned}
{\mathop{\bf Pr\/}}_{\substack{h\in\mathcal D\\ w\in \mathcal X
}}
\left[A'(h(w)) \in h^{-1}(h(w))\right]
&\ge {\mathop{\bf Pr\/}}_{\substack{h\in\mathcal D \\ w\in \mathcal X }}
\left[w \in h_{[1,i^*-1]}(G') \right] \\
&= {\mathop{\bf Pr\/}}_{\substack{h\in\mathcal D \\ x\in \mathcal X }}
\left[x \in G_h^{i^*}\right] \ge \frac {\epsilon^{3/2}}
{8k},\end{aligned}$$ where the penultimate equality holds because $h_{[1,k]}$ and therefore also $h_{[1,i^*-1]}$ have no collisions on $G_h^{i^*}$, and the last inequality follows from Equation \[eqn:T\_on\_G\].
To complete the proof of the theorem, we apply the lower bound given by Theorem \[thm:dgk\] to algorithm $A'$ and the distribution $S_{M,N}$, which gives $$\frac{2T}{k}\left(1 + \frac{S}{M}\right) \ge \tilde{\Omega}
\left(\frac{\epsilon^{3/2}N}{8k}\right),$$ and therefore $$T\left(1 + \frac{S}{M}\right) \ge \tilde{\Omega}(\epsilon^{3/2}N)$$ as required.
[^1]: Usually, the client’s secret passphrase is concatenated with a random salt to prevent dictionary attacks and reduce the risk of reusing the same passphrase on multiple servers.
|
Wednesday, June 20, 2012
"Social Media Before the Internet: Tales of Victorians, Comic Book Fans, Phone Phreaks and CBers"
From Knowledge@Wharton:
Although the current spate of social media platforms burst onto the
scene within the last several years, these tools have antecedents in
earlier, traditional media. Long before the rise of Facebook, Twitter
and MySpace, people found innovative ways to use technology to interact.
Kendall Whitehouse, Wharton's director of new media, takes a look at
how our desire to virtually connect with others is evident in media --
from the telegraph and newspapers to comic books and radio.
Social media platforms have revolutionized the way we communicate.
They have sparked democratic uprisings in the Middle East and fueled the
recent IPO of a nearly $70 billion company. Although social media's
rise has been sudden -- Facebook is a little more than eight years old
and Twitter just six -- it didn't occur in a vacuum. Before Facebook and
Twitter, before MySpace and Friendster, there were Usenet newsgroups,
AOL chat rooms and online bulletin boards.
Yet the roots of social media go even deeper. Decades before the rise
of the Internet, we can see evidence of the drive to shape both private
communications and mass media into platforms for social connection.
Several of these earlier instances -- despite being based on very
different technologies -- share many of the characteristics of modern
social media, such as using "handles" or aliases to represent identity,
adopting "in crowd" lingo, and blurring the boundaries between private
and public conversations.
Perusing the 'Personals'
In The Victorian Internet, author Tom Standage recounts the tale --
apparently gleaned from the 1849 publication Anecdotes of the Telegraph
-- of a marriage ceremony conducted over the telegraph. With the bride
in Boston and the groom in New York, telegraph operators transmitted the
couple's vows and the words of the magistrate performing the ceremony
over the wires. Thus, the world's first electronic communications
network was called into service to connect people in an intimate way.
Newspapers were the great mass medium throughout much of the 19th and
the first half of the 20th centuries. Yet, from at least the Victorian
era on, people were using the medium for interpersonal communications.
Well before Craigslist and Facebook, 19th century newspapers would run
"personals" of lovelorn Victorians seeking to connect with a
briefly-glanced stranger or to find a suitable partner for marriage.
Like current social media messages, these notes -- while often targeted
to a specific individual -- were public and available to anyone who
perused the paper (although identities were often concealed by aliases)....MORE |
State confiscates gas pump card skimmers
LANSING — State officials and others have confiscated a dozen credit card skimming devices that were hidden in gas pumps around the state.
The Michigan Department of Agriculture & Rural Development, which regulates gas pumps, said in a news release that inspectors went on a two-week, statewide blitz after hearing about an increased use of the illegal devices, which are secreted inside gas pumps and download credit card information when motorists pay at the pump. The department turned nine devices over to the U.S. Secret Service for investigation, the release said. Two other devices were removed by a local police department and one was removed by a gas station owner during the blitz, the department said.
The devices were found in Grand Ledge, Belmont, Perry, Owosso, Byron Center, Flint, Alto and Grand Rapids, MDARD spokeswoman Jennifer Holton said.
Holton it isn’t always clear how the devices get inside the pumps. She said the pumps use relatively universal keys and the news release said thieves tend to target pumps farthest away from the gas station doors.
Earlier this month, the Grand Rapids Press reported five people with ties to Miami were arrested in a gas-pump skimming scheme in the Grand Rapids area.
The devices can’t be seen from outside the pump, MDARD said. The department is working with the Michigan Petroleum Association to educate gas station owners, and the department advises motorists to use pumps that are closer to the store and to monitor their credit card activity. |
East Meadow Kiwanis President Mitchell Allen presented Debbie Coates with a plaque honoring her as the 2011-12 Kiwanian of the Year.
East Meadow Kiwanians are well aware of Debbie Coates’s selfless dedication to the organization, and the club’s president, Mitchell Allen, chose her as the 2011-12 Kiwanian of the Year.
“Kiwanian of the Year is a person who stands out as an individual who goes over and above,” said Allen. “Her passion to help others is why she clearly demonstrates the best in Kiwanis, and why I had the distinct honor in naming her the Kiwanian of the Year.”
Allen made the announcement at a Kiwanis meeting on Sept. 19. “I was totally surprised, honored and humbled,” Coates told the Herald. “Of all the good people, the dedicated people, it’s amazing that they picked me.”
“She was in shock,” said Alan Beinhacker, the 2010-11 Kiwanian of the Year. “Her face was priceless.”
In addition to assisting at local food drives and participating in Cornell Cooperative Extension cleanups, Coates helped plan two events hosted by Kiwanis this year, East Meadow Pride Day and the charity golf outing in July. “I helped make Pride Day run as smoothly as possible,” said Coates, who assisted co-chairs Beinhacker and Liz Fries as they organized the event, shopped for supplies and planned table arrangements.
“I just let her go, and everything turned out great,” said Beinhacker.
Coates and Beinhacker, who also co-chaired the golf outing with Mike Litzner, dedicate themselves to Kiwanis from April to August each year, Beinhacker said. This year, Litzner said, Coates was instrumental in securing sponsors for the golf outing, at which the organization raised more than $20,000 for the community, the most in its history. “We had more than 75 sponsors,” Beinhacker added, “and many because of Debbie.”
“She’s a dedicated, hardworking individual,” said Litzner. “When she sets her mind to something, she puts her heart and soul into it. She’s a terrific person, and I got to know her better through the golf charity.”
“I am so proud Debbie Coates was recognized as the Kiwanian of the Year …,” fellow Kiwanian Brian O’Flaherty, who has known her for 12 years, said in a statement. “Every committee or organization she joins, she is a betterment to the organization because of her class, her vast knowledge and her organizational skills. I cannot imagine her not being in our East Meadow Kiwanis.” |
ST MIRREN are continuing to explore all avenues in their search for a new boss and have now turned to Neil Warnock over their vacant managerial position suggest reports.
The highly-experienced former Queens Park Rangers and Crystal Palace boss is believed to be in the frame for the Buddies but there may be a slight snag in the deal.
He's a Greenock Morton fan.
St Mirren's rivals would take great pleasure with one of their own in charge of the enemy and even has his name imprinted in Cappielow itself.
Bryn Lennon When asked by the Herald in 2013 if he had any affinity to a Scottish team the... read more
Related news
Dundee United’s fixture crisis has deepened, with the home match against St Mirren the latest game to be postponed.
The Tangerines were due to play the runaway league leaders at Tannadice on Friday night but the match was called off this morning.
St...
Dundee United manager Csaba Laszlo has admitted their jam-packed schedule will be “tough for everyone” at the club.
The Tangerines’ fixture headache has turned into a full-blown crisis following the double postponement due to snow of home Championship...
Callum Paterson finished last season fearing he could be on the scrap heap but could end this one in the Premier League.
The Scottish international defender, out of contract at Hearts and fighting a cruciate ligament injury, was rescued when Neil...
Neil Warnock has blasted the EFL's decision to schedule Burton Albion's match against Cardiff City so soon after the international break.
The Brewers will travel to south Wales on Friday March 30, with both sides likely to have players in action for...
Neil Warnock launched an incredible tirade after Cardiff's clash with Derby was postponed, with the Bluebirds boss labelling the decision 'scandalous', 'a disgrace' and unacceptable.
Warnock's second-placed side were set to face Derby at Pride Park at...
Cardiff City manager Neil Warnock had some strong words to say about the decision to postpone his side's Championship game at Derby County yesterday.
The top-six clash - which would have given second-placed Cardiff the chance to move 10 points clear... |
Iowans will get their first look in August at the new five-year tuition increases being proposed by each of the state's public universities.
With the University of Iowa, Iowa State University and the University of Northern Iowa receiving millions of dollars less in state funding next year, the Iowa Board of Regents have asked each institution to come up with a five-year plan for addressing long-term revenue needs.
Using phrases like "everything is on the table," “we’re going to throw things against the wall and see what sticks” and “we’re going to think outside the box,” regent leaders have said they are open to abandoning status quo when it comes to tuition models.
The regents released a schedule Friday for four "public stakeholder meetings" as part of the process.
The months-long series of discussions will begin July 27 in Des Moines with a focus on the legislative and business communities. Speakers invited to attend include the governor, several executive departments, legislative leaders, the non-partisan Legislative Services Agency and the Iowa Association of Business and Industry.
Previous coverage:
The task force also is scheduled to hold meetings at the University of Northern Iowa on August 7, at Iowa State University on Aug. 9 and at the University of Iowa on Aug. 14. Those meetings will include the presentation of each university's tuition strategy, followed by a listening session.
One key policy up for review, for example, will be the longstanding practice of keeping keep base resident undergraduate tuition as close as possible at all three institutions.
Right now, ISU and UNI have the same base undergraduate tuition rate for Iowa students, and UI’s base tuition is only $30 more. The schools go on to add different mandatory fees and supplemental tuition for different programs, but the base level is fairly constant across the three very different institutions.
A consultant hired by the board, however, told the regents last month that such constancy is at odds with national trends.
Other likely strategies will include plans to bring all three public universities closer to the average of their official peer groups, in terms of tuition and fees. UI and ISU are both at the bottom of their official peer group for resident tuition levels, and each school would have to increase tuition by thousands of dollars more to reach the average of its peers.
UI and ISU also are likely to propose widening the gap between resident and out-of-state students as well as increasing the supplemental tuition levels charged to advanced students in certain majors and programs.
Student government leaders have argued that multiple years of last-minute and mid-year tuition increases are making it difficult for Iowa students and their families to prepare for the costs of higher education. But they also warn the regents and the universities against looking to out-of-state enrollment as a cash cow to make up for shrinking state resources.
All meetings of the Tuition Task Force are open to the public, and the public will be allowed to comment during the meetings at the three campuses. Each meeting will be live-streamed, with a link posted on the front page of the regents' website.
The task force is expected to report back to the regents in September. Although the universities can make recommendations, the board alone has the authority to set tuition rates.
Reach Jeff Charis-Carlson at jcharisc@press-citizen.com or 319-887-5435. Follow him on Twitter: @JeffCharis. |
In a non-source-synchronous system in which a first device and a second device communicate data and commands to each other on a communications bus, the first device may send a clock signal to the second device, but the second device may not send a clock signal to the first device. In these systems, when the first device receives a data signal from the second device, the first device may use its own clock signal to determine when to sample the data signal in order to identify the logic levels or bit values of the data signal.
The second device may generate and send the data signal based on the clock signal it receives from the first device. In that regard, each cycle of the data signal may correspond to a particular clock cycle of the clock signal sent by the first device. Accordingly, if the first device is to receive a data signal from the second device, the first device may expect to receive a given cycle of the data signal within a certain time period from the time the first device sent the corresponding clock cycle used to generate the given data signal cycle. That certain time period may be referred to as clock-to-data loop delay (or simply loop delay).
The amount of the loop delay may depend on trace length of the communications bus connecting the first device and the second device and the delay provided by the internal circuitry of the second device to receive the clock signal and generate the data signal. The amount of the loop delay may vary for different non-source synchronous systems. For example, internal circuitries of two second devices made by two different manufacturers or even two devices made by the same manufacturer may provide different amounts of delay. Additionally, loop delay may change at different points in time for a given system or a given second device due to changes in temperature or other environmental conditions.
When a second device connects to a first device for communication, it is critical that the first device identify the amount of loop delay so that it knows when to sample the received data signal. Absent such an identification may cause the first device to sample the data signal at improper times, which in turn may cause the first device to identify the wrong logic levels and associated bit sequence of the data signal.
To identify the amount of loop delay, and in turn optimal sample points at which to sample the data signal, the first and second devices may perform a tuning operation. In one example tuning scheme, the second device sends the first device data signal having a predetermined data pattern, and the first device identifies the sampling points upon recognition of the data pattern. The data pattern may be set according to a protocol, such as a secure digital (SD) protocol. In addition, the first device may utilize a timing window for recognizing the data pattern. In some configurations, the timing window may be measured in terms of unit intervals (UI), with one unit interval (1 UI) and two unit intervals (2 UI) being common timing windows, and where one unit interval may be equal to one clock period. Data signals used for tuning that arrive outside of the timing window may not be recognized by the first device. As such, one downside of performing tuning using a timing window is the occurrence of tuning errors for second devices that provide too large of a loop delay.
Current non-source-synchronous systems, such as SD systems where a host device communicates with a SD device, may communicate according to a single data rate (SDR) data transfer mode, where data is transferred on only one clock transition—either the rising edge or the falling edge. As media resolutions increase, it may be desirable for non-source synchronous systems to switch to a double data rate (DDR) data transfer mode—where data is transferred on both the rising edge and the falling edge of the clock signal—in order to increase the data rate at which data is communicated on the communications bus.
Systems other than non-source-synchronous systems that communicate using DDR may utilize a synchronous line (e.g., a strobe line) to communicate a synchronization signal from the second device to the first device along with the data signal on the data line. Common names for the synchronization signal may include Data Strobe, Enhanced Strobe and Returned Clock (RCLK). The first device may use the synchronization signal to determine when to sample the incoming data signal. However, non-source-synchronous systems, such as SD systems, do not use a synchronization signal, the communications bus connecting the first device and the second device does not include a synchronous line, and adding such a synchronous line may undesirably increase the cost for such systems.
As such, a new tuning scheme for non-source-synchronous systems that can be used for DDR data transfer and that do not depend on a timing window and/or a synchronous signal communicated on a synchronous line may be desirable. |
Media playback is unsupported on your device Media caption Hazelmary Bull: "I'm not just disappointed for ourselves, I'm disappointed in them [the judges]"
The Christian owners of a guesthouse who were ordered to pay damages for turning away a gay couple have lost their UK Supreme Court fight.
Hazelmary and Peter Bull refused to let civil partners Steven Preddy and Martyn Hall stay in a double room at Chymorvah House in Marazion in Cornwall in 2008.
The couple, who had already lost cases at Bristol County Court and the Court of Appeal, said they were "saddened".
Mr and Mrs Bull have said they regard any sex outside marriage as a "sin".
Image caption Steven Preddy (l) and Martyn Hall were turned away by the Bulls in 2008
The Bulls denied discriminating against Mr Hall and Mr Preddy, who are from Bristol.
Sixty-nine-year-old Mrs Bull and her 74-year-old husband said their decision was founded on a "religiously-informed judgment of conscience".
Five Supreme Court justices ruled against them on Wednesday after analysing the case at a hearing in London in October.
Analysis The case in the Supreme Court is only the latest by British courts in which Christians have pitted their right to behave in accordance with their religious beliefs against the right of other people not to face discrimination and lost. Defeat in court has been compounded in some cases by the remarks of senior judges, making clear that their job is no longer to enforce morality, and that religious beliefs will not be given more weight than secular values. The Bulls had argued that what they claimed was only indirect discrimination against Mr Hall and Mr Preddy was justified in law by their rights to "manifest their religion" under the European Convention on Human Rights, but the Supreme Court disagreed. It makes their case another milestone in the waning influence of Christian teaching in British society and its laws, although the exact nature of that teaching is increasingly contested as many Christians reinterpret traditional beliefs in the light of contemporary experience.
In 2011 a judge at Bristol County Court concluded that the Bulls had acted unlawfully and ordered them to pay a total of £3,600 damages.
The following year the Court of Appeal dismissed an appeal by the Bulls following a hearing in London. The couple had asked the Supreme Court to overrule the Court of Appeal.
Mrs Bull said: "We are deeply disappointed and saddened by the outcome.
"We are just ordinary Christians who believe in the importance of marriage as the union of one man and one woman.
"Our B&B is not just our business, it's our home. All we have ever tried to do is live according to our own values, under our own roof."
'Political correctness'
Lady Hale, deputy president of the Supreme Court, said: "Sexual orientation is a core component of a person's identity which requires fulfilment through relationships with others of the same orientation."
Mike Judge, from the Christian Institute, said after the hearing: "What this case shows is that the powers of political correctness have reached all the way to the top of the judicial tree, so much so that even the Supreme Court dare not say anything against gay rights."
Gay rights group Stonewall said in a statement: "We are pleased that the Supreme Court has defended the laws protecting gay customers that Stonewall fought so hard to secure.
"Some might suggest that, rather than pursuing this case, a far more Christian thing to do would be to fight the evils of poverty and disease worldwide." |
import Service, {inject as service} from '@ember/service';
import RouterService from '@ember/routing/router-service';
export default class JIPT extends Service {
@service('router')
router: RouterService;
listTranslations(translationsEntries: any, revision: any) {
const translations = translationsEntries.reduce(
(memo: any, translation: any) => {
const key = `${translation.key}@${translation.document.path}`;
memo[key] = {
text: translation.correctedText,
id: translation.id,
key,
isConflicted: translation.isConflicted,
};
return memo;
},
{}
);
const payload = {translations, revisionId: revision.id};
window.parent.postMessage(
{jipt: true, action: 'listTranslations', payload},
'*'
);
}
changeText(translationId: string, text: string) {
const payload = {
translationId,
text,
};
window.parent.postMessage({jipt: true, action: 'changeText', payload}, '*');
}
updateTranslation(translationId: string, translation: any) {
const payload = {
translationId,
...translation,
};
window.parent.postMessage(
{jipt: true, action: 'updateTranslation', payload},
'*'
);
}
redirectIfEmbedded() {
window.addEventListener('message', (payload) => {
payload.data.jipt &&
payload.data.projectId &&
this.router.transitionTo('logged-in.jipt', payload.data.projectId);
});
window.parent.postMessage({jipt: true, action: 'redirectIfEmbedded'}, '*');
}
login() {
window.parent.postMessage({jipt: true, action: 'login'}, '*');
}
loggedIn() {
window.parent.postMessage({jipt: true, action: 'loggedIn'}, '*');
}
}
declare module '@ember/service' {
interface Registry {
jipt: JIPT;
}
}
|
I had a CO2 pellet gun as a kid, and used the flat head/hollow tail slugs. It did about as much damage as my pump bb gun.
The pump type pellet guns can be severely "over pumped" to a high velocity I once nailed a nuisance skunk with a Sheridan Blue Steak single shot, instead of recommended 3-4 pumps I kept pumping until it would take no more, about 10 pumps. Mr skunk was a good size critter I hit him from about 30 feet in shoulder and he raised up off front legs and keeled over They(pump pellet guns) can develop a lot of kinetic energy
The pump type pellet guns can be severely "over pumped" to a high velocity I once nailed a nuisance skunk with a Sheridan Blue Steak single shot, instead of recommended 3-4 pumps I kept pumping until it would take no more, about 10 pumps. Mr skunk was a good size critter I hit him from about 30 feet in shoulder and he raised up off front legs and keeled over They(pump pellet guns) can develop a lot of kinetic energy
I was shot with a .22 from an illegal handgun imported from Haiti. Did enough damage to me and killed one of the dogs entering through his bottom and he bled to death as no one saw the entry wound which was small.
Could be. We'll know if the vet finds something. But the entry wound was at least 5-6" deep. Seems to be a lot of power for a pellet gun.
The wound is larger than a BB, and a BB would not have gone that deep.
A pellet gun would certainly do that kind of damage. It's much different than a BB gun. Besides, the .22 would make enough notice to be noticed by someone and the rumor mill would spread the word on who is shooting and where. I would look for someone who owns a pellet gun or rifle, most probably a rifle.
I do not believe that any animal ever deserves be subjected to the cruel and inhumane treatment some people inflict on them. The harsh reality is that people can justify just about anything they do at least to themselves. These psychopaths are all around us.
Some cat owners are a particular breed of crazy in their own right. Under the guise of allowing a cat to be a cat, these family pets are turned loose on the neighborhood and nature daily. Big cats in the wild and the domestic cat curled up snoozing on the window sill are considered "thrill killers". They of course are predators that will kill to eat but they are just as likely to kill other animals just for the thrill of the hunt, sometimes depositing these trophies at the door for their owners to find and appreciate.
Some people don't particularly like dogs. Others, don't like cats, snakes, rats whatever someone else may considered a loved pet and family member. Unlike in some countries where beloved pets are treated to spa days, professional coiffures and owners may be inclined to spends thousands of dollars on medical treatments for their much adored animal companion(s), here in the DR and elsewhere this reverence for animals in general is not shared.
Those who place a higher value on birds, frogs, lizards or other creatures in general, that are minding their own business may not view someone else's feline stalking around killing everything that moves very favorably. If you allow your pet to wander the neighborhood there is a very good chance that one day it won't come home. It is a sad commentary for sure, but just the reality. Wandering pets gets run over by vehicles, shot, poisoned and whacked with machetes. Sometimes for cause but not always.
Clearly CB's pet crossed paths with one of these callous people. Neither pellet rifles or regular rifles are legal here. We already know that doesn't stop some from possessing and using them. Whether this unfortunate animal's demise was caused by a particular type of firearm is really not all that consequential. Certainly it would be nice to know how and why for piece of mind but the takeaway here is not how or why but the fact that some psycho had the opportunity to do what they did. There will be no way to track the bullet/pellet. By talking to others CB may be successful in getting a good idea who could be responsible, but proof will be hard to come by.
Those who are inclined to harm animals tend to re-offend with increasing frequency the more they do it and get away with it. If in fact this poor cat was on the receiving end of human cruelty, the only course of action that will minimize the chances of another pet at the CB household suffering at the hands of this "neighbor" is to keep the pets at home going forward. Shooting someone's pet is pretty rare but not unheard of. The preferred method seems to be poison. Someone who shoots a cat has probably poisoned many more before advancing to direct fire. All it takes is some rat poison or a couple of over the counter pain meds mixed into a small can of food to set a trap that most wandering pets would not be able to pass by.
Sorry for your loss CB. Mark my words though, it will happen again if you allow the circumstances to repeat. Good luck CB, hope you get some closure if not outright justice. It's up to you to keep the your other pets safe.
I cannot, for the life of me, determine what 6'' represents...... so just out of curiosity, how did you determine it was a firearm/bullet wound ?
I have heard of cat "traps " back home ( not in th dr, as there doesnt seem to be that many cats ), like trip wires and air-compressed blow pipes. There again there aint many firearms back home.
Also, a co2 handgun, with good pellets ( the ultra-light weight ones ) can kill a fair sized rat. Done it a couple of times. So pretty sure a pellet rifle will nail a cat. |
Q:
Error invalid type (list) for variable
вот так функция работает
lm(mpg ~ disp, mtcars)
теперь мне надо обратиться к этим же столбцам по их номеру пишу
lm(mtcars[1]~ mtcars[3], mtcars)
выдает ошибку Error invalid type (list) for variable.
Как правильно сделать запрос?
A:
Оператор [ для класса data.frame возвращает список (list). Чтобы получить атомарный вектор, используйте оператор [[.
|
Double room, Hot Deal Rate
Single room, Standard
Single room, Fair Rate
Single room, Hot Deal Rate
Hotelinformation
3- or 4- bed rooms available
Gourmet cuisine
International cuisine
Non-smoking rooms
Parking facilities
Pets allowed
Room with shower/ bath and toilet
TV in room
WLAN connection in the room
This privately-run, 3-star hotel is located on the south-western outskirts of Nuremberg, and provides easy access to all historic attractions in the regional capital of Franconia. It is a 10-minute drive to the Nuremberg conference grounds.
The Hotel Restaurant San Remo is a stylish non-smoking restaurant, which features many Mediterranean influences.
Enjoy dining in the award-wining Italian gourmet restaurant, and have a refreshing drink in the new and exclusive Mania cocktail bar. In the summer time you can relax or have a barbecue on the Mediterranean terrace with its palms and olive trees.
The excellent public transport connections mean that you can easily get to all tourist sights in and around the historic city of Nuremberg, including the world-famous Christmas market and the citys Kaiserburg castle complex.
All rooms feature wireless internet access and guests staying at the Hotel Restaurant San Remo can park their cars for free at the hotel.
Location
Eibacher Hauptstraße 85,
90451
Nürnberg
Kundenmeinungen: FINE FOOD HOTEL San Remo Nürnberg Hafen
24 Bewertungen #79 of 126 hotels in Nuremberg
TripAdvisor® Traveler Reviews
Five stars
By far the best hotel I've stayed in , the service exemplary , great breakfast , first class Restaurant serves . And the staff friendly and excellent in every way. only 10 minutes drive to the city...
read more
Great place to stay!
I always stay here when on a busines trip, great hotel with all needed amenities and a fantastic restaurant. Train station 10 minute walk and 2 stops and your in the centre.
very clean. Nice...
read more
Friendly family run hotel
Stayed here first time to attend a trade show in Nuremburg. Francesco Perrone is the manager of this hotel and he's always cheerful, enthusiastic and cares about each guest. Hotel has easy access...
read more |
This shouldn’t surprise anyone. It’s a hadith in a collection that Muslims consider authentic:
“Abu Huraira reported Allah’s Messenger (may peace be upon him) as saying: The last hour would not come unless the Muslims will fight against the Jews and the Muslims would kill them until the Jews would hide themselves behind a stone or a tree and a stone or a tree would say: Muslim, or the servant of Allah, there is a Jew behind me; come and kill him; but the tree Gharqad would not say, for it is the tree of the Jews.” (Sahih Muslim 6985)
Muslims in Canada don’t have a different version of Islamic texts and teachings from the version Muslims have elsewhere. They have the same Qur’an, the same Sunnah. Why should anyone expect them not to teach the things these sources say?
“Toronto imam says Muslims will eventually kill all Jews,” by Jonathan D. Halevi, CIJ News, March 11, 2017:
Motion 103 “Systemic racism and religious discrimination”, which also known as the anti-Islamophobia motion, demands that “the government should recognize the need to quell the increasing public climate of hate and fear… condemn Islamophobia and all forms of systemic racism and religious discrimination and take note of House of Commons’ petition e-411 and the issues raised by it” and “develop a whole-of-government approach to reducing or eliminating systemic racism and religious discrimination including Islamophobia, in Canada.”
Petition e-411 , which was unanimously endorsed by the Parliament, suggests that attributing terrorism to Islam is Islamophobia.
Initiated by Samer Majzoub, President of the Canadian Muslim Forum (المنتدى الاسلمي الكندي) and sponsored by Liberal MP Frank Baylis (Pierrefonds—Dollard, Quebec), Petition e-411 reads among other things the following:
Recently an infinitesimally small number of extremist individuals have conducted terrorist activities while claiming to speak for the religion of Islam. Their actions have been used as a pretext for a notable rise of anti-Muslim sentiments in Canada; and these violent individuals do not reflect in any way the values or the teachings of the religion of Islam. In fact, they misrepresent the religion. We categorically reject all their activities. They in no way represent the religion, the beliefs and the desire of Muslims to co-exist in peace with all peoples of the world. We, the undersigned, Citizens and residents of Canada, call upon the House of Commons to join us in recognizing that extremist individuals do not represent the religion of Islam, and in condemning all forms of Islamophobia.”
Sheikh Abdulqani Mursal, imam at Masjid Al Hikma mosque in Toronto (36 Colville Rd, North York – Lawrence and Keele), explains that the fate of the Jews is destined to be killed by the Muslims.
In a lecture at the at Masjid Al Hikma mosque, Mursal read the chapter “Turmoil And Portents Of The Last Hour” from Sahih Muslim (hadith collection, meaning narrations attributed to Mohammad), including the following narrations (01:07-07:24 – originally in Arabic, translated by http://www.hadithcollection.com): |
extern crate rustc_demangle;
extern crate winapi;
use std::env;
use std::fs::File;
use std::io::{BufReader, BufRead};
use std::ptr;
use std::mem::{self, zeroed};
use winapi::um::dbghelp::*;
use winapi::um::winnt::*;
use winapi::um::errhandlingapi::GetLastError;
use winapi::shared::minwindef::*;
use winapi::shared::basetsd::DWORD64;
use winapi::shared::guiddef::GUID;
use std::ffi::*;
use std::os::windows::ffi::*;
use std::slice;
extern "C" {
fn SymLoadModuleExW(process: HANDLE, file: HANDLE, image_name: PCWSTR, module_name: PCWSTR, base_of_dll: DWORD64, size: DWORD, data: PMODLOAD_DATA, flags: DWORD) -> DWORD64;
fn SymUnloadModule64(process: HANDLE, base: DWORD64) -> BOOL;
fn SymSetOptions(options: DWORD) -> DWORD;
fn SymSetSearchPathW(process: HANDLE, search_path: PCWSTR) -> BOOL;
fn SymGetSearchPathW(process: HANDLE, search_path: PCWSTR, len: DWORD64) -> BOOL;
fn SymGetLineFromAddrW64(process: HANDLE, addr: DWORD64, displacement: *mut DWORD, line: *mut IMAGEHLP_LINEW64) -> BOOL;
fn SymFromNameW(process: HANDLE, name: PCWSTR, symbol: *mut SYMBOL_INFOW) -> BOOL;
}
fn main() {
let mut args = env::args();
args.next();
let binary_name = args.next().expect("Missing binary");
let report = args.next().expect("Missing report name");
let file = BufReader::new(File::open(&report).unwrap());
let mut binary = env::current_dir().unwrap();
binary.push(binary_name);
let mut lines = file.lines().skip(1);
println!("{}", lines.next().and_then(|v| v.ok()).unwrap());
println!("{}", lines.next().and_then(|v| v.ok()).unwrap());
let base_anchor = {
let line = lines.next().and_then(|v| v.ok()).unwrap();
let mut parts = line.split(' ');
parts.next();
let base = parts.next().unwrap();
let base = u64::from_str_radix(&base[2..], 16).unwrap();
base
};
let mut stack = vec![];
for line in lines
.filter_map(|v| v.ok())
.filter(|v| v.starts_with("BT: "))
{
let mut parts = line.split(' ');
parts.next();
let ip = parts.next().unwrap();
let ip = u64::from_str_radix(&ip[2..], 16).unwrap();
let sym = parts.next().unwrap();
let sym = u64::from_str_radix(&sym[2..], 16).unwrap();
stack.push((ip, sym));
}
stack.reverse();
// Now print the backtrace
unsafe {
let process = winapi::um::processthreadsapi::GetCurrentProcess();
SymSetOptions(0x10 | 0x80000000 | 0x40);
if SymInitializeW(process, ptr::null(), 0) == 0 {
panic!("Err: {:?}", GetLastError());
}
let mut path = vec![0; 1024*1024];
if SymGetSearchPathW(process, path.as_mut_ptr(), path.len() as _) == 0 {
panic!("Err: {:?}", GetLastError());
}
let path = OsString::from_wide(&path[..path.iter().position(|&v| v == 0).unwrap_or(0)]);
let mut search_path = path.to_string_lossy().into_owned();
search_path.push(';');
search_path.push_str(&env::current_dir().unwrap().to_string_lossy());
let search_path: Vec<u16> = OsStr::new(&search_path).encode_wide().chain(Some(0)).collect();
if SymSetSearchPathW(process, search_path.as_ptr()) == 0 {
panic!("Err: {:?}", GetLastError());
}
let binary_w: Vec<u16> = OsStr::new(&binary).encode_wide().chain(Some(0)).collect();
let module_base = SymLoadModuleExW(process, ptr::null_mut(), binary_w.as_ptr(), ptr::null(), 0, 0, ptr::null_mut(), 0);
if module_base == 0 {
panic!("Err: {:?}", GetLastError());
}
let diff = {
let mut buffer = vec![0; mem::size_of::<SYMBOL_INFOW>() + MAX_SYM_NAME * mem::size_of::<WCHAR>()];
let info: &mut SYMBOL_INFOW = &mut *(buffer.as_mut_ptr() as *mut _);
info.SizeOfStruct = mem::size_of::<SYMBOL_INFOW>() as u32;
info.MaxNameLen = MAX_SYM_NAME as u32;
let base_anchor_name: Vec<u16> = OsStr::new("base_anchor").encode_wide().chain(Some(0)).collect();
if SymFromNameW(process, base_anchor_name.as_ptr(), info) == 0 {
panic!("Failed to get base symbol: {}", GetLastError());
}
base_anchor - info.Address
};
for ip in stack.iter().cloned() {
let ip = ip.0;
let mut line: IMAGEHLP_LINEW64 = zeroed();
line.SizeOfStruct = mem::size_of::<IMAGEHLP_LINEW64>() as _;
let mut displacement = 0;
let (file, line_no) = if SymGetLineFromAddrW64(process, ip - diff, &mut displacement, &mut line) != 0 {
let mut len = 0;
while *line.FileName.offset(len) != 0 {
len += 1;
}
let name: &[u16] = slice::from_raw_parts(line.FileName, len as usize);
let name = OsString::from_wide(name);
(
name.to_string_lossy().into_owned(),
line.LineNumber.to_string(),
)
} else {
("??".into(), "?".into())
};
let mut buffer = vec![0; mem::size_of::<SYMBOL_INFOW>() + MAX_SYM_NAME * mem::size_of::<WCHAR>()];
let info: &mut SYMBOL_INFOW = &mut *(buffer.as_mut_ptr() as *mut _);
info.SizeOfStruct = mem::size_of::<SYMBOL_INFOW>() as u32;
info.MaxNameLen = MAX_SYM_NAME as u32;
let name = if SymFromAddrW(process, ip as DWORD64 - diff, ptr::null_mut(), info) == 0 {
"unknown".into()
} else {
let name: &[u16] = slice::from_raw_parts(info.Name.as_ptr(), info.NameLen as usize);
let name = OsString::from_wide(name);
name.to_string_lossy().into_owned()
};
println!("{}", name);
println!(" at: {}:{}", file, line_no);
println!(" ip: 0x{:x}", ip);
}
SymUnloadModule64(process, module_base);
SymCleanup(process);
}
} |
Q:
Select records in one table but not in another, when the second table is not matching on primary key
I have two tables from which I need only the results that appear in one table (list) which do not appear in the second table (cardinal). The list table's primary key is sku, and the table has a vestige id column (which is actually unused in the application at the moment). The cardinal table's primary key is id. The column which should join the tables is sku. These are the tables (relevant fields only, there are other fields that I didn't paste here):
mysql> describe list;
+-----------------+--------------+------+-----+---------+-------+
| Field | Type | Null | Key | Default | Extra |
+-----------------+--------------+------+-----+---------+-------+
| id | int(11) | NO | | NULL | |
| name | varchar(63) | YES | | NULL | |
| sku | bigint(20) | NO | PRI | 0 | |
+-----------------+--------------+------+-----+---------+-------+
mysql> describe cardinal;
+------------------+-------------+------+-----+---------+----------------+
| Field | Type | Null | Key | Default | Extra |
+------------------+-------------+------+-----+---------+----------------+
| id | int(11) | NO | PRI | NULL | auto_increment |
| sku | bigint(20) | YES | MUL | NULL | |
+------------------+-------------+------+-----+---------+----------------+
Here are the amount of records in each table:
mysql> SELECT count(*) FROM list;
+----------+
| 2677513 |
+----------+
mysql> SELECT count(*) FROM cardinal;
+----------+
| 970924 |
+----------+
Every record in the cardinal table has a valid entry for the sku column, and all of those valid entries do exist in the list table. There do exist some dupes for sku in the cardinal table.
I need all the records in the list table which do not have a corresponding entry in the cardinal table. However, all the methods that I'm trying are returning either all the records from the list table, or no records at all!
mysql> SELECT count(*) FROM list l LEFT JOIN cardinal c ON c.id=null;
+----------+
| count(*) |
+----------+
| 2677513 |
+----------+
1 row in set (0.49 sec)
mysql> SELECT count(*) FROM list l LEFT OUTER JOIN cardinal c ON l.sku=c.sku where c.id=null;
+----------+
| count(*) |
+----------+
| 0 |
+----------+
The first query obviously doesn't know to match on the sku column. But the second one looks like it should work based on other answers that I've seen online.
I expect about 1700000 - 2000000 rows to be returned. But certainly not 0 or the full table. How should I word the query? This is MySQL 5.5.33 running in Amazon RDS.
A:
MySQL, in fact, all SQL products really barf at
c.id=NULL
It causes confusion. You really mean
c.id IS NULL
You need to change it to
SELECT count(*) FROM list l LEFT OUTER JOIN cardinal c ON l.sku=c.sku where c.id is null;
Give it a Try !!!
ABOUT YOUR QUESTION
Your first query
SELECT count(*) FROM list l LEFT JOIN cardinal c ON c.id=null;
resembles a natural join where nothing matches on the cardinal table, so the count 2677513 is correct.
Your second query
SELECT count(*) FROM list l LEFT OUTER JOIN cardinal c ON l.sku=c.sku where c.id=null;
is little more explicit, but the c.id=null makes it fail, thus getting 0 as a count.
|
Q:
How does this expand out?
I'm finding myself getting back into math related stuff for the first time in a while. So please be patient with me.
How does $\frac{(n-i)(n-i+1)}{2}$ expand out to:
$\frac{n^2 - (2i - 1)n - i + i^2}{2}$
If you could show me step by step, I would really appreciate it.
Also, I apologise, but I really didn't know what to tag this with.
A:
We use the distributive property: $(a+b)c=ac+bc$ and $a(b+c)=ab+ac$.
Step by step, this gives us that
$$\frac{(n-i)(n-i+1)}{2}= \frac{n(n-i+1)-i(n-i+1)}{2}$$
$$\frac{(n-i)(n-i+1)}{2}= \frac{n^2-ni+n-ni+i^2-i}{2}$$
$$\frac{(n-i)(n-i+1)}{2}= \frac{n^2-2ni+n-i^2-i}{2}$$
Now, grouping $n-2ni = -(2i-1)n$, we get that
$$\frac{(n-i)(n-i+1)}{2}= \frac{n^2-(2i-1)n-i^2-i}{2}$$
|
Tuesday, October 13, 2009
About us
Project RENEW (Refugees Entering New Enterprises and Workforce) for refugees and political asylees living in Broward County who need to develop or improve their English language and job training skills. |
Breast cancer is the most common malignancy in women and the incidence for developing breast cancer is on the rise. One in nine American women is destined to develop breast cancer in her lifetime. The HER-2/neu (H2N) oncogene and its protein product, pl85 H2N are associated with 20-40% of breast cancers. The presence of the protein is linked with more aggressive disease, is an independent predictor of poor prognosis in subsets of patients, and may play a role in the early stages of malignant transformation. These factors led to the initiation of studies examining H2N as a potential target for immunotherapy. Little work has been done to determine whether overexpressed, oncoproteins can be developed as targets for T cell therapy. The assumption has been that individuals would be immunologically tolerant or if immunity could be generated, it would be destructive to normal tissue. Preliminary data shows that some patients with breast cancer are immune to H2N and the responses are consistent with a primed response. Additional studies show cytotoxic T lymphocytes (CTL), specific for H2N peptides can be generated from primary in vitro immunization and in initial studies, can lyse H2N expressing tumor. The identification of primed responses to the H2N protein in breast cancer patients allows us to examine changes in immunity with disease progression and remission. Methods to elicit CTL responses should provide a means to determine whether patients with breast cancer have existent CTL responses and whether that CTL can lyse tumor for eventual use in treatment. The H2N protein is an appealing target for immunotherapy. It is present in the cytosol and at the cell surface available for processing by class I and II pathways, it contains multiple epitopes appropriate for binding MHC and potentially recognizable by all patients, and it is overexpressed; therefore, T cell therapies might be effective with minimal toxicity. The current proposal means to elucidate the biology and extent of the immune response of premenopausal patients with breast cancer to H2N protein in an effort to lay the foundation for development of immunotherapies in breast cancer centering around H2N as a target tumor antigen. The specific aims of the current proposal are: (1) To examine CD4+ helper/inducer T cell responses to H2N protein in patients with H2N- positive cancers and detectable CD4+ T cell immunity to H2N:; (2) To examine CD4+ helper/inducer T cell responses to H2N protein in patients with H2N-positive cancers and no detectable CD4+ T cell immunity to H2N; (3) To examine CD4+ helper/inducer T cell responses to H2N protein in patients with H2N-negative cancers but detectable CD4+ T cell immunity to H2N; (4) To examine CD8+ cytolytic T cell responses to H2N protein identifying additional peptides capable of eliciting peptide-specific CTL, and determining if peptide-specific CTL can lyse breast cancer cells; (5) To determine whether CTL specific for H2N-positive breast cancer cells can be elicited from patients with breast cancer; and (6) To determine if H2N- specific CTL responses detectable in patients correlate with the presence of H2N-positive tumors, can lyse autologous H2N-positive tumors, and, if responses correlate with disease outcome. |
In this 3-part video interview with Tony DeMeo, Sheriff of Nye County, Nevada, he explains that he is a Constitutional Sheriff and that authority for public office holders is derived from the people.
He tells the story about how he used the Constitution as his foundation in the saga of Nye County rancher Wayne Hage’s disputes over encroachments by the federal government.
While Wayne Hage’s case centered around property rights in federally managed lands, Sheriff Tony DeMeo’s example is relevant for everyone to understand the power of local government, the importance of following the Constitution and upholding the Tenth Amendment (states’ rights and sovereignty).
Wayne Hage, the author of “Storm Over Rangelands, Private Rights in Federal Lands” owned the Pine Creek cattle ranch in Nye County. Wayne Hage wrote his book after suffering illegal cattle seizures by armed federal agents and chronicled the history of how the robber baron bankers and railroad magnates monopolized the western states over 100 years ago.
Hage wrote that the northern core financiers were aware that there are two ways to monopolize any resource, “One, get all of it for yourself that you can; two, keep anybody else from getting what you can’t.” Public Lands and National Forests were created along with restrictive regulations, using environmental protection as the excuse.
PART ONE:
The first video covers Wayne Hage’s discovery that the US Department of Forestry, an agency of the USDA, filed a claim for his water rights and later seized his cattle; the USDA Forestry Service used armed agents to accomplish the seizure. Hage believed that his cattle were confiscated so that he would be unable to show that he was using his water rights for ‘beneficial use’ in order to shut down his ranch. Water is scarce in Nevada and unless the landowner can prove he is using the water rights for ‘beneficial use’, the rights are removed.
PART TWO:
In the late 1990’s, before Sheriff DeMeo took office, the Bureau of Land Management (BLM), an agency of the Department of Interior, seized more of Hage’s cattle off of his ranch, using armed federal agents. The sheriff at that time left town on a fishing trip.
Subsequently, when Sheriff DeMeo took office in 2003, he told his deputies that illegal cattle seizures were prohibited and that any federal agents attempting to confiscate cattle would be arrested. Shortly thereafter, the BLM arrived at Hage’s ranch to perform a seizure. The Sheriff’s Deputy told the federal agents that there would be no seizure or taking of cattle, per DeMeo’s decision based on the Constitution. The Deputy was told that the BLM federal agents intended to arrest DeMeo and use armed force to take Hage’s cattle.
Sheriff DeMeo advised the federal agent that their SWAT team would be faced with Sheriff DeMeo’s SWAT team if they proceeded.
Sheriff DeMeo clearly stated that he refused any unlawful seizures on Wayne Hage’s estate. He further advised federal agents that if they could produce a lawful court order for seizing cattle, he would not take the cattle off of the land, but impound them there on Hage’s ranch. This is important because if seized cattle were to remain impounded on Hage’s ranch, then Wayne Hage could still show ‘beneficial use’ of his water rights.
PART THREE:
In 2004, the BLM wanted authority for law enforcement over the roads in the federally managed Public Lands. Sheriff DeMeo said that because they were asking for the authority, that meant that they didn’t have that law enforcement power. Nye County passed a Resolution forbidding the BLM from encroachment, protecting state sovereignty under the Tenth Amendment.
Nevada also passed a State Law in 2005 (NRS 565.125) that requires a court order from the court of competent jurisdiction and submission of the order to the Sheriff’s Office before any agency seizes animals. All cattle ranches in Nye County are independent family owned operations.
Sheriff DeMeo also explains that his deputies are empowered to refuse unlawful orders, if the orders violate the US Constitution, the Nevada State Constitution, local laws or policy.
PUBLIC LANDS:
Sheriff DeMeo said that while Nevada is more than 90% federally managed, these Public Lands are actually owned by The People and the federal government is limited in their authority under the Tenth Amendment and states’ rights.
Land ownership in Nevada is a complicated issue and the land is divided into “split estates”, or land that has both private and government interests. This means that while the private property owner holds title over his land that is Public Land (National Forests), he may or may not also own the water, mineral, grazing, oil, timber or wildlife rights on that property. Wayne Hage’s book “Storm Over Rangelands” details the history of the laws that bind the Western States to federal land management.
Public Lands are lands owned by the people of the United States under our Constitution Section 8 Clause 17:
‘To exercise exclusive Legislation in all Cases whatsoever, over such District (not exceeding ten Miles square) as may, by Cession of particular States, and the Acceptance of Congress, become the Seat of the Government of the United States, and to exercise like Authority over all Places purchased by the Consent of the Legislature of the State in which the Same shall be, for the Erection of Forts, Magazines, Arsenals, dock-Yards, and other needful Buildings;’
Sheriff DeMeo said that since the federal government has authority over 10 square miles, then the Public Lands are owned by the people for the benefit of all.
The federal government’s jurisdiction and authority in Public Lands are important for all Americans to become aware of because the federal government is expanding its control and privately owned property across America is targeted by the Wildlands Project.
CONCLUSION:
Sheriff DeMeo reported that after several disputes with the USDA’s Department of Forestry and the Department of Interior’s BLM, an understanding of jurisdiction has been accomplished to the satisfaction of his office. In fact, the federal government has since established annual meetings, the Western Sheriffs Summit, between these agencies and western area sheriffs.
Sheriff DeMeo studied the Constitution in New Jersey when he was a police officer, as it was a requirement for promotion. He said that because nearly every encounter with the public involves some aspect of respecting the Constitution, he has added additional study of the Constitution to the Nye County Sheriffs training academy curriculum that was in place before he took office.
Additionally, he has given his deputies decision making authority based on the Constitution, the Nevada State Constitution, local laws and policy. They are empowered with the right to refuse unlawful orders. Sheriff DeMeo issues Empowerment Cards to his deputies which set policy for deputies when they are in contact with the public and allows deputies to make field decisions as long as they do not violate the respective Constitutions, State Law and Policies.
Sheriff DeMeo created the Empowerment Cards for his deputies shortly after he entered office in 2003. He attended a seminar given by Alan Brunacini of the Phoenix Fire Department who was the original author; DeMeo modified the cards to apply to law enforcement for his deputies to reference in the field. Sheriff DeMeo is interested in encouraging his deputies to make decisions and to be leaders.
A Sheriff’s Forum is held each month in Nye County and Sheriff DeMeo addresses all questions and concerns from the public.
Please visit www.MorphCity.com for more articles.
Related articles |
Updated 6:03 p.m. | NORFOLK, Va. — Sen. John McCain said Wednesday that Congress shouldn't leave Washington for the mid-term election break until authorizing the use of force against ISIS.
Speaking with reporters after a campaign event for GOP Senate candidate Ed Gillespie at a VFW hall, the Arizonan dismissed the idea that the Senate is only scheduled to be in session for two weeks in September, where advancing a continuing resolution to keep the government running will highlight the agenda.
"I believe that these two weeks should be used to continue the CR, but most importantly the issue of this whole ISIS situation has to be reviewed. We have to have hearings. I know we're scheduling hearings in the Armed Services Committee, and we have to act, in my view, on the authorization of use of military force," McCain said. "And we don't have to leave after two weeks. We can stay in session. This is an international crisis. This is a direct threat to the United States of America. That's according to the intelligence people, the secretary of Defense, etc."
"We should stay in session until we work this issue out, working with the president and Congress," McCain said, with a new authorization for fighting against the terrorist group known as ISIS, ISIL and the Islamic State.
"We have got to not only stop ISIS, we have to defeat them," McCain said. "We are facing the largest, most powerful, most wealthy terrorist organization in history."
McCain said Obama needed to be prepared to launch attacks on Syrian territory, repeating calls for arming the free Syrian Army and the Kurdish population in northern Iraq.
"Most of all, the president has to lead. He is not leading, and you can't expect him to build a coalition if the only objective he has is humanitarian purposes or protecting American military. This is one of the real shameful chapters in America history," McCain said.
McCain was touted by Gillespie and his supporters at the VFW post as the next Armed Services chairman (a gavel he would claim in a GOP-led Senate).
Both McCain and Gillespie said Congress, in conjunction with the administration, should be moving to authorize the use of force against the Islamic State.
"The president, even today, seemed to go back and forth on whether or not the objective was to destroy ISIS or to make them a manageable problem," Gillespie told reporters. "I think we need to get some clarity from our commander-in-chief as to what is the objective and how do we achieve that objective, and as the senator said, will you ... play a leadership role in rallying the world."
Republican Sen. Roy Blunt of Missouri sounded a similar tone in a statement issued Wednesday afternoon.
"As we were reminded this week, ISIS is clearly prepared to perpetrate contemptible boundaries that are unacceptable to Americans — and hopefully all civilized worlds. Terrorists who behead Americans are not 'manageable.' They must be stopped, and we need President Obama to communicate a clear strategy and goals on how he plans to eliminate this threat," Blunt said.
Sen. Mark Warner, D-Va., also put out a statement saying, "I urge the Administration to come to Congress with a clear strategy and political and military options for eliminating the ISIL threat. The United States should not take any military options off the table, because stopping ISIL is in the national security and foreign policy interests of the U.S. and our European allies."
McCain is among a growing number of voices saying that the existing use of force authority is not sufficient for a protracted campaign.
"It would be very important that [Obama] work with Congress for an authorization of the use of military force. The one that we enacted after 9/11 is no longer, in many ways applicable," McCain said. |
CARLTON warmed up for an AFL season-defining month with a commanding 94-point victory over Greater Western Sydney at Etihad Stadium on Saturday.The Giants were at least competitive in much of the first, second and fourth quarters, but cannon fodder in the third, as the Blues won 22.16 (148) to 8.6 (54) to improve their win-loss record to 6-4.Once again, it was the Blues' speedy flotilla of small forwards who did most of the damage, with Jeff Garlett, (four), Chris Yarran (three), Dennis Armfield (two) and second-gamer Troy Menzel (two) combining for half of their side's tally of 22 goals.At the other end, Andrew Walker and Michael Jamison anchored a rock-solid Blues defence, while Matthew Kreuzer relished the opportunity to ruck all day in the absence of the injured Robbie Warnock.After a slow start to the Mick Malthouse era, the Blues have won six of their past seven games as they become better attuned to the requirements of their new coach."I had to find out what the playing group were equipped to do and what they enjoy because football is about enjoyment as well - and what can they achieve or tell me about the best way they play," said Malthouse."It's give and take on both sides and what we've done over the last few weeks is start to cut off bits and pieces that I had and bits and pieces that perhaps I didn't like."What's happened is we've got a game structure which meets the criteria and, so long as we don't stray from it now, we can be a good football side."But it all gets much harder in a hurry for the Blues, who face a month of tough games against Essendon, Hawthorn, Sydney and Collingwood either side of the bye.The winless Giants tackle mission impossible at home against Geelong next week, having lost each of their past four matches by margins between 83 and 135 points. Malthouse was not that impressed with his forward line, despite a return of 22 goals but lauded Walker's 34 possession game."What he brings to the side is versatility and he generally uses the ball pretty well both sides of the body," he said. Coach Kevin Sheedy felt GWS should have been much closer than 22 points at quarter-time on Saturday had Stephen Coniglio not butchered a golden opportunity, allowing Lachie Henderson to score at the other end as the siren sounded.His young side struggled most in the third term when they were outscored 6.4 to three points."We're going to get inconsistent performances at times," said Sheedy."I thought we played well in a lot of different patches in the game, but to sustain it for 100 to 120 minutes has been very awkward."I've got to not like it, but to cope with it".GWS were best served by co-captain Callan Ward and fellow onballers Toby Greene and Dylan Shiel.With former Port Adelaide premiership ruckman Dean Brogan (back) a late withdrawal, the Giants featured one of their most-inexperienced line-ups, averaging just 28 games per player.Carlton had an even more-important late absentee, with dual Brownlow medallist Chris Judd pulling out with a sore hamstring.6.4 12.6 18.12 22.16 (148)3.0 6.2 6.5 8.6 (54)Garlett 4, Waite 3, Yarran 3, Armfield 2, Menzel 2, Henderson 2, Armfield 2, Gibbs, Curnow, Casboult, KreuzerCameron 2, Coniglio 2, Hampton, Whitfield, Palmer, WardWalker, Garlett, Yarran, Kreuzer, Gibbs, ArmfieldWard, Whitfield, Adams, GreeneChris Judd (hamstring) replaced in the selected side by Troy MenzelO'hAilpin (knee)Michael Jamison replaced by Tom Bell at three-quarter timeSetanta O'hAilpin replaced by Jacob Townsend at half timeNilMcBurney, Burgess, Pannell25,008 at Etihad Stadium |
Q:
JDBC Re-read Data In ResultSet
I am retrieving a simple ResultSet from my SQL Server database using the Microsoft JDBC Driver (mssqlserver.jar). I think it is the MSSQL2000 Driver which is downloaded from [Microsoft JDBC][1]
I am wanting to call the getter methods more than once to access the values but when you do the following exception is thrown:
java.sql.SQLException: [Microsoft][SQLServer 2000 Driver for JDBC]ResultSet can not re-read row data for column 1.
Question is, I am retrieving data into a ResultSet. From the ResultSet, I am accessing the data in my code before passing the ResultSet on to elsewhere in code to be reused.
Code is similar to as follows:
// build query string
String selectQuery = "SELECT * FROM SomeWhere";
// get the data
Statement statement = sourceConnection.createStatement();
ResultSet rs = statement.executeQuery(selectQuery);
while( rs.next() ) {
// do my own internal processing
doSomethingWithRs(rs);
// now do something with the record set outside - in subclass
afterRowCopied(rs);
}
// ...
private void doSomethingWithRs(ResultSet rs) {
// access data
for( int i = 1; i <= rs.getMetaData().getColumnCount(); i++) {
Object o = rs.getObject(i);
// do something with o...
}
}
Edit
I am using Java 1.6 for this.
end Edit
Any thoughts?
All I can think of doing is repackaging the data with the ResultSetMetaData into a custom class.
Not really found too much posts on this issue. Microsoft website not any help at all.
A:
This seems to be by design, according to "ResultSet Can Not Re-Read Row Data"' Error When Reading Data from a JDBC ResultSet Object:
This error occurs with ResultSet objects that contain a BLOB column (for example, text, ntext, or image data types). The driver cannot return a BLOB column out of order because it does not cache all the content of BLOB data types because of size limitations.
For any row in the ResultSet, you can read any column from left to right, and each column should be read only one time. If you try to read columns out of order, or if you re-read a column from the ResultSet, you may receive the error message that the "Symptoms" section describes.
This behavior is by design.
You either need to use a different JDBC driver, or refactor your code to only read those BLOB columns once for any given row. This a good idea anyway, since re-reading BLOBs can be a performance killer.
|
rf.StandaloneDashboard(function(db){
var chart = new ChartComponent();
chart.setDimensions (4, 4);
chart.setYAxis("Sales", {
numberPrefix: "$ ",
numberHumanize: true
});
chart.setCaption("Car sales and quantity");
chart.setLabels (["Jan", "Feb", "Mar"]);
chart.addSeries ("sales", "Sales", [1355340, 2214134, 1854313], {
numberPrefix: '$',
seriesDisplayType: 'column'
});
chart.addSeries ("quantity", "Quantity", [14, 19, 17], {
seriesDisplayType: 'column',
});
db.addComponent (chart);
});
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2011 New Dream Network
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef CEPH_SYSTEM_TEST_H
#define CEPH_SYSTEM_TEST_H
#include <pthread.h>
#include <stdio.h>
#include <string>
#include <vector>
#include "common/Preforker.h"
#define RETURN1_IF_NOT_VAL(expected, expr) \
do {\
int _rinv_ret = expr;\
if (_rinv_ret != expected) {\
printf("%s: file %s, line %d: expected %d, got %d\n",\
get_id_str(), __FILE__, __LINE__, expected, _rinv_ret);\
return 1; \
}\
} while(0);
#define RETURN1_IF_NONZERO(expr) \
RETURN1_IF_NOT_VAL(0, expr)
extern void* systest_runnable_pthread_helper(void *arg);
std::string get_temp_pool_name(const char* prefix);
/* Represents a single test thread / process.
*
* Inherit from this class and implement the test body in run().
*/
class SysTestRunnable
{
public:
static const int ID_STR_SZ = 196;
SysTestRunnable(int argc, const char **argv);
virtual ~SysTestRunnable();
/* Returns 0 on success; error code otherwise. */
virtual int run() = 0;
/* Return a string identifying the runnable. */
const char* get_id_str(void) const;
/* Start the Runnable */
int start();
/* Wait until the Runnable is finished. Returns an error string on failure. */
std::string join();
/* Starts a bunch of SystemTestRunnables and waits until they're done.
*
* Returns an error string on failure. */
static std::string run_until_finished(std::vector < SysTestRunnable * >&
runnables);
protected:
int m_argc;
const char **m_argv;
private:
explicit SysTestRunnable(const SysTestRunnable &rhs);
SysTestRunnable& operator=(const SysTestRunnable &rhs);
void update_id_str(bool started);
void set_argv(int argc, const char **argv);
friend void* systest_runnable_pthread_helper(void *arg);
Preforker preforker;
const char **m_argv_orig;
bool m_started;
int m_id;
pthread_t m_pthread;
char m_id_str[ID_STR_SZ];
};
#endif
|
Q:
How to change the background color in Wordpress
I would like to change the background color for the text area. I am using Minamaze theme.
Tried changing the background of textarea, but it didn't help.. Tried clearing the cache as well
Need some guidance..
The website is quantgreeks.com, I want to change the white background behind the text.
A:
In your style sheet find:
#content {
clear:both;
margin:0;
padding:20px 10px;
}
and add a background color to it. For example:
#content {
background-color:#000000;
clear:both;
margin:0;
padding:20px 10px;
}
|
Pacific Community Association Building
Pacific Community Association Building, also known as Pacific Community YMCA and The 'Y', is a historic community center located at Columbia, South Carolina. The original section was built in 1903, and is a large two-story, irregularly-shaped brick building. It was enlarged around 1918 with the addition of the pool building, and a large gymnasium in 1923. It provided recreational opportunities for residents of mill villages associated with the Olympia and Granby Mill complex.
It was added to the National Register of Historic Places in 2007.
References
Category:Event venues on the National Register of Historic Places in South Carolina
Category:Buildings and structures completed in 1903
Category:Buildings and structures in Columbia, South Carolina
Category:National Register of Historic Places in Columbia, South Carolina |
North Melbourne has appointed Ben Amarfio as its new chief executive officer.
Club chairman, Ben Buckley, said Amarfio’s experience at the highest levels of international sports, media and marketing made him a standout candidate.
"2019 was a period of significant change for our club, and now we look to the future with great optimism and excitement with Ben Amarfio at the helm," Buckley said.
“We firmly believe Ben’s expertise and business acumen will help take our club forward in leaps and bounds.
"Under our new leadership structure, which also includes Rhyce Shaw and Brady Rawlings, we have a renewed focus and energy driving us into the future.
“Ben has held positions at some of the highest profile and most dynamic, global sporting organisations in the world and will be a tremendous asset to us."
Amarfio has worked as Executive General Manager - Broadcasting, Digital Media & Commercial at Cricket Australia and was the General Manager of Southern Cross Austereo for more than five years. He previously held a role at the AFL as Broadcasting and Digital Media Manager.
“Ben is a commercially-focused leader that brings with him a wealth of knowledge and experience,” Buckley added.
“We look forward to working with him over the journey, and returning this great club to where it belongs at the top of the ladder.”
Amarfio joins a new-look North Melbourne, with Senior Coach, Rhyce Shaw, and Director of Football, Brady Rawlings, also about to embark on their first seasons at the helm at Arden St.
“The future is incredibly exciting and we’re really looking to build on the momentum we gathered in the second half of the season under Rhyce,” Buckley said.
“We have a committed, driven and hungry organisation that wants nothing but success on and off the field.”
Amarfio says he is looking forward to building on the significant gains the club has made in recent years.
“I’m truly honoured to be joining such an amazing organisation,” Amarfio said.
“North Melbourne is one of the proudest clubs in the AFL, with a rich history of more than 150 years. I’m thrilled to be a part of the next exciting chapter.
“I am very optimistic about the opportunities ahead and am looking forward to building relationships and working with a great group of people to achieve success on and off the field.
"I can’t wait to begin delivering results for our members and supporters, and working with all our partners and stakeholders to ensure we continue to grow and thrive together.
“With Rhyce Shaw and Brady Rawlings leading a new coaching panel and a terrific group of talented players, we are well placed for on-field success.
"2019 was an encouraging year for Scott Gowans, Emma Kearney and our AFLW team, and we will be aiming for the ultimate success again.
“The Board, previous CEO Carl Dilena, executive team and administration have done a mighty job and we are perfectly placed to grow even further.”
Amarfio will begin at Arden St on November 19 and will be available to the media on and after that date. |
We will use this icon to mark check points.
A check point is a way for you to check how you are doing.
For most of the steps in this tutorial we will
provide the code as it should look after the task. It is tempting, we
know, but please, please, do not go for the “copy&paste” way.
We will use this icon to challenge you
with additional code-related tasks so you can go further at your own
pace. No inline answer will be provide for those challenges but we will
give you some guidelines and tips. By the way, within the instructions
we will use an italic font to refer to variables and pieces of code.
We will use this icon to ask you some questions related to the task your are working on.
Additional info and resources - this is not essential to complete the tutorial, but very interesting.
Tips that might help you on this task.
If you are following this tutorial as part of a workshop, do not hesitate to
raise your hand and share any questions or comments you may have.
If you are doing it by your own, you still can raise your hand in our
mailing list, just join our Google Group.
This is a list of common scenarios you might face - may this list be with you.
You need to add the “xhr” module in the exposed section of the snippet configuration.
Instead of “xhr”, you could also use jQuery.load, or d3.csv etc.
Consider you structured your files like the following:
|- data
| - dataset.tsv
|- examples
| - simple.js
In this example dataPath would be ../data/dataset.tsv (or /data/dataset.tsv).
You need to create the data folder yourself, but the naming is up to you. |
You may know a lot about the world’s most expensive swimming pools. But, did you know that nearly one million visitors visit the iconic Hearst Castle every year. They keep the Neptune Pool as the centerpiece of their attraction in the vast estate overlooking miles of California coastline. And they pay a fabulous amount of money per dip into this blue glory featured with a terrace carrying statues of Mr. Neptune and the Nereid’s.
What is so infatuating about this topcellently expensive swimming pool?
Why is it still one of the most photographed pools in the world?
Let’s explore the answers ahead by scouring the wow features that keep drawing Hollywood stars, journalists, and other celebrities dating back from ’30s to till date.
Every product is independently reviewed and selected by our editors. If you buy something through our links, we may earn an affiliate commission.
What does tempt some visitors to pretend an unwilling fall into this blue water ballroom?
Certainly, there are much more than the charming hilltop setting, sunlight dangling on the surface of the pool water, fog drifting over the oil-burning heated H2O, and the brightest sunset mirrored in that spectacular watercourse.
A bit away, the indoor Roman pool will surely not fail to amuse and amaze you with Roman bath surrounding tiled from floor to ceiling and stars dispersing across its domed ceiling. Visitors kept refreshed in this indoor swimming so long the Neptune pool was under a prolonged renovation project.
They are the jewels in all the gems of Hearst Castle that will seize your attention at the arrival.
Exclusive Features of Neptune Pool
Neptune Pool
The magnificent features that are responsible for its enduring public craze include:
Mind-blowing Setting: A massive swimming pool at the hilltop is itself a spectacular scene. The Neptune pool lies to the north and a bit below the main rest house Casa Grande. When you are standing on the terrace of this outdoor swimming pool, you can enjoy the panoramic view of the Hearst family ranch, Point San Simeon coast, and the Pacific.
The pool sits edging the boundary walls of the Hearst Castle on Santa Lucia Mountain.
Neptune Terrace
Neptune Terrace: This is a terrace featured with marble tiles. To further the appeal, the terrace is given an ancient heroic touch by installing the statue of Neptune on it. It is a public knowledge that Mr. Hearst was very fond of classics tapestries and antiques.
It feels like receiving a guard from the deities standing on the bank while you are afloat over the blue water. The colonnades and other statues standing on the terrace wear marble tiles to add to the shimmering effect of the scene.
Ornamental Pools: Several ornamental or reflect pools surround the basin of the Neptune pool. They are less deep – 3.3 ft- but certainly add to the ecstasy of the scene. The ornamental pools too have marble tile floor and sides.
Marble Pavilions: Marble pavilions are just in line with the overall view of the pool. Matching the basin tiles, they contribute to strengthening the oceanic and aerial blue look of the artificial aquatic paradise.
Sculptures: Other than the title sculpture of Neptune the pool is named after, there are two Nereid statues on the terrace to accompany Mr. Neptune. They further the romantic atmosphere of the watercourse.
Sculptures of Neptune
Venus will emerge from under the water in a conch shell swaying in the arms of mermen.
Isn’t it a scene to be amused with or get lost in?
Ancient Roman Temple Façade: At one end of the primary axis of the pool stands the Roman temple frontage accessorizing the pool with the feel of eye-catching and mind-elevating antiquity. This imported Roman temple façade stretches to the primary axis. Mr. Hearst bought it from Italy and installed here anew and refurbished.
Temple Façade at Neptune
Tiled Basins and Gutter: Numerous blue marble tiles lying in the pool bed are the reason the pool water looks that glorious blue. And they are as huge as close to 20000 in numbers.
On top of all those mentioned, alabaster lanterns, gorgeously designed dressing rooms, and raised alcove are the attractions that multiply the appeal of the pool casting a magic spell over millions of beauty lovers and holidaymakers since its public inception in 1958.
Measurements: The Neptune Pool shares varied dimensions – overall width of 58 feet and a far stretched 95 feet of width at the alcove. The outdoor Hearst Castle pool runs 104 feet long and this length is known to be the second axis. It features 3.3 feet depth at the shallow west end not meant for swimming and 10 feet at the basin fairly deep enough for you to forget all anxiety and bring back the high school enthusiasm.
Water Source: Natural water coming from the Santa Lucia Mountain spring is the pool and fountain liquid source. The large volume of 345,000 gallons of water flows through piping.
There is an oil-burning heating system to keep the water temperature normal but not warm. Actually, no water in the Hearst Castle is warm.
Grand Fusion of Art and Nature: Imported antiques mostly from Europe and Greco-roman architectural style have found a superb blend with the coastal California landscape. This is the real appeal people get drawn to the Neptune Pool for. Many say that a dip in this outdoor swimming pool is a dive in ancient history.
Stars and Celebrities in the Neptune Pool
As suggested in the introduction, Hollywood stars, world-famous journalists, and Olympic champions frequented in Hearst castle even before it was open for public after the death W R Hearst. Big names among the Hollywood stars include Clark Gable, Carry Grant, Charles Chaplin, Carole Lombard, Greta Garbo, and very close personal friend of Mr. Hearst -Marion Davies.
There went a saying then in Hollywood that there were Hollywood stars that really swam in the pools in the Hearst castle and there were some who said they had been there. Such was the craze and it is not the least declined these days. This blue water paradise with marble mosaic floor, shapely nymphs, pageboy hairdo mermaids, and voluptuous Venus rising from a conch shell muscle-bound by mermen cast magnetic pool upon a few more celebrities.
Douglas Fairbanks Jr., “Tarzan” star and 1920 Olympic gold medalist for swimming Johnny Weissmuller, and none the less than David Niven visited and spent time in this grand liquid ballroom. Weissmuller showed off the famous strokes he is known for while dipping in this blue glory.
In 2014, the famous Lady Gaga donated a fabulous sum of amount to shoot her U.G.I music video. She had the famous pool filled to the brim when it was drained for being under a 4-year long restoration initiative. Not to surprise, the Neptune pool found it featured in the famous film Spartacus in the Kubrick version while adorning the entrance of the set of Crassus Villa.
How much and when to take a dive in the pool?
If you want to spend a day like William Randolph Hearst, you just need to get prepared with a little extra amount in the bank. A dive in that water paradise with the ancient flavor of history cost you $60, 000 in the past. This came along the dinner of 10 in one of the guest houses atop the hill.
There was a pre-sale offer in the reopening on 21 August 2018 a swim at $1100 for the members by 31 August. And after October 1 the tickets will be available at $1300 for members and $1300 for non-members.
Swimming chance in this pool had a Grecian style bed and royal statuary along with grand colonnades on the pool deck is occasional. You cannot dip into this regal aquatic glory every time you visit Hearst Castle. It comes as a rare opportunity when the landmark needs renovations and preservation. Then the concerned authority offers tickets to win by bidding in an auction.
Surprisingly, no decline in the visitors during the renovation of Neptune Pool.
The central attraction of Hearst Castle estate The Neptune Pool- remained closed for the visitors as it was under a 4-year long restoration project until the final reopening in August 2018. The restoration was due to the fact that the pool suffered from a 5000-gallon leakage a day and drainage caused by drought in California then.
That caused replacing nearly 20000 of its Vermont marble tiles lying in the pool bed. Not to affect the original flavor, the tiles came from the original Vermont stone quarry.
Did the number of visitors decline during the revamp of the outdoor pool?
Not the least……
They found an equal alternative in the magnificent indoor pool – The Roman Pool. This indoor pool takes to the interior features of the ancient Roman baths – especially Baths of Caracalla, Rome(211-17CE) & Mausoleum of Galla Placida, Ravenna, Italy. This is also a testimony to Hearst’s deep passion for ancient classical age.
This indoor pool features mosaic marble tiles and a surrounding created by eight statues of Roman gods, goddesses, and the then heroes. The grandeur is further strengthened by the theme of the marine monster in line with the then Roman tradition. One of the statue copies – Apoxyomenos- sharply reminds us of the Baths of Caracalla for its frequent use there.
Shifting the gaze to upwards from the surrounding of the pool, you will find a doomed roof welcoming you with colored glass tiles having stars across the ceiling. The night blue of the mosaic tiles from the floor to the roof accentuated with gold infusion inside the smalti is just fair enough to drive you breathless. This will surely make you not miss the outdoor pool.
This indoor pool complex offers the swimmers an exercise room, handball court, sweat baths, and the gorgeous dressing rooms. This pool alone is 1665 sq.ft to hold 205000 gallons of water. Further detail of the Roman Pool will leave you mesmerized.
Why the Pools in Hearst Castle win over others?
You are entitled to enjoy an ecstatic vacation once in Hearst Castle even when free of pool water. It is bliss to spend a day or even more by exploring the majestic stay rooms, massive garden, walkways, the environs, and above all the Hearst Ranch Winery at San Simeon.
This lavishly designed private residence of the then media mogul has several guest houses offering multiple rooms and spacious lobbies.
The key mansion Casa Grande entertains the guests with its 115 rooms among which 38 are luxury bedrooms. Other few rooms include the Refectory, the Theatre, Gothic Study, Library, the Billiard Room, and Beauty Salon. Casa Grande is an antique feast packed with Italian and Spanish pieces of art and architecture.
Other than sticking your toe or the whole body in the pool water, you can enjoy idyllic beauty of the vast property that has earned the Santa Lucia Mountain the fond tag of The Enchanted Hill.
So intense is the architectural appeal of Hearst Castle is that this world-class monument and mausoleum is inspiring architects, engineers, sculptors, artist, and dreamers of every successive generation.
Therefore, besides a merry splash-about and extra-ordinary thrill and chill through bathing in the pools, the Castle as a whole can be the super-celebratory occasion-maker.
Really Interested? Cool… Here’s how to get there?
You have learned by now that the most expensive and the exclusive pools are inside the iconic Hearst Castle now managed by California State Park. To get to the pools amounts to reach the castle.
It lies halfway between Los Angeles and San Francisco making a drive here very easy. You can reach to the Hearst castle in plenty of ways but the best would be to start along the scenic coastline of California.
You will keep max eight hours for the trip to Hearst castle either from San Francisco or California not to be late by any means.
The Neptune Pool in Hearst Castle is America’s most well-known outdoor swimming pool. Going by the detail of its design, features, and build-up, I must say this is one of the most exclusive and obviously most expensive swimming pools in the world. Celebrities from all walks of life who swam in this pool considered this as a rare chance – come once-in-a-life.
To intensify your aquatic thrill, Hearst castle offers another majestic swimming opportunity a bit away in the Roman Pool. This indoor pool too falls no short of the outdoor pool by any consideration.
To our utter amazement, these pools were the first and final bigger aquarium set up by Julia Morgan. And it is time-tested proof that she had been really great in her big assignment. So, what’s your plan to have a dive here? |
Q:
is there any LINQ expression to convert a Datatable to a Dictionary
I have a number of cases where i do a query and get a datatable and convert it to either a:
Dictionary<string, string>
or
Dictionary<int, int>
or
Dictionary<string, [Someobject]>
i could create my own function with a loop but i wanted to see if there was any LINQ way of converting a datatable into a dictionary and just passing 2 lambdas for the key and value (similar like you can do with converting IEnumerable to dictionary
A:
You can use AsEnumerable & ToDictionary:
For example, if you want a dictionary where keys are from col1 and values from col2:
table.AsEnumerable()
.ToDictionary<int, string>(row => row.Field<int>(col1),
row => row.Field<string>(col2));
A:
Linq comes with a ToDictionary extension method that sounds like what you're describing.
Edit
As far as using ToDictionary with a DataTable: I don't see why not.
DataTable dt = GetMyDataTable();
return dt.Rows.Cast<DataRow>().ToDictionary(r => r["KeyColumn"], r => r["ValueColumn"]);
You need the cast in there because DataTable.Rows is just IEnumerable, rather than IEnumerable<DataRow>.
|
Q:
Equal command in T-SQL written twice - works once, doesn't the second time
This is my T-SQL code:
;with tmpFolderPermissions(fp_folder, DataItem, fp_modify) as
(
select
fp_folder, LEFT(fp_modify, CHARINDEX(',',fp_modify+',')-1),
STUFF(fp_modify, 1, CHARINDEX(',',fp_modify+','), '')
from dbo.tblFolderPermissions
union all
select
fp_folder, CAST (LEFT(fp_modify, CHARINDEX(',', fp_modify+',') -1) AS VARCHAR(200)),
STUFF(fp_modify, 1, CHARINDEX(',',fp_modify+','), '')
from tmpFolderPermissions
where fp_modify > ''
)
select fp_folder, DataItem
from tmpFolderPermissions
And it works fine, as a result I get a table with about 200 rows. However, if above that whole code I add the same command as above:
select fp_folder, DataItem
from tmpFolderPermissions
so basically, if I write this twice in a row, the first command shows me 200 results, which is good, but the second gives me this error:
Invalid object name 'tmpFolderPermissions'.
Why does it give me an error, when it executed a milisecond ago?
A:
tmpFolderPermissions is a CTE. And CTE's cannot be reused in multiple querys as it is part of the query itself. So the second time you call it, it doesn't exists.
Use a temp table or view instead.
Quote from link:
A common table expression (CTE) can be thought of as a temporary result set that is defined within the execution scope of a single SELECT, INSERT, UPDATE, DELETE, or CREATE VIEW statement. A CTE is similar to a derived table in that it is not stored as an object and lasts only for the duration of the query.
|
While the Goats toiled for years, craft beer still wasn’t taking off in Australia. A small handful of breweries had sprung up, but the market was still underdeveloped by most modern standards and not showing many signs of life. Bonighton recalls doubts creeping in around 2006-2007. He was starting a family, and the brewery had been chipping away for a decade. Nevertheless, he says “there was never any thought of throwing it in.”
Then, in 2009, they launched Steam Ale. The market was finally catching up. For Mountain Goat, this was the beer that things turned around. Inspired by German Dampf and American Steam beers, Steam Ale was their own take on the style. Vibrant, fruity, and drinkable, it’s the beer Bonighton says “changed the business overnight.”
These days, Steam Ale makes up 40% of all of Mountain Goat sales. Followed by their Summer Ale, a canned beer Bonighton calls a “version” of the Steam Ale, just a bit drier and slightly hoppier.
Meanwhile, their American-styled Pale Ale, simply called Pale Ale, which was relaunched in 2015, is catching up. It replaced their IPA, which was a style that never worked for them in packaged form despite trying two versions over the years.
“The first iteration of the IPA was organic—it was probably a dumb beer style to produce organically,” Bonighton says. “You need lots of hops and not many people are growing organic hops. It was the wrong choice of beer.” |
What is that website – whatweb
Whatweb is a next generation information scanner. Its name speaks “what is that website”. According to ethical hacking expert of international institute of cyber security this tool can be used in identifying all sort of information about the site. This tool is developed by Andrew Horton aka urbanadenturer and Brendan Coles.
Whatweb can fetch information like: Platform on which the site has build, type of script on which site the script is used, google analytics, ip address, country. Web server platform and a lot more. Whatweb uses both active and passive scanning. Active scanning extracts deeper with various types of technologies but passive scanning simply extracts data from http headers.
For launching whatweb go to linux terminal and type whatweb as shown below:
Type whatweb hackthssite.org.
After executing the above query whatweb has fetched data like IP address, country, cookies, type of script. The above query shows the summary of all HTTP headers, detected plugins, Ip address, type of query. The above command can be used in initial phase of information gathering.
USING AN DOMAIN NAME:
Type whatweb -v hackthissite.org
-v = verbose scans the website in deeper so that more information can be used in analysing the website.
==========OUTPUT SNIP=============
============OUTPUT SNIP=============
After running the verbose scan, the query has shown some details of the target like strings and plugin description.
After scanning using verbose whatweb -v hackthissite.org, the above screen shot shows status & title – 301 moved permanently which means target resource has assigned a new URL. It also shows the IP address and country of the actual domain is situated.
In summary section it shows the list of installed plugins on website.
In the above target it shows the javascript is used in code scripting attacks. Getting the type of cookies used in php development phase can be taken in information gathering part.
An alternative option if you know the IP address rather than domain name.
USING AN IP ADDRESS:
Type whatweb -v 1.1.1.1
-v – shows verbose output
====================OUTPUT SNIP==================
After executing using an IP address, whatweb strings like – server strings, country in which the server is situated. After running in verbose scan, the query has shown some of the in depth details of the target like strings and plugin description. |
News | Forum | People | FAQ | Links | Search | Register | Log in
The Lost Tomb Released! Hey all -
I posted this over in Screenshots & Betas but was told by Mr. dumptruck that I should do a News post to make it legit. My first map (The Lost Tomb) after being away for 20 years is ready to go. I've posted it to Quaketastic:
http://www.quaketastic.com/files/single_player/maps/losttomb.zip
Here are a handful of shots:
http://www.quaketastic.com/files/single_player/LostTomb_01.png
http://www.quaketastic.com/files/single_player/LostTomb_02.png
http://www.quaketastic.com/files/single_player/LostTomb_03.png
http://www.quaketastic.com/files/single_player/LostTomb_04.png
http://www.quaketastic.com/files/single_player/LostTomb_05.png
http://www.quaketastic.com/files/single_player/LostTomb_06.png
http://www.quaketastic.com/files/single_player/LostTomb_07.png
http://www.quaketastic.com/files/single_player/LostTomb_08.png
http://www.quaketastic.com/files/single_player/LostTomb_09.png
Hope you dig it!
-zq
Here's a demo for ya Welcome back to Quake! Fun vanilla feeling to the map. Looking forward to see you make more :)Here's a demo for ya https://www.dropbox.com/s/wcns5qsq2opfrf3/losttomb_yoder1.zip?dl=1
http://www.quaketastic.com/files/demos/losttomb_nol1.zip
Also if you are gonna release beta maps i recommend you that you give them a temporal name like "losttomb_b1" or something like that to have things more organized. Nice first(after 20 years) map. Here is another demo.Also if you are gonna release beta maps i recommend you that you give them a temporal name like "losttomb_b1" or something like that to have things more organized. Thanks! Thanks! Thanks Mclogenog! I'll download and check it out!
Thanks Nolcoz (and thanks again for helping playtest). I'll check out this demo as well. Yep, that totally makes sense to have temp names for playtests. I'll do that moving forward. Thanks dude. Whoa, That's A Lot Of Secrets! Whoa, That's A Lot Of Secrets! Nice map, although it has an old-school feel I saw some nice original designs. Got stuck on some geometry in the first room by the water, but it's not a deal breaker. Nice work! This Is A Good This Is A Good I didn't record a demo but I did a playthrough and thoroughly enjoyed myself!
Could maybe used a bit more texture variation but overall this is a SOLID and fun map which plays like classic ID but with more secrets (and some which are fairly fleshed out too.)
Thanks for releasing this! :) :) Thanks a bunch, maiden and Drew! Naturally, I've seen a couple of small issues since release but oh well! Things to think about next time, I guess! :D Thanks! Thanks! Tight mapping and a great classic feeling, I liked it very much! Cool Map Cool Map I like classic-feeling maps, and this one delivered. But beyond that, the vibe was cool, too; it was fun to explore this sunken tomb, and the little details (the flooded, multi-storey catacombs, the broken walls) made it feel like a lived-in place.
I'm curious, though, you said that this was your first map in 20 years? I searched ZQ on Quaddicted and the Quake Injector, but I didn't find anything else under that name. What are your older maps? Cool map, with fun secrets, fair but challenging encounters, and large water areas that's fun to go through.
Lots of obvious inspirations, but tastefully assembled with cohesion and novelty.
It would look much better with lit water, though. Proper First Map. Proper First Map.
Gameplay in the first part here: Just how it should be. Sensible size, sensible theme, sensible build quality. Not too big, not too over-ambitious, not too weird. A nice spin on it with all the coffins and some ruined bits, and steady gameplay with a fun ending. Secrets were nice and involving too. Things to improve would be having more of your own architectural style, a bit more tactical gameplay, and some stronger contrast in the lighting.Gameplay in the first part here: https://www.twitch.tv/videos/420905140 Thanks Y'all! Thanks Y'all! Appreciate the playthroughs and the feedback! Great stream as well, Shambler! :)
Renunciant - I never posted any of my maps publicly because I didn't have confidence in them (and they really weren't good), so anything I did back in the day are all lost to time. That's okay, I didn't know what the hell I was doing back then and I only marginally know today. :) Nice Map Nice Map Short but very enjoyable. I really like the classic feel especially based around E1M2 since that's one of my favourite vanilla maps. Found 4/8 secrets on first playthrough. This was a real treat to play. Highly recommend this one. :) :) Thanks all! Mucho appreciated. It's been tons of fun getting back into this.
Not sure why it's not showing up on Quaddicted yet. I sent it off to Spirit and he said that it was uploaded but looks like it hasn't populated to the page yet. Does it tend to take a few days before it goes live? Good Stuff Good Stuff Well, seems I haven't posted in years! Nor have I played Quake much in years until very recently, so it's nice to have some new maps like this to try out.
I was bummed when I went to normal/skill 1 and there were no more monsters than on easy.
With the amount of ammo + all the secrets, you could easily add more monsters with the higher difficulty levels to add more of a challenge and it would still be pretty fair.
That's my only real criticism of this.
A solid classic style map, well done! Good feedback! Yeah, I didn't do anything with difficulty. It was more about learning Trenchbroom and getting re-acclimated to the engine. I'll look at that for the next map! Neat map, here's my playthrough with comments . I pretty much agree that it's the ideal "first map". Looking forward to more from you! nice and sweet First Map? First Map?
Playthrough (with Polish commentary):
https://youtu.be/iTNByO3r6Ro For a first map, this is really well done. I loved it overall, very classic feel to it. Took me too long to finish it, though. I'm slow like that.Playthrough (with Polish commentary): 1 post not shown on this page because it was spam You must be logged in to post in this thread. Website copyright © 2002-2020 John Fitzgibbons . All posts are copyright their respective authors. |
Recipe for Sesame Milk and Sesame Smoothie
Mix in blender for 1 or 2 minutes. With a VitaMix - only 1 minute.
For a smoothie, use 8 oz sesame milk, 4 tbsps. whey protein and 1 tsp maca powder
All recipes are listed in good faith and Nuts.com fully respects
copyright protection and private property of original recipe authors.
If a recipe is listed against an author's wishes, please contact us and we
will remove the recipe immediately.
Sign up for our newsletter
Receive limited, email-only offers!
First name (we like to say hi!):
(We hate junk mail and spam just like you and will never give your email address to anyone. You can unsubscribe at any time.) |
"I think that anything that makes it more difficult to get information is unfortunate," Bloomberg responded, when asked if the denial of access to his predecessor's records would make things harder for historians. "But some of these documents are documents that the mayor has a right to have, and I am sympathetic if he would prefer that you didn't look at them." |
Towards mobile gaze-directed beamforming: a novel neuro-technology for hearing loss.
Contemporary hearing aids are markedlylimited in their most important role: improving speech perception in dynamic "cocktail party" environments with multiple, competing talkers. Here we describe an open-source, mobile assistive hearing platform entitled "Cochlearity" which uses eye gaze to guide an acoustic beamformer, so a listener will hear best wherever they look. Cochlearity runs on Android and its eight-channel microphone array can be worn comfortably on the head, e.g. mounted on eyeglasses. In this preliminary report, we examine the efficacy of both a static (delay-and-sum) and an adaptive (MVDR) beamformer in the task of separating an "attended" voice from an "unattended" voice in a two-talker scenario. We show that the different beamformers have the potential to complement each other to improve target speech SNR (signal to noise ratio), across the range of speech power, with tolerably low latency. |
How to take care of you ice makers?
Buying an ice maker has become an important part. So, we all want to buy a perfecticemaker. For this you can search on the internet for the best ice makers, along with the features they actually provide, the specialities, and their pricing variations. Then after comparing all the different varieties and types of ice makers, you can choose the one that is the most suitable one. But buying an ice maker is not the only task. Searching for the perefcticemaker is not at all enough. You need to take a lot of care of the ice maker that you wish to buy in order to maintain their durability.
Whenever we buy a product from the market, we usually ask for its caring and up keeping. Similar is the case with the ice makers. You need to take care of them after buying them. They will undoubtedly lose their durability or life if we don’t care properly for them. So, it is very important that you must know all the steps and caring terms for making them durable. Proper cleaning facilities should be implemented in order to retain their durability. You’ll have to clean the ice maker daily and for that you might be given some cleaner specific for the purpose of cleaning ice makers. You must use that cleaner in order to clean the ice makers. Checking of seals for your ice makers on the monthly basis is another important task that needs not to be avoided. The outside covering or the outer covering of your ice maker must be cleaned with wet cloth smoothly. Don’t try to rub the cloth harshly on the ice makers.
So, caring of ice makers is an equally important task like buying them according to your needs and requirements. You can check different ice makers like sonic ice makers. |
February 24, 2016
Speaker:Dr. Nataliya Portman, Faculty of Science, UOIT
Title: The Art and Power of Data-Driven Modeling: Statistical and Machine Learning ApproachesAbstract: Ever-increasing volumes of data and computing power nowadays have led to the rise of machine learning, pattern recognition and data visualization methods. An idea of learning a mapping between predictor and outcome variables hidden in a high-dimensional training dataset has found applications in a variety of fields - image processing, medical imaging, bioinformatics, financial risk management, materials science to name a few. While machine learning seems to be put on a pedestal in data analysis (thanks to artificial intelligence enthusiasts), statistical learning still remains prevalent in certain areas such as clinical applications and epidemiology, for example. The choice of either statistical or machine learning approach depends on the example (training) dataset used. In this talk, I will discuss the differences between the two frameworks and illustrate their use on the assortment of problems drawn from my research experience in computational neuroscience and chemometrics. I will then give an overview of machine learning methods applied to the development of density functionals and materials property prediction based on data from quantum mechanical computations. |
The chase began about 7:30 p.m. on the westbound state Route 52, approaching state Route 125 in Santee when officers tried to pull the driver of a Nissan Rogue SUV over for speeding, according to Officer M. Bailey with the CHP’s San Diego Office.
The pursuit traveled north for nearly three hours before the driver stopped the SUV in the middle lanes of Interstate 5 near Magic Mountain Parkway in Santa Clarita.
Throughout the chase, the driver used her turn signals when changing lanes.
KCAL9 reported the driver may not have been the registered owner of the SUV.
— City News Service
>> Subscribe to Times of San Diego’s free daily email newsletter! Click here |
George Forrester (footballer, born 1934)
George Hogg Forrester (28 August 1934 – 13 April 2001) was a Scottish footballer who played as a full back. He played for Accrington Stanley from 1960 until they dropped out of the Football League in 1962, and also played in the Scottish Football League for Brechin City and Dundee United. He played for non-League club Eyemouth United when they reached the quarter-finals of the Scottish Cup in 1959-60, and also helped Altrincham reach the third round of the FA Cup for the first time.
Playing career
George Forrester was born in Edinburgh on 28 August 1934. He was a youth player with Raith Rovers before joining Sunderland in 1953, where he failed to make a first-team appearance. He was given a free transfer in May 1954. He returned to Raith Rovers and then joined Dundee, but again didn't appear for either club's first team. After receiving a free transfer from Dundee, he had a brief spell with Brechin City between September and November 1957, playing in one league match. Forrester then signed for Dundee United in February 1958, where he made nine league appearances before leaving the club in September 1958.
Forrester later joined Eyemouth United in the East of Scotland League. He was a member of the Eyemouth team that reached the quarter-finals of the Scottish Cup in 1959-60, the only club from the East of Scotland League ever to do so, before losing to eventual finalists Kilmarnock. The Cup run attracted the attention of Accrington Stanley, who signed Forrester in February 1960 for around £1000. He was a regular member of the Accrington team, making 87 appearances up until they resigned from the Football League in March 1962 due to financial problems.
After leaving Accrington, Forrester ended the 1961-62 season with Sankeys of Wellington in the Cheshire County League. He went on to spend three years with the club. In 1965 he joined Altrincham, where he was made captain. In his only season at Altrincham, the club won the Cheshire County League title, were runners-up in the Cheshire County League Cup and reached the third round of the FA Cup for the first time in the club's history, eventually losing to Wolverhampton Wanderers. Despite these successes, Forrester was allowed to leave at the end of the 1965-66 season and subsequently joined another Cheshire County League team, Macclesfield Town. After winning the County League title in 1968, Macclesfield played the 1968-69 season in the new Northern Premier League, becoming its first champions. Forrester retired in 1969, having also won the Cheshire County Cup in his final season.
After football
After retiring Forrester maintained his connection with Macclesfield, running the Moss Rose Hotel adjacent to the club's Moss Rose ground. He died in 2001 in his native Edinburgh.
References
External links
Category:1934 births
Category:Footballers from Edinburgh
Category:2001 deaths
Category:Scottish footballers
Category:Scottish Football League players
Category:English Football League players
Category:Sunderland A.F.C. players
Category:Raith Rovers F.C. players
Category:Brechin City F.C. players
Category:Dundee United F.C. players
Category:Eyemouth United F.C. players
Category:Accrington Stanley F.C. (1891) players
Category:Altrincham F.C. players
Category:Macclesfield Town F.C. players
Category:GKN Sankey F.C. players
Category:Dundee F.C. players
Category:Association football fullbacks |
Q:
TextBoxFor value not updating after post
I have a simple strongly typed view, but I cant seem to update a textbox on my form after a post.
Here is my model:
public class Repair
{
public string Number { get; set; }
}
And in my view is a TextBox:
@Html.TextBoxFor(x => x.Number)
I'm trying to update the textbox after a post to my controller:
[AcceptVerbs(HttpVerbs.Post)]
public ActionResult Index(Repair r)
{
r.Number = "New Value";
return View(r);
}
Even though I'm setting Number to a new value, the text in the textbox does not change. What am I doing wrong?
A:
Use ModelState.Clear() before setting value
[AcceptVerbs(HttpVerbs.Post)]
public ActionResult Index(Repair r)
{
ModelState.Clear(); //Added here
r.Number = "New Value";
return View(r);
}
A:
When you post a model back to an ActionResult and return the same View, the values for the model objects are contained in the ModelState. The ModelState is what contains information about valid/invalid fields as well as the actual POSTed values. If you want to update a model value, you can do one of two things:
ModelState.Clear()
or
ModelState["Number"].Value = new ValueProviderResult("New Value", "New Value", CultureInfo.CurrentCulture)
A:
From my dealings with the issue, I feel that this is by design bug in the framework. IMO:
@Html.TextBoxFor(x => x.Number)
should NOT be taking the value from ModelState but rather directly from the model. At least this would be my expectation when I alter the model and return View(model).
ModelState.Clear()
is not an answer because it sanitizes ModelState erasing ValidationSummary. Removing a key from ModelState is neither good because it removes ValidationSummary for that key.
ModelState["Number"].Value =
new ValueProviderResult("New Value", "New Value", CultureInfo.CurrentCulture)
is correct but just too arcane. Thus, in such cases, my preference would be to use:
<input type="text" name="Number" id="Number" value="@Model.Number"/>
instead of
@Html.TextBoxFor(x => x.Number)
|
Symposium: Neuroergonomics, technology, and cognition.
This symposium describes collaborative research on neuroergonomics, technology, and cognition being conducted at George Mason University and the US Air Force Research Laboratory (AFRL) as part of the Center of Excellence in Neuroergonomics, Technology, and Cognition (CENTEC). Six presentations describe the latest developments in neuroergonomics research conducted by CENTEC scientists. The individual papers cover studies of: (1) adaptive learning systems; (2) neurobehavioral synchronicity during team performance; (3) genetics and individual differences in decision making; (4) vigilance and mindlessness; (5) interruptions and multi-tasking; and (6) development of a simulation capability that integrates measures across these domains and levels of analysis. |
Q:
How to get my search box to pull id too?
I have a search box in my excel worksheet which searches for users and displays all the matches so if I have 5 x John Smiths it shows them. I would like it so that it also displays their ID code.
Can anyone advise how to do this? See the image and code below I have so far. The code below is for the selected box in the image F7
=INDEX($C$3:$C$17,SMALL(IF(ISNUMBER((SEARCH($F$3,$C$3:$C$17))*(SEARCH($H$3,$B$3:$B$17))),ROW($B$3:$B$17)-MIN(ROW($B$3:$B$17))+1,""),ROW(A1)))
A:
Use the same formula but change the index:
For First Name write in F7:
=IFERROR(INDEX($C$3:$C$21,SMALL(IF(ISNUMBER((SEARCH($F$3,$C$3:$C$21))*(SEARCH($H$3,$B$3:$B$21))),ROW($B$3:$B$21)-MIN(ROW($B$3:$B$21))+1,""),ROW(A1))),"")
For Last Name in G7 use:
=IFERROR(INDEX($B$3:$B$21,SMALL(IF(ISNUMBER((SEARCH($F$3,$C$3:$C$21))*(SEARCH($H$3,$B$3:$B$21))),ROW($B$3:$B$21)-MIN(ROW($B$3:$B$21))+1,""),ROW(A1))),"")
For ID in H7 use:
=IFERROR(INDEX($D$3:$D$21,SMALL(IF(ISNUMBER((SEARCH($F$3,$C$3:$C$21))*(SEARCH($H$3,$B$3:$B$21))),ROW($B$3:$B$21)-MIN(ROW($B$3:$B$21))+1,""),ROW(A1))),"")
I used C3:C21 because I added duplicated names to test the formula, Change all references to correspond your Data.
B3:B21 is Last Name Data
C3:C21 is First Name Data
D3:D21 is Id Data
Keep $ for fixed references and for each formula press at the same time Ctrl+Shift+ Enter array formula and you can drag it down the column (each formula in its column do not mix it)
It is the same formula but the Index references change to correspond the column Header
|
-179*j**3 + 6*j**2 - 6*j - 51. Let p(d) = 6*o(d) + q(d). Differentiate p(u) with respect to u.
-537*u**2
What is the second derivative of -111*v - 64*v**2 + 191*v**2 - 76*v**2 - 362*v - 68*v**2 wrt v?
-34
Let g(v) be the third derivative of v**6/120 - 97*v**5/30 + 99*v**4/8 + 41*v**2 + 2. What is the second derivative of g(a) wrt a?
6*a - 388
Let i(p) be the third derivative of -2*p**9/63 + 11*p**5/15 + 131*p**2. Find the third derivative of i(a) wrt a.
-1920*a**3
Let r(m) be the first derivative of 149*m**4/4 + 34*m**3 + 111. What is the third derivative of r(c) wrt c?
894
Let q(x) = x**2 - 8*x + 9. Let v be q(8). Let u be -1 + -1 + -1 + v. What is the third derivative of -11*d**3 - 7*d**2 + 13*d - u*d - 7*d wrt d?
-66
Suppose 4*o + 16 = -2*a, a = -4*o - 19 + 1. Suppose a*v = -v + 6. What is the first derivative of v - 8*y + 4 - 3 - 2*y wrt y?
-10
Find the second derivative of -512 + 1037 - 193*d - 525 + 275*d**2 wrt d.
550
Let y = -1800 - -1804. Let j(u) be the first derivative of 11/4*u**y + 0*u**2 + 0*u**3 + 1 - 4*u. What is the first derivative of j(z) wrt z?
33*z**2
Let u(c) = -42*c**2 - 3*c + 5. Let r(t) = -41*t**2 - 4*t + 6. Let a be 4 - (1 + 1) - -3. Let p(b) = a*r(b) - 6*u(b). Find the second derivative of p(g) wrt g.
94
Let c be 1*20*1/4. Let l be (10/(-4))/c*-6. What is the derivative of -l*q - 1 - 3*q + 3*q - 2*q wrt q?
-5
Let h(l) be the third derivative of -l**7/210 - l**6/24 - 6*l**5/5 + 2*l**2 - 22. What is the third derivative of h(x) wrt x?
-24*x - 30
Let n(d) be the second derivative of 0*d**4 + 25*d + 0 + 0*d**2 - 3*d**3 + 7/20*d**5. What is the second derivative of n(h) wrt h?
42*h
Let j(y) = -640*y**4 + 2*y**3 - 3*y + 140. Let x(t) = -1280*t**4 + 5*t**3 - 7*t + 278. Let p(l) = 5*j(l) - 2*x(l). Differentiate p(d) wrt d.
-2560*d**3 - 1
Let r(u) be the second derivative of -u**6/40 + 19*u**3/6 + 7*u**2 + 8*u. Let a(k) be the first derivative of r(k). What is the first derivative of a(f) wrt f?
-9*f**2
What is the third derivative of 14*b + 279*b**6 - 372*b**6 - 3*b**2 + 6*b**2 wrt b?
-11160*b**3
Let p be (0/(-3) - -1) + 26. Let m be p/6*4/9. Find the first derivative of -m*g + 7*g - 3 - 6*g wrt g.
-1
Let l(p) be the first derivative of 17*p**4/4 + 41*p**2/2 + 12. What is the second derivative of l(y) wrt y?
102*y
Let u = 3 + -3. Suppose 3*p + p - 12 = u. What is the first derivative of -2 + 38*v**p - 32*v**3 + 3 wrt v?
18*v**2
Let o(s) be the first derivative of -3 + 17/2*s**2 + 7/4*s**4 + 0*s**3 + 0*s. What is the second derivative of o(f) wrt f?
42*f
Suppose -4 = -2*l + 2*a, -4 = -3*l + 4*a + a. Find the second derivative of -d - 2*d**l + 5*d - 7*d**3 wrt d.
-54*d
Let r(i) be the first derivative of -i**7/105 - i**6/360 + 16*i**3/3 - 10. Let q(n) be the third derivative of r(n). What is the third derivative of q(y) wrt y?
-48
Let z = -2267 + 2281. Let i(h) be the third derivative of 0 + 1/4*h**4 + 0*h + z*h**2 + 0*h**3 + 1/15*h**5. Find the second derivative of i(b) wrt b.
8
Let b(o) be the second derivative of 131*o**5/5 + 123*o**4/4 + 280*o. What is the third derivative of b(h) wrt h?
3144
Let u(n) be the first derivative of -641*n**4/4 - 237*n + 641. Differentiate u(k) with respect to k.
-1923*k**2
Let b(f) be the first derivative of -29 + 0*f**2 + 13/3*f**3 - 29*f. Differentiate b(j) wrt j.
26*j
Let q(i) = 542*i**4 + 2*i**3 + 2*i**2 + 4*i + 27. Let a(g) = -g**4 + g**3 + g**2 + 2*g. Let f(v) = 2*a(v) - q(v). Find the first derivative of f(d) wrt d.
-2176*d**3
Suppose -3*p = -3*k + 3, 4 = 5*p - 11. Find the second derivative of 7*g - 3*g - 14*g + k*g**4 wrt g.
48*g**2
Let k(n) be the second derivative of -5*n**8/8 - n**5/4 + 19*n**4/4 - 3*n - 33. What is the third derivative of k(j) wrt j?
-4200*j**3 - 30
Let f(h) = h + 1. Let c be f(1). Let n(t) = 7*t**3 - t + 2. Let k(i) = 29*i**3 - 4*i + 9. Let l(p) = c*k(p) - 9*n(p). Find the second derivative of l(r) wrt r.
-30*r
Let r(z) = 5*z + 4. Let u = 10 - -36. Let f be (-5 - u)/((-3)/2). Let n(k) = -29*k - 23. Let p(j) = f*r(j) + 6*n(j). What is the first derivative of p(b) wrt b?
-4
Let v(x) be the third derivative of -31*x**7/35 + 13*x**5/15 + 256*x**2. What is the third derivative of v(b) wrt b?
-4464*b
Let l be -1 - 7 - (2 + -3). Let q(c) = 33*c**3 - 8. Let y(g) = 22*g**3 - 5. Let p(w) = l*y(w) + 5*q(w). Find the first derivative of p(x) wrt x.
33*x**2
Let o(l) be the second derivative of 46*l**7/21 - l**3/3 + 2*l**2 - 33*l - 2. Find the second derivative of o(d) wrt d.
1840*d**3
Let i be (5 + -8)/(-8 + 7). Let v(j) be the second derivative of 7/6*j**i + j**2 + 0 - 12*j. What is the first derivative of v(z) wrt z?
7
Let g(n) be the first derivative of 7*n**4/8 + 7*n**3/6 - 7*n**2 + 1. Let h(j) be the second derivative of g(j). Differentiate h(w) with respect to w.
21
Let u(i) be the second derivative of -11/42*i**7 - 48*i - 5/4*i**4 + 0*i**2 + 0*i**3 + 0*i**6 + 0*i**5 + 0. Find the third derivative of u(c) wrt c.
-660*c**2
Let a(v) be the first derivative of -28*v**3 + 78*v - 38. Find the first derivative of a(z) wrt z.
-168*z
Let l(a) = 7*a**2 + 10*a + 4. Let p(q) = -8*q**2 - 11*q - 3. Let w = -2 - -6. Let n(o) = w*p(o) + 3*l(o). Find the second derivative of n(y) wrt y.
-22
Suppose -6 = 3*k, 0 = 4*g - 4*k + 2*k - 12. Find the second derivative of -4*d**g + 9*d**2 + 8*d + 0*d**2 wrt d.
10
Let i(r) be the first derivative of 2*r**6/3 - 13*r**4/4 - 5*r**3/3 + 7*r**2/2 - 514. What is the third derivative of i(p) wrt p?
240*p**2 - 78
Find the third derivative of 258*t**5 + 77*t - 78*t + 2 - 2 - 57*t**2 wrt t.
15480*t**2
Suppose 2*c - 4*c = 4*j - 24, -2*j = -4*c + 8. Suppose -s = -j - 1. What is the third derivative of 12 + 6*o**2 - 12 - 3*o**5 - 5*o**s wrt o?
-480*o**2
Let l = 55 + -49. What is the third derivative of -13*w**6 + 59*w**l + 19*w**2 - 28*w**6 wrt w?
2160*w**3
Find the second derivative of 17*p**4 + 134*p + 47*p**4 - 105*p**4 wrt p.
-492*p**2
Let n(i) = -8*i + 2. Suppose -d = 2*d - 6. Let x(z) = d + 2 - 6*z - 10*z - z. Let a(k) = -5*n(k) + 2*x(k). Find the first derivative of a(l) wrt l.
6
Suppose -60*q + 59*q = -7. Suppose 2*v - b - 5 = 0, v + 5 = 5*b - 6. What is the third derivative of -3*s**6 + q*s**2 + 4*s**5 + 2*s**2 - v*s**5 wrt s?
-360*s**3
Let y(j) be the second derivative of -159*j**8/8 + 5*j**4/12 - 49*j**2/2 + 82*j - 3. Find the third derivative of y(h) wrt h.
-133560*h**3
Suppose 4*x - 10*x + 36 = 0. What is the third derivative of -4*o**x + o**2 + 17*o**6 - 6*o**6 - 3*o**6 wrt o?
480*o**3
Differentiate 179 + 274 - 44*r**4 + 39*r**4 - 56 - 189*r**4 wrt r.
-776*r**3
Let p be ((-9)/(-6) + -2)*0. Let d = p + 1. Differentiate 2*s**2 + d - 3*s**2 + 3*s**2 wrt s.
4*s
Let o be ((-1)/2)/((7 + -5)/(-64)). What is the third derivative of -20*a**2 + o*a**6 - 5*a**2 + a**5 - a**5 wrt a?
1920*a**3
Find the third derivative of -4*w - 2*w - 4*w**2 + 801*w**4 - 799*w**4 + 12*w**6 wrt w.
1440*w**3 + 48*w
Let m = 72 - 59. Differentiate -3 + 8 + 4 - m*r**3 + 4 wrt r.
-39*r**2
Let j(p) be the first derivative of p**8/48 + p**4/3 + p**2/2 + 12. Let w(y) be the second derivative of j(y). What is the second derivative of w(g) wrt g?
140*g**3
Suppose 0 = -8*u + 3 + 13. Let d(m) = -m**3 + m**2 + 4. Let k be d(0). What is the third derivative of k*a**2 - 4*a + 4*a**6 + 6*a - u*a wrt a?
480*a**3
Let r(x) = -1290*x**3 - 16*x**2 - 370*x. Let g(p) = 258*p**3 + 3*p**2 + 73*p. Let d(v) = -16*g(v) - 3*r(v). Find the second derivative of d(q) wrt q.
-1548*q
Find the second derivative of -2288 - 12*g**4 + g - 2290 + 4428 wrt g.
-144*g**2
Suppose -2 = z + 5*p - 0, p = -z + 10. Suppose -2 = a - z. What is the third derivative of k**2 - 2 + a*k**5 + 2 - 8*k**5 wrt k?
180*k**2
Suppose 5*i + g = -4*g, i - 12 = 3*g. Let a = -18 - -21. What is the second derivative of j**a + 3*j**i + j - 5*j - j wrt j?
24*j
Let n(y) = -y**3 - 7*y**2 + 20*y + 22. Let s be n(-9). Find the second derivative of -o + 6*o - 105*o**s + 95*o**4 wrt o.
-120*o**2
Let c(u) be the first derivative of 5 + 0*u**3 + 2*u - 5/2*u**2 - 5/12*u**4. Let m(t) be the first derivative of c(t). Find the first derivative of m(i) wrt i.
-10*i
Let j(y) be the second derivative of y**5/20 - 3*y**4/4 + y**2/2 - y. Let i be j(9). Differentiate 0*s - 2 + 2*s + i - 3 wrt s.
2
Let s(z) be the first derivative of 0*z**2 - 10/3*z**3 - |
Quinone-induced Cdc25A inhibition causes ERK-dependent connexin phosphorylation.
Gap junctional intercellular communication (GJC) varies during progression of the cell cycle. We propose here that Cdc25A, a dual specificity phosphatase crucial for cell cycle progression, is linked to connexin (Cx) phosphorylation and the modulation of GJC. Inhibition of Cdc25 phosphatases in rat liver epithelial cells employing a 1,4-naphthoquinone-based inhibitor, NSC95397, induced cell cycle arrest, tyrosine phosphorylation of the epidermal growth factor receptor (EGFR), and activation of extracellular signal-regulated kinases ERK-1 and -2. ERK activation was blocked by specific inhibitors of MAPK/ERK kinases 1/2 or of the EGFR tyrosine kinase. An EGFR-dephosphorylation assay suggested that Cdc25A interacts with the EGFR, with inhibition by NSC95397 resulting in activation of the receptor. As a consequence of ERK activation, Cx43 was phosphorylated, resulting in a downregulation of GJC. Loss of GJC was prevented by inhibition of ERK activation. In summary, cell cycle and GJC are connected via Cdc25A and the EGFR-ERK pathway. |
Review of the effectiveness of capsaicin for painful cutaneous disorders and neural dysfunction.
Topical capsaicin is known to be a safe and effective pain management adjunct for rheumatoid arthritis, osteoarthritis, neuralgias, and diabetic neuropathy. However, studies and case reports in the literature have indicated that other conditions may also benefit from capsaicin: painful or itching cutaneous disorders from operations, injuries, or tumors; neural dysfunction; or inflammation of the airways and urinary tract. To determine the effectiveness of capsaicin for painful cutaneous disorders and neural dysfunction, the authors analyzed data from 33 reports (MEDLINE search of 1966-96) on the efficacy of capsaicin. Outcome measures consisted of the response rate and degree of pain relief. Results from placebo-controlled trials were pooled when possible; effect of treatment was estimated by the method of DerSimonian and Laird. Pain relief for postmastectomy syndrome and cluster headache was greater with capsaicin than with placebo; also, psoriasis and pruritus responded better to capsaicin. Uncontrolled studies and case reports have indicated that pain or dysfunction was less at the end of capsaicin therapy for neck pain, loin pain/hematuria syndrome, oral mucositis, rhinopathy, reflex sympathetic dystrophy syndrome, detrusor hyperreflexia, and cutaneous pain due to tumor of the skin. Capsaicin is effective for psoriasis, pruritus, and cluster headache; it is often helpful for the itching and pain of postmastectomy pain syndrome, oral mucositis, cutaneous allergy, loin pain/hematuria syndrome, neck pain, amputation stump pain, and skin tumor; and it may be beneficial for neural dysfunction (detrusor hyperreflexia, reflex sympathetic dystrophy, and rhinopathy). A universal problem for many of the studies analyzed was the absence of a "burning placebo" such as camphor. |
Who will join Frank Lampard's Blues? Get our daily Chelsea newsletter Sign me up Thank you for subscribing We have more newsletters Show me See our privacy notice Invalid Email
(Image: Scott Heavey)
Demba Ba is a target for Anzhi Makhachkala as Jose Mourinho continues his Chelsea clear-out.
Midfielder Jon Obi Mikel is poised for a move to Galatasaray, and attacking midfielder Marko Marin has already gone on loan to Sevilla.
Striker Ba, 28, could soon follow the pair out of the Stamford Bridge club - just six months after being bought from Newcastle.
Anzhi are ready to move in with a lucrative contract offer after the 28-year-old rejected the chance to go to West Brom and former club West Ham.
West Brom have gone for ex-Chelsea hitman Nicolas Anelka instead, while Hammers are hoping to take another Stamford Bridge striker, Romelu Lukaku, on loan once the Blues bring in another high-profile goal-getter.
Germany forward Andre Schurrle has already arrived from Bayer Leverkusen, and the Europa League winners are also chasing Napoli's Edinson Cavani, with Robert Lewandowski of Borussia Dortmund as their plan B and a blockbuster move for Manchester United's Wayne Rooney not out of the question.
Which all leaves Ba, who scored six times in 22 Chelsea appearances in all competitions last season to add to the 13 he managed for Newcastle, looking like a spare part at the Bridge.
Anzhi have already moved quickly to take defender Christopher Samba back to Russia following the centre-back's unhappy spell at QPR.
Now they are set to swoop again for the former Newcastle and West Ham striker. |
INTRODUCTION
============
Beliefs and attitudes about cancer are closely associated with the ways that persons behave when confronted with cancer and related issues.[@B1] Individuals who have negative attitudes towards cancer or believe that a cancer diagnosis is predetermined and invariably fatal are less likely to engage in preventive health behaviors,[@B2][@B3] present with cancer-related symptoms in early stage of the disease,[@B4][@B5] participate in cancer screenings,[@B6][@B7] and receive treatment[@B5][@B8] than those with positive attitudes.
More importantly, various demographic and socioeconomic factors can modify or interact with beliefs and influence health-related behaviors. Evidence from multiple studies suggests that positive and negative attitudes toward cancer vary by age, gender, education, income level, and ethnicity or cultural group.[@B3][@B9][@B10] In particular, fatalistic or negative attitudes about cancer have been found to be more prevalent in low socioeconomic and ethnic minority groups.[@B4][@B5][@B10][@B11] The combination of unemployment, less education, and social frustration were more likely to reinforce the fatalistic belief that certain life events are beyond one\'s control. Research findings also suggest that the negative attitudes among these groups might have led to avoidable delays in being diagnosed with cancer, and ultimately, worsened their survival outcomes.[@B10][@B12][@B13] Poor knowledge, perceived barriers to treatment, and low self-efficacy are presumed to mediate these associations.
Korea has experienced rapid industrialization and economic growth in recent decades. The country\'s fast-paced development has triggered advancements in medical technology and caused widespread changes in lifestyles and patterns of disease occurrence in a short period. However, it simultaneously has brought about a widening socioeconomic gap at the national level. Studies have reported that income inequality in Korea is linked to disparities in cancer-related behavioral risk factors, stage of the disease at diagnosis, and screening and mortality rates.[@B14][@B15][@B16] Likewise, in Korea, general attitudes towards cancer may vary by socioeconomic status (SES), although there are few reports on this issue.[@B17]
An individual\'s attitudes towards health risks usually reflect the psychological and cultural aspects of the community that he/she belongs to, as well as factors at the individual level.[@B18] To acquire a better understanding of cancer-related health behaviors in the general population and to guide the development and implementation of public education programs, it is critical to know how people across different socioeconomic groups and demographic characteristics perceive cancer. This exploratory study examined differences in general beliefs and attitudes towards cancer among Koreans who did not have a firsthand experience of cancer and compared the implications of the study\'s findings to those of western populations.
METHODS
=======
Study population
----------------
A cross-sectional survey was conducted in May 2017 that used a proportional quota random sampling design parameterized by gender, age, and geographic area, to select a representative sample of non-institutionalized Koreans who had no immediate experience of cancer for themselves or their family members. Initially, the samples were stratified by age and sex in each 17-administrative district (the cities and provinces) based on the 2016 census of Korea, then the sample size was obtained using a probability proportional to size (PPS) method. Of the randomly selected 1,460 responders who were consecutively telephoned, 460 responders were excluded from the interview because of absence and refusal to participate for several reasons, or because the responder was a cancer patient or had a family member with cancer. Finally, a total of 1,000 participants were interviewed (response rate: 68.5%), and the survey was conducted by face-to-face interview by Metrix Corporation (Seoul, Korea) by professional interviewers during May 2017. The Interview process was carefully reviewed and monitored by the researchers. Again, as our focus was on attitudes toward cancer of the general population, individuals diagnosed with cancer and those with immediate family members diagnosed with cancer were not recruited.
Variables and measures
----------------------
The study variables were categorized as follows: age (20--29, 30--39, 40--49, 50--59, and 60 years and older), level of education (below high school, high school graduate, and college graduate or above), average monthly individual income (\< 1.5, 1.5 to less than 3.0, 3.0 to less than 5.0, and ≥ 5.0 million KRW/month), region (metropolitan city including the capital city or province), economic activity (yes or no), marital status (single, married, or divorced/separated/widowed), and the presence of an underlying chronic disease other than cancer (yes or no).
General beliefs about cancer were assessed using the awareness and beliefs about cancer (ABC) measure as the cross-sectional questionnaire.[@B12][@B19] The original ABC was developed for use with populations at least 50 years of age, regardless of whether they had ever had the experience of being diagnosed with cancer themselves or had a family member who was diagnosed. Although the present study targeted adults aged 20--79 years, the ABC was used because it has been found to be a valid and reliable measure of cancer awareness and beliefs with international samples. The present study used 6 items from the ABC measuring "general cancer belief," and the validity and reliability of the 6 items was not expected to be significantly different among participants in the younger age group (aged 20--49 years) because similar items have been examined for younger groups in previous studies.[@B10][@B17][@B20]
Following minor revisions to enhance their clarity, the 6 statements describing cancer beliefs were presented to the participants in Korean in the same order as in the ABC: 1) These days, many people with cancer can expect to continue with normal activities and responsibilities; 2) Most cancer treatment is worse than the cancer itself; 3) I would NOT want to know if I have cancer; 4) Cancer can often be cured; 5) Going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving; and 6) A cancer diagnosis is a death sentence. The Cronbach\'s alpha values for the positive and negative statements were 0.59 and 0.30 in the present data, respectively.
As previously described, items 1, 4, and 5 were positively framed and items 2, 3, and 6 were negatively framed statements.[@B12] Participants responded by choosing one of 5 categories: strongly disagree, disagree, agree, strongly agree or don\'t know. Their responses were dichotomized into agree (strongly agree and agree) and disagree (strongly disagree, disagree, and don\'t know) to avoid inflating the agreement proportion.
Data analysis
-------------
The categorical variables (gender, age, education, average monthly income, region, existence of an underlying chronic disease, and marital and employment status) are expressed as frequencies or percentages. Pearson\'s correlations were calculated to determine the strength of the correlations between the independent variables. For the multivariate logistic regression, gender, age, education, average monthly income, region, and marital and employment status were included to assess each independent effect. All statistical analyses were performed using SAS version 9.4 (SAS Institute Inc., Cary, NC, USA). A *P* value of 0.05 was considered to be statistically significant. The odds ratio (OR) and 95% confidence intervals (CIs) are presented as needed.
Ethics statement
----------------
The present study was approved by the Korean National Cancer Center Institutional Review Board (NCC 2017-0137). All participants provided written informed consent for the survey.
RESULTS
=======
General characteristics of the participants and overall frequencies of agreement with the items
-----------------------------------------------------------------------------------------------
[Table 1](#T1){ref-type="table"} presents the participants\' demographic characteristics. The mean age of the entire sample was 45.8 years (standard deviation: 13.8), 70.4% were married, and 49% were college graduates or those with more education. The percentage of those who had a chronic disease other than cancer was 24.1%.
###### General characteristic of the study population and agreement frequencies
Characteristics Total P1 P2 P3 N1 N2 N3
--------------------------- ---------------------------- ------------ ------------ ------------ ------------ ------------ ------------ ------------ ------- -- ------- -- -------
Sex 0.112 0.131 0.932 0.451 0.941 0.752
Male 501 (50.1) 416 (83.0) 432 (86.2) 444 (88.6) 405 (80.8) 237 (47.3) 201 (40.1)
Female 499 (49.9) 432 (86.6) 446 (89.4) 441 (88.4) 394 (78.9) 235 (47.0) 205 (41.1)
Age, yr 0.491 0.653 0.747 0.005 0.062 0.232
\< 30 167 (16.7) 143 (85.6) 142 (85.0) 145 (86.8) 126 (75.4) 84 (50.3) 65 (38.9)
30--39 188 (18.8) 159 (84.6) 169 (89.8) 173 (92.0) 149 (79.3) 92 (48.9) 75 (39.8)
40--49 216 (21.6) 185 (85.6) 197 (91.2) 187 (86.6) 165 (86.4) 109 (50.4) 77 (35.6)
50--59 209 (20.9) 180 (86.1) 182 (87.1) 190 (90.9) 166 (79.4) 94 (44.9) 94 (44.9)
≥ 60 220 (22.0) 181 (82.3) 188 (85.5) 190 (86.4) 193 (87.7) 93 (42.3) 95 (43.2)
Marital status 0.924 0.502 0.592 0.618 0.233 0.910
Single/never married 230 (23.0) 197 (85.6) 198 (86.1) 202 (87.8) 181 (78.7) 117 (50.8) 93 (40.4)
Married 704 (70.4) 598 (84.9) 620 (88.1) 626 (88.9) 565 (80.3) 325 (46.2) 284 40.3)
Divorced/separated/widowed 66 (6.6) 53 (80.3) 60 (90.9) 57 (86.4) 53 (80.3) 30 (45.4) 29 (43.9)
Education 0.013 0.171 0.112 0.537 0.963 0.412
Middle school or less 88 (8.8) 74 (84.1) 79 (89.7) 77 (87.5) 77 (87.5) 42 (47.7) 33 (37.5)
High school 422 (42.2) 341 (80.8) 358 (84.8) 365 (86.5) 329 (77.9) 197 (46.7) 185 (43.8)
College or more 490 (49.0) 433 (88.4) 441 (90.0) 443 (90.4) 393 (80.2) 233 (47.5) 188 (38.4)
Income, million KRW/month 0.016 0.978 0.732 0.005 0.284 0.054
\< 1.5 178 (17.8) 145 (81.4) 164 (92.1) 162 (91.0) 136 (76.4) 76 (42.7) 54 (30.3)
1.5 to less than 3.0 453 (45.3) 378 (83.4) 390 (86.1) 394 (86.9) 352 (77.7) 217 (47.9) 198 (43.7)
3.0 to less than 5.0 255 (25.5) 222 (87.1) 216 (84.7) 223 (87.5) 211 (82.7) 123 (48.2) 104 (40.8)
≥ 5.0 114 (11.4) 103 (90.3) 108 (94.7) 106 (92.9) 100 (87.7) 56 (49.2) 50 (43.8)
Region 0.052 0.092 0.673 0.013 0.054 0.426
Metropolitan city 453 (45.3) 395 (87.2) 389 (85.8) 403 (88.9) 378 (83.4) 229 (50.5) 190 (41.9)
Province 547 (54.7) 453 (82.8) 489 (89.4) 482 (88.1) 421 (76.9) 243 (44.4) 216 (39.5)
Chronic disease 0.019 0.421 0.0002 0.516 0.428 0.092
No 759 (75.9) 655 (86.3) 670 (88.3) 688 (90.6) 610 (80.4) 353 (46.5) 297 (39.1)
Yes 241 (24.1) 193 (80.1) 208 (86.3) 197 (81.7) 189 (78.4) 119 (49.4) 109 (45.2)
Economic activity 0.386 0.234 0.732 0.830 0.184 0.481
No 258 (25.8) 223 (86.4) 232 (89.9) 230 (89.2) 205 (79.4) 131 (50.8) 100 (38.7)
Yes 742 (74.2) 625 (84.2) 646 (87.1) 655 (88.2) 594 (80.1) 341 (45.9) 306 (41.2)
P1 = These days, many people with cancer can expect to continue with normal activities and responsibilities, P2 = Cancer can often be cured, P3 = Going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving, N1 = Most cancer treatment is worse than the cancer itself, N2 = I would not want to know if I have cancer, N3 = A cancer diagnosis is a death sentence.
More than 80% of participants agreed with all three positively framed statements showing a highly optimistic attitude ([Table 2](#T2){ref-type="table"}). The agreement rate was the highest (88.5%) for the statement "going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving." For the negatively framed statements, 79.9% of participants were concerned about the experience of having treatment rather than the cancer itself. The percentage of those who would not want to know if they have cancer was 47.2%, which was slightly lower than the percentage of those who would want to know (47.6%). The agreement rate was lowest for the statement that a cancer diagnosis is a death sentence (40.5%), which was surpassed by the disagreement rate (56.9%).
###### Overall agreement frequencies of each statement
Statement Agree Disagree
-------------------- ------- ------------ ------------
Positive statement
P1 848 (84.8) 152 (15.2)
P2 878 (87.8) 122 (12.2)
P3 885 (88.5) 115 (11.5)
Negative statement
N1 799 (79.9) 201 (20.1)
N2 472 (47.2) 528 (52.8)
N3 406 (40.5) 594 (59.4)
Values are presented as number (%).
P1 = These days, many people with cancer can expect to continue with normal activities and responsibilities, P2 = Cancer can often be cured, P3 = Going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving, N1 = Most cancer treatment is worse than the cancer itself, N2 = I would not want to know if I have cancer, N3 = A cancer diagnosis is a death sentence.
Factors associated with attitudes in univariate analysis
--------------------------------------------------------
For the positive statements, socioeconomic disparities in agreement were not evident, except for a few results ([Table 1](#T1){ref-type="table"}). The upper boundaries of the CIs were high but the intervals were wide enough to be statistically insignificant. Highly educated (college or more) and higher income groups were more likely to believe that cancer patients can continue with normal activities (P1). Compared to respondents with a chronic disease, those without such diseases had a higher level of agreement with the positive beliefs that cancer patients can and do continue with normal activities (P1) and that early visits to the doctor increases their probability of survival (P3).
For the negatively framed statements, respondents who were older and had a higher income tended to agree with the belief that the experience of cancer treatment is worse than the cancer itself (N1). Higher income groups were more likely to view a cancer diagnosis as a death sentence (N3), and those who lived in metropolitan cities agreed with the negative belief more than those who lived in provincial areas that the experience of cancer treatment is worse than the cancer itself (N1).
Factors associated with attitudes in multivariate analysis
----------------------------------------------------------
The tendency that highly educated and higher income groups were more likely to believe that cancer patients can continue with normal activities (P1) was not apparent in the multivariate analysis (data shown in [Table 3](#T3){ref-type="table"}). Rather, income groups with 1.5 to less than 5.0 million KRW/month were less optimistic about the chance of finding a cancer cure (P2), and they placed less value on early symptom recognition and clinic visits (P3) than the lowest income group (\< 1.5 million KRW/month) did. Those without chronic diseases had a higher level of agreement with the positive beliefs that early visits to the doctor increases their probability of survival (P3).
###### Adjusted analysis of the agreement rates by logistic regression
Characteristics P1 P2 P3 N1 N2 N3
--------------------------- ---------------------------- ------------------- ------- ------------------- ------- ------------------- -------- ------------------- -------- ------------------- ------- ------------------- --------
Sex
Male Ref Ref Ref Ref Ref Ref
Female 0.36 (0.93--2.00) 0.113 1.18 (0.78--1.80) 0.451 0.90 (0.58--1.38) 0.633 0.98 (0.69--1.38) 0.910 0.95 (0.72--1.25) 0.721 1.14 (0.86--1.51) 0.352
Age, yr
\< 30 Ref Ref Ref Ref Ref Ref
30--39 1.04 (0.48--2.26) 0.912 1.75 (0.75--4.05) 0.192 1.83 (0.75--4.45) 0.177 0.68 (0.84--3.38) 0.143 1.05 (0.62--1.81) 0.832 1.12 (0.65--1.93) 0.691
40--49 1.55 (0.62--3.90) 0.338 2.42 (0.85--6.91) 0.087 1.28 (0.45--3.67) 0.634 1.73 (0.77--3.88) 0.181 1.10 (0.57--2.10) 0.763 0.88 (0.45--1.71) 0.711
50--59 1.99 (0.75--5.28) 0.163 1.68 (0.58--4.87) 0.332 2.65 (0.85--8.31) 0.086 2.42 (1.03--5.73) 0.040 0.79 (0.40--1.56) 0.505 1.23 (0.62--2.43) 0.562
≥ 60 1.88 (0.69--5.14) 0.210 1.49 (0.50--4.43) 0.474 2.10 (0.66--6.67) 0.211 5.67 (2.20--14.6) 0.0003 0.59 (0.29--1.21) 0.147 1.18 (0.57--2.43) 0.641
Marital status
Single/never married Ref Ref Ref Ref Ref Ref
Married 0.70 (0.33--1.48) 0.354 1.03 (0.44--2.42) 0.941 1.16 (0.47--2.86) 0.732 0.56 (0.28--1.13) 0.104 0.81 (0.48--1.37) 0.432 0.82 (0.47--1.39) 0.448
Divorced/separated/widowed 0.58 (0.22--1.58) 0.292 1.41 (0.41--4.83) 0.582 0.97 (0.30--3.14) 0.964 0.53 (0.20--1.35) 0.183 0.85 (0.41--1.78) 0.673 1.01 (0.48--2.15) 0.963
Education
Middle school or less Ref Ref Ref Ref Ref Ref
High school 0.75 (0.37--1.51) 0.416 0.50 (0.35--1.83) 0.608 1.14 (0.52--2.52) 0.743 0.69 (0.33--1.48) 0.342 0.68 (0.40--1.16) 0.164 1.18 (0.69--2.02) 0.522
College or more 1.42 (0.62--3.20) 0.422 1.43 (0.56--3.66) 0.451 1.64 (0.66--4.09) 0.279 0.84 (0.36--1.92) 0.687 0.60 (0.33--1.10) 0.091 0.89 (0.48--1.65) 0.722
Income, million KRW/month
\< 1.5 Ref Ref Ref Ref Ref Ref
1.5 to less than 3.0 1.33 (0.77--2.28) 0.292 0.49 (0.25--0.99) 0.048 0.54 (0.27--1.05) 0.071 1.17 (0.72--1.93) 0.524 1.59 (1.05--2.41) 0.026 2.01 (1.31--3.09) 0.0013
3.0 to less than 5.0 1.75 (0.93--3.30) 0.080 0.37 (0.17--0.81) 0.012 0.45 (0.22--0.98) 0.044 1.78 (1.01--3.16) 0.044 1.70 (1.07--2.71) 0.024 1.95 (1.21--3.16) 0.006
≥ 5.0 1.98 (0.89--4.45) 0.091 1.21 (0.42--3.43) 0.724 0.93 (0.35--2.43) 0.884 2.68 (1.31--5.53) 0.007 1.61 (0.94--2.75) 0.081 2.32 (1.34--4.01) 0.002
Region
Metropolitan city Ref Ref Ref Ref Ref Ref
Province 0.74 (0.52--1.06) 0.103 1.44 (0.98--2.13) 0.062 0.95 (0.64--1.43) 0.841 0.67 (0.48--0.92) 0.014 0.77 (0.59--0.99) 0.042 0.88 (0.67--1.14) 0.321
Chronic disease
No Ref Ref Ref Ref Ref Ref
Yes 0.66 (0.43--1.04) 0.072 0.88 (0.53--1.46) 0.616 0.38 (0.23--0.63) 0.0002 0.63 (0.42--0.98) 0.039 1.40 (1.00--1.97) 0.049 1.20 (0.85--1.69) 0.284
Economic activity
No Ref Ref Ref Ref Ref Ref
Yes 0.67 (0.40--1.11) 0.131 0.90 (0.52--1.57) 0.707 0.94 (0.55--1.62) 0.824 0.95 (0.61--1.48) 0.833 0.67 (0.47--0.95) 0.024 0.98 (0.69--1.41) 0.943
P1 = These days, many people with cancer can expect to continue with normal activities and responsibilities, P2 = Cancer can often be cured, P3 = Going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving, N1 = Most cancer treatment is worse than the cancer itself, N2 = I would not want to know if I have cancer, N3 = A cancer diagnosis is a death sentence, OR = odds ratio, CI = confidence interval.
For the negatively framed statements, the highest income group agreed more strongly with the statements that cancer treatment is worse than the cancer itself (N1: OR, 2.68; 95% CI, 1.31--5.53), that they would not want to know if they have cancer (N2: OR, 1.61; 95% CI, 0.94--2.75), and that a cancer diagnosis is a death sentence (N3: OR, 2.32; 95% CI, 1.34--4.01) compared to the lowest income group. Older respondents tended to have a greater fear of cancer treatment than the cancer itself (*P* for trend: 0.0013), but their agreement rates with the other two negative beliefs were not different from other age groups. Those who lived in metropolitan cities agreed with negative beliefs (N1 and N2) more than those who lived in provincial areas. Although respondents with a chronic disease did not fear cancer treatment when compared with those without a chronic disease (N1: OR, 0.63; 95% CI, 0.42--0.98), they were less likely to want to know if they have cancer (N2: OR, 1.4; 95% CI, 1.00--1.97).
DISCUSSION
==========
The ways in which people respond to cancer or a cancer diagnosis is highly dependent on their socioeconomic, cultural, and demographic backgrounds. In particular, how and in which direction those variables modify beliefs and attitudes in a rapidly industrialized country may be distinctive. The present study\'s results reflect a complicated context of cancer beliefs in Korea that are unlike the findings of studies conducted in Western populations.
Some results of the present study are consistent with those of a UK study that used the same questionnaire.[@B12] The rates of agreement with all positive cancer beliefs were 84.8%--88.5%, which were similar or slightly lower than 88.0%--97.6% in the UK study with older adults. Considering the optimistic attitudes towards cancer, the rates of agreement with negative cancer beliefs were as high as 40.5%--79.9% overall ([Table 1](#T1){ref-type="table"}); the highest rate of agreement was with the statement that cancer treatment is worse than the cancer itself. Across all the age groups, 35.6%--87.7% agreed with negative beliefs ([Table 2](#T2){ref-type="table"}), which was roughly 30% higher than the results of the study with the UK adults (8.3%--52.9%).[@B12] The relatively high prevalence of negative attitudes among the Koreans is consistent with the results of another study, which found that 58.4% of Koreans believed that cancer is an untreatable disease, regardless of the recent developments in the medical sciences and the improved survival rates.[@B17] The Western studies conducted with ethnic minorities also found that Asians had more fatalistic and negative beliefs than the other ethnic groups[@B2][@B10]; however, they used education level as an index for representing SES instead of income level.
The high percentage of both positive and negative attitudes towards cancer can be explained by the dual nature of information processing by humans. That is, the individual\'s response to cancer is a dual system consisting of an intuitive and immediate sense of death that is linked to negative attitudes, and a subsequent, deliberative, and rational perception that is linked to positive attitudes.[@B21][@B22] The items from the ABC used in the present study might have included these dual aspects of cancer-related information. The items such as "These days, many people with cancer can expect to continue with normal activities and responsibilities," "Cancer can often be cured," and "Going to the doctor as quickly as possible after noticing a symptom of cancer could increase the chances of surviving" are related to the beliefs that can be influenced by messages from newspapers, TV, books, magazines, or word of mouth based on statistical facts. On the other hand, the items such as "Most cancer treatment is worse than the cancer itself," "I would NOT want to know if I have cancer," and "A cancer diagnosis is a death sentence" would be related to the beliefs formed by direct observation of neighborhoods and can spread by storytelling of cancer survivors or caregivers. Therefore, such negative beliefs can be regarded as natural phenomena induced by anxiety due to negative emotion such as fear.
In Asian populations, these conflicting attitudes can be further attributed to the unique cultural factors. Some qualitative studies using ethnographic interviews have described a more complex belief system and fatalistic view in the Asian culture.[@B9] In a recent study of Chinese patients with cancer, the researchers observed contradictory behavioral and cognitive aspects among the participants. The participants actively engaged in self-care management, but were simultaneously fatalistic, which the researchers depicted as "fatalistic voluntarism".[@B23] This finding might be related to the preference of Confucian cultures for moderate states of balance between positive and negative events rather than extreme states of balance.[@B24] A dual negative and positive attitude in the present study can be seen in a similar vein.
Nevertheless, the specific finding of a positive association between higher income level and more negative beliefs remains unresolved. Unlike educational level and participation in economic activity, higher income levels were linked to the negative statements that expressed fear of a cancer diagnosis and undergoing cancer treatment. Oddly, this finding contradicts the accumulated results of studies with Western samples which reported that groups with lower SES were more likely to hold fatalistic beliefs or negative attitudes.[@B4][@B5] One possible explanation is that higher income groups in Korea perceive health risks differently from those in western communities, where the phenomena were deeply influenced by the country\'s social and cultural environments. The higher income groups in Korea might have preferred the negative statements because they were more acutely aware of the risks of cancer, acknowledging it as the leading cause of death in Korea. Studies on risk perception in various contexts in Korea have found that the optimism of higher income groups was more realistic, and their risk perception was less distorted and more acute.[@B25][@B26] The finding that the Koreans who lived in the Metropolitan cities had more negative attitudes than those who lived in the provinces can be understood by taking the same perspective, which is also inconsistent with the results of western studies.[@B17][@B27]
The present study has some limitations; first, we used the ABC questionnaire for Korean adults aged 20--79 years; however, it was originally developed and demonstrated for older populations at least 50 years of age and its reliability was tested under such conditions. Second, it was not clearly interpreted why the educational level was not significantly associated with the attitudes to cancer in contrast to the income level. In line with our result, Cho et al.[@B17] did not observe any relation between education and the cancer belief. Nevertheless, higher education level was related to lower agreement rates in the negative statements as in the case of income level, although those were not statistically significant. The different effect between educational or income level in the risk perception of cancer would be carefully monitored in the future study.
In summary, the present results imply a complicated context of cancer beliefs in Korea, unlike those shown in the studies of Western populations. The contradictory attitudes toward cancer found in this study can be understood as being related to the dual nature of information processing; however, the negative attitudes of the higher income groups might have been influenced by their struggles to respond to various types of risk, rather than their unrealistic pessimism or fatalism. Likewise, the association between SES, attitudes toward cancer, and health behaviors may not have a single or straightforward direction but it can vary depending on the diversity of the contexts.
**Funding:** This research was supported by National Cancer Center (grant No. 1610312).
**Disclosure:** The authors have no potential conflicts of interest to disclose.
**Author Contributions:** Conceptualization: Min HS, Kim YA, Yang HK. Investigation: Min HS, Park J, Kim YA, Yang HK, Park K. Validation: Min HS, Kim Y, Park K. Writing - original draft: Min HS.
|
Dragonforce Fallen World Lyrics
Soldiers of fire, rage of the universe,
Cold steel and bloodshed in a lost barren wasteland!
Fear rising higher, rage of the winter war,
Death calls and nightfall, our hatred still burns,
[Pre-Chorus]
As we march through endless skies!
Mankind will fall, death will arise!
[Chorus]
For our lifetime we fight without reason!
Still we wait for the warrior's return!
Though we're cast out and broken,
We still carry on,
Alone in a lost Fallen World!
Flames burning higher, curse of the winterland!
Black, torn and twisted in the fast-fading twilight!
Storm winds still blowing, steel shapes our destiny!
Death calls and nightfall,
Our curse will be lifted,
[Pre-Chorus]
Disguise, this time is right!
Brave men will fall, Evil will rise!!
[Chorus]
For our lifetime we fight without reason!
Still we wait for the warrior's return!
Though we're cast out and broken,
We still carry on,
Alone in a lost Fallen World!
Still heroes we're born, with promises so blind
The light at the end of the road which we all must climb!
[Chorus]
For our lifetime we fight without reason!
Still we wait for the warrior's return!
Though we're cast out and broken,
We still carry on,
Alone in a lost Fallen World!
Alone in a lost Fallen World!
Sponsored Links
Thanks to Tykian@gmail.com for submitting Fallen World Lyrics. |
Ziggo CEO: No talks with Liberty
Dutch cable company Ziggo is not in talks with US group Liberty Global, Ziggo’s Chief Executive Officer (CEO) Bernard Dijkhuizen has told a Dutch newspaper.
His comments come a day after Ziggo said it was preparing for a listing on the Amsterdam stock exchange and follow months of speculation in the Dutch press that Liberty, which operates UPC in the in Netherlands, is considering a bid for Ziggo.
Het Financieele Dagblad reported that Dijkhuizen said his group was not in parallel talks with UPC.
“This is not a two-track strategy, we don’t need a merger to be successful,” the paper quoted him as saying. |
Darknet markets Global and digital markets for illegal goods
I wanted to empower people to be able to make choices in their lives, for themselves and to have privacy and anonymity. Ross Ulbricht, creator of Silk Road
There’s one thing that cryptocurrency proponents and skeptics can agree with: cryptocurrencies are excellent for illegal purposes. And is there a better example than darknet markets—websites where you can buy illegal goods and pay with cryptocurrencies?
Before cryptocurrencies, such sites would have trouble staying in business because payment processors would shut them down quickly. But nobody can block cryptocurrency transactions, and in 2012 the first darknet market “Silk Road” was created using Bitcoin. Since then there’s been a bunch of different darknet markets, many with much larger volume than Silk Road.
I know I wrote in an early chapter that this book would describe legal use cases, but that’s not really true. This book tries to describe moral use cases, which aren’t always the same as legal ones. As we’ll see in this chapter, darknet markets might not even be moral, so I hope you’ll forgive me.1
1As always where darknet markets fall on the universal scale of good and bad is subjective. But I hope to show that it’s not a black-and-white issue.
There’s a concept we need to have in mind while looking at darknet markets: something being illegal doesn’t make it immoral, and that everything legal doesn’t have to be moral. Legality isn’t equivalent to morality.
Here’s a table to illustrate the problem:
Legal Illegal Moral Self defense
Free speech
Some types of sex
Starving child steals food Immoral Mass surveillance
Civil asset forfeiture
Slavery
Murder
It’s actually quite hard to classify things as legal or illegal and moral or immoral; they both change depending on country, the time period and who you ask. For instance most would agree that slavery is immoral and should be illegal, but it was in fact legal and viewed as normal for thousands of years. Similarly today in the western world we take free speech for granted, but that’s not the case in all countries.
Mass surveillance, which we covered in the chapter Private money, is immoral yet legal.2 Civil asset forfeiture, which allows the police to outright take your stuff, is another example of an immoral legal practice. (We’ll explore civil asset forfeiture in a future chapter.)
It’s easy to find examples of silly laws that make moral actions illegal (just search for “silly laws” or similar), but I think there are more interesting issues. For example stealing is illegal, but is it immoral for a starving child to steal food to survive? Or for the child to steal food for his starving little sister? And where on the moral scale would you place prostitution?
The issue of “right or wrong” isn’t so easy to answer, and we cannot just rely on what’s legal and what’s not. Instead I think we should ask ourselves if it’s moral or immoral (which is of course subjective).
2You can argue that mass surveillance is in fact illegal, but in practice it doesn’t really matter as they rewrite the laws anyway.
Black markets refers to transactions outside government control. They’re usually related to illegal behaviour in some way, like tax avoidance or the trade of illegal goods.
Black markets have existed as long as taxes have been collected, and it’s not just for hardcore criminals. How many people do you know who’ve paid a craftsman off the book? Maybe paid a friend to paint the house, or paid a mechanic friend to fix the car? If it was paid in cash, and never officially registered the work, then they’ve engaged in a black market trade.3
In countries with corruption or dysfunctional governments black markets are huge. For example in the Soviet Union many people relied on black markets to get their food supply when the market economy failed them. Or in Greece during the economic breakdown in the 2010s, the black market was estimated at 20 to 25 percent of the GDP.
Black markets aren’t inherently evil, sometimes they’re even necessary for our survival. Instead they deal in both good and bad things, each of which should be considered on a case-by-case basis.
3Warming houses with geothermal heating is popular where we live. It works by drilling a large hole in the ground and transport heat from the ground up into the house, and is a cost-effective way to heat houses. Many people drill the holes off the books, which can save you a lot of money. We were quite tempted, but in the end we opted not to.
Contrary to popular belief you cannot buy everything on a darknet market. In theory it’s possible, but in practice darknet markets operate with their own morality.
For instance you cannot hire a hitman on a darknet market. This is a myth made popular by the false accusations against Ross Ulbricht, the creator of the first darknet market Silk Road. The rumor was manufactured by corrupt federal agents (who got sentenced), yet their “evidence” was used by prosecutors and news media to make an example out of Ross.4
4The sentence against Ross is yet another example of how the U.S. government tries to make an example out of people. It’s good to keep in mind that the criminal justice system is a legal system, not a justice system.
Darknet market operators generally block things that are harmful to others. Murder harms others, so it’s banned. Child porn is also harmful, so it’s banned. Even very dangerous drugs, such as fentanyl, might be unavailable. (But of course the ban isn’t 100% effective, just as everywhere else in society.)
So if none of those things are available, what can you buy on a darknet market? You might be able to find books about banned topics that goes against the regime’s propaganda, but usually you go to a darknet market to buy drugs or medicine. You can buy the same medicine elsewhere, but they might be much more expensive due to patents and other taxes.
The following example, based on a real-life story I read a few years ago, illustrates why darknet markets aren’t purely evil.
Tom met the love of his life five years ago, when he went to get some of his teeth removed. Hardly the most romantic meeting, with her drilling into his aching teeth, but it was love at first sight. Only a year later, they were married with a child on the way. They say love that burns hot quickly runs out, but that wasn’t the case for Tom and Melinda. They bought a nice house in a nice suburb and settled down. They were planning a second child, and life was good. But then Melinda got sick. It started with clumsiness, then some vertigo and she became more tired than usual. The doctor gave her some pills, which seemed to help, but when she got worse and when she started vomiting they knew something else was going on. Melinda had cancer. They went to see specialists, and she started chemotherapy. As luck would have it, she responded well, and the doctors gave her a good chance of recovery. But she was still weak, and needed continuous treatment. But Melinda’s treatment was expensive, very expensive. Despite insurance, they would still have to come up with $600 a week—that’s around $2,400 a month—just for her medicine. While they both had decent jobs, and they were even a little frugal, it was very difficult to manage when their monthly expenses doubled, while their income dropped as Melinda couldn’t work anymore. They took out a second mortgage, and a bunch of other loans, and starting selling the valuable stuff they had. But it wasn’t enough, they were drowning. Tom was desperate and was willing to try anything. He’d heard from a friend about “the darknet” where he might find Melinda’s medicine for cheap, and while he was skeptical it couldn’t hurt to try? After all he was running out of options to try. He visited the darknet market his friend had suggested and searched for Melinda’s medicine. To his surprise he found several sellers, who could deliver them right to his doorstep in just a few days. He decided to test it out and transferred some bitcoins to a seller. It was surprisingly easy, but he couldn’t shake the feeling he had just been scammed.5 But three days later a small package arrived in the mailbox, neatly wrapped in an unassuming box. It was Melinda’s medicine, in fact exactly the same brand with the same packaging they used to buy, only now one week of medicine had cost them $30 instead of $600. Tom couldn’t understand how it could be so cheap. The medicine seemed real, it came in the same package and Tom even had it tested (can’t be too careful, right?) Maybe it was stolen, and the thieves just wanted to sell it quickly? Or was it produced in India, for minimal cost? But Tom didn’t care. He had already placed his next order from the same seller. Tom only cared about Melinda. 5If you do go down this route, and you’re worried about getting caught, please don’t have the package delivered to your home address. And if you use Bitcoin make sure it can’t be If you do go down this route, and you’re worried about getting caught, pleasehave the package delivered to your home address. And if you use Bitcoin make sure it can’t be connected to your identity
While the story is made up, the situation is real. Medicine in the U.S. can be extremely expensive, and the cost isn’t something all families can bear.6 The same medicine that will ruin you financially is often available for a fraction of the cost from darknet markets.
6It can be extremely expensive, even if you have insurance. The insurance companies try really hard to avoid paying the bills. For example they might only cover certain “approved” medicines, doctors or treatments. And even if they do cover it, sometimes it’s still expensive. Even if you only pay 10% of the original cost, that’s still $2,000 if the medicine was $20,000 originally.
Yet we must always remember the dangers of buying medicine from darknet markets. It’s entirely possible that you can get fake medicine, untested medicine or straight up dangerous medicine. You must be very careful when you buy from a completely unregulated market. Instead of the medicine saving your life, it might kill you.
Still, was it wrong to do what Tom did and got the medicine from a darknet market? If it might save the love of your life, the mother of your child, would you do it? What if it was easy and the risk of getting caught was very small?
I’d imagine most would say yes, they would do anything to save her. While there are bad stuff on darknet markets, most of which are illegal, in this case cryptocurrencies and darknet markets helped save Tom’s family, and I see that as a good thing. |
Tata Motors temporary worker gets Rs 32 lakh aid
Jamshedpur: The family of Santokh Singh, a temporary employee of Tata Motors, was given a cheque of Rs 32 lakh near Labour Bureau, Telco, on Sunday. They got the help through contribution of all by-six workers of the company who donated their one day basic and DA for the purpose. A sum of Rs 26 lakh was collected by the employees. The remaining amount came from Provident Fund and live cover scheme. Santokh’s family members thanked one and all for the help. They also donated Rs 1 lakh for the treatment of temporary workers who are sick. Santokh’s body was recovered from Hudco Dam on 27th December last. His wife Daljeet Kaur, children, mother, brother and maternal uncle were present to take the cheque today.
Editor’s Choice
By RK Sinha What happened in Pulwama last week raises concern. We lost some 40 jawans of CRPF in terror attack. There is anger and shock as 125 crore Indians are stunned. We are anxious to see to it that Pakistan is taught a lesson. We must retaliate. The nation is engaged in decoding this […] |
Originally Posted by xGBx Boogie Go to original post Originally Posted by
I know there are people who create great Steep videos on YouTube and do a great job now with what we have. Something I'd love to see is a replay editor. Something similar to what Skate 3 had would be amazing.
- Allow us to create multiple frames, if there is a certain part of the run to you want to be slow , it will slow it down.
- Allow multiple cameras for smooth transitions between different set cameras, for switching between static cameras and/or follow cameras
- Add different screen effects (B&W, sepia, regular)
Having these kind of tools would help content creators take their content to a whole new level.
What do you guys think? |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.