Abstract: The invention relates to a catalyst composition comprising a salt of a non- or weakly coordinating anion, said non- or weakly coordinating anion comprising at least one metal or metalloid ion M with valency v+, v representing an integer between 1 and 5, and at least one bidentate ligand coordinating to this metal or metalloid ion, and a catalyst that can be activated by said non- or weakly coordinating anion, characterized in that said bidentate ligand is a bidentate monoanionic ligand of formula (I): (R1qA1-X-A2R2r), wherein X represents a bridging moiety; A1 and A2 are each independently chosen from the group comprising N, O, P, S, and C; R1 and R2 are each independently chosen from the group comprising an optionally substituted linear or branched (hetero)alkyl group, an optionally substituted (hetero)aryl group, and a Si containing group; and q and r each independently represent an integer with 0?q, r?2.

Abstract: The present invention relates to means and a method executable by a computer system for navigation within a tree structure with leaf nodes representing arbitrary types of objects, i.e. of related data treated as a unit. According to the current teaching a travel point representation step is suggested, wherein after selection of at least one non-leaf node as travel point only the path and non-leaf nodes in said tree structure from said travel point to the root of said tree structure is represented in a tree view area. Moreover the complete sub-tree of said travel point is represented in said tree view area. In addition or alternatively after selection of said travel point, a travel box is represented for said travel point, said travel box representing object identifications of all objects of all leaf nodes in said sub tree of said travel point.

Abstract: This mechanism relates to a method within the area of information mining within a multitude of documents stored on computer systems. More particularly, this mechanism relates to a computerized method of generating a content taxonomy of a multitude of electronic documents. The technique proposed by the current invention is able to improve at the same time the scalability and the coherence and selectivity of taxonomy generation. The fundamental approach of the current invention comprises a subset selection step, wherein a subset of a multitude of documents is being selected. In a taxonomy generation step a taxonomy is generated for that selected subset of documents, the taxonomy being a tree structured taxonomy hierarchy. Moreover this method comprises a routing selection step assigning each unprocessed document to the taxonomy hierarchy based on largest similarity.