It is a general problem to investigate the trade oo between the complexity of al-gorithmic problems, the structure of the input objects and the expressive power of problem description languages. The article concentrates on linear time algorithms and on rst order logic (FO) as problem description language. One of the main results is a proof that each FO-problem can be solved in linear time for a...

The aim of this study is to clarify the effects of yogurt supplemented with fish oil on plasma lipid and glucose concentrations, and hepatic lipid contents in mice. Male Crlj:CD-1 (ICR) mice were fed five experimental diets for 12 weeks. The experimental diets were as follows: without yogurt and fish oil (control diet); 10% (w/w) yogurt without fish oil [10% FO(-)]; 10% yogurt with fish oil [10...

OBJECTIVES The molecular and cellular mechanisms that fish oil (FO) exerts its physiological function are complicated. The present study brings evidence on the in vivo effect of FO on the development of atherosclerosis in apolipoprotein E knockout (apoE(-/-)) mice. We also test the hypothesis that the modulation of the cellular oxidative stress and antioxidant status contributes to the anti-ath...

We present BOAR, a forest-structured library of predeened Fragmented Objects (FOs) encapsulating commonly used distributed abstractions. We identify three kinds of interaction FO types (channel, sharing, and synchronization), which can be beneecially included in BOAR. A channel FO type encapsulates a remote or group invocation protocol. A sharing FO type encapsulates a sharing mechanisms such a...

We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a given formula. This is the logical task underlying many practical constraint languages and systems for representing and solving search problems, and our work is motivated by the need to provide theoretical foundations for these. We ...

We investigate the decidability and computational complexity of (deductive) conservative extensions in fragments of first-order logic (FO), with a focus on the two-variable fragment FO and the guarded fragment GF. We prove that conservative extensions are undecidable in any FO fragment that contains FO or GF (even the three-variable fragment thereof), and that they are decidable and 2ExpTime-co...