K wie Kreis

Article for general public (2012)

K-Anonymity in Mobile Ad-Hoc Networks

Doctoral thesis (2010)

K-AP: Generating Specified K Clusters by Efficient Affinity Propagation

in ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining (2010)

The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers two major shortcomings: i) the ... [more ▼]

The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers two major shortcomings: i) the number of clusters is vague with the user-defined parameter called self-confidence, and ii) the quadratic computational complexity. When aiming at a given number of clusters due to prior knowledge, AP has to be launched many times until an appropriate setting of self-confidence is found. The re-launched AP increases the computational cost by one order of magnitude. In this paper, we propose an algorithm, called K-AP, to exploit the immediate results of K clusters by introducing a constraint in the process of message passing. Through theoretical analysis and experimental validation, K-AP was shown to be able to directly generate K clusters as user defined, with a negligible increase of computational cost compared to AP. In the meanwhile, KAP preserves the clustering quality as AP in terms of the distortion. K-AP is more effective than k-medoids w.r.t. the distortion minimization and higher clustering purity. [less ▲]

k-intolerant capacities and Choquet integrals

in European Journal of Operational Research (2007), 177(3), 1453-1468

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying ... [more ▼]

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation. We also introduce axiomatically indices to appraise the extent to which a given capacity is k-intolerant and we apply them on a particular recruiting problem. [less ▲]

k-intolerant capacities and Choquet integrals

in Klement, Erich Peter; Pap, Endre (Eds.) Proc. 25th Linz Seminar on Fuzzy Set Theory (LINZ 2004): Mathematics of Fuzzy Systems (2004, February)

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying ... [more ▼]

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation. [less ▲]

k-Metric antidimension: A privacy measure for social graphs

in Information Sciences (2016), 328

K-Ras Binds Calmodulin-Related Centrin1 with Potential Implications for K-Ras Driven Cancer Cell Stemness

in Cancers (2023)

Recent data suggest that K-Ras4B (hereafter K-Ras) can drive cancer cell stemness via calmodulin (CaM)-dependent, non-canonical Wnt-signalling. Here we examined whether another Ca2+-binding protein, the ... [more ▼]

Recent data suggest that K-Ras4B (hereafter K-Ras) can drive cancer cell stemness via calmodulin (CaM)-dependent, non-canonical Wnt-signalling. Here we examined whether another Ca2+-binding protein, the CaM-related centrin1, binds to K-Ras and could mediate some K-Ras functions that were previously ascribed to CaM. While CaM and centrin1 appear to distinguish between peptides that were derived from their classical targets, they both bind to K-Ras in cells. Cellular BRET- and immunoprecipitation data suggest that CaM engages more with K-Ras than centrin1 and that the interaction with the C-terminal membrane anchor of K-Ras is sufficient for this. Surprisingly, binding of neither K-Ras nor its membrane anchor alone to CaM or centrin1 is sensitive to inhibition of prenylation. In support of an involvement of the G-domain of K-Ras in cellular complexes with these Ca2+-binding proteins, we find that oncogenic K-RasG12V displays increased engagement with both CaM and centrin1. This is abrogated by addition of the D38A effector-site mutation, suggesting that K-RasG12V is held together with CaM or centrin1 in complexes with effectors. When treated with CaM inhibitors, the BRET-interaction of K-RasG12V with centrin1 was also disrupted in the low micromolar range, comparable to that with CaM. While CaM predominates in regulating functional membrane anchorage of K-Ras, it has a very similar co-distribution with centrin1 on mitotic organelles. Given these results, a significant overlap of the CaM- and centrin1-dependent functions of K-Ras is suggested. [less ▲]

K-Sorting with multiple ordinal criteria

Scientific Conference (2011, February 10)

Kaapi: A Thread Scheduling Runtime System for Data Flow Computations on Cluster of Multi-Processors

in PASCO '07 Proceedings of the 2007 international workshop on Parallel symbolic computation (2007, July)

Kafka für die Bühne. "Das Schloss" in der Dramatisierung von Max Brod

in Heimböckel, Dieter; Höhne, Steffen; Weinberg, Manfred (Eds.) Interkulturalität, Übersetzung, Literatur. Das Beispiel der Prager Moderne (2022)