Abstract: The invention relates to a method for preparing a hydrogenation catalyst or catalyst precursor comprising a catalytically active material and a carrier material. The method involves the mixing of an acidic solution comprising metal ions of a metal selected from the IUPAC group 8, 9 or 10 metals, preferably cobalt, a suspension comprising the carrier material and an alkaline solution. The invention also relates to a precursor of a hydrogenation catalyst wherein the precursor comprises crystallites of metal oxides having an average size of max. 8 nm.

Abstract: The invention relates to a method for preparing a catalyst or catalyst precursor comprising a catalytically active material and a carrier material. The invention relates to a catalyst particle and catalyst precursor thereof obtainable by said method. The catalyst may be used in a process for synthesising hydrocarbons.

Abstract: The invention relates to a method for preparing a hydrogenation catalyst or catalyst precursor comprising a catalytically active material and a carrier material. The method involves the mixing of an acidic solution comprising metal ions of a metal selected from the IUPAC group 8, 9 or 10 metals, preferably cobalt, a suspension comprising the carrier material and an alkaline solution. The invention also relates to a precursor of a hydrogenation catalyst wherein the precursor comprises crystallites of metal oxides having an average size of max. 8 nm.

Abstract: The invention relates to a method for preparing a catalyst or catalyst precursor comprising a catalytically active material and a carrier material. The invention relates to a catalyst particle and catalyst precursor thereof obtainable by said method. The catalyst may be used in a process for synthesising hydrocarbons.

Abstract: A method to at least one of compress and decompress data includes providing a string (T) consisting of multiple given substrings. Identification symbols ($,$1,$2,$3) are assigned to the substrings of the string (T). The substrings of the string (T) are transferred by permutation into a permuted string (O(T),O*(T)). The permuted string (O(T),O*(T)) is sorted into a sorted permuted string (oSort(T), oSort*(T)) according to a given sorting criterion. The identification symbols ($,$1,$2,$3) are permuted and sorted together with the substrings of the sting (T) so that, in a partial inverse transformation step, characters of an Nth substring are sequentially determined within the permuted string (O(T),O*(T)) after determining a position (P) of an Nth identification symbol ($,$1,$2,$3) assigned to an Nth substring within the sorted permuted string (oSort(T),oSort*(T)) without reading characters of other substrings of the permuted string (O(T),O*(T)).

Abstract: A method to at least one of compress and decompress data includes providing a string (T) consisting of multiple given substrings. Identification symbols ($,$1,$2,$3) are assigned to the substrings of the string (T). The substrings of the string (T) are transferred by permutation into a permuted string (O(T),O*(T)). The permuted string (O(T),O*(T)) is sorted into a sorted permuted string (oSort(T), oSort*(T)) according to a given sorting criterion. The identification symbols ($,$1,$2,$3) are permuted and sorted together with the substrings of the sting (T) so that, in a partial inverse transformation step, characters of an Nth substring are sequentially determined within the permuted string (O(T),O*(T)) after determining a position (P) of an Nth identification symbol ($,$1,$2,$3) assigned to an Nth substring within the sorted permuted string (oSort(T),oSort*(T)) without reading characters of other substrings of the permuted string (O(T),O*(T)).