Works of adhesion at the carbon fiber-liquid interface determined using a modified wetting technique

Works of adhesion W_SL between aqueous solutions with pH values in the range from 1 to 14 and carbon fibers from different sources, which were additionally treated in an inert atmosphere or in oxygen, were measured by use of a microbalance. These works of adhesion W_SL were found to show distinct stepwise dependencies on the pH value. The works of adhesion W_SL are attributed to dispersion interactions W_SL¹ and various acid-base interactions w_sl^ab—in the latter case between the acidic and basic surface groups of carbon and the various basic and acidic aqueous solutions.     

Modified CIELAB formula tested using a textile pass/fail data set

The proposed new color-difference formula of CIE TC 129, which is a modified version of CIELAB, was tested with a recently published data set of textile pass/fail judgments. Goodness of fit is improved, if the parameter of lightness is set near 2, and if, additionally, a weight function for lightness is defined that reduces the weight of a lightness difference with lightness level in relation to chroma or hue scaling. © 1994 John Wiley & Sons, Inc.     

CORDIS无机粘结剂的特性与试验

介绍了德国HA公司最新研制的CORDIS无机粘结剂的组成与性能以及应用中的问题。     

The participation of soluble factors in the ω-oxidation of fatty acids in the liver of the sheep

The removal of soluble components from an ovine hepatic microsomal preparation decreased the ω-hydroxylation of dodecanoic and hexadecanoic acids. The results suggest that one or more soluble components play a role in the microsomal ω-hydroxylation of fatty acids. The possible roles in the reaction of catalase (known to stimulate the microsomal desaturations of fatty acids and alkylglycerols) and superoxide dismutase were investigated. The addition of these enzymes to the complete (but not the washed) microsomal preparation stimulated both the initial ω-hydroxylation reaction and the subsequent dehydrogenation reactions of the ω-oxidation pathway. The similarity of the effects of catalase and superoxide dismutase and stimulation of two different steps of the ω-oxidation pathway suggest that these agents are acting indirectly by removing active oxygen species rather than directly on the enzymes of microsomal fatty acid ω-hydroxylation.     

Zur kinetik der acrylnitril-polymerisation

The heterogeneous bulk polymerization of acrylonitrile initiated by AIBN has been studied by means of an improved dilatometric technique and a new method of analysis, where the initial reaction rate (v_w)₀ results from the intercept of a straight line in a \documentclass{article}\pagestyle{empty}\begin{document}$ \frac {\ln \left( 1 \hbox{---} {\rm U} \right)} {{\rm e}^{{- 0,5} {\rm k}_{\rm s}{\rm t} \hbox{---} 1}}$\end{document} versus t plot. It has been found that the initial reaction rate is proportional to the square root of the initial catalyst concentration S₀. The ratio of the rate coefficients of propagation and termination\documentclass{article}\pagestyle{empty}\begin{document}$\frac { {\rm k}_{\rm a} } { {\rm k}_{ {\rm w}^{2} } } $\end{document} could be calculated from the slope of a straight line passing through the origin in a plot of (v_w)₀ versus \documentclass{article}\pagestyle{empty}\begin{document}$\sqrt { {\rm S}_{0} }$\end{document} and yielded a value of 280 mol 1^?1.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92