This study investigated the effects of artificial supercooling followed by still air freezing (SSF) on the qualities of pork loin. The qualities of pork frozen by SSF were compared with the fresh control (CT, stored at 4℃ for 24 h), slow freezing (SAF, still air freezing) and rapid freezing (EIF, ethanol immersion freezing) treatments. Compared with no supercooling phenomena of SAF and EIF, the...

BACKGROUND Great attention has been paid to the antioxidants present in farmed fish feeds, with the replacement of synthetic antioxidants by natural ones being a main objective. In the present study, Coho salmon (Oncorhynchus kisutch) was fed a conventional diet that was enriched with different kinds of antioxidants: synthetic antioxidants (butylated-hydroxy toluene and ethoxyquin; diet I), a t...

The effects of dietary supplementation of processed sulfur in pigs according to the level provided during the fattening phase were examined. The pigs were divided into three groups: control (CON), non-sulfur fed pigs; T1, 0.1% processed sulfur fed pigs; T2, 0.3% processed sulfur fed pigs. Physicochemical and sensory properties, as well as meat quality and oxidative stability of the Longissimus ...

There are properties of nite structures that are expressible with the use of Hilbert's-operator in a manner that does not depend on the actual interpretation for-terms, but not expressible in plain rst-order. This observation strengthens a corresponding result of Gurevich, concerning the invariant use of an auxiliary ordering in rst-order logic over nite structures. The present result also impl...

Let B be a finite, core relational structure and let A be the algebra associated to B, i.e. whose terms are the operations on the universe of B that preserve the relations of B. We show that if A generates a so-called arithmetical variety then CSP(B), the constraint satisfaction problem associated to B, is solvable in Logspace; in fact ¬CSP(B) is expressible in symmetric Datalog. In particular,...

I prove that there are phonological patterns which are expressible by ordered rewrite rules but not by any Optimality Theoretic (OT) grammar whose constraint set contains only markedness constraints and single–state faithfulness constraints, i.e. faithfulness constraints that assign violation marks to pairs of single input–output segments in correspondence, with no reference to other segments i...

We de.ne a new logic-based query language, called DAC, which is an extension of Datalog. A DAC(w(n); h(n))(b(n))-program consists of a family of Datalog programs Pn such that w(n); h(n); b(n) bound the width of rules, the number of rules, and the recursion depth of any Pn, respectively. We exhibit queries which are not Datalog expressible but are DAC expressible. We also prove non-expressivenes...

In this paper, we propose an alternative notion, called weak forgetting, of forgetting a set of predicates in a first-order theory. One important feature of this new notion is that the result of weak forgetting is always first-order expressible. In contrast, this is not the case for the traditional notion of forgetting, called strong forgetting, introduced by Lin and Reiter. As a consequence, t...

We constructively prove that for every LTL formula φ, the smallest safety property containing the property expressed by φ is also expressible in LTL. It immediately follows that LTL admits the safety-liveness decomposition: any property expressed by an LTL formula is equivalent to the intersection of a safety property and a liveness property, both of them expressible in LTL. Our proof is based ...

We extend the approach to representation of partial information based on orderings on objects from sets to multisets. We characterize orderings arising under the closed-and the open-world assumptions and analyze their complexity. We prove that, in contrast to the set case, where orderings are rst-order deenable and are thus expressible in standard database query languages, the orderings on bags...