text:
Candlemass is a Swedish epic doom metal band established in Stockholm in 1984 by bassist, songwriter and bandleader Leif Edling and drummer Matz Ekström. The band had a defining influence on doom metal, and the genre itself is named after their debut album Epicus Doomicus Metallicus. Along with Pentagram, Saint Vitus and Trouble, Candlemass has been referred to as one of the "big four of doom metal".

After releasing five full-length albums and touring extensively throughout the 1980s and early 1990s, Candlemass disbanded in 1994, but reunited three years later. After breaking up again in 2002, Candlemass reformed in 2004 and have continued to record and perform since then.

History

Formation and early career (1984–1990)
After the breakup of his first band Nemesis, bassist Leif Edling started his own band under the name Candlemass with (session) vocalist Johan Längqvist, drummer Matz Ekström, guitarist Mats "Mappe" Bjorkman and Klas Bergwall. Their first release, Epicus Doomicus Metallicus (1986), immediately secured their standing, positioning the band within metal circles, setting a milestone in the doom metal scene. Following the band's debut album Längqvist was replaced by Messiah Marcolin. By the time the band entered the studio to record their second effort, Nightfall, in 1987, Bergwall and Ekström had left the band. Jan Lindh joined the band on drums, and Lars Johansson joined the band on guitars following the completion of the album.

Candlemass's next two albums were Ancient Dreams (1988) and Tales of Creation (1989). In 1990, the band released a live album Live. Shortly afterward, a dispute between the band members resulted in Messiah Marcolin's departure in 1991.

New singer-era, hiatus and first reunion (1991–2003)
After Marcolin left, Candlemass recruited vocalist Thomas Vikström and recorded Chapter VI (1992). The band then toured in support of that album. By 1994, Candlemass had called it quits, partly because Chapter VI was unsuccessful, and partially because Edling had formed another project under the name of Abstrakt Algebra. With Abstrakt Algebra not doing well, Leif suddenly recruited a new line-up under the name of Candlemass and recorded the album Dactylis Glomerata, which was a combination of songs for a new Abstrakt Algebra CD and some new material. A year later the album From the 13th Sun was released. Both albums featured singer Bjorn Flodqvist.

In 2002, the members of a past Candlemass line-up reunited. They performed some well-received live shows and released another live album. Other albums released by the reformed band were remastered versions of Epicus Doomicus Metallicus, Nightfall, Ancient Dreams, and Tales of Creation. A DVD called Documents of Doom was released as well. The band was working on a new album and recorded some new songs while searching for a record label when differences arose again, resulting in Candlemass disbanding a second time. In the meantime, Leif Edling started a new project, Krux, with former Abstrakt Algebra singer Mats Levén and two members of Entombed.

Second reunion (2004–2006)

In November 2004, the band announced that they had re-united for the second time. They had recorded a new album, named simply Candlemass, with the same line-up. It was released in May 2005. They won a Swedish Grammy for it in 2005.

In 2006 the band announced that a new album was in preparation, to be released sometime in 2007. In October 2006, after much uncertainty regarding Messiah Marcolin's participation, it was settled that Messiah was out for good.

Robert Lowe era (2007–2012)
Candlemass found a new vocalist, Robert Lowe (Solitude Aeturnus), who recorded with the band's ninth album King of the Grey Islands, which was released on 22 June 2007.
The album is self-produced except for four songs produced by Andy Sneap.

On 31 March 2007, Candlemass celebrated a slightly delayed twentieth anniversary. To commemorate the celebration, original singer Johan Längqvist appeared live with the band for the first time. The event was recorded and later released as a DVD.

Mats "Mappe" Bjorkman was sentenced to serve two years behind bars for grand theft in March 2008. He has been convicted of stealing over 35,000 CDs and DVDs priced at around 3 million Sek (Around $500,000).

Candlemass worked on a tenth studio album in 2008. It was intended to be titled Hammer of Doom, but they renamed it to Death Magic Doom because the name coincided with a German festival. The album was scheduled to be released on 27 March 2009, but it was delayed until 3 April 2009.

In 2009, bassist Leif Edling told Soundshock that work on the next Candlemass album would likely begin before 2011. However, this plan fell through, and Leif had stated that the album's release date was pushed back to 2012, in order for the band to concentrate on the 25th anniversary of their 1986 debut Epicus Doomicus Metallicus.

On 14 October 2011, it was announced that Candlemass were signed to the Austrian label Napalm Records, who released their eleventh studio album Psalms for the Dead in June 2012. Despite this, bassist Leif Edling stated that the band would not split up, but wanted to stop before they "get too old and start putting out half-lame albums."

Mats Levén as new singer (2012–2018)

On 2 June 2012, Candlemass announced via their website that Robert Lowe had left the band as vocalist, mainly due to the quality of the live performances and explained to be "a very difficult decision for the band", and was replaced for the band's upcoming shows by longtime friend and collaborator of Candlemass, Mats Levén (of Yngwie Malmsteen, Therion, Treat, and At Vance fame, among others). Levén had earlier worked with Leif Edling in Abstrakt Algebra and Krux and sang on demos from the Candlemass and King of the Grey Islands sessions, found on the box set Doomology. In addition, keyboardist Per Wiberg (ex-Opeth, Spiritual Beggars) also joined the band on stage for these live shows.

In January 2013, Candlemass was voted the greatest Swedish hard rock/metal band of all time by the writers of Sweden Rock Magazine, Scandinavia's biggest hard rock magazine as well as Sweden's biggest music magazine by circulation. They were featured in a list of the 100 greatest Swedish hard rock/metal bands of all time in a special jubilee edition, to celebrate the magazine's 100th issue. In connection with this, it was also revealed that Candlemass, along with death metal band Entombed (No. 2 on the list), were to perform jointly at a special jubilee concert in Stockholm arranged by the magazine. In July 2014, Candlemass headlined the Väsby Rock Festival in their hometown Upplands Väsby.

Despite earlier claims that Psalms for the Dead would be their final album, bassist Leif Edling had stated that he was open to recording new music with Candlemass again. To coincide with the 30th anniversary of Epicus Doomicus Metallicus, Candlemass released the EP Death Thy Lover on 3 June 2016. Additionally, on 29 April 2016, the band released a career-spanning coffee-table book. The book also featured two CDs containing the top picks by Leif Edling and Messiah Marcolin respectively, a CD with rare tracks from their early career (including the Witchcraft demo), and two DVDs with three live performances.

Return of Johan Langquist (2018–present)
On 3 September 2018, Candlemass announced the return of Johan Langquist to the band after a 32-year hiatus. The band stated, "We wanted to find our way back to the roots of Candlemass, back to the soul and essence of the band. Johan Langquist is back and we hope this will give us some new energy and kickstart the heart of doom again. We don't know if it will last 10 more years or even 5, but if it will give us just another year of having fun and playing the music that we love so much, it will be a blast! The circle is closed, Johan is back!" The band also announced that they were recording a new album for a 2019 release, making it not only the first Candlemass studio album since 2012's Psalms for the Dead, but their first with Langquist since 1986's Epicus Doomicus Metallicus.

On 6 December 2018, Candlemass announced that their twelfth album was titled The Door to Doom and would be released on 22 February 2019. It was also revealed that the album would include a guest appearance by Black Sabbath's Tony Iommi, who contributes to a guitar solo to one of the album's tracks "Astorolus – The Great Octopus". The band released an EP The Pendulum on 27 March 2020. According to bassist Leif Edling, Candlemass will likely not release their new studio album until 2022 or 2023.

On 18 August 2022, the band announced their thirteenth studio album, Sweet Evil Sun, would be released on 18 November.

Influences
Candlemass' musical style is markedly influenced by early Black Sabbath. Edling, the band's main songwriter and sole constant member, has been influenced by Black Sabbath, as well as bands like Blue Öyster Cult, Mercyful Fate/King Diamond, Bachman–Turner Overdrive, Rush, Nazareth, the Jimi Hendrix Experience, Judas Priest, Motörhead and Venom.

Personnel

Members

Current members
 Leif Edling – bass (1984–1994, 1997–2002, 2004–present), vocals (1984–1986)
 Mats "Mappe" Björkman – rhythm guitar (1984–1994, 2002, 2004–present)
 Lars Johansson – lead guitar (1987–1994, 2002, 2004–present)
 Jan Lindh – drums, percussion (1987–1994, 2002, 2004–present)
 Johan Längqvist – vocals (1986, 2018–present)

Former members
 Mike Wead – lead guitar (1987)
 Klas Bergwall – lead guitar (1984–1987)
 Matz Ekström – drums, percussion (1984–1987)
 Messiah Marcolin – vocals (1986–1991, 2002–2006)
 Thomas Vikström – vocals (1991–1994)
 Carl Westholm – keyboards (1997–1999)
 Michael Amott – guitars (1997–1999)
 Björn Flodkvist – vocals (1997–2002)
 Jejo Perkovic – drums, percussion (1997–2002)
 Mats Ståhl – guitars (1999–2002)
 Robert Lowe – vocals (2006–2012)
 Mats Levén – vocals (2006, 2012–2018)

Line-ups

Timeline

Recording timeline

Discography

Studio albums

Live albums
Live (1990)
Doomed for Live – Reunion 2002 (2002)
No Sleep 'til Athens (2010)
Ashes to Ashes (2010)
Epicus Doomicus Metallicus – Live at Roadburn 2011 (2013)
Live at the Marquee 1988 (2013)
Dynamo Doom (2019)

Compilation albums
The Best of Candlemass: As It Is, as It Was (1994)
Black Heart of Candlemass (2002)
Diamonds of Doom (2003) (limited vinyl record)
Essential Doom (2004)
Dactylis Glomerata & Abstrakt Algebra II (previously unreleased album) (2008)
Introducing (2013) (career spanning album)
Behind the Wall of Doom (2016)

Box sets
Doomology (2010)

EPs and singles
Samarithan (1988)
At the Gallows End (1988)
Sjunger Sigge Fürst (1993)
Wiz (1998)
Nimis (2001)
At the Gallows End/Samarithan (2005)
Dark Reflections/Into The Unfathomed Tower (2005)
Mirror Mirror/The Bells Of Acheron (2005)
Solitude/Crystal Ball (2005)
Assassin of the Light (2005)
Black Dwarf (with Robert Lowe on vocals) (2007)
Lucifer Rising (2008)
If I Ever Die (2009)
Don't Fear the Reaper (2010)
Dancing in the Temple of the Mad Queen Bee (13 April 2012)
Candlemass vs. Entombed (Limited edition CD, recorded for Sweden Rock Magazine's 100th issue)
Death Thy Lover (2016)
Dark Are the Veils of Death (2017)
House of Doom (2018)
The Pendulum (2020)

Demos
Witchcraft (1984)
Second demo (1984)
Tales of Creation (1985)
Demo with Marcolin (1987)

DVDs
Documents of Doom (2002)
The Curse of Candlemass (2005)
Candlemass 20 Year Anniversary (2007)
Ashes to Ashes Live (2010)

References

External links

 Candlemass official webpage

Swedish doom metal musical groups
Musical groups established in 1984
Musical quintets
Nuclear Blast artists
Napalm Records artists
Articles which contain graphical timelines
Metal Blade Records artists
Swedish heavy metal musical groups

redpajama_set_name: RedPajamaWikipedia


Welcome to Bangkok, Thailand - Land Of Smiles!
So you've decided on a vacation in Bangkok?
People say that it's the "Trip Of A Lifetime" - because it's considered expensive.
In reality, it is actually very cheap - Thailand being one of the cheapest destinations on the planet! It is also one of the most exciting - with a vibrant night life and amazing sights!
We are in the business of making your vacation - both memorable and economical.
Obviously - renting an apartment is an economical alternative to staying at hotels - saving you 1,000's of Baht.
We are in a position to offer you excellent accommodation at very reasonable rates. Our Testimonials Page says it all!


text:
webselectnews
Program gives older adults a playbook for healthy aging
By ANNA MARIE LUX
The Janesville Gazette
JANESVILLE, Wis. (AP) _ When we are young, goals seem straightforward.
Get an education. Find a meaningful career. Nurture lifelong relationships.
As we age, the road ahead might not seem as clear, especially after retirement.
``On the day you retire, it's like, `Gee, I'm done. Now what do I do?''' Barb Hefti said.
The Janesville woman is finding insight and guidance in a new course offered by the Rock County Council on Aging.
``You have to make the best of your life,'' Hefti told The Janesville Gazette. ``It doesn't just come to you. You have to amplify your thinking. You have to grow and blossom.''
The free Aging Mastery Program is meant to help people consider what growing older means and to challenge old preconceptions.
Paula Schutt, director of the council on aging, said the self-directed, in-home course encourages people to embrace their gift of longevity by spending more time each day doing things that are good for them and others.
``Life expectancy has increased,'' Schutt said. ``People who are 50 and 60 today are living such different lives than people did years ago. Some need guidance on what to do with the extra time. The course gives you something to reflect on.''
Finding new purpose
Schutt suggests that people ages 50 and older can benefit from the course's practical tips for aging well.
Six topics are covered in detail, including how to find purpose as well as health and well-being.
``The (aging mastery) kit is a way to go through the pieces of your life and ask, `How can I make my life richer and more valuable?''' Schutt said. ``Once you hit 50, it is a good time to start reflecting.''
She suggested that now, when many older people are staying home because of the coronavirus, is a good time to embrace the program.
Schutt first offered the course in Beloit when she worked at the Beloit Senior Center. Before the pandemic, she planned to partner with area libraries and present the course over 10 weeks.
Now that won't happen until it is safe.
``In the meantime, we have this marvelous kit that will give people a good introduction to the class,'' Schutt said.
She is passionate about the program because she knows it improves people's lives.
Some older people suffer from depression after retiring.
``I would equate retirement to the empty nest syndrome,'' Schutt explained. ``When you are actively raising kids, you have a purpose. I know as a mother, it hit me hard when the kids were gone. I didn't feel I had purpose. Retirement is the same thing.''
So many people identify with what they do.
``Once you don't have the job and those work friends, it can become empty very quickly,'' Schutt said. ``All of a sudden, there is no purpose. It's a real change of life, and you need to work your way through it. Everyone needs purpose in every stage of their lives.''
Hefti was eager to learn from the playbook provided with the Aging Mastery Program.
``You have another life when you become a senior,'' the 71-year-old former teacher said. ``The book helps you focus on positive things and to get yourself into a healthy routine.''
She praised the course for tips on how to:
_ Decrease isolation and reduce depression.
_ Increase brain activity.
_ Set small goals that can make big differences.
``For a while, the coronavirus was getting me down,'' Hefti said. ``All of a sudden, life kind of stopped. I wasn't getting much done. Now, I am getting things accomplished.''
Hefti has had health issues but refuses to be grumpy and negative.
``I learned not to take my life for granted when I was diagnosed with MS,'' she said. ``I became a person who appreciated a good day of feeling well and accomplishing something. It's all part of the book.''
Mary Shepherd of Beloit also is reading through the program.
``I find the playbook offers great suggestions and offers things to my life I have not thought about,'' Shepherd said. ``I reread a lot of things and mark pages that pertain to me. It has really helped.''
The 73-year-old said she doesn't want to be ``a little old lady in the house watching TV.''
She was in the day care business for more than 40 years when she retired.
So far, the class has helped her open herself to new experiences.
``I was kind of closed,'' Shepherd said. ``Now, I want to try new things. You never know when you might find something you really like.''
By The Associated Press, Copyright 2019

redpajama_set_name: RedPajamaCommonCrawl


text:
\section{Introduction}
\label{sec:introduction}

In social network analysis, the problem of determining the importance
of actors in a network has been studied for a long time (see, for
example, \cite{Wasserman:1994}). It is in this context that the
concept of the {\em centrality} of a vertex in a network emerged.
There are numerous measures that have been proposed to numerically
quantify centrality which differ both in the nature of the underlying
notion of vertex importance that they seek to capture, and in the
manner in which that notion is encoded through some functional of the
network graph. See~\cite{borgatti.everett}, for example, for a
recent review and categorization of centrality measures.

Paths -- as the routes by which flows (e.g., of information or
commodities) travel over a network -- are fundamental to the
functioning of many networks.  Therefore, not surprisingly, a number
of centrality measures quantity importance with respect to the
sharing of paths in the network.  One popular measure is
\emph{betweenness centrality}.  First introduced in its modern form
by~\cite{freeman77}, the betweenness centrality is essentially a
measure of how many geodesic (ie., shortest) paths run over a given
vertex.  In other words, in a social network for example, the
betweenness centrality measures the extent to which an actor ``lies
between'' other individuals in the network, with respect to the
network path structure.  As such, it is a measure of the control that
actor has over the distribution of information in the network.

The betweenness centrality -- as with all other centrality measures of
which we are aware -- is defined specifically with respect to a single
given vertex.  In particular, vertex centralities produce
an ordering of the vertices in terms of their individual importance,
but do not provide insight into the manner in which vertices act
together in the spread of information across the network.  Insight
of this kind can be important in presenting an appropriately more
nuanced view of the roles of the different vertices, beyond their
individual importance.  A first natural extension of the
idea of centrality in this manner is to pairs of vertices.

In this paper, we introduce such an extension, which we term the
\emph{co-betweenness centrality}, or simply the {\em co-betweenness}.
The co-betweenness of two vertices is essentially a measure of how
many geodesic paths are shared by the vertices, and as such provides
us with a sense of the interplay of vertices across the network.  For
example, the co-betweenness alone quantifies the extent to which pairs
of vertices jointly control the distribution of information in the
network.  Alternatively, a standardized version of co-betweenness
produces a well-defined measure of correlation between flows over the
two vertices.  Finally, an alternative normalization quantifies the
extent to which one vertex controls the distribution of information to
another vertex.

This paper is organized as follows.  In Section~\ref{sec:bg}, we briefly
review necessary technical background.  In Section~\ref{sec:cob},
we provide a precise definition for the co-betweenness and related measures,
and motivate each in the context of an Internet communication network.
An algorithm for the efficient computation of co-betweenness, for all pairs
of vertices in a network, is sketched in Section~\ref{sec:computation},
and its properties are discussed.  In Section~\ref{sec:applications}, we
further illustrate our measures using two social networks whose ties are
reflective of communication.  Some additional discussion is provided in
Section~\ref{sec:disc}.  Finally, a formal description of our algorithm,
as well as pseudo-code, may be found in the appendix.

\section{Background}
\label{sec:bg}

Let $\mathcal{G}=(\mathcal{V},\mathcal{E})$ denote an undirected, connected network graph with
$n_v$ vertices in $\mathcal{V}$ and $n_e$ edges in $\mathcal{E}$.  A \emph{walk} on
$\mathcal{G}$, from a vertex $v_0$ to another vertex $v_{\ell}$, is an
alternating sequence of vertices and edges, say
$\{v_0,e_1,v_1,\ldots,v_{\ell-1},e_{\ell},v_{\ell}\}$, where the
endpoints of $e_i$ are $\{v_{i-1},v_i\}$.  The {\it length} of this
walk is said to be $\ell$.  A \emph{trail} is a walk without repeated
edges, and a \emph{path}, a trail without repeated vertices.  A
shortest path between two vertices $u, v\in \mathcal{V}$ is a path between $u$
and $v$ whose length $\ell$ is a minimum.
Such a path is also called a {\em geodesic}
and its length, the {\em geodesic distance} between $u$ and $v$.  In
the case that the graph ${\cal G}$ is weighted i.e., there is a collection
of edge weights $\{w_e\}_{e\in\mathcal{E}}$, where $w_e\ge 0$, shortest paths
may be instead defined as paths for which the total sum of edge
weights is a minimum.  In the material that follows, we will restrict
our exposition primarily to the case of unweighted graphs, but
extensions to weighted graphs are straightforward.  For additional
background of this type, see, for example, the
textbook~\cite{Clark:1991}.

Let $\sigma_{s t}$ denote the total number of shortest paths that
connect vertices $s$ and $t$ (with $\sigma_{s s} \equiv 1$), and let
$\sigma_{s t}(v)$ denote the number of shortest paths between $s$ and
$t$ that also run over vertex $v$.  Then we define the betweenness
centrality of a vertex $v$ as a weighted sum of the number of paths
through $v$,
\begin{equation}
  \label{eq:45}
  B(v) = \sum_{s,t\in \mathcal{V} \setminus\{ v \}}
  \frac{\sigma_{s t}(v)}{\sigma_{s t}} \text{.}
\end{equation}
Note that this definition excludes the shortest paths that start
or end at $v$.  However, in a
connected graph we will have $\sigma_{s t}(v) = \sigma_{s t}$
whenever $s=v$ or $t=v$, so the exclusion amounts to removing a
constant term that would otherwise be present in the betweenness
centrality of every vertex.

As an illustration, which we will use throughout this section and the
next, consider the network in Figure~\ref{fig:abilene.network}.
\begin{figure}
  \centerline{
  \includegraphics[angle=0,scale=0.4]{newfig_abilene_network.eps}
	}
  \caption{Graph representation
	of the physical topology of the Abilene network.  Nodes represent
	regional network aggregation points (so-called `Points-of-Presence'
	or PoP's), and are labeled according to their metropolitan
	area, while the edges represent systems of optical
	transportation technologies and routing devices.}
  \label{fig:abilene.network}
\end{figure}
This is the Abilene network, an Internet network that is part of the
Internet2 project \cite{address0}, a research
project devoted to development of the `next generation' Internet.  It
serves as a so-called `backbone' network for universities and research
labs across the United States, in a manner analogous to the federal
highway system of roads.  We use this network for illustration
because, as a technological communication network, the notions of
connectivity, information, flows, and paths are all explicit and physical,
and hence facilitate our initial discussion of betweenness and
co-betweenness.  Later, in Section~\ref{sec:applications}, we will
illustrate further with two communication networks from the social
network literature.

The information traversing this network takes the form of so-called
`packets', and the packets flow between origins and destinations on
this network along paths strictly determined according to a set of
underlying routing protocols (Technically, the Abilene network
  is more accurately described by a directed graph.  But, given the
  fact that routing is typically symmetric in this network, we follow
  the Internet2 convention of displaying Abilene using an undirected
  graph.).  A reasonable first approximation of the routing of
information in this network is with respect to a set of unique
shortest paths.  In this case, the betweenness $B(v)$ of any given
vertex $v\in\mathcal{V}$ will be exactly equal to the number of shortest paths
through $v$.  The vertices in Figure~\ref{fig:abilene.network}
correspond to metropolitan regions, and have been laid out roughly
with respect to their true geographical locations.  Intuitively and
according to earlier work on centrality in spatial
networks~\cite{Barrat:2005}, one might suspect that vertices near the
central portion of the network, such as Denver or Indianapolis, have
larger betweenness, being likely forced to support most of the flows
of communication between east and west.  We will see in
Section~\ref{sec:cob} that such is indeed the case.

Until recently, standard algorithms for computing betweenness
centralities $B(v)$ for all vertices in a network had $O(n_v^3)$
running times, which was a stumbling block to their application in
large-scale network analyses. Faster algorithms now exist, such as
those introduced in \cite{brandes01}, which have running time of
$O(n_v n_e)$ on unweighted networks and $O(n_v n_e+n_v^2\log n_v)$ on
weighted networks, with an $O(n_v+n_e)$ space requirement.  These
improvements derive from exploiting a clever recursive relation for
the partial sums $\sum_{t\in\mathcal{V}} \sigma_{s,t}(v)/\sigma_{s,t}$.  As we
will see, the need for efficient algorithms is even more important in
the case of the co-betweenness, and we will make similar usage of
recursions in developing an efficient algorithm for computing this
quantity.

\section{Co-Betweenness}
\label{sec:cob}

We extend the concept of vertex betweenness centrality to pairs of
vertices $u$ and $v$ by letting $\sigma_{s t}(u,v)$ denote the
number of shortest paths between vertices $s$ and $t$ that pass
through both $u$ and $v$, and defining the vertex co-betweenness
as
\begin{equation}
  \label{eq:CoB}
  \mathcal{C}(u,v) = \sum_{\substack{s,t \in \mathcal{V} \setminus \{u,v\}}}
  \frac{\sigma_{s t}(u,v)}{\sigma_{s t}} \text{\;.}
\end{equation}
Thus co-betweenness gives us a measure of the number of shortest
paths that run through both vertices $u$ and $v$.

To gain some insight into the relation between betweenness and
co-betweenness, consider the following statistical perspective.
Recall the Abilene network described in the previous section, and
suppose that $x_{s,t}$ is a measure of the information (i.e., Internet
packets) flowing between vertices $s$ and $t$ in the network.
Similarly, let $y_v$ be the total information flowing through vertex
$v$.  Next, define $\mathbf{x}$ to be the $n_p\times 1$ vector of values
$x_{s,t}$, where $n_p$ is the total number of pairs of vertices
exchanging information, and $\mathbf{y}$, to be the $n_v\times 1$ vector of
values $y_v$.  A common expression modeling the relation between these
two quantities is simply $\mathbf{y} = R\mathbf{x}$, where $R$ is an $n_v\times n_p$
matrix (i.e., the so-called `routing matrix') of $0$'s and $1$'s,
indicating through which vertices each given routed path goes.

Now if $\mathbf{x}$ is considered as a random variable, with uncorrelated elements,
then its covariance matrix is simply equal to the $n_p\times n_p$
identity matrix.  The elements of $\mathbf{y}$, however, will be correlated,
and their covariance matrix takes the form $\Omega=RR^{T}$, by virtue of
the linear relation between $\mathbf{y}$ and $\mathbf{x}$.  Importantly, note that
the diagonal elements of $\Omega$ are the betweenness' $B(v)$.
Furthermore, the off-diagonal elements are the co-betweenness'
$\mathcal{C}(u,v)$.  When shortest paths are not unique, the same results hold
if the matrix $R$ is expanded so that each shortest path between a
pair of vertices $s$ and $t$ is afforded a separate column, and the
non-zero entries of each such column has the value $\sigma_{s,t}^{-1}$,
rather than $1$.  In this case, $R$ may be interpreted as a stochastic
routing matrix.

To illustrate, in Figure~\ref{fig:abilene.CoB},
we show a network graph representation of
the matrix $\Omega$ for the Abilene network.
\begin{figure}
  \centerline{
  \includegraphics[angle=0,scale=0.40]{newfig_abilene_coBC.eps}
  }
  \caption{Graph representation of the betweenness and
	co-betweenness values for the Abilene network.  Vertices are
	in proportion to their betweeness.  The width of each link
	is drawn in proportion to the co-betweenness of the two
	vertices incident to it.}
  \label{fig:abilene.CoB}
\end{figure}
The vertices are again placed roughly with respect to their
actual geographic location, but are now drawn in proportion
to their betweenness.  Edges between pairs of vertices now represent
non-zero co-betweenness for the pair, and are also drawn with a
thickness in proportion to their value.  A number of interesting
features are evident from this graph.  First, we see that, as
surmised earlier, the more centrally located vertices tend to have the
largest betweenness values.  And it is these vertices that typically
are involved with the larger co-betweenness values.  Since the
paths going through both a vertex $s$ and a vertex $t$ are a subset
of the paths going through either one or the other, this tendancy
for large co-betweenness to associate with large betweenness
should not be a surprise.  Also note that the co-betweenness
values tend to be smaller between vertices separated by a larger
geographical distance, which again seems intuitive.

Somewhat more surprising perhaps, however,
is the manner in which the network becomes disconnected.  The
Seattle vertex is now isolated, as there are no paths
that route through that vertex -- only to and from.  Additionally,
the vertices Houston, Atlanta, and
Washington now form a separate component in this graph,
indicating that information is routed on paths running
through both the first two and the last two, but not through all three,
and also not through any of these and some other vertex.  Overall,
one gets the impression of information being routed primarily
over paths along the upper portion of the network in
Figure~\ref{fig:abilene.network}.  A similar observation has been
made in~\cite{chua05:kriging}, using different techniques.

While the raw co-betweenness values appear to be quite informative,
one can imagine contexts in which it would be useful to compare
co-betweenness' across pairs of vertices in a manner that adjusts
for the unequal betweenness of the participating vertices.  The
value
\begin{equation}
\mathcal{C}^{corr}(u,v) = \frac{\mathcal{C}(u,v)}{\sqrt{B(u)B(v)}}
\label{eq:CoB.corr}
\end{equation}
is a natural candidate for a standardized version of the
co-betweeness in (\ref{eq:CoB}), being simply the corresponding
entry of the correlation matrix deriving from $\Omega=RR^T$.

Figure~\ref{fig:abilene.CoB.corr} shows a network graph
representation of the quantities in $\mathcal{C}^{corr}$ for the Abilene
network, with edges again drawn in proportion to the values and
vertices now naturally all drawn to be the same size.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{newfig_abilene_coBC_corr.eps}
        \caption{Graph representation of the standardized
        co-betweenness values $\mathcal{C}^{corr}$ for the Abilene network.
	Vertices are all drawn with equal size.  Edge width is
	drawn in proportion to the standardized co-betweenness
	of the two vertices indicent to it.}
  \label{fig:abilene.CoB.corr}
\end{figure}
Much of this network looks like that in
Figure~\ref{fig:abilene.CoB}.  The one notable exception is that
the magnitude of the values between the three vertices in
the lower subgraph component are now of a similar order to
most of the other values in the other component.  This fact may be
interpreted as indicating that among themselves, adjusting for
the lower levels of information flowing through this part of the
network, these vertices are as strongly `correlated' as many of
the others.

The co-betweenness may also be used to define a directed notion
of the strength of pairwise relationships.  Let
\begin{equation}
\mathcal{C}(u|v) = \frac{\mathcal{C}(u,v)}{B(v)}
\label{eq:CoB.condp}
\end{equation}
denote the relative proportion of shortest paths through $v$ that also
go through $u$.  This quantity may be interpreted as a measure
of the control that vertex $v$ has over the information
that passes through vertex $u$.  Alternatively, under uniqueness of
shortest paths, if from among the set of shortest paths through $v$
one is chosen uniformly at random,
the value $\mathcal{C}(u|v)$ is the probabilty that the chosen path will
also go through $u$.  We call $\mathcal{C}(u|v)$ the {\em conditional
betweenness} of $u$, given $v$.
Note that, in general, $\mathcal{C}(u|v)\ne \mathcal{C}(v|u)$.

Figure~\ref{fig:abilene.CoB.condp} shows a graph representation
of the values $\mathcal{C}(u|v)$ for the Abilene network.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{new_abilene_CoB_CondP_nopajek.eps}
  \caption{Directed graph representation of the conditional
    betweenness values $\mathcal{C}(u|v)$ (given by Eq.~(4)) for the Abilene
    network. Edges are drawn with width in proportion
    to their value of $\mathcal{C}(u|v)$
    and indicate how one vertex (at the head) controls the
    flow of information through another (at the tail).}
  \label{fig:abilene.CoB.condp}
\end{figure}
Due to the asymmetry of these values in $u$ and $v$, arcs are used,
rather than edges, with an arc from $v$ to $u$ corresponding to
$C(u|v)$.  The thickness of the arcs is proportional to these values,
and is therefore indicative of the control exercised on the vertex at
the tail by the vertex at the head.  For improved visualization, we
have used a simple circular layout for the vertices.  Examination of
this figure shows symmetry in the relationships between some pairs of
vertices, but a strong asymmetry between most others.  For example,
vertices like Indianapolis, which were seen previously to have a large
betweenness, clearly exercise a strong degree of control over almost
any other vertices with which they share paths.  More interestingly,
note that certain vertices that are neighbors in the original Abilene
network have more symmetric relationships than others.  The
conditional betweenness' for Atlanta and Washington, DC, are fairly
similar in magnitude, while those for Los Angeles and Sunnyvale are
quite dissimilar, with the latter evidently exercising a noticeably
greater degree of control over the former.

\section{Computation of Co-Betweenness}
\label{sec:computation}

We discuss here the calculation of the co-betweenness values
$\mathcal{C}(u,v)$ in (\ref{eq:CoB}), for all pairs $(u,v)$, from which
the other quantities in (\ref{eq:CoB.corr}) and (\ref{eq:CoB.condp})
follow trivially.
At a first glance, it would appear that an algorithm of
$O(n_v^4)$ running time is necessary, given that the number of vertex
pairs grows as the square of the number of vertices.  Such an
implementation would render the notion of co-betweenness infeasible
to implement in any but network graphs of relatively modest size.
However, exploiting ideas similar to those underlying the algorithms
of~\cite{brandes01} for calculating the betweenness' $B(v)$,
a decidedly more efficient implementation may be obtained,
as we now describe briefly.  Details may be found in the appendix.

Our algorithm for computing co-betweenness involves a three-stage
procedure for each vertex $v\in\mathcal{V}$.  In the first stage, we perform a
breadth-first traversal of the network graph $\mathcal{G}$, to quickly compute
intermediary quantities such as $\sigma_{s v}$, the number of shortest
paths from a source $s$ to each other vertex $v$ in the network; in
the process we form a directed acyclic graph that contains all
shortest paths leading from vertex $s$.
In the second stage, we iterate through each vertex in order of
decreasing distance from $s$ and compute a score $\delta_s(v)$ for
each vertex that is related to its contribution to the
co-betweenness. These contributions are then aggregated in a
depth-first traversal of the directed acyclic graph, which is
carried out in the third and final stage.

In order to compute the number of shortest paths $\sigma_{s v}$ in
the first stage, we note that the number of shortest paths from
$s$ to a vertex $v$ is the sum of all shortest paths to each parent
of $v$ in the directed acyclic graph rooted at $s$, namely,
\begin{equation}
  \label{eq:61}
  \sigma_{s v} = \sum_{t\in p_s(v)} \sigma_{s t} \text{.}
\end{equation}
In the case of an undirected graph, this can be computed in the
course of a breadth-first search with a running time of $O(n_e)$.

In the second stage, we compute $\delta_s(v)$
using the recursive relation established in Theorem~6 of
\cite{brandes01},
\begin{equation}
  \label{eq:60}
  \delta_s(v) = \sum_{w\in c_s(w)} \frac{\sigma_{s v}}{\sigma_{s w}}
  \; (1 + \delta_s(w)) \text{\;,}
\end{equation}
where $c_s(v)$ denotes the set of child vertices of $v$ in the
directed acyclic graph rooted at $s$.

Finally, in the third stage, we compute the co-betweennesses by
interpreting the relation
\begin{equation}
  \label{eq:70}
  \mathcal{C}(u,v) = \sum_{s\in\mathcal{V} \setminus \{ u,v \}}
  \frac{\delta_s(v)}{\sigma_{s v}} \;
  \sigma_{s v}(u)
\end{equation}
as assigning a contribution of $\frac{\delta_s(v)}{\sigma_{s v}}$
to $C(u,v)$ for each of the $\sigma_{s v}(u)$ shortest
paths to $v$ that run through $u$.
We accumulate these contributions at each step of the
depth-first traversal when we visit a vertex $v$ by adding
$\frac{\delta_s(v)}{\sigma_{s v}}$ to
$\mathcal{C}(u,v)$ for every ancestor $u$ of the current vertex $v$.

Our proposed algorithms exploit recursions analogous to
those of~\cite{brandes01} to produce run-times that are
in the worst case $O(n_v^3)$, but in empirical
studies were found to vary like $O(n_v n_e+n_v^{2+p}\log
n_v)$ in general, or $O(n_v^{2+p} \log n_v)$ in the case of sparse graphs.
Here $p$ is related to the total number of shortest paths in the
network and seems to lie comfortably between $0.1$ and $0.5$
in our experience.  In the case of unique
shortest paths, it may be shown rigorously that the running time
reduces to $O(n_v n_e+n_v^2 \log n_v)$, and $O(n_v^2 \log n_v)$ if
the network is sparse as well as `small-world' (i.e., with diameter
of size $O(\log n_v)$).  See the appendix for details.

\section{Additional Illustrations}
\label{sec:applications}

We provide in this section additional illustration of the use of
co-betweenness, based on two other networks graphs.  Both
graphs originally derive from social network analyses in which one goal
was to understand the flow of certain information among actors.

\subsection{Michael's {\it Strike Network}}
\label{sec:strike.net}

Our first illustration involves the strike dataset of~\cite{michael},
which is also analyzed in detail in Chapter 7 of~\cite{pajek.book}.
New management took over at a forest products manufacturing facility,
and this management team proposed certain changes to the compensation
package of the workers.  The changes were not accepted by the workers, and
a strike ensued, which was then followed by a halt in
negotiations.  At the request of management, who felt that the
information about their proposed changes was not being communicated
adequately, an outside consultant
analyzed the communication structure among $24$ relevant actors.

The social network graph in Figure~\ref{fig:strike.group} represents
the communication structure among these actors, with an edge
between two actors indicating that they communicated at some minimally
sufficient level of frequency about the strike.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{new_strikegroup_nopajek.eps}
  \caption{Original strike-group communication network
    of~\cite{michael}. Three subgroups are represented in this
    network: younger, Spanish-speaking employees (black vertices),
    younger, English-speaking employees (gray vertices), and older,
    English-speaking employees (white vertices).  The two union
    negotiators, Sam and Wendle, are indicated by asterix' next to
    their names.  Edges indicate that the two incident actors
    communicated at some minimally sufficient level of frequency
    about the strike.}
\label{fig:strike.group}
\end{figure}
Three subgroups are present in the network: younger, Spanish-speaking
employees (black vertices), younger, English-speaking employees (gray
vertices), and older, English-speaking employees (white vertices).  In
addition, the two union negotiators, Sam and Wendle, are indicated by
asterix' next to their names.  It is these last two that were
responsible for explaining the details of the proposed changes to the
employees.  When the structure of this network was revealed, two
additional actors -- Bob and Norm -- were approached, had the changes
explained to them, which they then discussed with their colleagues,
and within two days the employees requested that their union
representatives re-open negotiations.  The strike was resolved soon
thereafter.

That such a result could follow by targeting Bob and Norm is not
entirely surprising, from the perspective of the network structure.
Both are cut-vertices (i.e., their removal would disconnect the
network), and are incident to edges serving as bridges (i.e., their
removal similarly would disconnect the network) from their respective
groups to at least one of the other groups.

Co-betweenness provides a useful alternative characterization, one
which explicitly emphasizes the patterns of communication in the
network, as shown in Figure~\ref{fig:strike.group.CoB}.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{modified_new_strikegroup_CoB_nopajek.eps}
  \caption{Co-betweenness for the strike-group communication network.
	   Actors located apart from the network, in the corners,
	   are isolated under this representation, as they have
	   zero betweenness and hence no co-betweenness with any other
	   actors. (Note: Isolated vertices are drawn to have unit
	   diameter, and {\it not} in proportion to their (zero)
	   betweenness.)}
\label{fig:strike.group.CoB}
\end{figure}
As with Figure~\ref{fig:abilene.CoB}, vertices (now arranged in a
circular layout) are drawn in proportion to their betweenness, and
edges, to their co-betweenness.  Bob and Norm clearly have the largest
betweenness values, followed by Alejandro, who we remark also is a
cut-vertex, but incident to a bridge to a smaller subnetwork than the
other two (i.e., four younger Spanish-speakers, in comparison to nine
younger English-speakers and 11 older English-speakers, for Bob and
Norm, respectively).  The importance of these three actors on the
communication process is evident from the distinct triangle formed by
their large co-betweenness values.  Note that for the two union
representatives, the co-betweenness values suggest that Sam also plays
a non-trivial role in facilitating communication, but that Wendle is
not well-situated in this regard.  In fact, Wendle is not even
connected to the main component of the graph, since his betweenness is
zero (as is also true for six other actors).

A plot of the standardized co-betweenness $\mathcal{C}^{corr}$
shows similar patterns overall, and we have therefore not included it
here.  The conditional betweenness
$\mathcal{C}(u|v)$ for this network
primarily shows most of the actors with
large arcs pointing to Bob and Norm, and much smaller arcs pointing
the opposite direction.  This pattern further confirms the influence
that these two actors can have on the other actors in the communication
process.  However, there are also some interesting asymmetrical
relationships among the actors with smaller parts.  For example,
consider Figure~\ref{fig:strike.group.CondP}, which shows the
conditional betweenness among the older English-speaking employees.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{new_strikegroup_CoB_CondP_subset_nopajek.eps}
\caption{Conditional co-betweenness for the older English-speaking
	actors in the strike-group communication network.}
  \label{fig:strike.group.CondP}
\end{figure}
Ultrecht, for example, clearly has potential for a large amount of control
on the communication of information passing through Russ,
and similarly, Karl, on that through John.

\subsection{Zachary's {\it Karate Club} Network}
\label{sec:karate.net}

Our second illustration uses the karate club dataset
of~\cite{zachary77}.
Over the course of a couple of years in the 1970s,
Zachary collected information from the members of a
university karate club, including the number of situations
(both inside and outside of the club) in which interactions
occurred between members. During the course of this study, there
was a dispute between the club's administrator and the principal
karate instructor.
As a result, the club eventually split into two smaller clubs of
approximately equal size---one centered around the administrator
and the other centered around the instructor.

Figure~\ref{fig:zachary.net} displays the network of social
interactions between club members.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{zachary_network_nopajek.eps}
\caption{Karate club network of~\cite{zachary77}. The gray vertices represent
members of one of the two smaller clubs and the white vertices
represent members who went to the other club. The edges are drawn
with a width proportional to the number of situations in which the
two members interacted.}
\label{fig:zachary.net}
\end{figure}
The gray vertices represent members of one of the two smaller clubs
and the white vertices represent members who went to the other
club. The edges are drawn with a width proportional to the number of
situations in which the two members interacted. The graph clearly
shows that the original club was already polarized into two groups
centered about actors 1 and 34, who were the key players in the
dispute that split the club in two.

The co-betweenness for this network is shown in
Figure~\ref{fig:zachary.net.CoB}.
\begin{figure}
  \centering
  \includegraphics[angle=0,scale=0.40]{modified_new_zachary_CoB_nopajek.eps}
\caption{Co-betweenness for the karate club network.
	   Actors in the upper-left and lower-right corners,
	   separated from the connected component, are isolated
	due to zero betweenness.  The two actors in the lower
	right-hand corner (i.e., $a5$ and $a11$) have non-zero
	betweenness, but are bridges, in the sense that they only serve
	to connect to other vertices, and hence have zero
	co-betweenness.  (Note: The vertices for actors with
	zero betweenness are drawn to have unit diameter, for
	purposes of visibility.) }
\label{fig:zachary.net.CoB}
\end{figure}
As in Figure~\ref{fig:zachary.net}, the layout is done using an energy
minimization algorithm.  Again, as in our other examples, the
co-betweenness entries are dominated by a handful of larger values.
As might be expected, actors 1 and 34, who were at the center of the
dispute, have the largest betweenness centralities and are also
involved in the largest co-betweenness'.  More interesting, however,
is the fact that these two actors have a large co-betweenness with
each other -- despite not being directly connected in the original
network graph.  This indicates that they are nevertheless involved in
connecting a large number of other pairs -- probably through key
intermediaries such as actors 3 and 32.  These latter two actors,
while certainly not cut-vertices, nevertheless seem to operate like
conduits between the two groups, quite likely due to their direct ties
to both actor 1 and either of actors 33 and 34, the latter of which
are both central to the group of white vertices.  The co-betweenness
for actors 1 and 32 is in fact the largest in the entire network.

Also of potential interest are the 14 vertices that are isolated from
the network in the co-betweenness representation.  Some of these vertices,
such as actor 8, have strong social interactions with certain other actors
(i.e., with actors 1, 2, 3 and 4), but evidently play a peripheral role in
the communication patterns of the network, as evidenced by their lack of
betweenness.  Alternatively, there are the vertices like
those representing actors 5 and 11, who have some betweenness centrality
but nonetheless find themselves cut off from the connected component
in the co-betweenness graph.  An examination of
the definition of the co-betweenness tells us that such vertices
must be bridge-vertices, in the sense that they only serve to
connect pairs of other vertices, \emph{i.e.}, they only
occur in the middle of paths of length two.

\section{Discussion}
\label{sec:disc}

We introduced in this paper the notion of co-betweenness as a natural
and interpretable metric for quantifying the interplay between pairs
of vertices in a network graph. As we discussed
in different real world examples, this quantity has several interesting features. In
particular, unlike the usual betweenness centrality which orders the vertices according
to their importance in the information flow on the network, the co-betweenness
gives additional information about the flow structure and the correlations between
different actors. Using this quantity, we were able to identify vertices which
are not the most central ones, but which however play a very important role
in relaying the information and which therefore appear as crucial vertices in
the control of the information flow.

In principle, of course, one could continue to define higher-order
analogues, involving three or more vertices at a time.  But the
computational requirements associated with calculating such analogues
would soon become burdensome.  In the case of triplets of vertices,
one can expect algorithms analogous to those presented here to scale
no better than $O(n_v^3)$.  Additionally, we remark that, in keeping
with the statistics analogy made in Section~\ref{sec:cob}, it is
likely that the pairwise `correlations' picked up by co-betweenness
captures to a large extent the more important elements of vertex
interplay in the network, with respect to shortest paths.

Following the tendancies in the statistical physics literature on
complex networks~\cite{Barabasi,Vespignani}, it can be of some
interest to explore the statistical properties of co-betweenness in
large-scale networks.  Some work in this direction may be found
in~\cite{Chua.thesis}, where co-betweenness and functions thereof were
examined in the context of standard network graph models.  The most
striking properties discovered were certain basic scaling relations
with distance between vertices.

On a final note, we point out that, while our discussion here has been
focused on co-betweenness for pairs of vertices in unweighted graphs,
we have also developed the analogous quantities and algorithms for
vertex co-betweenness on weighted graphs and for edge co-betweenness
on unweighted and weighted graphs. Also
see~\cite{chua05:kriging}, where a result is given relating edge
betweenness to the eigen-values of the matrix edge-betweenness
`covariance' matrix, defined in analogy to the matrix $\Omega$ in
Section~\ref{sec:cob}.

redpajama_set_name: RedPajamaArXiv


text:
Q: Parsing simple times in hh:mmaa format DateFormat formatter = new SimpleDateFormat("hh:mmaa");
formatter.parse("01:20pm")

I'm trying to parse times in the format of 01:20pm. If I run the above code, I get the following exception:
java.text.ParseException: Unparseable date: "01:20pm"
    at java.text.DateFormat.parse(DateFormat.java:366)

As far as the format I put in the SimpleDateFormat constructor, I don't see anything wrong. What went wrong here?

A: Your system locale must not recognize AM/PM. Use a Locale that does. Something like,
DateFormat formatter = new SimpleDateFormat("hh:mmaa", Locale.US);

Or, in Java 8+, use the new java.time API like
LocalTime lt = LocalTime.parse("01:20pm",
       DateTimeFormatter.ofPattern("hh:mmaa", Locale.US));

A: Number and date parsing in Java uses the Locale to specify, well, locale-specific symbols. In this case, it is mostly the pm value that is being rejected.
To confirm this, here is a piece of code to exercise all available locales in the VM.
For locales that don't work, I was curious to see why, so instead of parsing a time, I format a valid time instead. Had to enable UTF-8 output, but it's interesting to see.
The really interesting part is that all Spanish (es) locales, except the United States variant (es_US) works fine. Hmmm........
Set<String> good = new TreeSet<>();
Set<String> bad = new TreeSet<>();
for (Locale locale : Locale.getAvailableLocales()) {
    try {
        new SimpleDateFormat("hh:mmaa", locale).parse("01:20pm");
        good.add(locale.toLanguageTag());
    } catch (ParseException e) {
        bad.add(locale.toLanguageTag());
    }
}
System.out.println("Good locales: " + good);

Date time = new SimpleDateFormat("hh:mmaa", Locale.ENGLISH).parse("01:20pm");
System.out.println("Bad locales:");
for (String languageTag : bad)
    System.out.printf("  %-5s: %s%n", languageTag, new SimpleDateFormat("hh:mmaa", Locale.forLanguageTag(languageTag)).format(time));

OUTPUT
Good locales: [be, be-BY, bg, bg-BG, ca, ca-ES, da, da-DK, de, de-AT, de-CH, de-DE, de-GR, de-LU, en, en-AU, en-CA, en-GB, en-IE, en-IN, en-MT, en-NZ, en-PH, en-SG, en-US, en-ZA, es, es-AR, es-BO, es-CL, es-CO, es-CR, es-CU, es-DO, es-EC, es-ES, es-GT, es-HN, es-MX, es-NI, es-PA, es-PE, es-PR, es-PY, es-SV, es-UY, es-VE, et, et-EE, fr, fr-BE, fr-CA, fr-CH, fr-FR, fr-LU, he, he-IL, hi, hr, hr-HR, id, id-ID, is, is-IS, it, it-CH, it-IT, lt, lt-LT, lv, lv-LV, mk, mk-MK, ms, ms-MY, nl, nl-BE, nl-NL, nn-NO, no, no-NO, pl, pl-PL, pt, pt-BR, pt-PT, ro, ro-RO, ru, ru-RU, sk, sk-SK, sl, sl-SI, sr, sr-BA, sr-CS, sr-Latn, sr-Latn-BA, sr-Latn-ME, sr-Latn-RS, sr-ME, sr-RS, tr, tr-TR, uk, uk-UA, und]
Bad locales:
  ar   : 01:20م
  ar-AE: 01:20م
  ar-BH: 01:20م
  ar-DZ: 01:20م
  ar-EG: 01:20م
  ar-IQ: 01:20م
  ar-JO: 01:20م
  ar-KW: 01:20م
  ar-LB: 01:20م
  ar-LY: 01:20م
  ar-MA: 01:20م
  ar-OM: 01:20م
  ar-QA: 01:20م
  ar-SA: 01:20م
  ar-SD: 01:20م
  ar-SY: 01:20م
  ar-TN: 01:20م
  ar-YE: 01:20م
  cs   : 01:20odp.
  cs-CZ: 01:20odp.
  el   : 01:20μμ
  el-CY: 01:20ΜΜ
  el-GR: 01:20μμ
  es-US: 01:20p.m.
  fi   : 01:20ip.
  fi-FI: 01:20ip.
  ga   : 01:20p.m.
  ga-IE: 01:20p.m.
  hi-IN: ०१:२०अपराह्न
  hu   : 01:20DU
  hu-HU: 01:20DU
  ja   : 01:20午後
  ja-JP: 01:20午後
  ja-JP-u-ca-japanese-x-lvariant-JP: 01:20午後
  ko   : 01:20오후
  ko-KR: 01:20오후
  mt   : 01:20WN
  mt-MT: 01:20WN
  sq   : 01:20MD
  sq-AL: 01:20MD
  sv   : 01:20em
  sv-SE: 01:20em
  th   : 01:20หลังเที่ยง
  th-TH: 01:20หลังเที่ยง
  th-TH-u-nu-thai-x-lvariant-TH: ๐๑:๒๐หลังเที่ยง
  vi   : 01:20CH
  vi-VN: 01:20CH
  zh   : 01:20下午
  zh-CN: 01:20下午
  zh-HK: 01:20下午
  zh-SG: 01:20下午
  zh-TW: 01:20下午

redpajama_set_name: RedPajamaStackExchange


text:
NewsWorldEU calls for fast inquiry on Bulgarian journalists' murder
EU calls for fast inquiry on Bulgarian journalists' murder
Leading EU politicians and media activists urged Bulgaria on Monday to conduct a fast investigation into the murder of journalist Viktoria Marinova, as mourners planned vigils across the Balkan country.
Marinova's body was found in a park near the Danube river in her home town of Ruse on Saturday. Prosecutors said she had been raped, then beaten and suffocated.
Bulgarian Interior Minister Mladen Marinov, who traveled to Ruse to oversee the inquiry on Monday, has said there was no evidence so far to suggest a link to Marinova's work as a journalist.
But media focused on her recent work. On her last TV show on Sept. 30 Marinova featured two journalists who were investigating an alleged corruption case involving EU funds. She promised that her recently launched current affairs show 'Detector' would do more of its own investigations.
"Shocked by the horrendous murder of Victoria Marinova. Again a courageous journalist falls in the fight for truth and against corruption," the European Commission's First Vice-President Frans Timmerman tweeted.
"Those responsible should be brought to justice immediately by the Bulgarian authorities."
The European Green Party said authorities should show they were "serious about protecting journalists who are the cornerstone of a functioning democracy".
Marinova is the third journalist murdered in the European Union over the past 12 months.
Daphne Caruana Galizia, Malta's best-known investigative reporter, was killed when a bomb blew up her car in October last year and Slovak journalist Jan Kuciak was shot dead in February.
Vigils were planned in Sofia, Ruse and the northern cities of Vidin and Pleven.
"DNA will reveal the killer of Viki", read the headline on the front page of Standart newswpaper on Monday.
Marinova, who has a seven-year-old daughter, was on the board of the Ruse-based TV station TVN – a popular channel in northeastern Bulgaria which broadcast her show Detector.
Reporters Without Borders said other TVN journalists should get police protection during the investigation. The Committee to Protect Journalists said it was "shocked by the barbaric murder".
https://in-cyprus.com/news/international/bulgarian-investigative-journalist-killed/
By In Cyprus
Human trafficking flourishing in Cyprus, says Human Rights Committee
Erdogan: Turkey will not retreat in Aegean and Mediterranean


Continue reading One of the places in New York I was dying to try after we had moved here was Russ and Daughters.I was following a couple of New York based blogs that were always referring to it and then the Louie episode really pushed me over the edge.We are a progressive online dating agency, which accepts credit card payments, thus immediately enabling you to go to Live Chat and start having fun. I would never have thought that I can fall in love so soon after my break up. Kind regards Tobias, Waiblingen » All Success Stories...Order your subscription and have fun, find a pretty girlfriend or even the One - your life partner.
You will be surprised as to how great your chances are of meeting attractive women from Eastern Europe.Speel de meeste en de leukste gratis , zoals Casino roulette!


text:
"""Defines the JobIdProvider class.
"""

import abc
import hashlib
import random
import sys
import time

from googlecloudsdk.calliope import exceptions

def GenerateJobRandomId():
  return random.SystemRandom().randint(0, sys.maxint)

def GenerateJobTimeInMs():
  return int(time.time() * 1000)

class JobIdGenerator(object):
  """Base class for job id generators."""
  __metaclass__ = abc.ABCMeta

  def Generate(self, job_configuration):
    return self._DoGenerate(job_configuration)

  @abc.abstractmethod
  def _DoGenerate(self, job_configuration):
    """Generates a job_id to use for job_configuration."""

class JobIdGeneratorRandom(JobIdGenerator):
  """Generates random job ids."""

  def _DoGenerate(self, unused_config):
    return 'bqjob_r{0:08x}_{1:016x}'.format(
        GenerateJobRandomId(),
        GenerateJobTimeInMs())

class JobIdGeneratorFingerprint(JobIdGenerator):
  """Generates job ids that uniquely match the job config."""

  def _Hash(self, config, sha1):
    """Computes the sha1 hash of a dict."""
    keys = config.keys()
    # Python dict enumeration ordering is random. Sort the keys
    # so that we will visit them in a stable order.
    keys.sort()
    for key in keys:
      sha1.update('{0}'.format(key))
      v = config[key]
      if isinstance(v, dict):
        self._Hash(v, sha1)
      elif isinstance(v, list):
        for inner_v in v:
          self._Hash(inner_v, sha1)
      else:
        sha1.update('{0}'.format(v))

  def _DoGenerate(self, config):
    s1 = hashlib.sha1()
    self._Hash(config, s1)
    job_id = 'bqjob_c{0}'.format(s1.hexdigest())
    return job_id

class JobIdGeneratorIncrementing(JobIdGenerator):
  """Generates job ids that increment each time we're asked."""

  def __init__(self, inner):
    self._inner = inner
    self._retry = 0

  def _DoGenerate(self, config):
    self._retry += 1
    return '{0}_{1:d}'.format(self._inner.Generate(config), self._retry)

class JobIdProvider(object):
  """Defines a method providing user-specified or randomly generated job IDs.
  """

  def GetJobId(self, job_id_flag, fingerprint_job_id_flag):
    """Returns the job id or job generator from the flags."""
    if fingerprint_job_id_flag and job_id_flag:
      raise exceptions.InvalidArgumentException(
          'The --fingerprint-job-id flag ',
          'cannot be specified with the --job-id flag')
    if fingerprint_job_id_flag:
      return JobIdGeneratorFingerprint()
    elif job_id_flag is None:
      return JobIdGeneratorIncrementing(JobIdGeneratorRandom())
    elif job_id_flag:
      return job_id_flag
    else:
      # User specified a job id, but it was empty. Let the
      # server come up with a job id.
      return None

redpajama_set_name: RedPajamaGithub


Old Technology – So Much Greener!
On one of the self-sufficiency type programmes on telly the other day, I noticed they had a fab chicken house in the shape of a gypsy caravan. Well, I knew it would be silly money, but I thought I'd google it just to look…and…well, suffice it to say, we won't be getting one unless we have a lottery win.
But on the same site (see link below), they were having a sale of other items, so I ordered a gorgeous Victorian style airer – which came on Friday and which we put up today. The simplicity of the idea is just so great: hot air rises – stick the washing up high to maximise its drying power. No need for the evil energy guzzling tumble dryer!
And it looks lovely! Useful and beautiful – William Morris would approve!
« Zero to Landfill…what a load of rubbish?


text:
HomePosts tagged 'alcohol'(Page 2)
Our new Nanny State? The Senate inquiry into tobacco, alcohol, and bicycle helmet laws
September 17, 2015 September 17, 2015 Belinda Reeve Public Health Law	alcohol, Nanny state, public health, tobacco
New Yorkers' had a Nanny. Do Australians have one too?
Earlier this month, Senator David Leyonhjelm announced aSsenate inquiry into legislative and policy measures introduced to restrict personal choice "for the individual's own good," including laws related to tobacco, e-cigarettes, alcohol, marijuana, bicycle helmets, and film classification.
Leaving to one side the irony of a government inquiry into government's unreasonable interference in our lives, many of the products to be considered by the inquiry are of central concern to public health. Smoking remains Australia's largest preventable cause of death and disease, responsible for some 15,000 deaths, and costing Australia $31.5 billion in social and economic costs annually. Alcohol is linked to over 60 different health conditions, and accounts for around 3430 deaths per year.
Public health advocates call for a strong government response to these health problems, because preventive measures are more cost-effective than treatment, and because legislative and policy measures work.
Laws and regulations concerned with restricting the sale or promotion of cigarettes and alcohol are often seen as examples of the "Nanny State" in action, i.e., unwanted government interference in what should be our own, freely-made choices. But it's wrong to frame these measures simply as the state acting "for the individual's own good." Governments have a legitimate interest in ensuring population health, and in preventing the healthcare costs associated with alcohol and tobacco consumption. So too do we, as taxpayers.
Governments also act a check on the powerful corporate interests that have a profound influence on our drinking, smoking, and eating habits. We might as well ask, why isn't there an inquiry into Big Tobacco and Big Alcohol, and their impact on our freedom to live healthy, productive lives?
It's possible for governments to overstep their boundaries, and to introduce measures that are overly paternalistic and completely out of step with community needs. But by adopting the prejudicial language of "personal choice" the Senate inquiry seems to have closed itself off already to the kind of useful debate that we might have about the role of the modern state in protecting population health.
Perhaps the inquiry should consider a new collection papers published in the journal Public Health under the heading "Who's afraid of the Nanny State? Freedom, regulation, and public health." This special issue explores and unpacks the meaning of the Nanny State rhetoric so beloved by Senator Leyonhjelm, drawing upon work by academics from a variety of disciplines. It offers new ways to conceptualise the role of the state, and highlights the vast array of tools available to governments when acting to protect public health.
Don't be fooled by the rhetoric. Laws and policies on bicycle helmets, cigarettes, and alcohol save lives. And they do so in a much less intrusive way than chemotherapy for lung cancer, a liver transplant, or surgery for traumatic brain injury.
Policing parenting: is the Family Court going to punish you for having a drink?
July 29, 2015 July 30, 2015 saschacallaghan Uncategorized	alcohol, children, family law, tobacco
Sascha Callaghan, University of Sydney
News outlets have pounced on a Family Court "order" for parents of a six-year-old boy to not smoke around the child and to limit their alcohol consumption while caring for him. Readers commented that the case represents an unacceptable "intervention by the courts into the personal space of the individual", and that it was an attempt at "social engineering" . The idea of a court intervening in family life to prevent what might seem like fairly ordinary activities, such as occasional tobacco smoking or having a glass of wine or two, might seem like evidence of an overreaching "nanny state". And perhaps it would be if that's actually what happened – but it didn't. It is true, though, that the "right to parent" according to one's own values and proclivities isn't actually unfettered. The state can and will intervene in family life in various circumstances.
A definite jurisdiction
State Supreme Courts have powers to make orders under their protective jurisdiction to allow important medical treatment to go ahead if parents won't consent, for instance. The NSW Supreme Court did exactly that in a 2013 case where a Jehovah's Witness parent refused a life-saving blood transfusion on behalf of their child. State agencies can also intercede in family life under child protection laws when a child is at risk of significant harm. This kind of coercive intervention is reserved for serious cases where the child's basic needs are not being met. And it generally requires much more than a parent who smokes or drinks too much from time to time to trigger intervention. But child protection laws have also been invoked when parents of a severely overweight boy didn't go to hospital for treatment, or appropriately manage his diet (the ten-year-old boy later died from heart failure associated with obesity). And when a father, who believed HIV was an invention of pharmaceutical companies, refused to give his child the antiretroviral medication prescribed by doctors. Not everyone will agree on the limits drawn around decisions parents are allowed to make. But most will agree that the public interest in protecting children means limits must be placed somewhere. And "risk of significant harm" doesn't seem like a bad starting point. In addition to child protection laws, the Family Court will intervene in the parenting of children when asked to do so by parents who cannot agree on the relevant decisions themselves. In settling these disputes, the guiding principle is that the court will act to protect the "best interests of children". But how do courts interpret this rather wide concept, and where do the limits of personal parental prerogatives lie when a court tries to strike a balance between the strongly held views of parents who bitterly disagree?
The particular case
In the case that has provoked so much comment, the Family Court decided that despite the fact the child's mother was his primary carer and was "utterly dedicated to the child's needs", it would be in his best interests to live with his father.
The Family Court will make parenting decisions when asked to do so by parents who can't agree on the decisions themselves. from shutterstock.com The orders were influenced by the mother's preference for the advice of her naturopath over an accredited medical practitioner, which the court found was to the detriment of the child; her "conscientious objection to vaccination"; and her "clear and unwavering belief that the child obtains nothing from an ongoing relationship with his father". The father, on the other hand, appeared to the court to have a better view of the child's medical needs and was "the parent more likely to support [the child] in his relationship with his mother". Among the 45 orders the court made were two proposed by the mother – that both parents be "restrained from smoking in the presence of the child" and that they will refrain from consuming alcohol "to excess", or at least to the point of being unable to drive, while the child is in their care. The father agreed to these, in a suite of orders in which his interests mostly prevailed. These are known as "consent orders" – and they're quite different to coercive interventions under child protection laws. In fact, health-related agreements are becoming a common feature of consent orders in a culture that increasingly values health and wellness, and in which many parents are likely to want assurances from the other that their child will be in a "healthy" environment when not in their care. These kinds of concessions are negotiated in families every day of the week – "take Harry to the physio", or "please can we not have pizza again because last time Sam got sick". In this sense, consent orders reflect familiar family compromises and the parents' own values – rather than an out-of-control nanny state imposing orders on passive parents. It's just that these fairly unremarkable agreements have been written down and stamped by the court because goodwill has evaporated and parents no longer trust each other to honour everyday deals.
The long arm of the law?
Indeed, the most interesting aspect of this case is perhaps not the agreement by both parents not to smoke in front of their child or get so drunk that they can't drive, but that in determining a child's best interests, the overriding priority for the court was securing "the benefit to the child of having a meaningful relationship with both of the child's parents". To many people the idea that a father who had never been in a stable relationship with the mother and had little previous involvement with him should be entitled to a relationship with the child to the extent that his mother's role as primary carer was lost, would seem ludicrous. But the Family Law Act takes the position that a relationship with both parents will, in the absence of risk of harm to the child, be considered paramount. With regard to smoking and drinking, there was agreement between the parents with the imprimatur of the court – rather than an order being "imposed". The most serious issue that remained in dispute was the child's right to a relationship with both his parents – and this was where the court really did impose the values of the Family Law Act. Otherwise, unilateral state intervention is reserved for much more serious cases where significant harm is in the offing. So, you can still have a smoko while your child is at home without fear of being touched by the long arm of the law.
Sascha Callaghan is Lecturer in Health Law & Bioethics at University of Sydney.


Paul Crowley & Co solicitors has bolstered its crime department with the appointment of Lyndsay Clark.
The Liverpool-based firm, which has offices in Anfield and the city centre, has appointed Lyndsay Clark to its growing specialist motor offence team.
With extensive knowledge in road traffic legislation and personal injury, Lyndsay brings a wealth of experience to the firm. Lyndsay is police station accredited and also acts as Duty Solicitor at both the Liverpool and South Sefton Magistrates Court.
The Motor Offence department at Paul Crowley & Co has seen significant growth, in particular due to the recent changes in the law and much stricter penalties.
The team deals with all motor offence matters from speeding right through to causing death by dangerous driving.
Lyndsay adds: "I am delighted to be joining the team at Paul Crowley & Co. With many new driving laws introduced in 2017, including tougher speeding fines and changes to child car seat regulations, it's really important that the public know their rights and seek expert legal advice.
If you have a enquiry in relation to a motoring offence and require expert legal advice call Lyndsay now on 0151 264 7363 or email us.


It can be too much sometimes to come to terms with the loss of your loved one. There are still many feelings that arise, some may surprise you, some will make you angry, others devastating. Remember there are no right or wrong feelings. They are what they are. After a period of time you may still be struggling to come to terms with what has happened and unfortunately, you may find those around you saying things which you feel are unhelpful such as "It's time to move on". This can feel crushing as a part of you cannot move on as it feels as if you are letting go of the person you've lost. This is of course not true, but it's at a time such as this you need to speak to someone about your loss and what it means to you. This is you acknowledging the void that has been left in your life.
You have to accept the inevitable impact the loss has upon you. The unfairness. The why did it happen. The plans you had made together that won't be fulfilled. This can be a difficult thing to be able to do but for your own wellbeing and ability to cope acceptance is key. You cannot change the outcome and you cannot control the uncontrollable no matter how much you may want to. Acceptance is not an act of denial or an act of resigning yourself into a space of nothing matters, acceptance is a strong active state where you learn to recognise what has happened.
Once you've verbally expressed your feelings regarding your loss and accepted the impact it has upon you, then it is time to celebrate your loved one. What did they do? How did they make you feel? How did they make you smile? Start to get into the detail of the happy times. As you do this get into the habit of recognising where in the body you feel those feelings of happiness, joy, the good times. This might seem a strange concept but our bodies store emotions. Currently, you could well be bringing up memories and they are triggering the sadness and grief within you and this is what your body is responding to with tears, rage and so on. We need to change your body's habitual patterning. This is not negating your grief but allowing you to remember your loved one in a way that becomes more beneficial to you. A celebration of the life you had together is important.
This is about bringing the memory of your loved one into your heart. Holding onto possessions and stuff may feel as if you are holding onto the memory of them and whilst familiar can lead to a heaviness within you. Recalling the uniqueness of your loved one, the beauty of who they were and storing that essence within your heart creates a lightness. This feeling will never go away and no-one can ever take it from you. This allows you to release the physical stuff and enable you to let go.
From the place of lightness that you have created, you can start to write about what commissioning a headstone would mean. How it would mark a sense of your love for this person who means so much to you. You can think about the material you want the stone to be made of, perhaps there is a memory associated with a place you've been and you'd like the stone to represent that. Think about how this physical memorial is a symbol of the person you love and how it honours them. Go through the emotions you will feel as you visualise the headstone in place, how you feel as you sit next to it and remember your love, the feelings of remembrance and occasion and how it will honour this person. Write about what you will do after you have the headstone in place to celebrate the life of the person you love. Please write from your heart and write with love and respect. It is from this place that a sense of peace can reside within you as you make a final decision to create a beautiful memorial for the memory of your loved one.
Do take your time with this process, there is no rush and no time limit on how long it takes you to get to a place where you can be at ease with making the decision to commission a beautiful headstone. Make this a beautiful reflection of the life you had together. Remember help is available to you as you make the decision to create a final headstone.


I have just completed my onion harvest for 2011 and by my standards it has been quite a success. Usually by the time I get to harvesting onions they have gone to seed. However the journey to getting to that point can be just as challenging.
I usually start with planting my onions from bought seedlings in June (December for those in the Northern hemisphere). I often find that many of them are eaten by slugs and snails, or disturbed by the scratching of the feline menace (cats), so they never even get started.
However once they get going I find that onions are fairly tough plants. Apart from some really dedicated snails, there doesn't seem to be many pests that will impede their growth. You do however need to keep the weeds down as they compete with the onions and will decrease their final size.
I tend to have a problem with the onions going to seed before they are fully grown. However I have discovered that even if the onion has gone to seed, once you remove the tough core, the onion can be used as normal. It is just that they won't keep as long as they normally would. Perhaps a bowl of French onion soup is in order.
After harvesting onions you should really let them sit out in the sun for a few days to dry out the outer skins so they keep as long as possible. Then just make sure you store them in the dark where the air can circulate around them so they don't go mouldy.
This entry was posted on Sunday, December 18th, 2011 at 10:19 pm	and is filed under Summer, Vegetables.


We offer the widest range of products on the market, including HCFCs, HFCs, HFOs and natural refrigerants, a full range of package size including cylinders, drums, and bulk deliveries, as well as refrigerant recovery, reclaim and waste management services. We can also provide additional support services such as technical advice and engineering installation management.
We sell refrigerants in more than 40 countries throughout America, Europe, Africa, Asia and the South Pacific regions, and operate with many well-known local brands including Linde, BOC, AGA, TEGA, AFROX, SIGAS and PSG.


text:
The Lego Movie 2: The Second Part (2019) — Composer
Holmes and Watson (2018) — Original Music Composer
Hotel Transylvania 3: Summer Vacation (2018) — Composer
Thor: Ragnarok (2017) — Composer
The LEGO Ninjago Movie (2017) — Composer
Beatriz at Dinner (2017) — Composer
Susan Wloszczyna
Pee-wee's Big Holiday (2016) — Composer
Alvin and the Chipmunks: The Road Chip (2015) — Original Music Composer
Sheila O'Malley
Revenge of the Nerds II: Nerds in Paradise (1987) — Written by
The Heart of the Film: Matt Schrader and Marco Beltrami on "Score: A Film Music Documentary"
by Laura Emerick | June 16, 2017 |
An interview with the director of "Score: A Film Music Documentary" and one of its subjects.
The Wes Anderson Collection, Chapter 2: "Rushmore"
by Matt Zoller Seitz | October 16, 2013 |
A video essay on Wes Anderson's second film "Rushmore," by Matt Zoller Seitz and Steven Santos. Second in a series of seven.
#106 March 14, 2012
by Marie Haws | March 10, 2012 |
Marie writes: It's official. I have died and gone to heaven. For here below, as part of an ongoing series exploring Britain's architectural wonders, the Observer's architecture critic Rowan Moore, introduces a spectacular interactive 360-degree panoramic photograph of "The grand staircase in the St Pancras Renaissance hotel" - which I regard as one of the most beautiful pieces of architecture I have ever seen. I adore this building and always will; it's the stuff of dreams. (Click photo to enlarge.)
Go here to explore a 360 panoramic view of the grand staircase!


text:
Q: React Native - The right way to create bridge header in Xcode I'm stuck on manually install RN-onesignal on iOS
already followed the instructions but I got an error RCTOneSignalExtensionService.h is not found
after some research, I found this issue that tell me to manually create bridge header, but I don't know the right way to create a bridge header itself (because this is my first time using macOS)
I've tried this step :

*

*in Xcode project go to File->New->File

*choose Swift file and Targeting to MyProject and OneSignalNotificationServiceExtension then finish

*add #import "RCTOneSignalExtensionService.h" in OneSignalNotificationServiceExtension-Bridging-Header.h

*add $(SRCROOT)/OneSignalNotificationServiceExtension/OneSignalNotificationServiceExtension-Bridging-Header.h at build setting OneSignalNotificationServiceExtension target
but i got an error Bridging header 'MyProjectPath/ios/OneSignalNotificationServiceExtension/OneSignalNotificationServiceExtension-Bridging-Header.h' does not exist

FYI : at this step OneSignalNotificationServiceExtension-Bridging-Header.h file is on my project folder

so i decided to drag n drop the OneSignalNotificationServiceExtension-Bridging-Header.h to OneSignalNotificationServiceExtension folder, but the error still persist
anyone can help me to fix the error?
BTW my Xcode version is Version 8.3.2

A: Same problem, trying to solve this 3 hours.
Make sure you not missing this step:


text:
Andrij Jakowytsch Tschaikowskyj (; * 15. Mai 1857 in Sambir; † 2. Juni 1935 in Kolomyja) war ein ukrainischer Schriftsteller, Jurist und Politiker.

Leben
Nach seinem Abitur, dass er 1877 in Sambir machte, diente er als Wehrpflichtiger in der Armee und studierte anschließend zunächst an der für Fakultät für Philosophie und ein Jahr später an der juristischen Fakultät der Universität Lemberg. Nach abgeschlossenem Studium arbeitete er als Anwalt in Lwiw und eröffnete später in Bereschany eine eigene Anwaltskanzlei. Vor dem Ersten Weltkrieg zog er zurück in seine Geburtsstadt, und nach dem Krieg ließ er sich in Kolomyja nieder, wo er bis zu seinem Lebensende blieb. Bereits während seines Studiums wurde er leitendes Mitglied der Proswita. In dieser Zeit begann er auch mit dem schreiben. 1888 veröffentlichte er sein erstes Werk und erlangte in den folgenden Jahren schnell Bekanntheit in der Ukraine.

Gedächtnis
Ihm ist im J. Kobrynskyj -Museum der Huzulischen Volkskunst  in Kolomyja eine permanente  Ausstellung gewidmet.

Werke (Auswahl)
  (1921), deutsche Übersetzung: Verwegene Steppenreiter: Abenteuer aus der Kosakenukraine, Wuppertal: Kolibri-Verlag, 1972
 deutsche Übersetzung Ritt ins Tatarenland, Wuppertal: Kolibri-Verlag, 1968
  (1910), Lemberg: Aichelberger
 Twory u 8 tomach (gesammelte Werke in 8 Bänden), Lemberg: Tscherwona Kalyna, 1992ff.
 Spohady, lysty, doslidzennja (3 Bände), Lemberg: Naukowa Fundazia Andrija Tschaikowskoho, 2002, ISBN 966-613151-X (Einzelbände ISBN 966-613152-8, ISBN 966-613153-6, ISBN 966-613154-4)

Weblinks

 Biografie Andrij Tschaikowskyj, auf dovidka (ukrainisch)
 Biografie Andrij Tschaikowskyj, auf ukrlit (ukrainisch)

Einzelnachweise

Politiker (Ukraine)
Autor
Literatur (Ukrainisch)
Literatur (19. Jahrhundert)
Literatur (20. Jahrhundert)
Ukrainer
Geboren 1857
Gestorben 1935
Mann


If you're an investor and you don't know about the issues surrounding proxy access this year, you should read this immediately.
NEW YORK (TheStreet) -- Proxy access -- granting certain shareholders the right to include their own nominees to the board of directors in the proxy materials sent out to all shareholders -- is back in the news and on the agenda for many U.S. public companies.
According to Holly J. Gregory, a corporate governance lawyer and partner at Sidley Austin LLP (NYC), such "shareholder activism" has significantly increased over the past three years, and the trend is likely to continue. "By obtaining proxy access," Gregory wrote in a recent report, "activists and other shareholders will have an additional weapon in their arsenal to influence board decisions."
While proxy access has been a salient issue for the past few years, there are two reasons that point to 2015 being a pivotal year: a record number of shareholder proxy access proposals; and more boards of directors proactively considering (and often modifying) their companies' proxy access regulations.
Last year, New York City Comptroller Scott M. Stringer (who oversees pension funds with assets of $165.5 billion) launched a campaign to let shareholders propose directors at 75 companies. As reported by The Wall Street Journal, "The city's resolutions already have passed 41 of 53 concerns, including Priceline and Marathon."
The support of major investment groups, such as TIAA-CREF and their industry group, the Council of Institutional Investors (CII), has clearly added momentum to the proxy access movement.
This year, Holland notes, the SEC removed "a key defense in the form of no-action relief in situations in which a company intends to put forward its own competing proposal."
Proxy advisor policies that discourage other efforts to defend against proxy access proposals have also contributed to the trend.
1. Proxy access is an escalating trend. More than 58% of 84 access resolutions have won majority support, according to Institutional Shareholder Services, a proxy-advisory firm. About 5% of companies in the S&P 500 index now have adopted or are committed to proxy access, ISS estimates.
2. The Council of Institutional Investors (CII) -- which represents 118 pension funds and endowments with over $3 trillion in assets -- is trying to remove various corporate bylaws that effectively restrict or prevent proxy-access mandates, such as requiring investors to own at least 5% of a company's stock before they can nominate directors, or limiting the number of share-holders who can aggregate their holdings in order to meet the ownership requirement.
3. It remains to be seen to be seen what impact proxy access will have on corporate governance. An elected proxy access director will owe the same fiduciary duties as the other directors, although some may perceive proxy access directors as having greater allegiance to the nominating shareholder's interests. For that reason, notes Gregory, there may be a greater risk that the proxy access director is viewed by the rest of the board as an outsider -- or even an adversary.
A higher risk of disagreement among directors may lead to a greater risk of legal challenges -- or board dysfunction.
Special interest shareholders could coordinate to initiate a proxy-access action without the other shareholders realizing the potential or risks of such joint action.
Proxy access can incur additional costs and distractions without necessarily building the company's value or enhancing board performance.
"The big unknown here is: How will proxy access be used? Which companies will be targeted for proxy access nominees? In deciding which companies would receive its proxy access proposal, the Comptroller's office targeted companies with purportedly weak track records on board diversity, climate change, and say-on-pay," said Yafit Cohen of Simpson Thacher & Bartlett LLP, a New York-based law firm.


text:
A Matter of Life and Death
Thinking things through
Philosophy for Juniors
Humfry Hippo
Thoughtful Tales for Little Ones
Selfishness and Guilt
Philosophy for Seniors
Human Needs
Brake Failure on a Matatu
Recently a matatu driver was put in an impossible position.
While returning empty, after dropping off passengers, the brakes failed on the vehicle while driving, at high speed, downhill towards a trading centre on Kampala Road.
Being quick thinking, it was obvious there were two choices:
Immediately ahead there was a large funeral procession with over 200, mainly elderly, people in the road. By keeping straight, many mourners would be killed, but there was a reasonable chance that the driver would survive with injuries.
To the immediate right there was a small rise, with a drive to a house with a young family sitting outside. Steered that way, the family would be killed, and the driver would be injured when the vehicle hit the house.
The Decision
A split-second choice must be made.
What would you do? How would you justify your decision?
Note for Teachers and Group Leaders
The example above is based upon one of the well-known problems in philosophy. How can we make a choice between two unacceptable options? In each of the situations above, people are going to be killed and the driver's injuries are unknowable.
Most of us have been brought up to believe that "killing is wrong".
But, in this case, the driver cannot avoid somebody dying.
Possible lines of reasoning:
Is it better to kill fewer people than more? One line of discussion would be to consider whether, in a case like this, you should go for the option that kills fewer people. This would mean choosing Option 2, where the driver avoids the large funeral procession, which would have killed many, and kills the family, who are fewer in number.
Is it better to save the young rather than the old? Some might argue that the old people at the funeral have already lived their lives, whereas the young family have many years of life in front of them. They could make a big contribution to the community. In this case, the driver would choose option 1 and hit the funeral procession.
Should more important people be saved? If the funeral taking place was that of an important person in the community, then the mourners might have included important elders, community leaders and local politicians. Should these important people be saved rather than an ordinary family?
Kinship Ties
To complicate matters further, do you think the driver might make a different decision if the young family were his own relatives?
Would you make more effort to save people closely related to you than strangers?
Once these options have been discussed, you might want to consider a third option:
On the left of the road, there is a steep embankment, with a deep river below it. If the driver turned sharply left, the vehicle would roll down the embankment and the vehicle would end up at the bottom of the deep river. It would lead to the certain death of the driver but nobody else would be killed. Those at the funeral and the young family would be saved.
Should the driver's life be sacrificed for the sake of others?
In what circumstances might you sacrifice your own life for others?
Would you risk it fighting an intruder who was attacking your home and family?
If you were a soldier in war, would you risk your life to save your comrades.
Would you ever risk your life to save an animal, other than a human one?
Note: Rangers in the National Parks sometimes put their lives at risk to protect animals from poachers. Each year, Rangers in Virunga National Park in the Congo are killed by poachers trying to capture or kill gorillas.
It is very difficult to know how we would react in situations like these above. We don't have long to decide what to do. It does help, however, if we have spent time beforehand thinking about how we might react in such circumstances – and about what personal feelings and values will guide us.
Supplementary Question for the group:
Was the driver of the matatu a man or a woman?
Then ask them: How do you know?
In the passage above it does not tell us whether the driver was a man or a woman. However, it is likely that the group will assume it is a man, because most drivers are.
This would be an opportunity to talk about gender stereotyping. While most drivers are men, it is clear that a matatu could be driven just as well by a woman as a man.
In this modern world, it is surely important not to unfairly discriminate when jobs are being offered. They should be open to all, irrespective of their sex, age, nationality or race. The test should be whether the particular individual is capable of doing the job.
We must all take care not to make unwarranted assumptions.
We should not read more into a story than is there!
A Morality Tale
In a country a long way from here, an aeroplane was suffering from engine trouble. There were 4 people on the plane and only 3 parachutes to save them when they jumped from the plane.
The pilot had his own parachute and immediately jumped out of the plane to save himself.
The second person was The President of the country, who said, "I am such an important and intelligent person, and my people need me, so I must have one of the two parachutes."
Without any discussion: The President grabbed the first parachute and jumped out of the plane to save himself.
He left behind on the plane a schoolchild and the schoolchild's teacher , with just one parachute between them.
The teacher, who was very kind, said to the schoolchild; "You have the rest of your life in front of you; I would like you to take the last parachute and I will stay behind on the plane." (and risk almost certain death!)
At this point, the schoolchild says: "But teacher, when the very important and intelligent President jumped out of the plane, he took my school bag, instead of a parachute."
"He has left us the last two parachutes, so we can both jump from the plane and be saved."
The Moral of this Story: Selfishness does not always pay!
The hard thing is not making a decision, it is thinking about the results of what you have decided.


text:
Q: Resolution of the singularities of the curve $X^2Y^2 + Y^2Z^2 + X^2Z^2=0$
Problem: Let $C=\{[X,Y,Z] \in \mathbb{P^2}\mathbb{C} \mid X^2Y^2 + Y^2Z^2 + X^2Z^2=0\}$.
Resolve the singularities in $C$.

Tried so far: Since the polynomial is symmetric in the three variables, we can suppose wlog $Z=1$. Computing the derivatives we find out that the point $P=[0,0,1]$ is the only singularity on the curve of this kind, and thus there are 3 singularities, namely $P$, $[1,0,0]$ and $[0,1,0]$. We need to study $P$. The curve on the affine plane takes the form $x^2y^2 + y^2 + x^2=0$ with a singularity in the origin $(0,0)$. We attempt a blow up! Should we try $(x,y)=(u,uv)$ and $(x,y)=(uv,u)$ or just one of them? We try out the first one. We get $u^4v^2 + u^2v^2 + u^2=0$. Since $u$ is not $0$ (why??) we get $u^2v^2 + v^2 + 1=0$. Setting $u=0$ (we just said $u$ is not $0$!!! ... ???) we find two possible values for $v$ and thus the singularity should be a node. (are there any other possibilities?) We did it! There are 3 nodes on $C$. Is there a way to write down the equation for the curve with the singularities resolved?
Thanks!

A: It looks like you did all the computations necessary, only that you're a bit confused as to how to interpret what you did.
1) In the chart $(u,v)$ as you used in your answer, the equation $u=0$ cuts out the exceptional divisor (the fiber of the blow up over the origin). The equation $u^4v^2+u^2v^2+u^2=0$ is what you get when you pull back $C$ to the blow up.
However, as you see from the equation, this equation also contains the exceptional divisor (which makes sense, as the original curve passed through the origin). This is called the total transform.
However, we would like to remove these extraneous copies of the exceptional divisor. To do that, we divide the equation $u^4v^2+u^2v^2+u^2=0$ by as many copies of $u$ as possible. In this case, dividing by $u^2$ suffices, and we get the proper transform $u^2v^2+v^2+1=0$, which we can directly check is nonsingular.
2) Blowing up gives a recipe for desingularizing any plane curve. Any smooth curve can be mapped into $\mathbb{P}^2$ with only nodal singularities, but they cannot in general be embedded into $\mathbb{P}^2$, so it makes sense that blowing up doesn't give us an equation for the desingularized curve as a plane curve.
In our case, however, the arithmetic genus of a degree 4 curve is 3. Since there are three nodes, the genus of the desingularized curve is $3-3=0$. This means the desingularized curve is just a $\mathbb{P}^1$.