Rheumatoid arthritis (RA) and its animal model adjuvant arthritis (AA) are inflammatory diseases characterized by chronic inflammation, systemic oxidative stress and disturbed mitochondrial bioenergetics of skeletal muscle. The present study aimed to evaluate the effects of coenzyme Q10 - CoQ10 (100 mg/kg b.w.), omega-3-polyunsaturated fatty acids - ω-3-PUFA (400 mg/kg b.w.) and their combined treatment in AA on impaired skeletal muscle mitochondrial bioenergetics, inflammation and changes in levels CoQ9 and CoQ10 in plasma. Markers of inflammation (C-reactive protein, monocytechemotactic protein-1), antioxidant capacity of plasma, respiratory chain parameters of skeletal muscle mitochondria and concentrations of CoQ9 and CoQ10 in plasma and in muscle tissue were estimated. Treatment of the arthritic rats with CoQ10, ω-3-PUFA alone and in combination partially reduced markers of inflammation and increased antioxidant capacity of plasma, significantly increased concentrations of coenzyme Q in mitochondria and improved mitochondrial function in the skeletal muscle. Combined treatment has similar effect on the mitochondrial function as monotherapies; however, it has affected inflammation and antioxidant status more intensively than monotherapies. Long-term supplementary administration of coenzyme Q10 and ω-3-PUFA and especially their combination is able to restore the impaired mitochondrial bioenergetics and antioxidant status in AA., Jarmila Kucharská, Silvester Poništ, Oľga Vančová, Anna Gvozdjáková, Oľga Uličná, Lukáš Slovák, Mohsen Taghdisiesfejir, Katarína Bauerová., and Obsahuje bibliografii
In probability theory, Bayesian statistics, artificial intelligence and database theory the minimum cross-entropy principle is often used to estimate a distribution with a given set P of marginal distributions under the proportionality assumption with respect to a given "prior'' distribution q. Such an estimation problem admits a solution if and only if there exists an extension of P that is dominated by q. In this paper we consider the case that q is not given explicitly, but is specified as the maximum-entropy extension of an auxiliary set Q of distributions. There are three problems that naturally arise: (1) the existence of an extension of a distribution set (such as P and Q), (2) the existence of an extension of P that is dominated by the maximum entropy extension of Q, (3) the numeric computation of the minimum cross-entropy extension of P with respect to the maximum entropy extension of Q. In the spirit of a divide-and-conquer approach, we prove that, for each of the three above-mentioned problems, the global solution can be easily obtained by combining the solutions to subproblems defined at node level of a suitable tree.
Bats occupy a variety of natural and artificial diurnal roosts. These environments offer several advantages for bats, among which we highlight the relative climatic stability, darkness, and protection from predators. The aim of this study was to identify and describe the use of tree hollows as natural diurnal roosts by Molossops temminckii, Molossus rufus, Artibeus planirostris and Sturnira lilium in southeastern Brazil. In the first one, we sought to describe the physical characteristics of shelters. In the second objective, we determined the number of individuals in the colonies and, we described and classified the posture adopted by bats within cavities. In the
third objective, we seek to relate the physical characteristics of refuges with the foraging behavior and diet of bat species. Moreover, we also discussed the advantages and disadvantages that tree cavities may confer for bats, in the context of approximation of opportunistic predators. We found four colonies, one of each species, which roosted within tree trunk cavities. In general, the colonies were small, with less than 10 individuals of both sexes. Usually the molossids left the roost at dusk, while phyllostomids left later, around three hours after dusk. Individuals of the first three species were recaptured while foraging near the roosts. We believe (through observations) that the location in the landscape and the physical characteristics (dimensions of access to the cavities and height from the ground) of shelters used by bats, depend exclusively on the morphology, foraging behaviour and diet of each species of bat. Furthermore, this
study contributes to an increase of knowledge about the natural history of Neotropical bats, which can provide relevant information for conservation.
A new kind of a deterministic pushdown automaton, called a \emph{Tree Compression Automaton}, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with n nodes, the automaton has at most n+1 states, its transition function cardinality is at most 4n and there are 2n+1 pushdown store symbols. If hashing is used for storing automaton's transitions, thus removing a factor of logn, the construction of the automaton takes linear time and space with respect to the length n of the input tree(s). Our pushdown automaton construction can also be used for finding all subtree repeats without augmenting the overall complexity.
In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree expression. First we construct a special tree automaton for the regular tree expression of the pattern E, which is somehow a generalization of Thompson automaton for strings. Then we run the constructed automaton on the subject tree t. The pattern matching algorithm requires an O(|t||E|) time complexity, where |t| is the number of nodes of t and |E| is the size of the regular tree expression E. The novelty of this contribution besides the low time complexity is that the set of patterns can be infinite, since we use regular tree expressions to represent patterns.
First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable languages. In addition, it places a binary-relation-based restriction upon these grammars and demonstrate that this additional restriction does not affect the generative power of these grammars.
Treex::Web is a web frontend for running Treex applications from your browser.
Treex (formerly TectoMT) is a highly modular NLP framework implemented in Perl programming language. It is primarily aimed at Machine Translation, making use of the ideas and technology created during the Prague Dependency Treebank project.