The binding of [3H]SCH 23390 has been studied in various brain regions of male mice with the experience of repeated victory (winners) or defeat (losers) gained over 10 (T10) and 20 (T20) days of daily agonistic confrontations. In the frontal cortex, Bmax of [3H]SCH 23390 binding sites was found to be increased in T10 losers and decreased in T20 losers when compared to the control mice. In the striatum, T10 and T20 winners had reduced values of [3H]SCH 23390 binding sites than the ones in the control mice. The Kd was increased in the frontal cortex of T10 losers and T10 winners as well as in the amygdala of T20 losers. Reduced Kd values were found in the striatum of all experimental groups as well as in the amygdala of T20 winners. Thus, both specific changes relating to social behavior patterns and non-specific ones in [3H]SCH 23390 binding were found in the brain regions of mice after 10 and 20 days of intermale confrontations., D. F. Avgustinovich, O. V. Alekseyenko., and Obsahuje bibliografii a bibliografické odkazy
The multicoloured Asian ladybird Harmonia axyridis is an invasive insect that can negatively influence biodiversity and human economy in invaded areas. According to the enemy release hypothesis, invasive alien species are often little affected by parasites and other enemies. We studied the prevalence of common parasites of insects infesting and infecting H. axyridis in NW Poland. A large sample of 2351 individuals was collected and divided into two groups: 1180 beetles were dissected and examined for the presence of eugregarines, nematodes and Laboulbeniales fungi, and 751 were checked for phoretic mites. Our results show that H. axyridis is indeed parasitized infrequently. The prevalence of eugregarines and nematodes was very low (1.5% and 0.4%, respectively). No specimens of Laboulbeniales or phoretic mites were found. Our study indicates that in NW Poland H. axyridis is rarely infested or infected by parasites. This paper reports for the first time the infection of H. axyridis by the eugregarine Gregarina barbarara., Kryzstof Dudek, Paweł Sienkiewicz, Dariusz J. Gwiazdowicz, Piotr Tryjanowski., and Obsahuje bibliografii
Isolation and characterisation of Plasmodium falciparum (Welch, 1897) soluble antigens from infected patient plasma, Western blotting, thermal stability and ELISA assays using hyperimmune IgG-antimalaria antibodies was the main objective of this work. A circulating antigen of approximately Mr 33-35 kDa with good specificity and antigenicity, in the plasma of malarial patients was shown. Heating at 100°C did not destroy its antigenicity. When fractions highly enriched in the 33-35 kDa proteins were used in ELISAs, a seroreactivity in plasma obtained from primary-infected individuals was found. Controls from normal patients were always negative. The antigenic characteristics suggest that it may be included within the group of new described Plasmodium soluble antigens.
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.
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.