physicochemical properties of surimi and kamaboko obtained of solubility in acid, alkaline and conventional methods were compared. the results indicated that the highest protein recovery was related to solubility in acid, alkaline and conventional methods, respectively. the highest removal of lipid and myoglobin was observed by solubility in alkali. excretion of total pigment and sulfhydryl gro...

A language (resp. a relation) is expressible by a word equation e if it is dened as the set of all values of an unknown (resp. a set of unknowns) over all solutions of the equation e. We show rst tools that a language or a relation is not expressible by using a certain number of auxiliary unknowns. As a consequence an in nite hierarchy based on the number of auxiliary unknowns of expressible la...

The purpose of this paper is to characterize when a harmonic function with values in the finite rank operators on a Hilbert space is expressible as a harmonic matrix-valued function. We show that harmonic function with values in the rank 1 normal operators is expressible as a harmonic matrix-valued function. We also prove that for any natural number, n, a harmonic function with values in the ra...

We exhibit a rst-order deenable picture language which we prove is not expressible by any star-free picture expression, i. e., it is not star-free. Thus rst-order logic over pictures is strictly more powerful than star-free picture expressions are. This is in sharp contrast with the situation with words: the well-known McNaughton-Papert theorem states that a word language is expressible by a rs...

In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a small, random sample of the structure. We focus on the classification of first-order sentences based on their quantifier prefixes and vocabulary into testable and untestable classes. This classification was begun by Alon et al...

form of Gödel’s first theorem: Let P be a set of Gödel numbers of all the provable sentences. If the set P̃∗ is expressible in L and L is correct, then there is a true sentence of L not provable in L. Proof: (based on [84]) Suppose L is correct and P̃ ∗ is expressible in L by a predicate H with Gödel number h. Let G be the diagonalization of H (i.e. the sentence H(h)). We show that G is true but ...

Property testing is essentially a kind of constant-time randomized approximation. Alon et al. [3] were the first to consider the idea of testing properties expressible in syntactic subclasses of first-order logic. They proved the testability of all properties of undirected, loop-free graphs expressible with quantifier prefix ∃∗∀∗, and also that there exist untestable properties of undirected, l...

We prove there is a strict hierarchy of expressive power according to the Until depth of linear temporal logic (TL) formulas: for each k, there is a very natural property that is not expressible with k nestings of Until operators, regardless of the number of applications of other operators, but is expressible by a formula with Until depth k + 1. Our proof uses a new Ehrenfeucht-Fraı̈ssé (EF) gam...

Studies were conducted to evaluate the effects of soy protein concentrate (SPC) and Xanthan gum (X) on physical properties of surimi prepared from Silver carp (Hypophthalmichthys molitrix) using various amount of soy protein concentrate (0, 5 and 10%) and xanthan gum (0, 0.25 and 0.5%) in fish paste during 3 months of frozen storage at -18ºC. Results obtained from folding test showed that the g...