CHAP and rewrite components

We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet ??, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet ??, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C.     

Intersection of finitely generated congruences over term algebra

We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that ↔_U^*=↔_R^*∩↔_S^*. If the answer is yes, then we can effectively construct such a ground term rewrite system U. In other words, for any given finitely generated congruences ρ and τ over the term algebra, it is decidable if ρ∩τ is a finitely generated congruence. If the answer is yes, then we can effectively construct a ground term rewrite system U such that ↔_U^*=ρ∩τ.     

Murg term rewrite systems

The union of a monadic and a right-ground term rewrite system is called a murg term rewrite system. We show that for murg TRSs the ground common ancestor problem is undecidable. We show that for a murg term rewrite system it is undecidable whether the set of descendants of a ground tree is a recognizable tree language. We show that it is undecidable whether a murg term rewrite system over Σ preserves Σ-recognizability.     

Effect of interesterified fat mixtures on certain lipid indices in experimental fat metabolism disturbance

Groups of adult Wistar male and female rats were fed isoenergetically for a three and a six weeks period either with synthetic lipogenic diet containing 5% and 20% fat mixtures (in which sunflower oil and lard were blended according to the ratio of 35:65) or with the same synthetic diet containing the mixture of sunflower oil and interesterified lard in a similar ratio. A control group received a normal diet for 6 weeks, whereas one of the experimental groups (fed with the 20% fat mixture in the lipogenic diet for 6 weeks) was given the normal diet for an additional two weeks period. After the feeding periods had been completed serum HDL-C levels and the total lipid, triglyceride, total cholesterol, free fatty acid levels were determined in serum and liver. The distribution of fatty acids in liver and heart muscle was also evaluated. In comparison to the control values it has been found: 1. Consumption of the lipogenic diet which is known to increase the serum total lipid and total cholesterol content induced in male rats a smaller augmentation in these indices when consuming the 20% fat mixture with a P/S ratio approaching the ideal 1 values, than in case of a 5% fat mixture consumption. In case of female rats, considerable increases of the serum values, could be observed at both fat consumption levels. The serum triglyceride and HDL-C contents decreased for all experimental groups. 2. The total lipid and triglyceride content of the liver increased in a high degree, the fatty liver syndrome was developed--more rapidly in males than in females. The total lipid, triglyceride and total cholesterol contents of the liver of male rats exceeded those of females by 15-30%. 3. The interesterification of the lard component of fat mixture resulted in lipid indices similar to those without interesterification, or in certain cases, they were found to be even slightly more favourable, i.e. the biological effect of the technological change proved to be adequate. 4. After a two weeks regeneration period the serum values of the male rats approached closer the normal control values than those of the females which were decreasing from a very high level but the degree of decrease was greater for them than for the male rats. The lipid content of the liver showed similar values.(ABSTRACT TRUNCATED AT 400 WORDS)     

Crystallization of an amorphous silicon nitride powder produced in a radiofrequency thermal plasma

Crystallization behavior of an amorphous silicon nitride powder produced in an RF thermal plasma by the vapor-phase reaction of silicon tetrachloride and ammonia has been investigated. Effects of annealing conditions such as temperature and duration of heat treatment on the properties of powders were studied. Changes in the chemical and phase compositions, as well as in the morphology of powders were measured and interpreted. Annealing of the amorphous silicon nitride powder at 1450°C for 120 min resulted in a powder of about 80% crystalline phase content with an /β ratio of about 6.5. ©     

Minimal equational representations of recognizable tree languages

 A tree language is congruential if it is the union of finitely many classes of a finitely generated congruence on the term algebra. It is well known that congruential tree languages are the same as recognizable tree languages. An equational representation is an ordered pair (E, P) , where E is either a ground term equation system or a ground term rewriting system, and P is a finite set of ground terms. We say that (E, P) represents the congruential tree language L which is the union of those ?^* _E -classes containing an element of P, i.e., for which L=⋃{[p]_? ^* _E ∣p∈P}. We define two sorts of minimality for equational representations. We introduce the cardinality vector (∣E∣, ∣P∣) of an equational representation (E, P). Let ? _l and ? _a denote the lexicographic and antilexicographic orders on the set of ordered pairs of nonnegative integers, respectively. Let L be a congruential tree language. An equational representation (E, P) of L with ? _l -minimal (? _a -minimal) cardinality vector is called ? _l -minimal (? _a -minimal). We compute, for an L given by a deterministic bottom-up tree automaton, both a ? _l -minimal and a ? _a -minimal equational representation of L. Received: 27 July 1994/5 October 1995