As an audiophile, you understand the importance of finding speakers that fit your living room. There is so much to consider. Size, shape, look and most importantly sound are all determining factors. Because Wharfedale and other manufacturers understand that you need speakers that can deliver sound-wise without taking up too much space – they offer bookshelf speakers in Melbourne and the rest of Australia. Gone are the days when floor-standing was your only option to get decent sound.
Wharfedale is the world's oldest speaker manufacturer, with more than 85 years of experience producing high quality products. Their bookshelf speakers are developed in-house offering value for money without compromising on sound. If you are a Quad fan, you can't go wrong either. They have an equally impressive track record and continue to lead through innovation, delivering outstanding products every time.
Audio Visual Revolution not only offers speakers from these iconic brands but also stock bookshelf and lifestyle speakers made by other manufacturers such as Cabasse and Mission. Both these brands offer options in the bookshelf range that may fit your budget or style.
With the decision made of which set to buy, all that remains is to position your speakers at ear-level and start listening. To find the ideal set of bookshelf speakers for your Melbourne home, contact AVR today.


text:
BBC Home > BBC News > UK
Blaze that changed firefighting
18 November 07 00:08 GMT
By Clifford Thompson
The King's Cross fire claimed the lives of 31 people on 18 November 1987. The BBC's Clifford Thompson, then a firefighter, was on duty when the disaster struck.
I was based at Stratford fire station in east London. We had just started a 15-hour night shift, when we heard over the radio a major incident had been declared at King's Cross Tube station, and we knew a serious fire was in progress.
During the next few hours, the full horror of the fire unfolded, and news reached us a member of the brigade was missing.
This was the pre-mobile phone era, and we knew something tragic had happened when senior officers at the fire were told to contact the control room by landline.
The news soon reached us that the fire had claimed the life of Station Officer Colin Townsley, who was among the first firefighters to arrive at the incident.
The fire and the subsequent public inquiry by Sir Desmond Fennell led to a number of changes to both firefighting procedures and equipment.
At the time, the uniform worn by firefighters consisted of thin yellow over-trousers, a woollen tunic and cork helmet, which left much of a firefighter's neck and ears exposed, even when wearing breathing apparatus. The gloves would have been more at home in the garden.
Sir Desmond's report, published in November 1988, made more than 150 recommendations.
Soon after the fire, smoking was banned across the entire Tube network - it was a lit match that dropped on to the escalator that started the fire.
Gradually, the old wooden escalators were replaced and Sir Desmond recommended heat and smoke detectors be fitted to rooms housing escalator machinery.
Legislation was passed to cover Tube stations, enforcing minimum safe staffing levels, means of detecting and warning of fires, means of escape and standards of fire-resistant construction.
Improvements were made to personal protective equipment for firefighters - the combed-helmet was replaced by Kevlar headgear, and some fire and rescue services have opted for a design that encloses the ears.
Padded over-trousers and more substantial tunics, with collars were also introduced.
Sir Desmond was scathing in his criticism of the emergency services.
He visited King's Cross just after the fire, and said: "It was horrific, like going down into Hell". His report criticised the firefighters for not being aware of all the access points.
Nowadays, plans to the station are kept outside every Tube on the network to help fire crews in case of an emergency.
Following the 11 September 2001 terror attacks in the United States, the UK government launched a programme to provide specialist resources for tackling major incidents.
By 2004, £56m had been spent on new vehicles and equipment for fire services in England and Wales, and on training firefighters in urban search and rescue (USAR).
USAR teams and equipment from five fire services, including the London Fire Brigade, were used to recover the bodies of three firefighters killed in a warehouse fire in Warwickshire on 2 November 2007.
The fire service is also committed to a new UK-wide digital radio system, known as FireLink, which will enable crews to talk to other emergency services, and between surface and sub-surface locations, although it is not expected to be fully operational until at least 2008.
Related to this story:
King's Cross radio faults remain (18 Nov 07 | UK )
Final King's Cross victim named (21 Jan 04 | UK )
BBC Home
BBC © 2012

redpajama_set_name: RedPajamaCommonCrawl


Beautifully remodeled 3 bedroom, 2 bath with huge bonus room. Home has been completely remodeled with new roof, new floors, new baseboards, new crown molding, newly painted, remodeled baths and kitchen. Large backyard with covered patio and storage shed. This property is located in the amazing Oakland Estates and will sell fast!
I was searching for a Property and found this listing (MLS® #O5741709). Please send me more information regarding 517 Mason St, Altamonte Springs, FL, 32701. Thank you!
I'd like to request a showing of 517 Mason St, Altamonte Springs, FL, 32701 (MLS® #O5741709). Thank you!
517 Mason St is located in the Oakland Ests 2nd Sec neighborhood in Altamonte Springs, FL. This residential property for sale is currently being offered at $250,000. Built in 1966 this 3 bedroom, 2.00 bathroom Central Florida residential property has been listed on RealtyInOrlando.com for 5 days. 517 Mason St is priced at $133 Per Square Foot, and is situated on 0.20 acres of land. Please contact your local Realtor® for more information on 517 Mason St, Altamonte Springs, Florida 32701. Property Listing Reference: MLS number: O5741709.


text:
Harald Oeler (* 1977 in Bietigheim-Bissingen) ist ein deutscher Akkordeonist.

Harald Oeler erhielt mit 6 Jahren seinen ersten Musikunterricht. Ab 1999 studierte er bei Hugo Noth. 2001 wechselte er zu Stefan Hussong an die Hochschule für Musik Würzburg. Sein künstlerisches Diplom legte er mit Auszeichnung ab. Er gewann zahlreiche Musikwettbewerbe, darunter "Jugend musiziert", "Jugend komponiert", "Premio Citta di Castelfidaro". Seit 2004 ist er Stipendiat der "Studienstiftung des deutschen Volkes" und seit 2005 in der Förderung von "Yehudi Menuhin Live Music Now". Er ist Mitglied des "Ensemble Nuages" und der "Ersten deutsche Stubenjazz Combo".
Harald Oeler ist derzeit hauptamtlicher Akkordenlehrer der Akkordeonklasse an der Musikschule der Hofer Symphoniker.

Medien
 Astor Piazzolla - The Next Tango (DVD)
 Bilder Einer Ausstellung (CD)

Weblinks
 Homepage

Akkordeonist
Deutscher
Geboren 1977
Mann

redpajama_set_name: RedPajamaWikipedia


You are here: Home » Maple Leaf Foods and their Real Foods campaign: Give me a break!
Oh, Maple Leaf Foods, how could you do it again? How could you use kids to scare parents into buying your products? First, there was your commercial of a few years ago, where poor Dylan sat alone in the neighbourhood and could not eat hot dogs until you came out with your Natural Selections.
No matter that these hotdogs still contained nitrates, the very compounds that parents were trying to avoid when steering clear of processed meats. You got around it by putting cultured celery extract-the source of the very same compound-in the ingredient list. You stated that you didn't put artificial preservatives in these products.
Once again, you are taking advantage of the concerns of parents by embarking on your campaign of "Real Food". This campaign includes a commercial with kids in a spelling bee showing they can't spell some of the ingredients on the label of processed and ultra-processed foods. Just take a look.
My reaction is give me a break!
While there's no doubt we should be eating more whole foods and fewer ultra-processed foods, the last time I checked bacon and hot dogs, with or without artificial ingredients, still fit into that category. They are indeed ultra-processed foods.
One of the big concerns (there are numerous ones, though) is the amount of sodium they contain. Excess sodium is a huge health problem as it is linked to hypertension and heart and kidney disease and stroke – just to name a few major ills.
I bet, though, that the kids in the spelling bee could easily spell sodium.
Yes, this ingredient is way up there on the list of nutritional concerns and issues. Some countries, such as Britain, have enacted regulations to help their citizens slash their sodium intakes. Here in Canada, where many health groups have long advocated that legislation be introduced to help Canadians decrease their sodium intakes (we consume about double the recommended daily quotas), we have companies like Maple Leaf Foods embarking on campaigns to get us to trust that their products are better for us.
To refresh your memory or in case you didn't know, years ago, Health Canada appointed an expert committee to look at the issue. The Sodium Working Group, as the group was known, suggested that lowering our intake by about 1,800 mg per day would prevent 23,500 cardiovascular disease events each year – that's a decrease of 13%. The direct health care savings, alone, would add up to $1.38 billion per year, and if you include indirect costs, the savings would be $2.99 billion per year.
Check out this real food which doesn't contain ingredients kids might have a tough time spelling.
Note the 880 milligrams of sodium in a 100-gram serving. That's more than half the recommended 1500 milligrams per day – in just one food alone.
Yup, once again Maple Leaf Foods is trying to hoodwink Canadians into thinking their products are more wholesome. Let's tell them we're smarter than that.


Elected civic members of Vavuniyaa North Divisional Council (PS) complain that the Sinhala colonisation is relentlessly targeting the eastern side of their division. The occupying Sinhala Army and its home-guards paramilitary act as the guardians of the colony while the extremist Buddhist monks coordinate the systematic expansion. Various SL ministries provide the infrastructure. Besides, a host of actors from a leading socio-economic NGO with Buddhist philosophy to a local extremist group known as 'Sinhala Power in the North'('Uture Hela Balaya'or 'Utura Rakina Raṭa Surakina Jātika Balaya - Vanni') facilitate it through different approaches. Also, sections of expatriate Sinhalese, including a retired professor from Australia, have funded the housing projects of the scheme. The Sinhala settlers are being radicalised without any provocation or hostility from the Tamils.


text:
Edward Waymire Receives Carver Medal
Edward Waymire, Professor of Mathematics, Oregon State University has received the 2014 Carver Medal from the Institute of Mathematical Statistics (IMS).
Professor Waymire receives the award for manifold contributions to the IMS in many capacities and in particular for exceptional service to the Annals of Applied Probability far beyond his role as its editor.
The Carver Medal was created by the IMS in 2002 in honor of Harry C. Carver, Founding Editor of the Annals of Mathematical Statistics and one of the founders of the IMS. The medal is for exceptional service specifically to the IMS and is open to any member of the IMS who has not previously been elected President. Created in 1933, the Institute of Mathematical Statistics is a member organization which fosters the development and dissemination of the theory and applications of statistics and probability. The IMS has 4000 active members throughout the world.
Comments on "Edward Waymire Receives Carver Medal"


text:
\section{Introduction}

The vision of the semantic web is to make the content of the web machine-interpretable, allowing, among other things, for automated aggregation and sophisticated search procedures over large amounts of linked data. As even human users are sometimes easy to trick by spam and fraudulent content that can be found on the web, we should be even more concerned in the case of automated algorithms that autonomously analyze semantic web content. Without appropriate counter-measures, malicious actors can sabotage or manipulate such algorithms by adding just a few carefully manipulated items to large sets of input data. To solve this problem, we propose an approach to make items on the (semantic) web verifiable, immutable, and permanent.
This approach includes cryptographic hash values in Uniform Resource Identifiers (URIs) and adheres to the core principles of the web, namely openness and decentralized architecture.

A cryptographic hash value (sometimes called \emph{cryptographic digest}) is a short random-looking sequence of bytes (or, equivalently, bits) that are calculated in a complicated yet perfectly predictable manner from a digital artifact such as a file. The same input always leads to exactly the same hash value, whereas just a minimally modified input leads to a completely different value. While there is an infinity of possible inputs that lead to a specific given hash value, it is impossible in practice (for strong state-of-the-art hash algorithms) to reconstruct \emph{any} of the possible inputs just from the hash value. This means that if you are given some input and a matching hash value, you can be sure that the hash value was obtained from exactly that input. On this basis, our proposed approach boils down to the idea that references can be made completely unambiguous and verifiable if they contain a hash value of the referenced digital artifact. Our method does not apply to all URIs, of course, but only to those that are meant to represent a specific and immutable digital artifact.

Let us have a look at a concrete example: Nanopublications have been proposed as a new way of scientific publishing \cite{groth2010isu}. The underlying idea is that scientific results should be published not just as narrative articles but in terms of minimal pieces of computer-interpretable results in a formal semantic notation (i.e. RDF). Nanopublications can cite other nanopublications via their URIs, thereby creating complex citation networks. Published nanopublications are supposed to be immutable, but the current web has no mechanism to enforce this: It is well-known that even artifacts that are supposed to be immutable tend to change over time, while often keeping the same URI reference. For approaches like nanopublications, however, it is important to specify exactly what version of what resource they are based on, and nobody should be given the opportunity to silently modify his or her already published contributions.

With the approach outlined below, nanopublications can be identified with \emph{trusty URIs} that include cryptographic hash values calculated on the RDF content. For example, let us assume that you have a nanopublication with identifier $I_1$ that cites another nanopublication with identifier $I_2$. If you want to find the content of $I_2$, you can simply search for it on the web, not worrying whether the source is trustworthy or not, and once you have found an artifact that claims to be $I_2$, you only have to check whether the hash value actually matches the content. If it does, you got the right nanopublication, and if not you have to keep searching (this can of course be automated). A trusty URI like $I_1$ does not only allow you to retrieve its nanopublication in a verifiable way, but in the next step also all nanopublications it cites (such as $I_2$) and all nanopublications they cite and so on. Any trusty URI in a way ``contains'' the complete backwards history.
In this sense, the ``range of verifiability'' of a resource with a trusty URI is not just the resource itself, but the complete reference tree obtained by recursively following all contained trusty URIs. This is illustrated in Figure \ref{fig:verifiability}.
\begin{figure}[t]
\begin{center}
\includegraphics[width=\textwidth]{verifiability.pdf}
\caption{Schematic illustration of the range of verifiability for the trusty URI on the top left. The green area shows its range of verifiability that covers all artifacts that can be reached by following trusty URI links (green arrows).}
\label{fig:verifiability}
\end{center}
\end{figure}

Another important property of nanopublications is that they are self-con\-tained in the sense that they consist not only of the actual scientific assertions but also of their provenance information and meta-data. This means that nanopublications contain self-references in the form of their own identifying URIs. The calculation of a trusty URI must therefore allow for the resulting URI to be part of the digital artifact it is calculated on (this might sound impossible at first, but we show below how it can be achieved).
This leads us to the formulation of the following requirements for our approach:
\begin{enumerate}
\item To allow for verification of not only the given digital artifact but its entire reference tree, the hash should be part of the URI of the artifact.
\item To allow for the inclusion of meta-data, digital artifacts should be allowed to contain self-references (i.e. their own URIs).
\item The verification should be performed on a more abstract level than just the bytes of a file, with modules for different types of content. It should be possible to verify a digital artifact even if it is presented in a different format.
\item The complete approach should be decentralized and open: Everybody should be allowed to make verifiable URIs without a central authority.
\item The approach should be based on current established standards and be compatible with current tools and formats, so that it can be used right away.
\end{enumerate}
Though there are a number of related approaches, we are not aware of any general approach that complies with all these requirements. In particular, requirements 2 and 3 are not addressed by existing approaches.
The main benefits of artifacts with a trusty URI are that they are (1) verifiable, (2) immutable, and (3) permanent. Let us briefly explain what we mean by these properties.

Trusty URI artifacts are \emph{verifiable} in the sense that a retrieved artifact for a given URI can be checked to contain the content the URI is supposed to represent. It can be detected if the artifact got corrupted or manipulated on the way, assuming that the trusty URI for the required artifact is known, e.g. because another artifact contains it as a link. (Of course, somebody can give you a manipulated artifact with a \emph{different} trusty URI.)

It directly follows that trusty URI artifacts are \emph{immutable}, as any change in the content also changes its URI, thereby making it a \emph{new} artifact. Again, you can of course change your artifact \emph{and} its URI and claim that it has always been like this. You can get away with that if the trusty URI has not yet been picked up by third parties, i.e. linked by other resources. Once this is the case, you cannot change it anymore, because all these links will still point to the old trusty URI and everybody will notice that your new artifact is a different one.

Third, trusty URI artifacts are \emph{permanent} if we assume that there are search engines and web archives crawling the artifacts on the web and caching them. In this situation, any artifact that is available on the web for a sufficiently long time will remain available forever. If an artifact is no longer available in its original location (e.g. the one its URI resolves to), one can still retrieve it from the cache of search engines or web archives. The trusty URI guarantees that it is the artifact you are looking for, even if the location of the cached artifact is not trustworthy or it was cached from an untrustworthy source.

\section{Background}

There are a number of related approaches based on cryptographic hash values.
The Git version control system ({\small\url{git-scm.com}}), for example, uses hash values to identify commits of distributed repositories.
An important difference to our approach is that hash values (called \emph{checksums} in Git) are used to identify the respective artifacts (\emph{commits} in Git) only within a given repository and not on the web scale. A second important difference is that the hash represents the byte content of files, whereas our approach allows for digital content at different levels of abstraction. On the technical side, Git uses the SHA-1 algorithm, which is no longer considered secure (which is not a serious problem for Git, because typically only trusted parties have write access to a repository).

The proposed standard for Named Information (ni) URIs \cite{keranen2013ietf} is another important related approach. It introduces a new URI protocol \texttt{ni} to refer to digital artifacts with hash values in a uniform way. These are two examples of ni-URIs:
\begin{uriquote}
\url{ni:///sha-256;UyaQV-Ev4rdLoHyJJWCi11OHfrYv9E1aGQAlMO2X_-Q}\\
\url{ni://example.org/sha-256;5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70}
\end{uriquote}
The ni-URI approach allows for different hash algorithms, such as SHA-256 (which is, in contrast to SHA-1, considered secure) and optional specification of an authority, such as \texttt{example.org}, where the artifact can be found. It misses, however, some of the features of our requirements list. As with Git, ni-URIs do not define how digital artifacts can be represented at a more abstract level than their sequence of bytes, and self-references are not supported. Furthermore, current browsers do not recognize the \texttt{ni} protocol, and administrator access to a server is needed to make these URIs resolvable. The latter two points are not a real problem in the long run, but they might hinder the adoption of the standard in the first place. The approach presented in this paper is complementary and compatible. We propose trusty URIs, which can be mapped to ni-URIs but are more flexible and provide additional features.

There are a number of existing approaches to include hash values in URIs for verifiability purposes, e.g. for legal documents \cite{hoekstra2011iswc}. The downside of such custom-made solutions is that custom-made software is required to generate, resolve, and check the hash references.
Standards have been proposed for the verification of quantitative datasets \cite{altman2007dlib} and XML documents \cite{bartel2008xmldsig}, but they are not general enough to cover RDF content (at least not in a convenient way) and keep the hash value separate from the URI reference, which means that the range of verifiability does not directly extend to referenced artifacts.

To calculate hash values on content that is more abstract than just a fixed sequence of bytes, common approaches require the normalization (also called \emph{canonicalization}) of the respective data structures such as RDF graphs. In the general case, RDF graph normalization is known to be a very hard problem, possibly unsolvable in polynomial time \cite{carroll2003iswc}. This stems from the difficulty of handling blank nodes, i.e. identifiers that are only unique in a local scope and can be locally renamed without effects on semantics. Without blank nodes, normalization boils down to sorting of RDF triples, which can be performed in $O(n \log n)$.
The need for sorting can even be eliminated by using incremental cryptography \cite{bellare1994crypto}, which allows for calculating digests for RDF graphs without blank nodes in linear time \cite{sayers2004rdfdigets}. Such incremental approaches, however, are not as well-studied as mainstream cryptography methods, and open the possibility of new kinds of attacks \cite{phan2006cs}.
Efficient normalization algorithms that support blank nodes put restrictions on the graph structure and require additional (semantically neutral) triples to be added to some graphs before they can be processed \cite{carroll2003iswc,sayers2004rdfdigets}.

Similar methods to the ones presented in this paper, i.e. calculating hash values in a format-independent manner, have been proposed to track the provenance of data sets \cite{mccusker2012ieee}. This has been used to define a conceptualization of multi-level identities for digital works based on cryptographic digests and formal semantics, covering different conceptual levels from single HTTP transactions to high-level content identifiers \cite{mccusker2012ipaw}.

\section{Approach}

We propose here a modular approach, where different modules handle different kinds of content on different conceptual levels of abstraction, from byte level to high-level formalisms. Besides that, the most important features of our approach are self-references, the handling of blank nodes, and the mapping to ni-URIs.

\subsubsection{General Structure.}

Trusty URIs end with a hash value in Base64 notation (i.e. \texttt{A}--\texttt{Z}, \texttt{a}--\texttt{z}, \texttt{0}--\texttt{9}, \texttt{-}, and \texttt{\_} representing the numbers from 0 to 63) that is preceded by a module identifier.
This is an example:
\begin{uriquote}
\url{http://example.org/r1.RA5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70}
\end{uriquote}
Everything that comes after \texttt{r1.} is the part that is specific to trusty URIs, which we call \emph{artifact code}. Its first two characters \texttt{RA} identify the module specifying its type (first character) and version (second character). The remaining 43 characters represent the actual hash value. The modules defined so far use SHA-256 hashes, but future modules might use other hash functions. For convenience reasons, a file extension like \texttt{.nq} can be added to the end of such URIs:
\begin{uriquote}
\url{http://example.org/r1.RA5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70.nq}
\end{uriquote}
This is technically not a trusty URI anymore, but it is easy to strip the extension and get the respective trusty URI from it. As the hash is located in the final part of the URI, it is straightforward to store it in file names and to deal with it in a local file system without worrying about the first part of the URI:
\begin{quote}\small
\verb|r1.RA5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70.nq|
\end{quote}
We call these \emph{trusty files}.
The precise specification of trusty URIs can be found online.\footnote{\url{https://github.com/trustyuri/trustyuri-spec}}
As a general side remark, it is noteworthy that our approach entails a certain shift of authority: Once a trusty URI is established, its artifact code defines what object it refers to, and the issuing authority has no longer the power to change its meaning.

\subsubsection{Self-References.}

\newcommand{{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}}{{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}}

To support self-references, i.e. resources that contain their own trusty URI, the generation process involves not just to compute the hash from a given artifact but to actually transform the artifact into a new version that contains the newly generated trusty URI.
For example, a resource like \texttt{\small{}http://example.org/r2} might have the following RDF content with a self-reference:
\begin{quote}\small
\texttt{<http://example.org/r2> dc:description "something" .}
\end{quote}
To transform such a resource, we first define the structure of the new trusty URI by adding a placeholder {{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}} where the artifact code should eventually appear. In the given example, the content would then look like this:
\begin{quote}\small
\texttt{<http://example.org/r2.{{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}}> dc:description "something" .}
\end{quote}
Note that it is necessary to add a non-Base64 character (in this case a dot ``\texttt{.}'') as a delimiter in front of {{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}} if it would otherwise be preceded by a Base64 character. On such content, we can calculate a hash value by interpreting the placeholder {{\setlength{\fboxsep}{0.5mm}\hspace{0.2mm}\fbox{\normalfont\textsc{c}}\hspace{0.2mm}}} as a blank space (the result is unambiguous as URIs are not allowed to otherwise contain blank spaces). Then we can replace the placeholder by the calculated artifact code and we end up with a trusty URI like this:
\begin{uriquote}
\url{http://example.org/r2.RAi7LA7Zlew99hdp0joN0APT4_uB3XDFwduiKXnNBja5E}
\end{uriquote}
For strong hashing algorithms, it is impossible in practice that this calculated sequence of bytes was already part of the original content before the transformation. This entails that the replacing of the placeholder is reversible.

This reversibility is needed once an existing trusty URI resource containing self-references should be verified. We can revert the transformation described above by replacing all occurrences of the artifact code with a blank space, and then calculate the hash in the same way as when a resource is transformed. The content is successfully verified if and only if the resulting hash matches the one from the trusty URI.

\subsubsection{Blank Nodes.}

The support for self-references requires us to transform the preliminary content of a trusty URI artifact into its final version, and we can make use of this transformation to also solve the problem of blank nodes in RDF.
Our approach is to eliminate blank nodes during the transformation process by converting them into URIs. Blank nodes can be seen as existentially quantified variables, which we can turn into constants by Skolemization, i.e. by introducing URIs that have not been used anywhere before.
Using the trusty URI with a suffix enumerating the blank nodes, we can create such URIs guaranteed to have never been used before (the artifact code being just a placeholder at first, as above):
\begin{uriquote}
\url{http://example.org/r3.RACjKTA5dl23ed7JIpgPmS0E0dcU-XmWIBnGn6Iyk8B-U..1}\\
\url{http://example.org/r3.RACjKTA5dl23ed7JIpgPmS0E0dcU-XmWIBnGn6Iyk8B-U..2}
\end{uriquote}
The two dots ``\texttt{..}'' indicate that these were derived from blank nodes, but they are now immutable URIs. This approach solves the problem of blank nodes for normalization, is completely general (i.e. works on any possible input graph), fully respects RDF semantics, and does not require auxiliary triples to be added.

\subsubsection{ni-URIs.}

Our approach is compatible with ni-URIs (see above), and all trusty URIs can be transformed into ni-URIs, with or without explicitly specifying an authority:
\begin{uriquote}
\url{ni:///sha-256;5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70}\\
\url{ni://example.org/sha-256;5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70}
\end{uriquote}
The fact that the module identifier is lost does not affect the uniqueness of the hash, but to verify a resource all available modules have to be tried in the worst case. To avoid this, we propose to use an optional argument \texttt{module}:
\begin{uriquote}
\url{ni:///sha-256;5AbXdpz5DcaYXCh9l3eI9ruBosiL5XDU3rxBbBaUO70?module=RA}
\end{uriquote}

\subsubsection{Modules.}

There are currently two module types available: \texttt{F} for representing byte-level file content and \texttt{R} for RDF graphs. For both types, version \texttt{A} is the only version available as of now, leading to the module identifiers \texttt{FA} and \texttt{RA}.
For module \texttt{FA}, a hash value is calculated using SHA-256 on the content of a file in byte representation.
The hash value is transformed to Base64 notation (after appending two zero-bits), and the resulting 43 characters make up the hash part of the trusty URI.
Module \texttt{RA} works on RDF content and can cover multiple named graphs. It supports self-references and handles blank nodes as described above. To calculate the hash, the RDF statements are sorted, then they are serialized in a given way (interpreting the artifact's hash as a blank space), and finally SHA-256 is applied in the same way as for \texttt{FA}.

Note that for an RDF document, either of the modules \texttt{FA} and \texttt{RA} could be used. The right choice depends on what the URI should identify. If it should identify a \emph{file} in a particular format and containing a fixed number of bytes, then \texttt{FA} should be used. If it should, however, identify \emph{RDF content} independently of its serialization in a particular file, then \texttt{RA} should be used.
For modules such as \texttt{RA} that operate not just on the byte level, \emph{content negotiation} can be used to return the same content in different formats (depending on the requested content type in the HTTP request) when a trusty URI is accessed.

Even though we focus on RDF in this paper, the approach and architecture of trusty URIs are general and we plan to provide modules for additional kinds of content in the future. This could include tabular or matrix content (e.g. CSV or Excel files), content with tree structure (e.g. XML), hypertext (e.g. HTML or Markdown), bitmaps (e.g. PNG or JPEG), and vector graphics (e.g. SVG). New modules might also become necessary if the used hash algorithms should become vulnerable to attacks in the future.

\section{Implementation}

There are currently three trusty URI implementations in the form of code libraries in Java, Perl, and Python.\footnote{\url{https://github.com/trustyuri/trustyuri-java},\hspace{1ex}\url{https://github.com/trustyuri/trustyuri-perl}, \url{https://github.com/trustyuri/trustyuri-python}}
The Java implementation uses the \emph{Sesame} library \cite{broekstra2002iswc} for RDF processing and the \emph{nanopub-java} library\footnote{\url{https://github.com/Nanopublication/nanopub-java}} for dealing with nanopublications. The Perl implementation makes use of the \emph{Trine} package for processing RDF, and the Python implementation uses the \emph{RDFLib} package.\footnote{\url{http://search.cpan.org/dist/RDF-Trine/}, \url{https://github.com/RDFLib/rdflib}}

These implementations provide a number of common functions for the different modules and formats. Currently, the following functions are available:
\begin{description}
\item[CheckFile] takes a file and validates its hash by applying the respective module.
\item[ProcessFile] takes a file, calculates its hash using module \texttt{FA}, and renames it to make it a trusty file.
\item[TransformRdf] takes an RDF file and a base URI, and transforms the file into a trusty file using module \texttt{RA}.
\item[TransformLargeRdf] is the same as above but using temporary files instead of loading the entire content into memory.
\item[TransformNanopub] takes a nanopublication file and calls TransformRdf to transform it.
\item[CheckLargeRdf] checks an RDF file using module \texttt{RA} without loading the whole content into memory but using temporary files instead.
\item[CheckSortedRdf] checks an RDF file assuming that it is already sorted (and raises an error otherwise). The current implementations generate such sorted files by default, but this is not required by the specification.
\item[CheckNanopubViaSparql] takes a SPARQL endpoint URL and a trusty URI representing a nanopublication, retrieves the nanopublication from the repository, and tries to validate it.
\item[RunBatch] reads commands (any of the above) from a file and executes them one after the other.
\end{description}
Not all these functions are currently supported by all implementations, as shown in Table \ref{tab:trustyurilibs}.

\begin{table}[t]
\begin{center}\small
\begin{tabular}{l|ll|ccc}
module & function & format & Java & Perl & Python \\
\hline
\emph{(general)} & RunBatch & & \checkmark & \checkmark & \checkmark \\
\hline
\multirow{2}{*}{File} & CheckFile & & \checkmark & \checkmark & \checkmark \\
\cline{2-6}
 & ProcessFile & & \checkmark & \checkmark & \checkmark \\
\hline
\multirow{16}{*}{RDF} & \multirow{6}{*}{CheckFile} & RDF/XML & \checkmark & \checkmark & \checkmark \\
 & & Turtle & \checkmark & \checkmark & \checkmark \\
 & & N-Triples & \checkmark & \checkmark & \checkmark \\
 & & TriX & \checkmark & -- & \checkmark \\
 & & TriG & \checkmark & \checkmark & -- \\
 & & N-Quads & \checkmark & \checkmark & \checkmark \\
\cline{2-6}
 & CheckLargeRdf & \emph{(all of the above)} & \checkmark & & \\
\cline{2-6}
 & CheckSortedRdf & \emph{(all of the above)} & \checkmark & & \\
\cline{2-6}
 & \multirow{6}{*}{TransformRdf} & RDF/XML & \checkmark & & \checkmark \\
 & & Turtle & \checkmark & & \checkmark \\
 & & N-Triples & \checkmark & & \checkmark \\
 & & TriX & \checkmark & -- & \checkmark \\
 & & TriG & \checkmark & -- & -- \\
 & & N-Quads & \checkmark & & \checkmark \\
\cline{2-6}
 & TransformLargeRdf & \emph{(all of the above)} & \checkmark & & \\
\cline{2-6}
 & \multirow{3}{*}{TransformNanopub} & TriX & \checkmark & -- & \\
 & & TriG & \checkmark & -- & -- \\
 & & N-Quads & \checkmark & & \\
\cline{2-6}
 & CheckNanopubViaSparql & & \checkmark & & \\
\hline
\end{tabular}
\end{center}
\caption{Comparison of the different trusty URI libraries (`\checkmark' = implemented features; `--' = cases where the necessary features are not available in the used RDF libraries)}
\label{tab:trustyurilibs}
\end{table}

\section{Application}

Below, we describe two applications of the trusty URI approach: one involving nanopublications (nanobrowser) and one involving a dataset in RDF format with a large variation in file size (Bio2RDF).

\subsection{Nanobrowser}

\begin{figure}[t]
\begin{center}
\setlength{\fboxsep}{0mm}
\begin{tikzpicture}
\node[inner sep=0mm] (img) at (0,0) {\fbox{\includegraphics[width=0.999\textwidth]{nanobrowser.png}}};
\node[inner sep=0mm] (i) at (-1.5,-2) {\setlength{\fboxrule}{0.5mm}\fbox{\includegraphics[scale=0.4]{nanobrowser-valid.png}}};
\node[circle,fill=white,draw,very thick] at (i.north east) {\textbf{1}};
\draw[->,very thick] (i) -- (-5.5,2.4);
\node[inner sep=0mm] (l) at (1.5,0.5) {\setlength{\fboxrule}{0.5mm}\fbox{\includegraphics[scale=0.4]{nanobrowser-buttons.png}}};
\node[circle,fill=white,draw,very thick] at (l.north east) {\textbf{2}};
\draw[->,very thick] (l) -- (-1,2.4);
\end{tikzpicture}
\caption{Screenshot of the nanobrowser interface. A green jigsaw puzzle icon (1) indicates successful verification of nanopublications, which can be downloaded (and verified locally) in different formats (2).}
\label{fig:nanobrowser}
\end{center}
\end{figure}

Nanobrowser \cite{kuhn2013eswc} is a prototype of a web application via which nanopublications can be searched, browsed, published, and commented. Figure \ref{fig:nanobrowser} shows a screenshot. Nanobrowser applies a number of extensions to the nanopublication approach, such as support for semi-formal and informal statements (represented by atomic and independent English sentences, i.e. a kind of controlled natural language \cite{kuhn2014cl}) and support for meta-nanopublications, e.g. nanopublications containing opinions on other nanopublications.

All nanopublications created via the nanobrowser interface are identified by trusty URIs. If a user requests a nanopublication with a given trusty URI, it is retrieved from the internal triple store and verified before it is shown to the user. A green jigsaw puzzle icon indicates that the verification was successful (see Figure \ref{fig:nanobrowser}). A particular nanopublication can be downloaded in different formats and its trusty URI can be checked locally and independently of the format.

\subsection{Bio2RDF}

Bio2RDF ({\small\url{bio2rdf.org}}) is an open-source project focused on the provision of linked data for the life sciences \cite{callahan2013eswc,belleau2008biomedinform}. Bio2RDF scripts convert heterogeneously formatted data (e.g. flat files, tab-delimited files, dataset-specific formats, SQL, and XML) into a common format --- RDF. Bio2RDF entities are identified using URIs that are resolvable using the Bio2RDF Web Application, a servlet that answers HTTP requests by formulating SPARQL queries against the appropriate SPARQL endpoints. Over 1 billion triples for 19 resources were made available in the second coordinated release of Bio2RDF \cite{callahan2013eswc}, and mappings to the Semanticscience Integrated Ontology \cite{callahan2013jbiomedsem} have been established. Together, these serve to provide ontology-based access to data on the emerging semantic web.

The release numbers of Bio2RDF provide a way to refer to a specific version of a dataset, e.g. for citing it in a scientific article or a nanopublication. However this assumes trust in the Bio2RDF developers that they do not silently change the data of a particular release. Furthermore, an intruder might be able to change parts of the data without being noticed, the data might get corrupted or manipulated when transferred or downloaded, and there might be no other trusted parties providing the dataset if the Bio2RDF website should become temporarily or permanently inaccessible. The use of trusty URIs would solve all these problems. Below we show an evaluation on release 2 of Bio2RDF, and we plan to provide trusty URIs for the datasets of its upcoming next release.

\section{Evaluation}

Below we present some experiments on the trusty URI concept and its implementations, based on two collections of RDF files.

\begin{table}[tp]
\begin{center}
{\scriptsize\sffamily
\renewcommand{\arraystretch}{1.75}
\textsc{Normal Mode}\smallskip\\
\begin{tabular}{r|lr|rrrrc|rrr}
\hline
 & \multicolumn{2}{c|}{method} & \multicolumn{5}{c|}{time in seconds} & \multicolumn{3}{c}{result} \\
 & impl. & format & mean & stdev & min & max & histogram & valid & invalid & error \\
\hline
\multirow{7}{*}{\begin{sideways}\phantom{p}valid files\phantom{p}\end{sideways}}
 & Java & N-Quads & 0.5229 & 0.0591 & 0.3750 & 5.5420& \multirow{7}{*}{\includegraphics[trim=5mm 13mm 1mm 11mm, clip=true, scale=0.49]{check-rdf-hist.pdf}} & 100\% & 0\% & 0\% \\
 & Java & TriG & 0.5113 & 0.0569 & 0.3650 & 5.5340 & & 100\% & 0\% & 0\% \\
 & Java & TriX & 0.5383 & 0.0648 & 0.3900 & 5.5240 & & 100\% & 0\% & 0\% \\
 & Perl & N-Quads & 0.7843 & 0.1713 & 0.5990 & 5.7960 & & 100\% & 0\% & 0\% \\
 & Perl & TriG & 0.7901 & 0.1734 & 0.6030 & 5.7840 & & 100\% & 0\% & 0\% \\
 & Python & N-Quads & 0.1935 & 0.0164 & 0.1150 & 0.3050 & & 100\% & 0\% & 0\% \\
 & Python & TriX & 0.1912 & 0.0162 & 0.1190 & 0.3460 & & 100\% & 0\% & 0\% \\
\hline
\multirow{7}{*}{\begin{sideways}corrupted files\end{sideways}}
 & Java & N-Quads & 0.5227 & 0.0591 & 0.3450 & 5.5420 & & 0\% & 99.72\% & 0.28\% \\
 & Java & TriG & 0.5003 & 0.0621 & 0.3200 & 5.4250 & & 0\% & 83.37\% & 16.63\% \\
 & Java & TriX & 0.5322 & 0.0655 & 0.3360 & 5.5230 & & 0.83\% & 84.15\% & 15.03\% \\
 & Perl & N-Quads & 0.7842 & 0.1712 & 0.6000 & 5.8880 & & 0\% & 100\% & 0\% \\
 & Perl & TriG & 0.7872 & 0.1727 & 0.5700 & 5.8230 & & 0\% & 84.49\% & 15.51\% \\
 & Python & N-Quads & 0.1934 & 0.0165 & 0.1200 & 0.3080 & & 0\% & 100\% & 0\% \\
 & Python & TriX & 0.1884 & 0.0176 & 0.1070 & 0.2760 & & 0.12\% & 84.46\% & 15.42\% \\
\end{tabular}
\vspace{6mm}\\
\textsc{Batch Mode}\smallskip\\
\begin{tabular}{r|lr|rrrrc|rrr}
\hline
 & \multicolumn{2}{c|}{method} & \multicolumn{5}{c|}{time in seconds} & \multicolumn{3}{c}{result} \\
 & impl. & format & mean & stdev & min & max & histogram & valid & invalid & error \\
\hline
\multirow{7}{*}{\begin{sideways}\phantom{p}valid files\phantom{p}\end{sideways}}
 & Java & N-Quads & 0.0019 & 0.0062 & 0.0013 & 1.7202 & \multirow{7}{*}{\includegraphics[trim=5mm 13mm 1mm 11mm, clip=true, scale=0.49]{check-rdf-batch-hist.pdf}} & 100\% & 0\% & 0\% \\
 & Java & TriG & 0.0009 & 0.0050 & 0.0008 & 1.7412 & & 100\% & 0\% & 0\% \\
 & Java & TriX & 0.0011 & 0.0050 & 0.0009 & 1.5656 & & 100\% & 0\% & 0\% \\
 & Perl & N-Quads & 0.0172 & 0.0006 & 0.0171 & 0.0679 & & 100\% & 0\% & 0\% \\
 & Perl & TriG & 0.0214 & 0.0016 & 0.0211 & 0.0872 & & 100\% & 0\% & 0\% \\
 & Python & N-Quads & 0.0070 & 0.0011 & 0.0065 & 0.0644 & & 100\% & 0\% & 0\% \\
 & Python & TriX & 0.0070 & 0.0009 & 0.0066 & 0.0578 & & 100\% & 0\% & 0\% \\
\hline
\multirow{7}{*}{\begin{sideways}corrupted files\end{sideways}}
 & Java & N-Quads & 0.0012 & 0.0062 & 0.0006 & 1.6559 & & 0\% & 99.72\% & 0.28\% \\
 & Java & TriG & 0.0010 & 0.0049 & 0.0003 & 1.6335 & & 0\% & 83.37\% & 16.63\% \\
 & Java & TriX & 0.0011 & 0.0044 & 0.0005 & 1.3451 & & 0.83\% & 84.15\% & 15.03\% \\
 & Perl & N-Quads & 0.0171 & 0.0005 & 0.0169 & 0.0732 & & 0\% & 100\% & 0\% \\
 & Perl & TriG & 0.0195 & 0.0055 & 0.0007 & 0.0841 & & 0\% & 84.49\% & 15.51\% \\
 & Python & N-Quads & 0.0069 & 0.0011 & 0.0065 & 0.1716 & & 0\% & 100\% & 0\% \\
 & Python & TriX & 0.0063 & 0.0021 & 0.0006 & 0.1325 & & 0.12\% & 84.46\% & 15.42\% \\
\end{tabular}
\vspace{5mm}}
\caption{Performance and results of the different implementations for checking trusty URI nanopublications in normal mode (top) and batch mode (bottom) on valid and corrupted files.}
\label{tab:checkrdf}
\end{center}
\end{table}

\subsection{Hash Generation and Checking on Nanopublications}

To test our approach and to evaluate its implementations, we first took a collection of 156,026 nanopublications in TriG format that we had produced in previous work \cite{kuhn2013eswc}. We transformed these nanopublications into the formats N-Quads and TriX using existing off-the-shelf converters. Then, we transformed these into trusty URI nanopublications using the function TransformNanopub of the Java implementation. To be able to check not only positive cases (where checking succeeds) but also negative ones (where checking fails), we made copies of the resulting files where we changed a random single byte in each of them (only considering letters and numbers, and never replacing an upper-case letter by its lower-case version or vice versa, as some keywords are not case-sensitive). The resulting six sets of 156,026 files each (three formats, each in two versions: valid and corrupted) were the basis for our evaluation.

The first important result is that all original nanopublications ended up with the same trusty URI, no matter which format was used. This shows that our implementations are successful in handling the content on a more abstract level (i.e. RDF graphs in this case) leading to identical hash values for files that contain the same content but are quite different on the byte level.

Next, we checked the trusty URI of each nanopublication file with the function CheckFile of all implementations that support the respective format. The three right-most columns of Table \ref{tab:checkrdf} show the results. For all valid files (i.e. those we did not corrupt), all implementations correctly verified their trusty URIs. For the corrupted ones, where we randomly changed one byte, the checks almost always failed (by either calculating a different hash value than the one of the trusty URI, or by raising an error that the respective file was not well-formed).

The only corrupted files that were successfully validated were 1,290 TriX files (0.83\%) when running the Java implementation and 181 TriX files (0.12\%) when running the Python implementation. Looking at these concrete cases reveals that they are all harmless. In these cases, the randomly changed byte was not part of the RDF content, but of the meta-information. Due to minor bugs in the used RDF libraries, this meta-information is not sufficiently checked, which leads to accepting the valid content instead of failing because of violated well-formedness.
All our TriX files start with the following two lines:
\begin{quote}\footnotesize
\texttt{<?xml version='1.0' encoding='UTF-8'?>\\
<TriX xmlns='http://www.w3.org/2004/03/trix/trix-1/'>}
\end{quote}
The RDF implementations in Java and Python (or the respective system utilities to load XML files) do not properly check these two lines containing meta-data. Both libraries raise no error if a file starts with something like \texttt{<?Aml} instead of \texttt{<?xml} (106 files); the Python library accepts invalid XML version numbers such as \texttt{1.a} (73 files); and the Java library does not check the TriX namespace argument, raising no error if the argument name is changed to something like \texttt{xmlnZ} (175 files) or the URI is wrong, such as \texttt{.../Prix-1/} (1007 files). In addition, both libraries correctly accept the rare cases (2 files) where the XML version was changed from \texttt{1.0} to \texttt{1.1}, which is the only other valid XML version as of now (though much less common).

\subsection{Performance Tests on Nanopublications}

Next, we used the same set of nanopublication files to test the performance of the different modules for checking trusty URI artifacts in different formats. There are two scenarios of how to run such checks: One can run one after the other, as when a small number of nanopublications are manually checked, or one can execute such checks in the form of a batch job in a single program run, which is the preferred procedure to run a large number of checks without supervision. The time required per file is typically much lower in batch mode, as the runtime environment has to start and finalize only once. Therefore it makes sense to have a look at both scenarios.

Table \ref{tab:checkrdf} shows the results of these performance checks for the normal mode (top) and batch mode (bottom).
These results and the ones presented below were obtained on a Linux server (Debian) with 16 Intel Xeon CPUs of 2.27GHz and 24GB of memory.
As expected, the times are much lower in batch mode, but checking is reasonably fast also in normal mode. All average values are below 0.8s (0.03s for batch mode). Using Java in batch mode even requires only 1ms per file. Apart from the runtimes, the two modes had no effect on the results.

\subsection{Performance Tests on Bio2RDF}

The tests above cover only very small RDF files, but our approach should also work for larger files. For that reason, we performed a second evaluation on Bio2RDF, which includes much larger files. Release 2 of this dataset contains 874 RDF files in N-Triples format, but 16 of them lead to well-formedness errors when loaded with the current version of the Sesame library. (These problems might be related to the transition to the new RDF 1.1 standard, and they will be fixed for the next release of Bio2RDF.) This leaves us with 858 files of sizes ranging from 1.4kB to 177GB.

Figure \ref{fig:bio2rdf-time} shows the results of these performance tests. There is a lot of random variation on the lower end, where files are smaller than 10MB and require less than three seconds to be processed. For the upper part, time values nicely follow near-linear trajectories (for the functions that do not load the whole content into memory). When hash calculation involves statement sorting, there is a strict theoretical limit on its performance due to the computational complexity of $O(n \log n)$.
TransformLargeRdf and CheckLargeRdf are superior to their counterparts only for very large files, and CheckSortedRdf is, as expected, faster than the other checking procedures. A large file of 2GB requires about five minutes to be transformed and about two minutes to be checked. Files larger than available memory take more time, but even the largest file of the dataset of 177GB was successfully transformed in 29 hours and checked in about three hours.

\begin{figure}[t]
\begin{center}
\includegraphics[trim=15mm 11.5mm 15mm 3mm, clip=true, width=\textwidth]{bio2rdf-transform.pdf}\\
\includegraphics[trim=15mm 0mm 15mm 6mm, clip=true, width=\textwidth]{bio2rdf-check.pdf}
\caption{Time required for transforming (top) and checking (bottom) files versus file size for the Bio2RDF dataset. The dotted line shows the available memory.
}
\label{fig:bio2rdf-time}
\end{center}
\end{figure}

\section{Conclusions}

We have presented a proposal for unambiguous URI references to make digital artifacts on the (semantic) web verifiable, immutable, and permanent. If adopted, it could have a considerable impact on the structure and functioning of the web, could improve the efficiency and reliability of tools using web resources, and could become an important technical pillar for the semantic web, in particular for scientific data, where provenance and verifiability are crucial.
To improve reproducibility, for example, scientific data analyses might be conducted in the future within ``data projects'' analogous to today's software projects. The dependencies in the form of datasets could be automatically fetched from the web, similar to what Apache Maven ({\small\url{maven.apache.org}}) does for software projects but decentralized and verifiable.
In general, trusty URIs might contribute in a significant way to shape the future of publishing on the web.

redpajama_set_name: RedPajamaArXiv


text:
package backtype.storm.transactional;

import backtype.storm.coordination.BatchOutputCollector;
import backtype.storm.task.TopologyContext;
import backtype.storm.topology.IComponent;
import java.math.BigInteger;
import java.util.Map;

public interface ITransactionalSpout<T> extends IComponent {
    interface Coordinator<X> {
        /**
         * Create metadata for this particular transaction id which has never been emitted before. The metadata should contain whatever is necessary to be able
         * to replay the exact batch for the transaction at a later point.
         *
         * The metadata is stored in Zookeeper.
         *
         * Storm uses the Kryo serializations configured in the component configuration for this spout to serialize and deserialize the metadata.
         *
         * @param txid         The id of the transaction.
         * @param prevMetadata The metadata of the previous transaction
         * @return the metadata for this new transaction
         */
        X initializeTransaction(BigInteger txid, X prevMetadata);

        /**
         * Returns true if its ok to emit start a new transaction, false otherwise (will skip this transaction).
         *
         * You should sleep here if you want a delay between asking for the next transaction (this will be called repeatedly in a loop).
         */
        boolean isReady();

        /**
         * Release any resources from this coordinator.
         */
        void close();
    }

    interface Emitter<X> {
        /**
         * Emit a batch for the specified transaction attempt and metadata for the transaction. The metadata was created by the Coordinator in the
         * initializeTranaction method. This method must always emit the same batch of tuples across all tasks for the same transaction id.
         *
         * The first field of all emitted tuples must contain the provided TransactionAttempt.
         */
        void emitBatch(TransactionAttempt tx, X coordinatorMeta, BatchOutputCollector collector);

        /**
         * Any state for transactions prior to the provided transaction id can be safely cleaned up, so this method should clean up that state.
         */
        void cleanupBefore(BigInteger txid);

        /**
         * Release any resources held by this emitter.
         */
        void close();
    }

    /**
     * The coordinator for a TransactionalSpout runs in a single thread and indicates when batches of tuples should be emitted and when transactions should
     * commit. The Coordinator that you provide in a TransactionalSpout provides metadata for each transaction so that the transactions can be replayed.
     */
    Coordinator<T> getCoordinator(Map conf, TopologyContext context);

    /**
     * The emitter for a TransactionalSpout runs as many tasks across the cluster. Emitters are responsible for emitting batches of tuples for a transaction and
     * must ensure that the same batch of tuples is always emitted for the same transaction id.
     */
    Emitter<T> getEmitter(Map conf, TopologyContext context);
}

redpajama_set_name: RedPajamaGithub


Gobeil & Associates has developed study aids for financial services personnel preparing to write the financial planning certification examinations.
David develops products and services to assist other personal financial planners. He is the author of the Canadian Retirement Planner's Software and the editor of The Personal Financial Planner's Manual. In 1997, David successfully challenged the Certified Financial Planner Examination.
David has also written and presented Executive Seminars on Personal Financial Planning for the Canadian Institute of Chartered Accountants (CICA). David has served as the Chairman of the CICA Personal Financial Planning Conference. He was also the editor and an author of the Certified Financial Planning courses (CFP) offered by the Canadian Institute of Financial Planning (CIFP).
John answers inquiries from users and provides counselling and technical assistance to candidates for the Certification Examinations.
In 2007, John became a Certified Financial Planner®. John obtained a Bachelor of Science in Computer Science from York University.
Lee manages the business of Gobeil & Associates. She ensures that the systems run as expected and our customers' needs are addressed. Lee obtained a Bachelor of Arts in Computer Science from the University of Toronto.


I've installed freeradius3 package on pfsense 2.4.3 configure it to work with MySQL server, created all necessary tables in database, enabled Captive Portal configured with PAP Radius Authentication, Interim accounting updates. Then I've created a user in Radius menu (Cleartext Password option). Test was successful, so I entered login and password on captive portal and got connection to internet, then I've added in user menu Amount of traffic (100MB and Daily), disconnected user from Status->Captive Portal, restarted services Captive Portal and freeradius. So then when I am tried to login in captive portal it show error. In pfsense shell I entered "service radiusd onedebug" and then "radtest username pass 192.168.45.1 1812 secret" after big message I got Expected Access-Accept got Access-Reject. Then I deleted accounting data from user and was able to login without errors.
Could you please tell me what can cause this accounting error?
/usr/local/etc/raddb/scripts/datacounter_auth.sh: arithmetic expression: expecting primary: "/1024/1024"
Waking up in 0.2 seconds.
Waking up in 0.7 seconds.
In this case your time duration for the quota "daily".
I advise you to experiment with a non-email login like login like "test".
Check if the file /var/log/radacct/datacounter/daily/max-used-test is created - in the file you will find the quota size in bytes.
When the login works, another file will be created : /var/log/radacct/datacounter/daily/used-test and probably /var/log/radacct/datacounter/daily/used-test-xxxxxxxxxx (xxxxxx is the session ID). Check this.


My personality traits are: I consider myself kind, optimistic and calm. And I hope I have a good sense of humor.
I like to go out to/and: I read books, listening to music and travel.
More about me: I try to be honest, fair and to help others.


text:
Missing plane found crashed outside Somerset Airport
Mike Deak, and Sergio Bichao
Courier News and Home Tribune
BEDMINSTER A plane that had gone missing Tuesday was found Thursday crashed just outside Somerset Airport. The pilot, a 62-year-old man from Chester Township, has been reported dead.
The crash find was reported around 1 p.m. Thursday.The plane landed in a wooded area off the northwestern corner of the airport.
Airport officials did not know whether the plane had crashed during takeoff or landing. An FAA spokeswoman could not immediately release further details Thursday.
The National Transportation Safety Board confirmed that the crashed plane had been reported missing this week.
The airport is where the State Police stations its Medevac helicopter.
The aircraft is based out of this airport, but the name of the pilot was not released pending notification of family.
The Far Hills-Bedminster Fire Department was on scene.


With responsible good quality method, good status and excellent client services, the series of solutions produced by our company are exported to lots of countries and regions for Empty Compact Eyeshadow Container , Empty Cosmetic Eyeshadow Container , Empty Plastic Eyeshadow Container , revolutionary and well-trained team should be able to establish great and mutually beneficial business enterprise relationships with you soon. Please truly feel no cost to get hold of us for additional details.
"Our focus on should be to consolidate and enhance the quality and repair of present products, in the meantime constantly establish new products to meet unique customers' requires for Empty Compact Eyeshadow Container , Empty Cosmetic Eyeshadow Container , Empty Plastic Eyeshadow Container , "Making the Products of High Quality" is the eternal goal of our company. We make unremitting efforts to realize the goal of "We Will Always Keep in Pace with the Time".


Two beautiful Labradors Chocolate and Golden in colour they are just delightful guys! Meet Max and Gilbert who are friendly social dogs who just love their walks and run around freely in Sutton Park each day. Tina loves to pick them up and take them out although this weather does mess up their coats but they have a hose at the back of the house so she can make sure they are clean before they go in the house.


PAWTUCKET, R.I. -- The Buffalo Bisons owned a 3-3 record when they left for a five-game road trip last week. They come home to face the Rochester Red Wings at Coca-Cola Field tonight at 6:05 after four straight losses and sit in last place in the North Division of the International league.
The Herd (4-7) dropped a pair of games Sunday to the Pawtucket Red Sox before 5,715 in McCoy Stadium. Pawtucket scored in the 10th inning to win the completion of Saturday night's suspended game, 2-1, then took advantage of eight walks and two Bisons' errors for a 10-6 win in the regularly scheduled game.
Daniel Nava's RBI single, the third Pawtucket hit in the inning against losing pitcher Manny Alvarez (0-1), won the opener which had been suspended after eight innings Saturday.
Josh Stinson (0-1), called up from Double-A Binghamton, started the second game for Buffalo and gave up six runs on six hits and two walks.
After Pawtucket built a 10-2 lead, Buffalo rallied for four runs in the seventh inning and was looking for more with two runners on base and one out. However, Red Sox reliever Rich Hill came on and struck out Lucas Duda and retired Zach Lutz on a pop fly to end the threat.
Hill retired eight of the 10 batters he faced to close out the game.
Right-hander Jenrry Mejia (1-0, 0.00) is Buffalo's scheduled starter tonight against Red Wings right-hander Anthony Swarzak (0-0, 3.12) in the opener of an eight-game homestand. The teams will play a 12:05 p.m. game Tuesday and 1:05 p.m. games Wednesday and Thursday.


text:
+"Craft Students League "+" Faculty"
Oral history interview with Irena Brynner
Brynner, Irena Search this
Fisch, Arline M. Search this
Nanette L. Laitman Documentation Project for Craft and Decorative Arts in America Search this
Craft Students League -- Faculty Search this
Metal Arts Guild Search this
Metropolitan Museum of Art (New York, N.Y.) -- Faculty Search this
Renwick Gallery Search this
Society of North American Goldsmiths Search this
Bergman, Franz Search this
Campbell, David Robert, 1907-1963 Search this
Daniels, Grete Search this
De Patta, Margaret, 1903-1964 Search this
Faber, Aaron Search this
Jensen, Georg Arthur, 1866-1935 Search this
Jeremias, Trudy Search this
Renk, Merry, 1921-2012 Search this
Resnikoff, Florence Lisa Herman Search this
Rosene, Caroline Gleick, 1907- Search this
Stackpole, Ralph, 1885-1973 Search this
Winston, Robert, 1915- Search this
67 Pages (Transcript)
2001 April 26-27
An interview of Irena Brynner conducted 2001 April 26-27, by Arline M. Fisch, for the Archives of American Art's Nanette L. Laitman Documentation Project for Craft and Decorative Arts in America, in Brynner's home and studio, New York, New York.
Brynner speaks of her childhood in Vladivostok in Primorski Krai, Russia; her artistic family including her cousin Yul Brynner; fleeing from Russia to Darian (on the southern tip of the Liaotung peninsula, in the Kwantung Leased Territory of Manchuria); her art studies in Lausanne, Switzerland; her father's illness during World War II; moving with her mother to San Francisco in 1946; her studies with Ralph Stackpole and Franz Bergman in San Francisco; her relationship with architect Frank Merwin; teaching art in Catholic schools in San Francisco; her decision to make jewelry after seeing Claire Falkenstein's sculpture; working as an apprentice to Caroline Rosene and Franz Bergman; forming the Metal Arts Guild with Bob Winston, Merry Renk, Florence Resnikoff, Margaret De Patta, and others; and introducing forging and three-dimensional jewelry in the Metal Arts Guild. She also talks about her move to New York City in 1957; acting as her own agent; "open-air art shows" in San Francisco; her first show at Walker & Eberling; starting her own shop; teaching at the Craft Students League and at MoMA's Institute of Modern Art, at Victor D'Amico's invitation, circa 1962; her friendships with students and clients; her book, "Jewelry as an Art Form" (New York : Van Nostrand Reinhold, 1979) and its influence; learning to work with a Henes water welder; the treatment of women artists in America; her move to Geneva, Switzerland, in 1972, and the difficulties of starting a shop there; and her return to New York and reestablishing her career in the United States. Brynner also discusses her interest in singing, her voice lessons, her public performances of Russian classical music, and her health.
She comments on the intuitive development of her jewelry; the influence of Margaret De Patta; learning wax techniques from Bob Winston at Mills College; her progression from geometric to organic forms; her large-scale sculpture; her invention of "wrap-around earrings"; her use of niobium in the 1980s; drawing inspiration from Antonio Gaudi, Alberto Jaccometti, and others; involvement with the community of artists in the San Francisco Bay Area; the Society of North American Goldsmiths (SNAG); craft periodicals; her exhibitions at the Little Gallery of the Museum of Contemporary Crafts, the Musée de l'horlogerie et de l'émaillerie in Geneva, the Renwick Gallery in Washington, D.C., and others; her work in museum collections; serving as a juror; and writing her memoir. Brynner recalls Georg Jensen, Grete Daniels, Trudy Jeremias, Aaron Faber, David Campbell, and others.
Irena Brynner (1917-2003) was a jeweler from New York, New York. Arline M. Fisch (1931- ) is a metalsmith from San Diego, California.
Originally recorded on 4 sound cassettes. Reformatted in 2010 as 7 digital wav files. Duration is 3 hr., 41 min.
Painters -- New Jersey -- Roosevelt Search this
Printmakers -- New Jersey -- Roosevelt Search this
Illustrators -- New Jersey -- Roosevelt Search this
Women artists Search this
Women painters Search this
Women printmakers Search this
Decorative arts Search this
Funding for this interview was provided by the Nanette L. Laitman Documentation Project for Craft and Decorative Arts in America.
Funding for the digital preservation of this interview was provided by a grant from the Save America's Treasures Program of the National Park Service.
AAA.brynne01
https://n2t.net/ark:/65665/mw95c304fce-983c-4d4f-95d4-8c5bfadff677
ead_collection:sova-aaa-brynne01
Domenico Facci papers
Facci, Domenico, 1916-1994 Search this
American Society of Contemporary Artists (New York, N.Y.) Search this
Artists Equity Association Search this
Audubon Artists (New York, N.Y.) Search this
National Sculpture Society (U.S.) Search this
Olympic Games (24th : 1988 : Seoul, Korea) Search this
United States. Department of the Treasury Search this
Brooklyn Bridge (New York, N.Y.)
BuschGardens (Williamsburg, Va.)
The Domenico Facci papers are dated 1914 to 1995, with the bulk falling between the years 1950 and 1984. They measure 1.2 linear feet and consist of biographical material, correspondence, artwork relating to sculpture projects, printed material, and photographs. Among the well-documented aspects of Facci's professional career are: his leadership roles in several arts organizations based in New York City, including Audubon Artists, National Sculpture Society, and Artists Equity Association; his work on the United States Treasury's 1988 Olympic Games commemorative coin competition, Brooklyn Bridge 100th Anniversary reliefs, Endangered Species Medal, and Neptune Fountain at Busch Gardens in Williamsburg, VA.
Scope and Content Note:
The Domenico Facci papers are dated 1914 to 1995, with the bulk falling between the years 1950 and 1984. They measure 1.2 linear feet and consist of biographical material, correspondence, artwork relating to sculpture projects, printed material, and photographs. Among the well-documented aspects of Facci's professional career are: his leadership rolses in several arts organizations based in New York City, including Audubon Artists, National Sculpture Society, and Artists Equity Association; his work on the United States Treasury's 1988 Olympic Games commemorative coin competition, Brooklyn Bridge 100th Anniversary reliefs, Endangered Species Medal, and Neptune Fountain at Busch Gardens in Williamsburg, VA.
Biographical material consists of artist's statements; marriage, academic, and military service records; awards; and membership cards and certificates. Correspondence consists mainly of incoming letters related to Facci's activities with arts organizations, among them Audubon Artists, American Society of Contemporary Artists, the Village Art Center, Artists Equity Association, the National Sculpture Society, and Nippon Museum.
Artwork includes two sketchbooks - one for the 1988 Olympic Games commemorative coin competition, and another concerning the Endangered Species Medal. Also found are anatomical study drawings, blueprint plans for the Neptune Fountain project, and miscellaneous sketches.
Printed materials are newspaper clippings, newsletters, exhibition catalogs, programs, press releases, announcements, and brochures. The bulk of this series is comprised of exhibition catalogs from the Audubon Artists, Painters and Sculptors Society of New Jersey, National Arts Club, and National Sculpture Society.
Photographs are of Facci and his work, including completed pieces, the artist at work in his studio and presenting sculpture demonstrations.
The collection is arranged as 6 series:
Series 1: Biographical Material, 1914-1998 (Box 1; 0.1 linear ft.)
Series 2. Correspondence, 1954-1988 (Box 1; 0.3 linear ft.)
Series 3. Artwork, circa 1930-1985 (Box 1; OV 2-3; 0.3 linear ft.)
Series 4. Printed Material, 1933-1988 (Box 1; 0.3 linear ft.)
Series 5. Scrapbook, circa 1940-1985 (Box 1; 1 folder)
Series 6. Photographs, circa 1940-1985 (Box 1; 0.2 linear ft.)
Domenico Facci (1914-1994) worked in New York City and was known primarily for commissioned portraits and public sculpture, and for holding leadership positions in several arts organizations based in New York City.
Domenico (Aurelio) Facci was born to Antonio and Grace Facci in Hooversville, Pennsylvana. on February 2, 1916, where his father, Antonio, was a coal miner. His mother was Grace Facci. When he was 10, the family relocated to Brooklyn, New York.
Facci won a scholarship to Roerich Academy (Master Institute of United Arts) where he studied under Pietro Montana and Louis Slobodkin and graduated in 1936. In 1937 he opened his first studio on Fifth Avenue at 15th Street and was immediately commissioned to do several large pieces for the 1939 World's Fair.
Many public and private commissions were executed by Facci in the New York City area, among them: carvings on the tower façade of St. Thomas's church, St. Rita sculpture in Long Island City, lobby for American Express building, 100 feet of plaques on the Brooklyn Bridge walkway, and bronze sculptures for PS 147 in the Bronx. Facci was also awarded portrait commissions of eminent public figures including: Winston Churchill, Albert Einstein, Bob Hope, Lowell Thomas, James Kilpatrick, and Lynn Redgrave, some of which were executed on live television and at other events. Some important commissions in other locations were: a cartouche for bronze doors for St Peter's Cathedral, Philadelphia, PA; exterior bronze for the Court of Appeals Building, Annapolis, MD; St. Paul sculpture, Fredericksburg, MD; Eagle War Monument, Rome, NY; and St. John Divine in Sewanee, TN.
Facci was the recipient of numerous important awards, including the Proctor Award from the National Academy of Design, the Richards Award from the Allied Artists, and the Liskin Award from the Knickerbocker Artists. He was also elected a fellow of the National Sculpture Society. Solo exhibitions of Facci's work were presented at the Silvermine Guild of Artists and the Village Art Center. He participated in group shows at the Whitney Museum of American Art and the National Academy of Design, Jersey City. Facci exhibited annually at numerous New York artists organization, including the Village Art Center, Knickerbocker Artists, and at the Silvermine Guild.
Facci's work is included in the permanent collections of the Florida Southern College, in Lakeland, FL, the Norfolk Museum, VA, and the Polk Museum, FL.
As an active member of numerous professional artists organizations, Facci served as the president of the Village Art Center for a decade, president of the Audubon Artists for 11 years, and president of the American Society of Contemporary Artists. In addition, he was an officer in other organizations, including: Knickerbocker Artists, Allied Artists, New Jersey Painters and Sculptors, National Sculpture Society, Silvermine Guild of Artists, New York Artists' Equity Association, Sculptors League, Salmagundi Club, National Academy of Design, and the American Society of Contemporary Artists.
In addition to his work as a sculptor, Facci was also a teacher. Between 1939 and 1972, he served on the faculty of City College of New York, the Academy of Art at Florida Southern College, Ridgewood Village Art School in New Jersey, and the Craft Student League in New York.
Domenico Facci was married to Penelope (Felicia/Penny) Facci and they had a son, Robert. Domenico Facci died on November 6, 1994.
Gift of Debby Friedman, 2010.
Use of original papers requires an appointment.
The Archives of American Art makes its archival collections available for non-commercial, educational and personal use unless restricted by copyright and/or donor restrictions, including but not limited to access and publication restrictions. AAA makes no representations concerning such rights and restrictions and it is the user's responsibility to determine whether rights or restrictions exist and to obtain any necessary permission to access, use, reproduce and publish the collections. Please refer to the Smithsonian's Terms of Use for additional information.
Artists' studios Search this
Art -- Economic aspects Search this
Sculptors -- New York (State) -- New York Search this
Medalists -- New York (State) -- New York Search this
Domenico Facci papers, 1914-1995. Archives of American Art, Smithsonian Institution.
AAA.faccdome
https://n2t.net/ark:/65665/mw9d46020fb-174d-469d-a24f-be153abc24fc
ead_collection:sova-aaa-faccdome
Include Term Exclude Term Sound recordings (1)
Include Term Exclude Term Electronic resource (1)
Include Term Exclude Term Awards (1)
Include Term Exclude Term Blueprints (1)
Include Term Exclude Term Interviews (1)
Include Term Exclude Term Pages (1)
Include Term Exclude Term Sketchbooks (1)
Include Term Exclude Term Art (1)
Include Term Exclude Term Artists' studios (1)
Include Term Exclude Term Decorative arts (1)
Include Term Exclude Term Illustrators (1)
Include Term Exclude Term Medalists (1)
Include Term Exclude Term Painters (1)
Include Term Exclude Term Printmakers (1)
Include Term Exclude Term Sculptors (1)
Include Term Exclude Term Women artists (1)
Include Term Exclude Term Women painters (1)
Include Term Exclude Term American Society of Contemporary Artists (New York, N.Y.) (1)
Include Term Exclude Term Artists Equity Association (1)
Include Term Exclude Term Audubon Artists (New York, N.Y.) (1)
Include Term Exclude Term Bergman, Franz (1)
Include Term Exclude Term Brynner, Irena (1)
Include Term Exclude Term Campbell, David Robert (1)
Include Term Exclude Term Craft Students League (1)
Include Term Exclude Term Daniels, Grete (1)
Include Term Exclude Term De Patta, Margaret (1)
Include Term Exclude Term Faber, Aaron (1)
Include Term Exclude Term Brooklyn Bridge (New York, N.Y.) (1)
Include Term Exclude Term BuschGardens (Williamsburg, Va.) (1)


320 nodes (1%) are attached to their parents as acl.
316 instances of acl (99%) are left-to-right (parent precedes child). Average distance between parent and child is 9.39375.
The following 20 pairs of parts of speech are connected with acl: NOUN-VERB (187; 58% instances), PROPN-VERB (39; 12% instances), VERB-VERB (26; 8% instances), NOUN-ADJ (21; 7% instances), PRON-VERB (13; 4% instances), NOUN-NOUN (9; 3% instances), PROPN-NOUN (8; 3% instances), ADJ-VERB (4; 1% instances), NUM-VERB (2; 1% instances), ADJ-ADJ (1; 0% instances), ADJ-NOUN (1; 0% instances), ADV-VERB (1; 0% instances), NOUN-DET (1; 0% instances), NOUN-PRON (1; 0% instances), NOUN-PROPN (1; 0% instances), PRON-ADJ (1; 0% instances), PRON-NOUN (1; 0% instances), PROPN-ADJ (1; 0% instances), VERB-NOUN (1; 0% instances), VERB-NUM (1; 0% instances).


For the past few months I have been absolutely obsessed with chambray tops. I own three of them at the moment and each time I spot one at the shops, I have to force myself to walk pass it and not purchase it.
The three that I own are of different shades and different details, which sets them apart from each other. What I appreciate about chambray shirts are the way they look like denim, but the material is a lot lighter, making it extra comfortable and less restrictive.
For this outfit, I paired my chambray with white pants and to make it less casual, I wore my black suede booties. I think the brown belt that I wore helped to pull the whole outfit together.
What do you think of this outfit? Also, which do you prefer, denim or chambray? Let me know your thoughts down below.
Thank you very much. I will look into it.


Straight male, 27. New to the city and very horny. Looking for a mouth to use. Where can I find some gloryholes in Chicago or in suburbs?
Hello! Which part of the city? Which direction for the near suburbs?
Hey Im in Skokie. Close by suburbs would be better but what places do you know that I could go to? Nearby and a little farther.
Hey man. On the north side of Chicago here.


Few records in the past couple of years hold up to the the bittersweet pang of Ultimate Painting's last album, Dusk. It was a study in melancholy wrapped in appropriately lush production and marked by the brushstrokes of two of indie's great new voices. The band now makes a jump from their home at Trouble in Mind to Bella Union and while the songwriting and production remains intimate and confessional, the tone takes a tip upward towards the light, as the album's title, Up! might attest. "Not Gonna Burn Myself Anymore" is haunted by all the familiar ghosts of Ultimate Painting's sound – wistful delivery, gently knotted guitars and a somber swoon that's tempered just a tad with Cooper's slight smile on the vocals. It's a promise to keep expectations in check and be a bit selfish for self-preservation's sake. For two musicians with busy schedule's its probably a hard pill to swallow but it comes together nicely on this first single.


text:
The Arctic Academic eTalks are an academically-focused, bimonthly forum for open discussion (non-attribution) on key issues affecting the Circumpolar Arctic for scholars and practitioners from Canada, Finland, Iceland, Kingdom of Denmark (Greenland and Faroe Islands), Norway, Sweden, and the United States. This discussion will allow for a more robust exploration into scholarly aspects of Arctic defence and security topics.
The Arctic Academic eTalks include alternating academic presentations and open discussions (beginning in May 2021) with invite-only activities (beginning in June 2021) in which experts will be asked to tackle specific challenge questions related to the Arctic information environment.
The Arctic Academic eTalks is a collaborative effort co-hosted by USNORTHCOM "The Watch" Command Magazine and the North American and Arctic Defence and Security Network (NAADSN). Our Global Partners include United States Northern Command (USNORTHCOM), United States European Command (USEUCOM), United States Indo-Pacific Command (USINDOPACOM).
The Arctic Academic eTalks partners are the core group of various representative geographic/institutional advisors. They help ensure the most appropriate balance of topics and ideas as well as recommendations on speakers. Partners include:
Center for Arctic Security and Resilience, University of Alaska Fairbanks
Defence Science and Technology Laboratory United Kingdom
George C. Marshall European Center for Security Studies
Joint Task Force North – Canadian Armed Forces
Ministry of Defence of the United Kingdom
Nassiffik – Centre for Foreign and Security Policy
NATO Strategic Communications Centre of Excellence
Norwegian Institute for Defence Studies
Norwegian Institute of International Affairs
Royal Danish Defence College
William J. Perry Center, National Defense University
Upcoming Arctic Academic eTalks
January 2022: Russian Arctic Militarization with presentations by Dr. Rob Huebert and Dr. Katarzyna Zysk. Register here
November 2021: Order, Security and Hybrid Threats to the Arctic with presentations by Dr. Rasmus Gjedssø Bertelsen and Dr. Gunhild Hoogensen Gjørv. The video is available here.
October 2021: Invite-only workshop
September 2021: China: Information and Influence with presentations by Dr. Camilla T.N.Sørensen and Dr. Marc Lanteigne. The video is available here.
August 2021: Invite-only workshop
July 2021: Geopolitics and Military Diplomacy in the Arctic with presentations by Dr. Andrea Charron and Dr. Joshua Tallis. The video is available here.
June 2021: Invite-only workshop – Expectations from the Russian Arctic Council Chairmanship, Arctic Academic eTalks Closed Session Report, June 2021
May 2021: Russian Chairmanship of the Arctic Council with presentations by Troy Bouffard and Dr. Malgorzata (Gosia) Smieszek The video is available here.
For more information on the Arctic eTalks series please visit the Center for Arctic Security and Resilience


text:
Editorial: So what does Cambridge do now?
It won't be long before the national media moves on from "Gatesgate," that otherwise uneventful July afternoon when a well-known, wealthy black professor met a working-class white police officer, creating a firestorm of debate throughout the country about race, class and police transparency and accountability. But none of this will disappear anytime soon for those who still live and work in Cambridge.
After all the TV satellite trucks move out of Cambridge, what happens?
It won't be long before the national media moves on from "Gatesgate," that otherwise uneventful July afternoon when a well-known, wealthy black professor met a working-class white police officer, creating a firestorm of debate throughout the country about race, class and police transparency and accountability. But none of this will disappear anytime soon for those who still live and work in Cambridge. That image of Harvard professor Henry Louis Gates Jr. being hauled away in handcuffs from his own Ware Street home is still fresh in the minds of many Americans. The image and stories behind that photo have polarized this diverse city and country, but those divisions were already there. They were there in the guise of town versus gown, rich versus poor, haves and have-nots, the elite and the regular folks. Some have suggested it was only Gates who injected race into this incident — the released 911 tapes make clear that witness Lucia Whalen never mentioned it — that socioeconomic forces were more at work than anything. But we can only speculate what Sgt. James Crowley was thinking when he met Gates on July 16. And we will never truly know what Gates, no doubt exhausted upon returning from China, was thinking when he saw the police show up at the door of his own home. In one week that contained a thousand twists, wall-to-wall TV coverage, multiple press conferences (here and in Washington) and, most recently, endless babble over which brand of beer should be served at the White House, Cambridge endured one emotional ride, and the city's image certainly suffered. So how do Cambridge residents pick themselves up, dust themselves off, learn from what the president called a "teachable moment" and work to make sure racial profiling — genuine or perceived — does not hang over the community? The Gates arrest review committee that City Manager Bob Healy and Commissioner Robert Haas announced this week is a good step forward, but there are still questions about what transpired that day. But it won't stop with a hand-picked committee and a determination about who's guilty or who's not. Mayor Denise Simmons has already said she'll host a second citywide forum on race and class in the early fall, another step because more dialogue isn't a bad thing. There needs to be more transparency from Hass and the Cambridge Police Department, which, even prior to the Gates arrest, was becoming less forthright in the release of public information. People need to talk to each other more. They need to go outside of their comfort zone, engage with neighbors they've never met. People need to cross not just racial and ethnic divides, but town and gown divisions as well. There must be more dialogue between the community and those Cambridge police officers, who risk their lives every day. Thursday's White House meeting between Crowley, Gates and President Obama can only help. But for those who live and work in Cambridge, it's going to require a whole lot more. Wicked Local Cambridge


text:
North AmericaUSASan FranciscoAttractions
Park in The Marina, Fisherman's Wharf & the Piers
Explore that splotch of green on the map between Baker Beach and Crissy Field and you'll find parade grounds, Yoda, a centuries-old adobe wall and some fascinating art projects. What started as a Spanish fort built by Ohlone conscripts in 1776 is now a treasure hunt of surprises. Begin your adventures at the Main Post to get trail maps at the visitor center and inquire about site-specific art installations by Andy Goldsworthy.
Private Tour of San Francisco
Private City Tour of San Francisco
Vampire Tour of San Francisco
Hoursdawn-dusk
Brush up on your history at the free, renovated Spanish-Moorish Officers' Club, which dates from the late 1700s and now hosts a small museum of local history, plus a lovely club lounge and restaurant. Fans of Mickey Mouse head to the Disney Museum; while fans of the macabre hike directly to the Pet Cemetery off Crissy Field Ave, where handmade tombstones mark the final resting places of military hamsters. Head east of the parade grounds toward the Palace of Fine Arts and you'll come across the Letterman Campus, home to nonprofits and Star Wars filmmaker George Lucas, whose offices require a special pass – but you can pay your respects to the Yoda statue out front. Thursday evenings, spring through fall, Off the Grid sets up food trucks at the Main Post, creating a giant party on the grass.
14 days • Los Angeles to Los Angeles


Can't get this Upgrade in stores. In the future, technology is intertwined heavily with the average human life. Anything from cars to drones to cooking is automated and few think twice about it. One who does think about it is Grey (Logan Marshall-Green), a stay-at-home auto mechanic who keeps busy repairing and selling cars while his wife, Asha (Mellanie Vallejo) brings home the bacon.
The couple are in good spirits after Grey sells one of his rides to Eron Keen (Harrison Gilbertson), the brilliant-yet-antisocial owner of Vessel, a tech company poised to redefine technology with STEM, an implanted device that can control the entire body. On the way home, Grey and Asha are attacked by hired thugs, and the aftermath leaves Grey completely paralyzed. Tired of being unable to live without basic functions, Grey takes Keen on his offer to implant STEM to give him walking capabilities again. That he does, and he immediately begins to exact revenge on those who took away everything, while fighting back against his new body and mind.
A combination of RoboCop, Blade Runner, Dredd, and Death Wish (among other movies) is Upgrade, a futuristic, vengeance-driven film from the mind of Leigh Whannell. Along with James Wan, the man behind two of the most well-known franchises in Saw and Insidious tries his hand again at horror, this time in the realm of body horror. Crossing over many genres, actually, Upgrade's innards aren't exactly high-quality, but their quality is good enough to make for a fun view.
The Internet's had the Upgrade comparisons to some upcoming movie called Venom locked and loaded since the first trailer dropped for the former. And, they are there in more ways than one; sub the symbiote for STEM and modern day for the future. Long way of saying Whannell's script is perfectly fine and really doesn't say anything other science-fiction movies haven't done better and stronger than Upgrade does (the technology overtaking its creators and hosts is an age-old theme, but one that can still feel profound and new in the right hands), though Whannell's feature probably fits better as an actioner/horror than a thought-provoking sci-fi.
Once Upgrade introduces STEM (voiced by Simon Maiden) as a co-starring character, the film finds its tone as a campy, pulpy, light neo-noir feature. Outside of one instance, Whannell's scenes of action are unique, mechanical, über-violent, unpredictable, and satisfying as they are set to the rhythm of composer Jed Palmer's score. However, STEM is not only around to deliver payback. He's also the comic foil, delivering super-dry, straight-laced dialogue to contrast with some of the bloody moments.
STEM, along with the "discount Tom Hardy," give Upgrade sentience. Tagging the lookalike Logan Marshall-Green the discount moniker is funny but subtly implies LMG is lesser in talent than he is. This is a tough role especially from a physical standpoint, but Marshall-Green pulls it off with confidence and charisma, akin to Peter Weller in 1987. His interplay with STEM is almost always entertaining. The movie's about them and their evolving/devolving relationship, but it would have been nice if any of the other characters and cast members made a lasting impression. Fact is, they are means to an end (a great ending, but still just means) and are forgettable from that standpoint. On a $3 million budget, Whannell gets the most out of it from everywhere except the cast. Nowhere is this more disappointing than for Betty Gabriel, one of two scene-stealers in Get Out who is reduced to a dull, stock police officer with no personality. Anyone could have played this role.
Augmented with pieces from many genres, Upgrade isn't a clear level above most of the films it is inspired by, but that doesn't stop it from becoming another notch in the successful filmography of Blumhouse Productions. More than the sum of its parts? Certainly.
Photo credits go to GQ.com, slashfilm.com, and IMDB.com.


The Blue Heron Gallery is going back on the road very soon for the annual fall roundup. Please drop by one of the upcoming shows, come by and take a look at the material and just say howdy. The Hillsborough Show is now under the management of Dolphin Productions, completely redesigned and should be both good and newly invigorated.
I will be splitting a booth at the Palm Springs Show with Steve Stoops from Phoenix's Stevens Fine Art. We did quite well there last year and hopefully this new location will be even better! Please spread the word.
Golden West Show – Glendale ?
As usual the Fallbrook gallery will be available to visit in the in between times by chance or appointment. Please contact me at your convenience at 760-731-9355 or by cell at 760-445-0595.


text:
DID L'il Masters Season 3 – Starts 1st March 2014 at 9 PM On Zee TV
18 December 2020 20 February 2014 by Anish K.S
DID L'il Masters Season 3 On Zee TV
DID L'il Masters Season 3
The auditions of DID L'il Masters Season 3 had loads of shocking moments for judges Geeta Kapoor, Ahmad Khan and Mudassar Khan. While the kids surprised the judges with their dancing prowess, their back-stories were nothing short of being extraordinary.
One such talent that left the judges speechless was little wonder – Nishkarsh Dixit from Delhi. All of 7 years of age, Nishkarsh entered the audition hall holding his mother's hand. With utmost innocence and a sincerity on his face, Nishkarsh gave his hundred percent. Dancing with all his might, the judges mistook Nishkarsh's perfection, grace and style and thought that it was a girl performing! Shocked after discovering that he is actually a boy, the judges asked him if he has been trained professionally to be dancing with so much grace! To which little Nishkarsh said, "I am a huge Madhuri Dixit fan and want to grow up and match steps with her.
DanceIndiaDance Contestants
I love dressing up like a girl and have learnt laavani and know contemporary and Bollywood dance styles as well. My mother supports me in all that I do, but it is just my father who does not approve of my passion for dance." Listening to Nishkarsh's story, the judges were all glad to learn that Nishkarsh has full support of his mother and hence got a chance to audition on this coveted platform.
With dreams in his little eyes, Nishkarsh hopes to share the stage with Madhuri someday. However, as he enters the competition, only time will tell if this boy who is misunderstood to be a girl will end up being a part of the Top 18 finalists in this season of DID L'il Masters.
Categories Hindi Television News, Zee Network Tags Zee TV
Shah Rukh Khan Turns Magician at Lux Cozi Zee Cine Awards 2014
Yeh Rishta Kya Kahlata Hai On Star Plus – Episode Synopsis


Squid & Oyster Dissections...It's almost like being there!
Dead zones are predicted to be HUGE this year!!!
Click on the picture to read what scientists say could be the worst year ever!
Notes on Module 6: coral reefs, mollusks, giant squid, estuaries, mangroves, the problem with too many nutrients.
Zone 1: Reef Flat The first region slopes almost imperceptibly down from the shore-line. This sandy expanse is frequently covered with turtle grass and usually ends in a fringing reef made up of elkhorn or staghorn corals with small coral heads. Some species of sharks frequent this area. The fringing reef protects the lagoon from the wave action of the ocean.
Zone 4: Sub-Terrace Some outer reefs have flattened terraces that interrupt the gradient of the reef slope. Stout fire coral and fishes that prefer areas of rich coral growth, like angelfish, and a wide variety of smaller fish depend on the nooks and crannies of the coral to hide.
Zone 5: Reef Slope, also known as the wall. Descending the slope, we find corals continue to expand horizontally in shape in order to capture as much sunlight as possible. In this zone we often find stout brain corals, and seafans which are able to withstand the wave surge and strong currents which characterize this area.
Zone 6: Drop-off On many reefs the reef slope may suddenly drop off, forming a nearly vertical wall. At depths below 180 feet, the overlying water reduces the amount of light so much that few sunlight-dependent hard corals can survive. In these dim, quiet waters the delicate corals not dependent upon photosynthesis become common. Free from the competition of zooxanthellae-based corals which dominate the waters above, fragile lace corals send out thin branches to trap plankton.
6.06 Mollusk Lab - This lab consists of three parts. The first part is the oyster lab. Use the link and answer the questions. (Note: some of the numbered steps are not questions, they're instructions. Just skip those.) The second part is the squid lab. Use the link, roll your cursor over the picture, and list the numbered parts. The third part is the answers to the analysis questions.
If you would like to obtain a specimen and do the dissection/identification yourself, be sure to include a photo for extra credit.
6.06 In Search of the Giant Squid – This is one of my favorite assignments to grade. Be creative and have fun learning about this fascinating creature! I expect to see lots of information and visuals.
6.12 Too Much of a Good Thing – This is a tremendously important topic, and very relevant, because it's about how 'dead zones' are created and we have three of them in the Gulf of Mexico! Be sure you understand the chain of events that starts with algae blooms and ends with oxygen-depleted dead zones where marine animals cannot live.
For this activity you are doing two things: first, read and take notes about dead zones (click on the dead zone link) and how they're caused.
Click on "The Ladder" and copy and paste the ladder into a word document so you can fill it out. List the four steps that lead to the creation of a dead zone.
Then, using what you know, pretend you're writing a newspaper article about the Gulf of Mexico or the Florida Keys, and how the dead zones there have been created. Be sure to read the lesson instructions that tell you what must be included in your article!
NOTE: you may have to download QuickTime 7 to view these movies, but it's free.
This is a 4 minute movie on the Florida Everglades - an important estuary!
Review Games to prepare for the module quiz!!
Play scatter and space race to prepare for the quiz.
A fun book full of tall tales…are they true, or not?