Filtyp
Expansive cements are utilised in special applications to improve properties such as cracking caused by drying shrinkage. Several types of expansive cements exist and the main hydration product responsible for the expansion is ettringite, [Ca3Al(OH)6]2(SO4)3·26H 2O. The importance of the cement phase containing alumina is well known
Co-citation analysis has been widely accepted as the foremost method for bibliometric mapping of research fields, whereas analyses based on keywords has been discussed, without gaining any overall acceptance. There is, however advantages with keywords, such as being understandable by others than those immediately connected to the field analyzed. This study aims at testing the relation between keyw
After stating that there did exist an early Christ-believing movement in the first century CE, distinct enough to be investigated, the chapter gives a review of recent scholarly approaches to what "Christian identity" is. Answers range from a textual reality only, to an ideological construct, or rhetorical construction with social effectiveness, or an autonomous inner structure of the semiotic sys
The xylose-fermenting capacity of recombinant Saccharomyces cerevisiae carrying XYL1 and XYL2 from Pichia stipitis, which encode xylose reductase (XR) and xylitol dehydrogenase (XDH), respectively, is poor due to high xylitol formation. Whereas, P. stipitis exhibits high ethanol yield on xylose, the tolerance towards inhibitors in the lignocellulosic hydrolysate is low. A recombinant strain posses
Geometric hashing is a fast, but noise sensitive, method for doing matching of points in images with points in a model database. Here the noise is taken into account, and improvements to the method is proposed
In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighborhoods, with totally n ver-tices, and we seek the shortest tour that visits each neighborhood. TheEuclidean TSP is a special case of the TSPN problem, so TSPN is alsoNP-hard. In this paper we present a simple and fast algorithm that, givena start point, computes a TSPN tour of length O(log k) times
