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.
.
A probabilistic communication structure considers the setting with communication restrictions in which each pair of players has a probability to communicate directly. In this paper, we consider a more general framework, called a probabilistic communication structure with fuzzy coalition, that allows any player to have a participation degree to cooperate within a coalition. A maximal product spanning tree, indicating a way of the greatest possibility to communicate among the players, is introduced where the unique path from one player to another is optimal. We present a feasible procedure to find the maximal product spanning trees. Furthermore, for games under this model, a new solution concept in terms of the average tree solution is proposed and axiomatized by defining a restricted game in Choquet integral form.
We present here a bibliometric analysis of publications on photosynthesis research from 1992 to 2009 in the Science Citation Index Expanded (SCI-Expanded) Web of Science. This has allowed us to examine the growing trends and the key topics on this subject. We have assessed the document type, language of the publications, publication output, subject category, journal distribution, countries and territories of these publications, institutions involved, hot topics and highly cited papers. The top 30 countries/territories were ranked according to their total number of articles (TA), single country articles (SCA), internationally collaborative articles (ICA), first author articles (FAA) and corresponding author articles (CAA). Research directions on the subject of photosynthesis were also investigated and evaluated by statistically analyzing the distribution of author keywords in the database. Our analysis indicates that “water”, “stress”, “carbon dioxide”, “nitrogen” and “climate change” are hot topics of research on photosynthesis during this period., J. J. Yu ... [et al.]., and Obsahuje bibliografii
In this paper, we study and characterize some properties of a given binary operation on a lattice. More specifically, we show necessary and sufficient conditions under which a binary operation on a lattice coincides with its meet (resp. its join) operation. Importantly, we construct two new posets based on a given binary operation on a lattice and investigate some cases that these two posets have a lattice structure. Moreover, we provide some representations of a given lattice based on these new constructed lattices.