Preprinti (MII) / Preprints

Permanent URI for this collection

https://dspace-dev.lu.lv/handle/7/676

Browse

Browsing Preprinti (MII) / Preprints by Author "Ķikusts, Paulis"

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
  • Thumbnail Image
    Item
    How to draw combinatorial maps?
    (2013-01-31) Zeps, Dainis; Ķikusts, Paulis
    In this article we consider the combinatorial map (rendered by permutations) approach to graphs on surfaces and how between both could be establish some terminological uniformity in favor of combinatorial maps in the way rotations were set as fundamental structural elements, and other necessary notions were derived from them. We call this the rotational prevalence with respect to how to build a graph drawing environment. We deal here with simple operations of how to draw combinatorial maps and partial maps. One of our aims would be to advocate a wider use of combinatorial maps in the graph drawing applications. Besides, we advocate to use corners of halfedges where upon permutations act in place of halfedges.
  • Thumbnail Image
    Item
    Pikseļu formas jautājumi rastra attēlu reprezentācijai un apstrādei
    (2013-01-23) Freivalds, Kārlis; Ķikusts, Paulis
  • Thumbnail Image
    Item
    Root cause analysis of large scale application testing results
    (2015-08-24) Opmanis, Rūdolfs; Ķikusts, Paulis; Opmanis, Mārtiņš
    In this paper we present a new root cause analysis algorithm for discovering the most likely causes of the differences found in testing results of two versions of the same software. The problematic points in test and environment attribute hierarchies are presented to the user in compact way which in turn allows to save time on test result processing. We have proven that for clearly separated problem causes our algorithm gives exact solution. Practical application of described method is discussed.