text:
Event Formats
Info For Competitors
DUBAI AUTODROME
F4UAE Information Pack
2020 SPORTING REGS
TROPHY ROUND
ROUND TWO
2019/20 POINTS
NC ROUND
ROUND THREE
ROUND FOUR
ROUND FIVE
ROUND SIX
Register Your Interest In F4UAE
EMIRATI SISTERS TO MAKE FORMULA 4 UAE DEBUT AT ABU DHABI GRAND PRIX
Young Emirati sisters Amna and Hamda Al Qubaisi will headline the F4UAE Championship powered by Abarth when it debuts as a support act to this year's Abu Dhabi Grand Prix at Yas Marina Circuit (November 28-December 1).
The teenagers, aged 16 and 14 respectively, are currently training in Italy ahead of their first appearance in the local UAE open-wheeler championship, which now heads into its fourth season of competition as the only FIA-sanctioned open-wheeler championship in the MENA region.
The Al Qubaisi sisters – daughter of celebrated race-winning UAE driver Khaled Al Qubaisi – have extensive experience and successes in karting and open-wheelers, and will lead a field of junior racers when the championship makes its maiden appearance as a support to this year's Formula 1® grand finale of at the Abu Dhabi circuit. Their one-off appearance will be a major step forward in representing the UAE in front of a home crowd and the best teams in the world, before the championship officially begins in earnest for points come January 2020.
Amna is already in her second season of the Italian F4 Championship, where she finished a best-placed 15th in Race 3 at Imola last month. Her other accolades include becoming the first female to win both the UAE RMC Champion karting title in 2016 and the GCC Drivers Academy Competition in 2017, and was also the first Middle Eastern woman to take part in a motorsport test program for Formula E after the 2018 Ad Diriyah ePrix event in Saudi Arabia. While Hamda, who was the first Emirati to be invited to the FIA-sponsored CIK-FIA Karting Academy Trophy in 2016, made her F4 debut in Austria at the Red Bull Ring this past July.
Making the announcement at Yas Marina Circuit's 2019/2020 calendar unveiling this week, Al Tareq Al Amiri, Yas Marina Circuit CEO, revealed F4UAE would debut on this year's program with the sisters being the first drivers to announce their participation in the F4UAE non-championship Trophy Round.
"As a circuit we're trying to support young local talents as much as we can," said Al Tareq Al Ameri. "So we decided to host F4UAE, which is considered the first [stage] platform for professional racing for drivers after karting. We will be supporting Amna and Hamda and to be honest, we cannot wait to showcase them to the world. F4 is a global series but these are local rounds and these in turn are like feeder series to F1, so we are really excited and this is what we want to do to support local F1 aspirants."
Launched in 2016, the FIA F4UAE Championship powered by Abarth was considered one of the most important additions to the UAE's local motorsport calendar and has since welcomed a total of 51 drivers in three seasons, most of whom have gone on to successful results in Europe since.
"F1 is the category that the majority of our young open-wheeler racers aspire to reach and so to now give them a platform to race in front of their racing heroes is a very exciting way to start the new season of F4UAE," said category technical director, Craig Thompson. "Announcing that Amna and Hamda will race F4UAE at the November event is great news for the region, and we know they will do everyone in the UAE proud when they get on track in front of the best teams in the world."
F4UAE is open to drivers aged 15 years and above and was created by the world's governing body of motorsport, the FIA, to help young drivers bridge the gap between existing regional racing series and karting, to European competition and potentially Formula 1®.
2019/2020 F4UAE Championship Calendar:
NC - November 28-December 1, 2019 at Yas Marina Circuit
Round 1 – January 8-10, 2020 at Dubai Autodrome
Round 2 – January 17-18, 2020 at Yas Marina Circuit
Round 3 – February 14-15, 2020 at Yas Marina Circuit
Round 4 – February 21-22, 2020 at Dubai Autodrome
Round 5 – March 6-7, 2020 at Dubai Autodrome
AMNA AL QUBAISI RACING ACHIEVEMENTS
· UAE RMC Champion 2016 (First Female)
· GCC Drivers Academy Competition Winner 2017 (First Female)
· 2x Teen Fitness Awards Winner 2016 & 2017
· First Female Arab to test Formula E in Adiryah, Riyadh 2018
· 2 Seasons in the Italian F4 Championship 2018 & 2019
· IAME X30 Championship 2017 P3
HAMDA AL QUBAISI RACING ACHIEVEMENTS
· 2nd in the Dubai O plate 2016
· 3rd in the X30 Championship 2017
· Teen fitness Award Winner 2017
· CIK FIA Trophy Academy 2016
· FIA Women in Motorsports Ambassador 2016
· First Debut in F4 in the Italian Championship 2019 in Austria Red Bull Ring
Web Design by Greystar Dubai


FANTOMAS RECORDS is a new high quality Booty-Breaks label created by two of the most experienced producers/djs of the Breaks scene. Top quality Booty singles, amazing dancefloor fillers series and unique compilations are already on the pipeline. Stay tuned!
For three hours the Berlin express had been speeding across Hesse-Weimar on its way to Paris. Night was beginning to fall and multi-colored signals showed their points of light as the train sped past way stations. Juve, plunged in his thoughts, paid no attention to what was passing without. He had picked up a copy of the Hesse-Weimar Gazette before leaving, and in it had read the following: "The desperate bandit, Fantômas, arrested two days ago in the Royal Palace while in the act of stealing the diamond, has committed suicide by shooting himself through the head with a small revolver he had hidden in his clothes. His body is now lying in the mortuary chapel of the cemetery awaiting the inevitable autopsy." This information but confirmed Juve in the hypothesis he had formed. But there still remained a point to be cleared up. Undoubtedly the public were being duped … but who was duping them, and why? If Juve was thought to be Fantômas, they wouldn't have let him escape and put a dead man in his place. On the other hand, if they knew that Juve was not Fantômas, why the devil had this suicide story been invented? A new idea suddenly flashed through Juve's mind. "Suppose that not only the people of Hesse-Weimar but also the Government have been fooled!" A glimpse caught of Prince Gudulfin descending from the private car at the Hesse-Weimar station, was sufficient to start this train of thought. By association of ideas the sight of the Prince brought to Juve's mind the figure of the Grand Duchess Alexandra, who was no other than Lady Beltham. And Lady Beltham suggested Fantômas, whom Juve was inclined to credit not only with his arrest but also with his liberation.
Available EARLY JANUARY from all major online retailers.


I have created new transaction by extending uvm_sequence_item, where I have implemented do_compare function. Once implemented, compare calls seems to return '1', even if do_compare returns '0' (comparison failed).
// in the result count.
It seems that any time do_compare returns '0', the condition below it always change ret_val (compare_object return value) to '1'. This behaviour exists only in 1800.2-2017-0.9 reference implementation of UVM library. If I use UVM-1.2, compare calls returns '0', if do_compare returns '0' on comparison failure (as I would expect).
I would like to ask whether this behaviour is intentional. In such case, is there any recommended way to implement do_compare task?
Thanks for posting this issue Rolko. The "else ret_val = 1" is a bug in 1800.2-2017-0.9. It is removed in 1800.2-2017-1.0, a release which was approved last week by the committee and should be available for download very soon.


Due to an IP phone call drop or a lack of networks connection? You don't have to worry and panic anymore because Shomadhan will help you get the best IP repair expert in your area. All our experts are quick and efficient and timely for your work. We can repair damage to the IP phone, upgrade to the firmware, headset / receiver, cable and more.


This issue, learn everything you need to know about five types of headaches and how to ward them off. Quick & Easy features globally inspired meals for weeknights. We've got you covered with the latest in cozy outerwear, including plus-size styles. Get creative and try our modern takes on holiday gift wrap.
This issue, shake up your Thanksgiving dinner by mixing your faves with new classics. Our quick and easy one-pan meals for busy weeknights will simplify your cleanup, too. We delve into life after a breast cancer diagnosis, and how two women are rebuilding their lives.


text:
Skyler never seems to stop working. In the past four years, he has attended Berklee College of Music, released one album and two EPs, and was voted 2014's "Best Small Venue Artist" by Campus Activities Magazine. Whether solo or with some variation of his exciting live band, Skyler has performed over 500 shows in venues of all sizes and has shared the stage with the Goo Goo Dolls, Band Perry, and Daughtry (to name a few). In 2012, he appeared on the X Factor, was the national spokesperson for Safe Teen Driving for the AllState Foundation, and had his song, "Stephanie," used in a Supercuts commercial. Of course, as with any good artist, it begins and ends with the song. When he's not performing, he's writing or recording in the studio in LA or Nashville. Although he calls Boston home, keep an eye out for Skyler anywhere across the country!
Click & Share the Love
skylertunes@gmail.com
Matt Rafal // Developing Artist
matt@developingartist.com
Jim Zumwalt
jzumwalt@shacklaw.net
streetteam@skylertunes.com
Subscribe to Skyler's mailing list
© 2014 Skyler. All rights reserved. Site by Alex Wright Design.

redpajama_set_name: RedPajamaCommonCrawl


text:
British government suppressed daily pandemic death toll by thousands
By Simon Whelan
Research by Guardian journalists into data collected by the Office for National Statistics (ONS) and released by Downing Street reveal how the Johnson government suppressed the number of daily COVID-19 deaths throughout April.
For 22 consecutive days between April 2 and 23, a total of 26,566 people died in the UK from COVID-19. Government ministers, however, issued figures at the Downing Street briefings day after day that never once reached four figures. As the Tory government presided over its reckless and homicidal policy of herd immunity, it covered over the severity of its crimes by fiddling the figures and announcing partial death tolls.
On Easter Monday, April 6, with Prime Minister Boris Johnson ill with the virus, the Downing Street briefing was taken by Dominic Raab. The foreign secretary stated the death toll in the 24 hours to 5 p.m. on Sunday, April 5 had risen by 439. However, the ONS figures reveal that almost three times as many people died on April 5, a total of 1,210.
Analysis of the official figures shows that on April 8, the UK suffered a record 1,445 deaths from COVID-19 in 24 hours. However, the following day, on April 9, Raab, deputising again for Johnson, claimed the death toll had increased by 881 the previous day. The actual death toll was 64 percent higher than that announced.
In the UK, in just 18 days, COVID-19 deaths accelerated from 139 in a single day to a peak of 1,445, on April 8. It would be 58 days later before the death toll returned to running in the low hundreds or less. Moreover, it was not until April 29 that the government altered its daily presentation to include deaths in all locations, including those where no test had been carried out, but the virus was mentioned on the death certificate.
In increasingly surreal attempts to pull the wool over everyone's eyes, the Department of Health and Social Care effectively announced it was unable to carry out simple addition, claiming that the task of providing accurate death toll numbers was technically challenging and time consuming.
The reported death tolls announced by ministers during the initial period of the crisis at the daily press briefings were systematically partial and inaccurate. Their presentation undercounted the real death toll by collecting only deaths recorded in hospitals following a positive COVID-19 test. Downing Street's figures initially only included confirmed deaths in hospitals, conveniently ignoring the many thousands of deaths in care homes. In the first 24 weeks of data, nearly 30 percent of all deaths attributable to the virus occurred in care homes, according to ONS figures. Many who died in these locations had previously been discharged from hospitals without being tested. The policy of removing from hospitals the elderly and infirm and dumping them into residential care homes—supposedly justified by the need to "protect the National Health Service"—killed thousands needlessly, including many care workers.
By June 23, according to the ONS, there had been 14,404 deaths in care homes, 2,205 in private homes, 660 in hospices, 219 in other communal establishments and 182 elsewhere.
In early June, ONS figures first came to light showing gaping disparities between the horrific reality and the picture presented by the government. On June 2, Health Secretary Matt Hancock claimed the government was being "transparent," despite statistical data showing how it had vastly underreported the likely number of COVID-19 deaths.
Hancock rubbished the ONS figures on "excess deaths," which showed death rates three times higher than those announced by the government at the time. The excess deaths method of compiling figures for COVID-19 is internationally recognised as the best. The Health Foundation explains, "Excess deaths is a better measure than the COVID-19 deaths of the pandemic's total mortality. It measures the additional deaths in a given period compared to the number usually expected and does not depend on how COVID-19 deaths are recorded."
Speaking to the Guardian, Sir David King, the former government chief scientific adviser and chairman of the independent SAGE group, suggested the lacuna between the government's figures and the objective toll was "an attempt to play down the adversity that the country was faced with."
"They didn't say we have to add on all these other numbers which would have been a more honest thing to say," said King, suggesting the government was, by implication, dishonest. King continued, "They were saying things were more rosy than they actually were. The most important thing when you are running any crisis of this kind is truth and honesty. The only way to maintain the moral authority of the government. This is the most disastrous handling of any serious challenge to a government for 100 years."
In response to Guardian requests for a comment, the government offered up another of their now usual pro-forma statements: "Every death is a tragedy, and our deepest sympathies go out to all the families who have lost loved ones. We have always been transparent about the way we report COVID-19 deaths and it is wrong to suggest we would in any way attempt to play down the scale of this global pandemic. The government's daily figures and the ONS data count different things, which we have always fully explained and clearly reported."
The government suppressed the extent of COVID-19 fatalities because its policies directly created the conditions for an explosive outbreak of the virus and consequently tens of thousands of needless deaths.
There is no innocent explanation for the blatant suppression of the pandemic death numbers. The government's briefings were an act of propaganda designed to deceive the public and to suppress anger within working class communities, which have disproportionately borne the overwhelming majority of deaths from the virus. Millions are employed in key parts of the economy without sufficient workplace protection and consequently many thousands have and continue to die from infection at work.
By masking the severity of the virus, the government's many obfuscations also serve to undermine public attitudes towards the need for extreme caution and maintaining adequate social distancing and shielding as advocated by many independent scientists. By under reporting the number of deaths, the government sought to mask the virulence of the virus and the full extent of the its criminal negligence.
Now, with the Tories rushing headlong to end lockdown and remove any meaningful social distancing measures, even the daily coronavirus press briefings have been ditched.
As COVID-19 resurges, Chinese workers hit by pay and job cuts
Boston Teachers Union agrees to return to in-person classes for thousands of students
Chicago educators form independent rank-and-file committee to fight school reopenings
UK: Investment banker adviser to Tory government appointed BBC chair
Record UK COVID-19 deaths as government plots ending "the last" lockdown
Corbyn seeks readmittance to Labour Party as antisemitism witch-hunt escalates
Weakened Italian government clings to power
German federal and state governments reject consistent lockdown measures
Manchester University students tear down 7-foot fence put up around their accommodation blocks
French students denounce inadequate partial lockdown
Starmer begins purge of Corbyn supporters from UK Labour Party
Clare Moseley on the horrific plight of English Channel migrants: "They are asking for help, but being treated like criminals"
Priceless artefacts vandalised in Berlin museums


Neshoba Central Middle School is located in Philadelphia, Mississippi. Scholarships for students attending Neshoba Central Middle School can be found in our scholarship database. If you are searching for scholarships for students attending a different high school in Philadelphia, visit the Philadelphia directory.


text:
\section{Introduction}
In quantum theory,
any measurement that provides information about a physical system
also inevitably disturbs the system's state
in a way that depends on the measurement's outcome.
This trade-off between information and disturbance
is of great interest in establishing the foundations of quantum mechanics
and plays an important role in quantum information processing
and communication~\cite{NieChu00} techniques,
such as quantum cryptography~\cite{BenBra84,Ekert91,Bennet92,BeBrMe92}.
Many authors~\cite{FucPer96,Banasz01,FucJac01,BanDev01,Barnum02
DArian03,Ozawa04,GenPar05,MiFiFi05,Maccon06,Sacchi06,BusSac06,Banasz06
BuHaHo07,CheLee12,RenFan14,FGNZ15,ShKuUe16}
have therefore discussed this trade-off,
using several different formulations.
For example,
Banaszek~\cite{Banasz01} found an inequality
between the amount of information gained
and the size of the state change,
whereas Cheong and Lee~\cite{CheLee12} found one
between the amount of information gained
and the reversibility of the state change.
These inequalities have both been
verified~\cite{SRDFM06,BaChKi08,CZXTLX14,LRHLK14}
in single-photon experiments.

Recently, we have also studied this trade-off,
deriving the allowed regions
in four types of information--disturbance plane~\cite{Terash16}.
These four information--disturbance pairs combine
one information measure, namely
the Shannon entropy~\cite{FucPer96}
or estimation fidelity~\cite{Banasz01},
with one disturbance measure, namely
the operation fidelity~\cite{Banasz01}
or physical reversibility~\cite{KoaUed99}.
The boundaries of the allowed regions
give upper and lower bounds on the information
for a given disturbance,
together with the optimal measurements that saturate the upper bounds.
The optimal measurements are different for each of the four pairs,
because the allowed regions' upper boundaries
have different curvatures
on each of the information--disturbance planes~\cite{Terash16}.

Contrary to expectations,
the allowed regions show that
measurements providing more information
do not necessarily cause larger disturbances.
This is because the allowed regions have finite areas,
i.e., for any given measurement corresponding to an interior point
of an allowed region, there always exists
another measurement that provides more information
with smaller disturbance near that point.
However, measurements that lie on the boundary of an allowed region
in the information--disturbance plane are subject to a trade-off.
Meaning that, modifying them
to increase the information obtained by moving along the boundary
also increases the disturbance according to the boundary's slope.

In this paper,
we obtain the first and second derivatives of
the disturbance with respect to the information
obtained from measurements lying on
the allowed regions' boundaries
for each of the four information--disturbance pairs.
These measurements are described by a diagonal operator
with a continuous parameter, and
applied to a $d$-level system in a completely unknown state.
For such measurements,
we calculate these derivatives to demonstrate
the slopes and curvatures of the allowed regions' boundaries,
clarifying the regions' shapes
and hence, broadening our perspective on the trade-off
between information and disturbance in quantum measurements.
In fact,
it was difficult to judge from
the allowed regions shown in Ref.~\cite{Terash16}
whether the slopes of the boundaries are finite
and whether the curvatures of the boundaries
are negative at some points.
In contrast, the first and second derivatives
obtained in this paper give
the values of the slopes and curvatures of the boundaries
to answer these questions.

The rest of this paper is organized as follows.
Section~\ref{sec:formulation} reviews the procedure
for quantifying the information and the disturbance in quantum measurements,
giving their explicit forms
for a fundamental class of measurements as functions of a certain parameter.
Section~\ref{sec:derivativePara} presents
the first and second derivatives of
the information and the disturbance for such measurements
with respect to this parameter,
while Section~\ref{sec:derivativeInfo} gives
the first and second derivatives of
the disturbance with respect to the information.
Finally, Section~\ref{sec:conclude} summarizes our results.

\section{\label{sec:formulation}Information and Disturbance}
In this section, we recall
the information and the disturbance
in quantum measurements
at the single-outcome
level~\cite{DArian03,Terash10,Terash11,Terash11b,Terash15}
and summarize the results of Ref.~\cite{Terash16}
in order for this paper to be self-contained.
Suppose we want to measure a $d$-level system
that is known to be in one of a predefined set of
pure states $\{\ket{\psi(a)}\}$,
the probability of the system being in the state $\ket{\psi(a)}$
is given by $p(a)$,
but we do not know the actual states of the system.
To study the case where no prior information about the system is available,
we assume that the set $\{\ket{\psi(a)}\}$ consists
of all possible pure states, and $p(a)$ is uniform
according to a normalized invariant measure over the pure states.

First, we quantify the amount of information
provided by a given quantum measurement~\cite{Terash16}.
An ideal quantum measurement~\cite{NieCav97} can be described by a set of
measurement operators $\{\hat{M}_m\}$~\cite{NieChu00} that satisfy
\begin{equation}
\sum_m\hcs{\hat{M}_m}=\hat{I},
\end{equation}
where $m$ denotes the outcome of the measurement
and $\hat{I}$ is the identity operator.
When the system is in state $\ket{\psi(a)}$,
a measurement $\{\hat{M}_m\}$ yields the outcome $m$ with probability
\begin{equation}
p(m|a)=\bra{\psi(a)}\hcs{\hat{M}_m}\ket{\psi(a)}
\end{equation}
and changes the state to
\begin{equation}
\ket{\psi(m,a)}=\frac{1}{\sqrt{p(m|a)}}\,\hat{M}_m\ket{\psi(a)}.
\label{eq:postState}
\end{equation}

The measurement outcome
provides some information about the system's state.
For example, given the outcome $m$,
the probability that the initial state was $\ket{\psi(a)}$
is given by
\begin{equation}
 p(a|m) =\frac{p(m|a)\,p(a)}{p(m)}
\end{equation}
using Bayes's rule, where
\begin{equation}
 p(m) =\sum_a p(m|a)\,p(a)
\end{equation}
is the total probability of the outcome $m$.
This therefore changes
the state probability distribution
from $\{p(a)\}$ to $\{p(a|m)\}$,
decreasing the Shannon entropy by
\begin{align}
  I(m)  &=\left[-\sum_a p(a)\log_2 p(a)\right] \notag \\
        &   \qquad{}-\left[-\sum_a p(a|m)\log_2 p(a|m)\right].
\label{eq:defInformation}
\end{align}
This entropy change, $I(m)$, quantifies
the amount of information provided by
a measurement $\{\hat{M}_m\}$ with outcome $m$~\cite{DArian03,TerUed07b},
and satisfies
\begin{equation}
 0\le I(m) \le\log_2d-\frac{1}{\ln2}[\eta(d)- 1],
\end{equation}
where
\begin{equation}
 \eta(n)=
\begin{cases}
       \sum^{n}_{k=1}\frac{1}{k} & \mbox{(if $n=1,2,\ldots$)} \\
        0 & \mbox{(if $n=0$)}.
    \end{cases}
\end{equation}
Note that $I(m)$ is a measure of the information
generated by a single outcome,
unlike
\begin{equation}
 I=\sum_m p(m)\,I(m),
\label{eq:avgI}
\end{equation}
which was discussed in Ref.~\cite{FucPer96}.

The measurement outcome $m$ can also be used to
estimate the system's state as $\ket{\varphi(m)}$,
where an optimal $\ket{\varphi(m)}$
is the eigenvector of $\hcs{\hat{M}_m}$
corresponding to its maximum eigenvalue~\cite{Banasz01}.
The quality of this estimate can be evaluated
in terms of the estimation fidelity $G(m)$:
\begin{equation}
 G(m) =\sum_a p(a|m)\,\bigl|\expv{\varphi(m)|\psi(a)}\bigr|^2.
\label{eq:defEstimation}
\end{equation}
This also quantifies the amount of information
provided by the outcome $m$, and satisfies
\begin{equation}
  \frac{1}{d}\le G(m) \le \frac{2}{d+1}.
\end{equation}
Again, note that $G(m)$ relates to a single outcome,
unlike
\begin{equation}
G=\sum_m p(m)\,G(m),
\label{eq:avgG}
\end{equation}
which was discussed in Ref.~\cite{Banasz01}.

Next, we quantify the degree of disturbance
caused by the measurement $\{\hat{M}_m\}$~\cite{Terash16}.
The outcome $m$ changes
the system's state from $\ket{\psi(a)}$ to $\ket{\psi(m,a)}$,
given by Eq.~(\ref{eq:postState}).
The size of this change can be evaluated
using the operation fidelity $F(m)$:
\begin{equation}
 F(m) =\sum_a p(a|m)\bigl|\expv{\psi(a)|\psi(m,a)}\bigr|^2.
\label{eq:defFidelity}
\end{equation}
This quantifies the degree of disturbance caused
when a measurement $\{\hat{M}_m\}$ yields the outcome $m$,
and satisfies
\begin{equation}
 \frac{2}{d+1}\le F(m) \le 1.
\end{equation}
Again, note that $F(m)$ relates to a single outcome,
unlike
\begin{equation}
F=\sum_m p(m)\,F(m),
\label{eq:avgF}
\end{equation}
which was discussed in Ref.~\cite{Banasz01}.

In addition to the size of the state change,
the reversibility of the change can also be used to
quantify the disturbance in the context of physically
reversible measurements~\cite{UedKit92,Imamog93,Royer94
UeImNa96,Ueda97,TerUed05,KorJor06,SuAlZu09,XuZho10,KNABHL08,KCRK09}.
Even though $\ket{\psi(a)}$ and $\ket{\psi(m,a)}$ are unknown,
the change can be physically reversed
by a reversing measurement on $\ket{\psi(m,a)}$
if $\hat{M}_m$ has a bounded left
inverse $\hat{M}_m^{-1}$~\cite{UeImNa96,Ueda97}.
Such a reversing measurement can be described by
another set of measurement operators $\{\hat{R}_\mu^{(m)}\}$ that satisfy
\begin{equation}
\sum_\mu\hat{R}^{(m)\dagger}_\mu\hat{R}^{(m)}_\mu=\hat{I}
\end{equation}
and $\hat{R}^{(m)}_{\mu_0}\propto \hat{M}_m^{-1}$
for a particular $\mu=\mu_0$,
where $\mu$ denotes the reversing measurement's outcome.
When this measurement on $\ket{\psi(m,a)}$
yields the preferred outcome $\mu_0$,
the system's state returns to $\ket{\psi(a)}$
because $\hat{R}_{\mu_0}^{(m)}\hat{M}_m\propto\hat{I}$.
The state recovery probability for
an optimal reversing measurement~\cite{KoaUed99} is
\begin{equation}
 R(m,a)=\frac{\inf_{\ket{\psi}}\, \bra{\psi}\hcs{\hat{M}_m}\ket{\psi}}{p(m|a)},
\end{equation}
and we can use this to evaluate
the reversibility of the state change as
\begin{equation}
  R(m) = \sum_a p(a|m)\,R(m,a).
\label{eq:defReversibility}
\end{equation}
This also quantifies the degree of disturbance
caused when a measurement $\{\hat{M}_m\}$
yields the outcome $m$, and satisfies
\begin{equation}
 0\le R(m) \le 1.
\end{equation}
Again, note that $R(m)$ relates to a single outcome,
unlike
\begin{equation}
R=\sum_m p(m)\,R(m),
\label{eq:avgR}
\end{equation}
which was discussed in Refs.~\cite{KoaUed99,CheLee12}.

As an important example, we consider
a diagonal measurement operator $\hat{M}^{(d)}_{k,l}(\lambda)$
with diagonal elements
\begin{equation}
  \underbrace{1,1,\ldots,1}_{k},
  \underbrace{\lambda,\lambda,\ldots,\lambda}_{l},
  \underbrace{0,0,\ldots,0}_{d-k-l}
\end{equation}
for $k=1,2,\ldots,d-1$ and $l=1,2,\ldots,d-k$,
with a parameter $\lambda$ satisfying $0\le\lambda\le1$.
In an orthonormal basis $\{\ket{i}\}$ with $i=1,2,\ldots,d$,
the measurement operator $\hat{M}^{(d)}_{k,l}(\lambda)$ can be written as
\begin{equation}
\hat{M}^{(d)}_{k,l}(\lambda)=\sum_{i=1}^{k} \ket{i}\bra{i}
                       +\sum_{i=k+1}^{k+l} \lambda \ket{i}\bra{i}.
\label{eq:measurementOp}
\end{equation}
The information that was yielded and disturbance that was caused
by this operator
can be quantified in terms of $I(m)$, $G(m)$, $F(m)$, and $R(m)$,
given by Eqs.~(\ref{eq:defInformation}), (\ref{eq:defEstimation}),
(\ref{eq:defFidelity}), and (\ref{eq:defReversibility})
as functions of the parameter $\lambda$.
Using the general formula derived in Ref.~\cite{Terash15},
$I(m)$ can be calculated to be
\begin{align}
 &I(m) = \log_2d
  -\frac{1}{\ln2}\Bigl[\eta(d)- 1\Bigr]
\notag\\
&\qquad\qquad
-\log_2\left(k+l\lambda^2\right)
+\frac{1}{k+l\lambda^2} J,
\label{eq:informationEx}
\end{align}
where $J$ is given by
\begin{align}
 & J =
(-1)^l \sum_{n=0}^{k-1}\binom{k+l-n-2}{l-1}\,
     \frac{a^{(k+l)}_n}{(\lambda^2-1)^{k+l-n-1}}
\notag\\
&\quad
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n-2}{k-1}\,
     \frac{c^{(k+l)}_n(\lambda)}{(1-\lambda^2)^{k+l-n-1}},
\label{eq:dangerousEx}
\end{align}
with coefficients
\begin{align}
a^{(j)}_n
 &= \frac{1}{\ln2}\binom{j}{n}
       \Bigl[\eta(j)- \eta(j-n)\Bigr], \label{eq:defAjn} \\
c^{(j)}_n(\lambda)
 &= \lambda^{2(j-n)}
   \left[\binom{j}{n}\log_2 \lambda^2+a^{(j)}_n\right]
\end{align}
for $n=0,1,\ldots,j$.
Likewise, $G(m)$, $F(m)$, and $R(m)$ can be
calculated to be~\cite{Terash15}
\begin{align}
 G(m) &= \frac{1}{d+1}\left(1+\frac{1}{k+l\lambda^2}\right),
         \label{eq:estimationEx} \\
 F(m) &= \frac{1}{d+1}\left[1+\frac{(k+l\lambda)^2}
                          {k+l\lambda^2}\right],
         \label{eq:fidelityEx} \\
 R(m) &= d\left(\frac{\lambda^2}{k+l\lambda^2}\right)\,\delta_{d,(k+l)}.
         \label{eq:reversibilityEx}
\end{align}

\begin{figure}
\begin{center}
\includegraphics[scale=0.52]{fig1.eps}
\end{center}
\caption{\label{fig1}
Four allowed regions for information versus disturbance for $d=4$:
(a) estimation fidelity $G(m)$ versus operation fidelity $F(m)$;
(b) estimation fidelity $G(m)$ versus physical reversibility $R(m)$;
(c) information gain $I(m)$ versus operation fidelity $F(m)$; and
(d) information gain $I(m)$ versus physical reversibility $R(m)$.
}
\end{figure
The measurement operator $\hat{M}^{(d)}_{k,l}(\lambda)$
is very important
for obtaining the allowed regions in the information--disturbance planes
by plotting all physically possible measurement operators.
We consider four different allowed regions, based on using
$I(m)$ or $G(m)$ to quantify the information and
$F(m)$ or $R(m)$ to quantify the disturbance.
Figure~\ref{fig1} shows these four allowed regions
for $d=4$ in gray~\cite{Terash16},
where the lines $(k,l)$ correspond to $\hat{M}^{(d)}_{k,l}(\lambda)$
with $0\le\lambda\le1$
and the P${}_r$'s denote
the points corresponding to the projective measurement operator of rank $r$:
\begin{equation}
\hat{P}^{(d)}_{r}=\sum_{i=1}^{r} \ket{i}\bra{i}.
\end{equation}
Clearly, $\hat{M}^{(d)}_{k,l}(0)=\hat{P}^{(d)}_{k}$,
$\hat{M}^{(d)}_{k,l}(1)=\hat{P}^{(d)}_{k+l}$,
and $\hat{P}^{(d)}_{d}=\hat{I}$.
Thus, the line $(k,l)$ connects P${}_k$ to P${}_{k+l}$
and the point P${}_d$ is at the top left corner of the plot.
In Fig.~\ref{fig1},
the upper boundaries of the allowed regions
consist of the lines $(1,d-1)$
corresponding to $\hat{M}^{(d)}_{1,d-1}(\lambda)$,
whereas the lower boundaries consist of the lines $(k,1)$
corresponding to $\hat{M}^{(d)}_{k,1}(\lambda)$ for $k=1,2,\ldots,d-1$.
Therefore,
to find the values of the slopes and curvatures of the boundaries,
we need to calculate the first and second derivatives of
the disturbance with respect to information
for $\hat{M}^{(d)}_{k,l}(\lambda)$.

The above allowed regions were obtained by considering
ideal measurements, as in Eq.~(\ref{eq:postState}),
with optimal estimates for $G(m)$.
Unfortunately, the lower boundaries can be violated by
non-ideal measurements,
which yield mixed post-measurement states
due to classical noise,
or non-optimal estimates,
which make suboptimal choices for $\ket{\varphi(m)}$.
Here, we ignore such non-quantum effects
in order to focus on the quantum nature of measurement.

\section{\label{sec:derivativePara}Derivatives with respect to $\lambda^2$}
To calculate the derivative of
the disturbance with respect to information
for $\hat{M}^{(d)}_{k,l}(\lambda)$,
we first consider the derivatives of the information and disturbance
with respect to the parameter $\lambda^2$.
For simplicity, we focus on derivatives with respect to $\lambda^2$
rather than $\lambda$ itself.
These derivatives are straightforward to calculate
because the information and the disturbance are
expressed as functions of $\lambda=\sqrt{\lambda^2}$ in
Eqs.~(\ref{eq:informationEx}), (\ref{eq:estimationEx}),
(\ref{eq:fidelityEx}), and (\ref{eq:reversibilityEx}).

However, the expression for
the derivative of $I(m)$ is quite long.
This is due to the expression for $J$ given in Eq.~(\ref{eq:dangerousEx}).
From Eq.~(\ref{eq:informationEx}),
the first derivative of $I(m)$ is
\begin{align}
 [I(m)]' &= -\frac{1}{\ln2}\left(\frac{l}{k+l\lambda^2}\right) \notag \\
         &\qquad -\frac{l}{(k+l\lambda^2)^2} J +\frac{1}{k+l\lambda^2} J',
\label{eq:dIdl}
\end{align}
where primes represent derivatives with respect to $\lambda^2$.
The first derivative of $J$ can be written as
\begin{align}
 &J'=
(-1)^l\sum_{n=0}^{k-1}\binom{k+l-n-1}{l}\,
     \frac{-l a^{(k+l)}_n}{(\lambda^2-1)^{k+l-n}}
\notag\\
&\;\;\;
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n-1}{k}\,
     \frac{k c^{(k+l)}_n(\lambda)}{(1-\lambda^2)^{k+l-n}}
\notag\\
&\;\;\;
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n-2}{k-1}\,
     \frac{(n+1)\,c^{(k+l)}_{n+1}(\lambda)}{(1-\lambda^2)^{k+l-n-1}}
\label{eq:dJdl}
\end{align}
because
\begin{equation}
 [c^{(j)}_n(\lambda)]' = (n+1)\,c^{(j)}_{n+1}(\lambda).
\end{equation}
Figure~\ref{fig2} shows $[I(m)]'$
as a function of $\lambda$ for $d=4$, for various $(k,l)$.
From this, we can observe that $[I(m)]'\le0$.
\begin{figure}
\begin{center}
\includegraphics[scale=0.6]{fig2.eps}
\end{center}
\caption{\label{fig2}
First derivative of $I(m)$ with respect to $\lambda^2$
as a function of $\lambda$,
for $\hat{M}^{(d)}_{k,l}(\lambda)$ with $d=4$, for various $(k,l)$.}
\end{figure
In addition, the second derivative of $I(m)$ is
\begin{align}
 [I(m)]''
  &=\frac{1}{\ln2}\left[\frac{l^2}{(k+l\lambda^2)^2}\right]
    +\frac{2l^2}{(k+l\lambda^2)^3} J \notag \\
  &\qquad -\frac{2l}{(k+l\lambda^2)^2} J' +\frac{1}{k+l\lambda^2}J'',
\label{eq:d2Idl2}
\end{align}
and the second derivative of $J$ can be written as
\begin{align}
 &J'' =
 (-1)^{l} \sum_{n=0}^{k-1}\binom{k+l-n}{l+1}\,
    \frac{l(l+1) a^{(k+l)}_n}{(\lambda^2-1)^{k+l-n+1}}
\notag\\
&\;\;\;
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n}{k+1}\,
   \frac{k(k+1) c^{(k+l)}_n(\lambda)}{(1-\lambda^2)^{k+l-n+1}}
\notag\\
&\;\;\;
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n-1}{k}\,
    \frac{2k(n+1)\,c^{(k+l)}_{n+1}(\lambda)}{(1-\lambda^2)^{k+l-n}}
\notag\\
&\;\;\;
+(-1)^k\sum_{n=0}^{l-1}\binom{k+l-n-2}{k-1}\,
     \frac{(n+2)(n+1)\,c^{(k+l)}_{n+2}(\lambda)}{(1-\lambda^2)^{k+l-n-1}}.
\label{eq:d2Jdl2}
\end{align}
Figure~\ref{fig3} shows $[I(m)]''$
as a function of $\lambda$ for $d=4$, for various $(k,l)$.
From this, we can observe that $[I(m)]''>0$.
\begin{figure}
\begin{center}
\includegraphics[scale=0.6]{fig3.eps}
\end{center}
\caption{\label{fig3}
Second derivative of $I(m)$ with respect to $\lambda^2$
as a function of $\lambda$,
for $\hat{M}^{(d)}_{k,l}(\lambda)$ with $d=4$, for various $(k,l)$.}
\end{figure

As shown in Appendix \ref{sec:limit0},
at $\lambda=0$,
$J$ and its derivatives become
\begin{gather}
 \lim_{\lambda\to 0} J=a^{(k)}_{k-1}, \quad
 \lim_{\lambda\to 0} J'=l a^{(k-1)}_{k-1}, \notag \\
 \lim_{\lambda\to 0} J''=
  \begin{cases}
      l(l+1) a^{(k-2)}_{k-1} & \mbox{(if $k\ge2$)} \\[5pt]
      +\infty & \mbox{(if $k=1$)},
   \end{cases}
  \label{eq:dangerAt0}
\end{gather}
where $a^{(j)}_{j+1}$ is given by
\begin{equation}
 a^{(j)}_{j+1} =\frac{1}{(j+1)\ln2}
\label{eq:defAjn2}
\end{equation}
instead of Eq.~(\ref{eq:defAjn}).
Here, $J''$ in Eq.~(\ref{eq:dangerAt0}) diverges for $k=1$
because
\begin{equation}
   \lim_{\lambda\to 0} c^{(j)}_j(\lambda)
    = \lim_{\lambda\to 0} \log_2\lambda^2+a^{(j)}_{j},
\label{eq:cjjAt0}
\end{equation}
which appears in the last sum of Eq.~(\ref{eq:d2Jdl2}) when $n=l-1$
if $k=1$.
The derivatives of $I(m)$ at $\lambda=0$ are thus
\begin{gather}
 \lim_{\lambda\to 0}\,[I(m)]'  = -\frac{l}{k^2\ln2}, \\
 \lim_{\lambda\to 0}\,[I(m)]'' =
   \begin{cases}
     \frac{l(k^2+3kl-2l)}{k^3(k-1)\ln2}
           & \mbox{(if $k\ge2$)} \\[5pt]
      +\infty & \mbox{(if $k=1$)}.
   \end{cases}
\label{eq:d2Idl2At0}
\end{gather}
Similarly, at $\lambda=1$,
$J$ and its derivatives become
\begin{gather}
 \lim_{\lambda\to 1} J=a^{(k+l)}_{k+l-1},   \quad
 \lim_{\lambda\to 1} J'=l a^{(k+l)}_{k+l}, \notag \\
 \lim_{\lambda\to 1} J''=l(l+1) a^{(k+l)}_{k+l+1},
\label{eq:dangerAt1}
\end{gather}
as shown in Appendix \ref{sec:limit1},
in which case the derivatives of $I(m)$ are
\begin{gather}
 \lim_{\lambda\to 1}\,[I(m)]'  = 0, \label{eq:dIdlAt1} \\
 \lim_{\lambda\to 1}\,[I(m)]'' = \frac{kl}{(k+l)^2(k+l+1)\ln2}.
  \label{eq:d2Idl2At1}
\end{gather}

Likewise, from Eqs.~(\ref{eq:estimationEx}), (\ref{eq:fidelityEx}),
and (\ref{eq:reversibilityEx}),
the first derivatives of $G(m)$, $F(m)$, and $R(m)$ are
\begin{align}
 [G(m)]' &= -\frac{l}{d+1}
     \left[\frac{1}{(k+l\lambda^2)^2}\right],
             \label{eq:dGdl} \\
 [F(m)]' &= \frac{kl}{d+1}
     \left[\frac{(1-\lambda)(k+l\lambda)}
                {\lambda(k+l\lambda^2)^2}\right],
             \label{eq:dFdl} \\
 [R(m)]' &= kd
    \left[\frac{1}{(k+l\lambda^2)^2} \right]\delta_{d,(k+l)},
             \label{eq:dRdl}
\end{align}
respectively.
These satisfy $[G(m)]'<0$, $[F(m)]'\ge0$, and $[R(m)]'\ge0$.
Note that $[R(m)]'$ is proportional to $[G(m)]'$
with a non-positive proportionality constant, i.e.,
$[R(m)]'=\alpha[G(m)]'$ with
\begin{equation}
\alpha=-\frac{kd(d+1)}{l}\delta_{d,(k+l)}.
\label{eq:propConst}
\end{equation}
In addition,
the second derivatives of $G(m)$, $F(m)$, and $R(m)$ are
\begin{align}
 [G(m)]'' &= \frac{2l^2}{d+1}
    \left[\frac{1}{(k+l\lambda^2)^3}\right],
             \label{eq:d2Gdl2} \\
 [F(m)]'' &= -\frac{kl}{2(d+1)}  \notag \\
    &\quad {}\times\left[
    \frac{(k+l\lambda^2)^2+4l\lambda^2(1-\lambda)(k+l\lambda)}
     {\lambda^3(k+l\lambda^2)^3}\right],
             \label{eq:d2Fdl2} \\
 [R(m)]'' &=  -2kld
     \left[\frac{1}{(k+l\lambda^2)^3}\right]\delta_{d,(k+l)},
             \label{eq:d2Rdl2}
\end{align}
respectively.
These satisfy $[G(m)]''>0$, $[F(m)]''<0$, and $[R(m)]''\le0$,
and $[R(m)]''$ is proportional to $[G(m)]''$
with the same proportionality constant $\alpha$,
given in Eq.~(\ref{eq:propConst}).

\begin{table}
\caption{\label{tbl1}
Signs of the first and second derivatives of the information and disturbance
with respect to $\lambda^2$.}
\begin{center}
\begin{tabular}{cccc}
\hline\noalign{\smallskip}
               &          & \multicolumn{2}{c}{derivative} \\
\noalign{\smallskip}\cline{3-4}\noalign{\smallskip}
               & function & first & second  \\
\noalign{\smallskip}\hline\noalign{\smallskip}
  information  & $I(m)$   & $-$ & $+$ \\
               & $G(m)$   & $-$ & $+$ \\
\noalign{\smallskip}\hline\noalign{\smallskip}
  disturbance  & $F(m)$   & $+$ & $-$ \\
               & $R(m)$   & $+$ & $-$ \\
\noalign{\smallskip}\hline
\end{tabular}
\end{center}
\end{table}
The signs of the derivatives of $I(m)$, $G(m)$, $F(m)$, and $R(m)$
are summarized in Table~\ref{tbl1}.
These signs mean that
when $\lambda^2$ is increased,
$I(m)$ and $G(m)$ decrease while $F(m)$ and $R(m)$ increase.
This is a trade-off between the information and the disturbance
for $\hat{M}^{(d)}_{k,l}(\lambda)$.

\section{\label{sec:derivativeInfo}Derivatives with respect to information}
Using the derivatives of the information and disturbance
with respect to $\lambda^2$,
we can now calculate the derivative of the disturbance
with respect to information for $\hat{M}^{(d)}_{k,l}(\lambda)$.
Let $f$ and $g$ be arbitrary functions of $\lambda$.
Given the derivatives of $f$ and $g$ with respect to $\lambda^2$,
the first and second derivatives of $f$ with respect to $g$ are
\begin{equation}
 \frac{df}{dg} = \frac{f'}{g'}, \quad
 \frac{d^2f}{dg^2} = \frac{f'' g'-f' g''}{(g')^3}.
\end{equation}
The same results can be obtained
using derivatives with respect to $\lambda$.

\begin{figure}
\begin{center}
\includegraphics[scale=0.52]{fig4.eps}
\end{center}
\caption{\label{fig4}
First derivatives of the disturbance with respect to information
for $d=4$, for the four information--disturbance pairs:
(a) estimation fidelity $G(m)$ and operation fidelity $F(m)$;
(b) estimation fidelity $G(m)$ and physical reversibility $R(m)$;
(c) information gain $I(m)$ and operation fidelity $F(m)$; and
(d) information gain $I(m)$ and physical reversibility $R(m)$.
}
\end{figure
\begin{figure}
\begin{center}
\includegraphics[scale=0.52]{fig5.eps}
\end{center}
\caption{\label{fig5}
Second derivatives of the disturbance with respect to information
for $d=4$, for the four information--disturbance pairs:
(a) estimation fidelity $G(m)$ and operation fidelity $F(m)$;
(b) estimation fidelity $G(m)$ and physical reversibility $R(m)$;
(c) information gain $I(m)$ and operation fidelity $F(m)$; and
(d) information gain $I(m)$ and physical reversibility $R(m)$.
}
\end{figure
From Eqs.~(\ref{eq:dGdl}), (\ref{eq:dFdl}), (\ref{eq:d2Gdl2}),
and (\ref{eq:d2Fdl2}),
the first and second derivatives of $F(m)$ with respect to $G(m)$
can be calculated to be
\begin{align}
 \frac{dF(m)}{dG(m)} &=
    -k\left[\frac{(1-\lambda)(k+l\lambda)}{\lambda}\right],
   \label{eq:dFdG} \\
 \frac{d^2F(m)}{dG(m)^2} &=
    -\frac{k(d+1)}{2l}\left[\frac{(k+l\lambda^2)^3}{\lambda^3}\right].
   \label{eq:d2FdG2}
\end{align}
Figures \ref{fig4}(a) and \ref{fig5}(a) show these derivatives
as functions of $G(m)$ [Eq.~(\ref{eq:estimationEx})]
for $d=4$, for various $(k,l)$.
Because $\lambda=0$ corresponds to P${}_{k}$ and
$\lambda=1$ corresponds to P${}_{k+l}$ for
the lines $(k,l)$ in Fig.~\ref{fig1},
the derivatives become
\begin{equation}
 \lim_{\lambda\to 0}\, \frac{dF(m)}{dG(m)} = -\infty, \quad
 \lim_{\lambda\to 0}\, \frac{d^2F(m)}{dG(m)^2} =  -\infty
\end{equation}
at P${}_{k}$ and
\begin{equation}
 \lim_{\lambda\to 1}\, \frac{dF(m)}{dG(m)} = 0, \quad
 \lim_{\lambda\to 1}\, \frac{d^2F(m)}{dG(m)^2} = -\frac{k(k+l)^3(d+1)}{2l}
\end{equation}
at P${}_{k+l}$.
The first derivative of $F(m)$ with respect to $G(m)$ [Eq.~(\ref{eq:dFdG})]
is non-positive and
the second derivative [Eq.~(\ref{eq:d2FdG2})] is negative,
which means that
all the lines $(k,l)$ in Fig.~\ref{fig1}(a) are
monotonically-decreasing convex curves.

In contrast,
from Eqs.~(\ref{eq:dGdl}), (\ref{eq:dRdl}), (\ref{eq:d2Gdl2}),
and (\ref{eq:d2Rdl2}),
the first and second derivatives of $R(m)$ with respect to $G(m)$
are constant:
\begin{align}
 \frac{dR(m)}{dG(m)} &=
    -\frac{kd(d+1)}{l},  \label{eq:dRdG} \\
 \frac{d^2R(m)}{dG(m)^2} &= 0  \label{eq:d2RdG2}
\end{align}
if $k+l=d$, and both derivatives are zero if $k+l\neq d$.
Figures \ref{fig4}(b) and \ref{fig5}(b) show
these derivatives as functions of $G(m)$ for $d=4$, for various $(k,l)$
satisfying $k+l=d$.
The first derivative of $R(m)$ with respect to $G(m)$ [Eq.~(\ref{eq:dRdG})]
is negative and
the second derivative [Eq.~(\ref{eq:d2RdG2})] is zero,
which means that all the lines $(k,l)$ in Fig.~\ref{fig1}(b) are
monotonically-decreasing straight lines.

Similarly,
from Eqs.~(\ref{eq:dIdl}), (\ref{eq:d2Idl2}), (\ref{eq:dFdl}),
and (\ref{eq:d2Fdl2}),
the first and second derivatives of $F(m)$ with respect to $I(m)$ are
\begin{align}
 \frac{dF(m)}{dI(m)} &= \frac{[F(m)]'}{[I(m)]'}, \label{eq:dFdI}  \\
 \frac{d^2F(m)}{dI(m)^2} &= \frac{[F(m)]''[I(m)]'-[F(m)]'[I(m)]''}
           {\left\{[I(m)]'\right\}^3}. \label{eq:d2FdI2}
\end{align}
Figures \ref{fig4}(c) and \ref{fig5}(c) show these derivatives
as functions of $I(m)$ [Eq.~(\ref{eq:informationEx})]
for $d=4$, for various $(k,l)$.
At P${}_{k}$, they become
\begin{equation}
 \lim_{\lambda\to 0}\, \frac{dF(m)}{dI(m)} = -\infty, \quad
 \lim_{\lambda\to 0}\, \frac{d^2F(m)}{dI(m)^2} = -\infty
\end{equation}
because
\begin{equation}
\lim_{\lambda\to 0}\,[F(m)]' = \infty, \quad
 \lim_{\lambda\to 0}\, [F(m)]'' = -\infty.
\end{equation}
Note that the numerator of Eq.~(\ref{eq:d2FdI2})
goes to positive infinity as $\lambda\to0$
when $[I(m)]'<0$
because $[F(m)]''$ diverges faster than $[F(m)]'$.
In contrast, in the limit as $\lambda\to1$,
Eqs.~(\ref{eq:dFdI}) and (\ref{eq:d2FdI2})
yield the indeterminate form $0/0$
due to Eq.~(\ref{eq:dIdlAt1}) and
\begin{equation}
  \lim_{\lambda\to 1}\,[F(m)]' =0.
\label{eq:dFdlAt1}
\end{equation}
However,
by applying L'H{\^o}pital's rule and considering higher derivatives,
we can find that
\begin{gather}
 \lim_{\lambda\to 1}\, \frac{dF(m)}{dI(m)}
  = -\frac{(k+l)(k+l+1)\ln2}{2(d+1)}, \label{eq:dFdIAt1} \\
 \lim_{\lambda\to 1}\, \frac{d^2F(m)}{dI(m)^2}
  = \begin{cases}
      +\infty & \mbox{(if $k<l$)} \\[5pt]
      -\frac{k(2k+1)^3}{(2k+3)(d+1)} (\ln2)^2 & \mbox{(if $k=l$)} \\[5pt]
      -\infty  & \mbox{(if $k>l$)}
   \end{cases}
 \label{eq:d2FdI2At1}
\end{gather}
at P${}_{k+l}$, as shown in Appendix \ref{sec:LHopital}.
The first derivative of $F(m)$ with respect to $I(m)$
[Fig.~\ref{fig4}(c)] is negative,
and the second derivative [Fig.~\ref{fig5}(c)] is always negative if $k\ge l$
but can be positive near P${}_{k+l}$ if $k<l$.
This means that
the lines $(k,l)$ in Fig.~\ref{fig1}(c) are
monotonically-decreasing convex curves if $k\ge l$
but monotonically-decreasing S-shaped curves if $k<l$.
In particular,
even though it is difficult to see from Fig.~\ref{fig1}(c),
the upper boundary $(1,d-1)$ has a slight dent near P${}_d$
when $d\ge3$~\cite{Terash16}.

Finally, from Eqs.~(\ref{eq:dIdl}), (\ref{eq:d2Idl2}), (\ref{eq:dRdl}),
and (\ref{eq:d2Rdl2}),
the first and second derivatives of $R(m)$ with respect to $I(m)$ are
\begin{align}
 \frac{dR(m)}{dI(m)} &= \frac{[R(m)]'}{[I(m)]'}, \label{eq:dRdI} \\
 \frac{d^2R(m)}{dI(m)^2} &= \frac{[R(m)]''[I(m)]'-[R(m)]'[I(m)]''}
           {\left\{[I(m)]'\right\}^3}.      \label{eq:d2RdI2}
\end{align}
Figures \ref{fig4}(d) and \ref{fig5}(d) show these derivatives
as functions of $I(m)$ for $d=4$, for various $(k,l)$
satisfying $k+l=d$.
(Both derivatives are zero if $k+l\neq d$.)
When $k+l=d$, they become
\begin{gather}
 \lim_{\lambda\to 0}\, \frac{dR(m)}{dI(m)} = -\frac{kd\ln2}{l}, \\
 \lim_{\lambda\to 0}\, \frac{d^2R(m)}{dI(m)^2}
  =\begin{cases}
     \frac{k^3}{k-1}\left(\frac{d\ln2}{l}\right)^2
           & \mbox{(if $k\ge2$)} \\[5pt]
      +\infty & \mbox{(if $k=1$)}
   \end{cases}
 \label{eq:dRdIAt0}
\end{gather}
at P${}_{k}$, and
\begin{equation}
 \lim_{\lambda\to 1}\, \frac{dR(m)}{dI(m)} = -\infty, \quad
 \lim_{\lambda\to 1}\, \frac{d^2R(m)}{dI(m)^2} = +\infty
 \label{eq:dRdIAt1}
\end{equation}
at P${}_{k+l}$.
In Eq.~(\ref{eq:dRdIAt0}), the second derivative diverges for $k=1$
because of the corresponding result in Eq.~(\ref{eq:d2Idl2At0}),
and the divergences seen in Eq.~(\ref{eq:dRdIAt1})
likewise come from Eq.~(\ref{eq:dIdlAt1}).
Note that
\begin{equation}
 \lim_{\lambda\to 1}\, \frac{1}{[I(m)]'} =-\infty
\label{eq:invdIdlAt1}
\end{equation}
because $[I(m)]'$ tends to zero from below,
as shown in Fig.~\ref{fig2}.
The first derivative of $R(m)$ with respect to $I(m)$
[Fig.~\ref{fig4}(d)] is negative
and the second derivative [Fig.~\ref{fig5}(d)] is positive,
which means that
all the lines $(k,l)$ in Fig.~\ref{fig1}(d) are
monotonically-decreasing concave curves.

\begin{table}
\caption{\label{tbl2}
Signs of the first and second derivatives of the disturbance
with respect to information.}
\begin{center}
\begin{tabular}{cccc}
\hline\noalign{\smallskip}
                &             & \multicolumn{2}{c}{derivative} \\
\noalign{\smallskip}  \cline{3-4}\noalign{\smallskip}
    disturbance & information & first & second  \\
\noalign{\smallskip}\hline\noalign{\smallskip}
       $F(m)$  &  $G(m)$  & $-$ & $-$ \\
       $R(m)$  &  $G(m)$  & $-$ & $0$ \\
       $F(m)$  &  $I(m)$  & $-$ & $\pm$ \\
       $R(m)$  &  $I(m)$  & $-$ & $+$ \\
\noalign{\smallskip}\hline
\end{tabular}
\end{center}
\end{table}
The signs of the derivatives for
the four information--disturbance pairs
are summarized in Table~\ref{tbl2}.
All the first derivatives have negative signs,
which implies that
there is a trade-off between the information and the disturbance
for each of the four pairs.
In contrast,
the second derivatives have different signs,
which implies that
the optimal measurements are different
for each of the four pairs~\cite{Terash16}.

\section{\label{sec:conclude}Conclusion}
In this paper, we have obtained the first and second derivatives
of the disturbance with respect to information
for a class of quantum measurements
described by the measurement operator $\hat{M}^{(d)}_{k,l}(\lambda)$
[Eq.~(\ref{eq:measurementOp})].
When the measurement performed on a $d$-level system
in a completely unknown state yields a single outcome $m$,
the information is quantified by
the Shannon entropy $I(m)$ [Eq.~(\ref{eq:informationEx})] and
the estimation fidelity $G(m)$ [Eq.~(\ref{eq:estimationEx})],
while the disturbance is quantified by
the operation fidelity $F(m)$ [Eq.~(\ref{eq:fidelityEx})] and
the physical reversibility $R(m)$ [Eq.~(\ref{eq:reversibilityEx})].
In these four information--disturbance planes,
$\hat{M}^{(d)}_{k,l}(\lambda)$ with $0\le\lambda\le1$
corresponds to a line $(k,l)$, as shown in Fig.~\ref{fig1}.
In particular,
the lines $(1,d-1)$ and $(k,1)$
form the boundaries of the allowed regions
obtained by plotting
all physically possible measurement operators
in these planes~\cite{Terash16}.

The slope and curvature of each line $(k,l)$ are given by
the first and second derivatives of
the disturbance with respect to the information
for $\hat{M}^{(d)}_{k,l}(\lambda)$.
For these four information--disturbance pairs,
the first derivatives are given by
Eqs.~(\ref{eq:dFdG}), (\ref{eq:dRdG}), (\ref{eq:dFdI}), and (\ref{eq:dRdI})
(shown for $d=4$ in Fig.~\ref{fig4}),
while the second derivatives are given by
Eqs.~(\ref{eq:d2FdG2}), (\ref{eq:d2RdG2}), (\ref{eq:d2FdI2}),
and (\ref{eq:d2RdI2})
(shown for $d=4$ in Fig.~\ref{fig5}).
For the derivative of $F(m)$ with respect to $G(m)$,
all the lines $(k,l)$ in Fig.~\ref{fig1}(a)
are monotonically-decreasing convex curves,
because the first and second derivatives are
non-positive and negative, respectively,
as shown in Figs.~\ref{fig4}(a) and \ref{fig5}(a).
For the derivative of $R(m)$ with respect to $G(m)$,
all the lines $(k,l)$ in Fig.~\ref{fig1}(b)
are monotonically-decreasing straight lines,
because the first and second derivatives are
negative and zero, respectively,
as shown in Figs.~\ref{fig4}(b) and \ref{fig5}(b).
For the derivative of $F(m)$ with respect to $I(m)$,
the lines $(k,l)$ in Fig.~\ref{fig1}(c) are
monotonically-decreasing convex curves if $k\ge l$
and monotonically-decreasing S-shaped curves if $k<l$,
because the first derivative is negative and
the second derivative is always negative if $k\ge l$
but can be positive near P${}_{k+l}$ if $k<l$,
as shown in Figs.~\ref{fig4}(c) and \ref{fig5}(c).
Finally, for the derivative of $R(m)$ with respect to $I(m)$,
all the lines $(k,l)$ in Fig.~\ref{fig1}(d)
are monotonically-decreasing concave curves,
because the first and second derivatives are
negative and positive, respectively,
as shown in Figs.~\ref{fig4}(d) and \ref{fig5}(d).
See also Table~\ref{tbl2} for a summary of
the signs of the derivatives.

Based on these results, we can see that
the boundaries $(1,d-1)$ and $(k,1)$
of the allowed regions have non-positive slopes
for all four information--disturbance pairs,
indicating that
there is a trade-off between the information and the disturbance
for measurements on their boundaries.
When the information is increased by moving along a boundary,
the disturbance also increases, decreasing $F(m)$ and $R(m)$.
In addition, the rate of change of the disturbance with respect to
information is given by the boundary's slope.
For example,
if $G(m)$ is increased by $\Delta G(m)$,
$F(m)$ decreases by about
\begin{equation}
  \Delta F(m)= \left|\frac{dF(m)}{dG(m)}\right|\Delta G(m).
\end{equation}
Figure \ref{fig4}(a) shows that
$\left|dF(m)/dG(m)\right|$
is infinitely large near P${}_{1}$,
but almost zero near P${}_{d}$.

In contrast,
the curvatures of the boundaries $(1,d-1)$ and $(k,1)$
for the four information--disturbance pairs have
different signs.
This means that
the allowed regions are extended in different ways
when the information and disturbance
are averaged over all possible outcomes,
as with $I$, $G$, $F$, and $R$,
given by Eqs.~(\ref{eq:avgI}), (\ref{eq:avgG}),
(\ref{eq:avgF}), and (\ref{eq:avgR}),
because the allowed regions for the average values
are the convex hulls of those for a single outcome~\cite{Terash16}.
The upper boundaries
of the allowed regions for the average values
correspond to the optimal measurements that saturate
the upper information bounds for a given disturbance.
Consequently, the optimal measurements are different
for each of the four information--disturbance pairs~\cite{Terash16}.

redpajama_set_name: RedPajamaArXiv


text:
'No fee' was to be charged for their services: Amateur athletics advisors in 1935. Part 1. Coaches and Administrators.
Posted by Dave Day | Jun 22, 2017 | Athletics | 0
Resistance to the use of professional coaches in British athletics during the first half of the twentieth century has been well documented[1] and an ongoing preference for amateur coaching from one's peers was clearly evident in the year before the Berlin Olympics. In February 1935, a number of amateur coaches were appointed to instruct at the Loughborough summer school for athletics, including R. St. G. Harper for hurdles, J. Cotter for the javelin, J.E. Lovelock for running events, M.C. Noakes for the hammer, R.L. Howland for the shot put, and R.W. Revans for the long jump.[2] Howland was a classics don at Cambridge and holder of the English Native shot put record from 1930-49. In the 1928 Olympics he was 20th and he won silver in the 1930 and 1934 Empire Games. Revans had competed at the 1928 Games in long jump (32nd) and won medals in long and triple jumps at the 1930 Empire Games. Having studied astrophysics at Cambridge he won a scholarship to Michigan before returning to Cambridge as a fellow. During his lifetime, he worked with five Nobel winners and he later became the first professor of industrial management at the University of Manchester.
Figure 1. The winner of the long jump in the inter-college competition at Cambridge: R.W. Revans who cleared 21ft 9in for Emmanuel. Illustrated Sporting and Dramatic News, Saturday 15 February 1930, 5.
All six men appeared again later that year in a list of amateur athletes and officials willing to give talks, lectures and demonstrations to clubs and schools (see Table 1). Being keen amateurs and volunteers, no fee was to be charged for their services, although it was expected that out-of-pocket expenses would be met. Applications for their services were to be made directly to them and they should be informed of any facilities available for showing films and/or slides. Clubs were reminded that the AAA's films and slides could be loaned to illustrate lectures given by people who were not on the list.[3]
Table 1. List of Volunteer Lecturers, Manchester Guardian December 13, 1935, 3
In many ways the composition of this list reflected the traditional profiles for amateur coaches in this period who came from educational institutions, the armed forces, medicine, law and finance, as well as other non-professional middle-class occupations. For these men, coaching was a hobby and they lacked the resources and knowledge to be able to match their coaching counterparts in America, who were career coaches dedicated to producing Olympic victories. Many of them also acted as administrators, diluting further the time that they could devote to coaching. Ernest Neville was honorary secretary of Surrey Walking Club and president of the Race Walking Association (RWA) from 1920-22 while William Palmer, who was on the Southern Committee of the AAA, was president of Herne Hill Harriers between 1921-22 and a walking judge at the 1936 and 1948 Games.[4] Herbert Pash was honorary secretary of Essex County Cycling and Athletic Association from 1908 to 1920 and then chairman. He was made AAA life vice president in 1934 and president of London Athletic Club in 1935.[5]
Figure 2. H.F. Pash
Some of these men were also involved in Olympic administration. John Wadmore was manager of the 1928 Olympic Team, while Arthur Turk, known as the 'Grand Old Man' of British athletics and a life vice-president of the AAA, was in charge of the 1932 and 1936 Olympic teams.[6]
Figure 3 A.S. Turk
Figure 4 J.F. Wadmore
Frederick Hulford was the world's most respected authority on starting. He was chief starter at the 1934 Empire Games and the 1948 Olympics, and he also coached the starters for the 1952 and 1956 Games. Denis Lyons was the first chairman of Gloucestershire AAA in 1925, president of Midland Counties, and an international referee at Amsterdam and at the 1930 Empire Games.[7]
Figure 5. Dennis Lyons
Despite their amateur status it would be a mistake to assume that there was a lack of vision among this group about how coaching should be organised and what the future might be. Joseph McPhail became secretary of the Southern Counties Coaching Committee after World War I and organised Essex Young Athletes Courses, along with Pash and Turk, as well as sitting on the Essex Coaching Committee, chaired by Kenneth Duncan. Arthur Lewis was on the list of honorary coaches for the West Midlands at Loughborough summer school in 1947 and by 1960 he was a lecturer at Loughborough.[8] Malcolm Noakes served as chair of the AAA coaching committee, while George Pallett, a president of Herne Hill Harriers, was a fully qualified AAA coach at all field events.[9]
Perhaps the most influential individual in the long run was Roland Harper, who represented Oxford vs. Cambridge in both high and low hurdles and was a finalist at the 1930 Empire Games and a semi-finalist at 1932 Olympics. The director of physical education at Manchester University, he was instrumental in setting up Christie Athletic Club with Leeds, Liverpool and Manchester Universities in 1950 and he was a driving force in the introduction of the AAA coaching scheme on 12th October 1946. Harper initially served as Honorary Secretary before succeeding Noakes as chair of the Coaching Committee that appointed professional Geoff Dyson as AAA chief coach on 17th February 1947. It was this appointment that paved the way for the engagement of further professional national coaches and, despite the trials and tribulations of the next few years, Harper can be viewed as something of a visionary in terms of British athletics coaching.[10]
Article © Dave Day
[1] See Day, D. (2017). The British Athlete "is born not made" Transatlantic Tensions over Sports Coaching. Journal of Sport History, 44(1), 20-34; Day, D. (2013). 'America's 'Mysterious "Training Tables"': British Reactions and Amateur Hypocrisy'. Sport in History, 34(1), 90-112; Day, D. (2012). 'Massaging the Amateur Ethos: Professional Coaches at Stockholm in 1912'. Sport in History 32(2), 157-182.
[2] Yorkshire Post and Leeds Intelligencer, Tuesday 5 February 1935, 19.
[3] List of Volunteer Lecturers, Manchester Guardian, 13 December 1935, 3.
[4] Illustrated Police News, Thursday 20 May 1915, 10.
[5] Chelmsford Chronicle, Friday 17 August 1945, 5.
[6] Star Green 'un, Saturday 10 August 1957, 8.
[7] Gloucestershire Echo, Saturday 10 August 1940, 3; Evening Despatch, Friday 9 August 1940, 5; Birmingham Daily Gazette, Thursday 8 August 1940, 3; Birmingham Daily Post, Thursday 8 August 1940, 4; Birmingham Mail, Wednesday 7 August 1940, 5.
[8] Western Times, Friday 8 September 1933, 10.
[9] Dorking and Leatherhead Advertiser, Friday 2 June 1939, 2.
[10] Achilles Report 1989; for a more detailed discussion see Day, D. and Carpenter, T. (2016). A History of Sports Coaching in Britain. (London: Routledge).
PreviousOn This Week – 19th June 2017
NextSTAPS International Review of Sport Science and Physical Education in France – Special Bilingual Edition –
Dave Day
Dave Day is Professor of Sports History at Manchester Metropolitan University where he leads the International Sports and Leisure History (SpLeisH) research team. He has published extensively on nineteenth- and twentieth-century sport, especially in the areas of coaching, training and the history of swimming families. Dave is particularly interested in the notion of 'history from below', the understanding of social and cultural history through the lives of working- and middle-class individuals rather than through grand narratives and the lives of the nation's elite.
Mussabini Myths: Lacking Wisdom
Sam Fritty: A Life in Athletics and Trotting
Running under the Roof: A Century of Indoor Athletics in England
In Leaps and Bounds
Bertha Crowther: GB's First Pentathlon Champion


New figures released by the Private Residential Tenancies Board (PRTB) show that the average cost of rent in County Wicklow has increased for the first time since the end of the boom.
The cost of rent recorded a moderate increase of 1.3% — rising from €811 at the beginning of 2013, to €822 at the end of the year.
Nationally, rents rose by 3.3% in 2013, with a 5.2% rise in apartment rents and a 1.6% rise for houses.
The findings, which are compiled by the ESRI, reflect actual rents being paid, as opposed to the advertised rent price.
Around the county, Wicklow Town, Blessington, Bray and Greystones all saw increases in the cost of rent.
However, rents in Arklow, Baltinglass, Delgany, Kilcoole, Newtown and Rathnew all continued on a downward trajectory.
Rents in Dublin rose 7.6%, squeezing renters in the capital and putting pressure on rents in Bray and Greystones.
Below is a table of annualised average rents from the PRTB.


text:
Home / Lifestyle / Atlantic U.K. Co-President Ed Howard on Ed Sheeran's Rise From Couch Crasher to Global Superstar
Atlantic U.K. Co-President Ed Howard on Ed Sheeran's Rise From Couch Crasher to Global Superstar
Not much is left to chance in an Ed Sheeran campaign these days, but his label deal actually sprang from a random encounter.
Call it a tale of two Eds: Ed Howard, then head of A&R for Atlantic imprint Asylum Records, first met the superstar singer-songwriter at a 2010 Bruno Mars gig in London. They got chatting and Sheeran, who famously didn't have his own place at the time, ended up crashing on Howard's couch and playing him some of his songs.
Howard duly signed him to Asylum – at a time when most labels had already passed on Sheeran at least once – and has been there every step of the way as Sheeran became one of the most successful artists in the world.
Howard has also stepped up – he's now co-president of Atlantic U.K., alongside Briony Turner – and has a roster bursting with hit artists including Anne-Marie, Maisie Peters, Joel Corry and Tion Wayne. He continues to A&R Sheeran, and is recognized in Variety's Hitmakers issue for his work on Sheeran's monster hit, "Shivers."
To celebrate, Variety caught up with Howard in London to talk about his working relationship with the man he calls "the best songwriter of this century."
You've worked with Ed for a long time now. How much A&R-ing does he actually need these days?
Ed's always asked people for their opinions, not just someone who's nominally working as an A&R. He plays a lot of music to a lot of people – friends, family, musicians, songwriters – in the run-up to decisions he needs to make musically. It's a real strength of his. He's very open-minded and inquisitive, and that's really helped him in his career. There's a big part of A&R which is about encouragement and being a sounding board and Ed's coming with ideas all the time. When he asks your opinion, he's asking it genuinely of people that he trusts, it's not lip service. He's always appreciative and respectful, but very much able to say, "No, I've made this decision for these reasons," and that's a very healthy trait.
Do you wish all artists were like that?
It is a bit of a dream, which doesn't mean it's easy or smooth sailing, because how could it be, otherwise everyone would do it! It's definitely a career highlight and a huge pleasure – he's a lovely man.
Ed's been the U.K.'s most consistent hitmaker of recent years. What's his secret?
He's writing songs at all times. If you're that focused on a particular craft and you bring that much talent to it – he says it's not talent at all, he says he's just done it loads! Obviously, I don't agree with that, but he has worked on it. If you're trying to make music that travels round the world, you do have to write a certain amount of songs to find three or four exceptional ones. You've got to put the work in, in terms of trying different things, being open-minded and pushing your boundaries. And obviously there's a huge component of innate musical talent and understanding that he brings to it.
He also collaborates with a huge range of artists…
He went from a Christmas record with Elton John through to Fireboy DML, Taylor Swift, Camila Cabello and then "Bad Habits" at the BRITs with Bring Me the Horizon… That's a unique cross-section of artists. I don't think anyone else could touch those artists credibly. It's remarkable.
Do you tailor your A&R approach to each artist?
Absolutely. You've got to think what each artist needs, and it changes so much. Ed was 18 when I met him, and he needs different things now to then. Often, over time, artists naturally need less input. They grow more confident, meet more people and make more decisions about people they do and don't want to work with. When they start, often we're making introductions and helping that person. Everyone needs different levels of encouragement versus reality versus ideas and help musically versus editing. But we definitely try and keep it positive, because we want artists functioning in a healthy headspace and knowing they've got the support of their team.
Where does music discovery happen these days?
On a lot of different platforms. It's important to understand the potency of friend recommendation and peer-to-peer sharing, and that side of it that happens before and during the work that artists do with TikTok, Shorts, Reels and DSPs. That kind of activity is super-important in terms of musical discovery and understanding that it's not just about a song. If an artist is trying to build their fanbase, it won't be the song that creates the fan on its own. It'll be something else that the artist does, like a piece of content that goes viral. If you're getting it right, the music creates a backdrop for other things. And I don't think that devalues the music in any way. It just shines a light on the creator at the center of the conversation. If you think about Madonna or Elvis Presley, they're not just about the music, and yet they're timeless, immortal musicians.
What's the most pressing music industry issue that your field is facing right now?
[The U.K. has] got to get back to music that [we can] export. Now I'm seeing our artists travel again, I see Mahalia, Maisie Peters and Fred Again playing sold-out shows and think, "Clearly, [the pandemic] cutting that off for a couple of years wasn't helpful, but actually when they're on the ground there, it still feels really exciting and meaningful." So I'm hoping that, even though we've got competition from amazing musicians from Latin America, Korea and other parts of the world, we can and we will get back to that.


Home» Jesse Walter Tutorials » Unreal Development Tutorial 05- UDK Basics Creating a package, adding static meshes, and changing the material on the static mesh.
Unreal Development Tutorial 05- UDK Basics Creating a package, adding static meshes, and changing the material on the static mesh.
In this video we will be covering the basics of UDK. Creating a package, adding static meshes, and changing the material on the static mesh. This video is for educational use only. Unreal Development Kit is a product of Epic Games. Epic, Epic Games, the Epic Games logo, Unreal, Unreal Engine, Unreal Technology, the Unreal Technology logo, and the Circle-U logo are trademarks or registered trademarks of Epic Games, Inc., in the United States of America and elsewhere. Other brands or product names are the trademarks of their respective owners.


Build up sand dunes which reduce wave erosion.
Speed recovery of dunes after storms.
Grow in the hostile coastal environment.
Withstand excessive damage from people, stock or vehicles.
Tolerate introduction of unsuitable exotic plants.
Pingao (foreground) and spinifex are able to tolerate the harsh front dune environment and are important sand-binding plants.
In many coastal areas, introduced species have been planted to stabilise or beautify dunes.
Unfortunately these species aren't as effective at dune protection as native plants, and they can sometimes make erosion worse.
Many introduced species have also become a problem as they can over-run large areas and threaten native species.
Some of the problem species are agapanthus, exotic iceplant, purple groundsel, prickly pear, daisies, acacia, boneseed, coastal banksia, freesias, kikuyu grass and acacia.
Purple groundsel. Exotic ice plant.
Removing invasive introduced plants and replacing them with natives.
Contact the Northland Regional Council for removal techniques and suitable replacement plants.
Dunes can be replanted to encourage natural processes, if there's enough space between the beach and buildings or roads.
Replanting can also re-establish important native plants that have become critically rare in some areas – like spinifex and pingao – and restore the natural character and values of an area.
Keep in mind that some areas are naturally unstable and are valued environments just as they are. Before you commit to a project that's trying to address dune stability, take a stroll along the beach and think about the natural coastal processes that are at work.
Northland CoastCare groups carry out dune restoration projects to protect and enhance native vegetation and replant it where necessary.
If you're planning a replanting project, get in touch with the Northland Regional Council for advice and to find out what's going on in your area.


text:
Q: Rails validation that one value does not equal another Is there a way to validate that one text_field does not equal another before saving record? I have two text_fields with integers in them and they cannot be identical for record to be valid.

A: In your model:
validate :text_fields_are_not_equal

def text_fields_are_not_equal
  self.errors.add(:base, 'Text_field1 and text_field2 cannot be equal.') if self.text_field1 == self.text_field2
end

A: You can add a custom validation:
class Something
  validate :fields_a_and_b_are_different

  def fields_a_and_b_are_different
    if self.a == self.b
      errors.add(:a, 'must be different to b')
      errors.add(:b, 'must be different to a')
    end
  end

That will be called every time your object is validated (either explicitly or when you save with validation) and will add an error to both of the fields. You might want an error on both fields to render them differently in the form.
Otherwise you could just add a base error:
errors.add(:base, 'a must be different to b')

A: more fun:
  validates :a, exclusion: { in: ->(thing) { [thing.b] } }

Though of course this isn't terribly readable, but it's elegant - we're leveraging the exclusion validation with a proc to prevent the values from being equal.  A more verbose approach might be preferred by some, but I'm a fan of brevity - code that doesn't exist can't have bugs.  Plus, this will get its error message the default rails location, which may be convenient for i18n purposes.
(better?)

redpajama_set_name: RedPajamaStackExchange


Austin (GistCloud) – The State of Texas became the nation's largest state to implement a mandatory electronic court filing (e-filing) system aimed at digitizing court filings. Beginning Jan. 1, civil cases filed in the state's 10 most populous counties (Bexar, Collin, Dallas, Denton, El Paso, Fort Bend, Harris, Hidalgo, Tarrant and Travis) and all case types in the Supreme Court, Court of Criminal Appeals and 14 appellate courts, must be filed electronically. Every six months, more counties will make the change from paper to digital until all courts throughout the state are e-filing for civil cases by 2016.
In 2014, Texas' e-filing system known as eFileTexas and available at www.efiletexas.gov is expected to handle more than 3.5 million electronic court filings – more than any other state system in the country.
"E-filing promotes the efficient and uniform administration of justice," said Texas Supreme Court Chief Justice, Nathan Hecht. "In the 21st century, we no longer can rely on an 18th or 19th century vision for our systems. I think historians will look back on this time period and see that e-filing revolutionized our courts for the better."
"A new year, brings a new vision for our courts," said David Slayton, Administrative Director of the Texas Office of Court Administration. "E-filing is a technology solution that will save taxpayer dollars by eliminating paper and storage costs, simplifying access to public record information and allowing attorneys and courts to work more efficiently. With e-filing, one no longer has to wait in line at the clerk's office, you can file from anywhere in the world 24/7 as long as you have an internet connection."
Plano-based Tyler Technologies is the technology infrastructure provider for eFileTexas.gov. The Web portal utilizes Tyler's e-filing platform, Odyssey File and Serve which is deployed in more than 10 other states including, Michigan, Minnesota, Nevada, New Mexico and Oregon.
"The Texas judiciary saw the state's massive size and scale not as an obstacle, but rather an opportunity to create convenience and cost savings for residents, courts and attorneys in each of the state's 254 counties," said Bruce Graham, president of Tyler's Courts and Justice Division. "By replacing slow, paper-based processes with e-filing, eFileTexas.gov reflects the consumerization of technology by government. Progressive public-sector agencies like the Texas judiciary apply reliable, easy-to-use technology to bring the kinds of convenience and efficiency to government that we, as consumers, expect from technology in our daily lives."


text:
/* -*-  Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2011 Centre Tecnologic de Telecomunicacions de Catalunya (CTTC)
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author: Jaume Nin <jnin@cttc.es>
 * modified by: Marco Miozzo <mmiozzo@cttc.es>
 *        Convert MacStatsCalculator in PhyTxStatsCalculator
 */

#include "phy-tx-stats-calculator.h"
#include "ns3/string.h"
#include <ns3/simulator.h>
#include <ns3/log.h>

namespace ns3 {

NS_LOG_COMPONENT_DEFINE ("PhyTxStatsCalculator");

NS_OBJECT_ENSURE_REGISTERED (PhyTxStatsCalculator);

PhyTxStatsCalculator::PhyTxStatsCalculator ()
  : m_dlTxFirstWrite (true),
    m_ulTxFirstWrite (true)
{
  NS_LOG_FUNCTION (this);

}

PhyTxStatsCalculator::~PhyTxStatsCalculator ()
{
  NS_LOG_FUNCTION (this);
}

TypeId
PhyTxStatsCalculator::GetTypeId (void)
{
  static TypeId tid = TypeId ("ns3::PhyTxStatsCalculator")
    .SetParent<LteStatsCalculator> ()
    .SetGroupName("Lte")
    .AddConstructor<PhyTxStatsCalculator> ()
    .AddAttribute ("DlTxOutputFilename",
                   "Name of the file where the downlink results will be saved.",
                   StringValue ("DlTxPhyStats.txt"),
                   MakeStringAccessor (&PhyTxStatsCalculator::SetDlTxOutputFilename),
                   MakeStringChecker ())
    .AddAttribute ("UlTxOutputFilename",
                   "Name of the file where the uplink results will be saved.",
                   StringValue ("UlTxPhyStats.txt"),
                   MakeStringAccessor (&PhyTxStatsCalculator::SetUlTxOutputFilename),
                   MakeStringChecker ())
  ;
  return tid;
}

void
PhyTxStatsCalculator::SetUlTxOutputFilename (std::string outputFilename)
{
  LteStatsCalculator::SetUlOutputFilename (outputFilename);
}

std::string
PhyTxStatsCalculator::GetUlTxOutputFilename (void)
{
  return LteStatsCalculator::GetUlOutputFilename ();
}

void
PhyTxStatsCalculator::SetDlTxOutputFilename (std::string outputFilename)
{
  LteStatsCalculator::SetDlOutputFilename (outputFilename);
}

std::string
PhyTxStatsCalculator::GetDlTxOutputFilename (void)
{
  return LteStatsCalculator::GetDlOutputFilename ();
}

void
PhyTxStatsCalculator::DlPhyTransmission (PhyTransmissionStatParameters params)
{
  NS_LOG_FUNCTION (this << params.m_cellId << params.m_imsi << params.m_timestamp << params.m_rnti << params.m_layer << params.m_mcs << params.m_size << params.m_rv << params.m_ndi);
  NS_LOG_INFO ("Write DL Tx Phy Stats in " << GetDlTxOutputFilename ().c_str ());

  std::ofstream outFile;
  if ( m_dlTxFirstWrite == true )
    {
      outFile.open (GetDlOutputFilename ().c_str ());
      if (!outFile.is_open ())
        {
          NS_LOG_ERROR ("Can't open file " << GetDlTxOutputFilename ().c_str ());
          return;
        }
      m_dlTxFirstWrite = false;
      //outFile << "% time\tcellId\tIMSI\tRNTI\tlayer\tmcs\tsize\trv\tndi"; // txMode is not available at dl tx side
      outFile << "% time\tcellId\tIMSI\tRNTI\tlayer\tmcs\tsize\trv\tndi";
      outFile << std::endl;
    }
  else
    {
      outFile.open (GetDlTxOutputFilename ().c_str (),  std::ios_base::app);
      if (!outFile.is_open ())
        {
          NS_LOG_ERROR ("Can't open file " << GetDlTxOutputFilename ().c_str ());
          return;
        }
    }

//   outFile << Simulator::Now ().GetNanoSeconds () / (double) 1e9 << "\t";
  outFile << params.m_timestamp << "\t";
  outFile << (uint32_t) params.m_cellId << "\t";
  outFile << params.m_imsi << "\t";
  outFile << params.m_rnti << "\t";
  //outFile << (uint32_t) params.m_txMode << "\t"; // txMode is not available at dl tx side
  outFile << (uint32_t) params.m_layer << "\t";
  outFile << (uint32_t) params.m_mcs << "\t";
  outFile << params.m_size << "\t";
  outFile << (uint32_t) params.m_rv << "\t";
  outFile << (uint32_t) params.m_ndi << std::endl;
  outFile.close ();
}

void
PhyTxStatsCalculator::UlPhyTransmission (PhyTransmissionStatParameters params)
{
  NS_LOG_FUNCTION (this << params.m_cellId << params.m_imsi << params.m_timestamp << params.m_rnti << params.m_layer << params.m_mcs << params.m_size << params.m_rv << params.m_ndi);
  NS_LOG_INFO ("Write UL Tx Phy Stats in " << GetUlTxOutputFilename ().c_str ());

  std::ofstream outFile;
  if ( m_ulTxFirstWrite == true )
    {
      outFile.open (GetUlTxOutputFilename ().c_str ());
      if (!outFile.is_open ())
        {
          NS_LOG_ERROR ("Can't open file " << GetUlTxOutputFilename ().c_str ());
          return;
        }
      m_ulTxFirstWrite = false;
//       outFile << "% time\tcellId\tIMSI\tRNTI\ttxMode\tlayer\tmcs\tsize\trv\tndi";
      outFile << "% time\tcellId\tIMSI\tRNTI\tlayer\tmcs\tsize\trv\tndi";
      outFile << std::endl;
    }
  else
    {
      outFile.open (GetUlTxOutputFilename ().c_str (),  std::ios_base::app);
      if (!outFile.is_open ())
        {
          NS_LOG_ERROR ("Can't open file " << GetUlTxOutputFilename ().c_str ());
          return;
        }
    }

//   outFile << Simulator::Now ().GetNanoSeconds () / (double) 1e9 << "\t";
  outFile << params.m_timestamp << "\t";
  outFile << (uint32_t) params.m_cellId << "\t";
  outFile << params.m_imsi << "\t";
  outFile << params.m_rnti << "\t";
  //outFile << (uint32_t) params.m_txMode << "\t";
  outFile << (uint32_t) params.m_layer << "\t";
  outFile << (uint32_t) params.m_mcs << "\t";
  outFile << params.m_size << "\t";
  outFile << (uint32_t) params.m_rv << "\t";
  outFile << (uint32_t) params.m_ndi << std::endl;
  outFile.close ();
}

void
PhyTxStatsCalculator::DlPhyTransmissionCallback (Ptr<PhyTxStatsCalculator> phyTxStats,
                      std::string path, PhyTransmissionStatParameters params)
{
  NS_LOG_FUNCTION (phyTxStats << path);
  uint64_t imsi = 0;
  std::ostringstream pathAndRnti;
  pathAndRnti << path << "/" << params.m_rnti;
  if (phyTxStats->ExistsImsiPath (pathAndRnti.str ()) == true)
    {
      imsi = phyTxStats->GetImsiPath (pathAndRnti.str ());
    }
  else
    {
      imsi = FindImsiForEnb (path, params.m_rnti);
      phyTxStats->SetImsiPath (pathAndRnti.str (), imsi);
    }

  params.m_imsi = imsi;
  phyTxStats->DlPhyTransmission (params);
}

void
PhyTxStatsCalculator::UlPhyTransmissionCallback (Ptr<PhyTxStatsCalculator> phyTxStats,
                      std::string path, PhyTransmissionStatParameters params)
{
  NS_LOG_FUNCTION (phyTxStats << path);
  uint64_t imsi = 0;
  std::ostringstream pathAndRnti;
  pathAndRnti << path << "/" << params.m_rnti;
  if (phyTxStats->ExistsImsiPath (pathAndRnti.str ()) == true)
    {
      imsi = phyTxStats->GetImsiPath (pathAndRnti.str ());
    }
  else
    {
      imsi = FindImsiForUe (path, params.m_rnti);
      phyTxStats->SetImsiPath (pathAndRnti.str (), imsi);
    }

  params.m_imsi = imsi;
  phyTxStats->UlPhyTransmission (params);
}

} // namespace ns3

redpajama_set_name: RedPajamaGithub


Entering a competition is really easy. Click on the three horizontal bars to the top left of the screen and then click on competitions. You can see all the competitions available, just open the one you want to enter and click on "I'd like that".
"I'd like that" has nothing to do with entering a competition. It prevents me from clicking on it, in fact. Why isn't it something like "Enter me!" or "Enter now" or simply "Enter"?


text:
Advantages and optimizations for label cutting with CO2 lasers
Laser cutting with high-speed scan heads has changed label cutting to a dynamic and easily flexible process.
Technology enables cutting of multiple shapes on the fly
JUSTIN CONROY and RAJIV PANDEY
The digital printing revolution has changed the landscape of label creation significantly. With the flexibility of printed design, the need to easily change the cut shape to match has become very important. Traditionally, cutting has been done with mechanical die presses and knife slitters, where the user is locked into one design for a production shift. The cost and complex logistics of storing multiple dies make it unfeasible to have many cut shapes available. Furthermore, downtime associated with tooling changes reduces productivity metrics, which is often a deciding factor in overall cost of operations. Laser cutting with high-speed scan heads has changed this to a dynamic and easily flexible process, where cut design changes can be done on the fly via software without stopping the production line.
One subset of this application is high-speed label cutting with CO2 laser beams. Broadly, this application is classified under converting, which has the generally accepted industry definition of processes where a web-roll of material is "converted" into another form. This includes labels; perforated plastic or paper film; cut edges for box folding; and scribed, easy-to-tear food pouches, among others.
The advantages of laser-based converting are numerous. In addition to the digital flexibility of new design that can be changed on the fly, other benefits such as yield improvements derived from a non-contact method must not be overlooked, particularly as labels get thinner and with the selective capability to "kiss-cut" into a controlled depth. Also, laser-based processing has no consumables (i.e., no worn-out mechanical tools) and offers repeatable results (lasers do not get dull). For these reasons, the performance advantages offered by laser-based, digital, non-contact technology are compelling.
Label market
Market analysts are projecting a robust compound annual growth rate (CAGR) of 6% (2016-2020) driven by emerging markets and demand in end markets for pharmaceuticals, food/beverage containers, and cosmetics. While the laser-based segment is relatively small (<1% adoption) compared to traditional machine tools, it is projected to grow at faster rate because of the digital printing revolution. Many companies are now investigating the advantages of laser cutting labels.
One such company is AB Graphic International Ltd. (Bridlington, Yorkshire, England), which has been manufacturing laser-based label cutting machines for the better part of a decade. They see clear advantages in processing with Synrad CO2 lasers compared to traditional mechanical tools technology. Mike Burton, managing director of AB Graphic, says, "While laser cutting has many limitations today, the digital printing revolution is ushering in need for laser processing because it is an ideal technology to produce short-run, custom jobs. Requests can be taken online for custom designs with CAD files and quickly sent to the digital printer, followed by digital laser cutting. This end-to-end digital process saves time associated with tool and die changes, delivering fast results with total freedom. There is really no cost-effective way to satisfy customers' needs for quick turns without a laser cutter."
Laser-based processing offers a compelling value proposition. It saves customers several days to weeks of downtime in tooling changes, and gives them the ultimate flexibility. For example, a flat-bed die-cutter—the simplest of machines—not only has tooling costs upwards of $100, but also takes several days for a new tooling design. Semi-rotary, flexible die-cutters and rotary die-cutters all have the same issues, except the tooling is more expensive. Semi-rotary die cutter tooling costs several hundred dollars and has three- to five-day lead times. Full rotary die-cutter tooling costs in the range of $1000–2000, with lead times of up to two weeks. Clearly, the long lead time and inability to accommodate rapid design changes limits their capability. "Laser-based machines today make up only 1–2% of the total label cutting market," Burton adds. "The mechanical machines are ideal for long, repetitive runs and considering they cost 4–8 times less than laser machines, there is really no cost benefit in favor of laser machines. However, as the digital printing revolution led by HP Indigo machines takes shape, the demand for laser-based machines will increase over the coming years." AB Graphic designs and markets its Digilase line of label cutting machines (FIGURE 1), powered by two Synrad 200W CO2 lasers.
FIGURE 1. AB Graphics' Digilase machine for label cutting.
Optimized laser cutting of labels
In the label cutting application, for maximum throughput, achieving the best absorption into the label material by the laser energy is paramount. Most plastic and paper labels cut very well with CO2 lasers, as these material types absorb the long wavelength produced by these lasers very well. The exception is vinyl-based labels, which typically char and can create hazardous out-gassing. This material should be avoided.
For further optimization, some consideration should be given to the specific label materials and how well those materials absorb at the various laser wavelengths possible from a CO2 laser. Label sheets involve many different layers of material. There is the base paper backing, an adhesive-coated plastic or paper label, and then a varnish or laminate coating on top of that for protection. The top-most layer receives most of the laser energy first and, thus, its absorption characteristics are most important. For instance, a polypropylene label (commonly used for glue-applied labels) typically absorbs very well at 10.2–10.3μm compared to the standard 10.6μm wavelength. This translates into improved quality and throughput using the same laser power level.
Example test case setup
In this particular test, a Synrad p250 laser used in a Flyer 3D (3-axis scan head) subsystem configuration provided a large usable scan field area for processing at high speed. The Flyer 3D subsystem was configured with a 400 × 350mm field size and a 282μm focused spot size. A scan head system with high-speed galvo mirrors to steer the beam is preferable for high-speed processing. X-Y plotters are typically too slow for production-level throughput. In addition, the excellent stability of the p250 laser provides excellent consistency to the label's cut depth, so the processing results are the same, even over a long production shift.
FIGURE 2. Typical absorption curve for polypropylene (and biaxially oriented polypropylene)-based label film.
A sheet of Synrad labels made of 0.1mm-thick polypropylene film was test-cut with the experimental setup. The p250 laser was run at a duty cycle of 45% at 50kHz PWM. This high repetition rate for the pulses merged them together to get a continuous cut in the material. The measured average power was 275W coming out of the scan head. At the standard 10.6μm wavelength, the labels cut at a speed of 4064mm/s. Because of the increased absorption of the polypropylene label material (FIGURE 2), this speed increased by 1.5X when the 10.2/10.3μm wavelength laser option was used instead. In addition, there was less wasted energy transmitted through the polypropylene layer to the backing paper underneath, reducing the scoring to a negligible amount. The labels peeled easily off the backing sheet and had clean, smooth edges with minimal melting (FIGURE 3).
FIGURE 3. A cut-edge view of the labels (see the liftoff section in the center of the image).
CO2 lasers have a demonstrated capability in selective converting applications such as label cutting, where the flexibility to cut multiple, easily changeable shapes on the fly is needed. Furthermore, by optimizing the CO2 wavelength to the appropriate label material, further speed and quality improvement are seen over older laser systems operating at the standard 10.6μm wavelength. This is being seen in not only the lab, but in the field as well. Burton says that for AB Graphics, "going forward, we will be primarily building laser systems with the 10.2μm wavelength due to the improvements seen on our client's labels."
While this article discussed the benefits of 10.2μm vs. 10.6μm for polypropylene labels, it is worth mentioning that CO2 lasers can also operate in the 9.3μm range, which can optimally process other label film materials such as PET, commonly found in sleeve-type labels. The best quality and throughput will be achieved when the laser wavelength is matched to a project's specific film absorption characteristics.
JUSTIN CONROY(justin.conroy@synrad.com) is a laser applications engineer and RAJIV PANDEY(rajiv.pandey@synrad.com) is a senior product manager, both at Synrad, Mukilteo, WA; www.synrad.com.


Understanding the Relationship Between Hypercholesterolemia and CKD – How is Kidney Disease Impacted by Dyslipidemia?
instance, in the United Kingdom the number of patients receiving treatment for PAH is 27 patients/million population.
Glycemic control in diabetes: Does it matter?
macrovascular complications, it may be incorrect to assume that effective management of diabetes will lead to a reduction in CV events in the same time frame as management of other modifiable CV risk factors, such as hypertension, lipids, and smoking.
steadily fallen; consequently, it has become more difficult to achieve the lower targets with statins alone.
The Evolution of Stroke Prevention: Where are We Now? Where are We Going?
The ENHANCE Study: What Do We Know Now?
By MICHAEL R. FREEMAN, M.D.
Medical Crossfire – Managing Global Cardiometabolic Risk: How Can We Disrupt the Pathological Process?
By GORDON W. MOE, M.D.
Acute Coronary Syndrome without ST-Elevation: What's new?
Reported and discussed by: Howard Leong-Poi, M.D.
Originally presented by: John C. LaRosa, M.D.
Originally presented by: Marc S. Sabatine, M.D., and Zhenming Chen, M.D.
Originally presented by: B. Pitt, MD; S. Yusuf, MD; WJ Remme, MD; FH Messerli, MD, and MA Pfeffer, MD.
Reported and discussed by: DAVID FITCHETT, M.D.
Preventing Sudden Death: Have Prophylactic Implanted Defibrillators Finally Arrived?
Reported and discussed by: PAUL DORIAN, M.D.
What is the Latest and Greatest Antithrombotic Regimen for Unstable Cardiac Ischemic Syndrome?
Reported and discussed by: MICHAEL R. FREEMAN, M.D.
Originally presented by: Steven E. Nissen, M.D., and Allen J. Taylor, M.D.
Reported and discussed by: GORDON MOE, M.D.
Originally presented by: Dean J. Kereiakes M.D., P. Gabriel Steg M.D., Keith Fox M.D., and Kim Eagle M.D.
Reported and discussed by: GORDON MOE, M.D. and DUNCAN STEWART, M.D.
PO Collinson, MD, TA McDonagh, MD, AM Richards, MD, T Jernberg, MD, N Kucher, MD, CW Hamm, MD, et al.
Originally presented by: A. Michael Lincoff M.D.; Neil S. Kleiman M.D.; Frederick Feit M.D.; David J. Cohen M.D.; and John A. Bittl M.D.
Originally presented by: Shaun Goodman, M.D., Paul Armstrong, M.D., Christopher Granger, M.D., and Richard Gallo, M.D.
Originally presented by: Thomas Unger, MD, Peter Dominiak, MD, Peter Trenkwalder, MD, and Erling Tronvik, MD.
Reaching Optimal Blood Pressure: What is the Role of Fixed-Dose Combinations?
Originally presented by: Aldo P. Maggioni, MD, Florence, Italy.
Long-term therapy with clopidogrel in addition to aspirin in the management of patients with acute coronary syndromes undergoing percutaneous coronary intervention: The PCI CURE Study.
Originally presented by: S. Yusuf, M.D., E. Braunwald, M.D., D. Holmes M.D., K. Fox, M.D., R. Califf, M.D.
Anti-anginal and Lipid-lowering effects of Chronic Oral Androgen Supplementation In Elderly Male Patients with Coronary Heart Disease.
Do the different COX-2 specific inhibitors exert different effects on the cardiovascular system?
for Management of Coronary Artery Disease?
Do they have an impact on health care resources?
Originally presented by: Henry Black, M.D., Michael Weber, M.D., John Burnett Jr, M.D., Giuseppe Mancia, M.D., J.L. Rouleau, M.D.
Presented and discussed by: ANATOLY LANGER, MD.
Donald B. Hunninghake, MD, W. Virgil Brown, MD, Bertram Pitt, MD.
Are there differences that might affect outcome?
Originally presented by: H. Pouleur, MD, H. Ikram, MD, D. Synhorst, MD and J. Hanyok, Pharm.D.
Originally presented by: B. M. Buckley, MD, J.W. Jukema, MD, J.W. Warnica, MD, E.T. Rapse, MD.
What therapeutic options are available?
Are Calcium Channel Blockers Safe Post-Myocardial Infarction?
Prevention of Coronary Artery Disease: Myth or Reality?
Heart Failure: Are We Optimizing Patient Management?
A Prognostic Indicator in Patients with Heart Failure?
Enzyme Inhibitors in Patients with Left Ventricular Dysfunction?
Is microalbuminuria the best marker for endothelial dysfunction?
Amiodarone: New Prophylactic Indications for an Old Drug?
A new indication for implantable defibrillators?
The Healing and Early Afterload Reducing Therapy (HEART) Study.


text:
Chris Enloe
ICE director reveals real reason Trump delayed ICE raids — and report suggests who is behind leaks
'It really jeopardized the safety of law enforcement officers...'
Image source: YouTube screenshot
Mark Morgan, acting director of Immigration and Customs Enforcement, revealed Saturday that the ICE raids planned for Sunday morning were cancelled because of government leaks and the media's subsequent reporting on key operation details.
"The media got ahold of some operational specifics, and they reported it. It's just egregious, and it puts the lives of the officers and agents at risk," Morgan told Fox News host Jeanine Pirro.
"The men and women at ICE are true American heroes. The president recognized that. He postponed it to protect them," Morgan explained.
President Trump Delays ICE Raids www.youtube.com
President Donald Trump announced Saturday afternoon the ICE operation would be delayed two weeks, citing requests from Democrats. It has since been reported that House Speaker Nancy Pelosi (D-Calif.) called him personally to request the government not move forward with the raids.
The operation was originally slated to begin in the pre-dawn hours on Sunday, targeting thousands of illegal immigrants across 10 U.S. cities.
Who leaked operation details?
According to the Washington Examiner, government officials believe acting Homeland Security Secretary Kevin McAleenan is behind the leaks.
Five government officials who spoke with the Examiner said McAleenan has been petitioning against the operation for months.
From the Examiner:
The sources said only a small number of people in the White House, ICE, and DHS were even aware of the plan's details, including which cities, the date and time, and who would be targeted.
Two officials said the acting secretary, who was promoted internally in April, had fought for months during closed-door discussions with White House officials, the former acting ICE Director Ronald Vitiello, and the new acting ICE Director Mark Morgan against the plan, which they noted was similar to one the Obama administration carried out in 2015.
Further, according to the Examiner, McAleenan traveled to the border on a government plane last Wednesday with the Washington Post reporter who broke the news about the ICE operation.
"It really jeopardized the safety of law enforcement officers — that's the part that's really detrimental," one official told the Examiner.