The article examines the works of nature writer Jaromír Tomeček, his public image, and his reception by literary theory and criticism as a distinctive late socialist response to environmental concerns. The article argues that the “ecological techno-optimism” of Jaromír Tomeček was representative of the late socialist reconsideration of human-nature relations that rejected the earlier modern understanding of humans as masters of nature and tried to find a new harmony between the two, but that also rejected the “pessimistic” perspective of Western ecology. Revising the tradition of socialist realism, late socialist literature allowed for sorrow over loss (“a right to sadness”) while still giving primacy to joy over progress, negating the “existential despair” of the 1960s. It thus preserved the progressive temporal orientation tied to the socialist ideal of increasing material wellbeing while trying to reconcile technocratic rationality with romantic subjectivity. “Ecological techno-optimism” eventually materialized in the form of the nuclear energy programme as the solution to the ecological crisis.
The galactic plane has been sampled at 5´ spacing between l = 38° and J = 1-0 line of 13CO with the 2.5 m telescope of the Bordeaux Observatory. An automatic analysis of the data gives 181 clouds with masses ranging from a few solar msses to a few 10^5 M. Two spirals at liast can be fitted to our data.
Archaeological evidence shows that Paleolithic hunters occasionally used the difficult-to-access Pod Hradem Cave for short-term visits. The small collection of artefacts spanning a c. 15,000-year period were made from a range of different raw materials collected from known sources in the surrounding regions up to 120 km away. In this paper, we interpret the sum of the archaeological evidence associated with artefacts from Pod Hradem Cave against an updated chronology, and report a previously unpublished stone artefact. Combined, this information suggests variable cave use throughout the site history. During the Early-Upper Paleolithic this likely involved visits by small, mobile bands using Pod Hradem Cave as a short stop over while passing through the Pustý Žleb valley.
Decomposable (probabilistic) models are log-linear models generated by acyclic hypergraphs, and a number of nice properties enjoyed by them are known. In many applications the following selection problem naturally arises: given a probability distribution p over a finite set V of n discrete variables and a positive integer k, find a decomposable model with tree-width k that best fits p. If H is the generating hypergraph of a decomposable model and pH is the estimate of p under the model, we can measure the closeness of pH to p by the information divergence D(p:pH), so that the problem above reads: given p and k, find an acyclic, connected hypergraph H of tree-width k such that D(p:pH) is minimum. It is well-known that this problem is NP-hard. However, for k=1 it was solved by Chow and Liu in a very efficient way; thus, starting from an optimal Chow-Liu solution, a few forward-selection procedures have been proposed with the aim at finding a `good' solution for an arbitrary k. We propose a backward-selection procedure which starts from the (trivial) optimal solution for k=n−1, and we show that, in a study case taken from literature, our procedure succeeds in finding an optimal solution for every k.
.