Below I am posting an interview that was published in China Daily, the English language newspaper published by the government of the People's Republic of China. Over four months passed between interview and publication. Speculations regarding the strange title China Daily chose can be found at the end of this blog.
"Threats stem from lack of statistics, over-harvesting"
Over-harvesting and poor statistical tracking of caterpillar fungus are major challenges for the sustainable management of the medicinal resource.
Many rural Tibetans rely on this fungus for their incomes, and if anything happens to it, they will face big problems.
Collectors should realize old, low-value caterpillar fungus is better off left in the ground to spread spores for the next year. But at the moment, hundreds of thousands of people are going into the mountains to collect as much as they can. They can't find everything, but not much is left, and if the situation remains unchecked, the resource will be depleted sooner or later.
Authorities should shorten the harvest season and further limit the number of collectors - for example, only two members should come from each household.
If these restrictions are to work, the key is education. Officials need to work with community leaders to raise awareness to protect the resource so they can benefit for many years to come.
I visited Tibetan communities with collection rights in Yushu prefecture, Qinghai province, with representatives from the China branch of the World Wildlife Fund for Nature. I showed images to villagers to explain the fruiting stages of caterpillar fungus and the different market values.
It only took a few minutes to convince them that the mushroom needs spores to reproduce, contrary to local belief that it just grows by itself every year.
Policymakers should regulate the market to put people off old, low-value caterpillar fungus, which shrinks substantially after it's dried. Then collectors will have the incentive to give up collecting it.
The price rose by 900 percent between 1998 and 2008, when it then dropped 20 percent due to the financial crisis. The rise in price over the past four years is not as high as before, but harvests have fluctuated, as abundant production depends on sufficient rain and snowfall.
There are several research institutes in China devoted to genetic studies and artificial cultivation of caterpillar fungus [but these institutes have NOT succeeded in cultivating caterpillar fungus], which is good news for Tibetan collectors who face serious competition and a price collapse.
However, more resources should be used to find out how to manage the collection of a natural product in a sustainable way, rather than learn how to cultivate artificial ones.
The sentences in brackets I have added in my blog above to correct erroneous statements by Li Yao.
I never talked to Daqiong, and if he would have been present at the interview in Beijing I am convinced the story would not have had the title they cooked up, since my complain of lack of statistics was aimed at Qinghai Province, the biggest producer of caterpillar fungus as well as the Tibetan areas in Sichuan, Yunnan and Gansu that also lack government efforts to keep track of the most precious product of this region.
Now the title is apparently in juxtaposition to a lengthy article published on the same day in China Daily, to which Daqiong probably contributed substantially. Interestingly the very informative article is full of statistics, never published before. To me the choice of header for my interview in juxtaposition to the TAR caterpillar fungus article seems to try to leave the impression that I was clueless in regard of the statistics kept in TAR. However, in 2008 and 2011 I had published previous years of some of these statistics and my complain regarding lack of statistics was not aimed at TAR, but the other Cordyceps producing areas outside of TAR. However Li Yao did not inform me that China Daily was publishing a second Cordyceps paper on the same day.
Ecologist holding a porcini mushroom in 2007.


text:
PBBM can capitalize on Davos forum to introduce MIF: Romualdez
Philippine News Agency•January 16, 2023
Speaker Martin Romuladez (File photo)
MANILA – House Speaker Ferdinand Martin G. Romualdez on Monday said he is confident that President Ferdinand R. Marcos Jr. would be able to successfully introduce the country's sovereign wealth fund, articulate his administration's gains and promote the Philippines as an investment hub at the World Economic Forum (WEF) in Davos, Switzerland.
"In his previous participation in various global fora, President Marcos has displayed an excellent ability to articulate the interests of the Philippines as well as the significant gains achieved under his administration and the country's direction for future growth," Romualdez said.
"I'm confident he would do the same in the WEF, particularly in introducing the Maharlika Wealth Fund to the global stage and in helping our local business leaders explore investment opportunities for the Philippines," said Romualdez, who is part of the official delegation of President Marcos to the WEF.
Romualdez was instrumental in arranging the meeting between Marcos and WEF founder Dr. Klauss Schwab on the sidelines of the Association of Southeast Asian Nations (ASEAN) Summits held in Cambodia where the latter invited the President to the Davos meeting.
The meeting at Davos will see over 50 heads of state taking part, along with global business leaders, celebrities and prominent social activists.
In an interview during his flight bound for Switzerland, Marcos told members of the Philippine media that WEF presents an excellent opportunity to soft launch the Maharlika Investment Fund (MIF) and promote the Philippines as an investment hub.
The House of Representatives approved last Dec. 16 House Bill (HB) 6608, creating the MIF bill with the solid support of 90 percent, or 282 out of the 312 members, of the chamber who were also officially named as co-authors of the measure.
Romualdez, who is the principal author of the measure, assured that HB 6088 includes adequate safeguards against possible abuse and fraud.
"The proposed sovereign wealth fund will help President Ferdinand Marcos Jr. keep the country on the high-growth path. We want to assure the public that the management of the fund will follow best practices and the principles of transparency and accountability," he stressed.
In the same interview, Marcos said a new format adopted for the Davos forum this year opens a wider latitude to communicate the government's effort to attract foreign investments into the county.
In addition, the President said the WEF will also provide Philippine business leaders the opportunity to engage with their counterparts from various parts of the world to explore possible investment deals.
He noted that most of the time the best deals are done outside of the forum, in particular during "pull away" engagements where certain parties may conduct talks on the sidelines to discuss business opportunities.
"So, we will have a lot of those because there are certain businessmen (attending the WEF), who our own business group want to engage," the President said.
The President said he and members of the Cabinet in his delegation could assist Filipino businessmen to facilitate such engagements.
"I think that's where, besides the fora, a lot of work will be done, in the sidelines as usual," Marcos said. (PNA)

redpajama_set_name: RedPajamaCommonCrawl


Flight Courtier brings a new, cheaper way to fly in style to Glasgow/Edinburgh and the major destinations of the Scotland, saving you up to 70% on the regular price of business and first class tickets. An average flight from Australia to Scotland takes about 26 hours and it can be extremely comfortable spending 26 hours in a Flat Bed with full menu.
World-famous for its cultural heritage sites and many arts festivals, Scotland is an incredibly rich and diverse destination for the business traveler seeking a truly unique European experience between meetings. Bursting with cultural pride, the locals are only too pleased to guide you to the top tourist hot spots, as well as some hidden gems of the cities and country!
Your business class or first class flight to Edinburgh or Glasgow will start with the knock on your door from your personal chauffeur in complimentary luxury travel in a private premium vehicle with Flight Courtier's transportation partners, seeing you off on a smooth transition to your Scotland flight with full menu and all the other perks included in your premium package.
When it's time to grab that all- important shut-eye, your Flat Bed will feel just as comfortable as your own bed, with as many warm blankets and pillows as you desire, and refreshments brought to your bedside all night long. The time will fly almost as quickly as you will – enjoying television and movie entertainment, a great range of refreshments and a cosy snooze in your comfy Flat Bed, arriving in Scotland before you know it!
Whether you wish to explore the incredible castles and old-world experiences of the country or paint the town, Glasgow, Edinburgh and surrounds are sure to offer you the very best in business, leisure and entertainment.


I finished up my last class today!!! My course work in terms of sitting in a classroom is basically over! I still have a workshop to take next spring, but I am doing independent study/dissertation hours in the fall. It is the first sign that I am nearing dissertation time! It is a big moment. I have been in school for roughly two decades. I need a drink.


Radiant your Skin Care with the [Elizavecca] Hyaluronic Acid Serum 100% 150ml! we aim to provide you best korean products to take good care of your skin, including Cosmetics, Moisturizer, Essence&Oil. Hydra Essence&Oil online.
sil…@gmail.com feels really good on the skin, like how big the bottle is as I go very quickly through the small 30ml serum bottles. I was expecting a bit more moisture, however my skin improved and went from dry to combination like it used to be in the past.


He is is considered to be the number 1 Sir Cliff Richard Lookalike in the UK and Europe and presents a musical treat with his act 'Cliff' Not only does the show contain some of the most memorable songs of the past five decades, but it is also full of energy and fun, a show that is memorable and very entertaining. 'Cliff' has been touring the UK, Spain and the Algarve region of Portugal since 2007.
"What an amazing show. Cliff has got to see your show. He'd Love it." Nigel Birch - Part owner of Sir Cliff Richard's Vineyard in Portugal.


summary : The Hubble Space Telescope captured a video showing a black hole from a galaxy 260 million light years away shooting a jet of plasma traveling at 98 percent of the speed of light, resulting in a collision.
summary : Based on observations conducted by the Hubble Space Telescope, NASA confirmed on Thursday that Jupiter's largest moon, Ganymede, has a saltwater ocean underneath its icy surface.
summary : After NASA thought its spacecraft no longer worked, the Kepler space telescope started working again and brought back a discovery of a new "alien planet" 180 light years away from Earth.


Beauties of the eyes involves all structures around the eyes, and include the skin, eyebrow position, the tightness or laxity of the lower ids, the position of the upper lid, the shape of the eye and thus the position of the lateral canthus and its color match, medial canthus, and finally the fat compartments.
Accurate detailed analysis of all aspects of the eyes and surrounding structures is important to plan for the right surgery and approach. Inadequate analysis will lead to disappointment and unsatisfactory results and complications.
Patients often complain of the "tired look", "angry look". The eye brows descend down along with excess upper lid skin, hoods the upper lids. This is usually is associated with puffiness of the upper and lower lids, also called bags, or herniated fat. In the upper lids the puffiness is more pronounced on the inside of the upper lid.
The lower lids show their aging with wrinkles and excess skin. Bags of the lower lid, is herniated fat. In many patients there is Hollowness at the lid cheek junction, called the tear trough. There is much other condition that may be associated with the aging process. Upper lid can be droopy, one eye brow might be lower than the other, and one eye may look smaller than the other. The boney structure of the eye might be deficient, or abnormal.
The surgery is designed to rejuvenate the eyes by understanding the individual aging problem and correcting each component that is contributing to the aging process. Smoothes the puffiness, open the eyes, correct abnormal position of the upper or lower eye lids. Reposition the eyebrow. Correct the tear trough.
Blepheroplasty can be performed on the upper and lower lids or separately upper or lower eye lids.
Understanding the standards of beautiful eyes can help in planning for the appropriate surgical procedure. The most important advances in the recent years are the preservation of volume in both the upper and lower eyelids. These procedures avoid the hollow eye that accentuates the aged look.
Evaluation of the upper lid must include the position of the eye brow. A droopy eye brow accentuates the upper lid aging. In those situations the eye brow must be positioned back to normal position. This is done with a forehead lift or a brow lift. The position of the upper lid in relation to the pupil must be examined and evaluated. This will determine the presence of droopy lid "ptosis".
The incision is positioned in the eyelid crease. The crease should be positioned at the right height from the lash line; otherwise the scar will be abnormal and visible.
Excess skin is then removed; fat is very conservatively removed if any. Muscle is spared. A small slip of muscle is removed only in specific cases. All these precautions are taken to prevent the hollow eye, or the surgical look.
Skin laxity and fine wrinkles are the first signs of aging of the periorbital region. Fat herniated through manifesting themselves as the lower lid bags.
New concepts in lower lid rejuvenation accomplish a full smooth convex lower lid. Conservative approach can involve micro lipo injections in the lower lid. Hollow lid check junction accentuates the appearance of bags in the lower lid. However the problem is really fat loss with aging and descent of facial fat thus lengthening the lid check junction. Treatment is fat transfer to the lower lid and lid check junction.
In some a Transconjunctival approach through the inside of the lower lid to redistribute the fat. The skin is smoothened by laser resurfacing, removal of excess skin, or skin peels.
Advanced laxity of the lower lid and excess skin and fat may require the traditional approach through an incision just below the lash line. The lid is tightened by a canthopexy procedure. Fat is redistributed to fill the hollow lid-cheek junction. Excess skin is removed, or smoothened with laser resurfacing.
Recovery is quick about one week. Swelling and bruises will completely disappear in 3-4 weeks. Back to exercise in 3-4 weeks.
Dr. Shureih, Baltimore cosmetic surgeon with certificate of advanced education in Cosmetic Surgery. He has 20 years of experience. He was named TOP DOC in Baltimore Magazine, and In the National Guide of TOP DOCS. Offers you his experience and excellence to achieve the results you desire.
Lower lid bags and excess eyelid skin are the most common complaints offered by both women and men alike.
There are multiple surgical and nonsurgical procedures for eyelid aesthetics.
Choosing the appropriate procedure depend on the accurate diagnosis of the real problems. There are several factors one has to take in consideration.
The position of the eye brow. Drooping brow can give the illusion of excess skin of the upper eye lids.
Herniated fat, causing severe fullness of the upper lids.
Deep tear tough giving the appearance of bags in the lower lid.
Making the proper diagnosis and the appropriate treatment will restore beauty to the eyes. Restoring the youthful eyes is probably the most dramatic change in facial rejuvenation.
An open eye, with properly positioned eyebrow, eye lids devoid of bulges or wrinkles is the ultimate goal in eye lid rejuvenation.
Fat is lost from the aging face, causing hollow features and loss of youthful look.
In the eye lids, Hollowness is treated restored by fat transfer. Fat transfer is an office surgical procedure. It involves harvesting the fat by gentle liposuction. The harvested fat is then carefully cleaned, then centrifuged to separate it from the anesthetic solution and debris, then placed into smaller syringes for injection. The one or two tiny incisions made to introduce the cannula to harvest the fat require no sutures.
Fat can be also injected into the lateral brow area to restore the natural fullness.
Fine skin wrinkles around the eye lids are erased by laser resurfacing.
Lower lid bags are approached through a Transconjunctival incision (inside the eye lid). Some fat may need to be removed, but the majority of the fat is redistributed to fill hollow area and prevent Hollow eyes created by surgery, and aided by age.
Many changes occur around the eye region with aging. These changes can make you look tired, angry, or sad. Bags around the eyes and dark circles are the most common complaints. Wrinkles and excess skin is common. Some of the wrinkles at the smile lines area can be treated with Botox®.
Plastic surgery of the eyelids is effective in smoothing puffy, baggy eye lids, tired eyes look more youthful and in many cases more awake. In particular, it can produce open eyes by removing excess skin. It lifts heavy folds in the upper lids. Cosmetic surgery eyelid surgery (Eye lid lift) can even change Asian eyelids by redefining the crease of the upper eye lid. Surgery must be tailored to each individual, depending on their concerns and the condition of their eyelids. The position of the eye brow is very important in how the upper lid looks.
Dr. Shureih is a Board Certified Plastic Surgeon Practices Cosmetic Surgery in Baltimore and Ellicott City. He has over 20 years of experience and thousands of procedures. He was chosen TOP DOC in Baltimore Magazine, twice, and in the National Guide for TOP DOCS for many years.
The bags in the lower lids are pockets of fat misplaced or herniated. Deep crease in the lower lid cheek junction becomes prominent, known as the tear trough, to improve these problems a thorough knowledge of the aesthetics and anatomy is essential for proper evaluation and formulating a plan to improve on the eye lid aesthetics. It is imperative to avoid the operated on look and the hollow eye look after surgery.
Evaluation of the upper lid must include the position of the eye brow. A droopy eye brow accentuates the upper lid aging. In those situations the eye brow must be positioned back to normal position. This is done with a forehead lift or a brow lift.
In the upper lid the incision is hidden in the upper lid crease, once healed it is hardly noticeable. The crease should be positioned at the right height from the lashes.
Through that incision excess fat is removed only when absolutely needed other wise a hollow eye will result. In most cases only skin is removed to keep the full youthful eye and avoid the hollow look.
Transconjunctival, that is through an incision inside the lower lid. Bags are dealt with, and the skin can be smoothed either by laser resurfacing or skin peel, or pinch excision.
Subcilliary, or through the skin just below the eye lashes. The bags of fat are redistributed to fill the hollow crease in the lower lids, and occasionally some of that fat is removed. The lower lid is supported with special sutures (Canthoplasty), and the excess skin is conservatively removed to smooth the skin.
Scars heal very well and are hardly noticeable.
Cosmetic eye lid surgery requires accurate planning and excellent surgical skills.
Dr. Shureih is a TOP Baltimore Plastic surgeon who can deliver excellence on cosmetic surgery.
Asian "double eyelid surgery," Asian Blepheroplasty is a cosmetic surgery procedure of the upper eye lid where the skin around the eye is reshaped (Blepheroplasty). The purpose of the procedure is to create an upper eyelid with a crease (i.e. "double eyelid") from an eyelid without a crease (i.e. "single eyelid" "the sleepy look). Anatomically, there are a number of differences in the upper eyelids of East Asians compared with the differences in the eyelids of other races. The single eye lid is the most common complaint, other differences a\is the epicanthal fold, where skin covers the inner part of the upper eye lid.
While there are some Asians with a double eyelid and some without, there is also a large variation in the crease position (double eyelid size) of the East Asian upper eyelid. The upper lid fold can range from 1 mm above the eyelash line to about 10 mm. Several methods can be used to create the double eyelid--including the full-incision, partial incision. Each has its advantages depending on the patient's anatomy and desires.
Asian Blepheroplasty have been reported to be the most common aesthetic procedure in Taiwan and other parts of East Asia. There are some risk of complications involving the procedure, but it is generally quite safe if done by an expert plastic surgeon. The procedure to remove the epicanthal fold (epicanthoplasty) is often performed in conjunction with an Asian Blepheroplasty. It involves a form of double Z-Plasty.
The procedure opens the eye and gives the orbital region a more beautiful look.
Infection: Eye lid infection is rare; antibiotics are given to decrease the chances of infection.
Bleeding: It is a rare complication, It is due to bleeding in the fat compartments after the surgery is over.
Blurred vision: This is due to swelling, or damage to any of the muscles that surround the eyeball and coordinate its movement. Most often, these symptoms are temporary. Fortunately, this is a rare problem.
Dry eye syndrome: This can be due to a variety of reasons, however the most common is preexisting dry eye that has not been recognized, or fully manifested itself.
Inability to close your eyes (LAGOPHTHALMUS): This is usually due to removal of too much upper eyelid skin. In severe cases, skin grafting may be necessary to correct this problem.
Corneal abrasion: This can occur during ANY operation, whether it is on the eyes or any part of the body, because the eyes may sometimes open during surgery, rendering them susceptible to being scratched. Treatment involves antibiotics and taping the eye shut for 2-3 days while the abrasion heals.
Hollow (sunken) eyes: occur when too much fat removed from the eyelids. This can usually be prevented by conservative removal of fat or no removal at the time of surgery.
Ectropion: Where the lower lid hangs down.
Recovery may take up to one week.
surgery is usually done under local anesthesia with sedation.
Surgery time is one to two hours.
It is highly recommended to have an ophthalmology exam done prior to eye lid surgery.
Dr. Shureih and staff will assure you of excellent medical care, in a safe and confidential environment.
Contact Dr. Shureih immediately if you think there is infection and/or go to the nearest emergency room.


Have you seen those funny commercials for Christian owned and operated fast food chain Chick-fil-A? You know, the ones with the cows trying to tempt folks to go eat chicken so they don't get served up on a bun at some other fast food joint?
Three guesses where that safe space was located, but you won't need two.
According to the Noblesville Police Department, officers were chasing a runaway cow across Campus Parkway before it crossed the street and waited by the fast-food chain.
Indiana resident Athena Hopkins caught the wild cow crossing the street on video, which quickly became viral when she posted it to her Facebook page.
"So this just happened!!!!" Hopkins exclaimed in her caption on Facebook.
Of all the places for a cow to run and hide, this one picks Chick-fil-A. You know that old saying, "truth is stranger than fiction?" Yeah that's absolutely true.
Sometimes you just need to take a breather from the actual insanity going down in the world and just laugh a little. It's good medicine.


text:
\section{Introduction}

Up to isomorphism, the subgraph relation $\subseteq$ is antisymmetric
on finite graphs: If a finite graph $G$ is (isomorphic to) a subgraph
of $H$, i.e.\ $G\subseteq H$, and if also $H\subseteq G$, then $G$ and
$H$ are isomorphic. For infinite graphs this need no longer be the
case, see Figure~\ref{fig:stars}. Two non-isomorphic
graphs $G$ and $H$ are \emph{weak twins} if $G$ is isomorphic to a
subgraph of $H$ and vice versa, and \emph{strong twins} if both these
subgraph embeddings are induced. When $G$ and $H$ are trees the two
notions coincide, and we just speak of \emph{twins}.

\begin{figure}[ht]
  \centering

  \includegraphics{startwins}
  \caption{Each of the two graphs is a subgraph of the other.}
  \label{fig:stars}
\end{figure}

The trees in Figure~\ref{fig:stars} are twins, and by deleting some
of their leaves we can obtain infinitely many further trees that are
twinned with them. On the other hand, no tree is a twin of the infinite star.
Bonato and Tardif~\cite{BonTar06} conjectured that every tree is
subject to this dichotomy: that it has either infinitely many trees as twins or none. They call this the {\em tree alternative conjecture}.

In this paper we prove the corresponding assertion for \emph{rayless} graphs, graphs that contain no infinite path:

\begin{theorem}
  \label{mainthm}
  The following statements hold with both the weak and the strong
  notion of `twin'.
  \begin{enumerate}
  \item
  	A rayless graph has either infinitely many twins or none.
  \item
  	A connected rayless graph has either infinitely many connected
  	twins or none.
  \end{enumerate}
\end{theorem}

\noindent
We do not know of any counterexamples to the corresponding statements for arbitrary graphs, rayless or not.

\medbreak

Note that the `strong twin' version of Theorem~\ref{mainthm} does not
directly imply the `weak twin' version. Indeed, consider the complete
bipartite graph $K_{2,\infty}$ with one partition class consisting of
two and the other of (countable-)infinitely many vertices. By deleting any edge we
obtain a weak twin of $K_{2,\infty}$. However, it is straightforward
to check that $K_{2,\infty}$ has no strong twin.

We have stressed in the theorem that for a connected rayless graph we
may restrict ourselves to twins that are also connected. This is indeed
a stronger statement: For example, an infinite star has disconnected
weak twins---add isolated vertices---but no connected ones. We do not
know whether the same can occur for strong twins.

\medbreak
Twins were first studied in~\cite{BonTar03}.
The tree alternative conjecture was formulated in~\cite{BonTar06},
where it was proved in the special case of rayless trees. (Note that
Theorem~\ref{mainthm} reproves this case.) Most of the
work there was spent on showing that the conjecture holds for
\emph{rooted} rayless trees, which motivated Tyomkyn~\cite{Tyomkyn08}
to verify the conjecture for arbitrary rooted trees. Moreover, Tyomkyn
established the tree alternative conjecture for certain types of
locally finite trees. (A graph is \emph{locally finite} if all its
vertices have finite degree.) A~proof of the conjecture for arbitrary
unrooted locally finite trees has remained elusive.

In~\cite{Tyomkyn08}, a slightly different approach is outlined as
well. If a graph $G$ has a twin, then mapping $G$ to that twin and
back embeds it as a proper subgraph in itself. Tyomkyn conjectures
that, with the exception of the ray, every locally finite tree that
is a proper subgraph of itself has infinitely many twins.

In this paper we consider only embeddings as subgraphs or induced
subgraphs, leading to weak or strong twins. It seems natural, however,
to ask a similar question for other relations on graphs, such as the
minor relation or the immersion relation. Does a graph always have
either infinitely many `minor-twins' or none at all? Conceivably, the
question of when a graph is a proper minor of itself, as is claimed
for countable graphs by Seymour's {\em self-minor conjecture}, should play a
role in this context.
The self-minor conjecture is described in Chapter 12.5 in~\cite{DiestelBook05};
partial results are due to Oporowski~\cite{Opo90} and Pott~\cite{JulianSMC}.
In related work, Oporowski~\cite{Opo99}
characterises the minor-twins of the infinite grid, and
Matthiesen~\cite{Lillian06} studies a complementary question with
respect to the topological minor relation, restricted to rooted
locally finite trees.

\medskip
In the next section we introduce a recursive technique for handling
rayless graphs, which we will use in Section~\ref{proofs} to prove
Theorem~\ref{mainthm}.

\section{A rank function for rayless graphs}

All our graphs are simple. For general graph theoretical concepts
and notation we refer the reader to~\cite{DiestelBook05}.

Our proof of Theorem~\ref{mainthm} is based on a construction by
Schmidt~\cite{schmidt83} (see also Halin~\cite{halin98} for an
exposition in English) that assigns an ordinal $\text{\rm rk}(G)$, the
\emph{rank of $G$}, to all rayless graphs $G$ as follows:

\begin{definition}\label{rank}
  Let $\text{\rm rk}(G)=0$ if and only if $G$ is a finite graph. Then
  recursivley for ordinals $\alpha>0$, let $\text{\rm rk}(G)=\alpha$ if and only
  if
  \begin{enumerate}
  \item
    $G$ has not been assigned a rank smaller than $\alpha$; and
  \item\label{separate}
    there is a finite set $S\subseteq V(G)$ such that every component
    of $G-S$ has rank smaller than $\alpha$.
  \end{enumerate}
\end{definition}

It is easy to see that the graphs that receive a rank are precisely
the rayless ones.
The rank function makes the class of rayless graphs accessible to induction
proofs. One of the first applications of the rank was the proof of the
reconstruction conjecture restricted to rayless trees by Andreae and
Schmidt~\cite{AnSch84}. Recently, the rank was used to verify the
unfriendly partition conjecture for rayless graphs,
see~\cite{unfrayless}.

We shall need a few properties of the rank function that are either simple
consequences of the definition or can be found in~\cite{halin98}.
Let $G$ be an infinite rayless graph, and let $S$ be minimal among the
sets as in~\ref{separate} of Definition~\ref{rank}. It is not hard to
see that $S$ is unique with this property. We call $S$ the
\emph{kernel of $G$} and denote it by $K(G)$. Furthermore, it holds
that:
\begin{itemize}
\item
  if $H$ is a subgraph of $G$, then $\text{\rm rk}(H) \le \text{\rm rk}(G)$; and
\item
  if $G$ is connected, then $K(G)$ is non-empty; and
\item
  $\text{\rm rk}(G-X)=\text{\rm rk}(G)$ for any finite $X\subseteq V(G)$.
\end{itemize}
In particular, if $C$ is a component of $G-K(G)$, then $G[C\cup K(G)]$
has smaller rank than $G$.

To illustrate the definition of the rank, let us note that an infinite
star has rank~$1$, and its kernel consists of its centre. The same
holds for the graphs in Figure~\ref{fig:stars}. On the other hand, the
disjoint union of infinitely many infinite stars (or in fact, of any
graphs of rank $1$) has rank~$2$ and an
empty kernel.

\section{The proofs}
\label{proofs}

In this section we prove the `strong twin' version of Theorem~\ref{mainthm}.
All proofs will apply almost literally to the case of weak twins
instead of strong twins. For that reason we will often drop the
qualifiers `strong' and `weak'.

Let $G,H$ be two rayless graphs and let $X\subseteq V(G)$ and
$Y\subseteq V(H)$ be finite vertex subsets.
We call a homomorphism
$\phi:G\to H$ a \emph{strong embedding of $(G,X)$ in $(H,Y)$}
if it is injective, $\phi(G)$ is an induced subgraph of $H$, and
$\phi(X)\subseteq Y$.
Alternatively, we shall say that $\phi:(G,X)\to (H,Y)$ is
a strong embedding.
Observe that  $\phi$  preserves edges as well as non-edges.
We call $(G,X)$ and
$(H,Y)$ \emph{isomorphic} if there is an isomorphism $\gamma:(G,X)\to
(H,Y)$, i.e.\ if $\gamma$ is a graph-isomorphism between $G$ and $H$ with $\gamma(X)=Y$.
We say that $(G,X)$ and $(H,Y)$ are
\emph{strong twins} if they are not isomorphic and there exist strong
embeddings $\phi:(G,X)\to (H,Y)$ and $\psi:(H,Y)\to (G,X)$; note that $\phi(X)= Y$ and
$\psi(Y)=X$ in this case. For $(G,X)$ and $(H,Y)$ to be \emph{weak
twins} we only require $\phi$ and $\psi$ to be injective homomorphisms
with $\phi(X)= Y$ and $\psi(Y)=X$. Let us point out that rayless
graphs $G$ and $H$ are (strong resp.\ weak) twins if and only if the
tuples $(G,\emptyset)$ and $(H,\emptyset)$ are (strong resp.\ weak)
twins.

\medskip

As we have noted, subgraphs of rayless graphs do not have larger rank.
Moreover, if a subgraph $G'$ of a rayless graph $G$ has the same rank
as $G$, then $K(G')\subseteq K(G)$ since $K(G)\cap V(G')$ is a set as
in~\ref{separate} of Definition~\ref{rank}. We thus have:

\begin{lemma}\label{fixedkernels}
  Let $G$ and $H$ be rayless graphs, and let there be injective
  homomorphisms $\phi:G\to H$ and $\psi:H\to G$. Then $\phi(K(G))=
  K(H)$ and $\psi(K(H))=K(G)$.
\end{lemma}
In particular, the lemma implies that if $(G,X)$ and $(H,Y)$ are
twins, then $(G,X\cup K(G))$ and $(H,Y\cup K(H))$ are twins too.
\medbreak

Let $G$ and $H$ be rayless graphs, and let $X\subseteq V(G)$ and
$Y\subseteq H$ be finite vertex sets. We write $\bar X$ as a
shorthand for $X \cup K(G)$, and define $\bar Y$ analogously. Assume
there are (strong) embeddings $\phi:(G,X)\to (H,Y)$ and $\psi:(H,Y)\to (G,X)$ and set
$\iota:= \psi\circ\phi$. Since, by Lemma~\ref{fixedkernels}, $\iota$
induces an automorphism on (the subgraph induced by)
the finite set $\bar X$ there exists a $k$ with
$\iota^k\restriction\bar X=\text{\rm id}_{\bar X}$. By replacing $\phi$ with
$\phi\circ\iota^{k-1}$, we may assume that
\begin{equation}\label{idonX}
  \begin{minipage}[c]{0.8\textwidth}\em
    $\phi:(G,X)\to (H,Y)$ and $\psi:(H,Y)\to (G,X)$ are embeddings so
    that the restriction of $\iota=\psi\circ\phi$ to $\bar X$
    coincides with $\text{\rm id}_{\bar X}$.
  \end{minipage}\ignorespacesafterend
\end{equation}

Assume now that $(G,X)$ and $(H,Y)$ are isomorphic by virtue of an
isomorphism $\gamma$. In that case, abusing symmetry and notation,
let us write $(G,X)\simeq_\eta (H,Y)$, where $\eta$ denotes the
isomorphism $X\to Y$ induced by $\gamma$. Denote by $\mathcal C_G$ the set of
all subgraphs $G[C\cup\bar X]$ of $G$, where $C$ is a component of
$G-\bar X$. For $A\in\mathcal C_G$ set
\begin{equation*}
  I_G(A):=\{D\in\mathcal C_G : (D,\bar X)\simeq_\text{\rm id}(A,\bar X)\}.
\end{equation*}

\begin{lemma}
  \label{isolem}
  Let $G$ and $H$ be rayless graphs, and let $X\subseteq V(G)$ and
  $Y\subseteq V(H)$ be finite. The following statements are
  equivalent.
  \begin{enumerate}
  \item\label{isotuples}
	$(G,X)$ and $(H,Y)$ are isomorphic.
  \item\label{compbij}
  	There is a bijection $\alpha:\mathcal C_G\to\mathcal C_H$ and an isomorphism
  	$\eta:G[\bar X]\to G[\bar Y]$ with $\eta(X)=Y$ so that
  	$(A,\bar X)\simeq_{\eta}(\alpha(A),\bar Y)$ and $|I_G(A)|=
  	|I_H(\alpha(A))|$ for all $A\in\mathcal C_G$.
  \end{enumerate}
  Moreover, if~\ref{isotuples} and~\ref{compbij} hold, then $\alpha$,
  $\eta$, and the isomorphism $\phi:(G,X)\to (H,Y)$ can be
  chosen so that $\phi\restriction\bar X=\eta$ and $\phi(A)=\alpha(A)$
  for every $A\in\mathcal C_G$.
\end{lemma}

\begin{proof}
  First assume that \ref{isotuples} holds and let $\phi:(G,X)\to(H,Y)$
  the isomorphism certifying this fact. Put $\eta:=\phi\restriction
  \bar X$. Observe that, by Lemma~\ref{fixedkernels}, for
  every $A\in\mathcal C_G$ there is a $B\in\mathcal C_H$ with $\phi(A)=B$; set
  $\alpha(A):=B$. Clearly, $\alpha$ is a bijection and $(A,\bar X)
  \simeq_\eta(\alpha(A),\bar Y)$. It remains to show that
  $|I_G(A)|=|I_H(\alpha(A))|$ for all $A\in\mathcal C_G$. Indeed, for every $C\in
  I_G(A)$ we have $\alpha(C)\in I_H(\alpha(A))$: Since $(A,\bar X)\simeq_\text{\rm id}
  (C,\bar X)$, by virtue of an isomorphism $\gamma$ say, $\phi\circ
  \gamma\circ\phi^{-1}$ is an isomorphism certifying $(\alpha(A),\bar Y)
  \simeq_\text{\rm id}(\alpha(C),\bar Y)$. Hence we obtain $|I_H(\alpha(A))| \ge |I_G(A)|$ and
  analogously $|I_G(A)| \ge |I_H(\alpha(A))|$.

  Now assume that \ref{compbij} holds. Then for every $A\in\mathcal C_G$ there
  is an isomorphism $\phi_A:A\to\alpha(A)$ that witnesses $(A,\bar X)
  \simeq_\eta  (\alpha(A),\bar Y)$. Now the function $\phi:G\to H$
  defined by $\phi\restriction A:= \phi_A$ for every $A$ is an
  isomorphism of $(G,X)$ and $(H,Y)$ satisfying $\phi\restriction\bar X=\eta$ and $\phi(A)=\alpha(A)$ for every $A\in\mathcal C_G$.
\end{proof}

We call the tuple $(G,X)$ \emph{connected} if $G-X$ is connected.

\begin{lemma}\label{mainlem}
  Let $(G,X)$ and $(H,Y)$ be strong twins, where $G$ and $H$ are
  rayless graphs, and $X\subseteq V(G)$ and $Y\subseteq V(H)$ finite.
  Then $(G,X)$ has infinitely many strong twins. If both $(G,X)$ and
  $(H,Y)$ are connected, then $(G,X)$ has infinitely many connected
  strong twins.
\end{lemma}

Before we prove the lemma let us remark that it immediately implies
the strong version of Theorem~\ref{mainthm} if we set $X=Y=\emptyset$.

\begin{proof}[Proof of Lemma~\ref{mainlem}]
  We proceed by transfinite induction on the rank of $G$. For rank $0$
  the statement is trivially true as finite graphs do not have twins.
  We may thus assume that $G$ has rank $\kappa>0$ and that the lemma is true
  for rank smaller than~$\kappa$.

  Assume there exists a $C_0\in\mathcal C_G$ so that $(C_0,\bar X)$ has a
  connected twin. Then, as $C_0$ has rank smaller than $\kappa$, the
  inductive hypothesis provides us with infinitely many connected
  twins $(C_i,X_i),~i>0$, of $(C_0,\bar X)$. By applying~\eqref{idonX}
  to $(C_0,\bar X)$ and $(C_i,X_i)$ we may assume that the restrictions
  to $\bar X$ and $X_i$, respectively, of the mutual embeddings are
  inverse isomorphisms. Hence, by identifying $X_i$ with $\bar X$ by
  this isomorphism we may assume that the twins have the
  form $(C_i,\bar X)$ and that the corresponding embeddings
induce the identity on $\bar X$.
  Denote by $\mathcal T$
  the set of $C\in\mathcal C_G$ for which either $(C,\bar X)\simeq_\text{\rm id}
  (C_0,\bar X)$, or for which $(C,\bar X)$ is a twin of $(C_0,\bar X)$
  by virtue of mutual embeddings that each induce the identity on $\bar X$.
  For every~$i\in\mathbb N$, define $G_i$ to be the graph obtained
  from $G$ by replacing every $C\in\mathcal T$ by a copy of $C_i$.

The construction ensures two properties. First,
there are strong embeddings $(G,X)\to (G_i,X)$ and $(G_i,X)\to (G,X)$
for every $i$. So, if infinitely many of the $(G_i,X)$ are non-isomorphic,
we have found infinitely many twins of $(G,X)$.
Second,
for $j\neq k$
it follows that $|I_{G_k}(C_j)|=0\not= |I_{G_j}(C_j)|$. Consequently,
Lemma~\ref{isolem} implies
\begin{equation}
\label{notid}
(G_j,\bar X)\not\simeq_\text{\rm id} (G_k,\bar X).
\end{equation}

Assume that for distinct $i,j,k$ the tuples
$(G_i,X)$, $(G_j,X)$ and $(G_k,X)$ are isomorphic. Thus, by Lemma~\ref{isolem} there are
isomorphisms $\eta$
between $\bar X\subseteq V(G_i)$ and $\bar X\subseteq V(G_j)$
and $\eta'$ between $\bar X\subseteq V(G_i)$ and $\bar X\subseteq V(G_k)$
so that $(G_i,\bar X)\simeq_\eta (G_j,\bar X)$ and
$(G_i,\bar X)\simeq_{\eta'} (G_k,\bar X)$.
Now, if $\eta=\eta'$, then the resulting isomorphism between $G_j$ and $G_k$
would induce the identity on $\bar X$, which is impossible by~\eqref{notid}.
  As there are only finitely many automorphisms of the
  finite set $\bar X$, we deduce that each $(G_i,X)$ is isomorphic to only finitely many
  $(G_j,X)$. Therefore we can easily find among the $(G_i,X)$
  infinitely many that are pairwise non-isomorphic.

  Finally, we claim that if $(G,X)$, i.e.\ $G-X$, is connected, then so is each
  $(G_i,X)$, i.e.\ $G_i-X$. Indeed, by construction there is an embedding
  $(G,X) \to (G_i,X)$ that restricts to the identity on $\bar X$ and whose image meets
  all components of $G_i-\bar X$. As $G-X$ is connected, as well as each
  component of $G_i-\bar X$, we deduce that $G_i-X$ is connected.

  Thus, we may assume from now on that
  \begin{equation}\label{isotwin}
  	\emtext{
  	  for each $C\in\mathcal C_G$, $(C,\bar X)$ has no connected twin.
	}
  \end{equation}
  By symmetry, the same holds for $(H,Y)$.

Let $\phi:(G,X)\to (H,Y)$ and $\psi:(H,Y)\to (G,X)$ be strong embeddings, and
recall that by~\eqref{idonX} we may assume that
$\iota:=\psi\circ\phi$ induces the identity map on $\bar X$.
  By Lemma~\ref{isolem} and symmetry, we may assume that for $\eta:=
  \phi\restriction\bar X$ there are $A\in\mathcal C_G$ and $B\in\mathcal C_H$ with
  $(A,\bar X)\simeq_\eta(B,\bar Y)$ so that $|I_G(A)|>|I_H(B)|$.

  Observe that by Lemma~\ref{fixedkernels}
  \begin{equation}\label{components}
	\emtext{
	  for every $C\in\mathcal C_G$ there is a (unique) $D\in\mathcal C_G$ with
	  $\iota(C)\subseteq D$.
	}
  \end{equation}
  Furthermore, we point out that $\iota$ is a strong self-embedding of
  $(G,X)$, and also of $(G,\bar X)$.

  We define a directed graph $\Gamma$ on $\mathcal C_G$ as vertex set by
  declaring $(C,D)$ to be an edge if $\iota(C)\subseteq D$ for $C,D
  \in\mathcal C_G$. We do allow $\Gamma$ to have loops and parallel edges
  (which then, necessarily, are pointing in opposite directions).
  Note that by~\eqref{components} every vertex in $\Gamma$ has out-degree one. Define
  $\mathcal A$ to be the set of those $A'\in I_G(A)$ for which the
  unique out-neighbour does not lie in $I_G(A)$.

  Suppose that distinct $A_1,A_2\in I_G(A)$ are mapped by $\phi$ into
  the same $B'\in\mathcal C_H$. If $A_1$ (and then also $A_2$) is finite, then
  $|V(B')|>|V(A_i)|$ for $i=1,2$ since the injectivity of $\phi$
  implies $\phi(A_1)\cap \phi(A_2) = \bar Y$. Consequently, we obtain
  $B'\notin I_H(B)$. Let now $A_1$ and  $A_2$ be infinite. Unless
  $\text{\rm rk}(B')>\text{\rm rk}(A_1)=\text{\rm rk}(A_2)$ it follows that $\phi(K(A_i))\subseteq
  K(B')$ for $i=1,2$. Since $A_1-\bar X$ and $A_2-\bar X$ are
  connected the kernels $K(A_i-\bar X)$ are non-empty (but finite).
  Again from $\phi(A_1)\cap \phi(A_2) = \bar Y$ we obtain that $K(B')$
  has larger cardinality than either of $K(A_1)$ and $K(A_2)$, which
  implies $B'\notin I_H(B)$. Therefore, we have in all cases that
  $B'\notin I_H(B)$. Since~\eqref{isotwin} and~\eqref{components}
  necessitate that $\phi(A')$
  is contained in an element of $I_H(B)$ for every $A'\in I_G(A) \setminus
  \mathcal A$ we deduce that $|\mathcal A|\ge |I_G(A)|-|I_H(B)|$.
  Thus, it holds that
  \begin{equation}\label{freespace}
	\emtext{
	  $\mathcal A\neq\emptyset$, and if $I_G(A)$ is infinite, then we have
	  $|\mathcal A|=|I_G(A)|$.
	}
  \end{equation}

  \noindent
  By construction, the set $\mathcal A$ is independent in $\Gamma$.
  Moreover,
  \begin{equation}\label{indacyc}
	\begin{minipage}[c]{0.8\textwidth}\em
	  there is no directed path in $\Gamma$ starting in $\mathcal A$
	  and ending in $I_G(A)$, and there is no directed cycle containing any
	  $A'\in\mathcal A$.
	\end{minipage}\ignorespacesafterend
  \end{equation}
  To prove~\eqref{indacyc}, suppose that $C_1,\ldots,C_k$ is a directed
  path in $\Gamma$ with $C_1\in\mathcal A$ and $C_k\in I_G(A)$ (possibly
  even $C_k\in\mathcal A$). Since repeated application of $\iota$
  maps every $(C_1,\bar X)$ into any $(C_i,\bar X)$ and likewise
  $(C_i,\bar X)$ into $(C_k,\bar X)\simeq_\text{\rm id} (C_1,\bar X)$, we deduce
  that $(C_i,\bar X)\simeq_\text{\rm id} (C_j,\bar X)$ for $i,j\in\{1,\ldots,k\}$, as they cannot be
  twins by~\eqref{isotwin} (recall that $\iota\restriction\bar X=\text{\rm id}_{\bar X}$ by~\eqref{idonX}).
However, $(C_1,\bar X)\simeq_\text{\rm id} (C_2,\bar X)$ violates $C_1\in\mathcal A$.
The same arguments hold if $C_1,\ldots,C_k$ is a
  directed cycle that meets~$\mathcal A$.

  Define $\mathcal A^-$ to be the set of all $C\in\mathcal C_G$ from
  which there is a nontrivial directed path in $\Gamma$ ending in
  $I_G(A)$ (in particular, $I_G(A)\setminus\mathcal A \subseteq \mathcal
  A^-$). Setting $\mathcal A^+:=\mathcal C_G\setminus(\mathcal
  A\cup\mathcal A^-)$ we see with~\eqref{indacyc} that $(\mathcal A^-,
  \mathcal A,\mathcal A^+)$ partitions~$\mathcal C_G$. By definition,
  the out-neighbour of an $A'\in\mathcal A$ does not lie in $\mathcal
  A$, and by~\eqref{indacyc} the out-neighbour does not lie in
  $\mathcal A^-$ either. Hence, we have $\iota(A')\subseteq\bigcup
  \mathcal A^+$. On the other hand, the definition of $\mathcal A^-$
  implies that the out-neighbour of every $A^+\in\mathcal A^+$ is
 contained in $\mathcal A^+$. Thus it follows that $\iota(A^+)
  \subseteq \bigcup\mathcal A^+$. In summary, we obtain:
  \begin{equation}\label{plusminus}
	\emtext{
	  $(\mathcal A^-,\mathcal A,\mathcal A^+)$ partitions~$\mathcal
	  C_G$ and $\iota\left(\bigcup\mathcal A\cup\bigcup\mathcal A^+\right)
	  \subseteq\bigcup\mathcal A^+.$
	}
  \end{equation}

  We claim that there exists a strong self-embedding $\gamma:(G,X)\to
  (G,X)$ that induces the identity on $\bigcup I_G(A)\setminus\mathcal A$ (in
  particular on $\bar X$) and satisfies
  \begin{equation}\label{makefree}
	\emtext{
	  $\gamma(G)\cap\bigcup\mathcal A=\bar X$.
	}
  \end{equation}
  On $\bar X$ we define $\gamma$ to be the identity. For every other
  vertex $v\in V(G)$ we consider the unique $C\in\mathcal C_G$ containing $v$.
  If $C\in\mathcal A^-$ we set $\gamma(v):=v$, and if $C\in\mathcal A
  \cup\mathcal A^+$ we put $\gamma(v):=\iota(v)$. Note that
  by~\eqref{components} it holds that for every $C\in\mathcal C_G$ we have $\gamma
  \restriction C=\text{\rm id}_C$ or $\gamma\restriction C=\iota\restriction C$.
  It is immediate from~\eqref{plusminus} that~\eqref{makefree} holds.
  Moreover, since the identity as well as $\iota$ are strong
  self-embeddings it follows from~\eqref{plusminus} that $\gamma$ is
  one, too.

  If $I_G(A)$ is infinite, then by~\eqref{freespace} we change $\gamma$
  on each component in $I_G(A)\setminus\mathcal A$ so as to obtain a strong
  self-embedding $\varphi$ whose image avoids $\bigcup I_G(A)\setminus\mathcal
  A - \bar X$. Then $\beta:=\varphi^2$ is a strong self-embedding that
  induces the identity on $\bar X$ and satisfies
  \begin{equation}\label{makefreeinf}
	\emtext{
	  $\beta(G)\cap\bigcup I_G(A)=\bar X$.
	}
  \end{equation}

  \medbreak

  Let us now construct infinitely many strong twins of $(G,X)$. Assume
  first that $I_G(A)$ is a finite set. Add a disjoint copy $\tilde A$
  of $A$ to $G$ and identify every vertex in $\bar X$ with its copy in
  $\tilde A$. The resulting graph $G_1$ is clearly a supergraph of
  $G$. But by~\eqref{makefree} we can also embed $(G_1,X)$ in $(G,X)$:
  extend $\gamma$ to an
  embedding of $(G_1,X)$ in $(G,X)$ by mapping $\tilde A-\bar X$ to $A'-
  \bar X$ for some $A'\in\mathcal A$. Here, we use that $\mathcal A
  \neq\emptyset$, by~\eqref{freespace}. Note that $|I_{G_1}(A)|=
  |I_G(A)|+1$. Now we repeat this process, with $G_1$ in the role of
  $G$, so as to obtain $G_2$, and so on. Since $|I_{G_i}(A)| \not=
  |I_{G_j}(A)|$ for all $i \not= j$, we can deduce from
  Lemma~\ref{isolem}, as in the proof of \eqref{isotwin}, that
  each $(G_i,X)$ is isomorphic to only finitely
  many $(G_j,X)$. Therefore we can find among the $(G_i,X)$ infinitely
  many twins of $(G,X)$.

  So, consider the case when $I_G(A)$ contains infinitely many
  elements $A_1,A_2,\ldots$. Set $G_i:=G-(\bigcup I_G(A)\setminus\{A_1,
  \ldots,A_i\}-\bar X)$ for $i\in\mathbb N$. Since,
  by~\eqref{makefreeinf}, $\beta$ can be used to embed $(G,X)$ in
  $(G_i,X)$ we can again find infinitely many twins of $(G,X)$---note
  that $|I_{G_i}(A)|$ takes different (finite) values.

  Finally, observe that in both cases, all the strong twins we
  constructed are connected if $(G,X)$ is.
\end{proof}

\bibliographystyle{amsplain}

redpajama_set_name: RedPajamaArXiv


Every year, the Indiana Poets Society runs a contest with 25 (or so) categories. Each category is sponsored either by a local group, an individual, or, for the top few prizes, the entire association. For three years, Brenda and I were judges representing the Indianapolis Chapter when we were active members. We had to withdraw when her health deteriorated.
The year Brenda was in the nursing home, I had an interesting idea. My idea was that I'd tell a complete story, through poetry, where each "chapter" was an entry to one of the contests. Since the categories were presented backwards, ending with the grand prize winner being announced last, I ordered my poems in the same order. Each poem would meet the criteria for the category. If my poem won the category, it would be read in that presentation. If it didn't win, I'd be able to read it in the open session. If people were paying attention, they would, hopefully, see the story unfold. My plan was there would be some repetition so that people are not only reminded, but if a poem didn't get read, the story will still be complete.
I wrote six poems in the story, but because of life circumstances, I never finished the project. Perhaps one day I will, but it's not a priority at this point in my life. Not only that, I'd have to rework the poems to match the new category listing, which changes every year.
And it is very, very old.
Don't believe in magic, sir?
Very well, may me cash, no refunds allowed.
The price today is cheap, but you'll pay.
You're pretty girl, so fair.
Propose on your knees, yes, yes.
She knows how much you care.
If the ring should see the sun's light.
Gone, she will be, for one full year.
Gone without a trace or clue.
What I tell you now is true!
Like me, though, you will forget.
It's part of the cursed spell.
Your life will be a living hell!
In here, you are totally safe and free.
But no! My new husband! Here I cannot stay.
Graham and I, we're going home today.
See the trees of light? Dazzling glowing leaves?
Crystalline like the magic ring you wear?
Hear the tinkling in the breeze?
See the sky a-swirl, bright stars aglow?
Is this some electronic show?
To keep you just one single day.
No! No! No! Take me home! Allysa cried.
Listen to me, young bride.
For them it will be one full year.
How can this be so? This cannot be.
A magical place for just you and me.
The solstice, the twenty-first of June.
Waiting, watching, asking, have you seen my wife?
No sir. I have not. Is there something wrong?
Remember my Allysa? Five-four, dusky blonde, blue eyes?
Saw her this morning, weren't you going home today?
She's never done anything like this before.
Promise they'll keep watch on into tonight.
If she's anywhere in town, they'll know for sure.
Minimum wage bureaucrats just don't seem to care.
Clang. Clang. Clang. He only had an hour.
But before he got there, those arms came down.
His palms were sweaty, his stomach sour.
He stopped on the line and set the brake.
He relaxed and mindlessly watched the train.
The noise and rumbling made his head ache.
The flashing lights added to his pain.
Hurry, he thought. His time was running thin.
Semi-trailers on flatbeds, oil, coal, and freight.
One after another, with no apparent end.
He checked his watch, he couldn't be late.
Suddenly, the train wheels locked tight.
Sparks showered from the track.
A muffled boom, an explosion to his right.
He thought he was under attack.
Soon the train stopped, blocking Graham's route.
Not now, he screamed, what stupid luck!
He opened the car door and got out.
He saw, three blocks away, the wrecked truck.
He turned and kicked the ground.
Consulted his map for an alternate way.
Back in, he turned the car around.
Cursing, it had been a horrible day.
Nothing could make this day worse.
He thought as he glanced at the rear-view.
On the train, graffiti written in reverse.
Is an official car pulling into the driveway.
The second worst fear is the phone.
Trying to remain calm, but.
The entire world comes shattering down.
Only the voice, no words are ever heard.
It doesn't matter how many children she has.
It doesn't matter how old they are.
It doesn't matter, it doesn't matter.
Tell me again about this magic ring.
Right. Gold setting, one carat sapphire.
Scroll work, very old and worn.
Inscriptions worn off long ago.
A curse? Who told you about it?
At the flea market on East Washington?
Right. The one that's been closed for five years.
You were leaving the hotel.
And you haven't seen her since.
Yes, we talked to them.
No, they didn't see her vanish into thin air.
Right, and neither did you.
Right, but the guy that sold you the ring said.
Sir, you are formally charged with the murder of your wife.
The guy that crossed the median and hit my boss's car was killed. When I was at the nursing home watching the TV news with Brenda, they showed helicopter footage from the accident and I said "That looks like Mike's car." I got the call early the next morning.
I took the day off work so that I could help my parents with their yard sale – especially since most of the stuff being sold was mine. Had I not taken that day off, I would have been in the car with Mike. He was returning to Indy after visiting a client and we had taken the same trip the prior week.
Mike's injuries kept him away from work for over three months, and being the small company we were, this put the business into a death spiral. Brenda's health also steadily declined. I lost the motivation to continue work on this project, though as we've seen already, I didn't stop writing poetry. I would say that the period between June 2001 through December 2001 was probably the darkest period in my life.
Looking back now (over 16 years), I don't know if this is project I want to finish. After retyping these six poems, the memory of what I had planned is clear enough. I've not been part of the poetry society, nor have actively been writing until recently. Who knows what the future will hold?


text:
La série WinChip était un processeur x86 basse consommation basé sur Socket 7 conçu par  et commercialisé par sa société mère .

Il a été produit de 1997 à 1999

Notes et références

Microprocesseur x86

redpajama_set_name: RedPajamaWikipedia


I have been devoted to Target Insurance Services Inc. since 1972 when the company began as McAvoy & Associates, Inc. I started as an assistant to Lou McAvoy and I have watched the company develop and grow into the exceptional business it is today. Through my years of service, I have gained extensive knowledge of the functions of a General Agency and I strongly believe in providing insurance solutions to protect financial dreams.
I am dedicated to managing the overall operations of the facility and staff, assuring that we serve our client's with the highest quality service. The diversity of my tasks keeps me on my toes and created a career I love.
My focus is on creating an organized environment for staff members and clients. Target Insurance Services Inc. provides the Best-in-Class products, and I am proud to be long standing member of the Target team.
Connect with Nita on Linkedin.


Hello Barnes, I mail ordered your tool #30708 for loading 54 caliber Barnes bullets in my Knight MK85. Did it ever occur to your design staff that one might want to use this tool on the end of a ram rod and maybe run a cleaning patch or two down the barrel before loading a 2nd shot. The outside diameter is .540" which does not give any room for a .010" cleaning patch. In these days of on line shopping it is very difficult and costly to return a product so now I'm stuck with an $8 tool which will not meet my needs.


Get Seeds In Lexington: If you haven't ordered seeds yet, you can save postage, see friends, buy seeds from excellent suppliers and support a good cause at the In-Feed Seed Sale March 13. This is perfect timing for the March 15 recommended planting date for many early veggie crops in our part of the planet.
Books, Children, Food: I have not found it easy to follow the links and learn more about this Splendid Table audio story about using children's books to influence children's eating habits positively, but I like the concept, and you may, too. Children's books about food can boost children's interest in fresh food, gardening, and cooking. I plan to ask the good book sleuths at Lexington's Morris Book Shop what books they would suggest for this purpose.


Below you can view a sample of different colours of render that we offer. It is hard to imagine one colour all over a home so we created our own colour render sampler. Click through the slideshow below to see the house in a variety of colours.


Henderson police officers recently helped dozens of local kids in need. They took the kids Christmas shopping on Saturday at Target.
This entry was posted in Uncategorized and tagged 13 Action News, City of Henderson, Henderson, Henderson Police Officers' Association, Henderson Police Officers' Association Charitable Foundation, HPOA, Ken Kerby, KTNV, Shop With a Cop on December 9, 2014 by admin.
Henderson police officers helped dozens of local kids in need.
This entry was posted in Uncategorized and tagged 13 Action News, Children, Henderson Police Officers' Association, Henderson Police Officers' Association Charitable Foundation, HPOA, KTNV, Shop With a Cop, YouTube on December 8, 2014 by admin.
The annual Run for Shelter 5k and 1 Mile Run is coming up on Saturday, Nov. 22.
Even though the race is still days away, the Henderson Police Officers' Association has already made a big donation to the cause.
This entry was posted in Uncategorized and tagged 13 Action News, Henderson, Henderson Police Officers' Association, KTNV, Run for Shelter 5k and 1 Mile Run, S.A.F.E. House on November 18, 2014 by admin.
This entry was posted in Uncategorized and tagged 13 Action News, Channel 13, Children, Cross With a Cop Week, Crossing Guards, Henderson, Henderson Police Officers' Association, HPOA, KTNV on October 28, 2014 by admin.
Ken Kerby appeared on Action News at Midday on Oct. 10 to talk about the first Cross With A Cop Week in Henderson.
This entry was posted in Uncategorized and tagged 13 Action News, Cross With a Cop, Henderson, HPOA on October 10, 2014 by admin.


text:
Tag: Julia Michaels
Playboy Profile: Justin Tranter Is the Hero Pop Needs
READ IT AT PLAYBOY
This one has been a long time coming. Justin Tranter deserves a profile as much as any of the pop stars I've written cover stories on for Billboard: Selena Gomez, Justin Bieber, Fifth Harmony, Cardi B, Nick Jonas… in part because he's cowritten hit songs for all of them, and also (mostly) because he is an incredible human and indefatigable activist who's fought against some long odds to succeed on multiple fronts in a very massive way. You can read all about his exploits in this Playboy profile, but Tranter has been popping up in my work for years. I wrote a piece on his old band Semi Precious Weapons for SPIN in 2010, and have consulted him as a secondary on so many pieces since. He's been a huge part of making pop palatable again, and is helping shape the future for LGBTQ acceptance in America. Plus, he's building schools. Enjoy.
BILLBOARD COVER: ZEDD IS EDM'S ANTI-BRO
READ IT AT BILLBOARD (in print too)
Want a true testament to the delightfulness of my subject this time around? Here's the list of folks who went on the record to say nice things about Zedd: Kesha, Jared Leto, Liam Payne of One Direction, Hailee Steinfeld, Dillon Francis, Interscope CEO John Janick, songwriter/artist Julia Michaels, and DJ-producer Porter Robinson. As for the story, this one takes me into the Hollywood Hills home of the dance/pop genius not only for poker night (excerpted: his brother took me for $40), but for a hang sesh in which he plays piano, reveals his plans for Jeff Buckley's legacy, and shows off a $13,000 side table that fills his living room with rainbows on sunny days. Also, as the headline suggests, there are the myriad ways in which he is not a basic bro.


text:
//******************************************************************************************************
//  PBKDF2.cs - Gbtc
//
//  Copyright © 2014, Grid Protection Alliance.  All Rights Reserved.
//
//  Licensed to the Grid Protection Alliance (GPA) under one or more contributor license agreements. See
//  the NOTICE file distributed with this work for additional information regarding copyright ownership.
//  The GPA licenses this file to you under the MIT License (MIT), the "License"; you may
//  not use this file except in compliance with the License. You may obtain a copy of the License at:
//
//      http://opensource.org/licenses/MIT
//
//  Unless agreed to in writing, the subject software distributed under the License is distributed on an
//  "AS-IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. Refer to the
//  License for the specific language governing permissions and limitations.
//
//  Code Modification History:
//  ----------------------------------------------------------------------------------------------------
//  8/1/2014 - Steven E. Chisholm
//       Generated original version of source code.
//
//******************************************************************************************************

using System;
using System.Collections.Generic;
using System.Security.Cryptography;
using Org.BouncyCastle.Crypto.Digests;
using Org.BouncyCastle.Crypto.Macs;
using Org.BouncyCastle.Crypto.Parameters;

namespace GSF.Security
{
    /// <summary>
    /// A series of HMAC implementations supported by .NET
    /// </summary>
    public enum HMACMethod
    {
        MD5,
        TripleDES,
        RIPEMD160,
        SHA1,
        SHA256,
        SHA384,
        SHA512
    }
    /// <summary>
    /// Implements a generic PBKDF2 <see cref="DeriveBytes"/> that will work from a custom cryptographic transform.
    /// <see cref="Rfc2898DeriveBytes"/> only implements a SHA-1 underlying hash function.
    /// </summary>
    /// <remarks>
    /// It is recommended to use one of the HMAC-SHA implementations unless you understand the implecations
    /// of using something differently.
    /// </remarks>
    public class PBKDF2
        : DeriveBytes
    {
        //See defintion in: http://tools.ietf.org/html/rfc2898

        /// <summary>
        /// Contains the salt, along with an extra 4 bytes at the end to place the block number
        /// </summary>
        private byte[] m_saltWithBlock;
        /// <summary>
        /// The block number, which starts at 1, and increases every time that a new block must be computed.
        /// </summary>
        private int m_blockNumber;
        /// <summary>
        /// A temporary location to store the hashed bytes.
        /// </summary>
        private readonly Queue<byte> m_results = new Queue<byte>();

        private HMac m_hash1;

        private uint m_iterations;

        /// <summary>
        /// Implements a <see cref="PBKDF2"/> algorthim with a user definded MAC method.
        /// </summary>
        /// <param name="method">the HMAC method to use.</param>
        /// <param name="password">the password to use</param>
        /// <param name="salt">the salt. recommended to be at least 64-bit</param>
        /// <param name="iterations">the number of iterations. Recommended to be at least 1000</param>
        public PBKDF2(HMACMethod method, byte[] password, byte[] salt, int iterations)
        {
            if (password is null)
                throw new ArgumentNullException("password");

            switch (method)
            {
                case HMACMethod.MD5:
                    Initialize(new HMac(new MD5Digest()), password, salt, iterations);
                    break;
                case HMACMethod.TripleDES:
                    //Initialize(new MACTripleDES(password), salt, iterations);
                    break;
                case HMACMethod.RIPEMD160:
                    Initialize(new HMac(new RipeMD160Digest()), password, salt, iterations);
                    //Initialize(new HMACRIPEMD160(password), salt, iterations);
                    break;
                case HMACMethod.SHA1:
                    Initialize(new HMac(new Sha1Digest()), password, salt, iterations);
                    //Initialize(new HMAC<SHA1Core>(password), salt, iterations);
                    break;
                case HMACMethod.SHA256:
                    Initialize(new HMac(new Sha256Digest()), password, salt, iterations);
                    //Initialize(new HMAC<SHA256Core>(password), salt, iterations);
                    break;
                case HMACMethod.SHA384:
                    Initialize(new HMac(new Sha384Digest()), password, salt, iterations);
                    //Initialize(new HMACSHA384(password), salt, iterations);
                    break;
                case HMACMethod.SHA512:
                    Initialize(new HMac(new Sha512Digest()), password, salt, iterations);
                    //Initialize(new HMAC<SHA512Core>(password), salt, iterations);
                    //Initialize(new HMACSHA512(password), salt, iterations);
                    break;
                default:
                    throw new ArgumentOutOfRangeException("method");
            }
        }

        private void Initialize(HMac hash, byte[] passwordBytes, byte[] salt, int iterations)
        {
            if (hash is null)
                throw new ArgumentNullException("hash");
            if (salt is null)
                throw new ArgumentNullException("salt");

            hash.Init(new KeyParameter(passwordBytes));
            m_blockNumber = 1;
            m_saltWithBlock = salt.Combine(BigEndian.GetBytes(m_blockNumber));
            m_iterations = (uint)iterations;
            m_results.Clear();
            m_hash1 = hash;
        }

        /// <summary>
        /// When overridden in a derived class, resets the state of the operation.
        /// </summary>
        public override void Reset()
        {
            m_results.Clear();
            m_blockNumber = 1;
        }

        /// <summary>
        /// When overridden in a derived class, returns pseudo-random key bytes.
        /// </summary>
        /// <returns>
        /// A byte array filled with pseudo-random key bytes.
        /// </returns>
        /// <param name="cb">The number of pseudo-random key bytes to generate. </param>
        public override byte[] GetBytes(int length)
        {
            if (length <= 0)
                throw new ArgumentOutOfRangeException("length", "must be positive");

            byte[] results = new byte[length];
            for (int x = 0; x < length; x++)
            {
                if (m_results.Count == 0)
                    ComputeNextBlock();
                results[x] = m_results.Dequeue();
            }
            return results;
        }

        /// <summary>
        /// When overridden in a derived class, releases the unmanaged resources used by the <see cref="T:System.Security.Cryptography.DeriveBytes"/> class and optionally releases the managed resources.
        /// </summary>
        /// <param name="disposing">true to release both managed and unmanaged resources; false to release only unmanaged resources.</param>
        protected override void Dispose(bool disposing)
        {
            if (disposing)
            {
                m_hash1 = null;
            }
            base.Dispose(disposing);
        }

        /// <summary>
        /// Computes the next block of crypto bytes.
        /// </summary>
        private void ComputeNextBlock()
        {
            ComputeNextBlock(m_hash1);
        }

        private void ComputeNextBlock(HMac hash)
        {
            BigEndian.CopyBytes(m_blockNumber, m_saltWithBlock, m_saltWithBlock.Length - 4);

            byte[] final = new byte[hash.GetMacSize()];
            byte[] tmp = new byte[hash.GetMacSize()];

            //InitialPass: U1 = PRF(Password, Salt || INT_32_BE(i))
            hash.Reset();
            hash.BlockUpdate(m_saltWithBlock,0,m_saltWithBlock.Length);
            hash.DoFinal(final, 0);

            final.CopyTo(tmp, 0);

            for (int iteration = 1; iteration < m_iterations; iteration++)
            {
                //U2 = PRF(Password, U1)
                //hash.Reset();
                hash.BlockUpdate(tmp,0,tmp.Length);
                hash.DoFinal(tmp, 0);
                for (int x = 0; x < tmp.Length; x++)
                    final[x] ^= tmp[x];
            }

            m_blockNumber++;
            foreach (byte b in final)
                m_results.Enqueue(b);
        }

        /// <summary>
        /// Implements a <see cref="PBKDF2"/> algorthim with a user definded MAC method.
        /// </summary>
        /// <param name="method">the HMAC method to use.</param>
        /// <param name="password">the password to use</param>
        /// <param name="salt">the salt. Must be at least 64-bit</param>
        /// <param name="iterations">the number of iterations. Must be at least 1000</param>
        /// <param name="length">the number of bytes to return</param>
        /// <returns>
        /// A salted password based on the specified length.
        /// </returns>
        public static byte[] ComputeSaltedPassword(HMACMethod method, byte[] password, byte[] salt, int iterations, int length)
        {
            using (PBKDF2 kdf = new PBKDF2(method, password, salt, iterations))
            {
                return kdf.GetBytes(length);
            }
        }

    }

}

redpajama_set_name: RedPajamaGithub


text:
Jeannie Van Der Hooven Clyde Oberholt
Doug Guggenheim
Played by Josh Lawson
A brilliant, Harvard-educated member of Marty's staff, Doug is a quintessential math geek with mad analytical skills and a big ego surrounding them. He's been the proverbial whipping boy in his pod and the butt of many jokes, primarily for his hopelessly inept stabs at a love life.
A graduate of the National Institute of Dramatic Art in Sydney, Josh Lawson built an impressive career in Australia before moving to the United States. His starring roles in a multitude of Australian television programs include SEA PATROL, CHANDON PICTURES, WILFRED, ALL SAINTS, HOME AND AWAY, UNDERBELLY, THE LIBRARIANS and the critically acclaimed, hit comedy improv series THANK GOD YOU'RE HERE. He made his directorial debut with his short film AFTER THE CREDITS, which he also wrote. The film won Best Comedy at the L.A. Shorts Festival and was nominated for an Australian Writers Guild Award.
Lawson is currently developing a new comedy series, as well as a play for the acclaimed Belvoir Theatre in Sydney. Lawson was part of the critically acclaimed improv comedy troupe 160 CHARACTERS, and toured around the world in various festivals with the company. He wrote award-winning plays, including SHAKESPEAREALISM, THE 11 O'CLOCK and WORK IN PROGRESS, and also wrote for the multi-award-winning Australian sitcom STUPID, STUPID MAN.
Lawson's recent Australia work includes the lead and title role in independent feature ANY QUESTIONS FOR BEN?; the television series AGONY UNCLES; and the upcoming film THE WEDDING PARTY, which earned him a Best Actor award at the Los Angeles Movie Awards, and Best Actor at the New York City International Film Festival. Stateside, Lawson appeared last year in THE CAMPAIGN for Jay Roach; starred in the ABC comedy ROMANTICALLY CHALLENGED and the feature film FREELOADERS. He led the soon-to-be-released films CRAVE AND GROWING UP AND OTHER LIES. He starred in the film ANCHORMAN 2: THE LEGEND CONTINUES for Adam McCay. Most recently, Lawson wrote, directed and starred in THE LITTLE DEATH, which sold to Magnolia for domestic distribution out of the Toronto Film Festival.
Behind the Scenes of Season 5
Don Cheadle On Directing an Episode of House of Lies
Kristen Bell and Don Cheadle Discuss Marty and Jeannie's Relationship.
Hanging With Kristen Bell
Google Hangout: Ben Schwartz and Josh Lawson
Season 5 Guest Stars
Marty Kaan
Jeannie Van Der Hooven
Clyde Oberholt
Roscoe Kaan
Donis Leonard Jr.
Monica Talbot
Dawn Olivieri
Jeremiah Kaan
Adult Content, Graphic Language, Nudity, Violence, Viewer Discretion Advised.
House of Lies © Showtime Networks Inc. All rights reserved.


TVS Motor Company concluded its first South chapter of the Apache Owner's Group (AOG). Over 150 TVS Apache owners rode from cities like Bengaluru, Kochi, Coimbatore, Calicut, Chennai and Madurai to the Mysore plant of TVS Motor Company.
Both the RR 310 and the RTR 200 4V are potent highway machines.
The two-day ride was flagged from a TVS Motor Company dealership on April 6, 2018 at Bengaluru and Coimbatore simultaneously before concluding on April 8, 2018 in Mysore. One of the major highlights of the ride was the visit to the Mysore manufacturing facility of TVS Motor Company, where the Apache motorcycles are built for customers across the globe. The Apache owners got an exclusive and detailed factory tour. They got to experience the first-hand understanding of what goes behind manufacturing the motorcycle. The tour also showcased the quality and testing standards adopted by TVS Motor Company as part of the manufacturing process.
Over 150 TVS Apache owners from 6 cities ride to Mysore & attended the exclusive factory tour.
The group consisted of owners of the whole Apache range (160 cc, 180 cc, 200 cc & the RR 310). Apache Owners Group is a community of passionate and like-minded Apache riders who share their love for racing and riding on a common platform. Today, AOG has an active rider base in more than 30 cities and boasts of over 3,000 customers.


Hi there reader, Thank you on your time to see a page in most picture that we supply. What we tend to be looking at nows an image Amazing Garden Designs. By in this article it is possible to comprehend the particular development associated with precisely what do you have for make your home and the room exclusive. Below we will present one more picture by just hitting any option Next/Prev IMAGE. Amazing Garden Designs The author stacking all of them beautifully to help you recognize the purpose in the past post, so you can build by simply investigating the particular photo Amazing Garden Designs. Amazing Garden Designs definitely neatly from your gallery above, in order to allow you to function to construct a family house or possibly a area more gorgeous. We in addition present Amazing Garden Designs possess been to any people visitors.
You can utilize Amazing Garden Designs, with all the proviso of which the application of the article or snapshot every submit merely tied to persons, not necessarily intended for industrial uses. As well as the creator likewise provides freedom for you to just about every picture, giving ORIGINAL Link this great site. As we have got defined prior to, if without notice you might need a picture, you possibly can preserve the actual image Amazing Garden Designs within mobile phone devices, laptop computer or maybe laptop or computer merely by right-clicking your impression after which pick "SAVE AS IMAGE" or it is possible to download underneath this information. As well as find various other graphics on each article, you may also look in the particular column SEARCH best correct in this internet site. Through the info offered article author ideally, you are able to get something helpful from some of our posts.
Exceptionnel Garden Design | Elegant Garden Design Ideas Interior Design, Architecture And . .
Bon 10 Easy Budget Friendly Ideas To Make A Dream Patio .
Delicieux Amazing Garden Design Ideas YouTube .
Charmant Amazing Garden Designs Home Design Lovely Ideas .
Ordinaire Beautiful Idea Amazing Garden Design Designs Ideas Small Interior Vegetable Modern 100 Fresh Pedia .
Merveilleux Awesome Designer Gardens Designer Gardens Captivating Interior Design Ideas .
Bon Photos Awesome Amazing Garden Design Small Area Ideas Photos Images Decor Beautiful With Images Amazing Garden .
Charmant Amazing Garden Designs Home Design Sweetlooking Ideas .
Gentil Amazing Garden Design Images Design Decor Beautiful With Garden Design Images Home Interior .
Genial Small Home Landscaping | Small Garden Ideas Photos Photograph | Amazing..! Garden Des .
Etonnant Smartness Amazing Garden Designs Small Water Design Furniture LiricoTenore Com Picture Designsphotos .
Attirant Patio Landscaping Designs Fresh Exterior Decoration Amazing Garden Fence Ideas With Fish Pond .
Charmant Garden Plan Ideas Design Download Solidaria .
Merveilleux Amazing Garden Design Idea .
Superbe Garden Design Garden Ideas Landscape Awning . .
Ordinaire Amazing Garden Design Ideas .
Incroyable Lotus Blossoming In Water Near Very Beautiful Garden Pathway Towards Sweet Home .
Superieur Absolutely Smart Amazing Garden Designs Small Home Landscaping Ideas Photos Photograph Des .
17 Amazing Garden Designs Using Rocks .
Beautiful Vegetable Garden Design Small Ideas For Front Yard Designs Layout Affordable Plans View Amazing Bfront Yardb Bb In .
Marvelous Design Ideas Amazing Garden Designs Small Gardens GardenNajwa Com Pictures .
Gardening Amazing Small Garden Designs Most Beautiful Gardens Newest .
Garden Design Best Patio Garden Design Ideas Amazing Patio Gardens Design Ideas For Your Inspiration Garden .
Modern Garden Design Garden Ideas Landscape Ground .
Backyard For Kids Unique Gallery For Amazing Garden Design With Backyard Ideas .
Garden Design With Amazing Landscape Design In The Summer Garden Stock Photo Image With Landscape Flowers .
Awesome Amazing London Garden Design Best Home Design Fantastical In London Garden Design Design Ideas With London Garden Design. .
Amazing Garden Designs With Led Lights Collection Best Pictures Amazing Garden Designs With Led Lights .
Landscape Garden Design Ideas With Amazing Appearance For Amazing Garden Design And Decorating Ideas 11 .
Amazing Garden Design With A Lighted Pond .
Complete Landscape Design U0026 Outdoor Living By New Jersey Company .
50 Creative Ideas For GARDEN Decoration 2016 Amazing Garden Ideas Part.1 YouTube .
Garden Layout Ideas Small Vegetable Design Amazing And Fun Imposing .
Modern Garden Ideas In Small Place Biz Http Wallatar Home Design Snsmcom .
... Garden Design Ideas Small Gardens Malaysia Sixprit Decorps Amazing Garden Design Ideas Photos For Small Gardens ... .
Pipe Dream Garden Seat And Fire Pit .
25 Amazing Garden Bridge Design Ideas That Will Make Your Garden With Amazing Garden Ideas .
More Landscape And Garden Design Ideas (Part 2) .
Amazing Garden Ideas Landscaping Design Ideas For Simple Garden .
Contemporary Small Gardens The Best ... .
The 25+ Best Garden Ideas Ideas On Pinterest | Gardening, Backyard Garden Ideas And Garden .
Small Garden Designs Amazing Yard Makeovers Lawn Gardens Design With Round Dark Grey Ideas And Stunning .
Home Design Creative Ideas For Garden Decoration Amazing Phenomenal Decor .
Garden Design Front House Beautiful Fresh Garden Design Front House 23 Love To Tar Home Decor .
Charming Small Yard Design Ideas | Hgtv As Well As Amazing Garden Design Ideas For Backyards .
Gardening Idea Amazing On Garden Designs And 1248 Best Endless Succulent Ideas Images Pinterest Plants 19 .
Small Space Gardening Ideas Amazing Garden Designs For Spaces Design The Decorating Ks Pictures Of With .
Rock Garden Ideas For Front Yard Amazing Landscaping Ideas With Rocks Ideas About Rock Garden Design .
Amazing Garden Fence For Small Garden Design Ideas .
Garden Shed Designs Amazing Garden Sheds Designs Garden Design With Outdoor Shed Designs .
Home Garden Design Plan Amazing Garden Home Designs .
... Exterior Garden Design In Perfect Designing A Elegant Amazing Gardens Designs S Also ... .
Patio Garden Home Plans Design For Small Balcony Unique Plus Amazing Gardens Pictures Exterior Decoration Glamorous .
Amazing Garden Design And Landscaping Beautiful Home Design Classy Simple To Garden Design And Landscaping Architecture .
Images About Outdoor Lighting Inspirations Amazing Garden Designs With Led Lights Gallery .
Garden Design Landscaping Fine On Designs And Pleasing Inspiration Natural 19. Astonishing ... .
A Flower Garden Could Be A Peaceful And Gorgeous Haven From The Remainder Of The World. Sitting In The Midst Of Sweet Smelling Flowers While Reading A Book ... .
Gardening Ideas, DIY Gardening, Cheap Gardening, Frugal Gardening, Frugal Living, Frugal .
Garden, Marvellous Brown And Green Rectangle Traditional Soil Garden Layout Ideas Ornamental Stylisgh Vegetable Garden .
Small Zen Garden Ideas Plants For Zen Garden Small Backyard Zen Garden Ideas Design Pictures Amazing .
Amazing Garden Design For Small Gardens .
Stunning Backyard Bridge Ideas 25 Amazing Garden Bridge Design Ideas That Will Make Your Garden .
Landscape Architecture Concept Architects London Part Design Flower Garden Designs Georgious Rock Beds And Architectural Drafting .
Top 10 Amazing Garden Path Designs .
25 Amazing DIY Ideas How To Upgrade Your Garden This Year .
The 25+ Best Small Gardens Ideas On Pinterest | Tiny Garden Ideas, Small Garden Inspiration And Small Garden Design .
Modern Small Garden Design Ideas Amazing Garden Designs Ideas With Contemporary Inspirations Designs .
25 Inspiring Backyard Ideas And Fabulous Landscaping Designs .
Modern Front Garden Ideas Source Design For Stylish Homes Amazing Gardens Designs Chestnut Road .


Today I Uploaded 10 images with all are in high clarity version. From manifold photograph in Cartoons for coloring and printing photos, you could have Coloring Pages with design. Although, if you don't appropriate with inspiring creativity, you can still take a look inspiring creativity. Even so I promote you could use as an inspiring creativity decor, although together with has charming design dream. Don't forget for share this Cartoons for coloring and printing top 10 free printable crocodile coloring pages online in 2018 football player coloring pages to friend or your girl friend. So they are can get together with to build they Coloring Pages. I am elated could share along with with to you all. Maybe you can find which all the time are you look for.


text:
Board index ‹ Alternative Energy ‹ Save Our Forests
Time to Rethink Misguided Policies That Promote Biofuels
What is being done to preserve the world's precious forests?
by Wilberforce » Tue Sep 24, 2013 5:45 pm
Time to Rethink Misguided Policies That Promote Biofuels to Protect Climate, Experts Say
Sep. 24, 2013 — Policymakers need to rethink the idea of promoting biofuels to protect the climate because the methods used to justify such policies are inherently flawed, according to a University of Michigan energy researcher.
In a new paper published online in the journal Climatic Change, John DeCicco takes on the widespread but scientifically simplistic perception that biofuels such as ethanol are inherently "carbon neutral," meaning that the heat-trapping carbon dioxide gas emitted when the fuels are burned is fully balanced by the carbon dioxide uptake that occurs as the plants grow.
That view is misguided because the plants used to make biofuels -- including corn, soybeans and sugarcane -- are already pulling carbon dioxide out of the atmosphere through photosynthesis, said DeCicco, a research professor at the U-M Energy Institute and a professor of practice at the School of Natural Resources and Environment.
DeCicco's paper is unique because it methodically deconstructs the life-cycle-analysis approach that forms a basis for current environmental policies promoting biofuels. Instead, he presents a rigorous carbon cycle analysis based on biogeochemical fundamentals to identify conditions under which biofuels might have a climatic benefit. These conditions are much more limited than has been presumed.
"Plants used to make biofuels do not remove any additional carbon dioxide just because they are used to make fuel as opposed to, say, corn flakes," DeCicco said.
DeCicco stressed that research and development are important to create better options for the future. R&D is especially needed for bio-based or other technologies able to efficiently capture and use more carbon dioxide than is already being captured and stored by natural vegetation. But going beyond R&D and into subsidies, mandates and other programs to prop up biofuels is unwarranted, he said.
DeCicco's direct carbon accounting examines carbon sources and sinks (storage sites, such as forests or crop fields) separately, an approach that lends greater clarity about options for addressing carbon dioxide emissions from liquid fuels.
"Biofuels have no benefit at the tailpipe," DeCicco said.
Per unit energy, the carbon dioxide emissions from burning ethanol are just 2 percent lower than those from gasoline. Biodiesel yields carbon dioxide emissions about 1 percent greater than those from petroleum diesel.
"If there is any climate benefit to biofuels, it occurs only if harvesting the source crops causes a greater net removal of carbon dioxide from the air than would otherwise have occurred," DeCicco said.
His paper concludes that for now, it makes more sense to enable plants to soak up carbon dioxide through reforestation and to redouble efforts to protect forests, rather than producing and promoting biofuels.
Corn ethanol production of 14 billion gallons supplied 4.4 percent of total U.S. transportation liquid fuel use in 2011. However, even that small share of liquid fuel supply required 45 percent of the U.S. corn crop.
Biofuels are the presumed replacement for the petroleum-based transportation fuels, gasoline and diesel, that dominate liquid fuel use. In the United States, the federal Renewable Fuel Standard mandates a large increase in biofuels use, which has now reached 16 billion gallons a year, mainly ethanol. But DeCicco pointed out that a recent National Academy of Sciences report concluded that the Renewable Fuel Standard may not reduce greenhouse gas emissions at all, once global impacts are counted.
http://www.sciencedaily.com/releases/20 ... 122455.htm
• The Surgeon General has determined that there is no safe level of exposure to ambient smoke!
• If you smell even a subtle odor of smoke, you are being exposed to poisonous and carcinogenic chemical compounds!
• Even a brief exposure to smoke raises blood pressure, (no matter what your state of health) and can cause blood clotting, stroke, or heart attack in vulnerable people. Even children experience elevated blood pressure when exposed to smoke!
• Since smoke drastically weakens the lungs' immune system, avoiding smoke is one of the best ways to prevent colds, flu, bronchitis, or risk of an even more serious respiratory illness, such as pneumonia or tuberculosis! Does your child have the flu? Chances are they have been exposed to ambient smoke!
Return to Save Our Forests
Jump to: Select a forum ------------------	Particulate Pollution Welcome to the Particle Pollution Forum Related Website Links and Newsletters News Health News Announcements Health Matters Legal Issues Science and Technology Particle Pollution Research For the Experts Opinion Letters, Blogs, and Discussion Groups Smoke Complaints and Advice from our members. Take Action in Your Community: Local Groups Tips and Suggestions Fire Pits Smoke pictures and videos Politics and the Environment American Environmental Issues Canadian Environmental Issues Australian, N.Z., U.K. Environmental Issues World Environmental Issues Alternative Energy Carbon Neutral Energy Climate Change Save Our Forests


Stunning Collector's Antique WALKER'S Excelsior IV Patent Log, Accessories and Original Storage Box. Rare authentic condition... from the rich beautiful original dove-tailed box to the solid brass/bronze instruments and accessories. Just one truly nice find! These were manufactured for use by Yachts, Motor Launches, and Fishing Craft. Circa 1900's.

Included within the interior of the box lid are the Walker Instructions for Fitting, Setting of Hands , Length of Line, Oiling, Hauling In, Testing Speed, and Storage.

This unique article has been stored within my personal maritime museum. It's genuine patina preserved over the years. One could easily spend additional time on this and bring it back to a very shiny restored display piece. I elected to let it's years in service be honored by it's natural appearance.

Contents of box:

Register (with out-rigger and two shies or sling)

Rotator (Spinner)

Hook, Line and Sinker

1/2 Pint Tin Oil Container

Printed on the white log dial face is:

"NAUTICAL MILES" - printed along the top center

"Walker's Excelsior IV Log - center, towards upper portion of face

"Made in England by Thos. Walker & Son Ltd. Birmingham"

Found within the solid brass base of the log, inscribed using raised lettering" UNSCREW". Two round brass mounts display "STARBOARD AFT". The spinner displays the Walker's maker mark of an Anchor with "T.W. EXCELSIOR" engraved just below. The black tin oil can displays just along the screw cap the following: "A REGA PRODUCT" with small symbol.

The rich wood box has a wonderful brass insignia plate with "WALKER'S "EXCELSIOR" IV" inscribed on it. Nice collector's appeal. The two brass hooks which secure the lid are intact and working. Great condition! Overall the items are in very good condition. Again, natural patina or discoloration is found, small scratches and dents, all consistent with the number of years this must have been in service. Please review photos for further condition report.

Item weighs approx. 12 lbs without packaging and shipping box.

Thank you for your interest.
For questions call Steve at (810) 599-5147.


Beheshti's research interests include network security, big data, multidisciplinary research, and curriculum development. He serves as director of Center for Excellence in Knowledge Management and Computational Science at CSUDH to help promote research and education for the college, as well as director of the Computer Science Research Lab, where he conducts research in intrusion detection system and data mining/big data in collaboration.
Beheshti has developed new graduate and undergraduate programs to better prepare students for the workforce, and their studies. He has extensive experience in developing supervised/closed laboratories, and has developed course and lab manuals. Beheshti has received numerous grants to advance technology in education; he is the co-primary investigator for two multi-campus National Science Foundation supported projects: CAHSI-Computing Alliance of Hispanic Serving Institutions extending from California all the way to Puerto Rico, and CAHSI INCLUDES, focused on the South West region. The two projects promote computing and increase the number of Hispanic and other underserved minorities in the field of computing. Beheshti has also hosted a series of workshops for high school teachers to further promote computer science to high school students.


108 EMDs and Dealing Reps FACING LITIGATION EXPOSURE - Beware!
Exempt Market Update is published by the Exempt Market Dealers Association of Canada. This national industry magazine is issued bi-annually and features commentary from the leaders in the private capital markets. All rights reserved. Contents may not be reprinted without written permission. The opinions expressed in articles are not necessarily those of the publisher. Information presented is compiled from sources believed to be accurate; however, the publisher assumes no responsibility for errors or omissions. Articles are not intended to provide legal, accounting or compliance advice as individual situations will differ and should be discussed with a lawyer, accountant, compliance and/or other regulatory compliance professional.


text:
The effects of an EDCs cocktail of BPA + DES + NP
Analysis of individual and combined estrogenic effects of bisphenol, nonylphenol and diethylstilbestrol in immature rats with mathematical models
2019 Study Abstract
Traditional toxicological studies focus on individual compounds. However, this single-compound approach neglects the fact that the mixture exposed to human may act additively or synergistically to induce greater toxicity than the single compounds exposure due to their similarities in the mode of action and targets. Mixture effects can occur even when all mixture components are present at levels that individually do not produce observable effects. So the individual chemical effect thresholds do not necessarily protect against combination effects, an understanding of the rules governing the interactive effects in mixtures is needed. The aim of the study was to test and analyze the individual and combined estrogenic effects of a mixture of three endocrine disrupting chemicals (EDCs), bisphenol A (BPA), nonylphenol (NP) and diethylstilbestrol (DES) in immature rats with mathematical models.
In the present study, the data of individual estrogenic effects of BPA, NP and DES were obtained in uterotrophic bioassay respectively, the reference points for BPA, NP and DES were derived from the dose-response ralationship by using the traditional no observed adverse effect (NOAEL) or lowest observed adverse effect level (LOAEL) methods, and the benchmark dose (BMD) method. Then LOAEL values and the benchmark dose lower confidence limit (BMDL10) of single EDCs as the dose design basis for the study of the combined action pattern. Mixed prediction models, the 3 × 2 factorial design model and the concentration addition (CA) model, were employed to analyze the combined estrogenic effect of the three EDCs.
From the dose-response relationship of estrogenic effects of BPA, NP and DES in the model of the prepuberty rats, the BMDL10(NOAEL) of the estrogenic effects of BPA, NP and DES were 90(120) mg/kg body weight, 6 mg/kg body weight and 0.10(0.25) μg/kg body weight, and the LOAEL of the the estrogenic effects of three EDCs were 240 mg/kg body weight, 15 mg/kg body weight and 0.50 μg/kg body weight, respectively. At BMDL10 doses based on the CA concept and the factorial analysis, the mode of combined effects of the three EDCs were dose addition. Mixtures in LOAEL doses, NP and DES combined effects on rat uterine/body weight ratio indicates antagonistic based on the CA concept but additive based on the factorial analysis. Combined effects of other mixtures are all additive by using the two models.
Our results showed that CA model provide more accurate results than the factorial analysis, the mode of combined effects of the three EDCs were dose addition, except mixtures in LOAEL doses, NP and DES combined effects indicates antagonistic effects based on the CA model but additive based on the factorial analysis. In particular, BPA and NP produced combination effects that are larger than the effect of each mixture component applied separately at BMDL doses, which show that additivity is important in the assessment of chemicals with estrogenic effects. The use of BMDL as point of departure in risk assessment may lead to underestimation of risk, and a more balanced approach should be considered in risk assessment.
Full study (free access) : Analysis of individual and combined estrogenic effects of bisphenol, nonylphenol and diethylstilbestrol in immature rats with mathematical models, Environmental health and preventive medicine, NCBI PubMed PMC6515622, 2019 May 13.
Image credit Helena Yankovska.
DES DiEthylStilbestrol Resources
DES studies on cancers and screening.
DES studies on epigenetics and transgenerational effects.
DES studies on fertility and pregnancy.
DES studies on gender identity and psychological health.
DES studies on in-utero exposure to DES and side-effects.
DES studies on the genital tract.
Papers on DES lawsuits.
DES videos and posts tagged DES, the DES-exposed, DES victims.
Author DES DaughterPosted on 23/05/2019 Categories Blog, DiethylstilbestrolTags DES, Endocrine disruptors, NCBI, research, Safer Chemicals
Previous Previous post: Endocrine disruptors have an impact on reproduction for several generations
Next Next post: Clinical Trials on Vaccines : the Revelations of a Doctor


3. Speeches and addresses of Warren G. Harding, President of the United States, delivered during the course of his tour from Washington, D.C., to Alaska and return to San Francisco, June 20 to August 2, 1923.
6. Address of President Coolidge at memorial exercises at Arlington National Cemetery, Arlington, Va.
7. Address of President Coolidge at joint meeting of American Federation of Arts and American Association of Museums, Washington, D.C.
9. Address of President Hoover on occasion of proclamation of general pact for renunciation of war, at White House, Wednesday, July 24, 1929 at 1 o'clock p.m.
10. Address of President of U.S. on social justice, women, and labor, at Helena, Mont.